# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
48098 | 2018-05-10T04:58:11 Z | Extazy | 괄호 문자열 (CEOI16_match) | C++17 | 2000 ms | 564 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; } int where=pos[r]; while(a[l]!=a[where-1]) { where=pos[where-1]-1; } ans[l]='('; ans[where-1]=')'; solve(l+1,where-2); solve(where,r); } 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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 488 KB | Output is correct |
3 | Correct | 2 ms | 488 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 488 KB | Output is correct |
3 | Correct | 2 ms | 488 KB | Output is correct |
4 | Execution timed out | 2068 ms | 564 KB | Time limit exceeded |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 488 KB | Output is correct |
3 | Correct | 2 ms | 488 KB | Output is correct |
4 | Execution timed out | 2068 ms | 564 KB | Time limit exceeded |
5 | Halted | 0 ms | 0 KB | - |