# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
48087 | 2018-05-10T04:25:45 Z | Extazy | 괄호 문자열 (CEOI16_match) | C++17 | 2000 ms | 24792 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,r); 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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 572 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 572 KB | Output is correct |
4 | Correct | 2 ms | 572 KB | Output is correct |
5 | Correct | 2 ms | 572 KB | Output is correct |
6 | Correct | 2 ms | 696 KB | Output is correct |
7 | Correct | 2 ms | 720 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 572 KB | Output is correct |
4 | Correct | 2 ms | 572 KB | Output is correct |
5 | Correct | 2 ms | 572 KB | Output is correct |
6 | Correct | 2 ms | 696 KB | Output is correct |
7 | Correct | 2 ms | 720 KB | Output is correct |
8 | Correct | 4 ms | 724 KB | Output is correct |
9 | Correct | 12 ms | 1548 KB | Output is correct |
10 | Correct | 6 ms | 1548 KB | Output is correct |
11 | Correct | 4 ms | 1548 KB | Output is correct |
12 | Correct | 91 ms | 5696 KB | Output is correct |
13 | Correct | 44 ms | 5696 KB | Output is correct |
14 | Correct | 585 ms | 15460 KB | Output is correct |
15 | Correct | 14 ms | 15460 KB | Output is correct |
16 | Correct | 13 ms | 15460 KB | Output is correct |
17 | Correct | 77 ms | 15460 KB | Output is correct |
18 | Correct | 15 ms | 15460 KB | Output is correct |
19 | Correct | 968 ms | 15460 KB | Output is correct |
20 | Correct | 401 ms | 15460 KB | Output is correct |
21 | Execution timed out | 2021 ms | 24792 KB | Time limit exceeded |