# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
221142 | 2020-04-09T15:23:50 Z | DodgeBallMan | Match (CEOI16_match) | C++14 | 5 ms | 384 KB |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; char s[N], ans[N]; int n, last[N][30]; void solve( int l, int r ) { if( l > r ) return ; if( l % 2 == r % 2 ) { printf("-1"); exit( 0 ); } int idx = last[r][s[l]-'a']; ans[l] = '(', ans[idx] = ')'; solve( l + 1, idx-1 ), solve( idx+1, r ); } int main() { scanf("%s",&s[1]); n = strlen( &s[1] ); for( int i = 1 ; i <= n ; i++ ) { int now = s[i] - 'a'; for( int j = 0 ; j < 26 ; j++ ) { if( j == now ) last[i][j] = i; else last[i][j] = last[last[i-1][now]][j]; } } solve( 1, n ); for( int i = 1 ; i <= n ; i++ ) printf("%c",ans[i]); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |