# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
53489 | 2018-06-30T06:12:04 Z | baactree | Match (CEOI16_match) | C++17 | 2000 ms | 568 KB |
#include <bits/stdc++.h> using namespace std; int n; char str[100005]; int sum[100005]; bool solve(int le, int ri) { if (le > ri)return true; for (int i = ri; i > le; i--) { if (str[i] == str[le] && solve(le+1,i-1)&&solve(i+1,ri)) { str[i] = ')'; str[le] = '('; return true; } } return false; } int main() { scanf("%s", str + 1); n = strlen(str + 1); for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] ^ (1 << (str[i] - 'a')); if(solve(1, n)) printf("%s\n", str + 1); else printf("-1\n"); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 248 KB | Output is correct |
2 | Correct | 2 ms | 364 KB | Output is correct |
3 | Correct | 2 ms | 364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 248 KB | Output is correct |
2 | Correct | 2 ms | 364 KB | Output is correct |
3 | Correct | 2 ms | 364 KB | Output is correct |
4 | Execution timed out | 2050 ms | 568 KB | Time limit exceeded |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 248 KB | Output is correct |
2 | Correct | 2 ms | 364 KB | Output is correct |
3 | Correct | 2 ms | 364 KB | Output is correct |
4 | Execution timed out | 2050 ms | 568 KB | Time limit exceeded |
5 | Halted | 0 ms | 0 KB | - |