Submission #544739

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
544739	2022-04-02T16:17:43 Z	rainboy	Alternating Current (BOI18_alternating)	C	100 / 100	46 ms	4908 KB

alternating

#include <stdio.h>
#include <string.h>

#define N	100000
#define M	100000

int max(int a, int b) { return a > b ? a : b; }

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

int ll[M], rr[M];

void sort(int *hh, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, h = hh[l + rand_() % (r - l)], tmp;

		while (j < k)
			if (ll[hh[j]] == ll[h])
				j++;
			else if (ll[hh[j]] < ll[h]) {
				tmp = hh[i], hh[i] = hh[j], hh[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = hh[j], hh[j] = hh[k], hh[k] = tmp;
			}
		sort(hh, l, i);
		l = k;
	}
}

int main() {
	static int kk[N * 2 + 1], hh[M], hh_[N * 2], ii[M], qu[M];
	static char ans[M + 1];
	int n, m, h, h_, i, cnt, cnt_, tmp;

	scanf("%d%d", &n, &m);
	h_ = 0;
	for (h = 0; h < m; h++) {
		scanf("%d%d", &ll[h], &rr[h]), ll[h]--, rr[h]--;
		if (h_ == -1 || (rr[h_] - ll[h_] + n) % n < (rr[h] - ll[h] + n) % n)
			h_ = h;
	}
	for (h = 0; h < m; h++)
		if (h != h_)
			ll[h] = (ll[h] - ll[h_] + n) % n, rr[h] = (rr[h] - ll[h_] + n) % n;
	rr[h_] = (rr[h_] - ll[h_] + n) % n, ll[h_] = 0;
	for (h = 0; h < m; h++) {
		if (rr[h] < ll[h])
			rr[h] += n;
		kk[ll[h]]++, kk[rr[h] + 1]--;
	}
	for (i = 1; i < n * 2; i++)
		kk[i] += kk[i - 1];
	for (i = 0; i < n; i++) {
		if (kk[i] + kk[n + i] < 2) {
			printf("impossible\n");
			return 0;
		}
		kk[i] = kk[n + i] = kk[i] + kk[n + i] == 2;
	}
	for (i = 1; i < n * 2; i++)
		kk[i] += kk[i - 1];
	for (h = 1; h < m; h++)
		hh[h] = h;
	hh[0] = h_, hh[h_] = 0;
	sort(hh, 1, m);
	memset(hh_, -1, n * 2 * sizeof *hh_);
	ii[0] = -1, hh_[rr[h_]] = h_;
	for (h = 1, i = 0; h < m; h++) {
		h_ = hh[h];
		while (i < n + n && (i + 1 < ll[h_] || hh_[i] == -1))
			i++;
		if (i < rr[h_] && kk[i] - (ll[h_] == 0 ? 0 : kk[ll[h_] - 1]) == 0)
			ii[h_] = i, hh_[rr[h_]] = h_;
		else
			ii[h_] = -1;
	}
	for (i = -1; i < n - 1; i++) {
		if (hh_[n + i] != -1)
			break;
		if (i <= rr[0] && kk[n + 1 + i] - kk[n + i] > 0) {
			i = n - 1;
			break;
		}
	}
	if (i == n - 1) {
		printf("impossible\n");
		return 0;
	}
	h = hh_[n + i];
	cnt = 0;
	while (h != hh[0])
		qu[cnt++] = h, h = hh_[ii[h]];
	qu[cnt++] = h;
	for (h = 0, h_ = cnt - 1; h < h_; h++, h_--)
		tmp = qu[h], qu[h] = qu[h_], qu[h_] = tmp;
	cnt_ = 0;
	for (h = 0; h < cnt; h++) {
		while (cnt_ > 1 && ll[qu[h]] < rr[qu[cnt_ - 2]] + 1)
			cnt_--;
		qu[cnt_++] = qu[h];
	}
	cnt = cnt_;
	h = 0;
	while (h + 1 < cnt && ll[qu[h + 1]] < rr[qu[cnt - 1]] - n + 1)
		h++;
	memset(ans, '0', m * sizeof *ans);
	while (h < cnt)
		ans[qu[h++]] = '1';
	printf("%s\n", ans);
	return 0;
}

Compilation message

alternating.c: In function 'main':
alternating.c:41:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |  scanf("%d%d", &n, &m);
      |  ^~~~~~~~~~~~~~~~~~~~~
