oj.uz

Submission #443678

# Submission time Handle Problem Language Result Execution time Memory
443678 2021-07-11T09:39:44 Z dutch Building 4 (JOI20_building4) C++17
100 / 100
 296 ms 45308 KB 
#include <bits/stdc++.h>
using namespace std;
#define rMax(x, y) x = max(x, y)
#define rMin(x, y) x = min(x, y)

const int LIM = 1e6+1;

int n, a[2][LIM];
array<int, 2> dp[2][LIM];

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	cin >> n; n *= 2;
	for(int j : {1, 0})
		for(int i=1; i<=n; ++i) cin >> a[j][i];

	for(int i=1; i<=n; ++i){
		for(int j : {0, 1}){
			dp[j][i] = {n+1, -1};
			for(int k : {0, 1})
				if(a[j][i] >= a[k][i-1])
					rMin(dp[j][i][0], dp[k][i-1][0]+j),
					rMax(dp[j][i][1], dp[k][i-1][1]+j);
		}
	}

	int u = -1, j = 0;

	for(int k : {0, 1})
		if(dp[k][n][0] <= n/2 && n/2 <= dp[k][n][1]) u = n, j = k;

	if(u < 0){
		cout << -1;
	}else{
		string ans(n, ' ');
		int c = n/2;
		while(u--){
			ans[u] = 'B'-j;
			c -= j;
			j = a[j][u+1] >= a[1][u] && dp[1][u][0] <= c && c <= dp[1][u][1];
		}
		cout << ans;
	}
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 2 ms 460 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 2 ms 444 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 3 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 356 KB Output is correct
31 Correct 2 ms 464 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 1 ms 460 KB Output is correct
34 Correct 282 ms 42328 KB Output is correct
35 Correct 269 ms 32064 KB Output is correct
36 Correct 265 ms 36280 KB Output is correct
37 Correct 271 ms 30376 KB Output is correct
38 Correct 252 ms 30660 KB Output is correct
39 Correct 277 ms 39236 KB Output is correct
40 Correct 273 ms 44552 KB Output is correct
41 Correct 258 ms 36816 KB Output is correct
42 Correct 278 ms 43564 KB Output is correct
43 Correct 296 ms 44996 KB Output is correct
44 Correct 291 ms 44996 KB Output is correct
45 Correct 294 ms 44996 KB Output is correct
46 Correct 277 ms 44972 KB Output is correct
47 Correct 281 ms 43876 KB Output is correct
48 Correct 276 ms 42820 KB Output is correct
49 Correct 282 ms 44740 KB Output is correct
50 Correct 291 ms 44184 KB Output is correct
51 Correct 291 ms 44172 KB Output is correct
52 Correct 227 ms 33308 KB Output is correct
53 Correct 219 ms 33348 KB Output is correct
54 Correct 198 ms 33324 KB Output is correct
55 Correct 196 ms 33084 KB Output is correct
56 Correct 272 ms 45308 KB Output is correct
57 Correct 239 ms 40028 KB Output is correct
58 Correct 247 ms 40216 KB Output is correct
59 Correct 242 ms 40256 KB Output is correct
60 Correct 232 ms 38212 KB Output is correct
61 Correct 238 ms 40644 KB Output is correct
62 Correct 240 ms 40132 KB Output is correct
63 Correct 250 ms 40636 KB Output is correct
64 Correct 233 ms 39364 KB Output is correct
65 Correct 239 ms 40644 KB Output is correct