| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 389655 | MilosMilutinovic | 괄호 문자열 (CEOI16_match) | C++14 | 1 ms | 204 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define N 100005
char s[N];
vector <int> pos[2];
bool valid(char* s)
{
int bal=0;
for(int i=0;i<strlen(s);i++)
{
if(s[i]=='(') bal++;
if(s[i]==')') bal--;
if(bal<0) return false;
}
return bal==0;
}
int main()
{
scanf("%s",&s);
int n=strlen(s);
for(int i=0;i<n;i++)
{
if(s[i]=='a') pos[0].push_back(i);
else pos[1].push_back(i);
}
if(pos[0].size()&1||pos[1].size()&1)
{
printf("-1");
return 0;
}
char ans[n];
int x=(int)pos[0].size(),y=(int)pos[1].size();
for(int i=0;i<x;i++)
{
if(i<x/2) ans[pos[0][i]]='(';
else ans[pos[0][i]]=')';
}
for(int i=0;i<y;i++)
{
if(i<y/2) ans[pos[1][i]]='(';
else ans[pos[1][i]]=')';
}
if(!valid(ans))
{
printf("-1");
return 0;
}
stack<int> st;
int matc[n];
for(int i=0;i<n;i++)
{
if(ans[i]=='(') st.push(i);
else
{
int j=st.top();
st.pop();
matc[j]=i;
matc[i]=j;
}
}
for(int i=0;i<n;i++)
{
if(s[i]!=s[matc[i]])
{
printf("-1");
return 0;
}
}
for(int i=0;i<n;i++) printf("%c",ans[i]);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
