oj.uz

Submission #596817

# Submission time Handle Problem Language Result Execution time Memory
596817 2022-07-15T06:46:35 Z penguinhacker Building 4 (JOI20_building4) C++17
100 / 100
 281 ms 45388 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

const int mxN=5e5;
int n, a[2*mxN][2], dp[2*mxN][2][2]; // take a, b, max a, max b

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int j : {0, 1})
		for (int i=0; i<2*n; ++i)
			cin >> a[i][j];
	memset(dp, -1, sizeof(dp));
	dp[0][0][0]=1, dp[0][0][1]=0, dp[0][1][1]=1, dp[0][1][0]=0;
	for (int i=1; i<2*n; ++i) {
		for (int j : {0, 1}) {
			for (int k : {0, 1}) {
				if (a[i-1][k]<=a[i][j]&&dp[i-1][k][0]!=-1) {
					dp[i][j][0]=max(dp[i][j][0], dp[i-1][k][0]+(j==0));
					dp[i][j][1]=max(dp[i][j][1], dp[i-1][k][1]+(j==1));
				}
			}
		}
	}
	for (int x : {0, 1}) {
		if (dp[2*n-1][x][0]>=n&&dp[2*n-1][x][1]>=n) {
			string ans(2*n, 'A');
			int need[2]={n, n};
			for (int i=2*n-1, j=x; ~i; --i) {
				ans[i]='A'+j;
				--need[j];
				if (i) {
					bool ok=0;
					for (int k : {0, 1})
						if (a[i-1][k]<=a[i][j]&&dp[i-1][k][0]>=need[0]&&dp[i-1][k][1]>=need[1]) {
							j=k;
							ok=1;
							break;
						}
					assert(ok);
				}
			}
			cout << ans;
			return 0;
		}
	}
	cout << -1;
	return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15956 KB Output is correct
2 Correct 7 ms 15956 KB Output is correct
3 Correct 9 ms 15912 KB Output is correct
4 Correct 8 ms 15948 KB Output is correct
5 Correct 9 ms 16036 KB Output is correct
6 Correct 11 ms 16084 KB Output is correct
7 Correct 8 ms 16008 KB Output is correct
8 Correct 8 ms 16084 KB Output is correct
9 Correct 9 ms 16084 KB Output is correct
10 Correct 7 ms 16084 KB Output is correct
11 Correct 7 ms 16020 KB Output is correct
12 Correct 9 ms 16080 KB Output is correct
13 Correct 8 ms 16084 KB Output is correct
14 Correct 9 ms 16072 KB Output is correct
15 Correct 8 ms 16084 KB Output is correct
16 Correct 7 ms 16084 KB Output is correct
17 Correct 7 ms 16044 KB Output is correct
18 Correct 7 ms 16084 KB Output is correct
19 Correct 8 ms 16084 KB Output is correct
20 Correct 6 ms 15956 KB Output is correct
21 Correct 8 ms 16084 KB Output is correct
22 Correct 8 ms 16084 KB Output is correct
23 Correct 8 ms 15956 KB Output is correct
24 Correct 9 ms 16084 KB Output is correct
25 Correct 7 ms 15956 KB Output is correct
26 Correct 9 ms 15964 KB Output is correct
27 Correct 8 ms 15964 KB Output is correct
28 Correct 7 ms 16004 KB Output is correct
29 Correct 7 ms 16028 KB Output is correct
30 Correct 8 ms 15956 KB Output is correct
31 Correct 7 ms 15956 KB Output is correct
32 Correct 8 ms 16004 KB Output is correct
33 Correct 8 ms 15968 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15956 KB Output is correct
2 Correct 7 ms 15956 KB Output is correct
3 Correct 9 ms 15912 KB Output is correct
4 Correct 8 ms 15948 KB Output is correct
5 Correct 9 ms 16036 KB Output is correct
6 Correct 11 ms 16084 KB Output is correct
7 Correct 8 ms 16008 KB Output is correct
8 Correct 8 ms 16084 KB Output is correct
9 Correct 9 ms 16084 KB Output is correct
10 Correct 7 ms 16084 KB Output is correct
11 Correct 7 ms 16020 KB Output is correct
12 Correct 9 ms 16080 KB Output is correct
13 Correct 8 ms 16084 KB Output is correct
14 Correct 9 ms 16072 KB Output is correct
15 Correct 8 ms 16084 KB Output is correct
16 Correct 7 ms 16084 KB Output is correct
17 Correct 7 ms 16044 KB Output is correct
18 Correct 7 ms 16084 KB Output is correct
19 Correct 8 ms 16084 KB Output is correct
20 Correct 6 ms 15956 KB Output is correct
21 Correct 8 ms 16084 KB Output is correct
22 Correct 8 ms 16084 KB Output is correct
23 Correct 8 ms 15956 KB Output is correct
24 Correct 9 ms 16084 KB Output is correct
25 Correct 7 ms 15956 KB Output is correct
26 Correct 9 ms 15964 KB Output is correct
27 Correct 8 ms 15964 KB Output is correct
28 Correct 7 ms 16004 KB Output is correct
29 Correct 7 ms 16028 KB Output is correct
30 Correct 8 ms 15956 KB Output is correct
31 Correct 7 ms 15956 KB Output is correct
32 Correct 8 ms 16004 KB Output is correct
33 Correct 8 ms 15968 KB Output is correct
34 Correct 216 ms 42600 KB Output is correct
35 Correct 212 ms 43048 KB Output is correct
36 Correct 234 ms 42528 KB Output is correct
37 Correct 206 ms 43040 KB Output is correct
38 Correct 281 ms 43088 KB Output is correct
39 Correct 207 ms 42220 KB Output is correct
40 Correct 223 ms 44604 KB Output is correct
41 Correct 184 ms 42996 KB Output is correct
42 Correct 214 ms 44016 KB Output is correct
43 Correct 234 ms 45032 KB Output is correct
44 Correct 234 ms 45152 KB Output is correct
45 Correct 250 ms 45140 KB Output is correct
46 Correct 259 ms 45148 KB Output is correct
47 Correct 233 ms 44128 KB Output is correct
48 Correct 211 ms 43984 KB Output is correct
49 Correct 230 ms 44772 KB Output is correct
50 Correct 239 ms 44240 KB Output is correct
51 Correct 225 ms 44248 KB Output is correct
52 Correct 151 ms 33296 KB Output is correct
53 Correct 161 ms 33356 KB Output is correct
54 Correct 133 ms 33356 KB Output is correct
55 Correct 144 ms 33052 KB Output is correct
56 Correct 229 ms 45388 KB Output is correct
57 Correct 208 ms 40144 KB Output is correct
58 Correct 179 ms 40248 KB Output is correct
59 Correct 235 ms 40412 KB Output is correct
60 Correct 178 ms 39276 KB Output is correct
61 Correct 198 ms 40812 KB Output is correct
62 Correct 216 ms 40396 KB Output is correct
63 Correct 273 ms 40796 KB Output is correct
64 Correct 190 ms 39892 KB Output is correct
65 Correct 190 ms 40772 KB Output is correct