oj.uz

Submission #224058

# Submission time Handle Problem Language Result Execution time Memory
224058 2020-04-17T06:50:35 Z wakaka Building 4 (JOI20_building4) C++14
100 / 100
 522 ms 131692 KB 
#include <bits/stdc++.h>
using namespace std;
//#define cerr if (false) cerr
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define dbv(v) cerr << #v << "="; for (auto _x : v) cerr << _x << ", "; cerr << endl
#define dba(a, n) cerr << #a << "="; for (int _i = 0; _i < (n); ++_i) cerr << a[_i] << ", "; cerr << endl
template <typename A, typename B>
ostream& operator<<(ostream& os, const pair<A, B>& x) {
	return os << "(" << x.first << "," << x.second << ")";
}
typedef long long ll;
typedef long double ld;
int main() {
	int n;
	scanf("%d", &n);
	vector<vector<int>> A(2 * n, vector<int>(2));
	vector<vector<pair<int, int>>> dp(2 * n, vector<pair<int, int>>(2));
	for (int j = 0; j < 2; ++j)
		for (int i = 0; i < 2 * n; ++i) scanf("%d", &A[i][j]);
	dp[0][0] = {1, 1};
	for (int i = 1; i < 2 * n; ++i) {
		for (int j = 0; j < 2; ++j) {
			dp[i][j] = {INT_MAX, INT_MIN};
			for (int k = 0; k < 2; ++k) {
				if (A[i - 1][k] <= A[i][j]) {
					dp[i][j].first = min(dp[i][j].first, dp[i - 1][k].first);
					dp[i][j].second = max(dp[i][j].second, dp[i - 1][k].second);
				}
			}
		}
		if (dp[i][0].first != INT_MAX) {
			dp[i][0].first++;
			dp[i][0].second++;
		}
	}
	bool has = false;
	for (int j = 0; j < 2; ++j) {
		if (dp[2 * n - 1][j].first <= n && n <= dp[2 * n - 1][j].second) {
			has = true;
			break;
		}
	}
	if (!has) printf("-1\n");
	else {
		string ans;
		int as = n;
		int las = INT_MAX;
		for (int i = 2 * n - 1; i >= 0; --i) {
			if (dp[i][0].first <= as && as <= dp[i][0].second && A[i][0] <= las) {
				--as;
				ans += 'A';
				las = A[i][0];
			} else {
				assert(dp[i][1].first <= as && as <= dp[i][1].second && A[i][1] <= las);
				ans += 'B';
				las = A[i][1];
			}
		}
		assert(as == 0);
		reverse(ans.begin(), ans.end());
		printf("%s\n", ans.c_str());
	}
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:17:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
building4.cpp:21:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   for (int i = 0; i < 2 * n; ++i) scanf("%d", &A[i][j]);
                                   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 9 ms 768 KB Output is correct
6 Correct 6 ms 768 KB Output is correct
7 Correct 6 ms 768 KB Output is correct
8 Correct 7 ms 768 KB Output is correct
9 Correct 8 ms 768 KB Output is correct
10 Correct 6 ms 768 KB Output is correct
11 Correct 7 ms 768 KB Output is correct
12 Correct 7 ms 896 KB Output is correct
13 Correct 7 ms 896 KB Output is correct
14 Correct 7 ms 896 KB Output is correct
15 Correct 6 ms 896 KB Output is correct
16 Correct 7 ms 768 KB Output is correct
17 Correct 7 ms 896 KB Output is correct
18 Correct 7 ms 768 KB Output is correct
19 Correct 7 ms 896 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 6 ms 768 KB Output is correct
22 Correct 6 ms 768 KB Output is correct
23 Correct 6 ms 768 KB Output is correct
24 Correct 7 ms 896 KB Output is correct
25 Correct 6 ms 768 KB Output is correct
26 Correct 6 ms 768 KB Output is correct
27 Correct 6 ms 768 KB Output is correct
28 Correct 6 ms 768 KB Output is correct
29 Correct 7 ms 768 KB Output is correct
30 Correct 7 ms 768 KB Output is correct
31 Correct 6 ms 768 KB Output is correct
32 Correct 6 ms 768 KB Output is correct
33 Correct 6 ms 768 KB Output is correct
34 Correct 522 ms 127224 KB Output is correct
35 Correct 468 ms 121776 KB Output is correct
36 Correct 479 ms 119856 KB Output is correct
37 Correct 475 ms 122340 KB Output is correct
38 Correct 428 ms 122252 KB Output is correct
39 Correct 426 ms 121904 KB Output is correct
40 Correct 473 ms 130412 KB Output is correct
41 Correct 399 ms 124208 KB Output is correct
42 Correct 480 ms 127184 KB Output is correct
43 Correct 515 ms 131412 KB Output is correct
44 Correct 509 ms 131488 KB Output is correct
45 Correct 520 ms 131352 KB Output is correct
46 Correct 470 ms 131436 KB Output is correct
47 Correct 473 ms 130796 KB Output is correct
48 Correct 466 ms 130540 KB Output is correct
49 Correct 464 ms 131196 KB Output is correct
50 Correct 510 ms 130624 KB Output is correct
51 Correct 508 ms 130572 KB Output is correct
52 Correct 396 ms 119700 KB Output is correct
53 Correct 402 ms 119788 KB Output is correct
54 Correct 374 ms 119660 KB Output is correct
55 Correct 382 ms 119404 KB Output is correct
56 Correct 456 ms 131692 KB Output is correct
57 Correct 418 ms 125932 KB Output is correct
58 Correct 422 ms 126572 KB Output is correct
59 Correct 418 ms 126572 KB Output is correct
60 Correct 398 ms 119340 KB Output is correct
61 Correct 420 ms 127212 KB Output is correct
62 Correct 412 ms 125420 KB Output is correct
63 Correct 429 ms 127212 KB Output is correct
64 Correct 409 ms 122816 KB Output is correct
65 Correct 423 ms 127212 KB Output is correct