# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
604428 | 2022-07-25T06:21:48 Z | Zanite | Match (CEOI16_match) | C++17 | 0 ms | 212 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |