Submission #283502

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
283502	2020-08-25T21:12:04 Z	ChrisT	Building 4 (JOI20_building4)	C++17	100 / 100	467 ms	48248 KB

building4

#include <bits/stdc++.h>
using namespace std;
const int MN = 1e6 + 5, INF = 1e9;
int a[MN][2], dp[MN][2][2], ans[MN];
int main () {
	int n;
	scanf ("%d",&n); n*=2;
	for (int i = 1; i <= n; i++) scanf ("%d",&a[i][0]);
	for (int i = 1; i <= n; i++) scanf ("%d",&a[i][1]);
	dp[1][0][0] = dp[1][0][1] = 0;
	dp[1][1][0] = dp[1][1][1] = 1;
	for (int i = 2; i <= n; i++) {
		dp[i][0][0] = dp[i][1][0] = INF; dp[i][0][1] = dp[i][1][1] = -INF;
		for (int take = 0; take < 2; take++) {
			for (int lst = 0; lst < 2; lst++) if (a[i][take] >= a[i-1][lst]) {
				dp[i][take][0] = min(dp[i][take][0],dp[i-1][lst][0]+take);
				dp[i][take][1] = max(dp[i][take][1],dp[i-1][lst][1]+take);
			}
		}
	}
	int cur = n, take = -1, need = n/2;
	if (dp[n][0][0] <= need && need <= dp[n][0][1]) take = 0;
	else if (dp[n][1][0] <= need && need <= dp[n][1][1]) take = 1;
	if (!~take) return !printf ("-1\n");
	ans[n] = take; need -= take == 1;
	while (cur > 1) {
		if (a[cur-1][0] <= a[cur][take] && dp[cur-1][0][0] <= need && need <= dp[cur-1][0][1]) take = 0;
		else take = 1, need--;
		ans[--cur] = take;
	} 
	for (int i = 1; i <= n; i++) printf ("%c",ans[i] ? 'B' : 'A');
	printf ("\n");
	return 0;
}

Compilation message

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

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	2 ms	512 KB	Output is correct
7	Correct	3 ms	544 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	2 ms	512 KB	Output is correct
10	Correct	2 ms	512 KB	Output is correct
11	Correct	2 ms	512 KB	Output is correct
12	Correct	2 ms	512 KB	Output is correct
13	Correct	3 ms	512 KB	Output is correct
14	Correct	2 ms	512 KB	Output is correct
15	Correct	2 ms	512 KB	Output is correct
16	Correct	2 ms	640 KB	Output is correct
17	Correct	2 ms	512 KB	Output is correct
18	Correct	2 ms	512 KB	Output is correct
19	Correct	2 ms	512 KB	Output is correct
20	Correct	2 ms	512 KB	Output is correct
21	Correct	2 ms	512 KB	Output is correct
22	Correct	2 ms	512 KB	Output is correct
23	Correct	2 ms	512 KB	Output is correct
24	Correct	3 ms	512 KB	Output is correct
25	Correct	3 ms	512 KB	Output is correct
26	Correct	2 ms	512 KB	Output is correct
27	Correct	2 ms	512 KB	Output is correct
28	Correct	3 ms	512 KB	Output is correct
29	Correct	2 ms	512 KB	Output is correct
30	Correct	2 ms	512 KB	Output is correct
31	Correct	2 ms	512 KB	Output is correct
32	Correct	2 ms	512 KB	Output is correct
33	Correct	2 ms	512 KB	Output is correct
34	Correct	413 ms	42488 KB	Output is correct
35	Correct	445 ms	44536 KB	Output is correct
36	Correct	411 ms	43900 KB	Output is correct
37	Correct	467 ms	44832 KB	Output is correct
38	Correct	385 ms	44768 KB	Output is correct
39	Correct	434 ms	43896 KB	Output is correct
40	Correct	401 ms	47736 KB	Output is correct
41	Correct	382 ms	45052 KB	Output is correct
42	Correct	409 ms	46456 KB	Output is correct
43	Correct	458 ms	48120 KB	Output is correct
44	Correct	456 ms	48120 KB	Output is correct
45	Correct	453 ms	47992 KB	Output is correct
46	Correct	405 ms	48248 KB	Output is correct
47	Correct	400 ms	47096 KB	Output is correct
48	Correct	391 ms	46968 KB	Output is correct
49	Correct	396 ms	47736 KB	Output is correct
50	Correct	452 ms	47220 KB	Output is correct
51	Correct	450 ms	47224 KB	Output is correct
52	Correct	316 ms	36472 KB	Output is correct
53	Correct	316 ms	36348 KB	Output is correct
54	Correct	289 ms	36348 KB	Output is correct
55	Correct	295 ms	35992 KB	Output is correct
56	Correct	446 ms	48248 KB	Output is correct
57	Correct	409 ms	43128 KB	Output is correct
58	Correct	343 ms	43256 KB	Output is correct
59	Correct	337 ms	43384 KB	Output is correct
60	Correct	323 ms	41208 KB	Output is correct
61	Correct	346 ms	43884 KB	Output is correct
62	Correct	337 ms	43256 KB	Output is correct
63	Correct	340 ms	43768 KB	Output is correct
64	Correct	338 ms	42236 KB	Output is correct
65	Correct	342 ms	43768 KB	Output is correct

Submission #283502

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 89.0 / 89.0

Subtask #1
11.0 / 11.0

Subtask #2
89.0 / 89.0