oj.uz

Submission #952450

# Submission time Handle Problem Language Result Execution time Memory
952450 2024-03-24T02:13:52 Z NK_ Superpozicija (COCI22_superpozicija) C++17
10 / 110
 25 ms 4380 KB 
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'
template<class T> using V = vector<T>;

using vi = V<int>;

void solve() {
	int N; cin >> N;
	string S; cin >> S;

	V<array<int, 2>> A(N); for(auto& x : A) { cin >> x[0] >> x[1]; --x[0], --x[1]; }

	if (N % 2) {
		cout << -1 << nl;
		return;
	}

	vi I(2 * N);
	for(int i = 0; i < N; i++) {
		I[A[i][0]] = 2 * i;
		I[A[i][1]] = 2 * i + 1;
	}

	vi ans(N), take(2 * N); int open = N / 2, closed = N / 2;
	for(int i = 0; i < 2 * N; i++) if (I[i] != -1 && S[i] == '(' && open > 0) {
		take[i] = 1; open--;
		int x = I[i] / 2; ans[x] = I[i] % 2;
		I[A[x][0]] = I[A[x][1]] = -1;
	}

	for(int i = 2 * N - 1; i >= 0; i--) if (I[i] != -1 && S[i] == ')' && closed > 0) {
		take[i] = 1; closed--;
		int x = I[i] / 2; ans[x] = I[i] % 2;
		I[A[x][0]] = I[A[x][1]] = -1;
	}

	int bal = 0; for(int i = 0; i < 2 * N; i++) if (take[i]) {
		if (S[i] == '(') bal++;
		else bal--;

		if (bal < 0) {
			cout << -1 << nl;
			return;
		}
	}

	if (bal != 0) {
		cout << -1 << nl;
		return;
	}

	for(auto& x : ans) cout << x << " ";
	cout << nl;
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int T; cin >> T; while(T--) {
		solve();
	}

	exit(0-0);
}

Subtask #1
0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1116 KB Output is correct
2 Correct 15 ms 1832 KB Output is correct
3 Correct 13 ms 2092 KB Output is correct
4 Correct 19 ms 2480 KB Output is correct
5 Correct 16 ms 2828 KB Output is correct
6 Correct 9 ms 2652 KB Output is correct
7 Correct 14 ms 3160 KB Output is correct
8 Correct 16 ms 3444 KB Output is correct
9 Correct 14 ms 4092 KB Output is correct
10 Correct 19 ms 4380 KB Output is correct

Subtask #3
0 / 20.0

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

Subtask #4
0 / 70.0

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