답안 #229649

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
229649 2020-05-05T16:13:48 Z dolphingarlic 건물 4 (JOI20_building4) C++14
100 / 100
325 ms 30188 KB
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

int a[1000001], b[1000001];
pair<int, int> dp[1000001][2];

void upd(pair<int, int> &X, pair<int, int> &Y) {
	X.first = min(X.first, Y.first);
	X.second = max(X.second, Y.second);
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	FOR(i, 1, 2 * n + 1) cin >> a[i];
	FOR(i, 1, 2 * n + 1) cin >> b[i];
	dp[0][0] = dp[0][1] = {0, 0};
	FOR(i, 1, 2 * n + 1) {
		dp[i][0] = dp[i][1] = {n + 1, -n - 1};
		if (a[i] >= a[i - 1]) upd(dp[i][0], dp[i - 1][0]);
		if (a[i] >= b[i - 1]) upd(dp[i][0], dp[i - 1][1]);
		if (b[i] >= a[i - 1]) upd(dp[i][1], dp[i - 1][0]);
		if (b[i] >= b[i - 1]) upd(dp[i][1], dp[i - 1][1]);
		dp[i][1].first++, dp[i][1].second++;
	}

	string ans = "";
	for (int i = 2 * n, curr = INT_MAX; i; i--) {
		if (a[i] > curr || dp[i][0].first > n || dp[i][0].second < n) {
			if (b[i] > curr || dp[i][1].first > n || dp[i][1].second < n) return cout << -1, 0;
			ans += "B", curr = b[i], n--;
		} else ans += "A", curr = a[i];
	}
	
	reverse(ans.begin(), ans.end());
	cout << ans;
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 5 ms 640 KB Output is correct
26 Correct 7 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 5 ms 640 KB Output is correct
26 Correct 7 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 304 ms 27876 KB Output is correct
35 Correct 291 ms 28468 KB Output is correct
36 Correct 304 ms 27952 KB Output is correct
37 Correct 301 ms 28580 KB Output is correct
38 Correct 292 ms 28648 KB Output is correct
39 Correct 287 ms 24368 KB Output is correct
40 Correct 308 ms 25964 KB Output is correct
41 Correct 284 ms 29104 KB Output is correct
42 Correct 302 ms 25264 KB Output is correct
43 Correct 325 ms 26008 KB Output is correct
44 Correct 306 ms 26092 KB Output is correct
45 Correct 315 ms 26092 KB Output is correct
46 Correct 300 ms 26040 KB Output is correct
47 Correct 312 ms 26092 KB Output is correct
48 Correct 290 ms 30188 KB Output is correct
49 Correct 309 ms 26092 KB Output is correct
50 Correct 312 ms 26092 KB Output is correct
51 Correct 320 ms 26092 KB Output is correct
52 Correct 181 ms 27884 KB Output is correct
53 Correct 194 ms 27812 KB Output is correct
54 Correct 177 ms 27740 KB Output is correct
55 Correct 190 ms 27756 KB Output is correct
56 Correct 293 ms 25964 KB Output is correct
57 Correct 261 ms 27116 KB Output is correct
58 Correct 281 ms 27280 KB Output is correct
59 Correct 268 ms 27156 KB Output is correct
60 Correct 250 ms 25392 KB Output is correct
61 Correct 278 ms 26856 KB Output is correct
62 Correct 268 ms 26476 KB Output is correct
63 Correct 282 ms 26732 KB Output is correct
64 Correct 257 ms 25776 KB Output is correct
65 Correct 268 ms 26460 KB Output is correct