# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48084 | 2018-05-10T04:17:36 Z | Extazy | Match (CEOI16_match) | C++17 | 2000 ms | 992 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; for(int i=r;i>=l;i--) { if(a[i]==a[l]) if(can(l+1,i-1) && can(i+1,r)) { solve(l+1,i-1); solve(i+1,r); ans[l]='('; ans[i]=')'; 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 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 488 KB | Output is correct |
3 | Correct | 2 ms | 600 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 488 KB | Output is correct |
3 | Correct | 2 ms | 600 KB | Output is correct |
4 | Correct | 4 ms | 600 KB | Output is correct |
5 | Correct | 3 ms | 684 KB | Output is correct |
6 | Correct | 5 ms | 684 KB | Output is correct |
7 | Correct | 22 ms | 684 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 488 KB | Output is correct |
3 | Correct | 2 ms | 600 KB | Output is correct |
4 | Correct | 4 ms | 600 KB | Output is correct |
5 | Correct | 3 ms | 684 KB | Output is correct |
6 | Correct | 5 ms | 684 KB | Output is correct |
7 | Correct | 22 ms | 684 KB | Output is correct |
8 | Correct | 214 ms | 796 KB | Output is correct |
9 | Execution timed out | 2060 ms | 992 KB | Time limit exceeded |
10 | Halted | 0 ms | 0 KB | - |