#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 100010, LOG=20;
int n, m, k, u, v, x, y, t, a, b;
int A[MAXN];
vector<int> vec[26];
char ans[MAXN];
string S;
bool check(int mask){
vector<int> stk;
for (int i=0; i<n; i++){
if (mask&(1<<(n-i-1))){
if (stk.empty() || S[stk.back()]!=S[i]) return 0;
debug2(S[stk.back()], S[i])
stk.pop_back();
}
else stk.pb(i);
}
return 1;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("match.in", "r", stdin);
//freopen("match.out", "w", stdout);
cin>>S;
n=S.size();
if (n&1) kill(-1)
for (int mask=0; mask<(1<<n); mask++) if (__builtin_popcount(mask)==n/2 && check(mask)){
for (int i=n-1; ~i; i--) cout<<(char)('('+((mask>>(i))&1));
return 0;
}
kill(-1)
return 0;
}
/*
abbabbaa
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
