oj.uz

Submission #682050

# Submission time Handle Problem Language Result Execution time Memory
682050 2023-01-15T12:36:17 Z Kahou Building 4 (JOI20_building4) C++14
100 / 100
 220 ms 24864 KB 
/* In the name of God, aka Allah */
// let this be mytemp.cpp
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define endl '\n'
#define mk make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = 2e6 + 50;
int n, a[N];
pii dp[N];

void solve() {
	cin >> n;
	n <<= 1;
	for (int i = 1; i <= n; i++) {
		cin >> a[i<<1];
	}
	for (int i = 1; i <= n; i++) {
		cin >> a[i<<1|1];
	}
	dp[n<<1] = {0, 0};
	dp[n<<1|1] = {1, 1};
	for (int i = (n<<1)-1; i >= 0; i--) {
		dp[i] = {N, -N};
		int x = i+2, y = x^1;
		if (a[i] <= a[x]) {
			dp[i].F = min(dp[i].F, dp[x].F+(i&1));
			dp[i].S = max(dp[i].S, dp[x].S+(i&1));
		}
		if (a[i] <= a[y]) {
			dp[i].F = min(dp[i].F, dp[y].F+(i&1));
			dp[i].S = max(dp[i].S, dp[y].S+(i&1));
		}
	}
	if (dp[0].F > n/2 || dp[0].S < n/2) return cout << -1 << endl, void();

	int cur = n/2;
	int u = 0;
	for (int x = 1; x <= n; x++) {
		if (a[u] <= a[x<<1] && dp[x<<1].F <= cur && cur <= dp[x<<1].S) {
			cout << 'A';
			u = x<<1;
		}
		else {
			cout << 'B';
			u = x<<1|1;
			cur--;
		}
	}
	cout << endl;
}
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	solve();
	return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 190 ms 23380 KB Output is correct
35 Correct 207 ms 22988 KB Output is correct
36 Correct 203 ms 22560 KB Output is correct
37 Correct 209 ms 23012 KB Output is correct
38 Correct 191 ms 23100 KB Output is correct
39 Correct 185 ms 23140 KB Output is correct
40 Correct 204 ms 24676 KB Output is correct
41 Correct 186 ms 23588 KB Output is correct
42 Correct 209 ms 23956 KB Output is correct
43 Correct 213 ms 24756 KB Output is correct
44 Correct 217 ms 24864 KB Output is correct
45 Correct 213 ms 24760 KB Output is correct
46 Correct 206 ms 24780 KB Output is correct
47 Correct 203 ms 24712 KB Output is correct
48 Correct 215 ms 24780 KB Output is correct
49 Correct 205 ms 24780 KB Output is correct
50 Correct 212 ms 24704 KB Output is correct
51 Correct 220 ms 24780 KB Output is correct
52 Correct 154 ms 24780 KB Output is correct
53 Correct 152 ms 24764 KB Output is correct
54 Correct 144 ms 24740 KB Output is correct
55 Correct 147 ms 24680 KB Output is correct
56 Correct 202 ms 24680 KB Output is correct
57 Correct 177 ms 24620 KB Output is correct
58 Correct 173 ms 24788 KB Output is correct
59 Correct 175 ms 24692 KB Output is correct
60 Correct 168 ms 23256 KB Output is correct
61 Correct 181 ms 24780 KB Output is correct
62 Correct 174 ms 24480 KB Output is correct
63 Correct 176 ms 24696 KB Output is correct
64 Correct 176 ms 23984 KB Output is correct
65 Correct 188 ms 24784 KB Output is correct