oj.uz

Submission #212054

# Submission time Handle Problem Language Result Execution time Memory
212054 2020-03-22T07:50:15 Z Just_Solve_The_Problem Building 4 (JOI20_building4) C++11
100 / 100
 423 ms 26220 KB 
#include <bits/stdc++.h>

using namespace std;

#define fr first
#define sc second

const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;

int a[N + N], b[N + N];
int n;
pair <int, int> dp[N + N][2];

main() {
  scanf("%d", &n);
  for (int i = 1; i <= n + n; i++) {
  	scanf("%d", &a[i]);
  }
  for (int i = 1; i <= n + n; i++) {
  	scanf("%d", &b[i]);
  }
  dp[1][0] = {1, 1};
	dp[1][1] = {0, 0};
	for (int i = 2; i <= n + n; i++) {
		int l, r;
		l = inf;
		r = 0;
		if (a[i - 1] <= a[i]) {
			l = min(l, dp[i - 1][0].fr + 1);
			r = max(r, dp[i - 1][0].sc + 1);
		}
		if (b[i - 1] <= a[i]) {   
			l = min(l, dp[i - 1][1].fr + 1);
			r = max(r, dp[i - 1][1].sc + 1);
		}
		dp[i][0] = {l, r};
		l = inf;
		r = 0;
		if (a[i - 1] <= b[i]) {
			l = min(l, dp[i - 1][0].fr);
			r = max(r, dp[i - 1][0].sc);
		}
		if (b[i - 1] <= b[i]) {
			l = min(l, dp[i - 1][1].fr);
			r = max(r, dp[i - 1][1].sc);
		}
		dp[i][1] = {l, r};
	}
	/*
	for (int i = 1; i <= n + n; i++) {
		cout << dp[i][0].fr << ' ' << dp[i][0].sc << ' ' << dp[i][1].fr << ' ' << dp[i][1].sc << '\n';
	}
	*/
	int lst = -1;
	if (dp[n + n][0].fr <= n && n <= dp[n + n][0].sc) {
		lst = 0;
	}
	if (dp[n + n][1].fr <= n && n <= dp[n + n][1].sc) {
		lst = 1;
	}
	if (lst == -1) {
		cout << lst;
		return 0;
	}
	int cur = n;
	string ans;
	int val = inf;
	for (int i = n + n; i >= 1; i--) {
		if (dp[i][lst].fr <= cur && cur <= dp[i][lst].sc && ((lst == 0) ? a[i] : b[i]) <= val) {
			ans.push_back(lst + 'A');
		} else {
			lst ^= 1;
			ans.push_back(lst + 'A');
		}
		val = (lst == 0) ? a[i] : b[i];
		cur -= (lst == 0);
	} 
	reverse(ans.begin(), ans.end());
	cout << ans << '\n';
}

Compilation message

building4.cpp:15:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
building4.cpp: In function 'int main()':
building4.cpp:16:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
   ~~~~~^~~~~~~~~~
building4.cpp:18:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &a[i]);
    ~~~~~^~~~~~~~~~~~~
building4.cpp:21:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &b[i]);
    ~~~~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 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 5 ms 384 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 7 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 6 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 6 ms 384 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 5 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 5 ms 384 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 7 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 6 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 407 ms 23476 KB Output is correct
35 Correct 368 ms 24112 KB Output is correct
36 Correct 366 ms 23728 KB Output is correct
37 Correct 373 ms 24256 KB Output is correct
38 Correct 334 ms 24112 KB Output is correct
39 Correct 332 ms 24368 KB Output is correct
40 Correct 365 ms 25836 KB Output is correct
41 Correct 313 ms 24752 KB Output is correct
42 Correct 376 ms 25264 KB Output is correct
43 Correct 423 ms 26092 KB Output is correct
44 Correct 409 ms 26172 KB Output is correct
45 Correct 412 ms 25960 KB Output is correct
46 Correct 372 ms 25964 KB Output is correct
47 Correct 364 ms 25964 KB Output is correct
48 Correct 357 ms 25964 KB Output is correct
49 Correct 360 ms 25964 KB Output is correct
50 Correct 394 ms 26220 KB Output is correct
51 Correct 386 ms 26096 KB Output is correct
52 Correct 283 ms 25964 KB Output is correct
53 Correct 282 ms 25964 KB Output is correct
54 Correct 251 ms 25964 KB Output is correct
55 Correct 251 ms 25968 KB Output is correct
56 Correct 352 ms 25964 KB Output is correct
57 Correct 313 ms 25836 KB Output is correct
58 Correct 316 ms 26096 KB Output is correct
59 Correct 314 ms 25964 KB Output is correct
60 Correct 303 ms 24368 KB Output is correct
61 Correct 342 ms 25964 KB Output is correct
62 Correct 316 ms 25580 KB Output is correct
63 Correct 317 ms 25964 KB Output is correct
64 Correct 311 ms 25264 KB Output is correct
65 Correct 326 ms 25960 KB Output is correct