# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
745451 | 2023-05-20T07:09:22 Z | Alexandruabcde | Match (CEOI16_match) | C++14 | 2000 ms | 15872 KB |
#include <bits/stdc++.h> using namespace std; constexpr int NMAX = 1e5 + 5; constexpr int SIGMAX = 26; bool exist; int sp[NMAX]; char ans[NMAX]; string S; void Precompute () { deque <char> D; for (int i = 0; i < S.size(); ++ i ) { if (D.empty() || D.back() != S[i]) { D.push_back(S[i]); } else { D.pop_back(); } } exist = D.empty(); } int pos[SIGMAX]; int bef[NMAX]; void Solve (int st, int dr) { if (st > dr) return; deque <char> D; int last = -1; for (int j = st+1; j <= dr; ++ j ) { if (ans[j] == ')') { if (D.empty() || D.back() != S[j]) break; D.pop_back(); continue; } if (D.empty() || D.back() != S[j]) { if (D.empty() && S[st] == S[j]) last = j; D.push_back(S[j]); } else { D.pop_back(); } } ans[st] = '('; ans[last] = ')'; Solve(st+1, last-1); Solve(last+1, dr); } void Solve () { Solve(0, S.size()-1); for (int i = 0; i < S.size(); ++ i ) cout << ans[i]; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> S; Precompute(); if (!exist) { cout << -1 << '\n'; return 0; } Solve(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 4 ms | 844 KB | Output is correct |
7 | Correct | 2 ms | 596 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 4 ms | 844 KB | Output is correct |
7 | Correct | 2 ms | 596 KB | Output is correct |
8 | Correct | 5 ms | 500 KB | Output is correct |
9 | Correct | 41 ms | 1808 KB | Output is correct |
10 | Correct | 29 ms | 1400 KB | Output is correct |
11 | Correct | 47 ms | 2552 KB | Output is correct |
12 | Execution timed out | 2057 ms | 15872 KB | Time limit exceeded |
13 | Halted | 0 ms | 0 KB | - |