# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
53484 | baactree | 괄호 문자열 (CEOI16_match) | C++17 | 2 ms | 652 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n;
char str[100005];
int sum[100005];
void solve(int le, int ri) {
if (le > ri)return;
for (int i = ri; i > le; i--) {
if (str[i] == str[le] && (sum[i] ^ sum[le - 1]) == 0) {
str[i] = ')';
str[le] = '(';
solve(le + 1, i - 1);
solve(i + 1, ri);
return;
}
}
printf("-1\n");
exit(0);
}
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'));
solve(1, n);
printf("%s\n", str + 1);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |