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