oj.uz

Submission #561122

# Submission time Handle Problem Language Result Execution time Memory
561122 2022-05-12T09:52:52 Z Mazaalai Building 4 (JOI20_building4) C++17
100 / 100
 270 ms 45380 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define ALL(x) x.begin(),x.end()
using namespace std;
using PII = pair <int, int>;
int n;
const int N = 5e5 + 5;
const int M = 2 * N;
int a[M], b[M], ans[M]; // 0 ? A : B
const int INF = 1.07e9;
PII dp[M][2];
const PII zero = {-1, -1};
void merge(PII&a, PII b, int add) {
	if (a == zero) {
		if (b != zero) a = {b.ff+add, b.ss+add};
		return;
	}
	if (b == zero) return;
	a.ff = min(b.ff+add, a.ff);
	a.ss = max(b.ss+add, a.ss);
}
signed main() {
	// freopen("0.in", "r", stdin);
	// freopen("0.out", "w", stdout);
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n;
	for (int i = 1; i <= 2 * n; i++) cin >> a[i];
	for (int i = 1; i <= 2 * n; i++) cin >> b[i];
	dp[1][0] = {1, 1};
	dp[1][1] = {0, 0};

	for (int i = 2; i <= 2 * n; i++) {
		dp[i][0] = dp[i][1] = zero;
		if (a[i-1] <= a[i]) merge(dp[i][0], dp[i-1][0], 1);
		if (b[i-1] <= a[i]) merge(dp[i][0], dp[i-1][1], 1);
		if (a[i-1] <= b[i]) merge(dp[i][1], dp[i-1][0], 0);
		if (b[i-1] <= b[i]) merge(dp[i][1], dp[i-1][1], 0);
	}
	// merge(dp[2*n][0], dp[2*n][1], 0);
	if ((dp[2*n][0].ss < n || n < dp[2*n][0].ff) && (dp[2*n][1].ss < n || n < dp[2*n][1].ff)) {
		cout << "-1\n";
		return 0;
	}
	string ans = "";
	int last = 0;
	// for (int i = 1; i <= 2*n; i++) {
	// 	cout << dp[i][0].ff << ',' << dp[i][0].ss << ' ' << dp[i][1].ff << ',' << dp[i][1].ss << '\n';
	// }
	if (dp[2*n][0].ff <= n && n <= dp[2*n][0].ss) last = 0;
	else last = 1;
	int target = n;

	for (int i = 2 * n; i > 1; i--) {
		ans.push_back('A'+last);
		target -= last == 0;
		// cout << ans << " " << last << ' ' << target << "\n";
		if (last == 0) {
			if (a[i-1] <= a[i] && dp[i-1][0] != zero && dp[i-1][0].ff <= target && target <= dp[i-1][0].ss) last = 0;
			else last = 1;
		} else {
			if (a[i-1] <= b[i] && dp[i-1][0] != zero && dp[i-1][0].ff <= target && target <= dp[i-1][0].ss) last = 0;
			else last = 1;
		}
	}
	ans.push_back('A'+last);
	target -= last == 0;
	// cout << ans << " " << last << ' ' << target << "\n";
	reverse(ALL(ans));
	cout << ans << '\n';
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 412 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 416 KB Output is correct
16 Correct 1 ms 412 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 2 ms 464 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 472 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 388 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 412 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 416 KB Output is correct
16 Correct 1 ms 412 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 2 ms 464 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 472 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 388 KB Output is correct
34 Correct 244 ms 42328 KB Output is correct
35 Correct 214 ms 42020 KB Output is correct
36 Correct 232 ms 41252 KB Output is correct
37 Correct 231 ms 42192 KB Output is correct
38 Correct 213 ms 42132 KB Output is correct
39 Correct 214 ms 41308 KB Output is correct
40 Correct 232 ms 44788 KB Output is correct
41 Correct 206 ms 42344 KB Output is correct
42 Correct 220 ms 43648 KB Output is correct
43 Correct 242 ms 45268 KB Output is correct
44 Correct 239 ms 45208 KB Output is correct
45 Correct 246 ms 45336 KB Output is correct
46 Correct 225 ms 45312 KB Output is correct
47 Correct 240 ms 44380 KB Output is correct
48 Correct 232 ms 44080 KB Output is correct
49 Correct 244 ms 44868 KB Output is correct
50 Correct 270 ms 44368 KB Output is correct
51 Correct 242 ms 44408 KB Output is correct
52 Correct 175 ms 33504 KB Output is correct
53 Correct 162 ms 33632 KB Output is correct
54 Correct 146 ms 33476 KB Output is correct
55 Correct 158 ms 33272 KB Output is correct
56 Correct 268 ms 45380 KB Output is correct
57 Correct 240 ms 40256 KB Output is correct
58 Correct 209 ms 40488 KB Output is correct
59 Correct 207 ms 40516 KB Output is correct
60 Correct 229 ms 38412 KB Output is correct
61 Correct 220 ms 41016 KB Output is correct
62 Correct 201 ms 40304 KB Output is correct
63 Correct 216 ms 40892 KB Output is correct
64 Correct 228 ms 39464 KB Output is correct
65 Correct 216 ms 40900 KB Output is correct