# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1032715 | 2024-07-24T06:44:43 Z | 김은성(#10965) | Match (CEOI16_match) | C++17 | 0 ms | 348 KB |
#include <bits/stdc++.h> using namespace std; char s[100009], t[100009]; int n; bool possible(int idx, vector<char> st){ int i; for(i=idx; i<n; i++){ if(!st.empty() && st.back() == s[i]) st.pop_back(); else st.push_back(s[i]); } return st.empty(); } bool inverse(int idx, vector<char> vec){ int i, j = 0; vector<char> st; for(i=n-1; i>=idx; i--){ if(j < vec.size() && vec[j] == s[i]) j++; else{ if(!st.empty() && st.back() == s[i]) st.pop_back(); else st.push_back(s[i]); } if(j==vec.size()) return 1; } return 0; } int main(){ int i; scanf(" %s", s); n = strlen(s); vector<char> st; if(!possible(0, st)){ printf("-1\n"); return 0; } for(i=0; i<n; i++){ st.push_back(s[i]); t[i] = '('; if(st.size()>1 && st[st.size()-2] == s[i]){ if(!inverse(i+1, st)){ t[i] = ')'; st.pop_back(); st.pop_back(); } } } printf("%s\n", t); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 348 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 348 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |