oj.uz

Submission #261904

# Submission time Handle Problem Language Result Execution time Memory
261904 2020-08-12T07:37:09 Z ruler Building 4 (JOI20_building4) C++14
100 / 100
 395 ms 27768 KB 
// IOI 2021
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ends ' '
#define endt '\t'
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const ll MOD = 1e9 + 7;

////////////////////////////////////////////////////////////////////
 
const int N = 1e6 + 5;

int DP[N][2][2];
int A[2][N];
bool R[N];

int main() {
 
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	mt19937 Rnd(time(0));
	
	for (int i = 0; i < N; i++) for (int j = 0; j < 2; j++) DP[i][j][0] = INF, DP[i][j][1] = - INF;

	int n; cin >> n;
	for (int i = 0; i < 2; i++) for (int j = 0; j < n + n; j++) cin >> A[i][j];
	DP[0][1][0] = DP[0][1][1] = 1;
	DP[0][0][0] = DP[0][0][1] = 0;
	for (int i = 1; i < n + n; i++) for (int j = 0; j < 2; j++) {	
		if (A[j][i - 1] <= A[j][i]) {
			DP[i][j][0] = min(DP[i][j][0], DP[i - 1][j][0] + j);
			DP[i][j][1] = max(DP[i][j][1], DP[i - 1][j][1] + j);
		}
		if (A[1 - j][i - 1] <= A[j][i]) {
			DP[i][j][0] = min(DP[i][j][0], DP[i - 1][1 - j][0] + j);
			DP[i][j][1] = max(DP[i][j][1], DP[i - 1][1 - j][1] + j);	
		}
	}
	int cnt = n;
	for (int i = n + n - 1; i >= 0; i--) {
		bool ok = false;
		for (int j = 0; j < 2; j++) {
			if (i + 1 < n + n && A[j][i] > A[R[i + 1]][i + 1]) continue;
			if (DP[i][j][0] <= cnt && cnt <= DP[i][j][1]) {
				R[i] = j;
				ok = true;
				cnt -= j;
				break;
			}
		}
		if (!ok) die(-1);
	}
	for (int i = 0; i < n + n; i++) cout << (R[i] ? 'B' : 'A');
	cout << endl;

	return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16000 KB Output is correct
2 Correct 10 ms 16128 KB Output is correct
3 Correct 10 ms 16000 KB Output is correct
4 Correct 10 ms 16000 KB Output is correct
5 Correct 11 ms 16000 KB Output is correct
6 Correct 11 ms 16000 KB Output is correct
7 Correct 14 ms 16128 KB Output is correct
8 Correct 11 ms 16128 KB Output is correct
9 Correct 11 ms 16128 KB Output is correct
10 Correct 11 ms 16128 KB Output is correct
11 Correct 13 ms 16128 KB Output is correct
12 Correct 11 ms 16128 KB Output is correct
13 Correct 14 ms 16128 KB Output is correct
14 Correct 11 ms 16128 KB Output is correct
15 Correct 11 ms 16128 KB Output is correct
16 Correct 11 ms 16128 KB Output is correct
17 Correct 12 ms 16128 KB Output is correct
18 Correct 12 ms 16128 KB Output is correct
19 Correct 13 ms 16128 KB Output is correct
20 Correct 12 ms 16256 KB Output is correct
21 Correct 11 ms 16128 KB Output is correct
22 Correct 11 ms 16128 KB Output is correct
23 Correct 10 ms 16052 KB Output is correct
24 Correct 14 ms 16128 KB Output is correct
25 Correct 11 ms 16128 KB Output is correct
26 Correct 11 ms 16128 KB Output is correct
27 Correct 11 ms 16128 KB Output is correct
28 Correct 12 ms 16128 KB Output is correct
29 Correct 12 ms 16128 KB Output is correct
30 Correct 12 ms 16128 KB Output is correct
31 Correct 11 ms 16128 KB Output is correct
32 Correct 11 ms 16128 KB Output is correct
33 Correct 12 ms 16128 KB Output is correct
34 Correct 344 ms 24056 KB Output is correct
35 Correct 356 ms 25492 KB Output is correct
36 Correct 346 ms 25336 KB Output is correct
37 Correct 355 ms 25464 KB Output is correct
38 Correct 339 ms 25464 KB Output is correct
39 Correct 335 ms 25592 KB Output is correct
40 Correct 363 ms 26360 KB Output is correct
41 Correct 340 ms 27000 KB Output is correct
42 Correct 361 ms 27256 KB Output is correct
43 Correct 377 ms 26616 KB Output is correct
44 Correct 386 ms 26360 KB Output is correct
45 Correct 382 ms 26584 KB Output is correct
46 Correct 361 ms 26744 KB Output is correct
47 Correct 378 ms 27536 KB Output is correct
48 Correct 374 ms 27384 KB Output is correct
49 Correct 360 ms 27384 KB Output is correct
50 Correct 391 ms 27640 KB Output is correct
51 Correct 395 ms 27640 KB Output is correct
52 Correct 253 ms 26616 KB Output is correct
53 Correct 248 ms 26616 KB Output is correct
54 Correct 287 ms 26592 KB Output is correct
55 Correct 252 ms 26616 KB Output is correct
56 Correct 389 ms 27768 KB Output is correct
57 Correct 327 ms 27644 KB Output is correct
58 Correct 324 ms 27640 KB Output is correct
59 Correct 331 ms 27768 KB Output is correct
60 Correct 308 ms 27204 KB Output is correct
61 Correct 329 ms 27768 KB Output is correct
62 Correct 327 ms 27640 KB Output is correct
63 Correct 324 ms 27640 KB Output is correct
64 Correct 315 ms 27384 KB Output is correct
65 Correct 334 ms 27768 KB Output is correct