# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48094 | 2018-05-10T04:51:24 Z | Extazy | Match (CEOI16_match) | C++17 | 2 ms | 376 KB |
#include <bits/stdc++.h> #define endl '\n' using namespace std; const int N = 100007; int n; char a[N],ans[N]; bool can(int l, int r) { stack < char > s; int i; for(i=l;i<=r;i++) { if(!s.empty() && s.top()==a[i]) s.pop(); else s.push(a[i]); } return s.empty(); } void solve(int l, int r) { if(l>r) return; if(a[l]==a[r]) { ans[l]='('; ans[r]=')'; solve(l+1,r-1); return; } int i,mid=(l+r)/2; stack < int > s; for(i=r;i>=l;i--) { if(!s.empty() && s.top()==a[i]) s.pop(); else s.push(a[i]); if(s.empty() && a[i-1]==a[l]) { ans[l]='('; ans[i-1]=')'; solve(l+1,i-2); solve(i+1,r-1); return; } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int i; scanf("%s", a+1); n=strlen(a+1); if(!can(1,n)) { printf("-1\n"); return 0; } solve(1,n); for(i=1;i<=n;i++) { printf("%c", ans[i]); } printf("\n"); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |