# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
604428 | Zanite | Match (CEOI16_match) | C++17 | 0 ms | 212 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;
const int maxL = 1e5 + 10;
const int Alph = 26;
int L, freq[Alph], tfreq[Alph];
char S[maxL], ans[maxL];
void Exit() {
printf("-1\n");
exit(0);
}
int main() {
scanf("%s", S);
L = strlen(S);
for (int i = 0; i < L; i++) {
freq[S[i] - 'a']++;
}
for (int i = 0; i < Alph; i++) {
if (freq[i] & 1) {Exit();}
freq[i] >>= 1;
tfreq[i] = freq[i];
//cout << freq[i] << '\n';
}
vector<char> St;
for (int i = 0; i < L; i++) {
if (tfreq[S[i] - 'a']) {
St.push_back(S[i]);
tfreq[S[i] - 'a']--;
} else {
if (St.empty() || (St.back() != S[i])) {
Exit();
} else {
St.pop_back();
}
}
}
if (!St.empty()) {Exit();}
for (int i = 0; i < L; i++) {
if (freq[S[i] - 'a']) {
putchar('(');
freq[S[i] - 'a']--;
} else {
putchar(')');
}
}
putchar('\n');
}
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... |