# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
604421 | 2022-07-25T06:13:16 Z | maximath_1 | Match (CEOI16_match) | C++11 | 0 ms | 212 KB |
#include <bits/stdc++.h> using namespace std; int main(){ cin.tie(0) -> sync_with_stdio(0); string s; cin >> s; stack<char> cb; int n = s.size(); for(int i = 0; i < n; i ++){ if(cb.empty()) cb.push(s[i]); else if(cb.top() != s[i]) cb.push(s[i]); else cb.pop(); } if(cb.size()){ cout << -1 << endl; return 0; } vector<int> gg[30]; for(int i = 0; i < n; i ++) gg[s[i] - 'a'].push_back(i); string ans = ""; for(int i = 0; i < n; i ++) ans += '('; for(int i = 0; i < 30; i ++) if(gg[i].size()){ if(gg[i].size() & 1){ cout << -1 << endl; return 0; } for(int j = gg[i].size() / 2; j < gg[i].size(); j ++) ans[gg[i][j]] = ')'; } cout << ans << endl; }
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 | - |