Submission #217143

# Submission time Handle Problem Language Result Execution time Memory
217143 2020-03-29T06:32:39 Z maruii Building 4 (JOI20_building4) C++14
0 / 100
5 ms 384 KB
#include <bits/stdc++.h>
using namespace std;
int N, A[1000001][2], L[1000001][2], R[1000001][2];
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> N;
	for (int i = 1; i <= N * 2; ++i) cin >> A[i][0];
	for (int i = 1; i <= N * 2; ++i) cin >> A[i][1];
	for (int i = 1; i <= N * 2; ++i) {
		L[i][0] = L[i][1] = 1e9;
		for (int j = 0; j < 2; ++j) {
			for (int k = 0; k < 2; ++k) {
				if (A[i - 1][j] <= A[i][k]) {
					L[i][k] = min(L[i][k], L[i - 1][j] + (k == 0));
					R[i][k] = max(R[i][k], R[i - 1][j] + (k == 0));
				}
			}
		}
	}
	string ans;
	int a = 0;
	for (int i = N * 2; i >= 1; --i) {
		if (L[i][0] <= N - a && N - a <= R[i][0]) {
			ans += 'A';
			++a;
			continue;
		}
		if (L[i][1] <= N - a && N - a <= R[i][1]) {
			ans += 'B';
			continue;
		}
		return !printf("-1");
	}
	cout << ans;
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 4 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 4 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -