# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
53489 | baactree | Match (CEOI16_match) | C++17 | 2050 ms | 568 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];
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 (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... |