# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48095 | 2018-05-10T04:54:47 Z | Extazy | Match (CEOI16_match) | C++17 | 2 ms | 640 KB |
#include <bits/stdc++.h> #define endl '\n' using namespace std; const int N = 100007; int n; char a[N],ans[N]; int pos[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; } ans[pos[r]]='('; ans[r]=')'; solve(l,pos[r]-1); solve(pos[r]+1,r-1); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int i,where; scanf("%s", a+1); n=strlen(a+1); if(!can(1,n)) { printf("-1\n"); return 0; } pos[1]=0; for(i=2;i<=n;i++) { if(a[i]==a[i-1]) { pos[i]=i-1; } else { where=pos[i-1]-1; while(where) { if(a[i]==a[where]) pos[i]=where; break; where=pos[where-1]-1; } } } 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 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 452 KB | Output is correct |
3 | Correct | 2 ms | 528 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 452 KB | Output is correct |
3 | Correct | 2 ms | 528 KB | Output is correct |
4 | Incorrect | 2 ms | 640 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 452 KB | Output is correct |
3 | Correct | 2 ms | 528 KB | Output is correct |
4 | Incorrect | 2 ms | 640 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |