# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
175878 | 2020-01-07T11:43:01 Z | Ruxandra985 | Match (CEOI16_match) | C++14 | 2000 ms | 10360 KB |
#include <bits/stdc++.h> //#pragma GCC optimize "Ofast" using namespace std; int sp[30][100010]; char sol[100010] , s[100010]; int ok; int stk[100010]; int match (int st , int dr){ int i , elem = 0; if (st > dr) return 1; for (i=0;i<'z' - 'a';++i){ if (((sp[i][dr] - sp[i][st-1]) & 1) == 1) return 0; } for (i=st;i<=dr;++i){ if (stk[elem] == s[i]) elem--; else stk[++elem] = s[i]; } return (elem == 0); } void solve (int st , int dr){ int i; if (st > dr) return; /// stii ca pe st pui ( , gaseste i match ul for (i = ( ( (dr & 1) != (st & 1) ) ? dr : dr - 1); i >= st + 1 ; i-=2){ if (s[st] == s[i] && match(i + 1 , dr)) break; } if (i < st + 1){ ok = 0; return; } else { sol[st] = '('; sol[i] = ')'; solve(st + 1 , i - 1); solve (i + 1 , dr); } } int main() { FILE *fin = stdin; FILE *fout = stdout; int n , i; fgets (s+1 , 100010 , fin); n = 0; while ( 'a' <= s[n+1] && s[n+1] <= 'z' ){ n++; s[n]-='a'; for (i=0;i<='z'-'a';++i){ sp[i][n] = sp[i][n-1] + (s[n] == i); } } stk[0] = -1; if (!match(1 , n)){ fprintf (fout,"-1"); return 0; } ok = 1; solve (1 , n); fputs (sol+1,fout); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 504 KB | Output is correct |
3 | Correct | 2 ms | 504 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 504 KB | Output is correct |
3 | Correct | 2 ms | 504 KB | Output is correct |
4 | Correct | 2 ms | 632 KB | Output is correct |
5 | Correct | 2 ms | 504 KB | Output is correct |
6 | Correct | 2 ms | 632 KB | Output is correct |
7 | Correct | 4 ms | 676 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 504 KB | Output is correct |
3 | Correct | 2 ms | 504 KB | Output is correct |
4 | Correct | 2 ms | 632 KB | Output is correct |
5 | Correct | 2 ms | 504 KB | Output is correct |
6 | Correct | 2 ms | 632 KB | Output is correct |
7 | Correct | 4 ms | 676 KB | Output is correct |
8 | Correct | 6 ms | 1144 KB | Output is correct |
9 | Correct | 44 ms | 1272 KB | Output is correct |
10 | Correct | 5 ms | 1272 KB | Output is correct |
11 | Correct | 4 ms | 1272 KB | Output is correct |
12 | Correct | 77 ms | 7548 KB | Output is correct |
13 | Correct | 40 ms | 8184 KB | Output is correct |
14 | Correct | 565 ms | 8888 KB | Output is correct |
15 | Correct | 62 ms | 10360 KB | Output is correct |
16 | Correct | 62 ms | 10360 KB | Output is correct |
17 | Execution timed out | 2051 ms | 9500 KB | Time limit exceeded |
18 | Halted | 0 ms | 0 KB | - |