# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
175775 | 2020-01-07T10:56:38 Z | Ruxandra985 | 괄호 문자열 (CEOI16_match) | C++14 | 2000 ms | 8140 KB |
/// oare cat de bine merge in practica? #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; if (!ok) /// nu mai are rost 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 (match(st + 1 , i - 1) && 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; ok = 1; solve (1 , n); if (ok == 0){ fprintf (fout,"%d\n",-1); } else { fputs (sol+1,fout); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | 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 |
# | 결과 | 실행 시간 | 메모리 | 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 | 3 ms | 504 KB | Output is correct |
5 | Correct | 2 ms | 504 KB | Output is correct |
6 | Correct | 4 ms | 632 KB | Output is correct |
7 | Correct | 7 ms | 632 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | 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 | 3 ms | 504 KB | Output is correct |
5 | Correct | 2 ms | 504 KB | Output is correct |
6 | Correct | 4 ms | 632 KB | Output is correct |
7 | Correct | 7 ms | 632 KB | Output is correct |
8 | Correct | 19 ms | 1144 KB | Output is correct |
9 | Correct | 182 ms | 1252 KB | Output is correct |
10 | Correct | 15 ms | 1272 KB | Output is correct |
11 | Correct | 19 ms | 1272 KB | Output is correct |
12 | Correct | 952 ms | 7060 KB | Output is correct |
13 | Correct | 988 ms | 7692 KB | Output is correct |
14 | Execution timed out | 2037 ms | 8140 KB | Time limit exceeded |
15 | Halted | 0 ms | 0 KB | - |