alternating.c:44:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |   scanf("%d%d", &ll[h], &rr[h]), ll[h]--, rr[h]--;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	296 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	296 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	292 KB	Output is correct
23	Correct	0 ms	296 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	216 KB	Output is correct
26	Correct	0 ms	296 KB	Output is correct
27	Correct	1 ms	296 KB	Output is correct
28	Correct	0 ms	296 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	296 KB	Output is correct
34	Correct	1 ms	292 KB	Output is correct
35	Correct	1 ms	256 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct
37	Correct	0 ms	212 KB	Output is correct
38	Correct	0 ms	212 KB	Output is correct
39	Correct	0 ms	212 KB	Output is correct
40	Correct	1 ms	212 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	296 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	296 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	292 KB	Output is correct
23	Correct	0 ms	296 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	216 KB	Output is correct
26	Correct	0 ms	296 KB	Output is correct
27	Correct	1 ms	296 KB	Output is correct
28	Correct	0 ms	296 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	296 KB	Output is correct
34	Correct	1 ms	292 KB	Output is correct
35	Correct	1 ms	256 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct
37	Correct	0 ms	212 KB	Output is correct
38	Correct	0 ms	212 KB	Output is correct
39	Correct	0 ms	212 KB	Output is correct
40	Correct	1 ms	212 KB	Output is correct
41	Correct	1 ms	212 KB	Output is correct
42	Correct	0 ms	212 KB	Output is correct
43	Correct	0 ms	212 KB	Output is correct
44	Correct	0 ms	212 KB	Output is correct
45	Correct	0 ms	212 KB	Output is correct
46	Correct	0 ms	212 KB	Output is correct
47	Correct	0 ms	212 KB	Output is correct
48	Correct	0 ms	212 KB	Output is correct
49	Correct	0 ms	212 KB	Output is correct
50	Correct	0 ms	212 KB	Output is correct
51	Correct	0 ms	212 KB	Output is correct
52	Correct	0 ms	340 KB	Output is correct
53	Correct	0 ms	296 KB	Output is correct
54	Correct	1 ms	296 KB	Output is correct
55	Correct	0 ms	212 KB	Output is correct
56	Correct	1 ms	296 KB	Output is correct
57	Correct	1 ms	296 KB	Output is correct
58	Correct	1 ms	212 KB	Output is correct
59	Correct	1 ms	212 KB	Output is correct
60	Correct	1 ms	212 KB	Output is correct
61	Correct	0 ms	212 KB	Output is correct
62	Correct	0 ms	212 KB	Output is correct
63	Correct	0 ms	212 KB	Output is correct
64	Correct	0 ms	300 KB	Output is correct
65	Correct	0 ms	212 KB	Output is correct
66	Correct	0 ms	212 KB	Output is correct
67	Correct	0 ms	212 KB	Output is correct
68	Correct	0 ms	212 KB	Output is correct
69	Correct	0 ms	292 KB	Output is correct

Subtask #3
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	296 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	296 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	292 KB	Output is correct
23	Correct	0 ms	296 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	216 KB	Output is correct
26	Correct	0 ms	296 KB	Output is correct
27	Correct	1 ms	296 KB	Output is correct
28	Correct	0 ms	296 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	296 KB	Output is correct
34	Correct	1 ms	292 KB	Output is correct
35	Correct	1 ms	256 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct
37	Correct	0 ms	212 KB	Output is correct
38	Correct	0 ms	212 KB	Output is correct
39	Correct	0 ms	212 KB	Output is correct
40	Correct	1 ms	212 KB	Output is correct
41	Correct	1 ms	212 KB	Output is correct
42	Correct	0 ms	212 KB	Output is correct
43	Correct	0 ms	212 KB	Output is correct
44	Correct	0 ms	212 KB	Output is correct
45	Correct	0 ms	212 KB	Output is correct
46	Correct	0 ms	212 KB	Output is correct
47	Correct	0 ms	212 KB	Output is correct
48	Correct	0 ms	212 KB	Output is correct
49	Correct	0 ms	212 KB	Output is correct
50	Correct	0 ms	212 KB	Output is correct
51	Correct	0 ms	212 KB	Output is correct
52	Correct	0 ms	340 KB	Output is correct
53	Correct	0 ms	296 KB	Output is correct
54	Correct	1 ms	296 KB	Output is correct
55	Correct	0 ms	212 KB	Output is correct
56	Correct	1 ms	296 KB	Output is correct
57	Correct	1 ms	296 KB	Output is correct
58	Correct	1 ms	212 KB	Output is correct
59	Correct	1 ms	212 KB	Output is correct
60	Correct	1 ms	212 KB	Output is correct
61	Correct	0 ms	212 KB	Output is correct
62	Correct	0 ms	212 KB	Output is correct
63	Correct	0 ms	212 KB	Output is correct
64	Correct	0 ms	300 KB	Output is correct
65	Correct	0 ms	212 KB	Output is correct
66	Correct	0 ms	212 KB	Output is correct
67	Correct	0 ms	212 KB	Output is correct
68	Correct	0 ms	212 KB	Output is correct
69	Correct	0 ms	292 KB	Output is correct
70	Correct	0 ms	340 KB	Output is correct
71	Correct	1 ms	296 KB	Output is correct
72	Correct	1 ms	340 KB	Output is correct
73	Correct	1 ms	340 KB	Output is correct
74	Correct	0 ms	340 KB	Output is correct
75	Correct	0 ms	212 KB	Output is correct
76	Correct	1 ms	292 KB	Output is correct
77	Correct	1 ms	340 KB	Output is correct
78	Correct	1 ms	212 KB	Output is correct
79	Correct	0 ms	212 KB	Output is correct
80	Correct	1 ms	212 KB	Output is correct
81	Correct	1 ms	300 KB	Output is correct
82	Correct	0 ms	340 KB	Output is correct
83	Correct	1 ms	340 KB	Output is correct
84	Correct	1 ms	340 KB	Output is correct
85	Correct	0 ms	300 KB	Output is correct
86	Correct	0 ms	212 KB	Output is correct
87	Correct	1 ms	344 KB	Output is correct
88	Correct	0 ms	340 KB	Output is correct
89	Correct	0 ms	212 KB	Output is correct
90	Correct	1 ms	340 KB	Output is correct
91	Correct	0 ms	296 KB	Output is correct
92	Correct	1 ms	340 KB	Output is correct
93	Correct	1 ms	344 KB	Output is correct
94	Correct	0 ms	212 KB	Output is correct
95	Correct	1 ms	340 KB	Output is correct
96	Correct	1 ms	340 KB	Output is correct
97	Correct	1 ms	300 KB	Output is correct
98	Correct	1 ms	352 KB	Output is correct

Subtask #4
19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	4460 KB	Output is correct
2	Correct	2 ms	1876 KB	Output is correct
3	Correct	12 ms	1904 KB	Output is correct
4	Correct	17 ms	3276 KB	Output is correct
5	Correct	42 ms	4816 KB	Output is correct
6	Correct	23 ms	2892 KB	Output is correct
7	Correct	36 ms	4660 KB	Output is correct
8	Correct	3 ms	1876 KB	Output is correct
9	Correct	2 ms	1708 KB	Output is correct
10	Correct	42 ms	4908 KB	Output is correct
11	Correct	36 ms	4112 KB	Output is correct
12	Correct	34 ms	4428 KB	Output is correct
13	Correct	1 ms	980 KB	Output is correct
14	Correct	1 ms	980 KB	Output is correct
15	Correct	40 ms	4680 KB	Output is correct
16	Correct	12 ms	1904 KB	Output is correct
17	Correct	36 ms	4672 KB	Output is correct
18	Correct	29 ms	2944 KB	Output is correct
19	Correct	3 ms	1068 KB	Output is correct
20	Correct	34 ms	4048 KB	Output is correct

Subtask #5
26.0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	296 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	296 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	292 KB	Output is correct
23	Correct	0 ms	296 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	216 KB	Output is correct
26	Correct	0 ms	296 KB	Output is correct
27	Correct	1 ms	296 KB	Output is correct
28	Correct	0 ms	296 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	296 KB	Output is correct
34	Correct	1 ms	292 KB	Output is correct
35	Correct	1 ms	256 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct
37	Correct	0 ms	212 KB	Output is correct
38	Correct	0 ms	212 KB	Output is correct
39	Correct	0 ms	212 KB	Output is correct
40	Correct	1 ms	212 KB	Output is correct
41	Correct	1 ms	212 KB	Output is correct
42	Correct	0 ms	212 KB	Output is correct
43	Correct	0 ms	212 KB	Output is correct
44	Correct	0 ms	212 KB	Output is correct
45	Correct	0 ms	212 KB	Output is correct
46	Correct	0 ms	212 KB	Output is correct
47	Correct	0 ms	212 KB	Output is correct
48	Correct	0 ms	212 KB	Output is correct
49	Correct	0 ms	212 KB	Output is correct
50	Correct	0 ms	212 KB	Output is correct
51	Correct	0 ms	212 KB	Output is correct
52	Correct	0 ms	340 KB	Output is correct
53	Correct	0 ms	296 KB	Output is correct
54	Correct	1 ms	296 KB	Output is correct
55	Correct	0 ms	212 KB	Output is correct
56	Correct	1 ms	296 KB	Output is correct
57	Correct	1 ms	296 KB	Output is correct
58	Correct	1 ms	212 KB	Output is correct
59	Correct	1 ms	212 KB	Output is correct
60	Correct	1 ms	212 KB	Output is correct
61	Correct	0 ms	212 KB	Output is correct
62	Correct	0 ms	212 KB	Output is correct
63	Correct	0 ms	212 KB	Output is correct
64	Correct	0 ms	300 KB	Output is correct
65	Correct	0 ms	212 KB	Output is correct
66	Correct	0 ms	212 KB	Output is correct
67	Correct	0 ms	212 KB	Output is correct
68	Correct	0 ms	212 KB	Output is correct
69	Correct	0 ms	292 KB	Output is correct
70	Correct	0 ms	340 KB	Output is correct
71	Correct	1 ms	296 KB	Output is correct
72	Correct	1 ms	340 KB	Output is correct
73	Correct	1 ms	340 KB	Output is correct
74	Correct	0 ms	340 KB	Output is correct
75	Correct	0 ms	212 KB	Output is correct
76	Correct	1 ms	292 KB	Output is correct
77	Correct	1 ms	340 KB	Output is correct
78	Correct	1 ms	212 KB	Output is correct
79	Correct	0 ms	212 KB	Output is correct
80	Correct	1 ms	212 KB	Output is correct
81	Correct	1 ms	300 KB	Output is correct
82	Correct	0 ms	340 KB	Output is correct
83	Correct	1 ms	340 KB	Output is correct
84	Correct	1 ms	340 KB	Output is correct
85	Correct	0 ms	300 KB	Output is correct
86	Correct	0 ms	212 KB	Output is correct
87	Correct	1 ms	344 KB	Output is correct
88	Correct	0 ms	340 KB	Output is correct
89	Correct	0 ms	212 KB	Output is correct
90	Correct	1 ms	340 KB	Output is correct
91	Correct	0 ms	296 KB	Output is correct
92	Correct	1 ms	340 KB	Output is correct
93	Correct	1 ms	344 KB	Output is correct
94	Correct	0 ms	212 KB	Output is correct
95	Correct	1 ms	340 KB	Output is correct
96	Correct	1 ms	340 KB	Output is correct
97	Correct	1 ms	300 KB	Output is correct
98	Correct	1 ms	352 KB	Output is correct
99	Correct	21 ms	4460 KB	Output is correct
100	Correct	2 ms	1876 KB	Output is correct
101	Correct	12 ms	1904 KB	Output is correct
102	Correct	17 ms	3276 KB	Output is correct
103	Correct	42 ms	4816 KB	Output is correct
104	Correct	23 ms	2892 KB	Output is correct
105	Correct	36 ms	4660 KB	Output is correct
106	Correct	3 ms	1876 KB	Output is correct
107	Correct	2 ms	1708 KB	Output is correct
108	Correct	42 ms	4908 KB	Output is correct
109	Correct	36 ms	4112 KB	Output is correct
110	Correct	34 ms	4428 KB	Output is correct
111	Correct	1 ms	980 KB	Output is correct
112	Correct	1 ms	980 KB	Output is correct
113	Correct	40 ms	4680 KB	Output is correct
114	Correct	12 ms	1904 KB	Output is correct
115	Correct	36 ms	4672 KB	Output is correct
116	Correct	29 ms	2944 KB	Output is correct
117	Correct	3 ms	1068 KB	Output is correct
118	Correct	34 ms	4048 KB	Output is correct
119	Correct	3 ms	1876 KB	Output is correct
120	Correct	31 ms	4016 KB	Output is correct
121	Correct	20 ms	3128 KB	Output is correct
122	Correct	1 ms	256 KB	Output is correct
123	Correct	2 ms	1108 KB	Output is correct
124	Correct	15 ms	1692 KB	Output is correct
125	Correct	14 ms	2644 KB	Output is correct
126	Correct	2 ms	1876 KB	Output is correct
127	Correct	6 ms	2132 KB	Output is correct
128	Correct	34 ms	4200 KB	Output is correct
129	Correct	21 ms	3380 KB	Output is correct
130	Correct	29 ms	3632 KB	Output is correct
131	Correct	3 ms	1876 KB	Output is correct
132	Correct	2 ms	1876 KB	Output is correct
133	Correct	46 ms	4676 KB	Output is correct
134	Correct	14 ms	2636 KB	Output is correct
135	Correct	3 ms	1832 KB	Output is correct
136	Correct	16 ms	2096 KB	Output is correct
137	Correct	21 ms	2528 KB	Output is correct
138	Correct	3 ms	1844 KB	Output is correct

Submission #544739

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 20.0 / 20.0

Subtask #3 22.0 / 22.0

Subtask #4 19.0 / 19.0

Subtask #5 26.0 / 26.0

Subtask #1
13.0 / 13.0

Subtask #2
20.0 / 20.0

Subtask #3
22.0 / 22.0

Subtask #4
19.0 / 19.0

Subtask #5
26.0 / 26.0