#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2005;
int N;
char s[MAXN];
char ans[MAXN];
bool ava(stack<char> st, int x) {
for(int i = x; i < N; i++) {
if(!st.empty() && s[i] == st.top()) st.pop();
else st.push(s[i]);
}
return st.empty();
}
int main() {
cin >> s;
for(N = 0; s[N]; N++);
stack<char> st;
for(int i = 0; i < N; i++) {
st.push(s[i]);
if(ava(st, i + 1)) ans[i] = '(';
else {
ans[i] = ')';
st.pop();
if(st.empty() || st.top() != s[i]) {
cout << -1;
return 0;
}
st.pop();
}
}
if(st.empty())
for(int i = 0; i < N; i++) cout << ans[i];
else cout << -1;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
2 ms |
304 KB |
Output is correct |
5 |
Correct |
2 ms |
212 KB |
Output is correct |
6 |
Correct |
4 ms |
304 KB |
Output is correct |
7 |
Correct |
7 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
2 ms |
304 KB |
Output is correct |
5 |
Correct |
2 ms |
212 KB |
Output is correct |
6 |
Correct |
4 ms |
304 KB |
Output is correct |
7 |
Correct |
7 ms |
212 KB |
Output is correct |
8 |
Runtime error |
1 ms |
340 KB |
Execution killed with signal 11 |
9 |
Halted |
0 ms |
0 KB |
- |