oj.uz

Submission #134327

# Submission time Handle Problem Language Result Execution time Memory
134327 2019-07-22T12:49:37 Z imyujin Match (CEOI16_match) C++14
0 / 100
 2 ms 376 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 2000;

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[x] == st.top()) st.pop();
		else st.push(s[x]);
	}
	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;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -