# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
53480 | 2018-06-30T05:46:16 Z | baactree | Match (CEOI16_match) | C++17 | 3 ms | 360 KB |
#include <bits/stdc++.h> using namespace std; int n; char str[100005]; int sum[100005]; 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')); for (int i = 1; i <= n; i++) { if (str[i] >= 'a'&&str[i] <= 'z') { bool flag = false; for (int j = n; j > i; j--) { if (str[j] == str[i] && (sum[j] ^ sum[i - 1]) == 0) { str[i] = '('; str[j] = ')'; flag = true; break; } } if (!flag)return !printf("-1\n"); } } printf("%s\n", str + 1); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 248 KB | Output is correct |
2 | Incorrect | 2 ms | 360 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 248 KB | Output is correct |
2 | Incorrect | 2 ms | 360 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 248 KB | Output is correct |
2 | Incorrect | 2 ms | 360 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |