Submission #626019

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
626019	2022-08-11T06:30:00 Z	happypotato	Radio Towers (IOI22_towers)	C++17	41 / 100	4000 ms	8640 KB

towers

#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll int, ll int>
#define ff first
#define ss second
#define pb push_back
// globals
const int mxN = 1e5 + 1;
const int MIN = -1e9, MAX = 1e9;
bool isst1 = true;
int st1point;
int n;
vector<int> h;
int peaks[mxN];
void init(int N, vector<int> H) {
	n = N; h = H;
	if (true) {
		bool isasc = true;
		for (int i = 1; i < n; i++) {
			if (h[i - 1] < h[i]) {
				if (!isasc) {
					isst1 = false;
					break;
				}
			} else {
				if (isasc) {
					isasc = false;
					st1point = i - 1;
				}
			}
		}
		if (isasc) st1point = n - 1;
	}
	if (isst1) return;
	peaks[0] = peaks[1] = 0;
	for (int i = 1; i < n; i++) {
		peaks[i + 1] = peaks[i] + (h[i - 1] < h[i] && h[i] > h[i + 1]);
	}
	peaks[n] = peaks[n - 1];
}
// Q = 1
int take[mxN], tower[mxN];
pii seg[4 * mxN];
pii lazy[4 * mxN];
bool marked[4 * mxN];
void pushup(int idx) {
	seg[idx].ff = max(seg[(idx << 1)].ff, seg[(idx << 1) | 1].ff);
	seg[idx].ss = min(seg[(idx << 1)].ss, seg[(idx << 1) | 1].ss);
}
void pushdown(int idx) {
	if (marked[idx]) {
		if (lazy[idx].ff != MAX) {
			seg[(idx << 1)].ff = min(seg[(idx << 1)].ff, lazy[idx].ff);
			seg[(idx << 1) | 1].ff = min(seg[(idx << 1) | 1].ff, lazy[idx].ff);
			lazy[(idx << 1)].ff = min(lazy[(idx << 1)].ff, lazy[idx].ff);
			lazy[(idx << 1) | 1].ff = min(lazy[(idx << 1) | 1].ff, lazy[idx].ff);
			lazy[idx].ff = MAX;
		}
		if (lazy[idx].ss != MIN) {
			seg[(idx << 1)].ss = max(seg[(idx << 1)].ss, lazy[idx].ss);
			seg[(idx << 1) | 1].ss = max(seg[(idx << 1) | 1].ss, lazy[idx].ss);
			lazy[(idx << 1)].ss = max(lazy[(idx << 1)].ss, lazy[idx].ss);
			lazy[(idx << 1) | 1].ss = max(lazy[(idx << 1) | 1].ss, lazy[idx].ss);
			lazy[idx].ss = MIN;
		}
		marked[(idx << 1)] = true;
		marked[(idx << 1) | 1] = true;
		marked[idx] = false;
	}
}
void build() {
	for (int i = 0; i < 4 * mxN; i++) {
		seg[i] = {MAX, MIN};
		lazy[i] = {MAX, MIN};
	}
}
void update(int tl, int tr, bool istower, int val, int l = 1, int r = n, int idx = 1) {
	if (tl > tr) return;
	if (tl <= l && r <= tr) {
		if (!istower) {
			seg[idx].ff = min(seg[idx].ff, val);
			lazy[idx].ff = min(lazy[idx].ff, val);
		} else {
			seg[idx].ss = max(seg[idx].ss, val);
			lazy[idx].ss = max(lazy[idx].ss, val);
		}
		marked[idx] = true;
		return;
	}
	pushdown(idx);
	int mid = (l + r) >> 1;
	if (tl <= mid) update(tl, min(tr, mid), istower, val, l, mid, (idx << 1));
	if (tr > mid) update(max(tl, mid + 1), tr, istower, val, mid + 1, r, (idx << 1) | 1);
	pushup(idx);
}
// query1 for finding takes: min s.t. < curval (-1 by hand)
int query1(int val, int l = 1, int r = n, int idx = 1) {
	// cerr << val << ' ' << l << ' ' << r << ' ' << seg[idx].ss << endl;
	if (seg[idx].ss >= val) return -1;
	if (l == r) return l;
	pushdown(idx);
	int mid = (l + r) >> 1;
	int ret = 0;
	ret = query1(val, l, mid, (idx << 1));
	if (ret != -1) return ret;
	ret = query1(val, mid + 1, r, (idx << 1) + 1);
	if (ret != -1) return ret;
	throw runtime_error("segtree died 1");
}
// query2 for finding towers: min s.t. > curval (-1 by hand)
int query2(int val, int l = 1, int r = n, int idx = 1) {
	// cerr << val << ' ' << l << ' ' << r << ' ' << seg[idx].ff << endl;
	if (seg[idx].ff <= val) return -1;
	if (l == r) return l;
	pushdown(idx);
	int mid = (l + r) >> 1;
	int ret = 0;
	ret = query2(val, l, mid, (idx << 1));
	if (ret != -1) return ret;
	ret = query2(val, mid + 1, r, (idx << 1) | 1);
	if (ret != -1) return ret;
	throw runtime_error("segtree died 2");
}
int max_towers(int L, int R, int D) {
	if (isst1) {
		if (L < st1point && st1point < R && h[st1point] - max(h[L], h[R]) >= D) return 2;
		else return 1;
	} else if (D == 1) {
		L++; R++;
		return 1 + max(0, peaks[R - 1] - peaks[L]);
	}
	build();
	// cerr << "CUR " << L << endl;
	take[L] = 1;
	tower[L] = 0;
	update(1, 1, false, h[L]);
	int ans = 1;
	int cnt = 1;
	for (int i = L + 1; i <= R; i++) {
		// cerr << "CUR " << i << endl;
		// tower
		tower[i] = query2(h[i] - D);
		if (tower[i] == -1) tower[i] = cnt;
		else tower[i]--;
		// cerr << "TOWER: " << tower[i] << endl;
		update(1, tower[i], true, h[i]);
		// take
		take[i] = query1(h[i] + D);
		if (take[i] == -1) take[i] = ++cnt;
		// cerr << "TAKE: " << take[i] << endl;
		update(1, take[i], false, h[i]);
		ans = max(ans, take[i]);
	}
	return ans;
}

Subtask #1
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	300 ms	976 KB	Output is correct
2	Correct	954 ms	1352 KB	Output is correct
3	Correct	705 ms	1448 KB	Output is correct
4	Correct	737 ms	1448 KB	Output is correct
5	Correct	821 ms	1448 KB	Output is correct
6	Correct	920 ms	1456 KB	Output is correct
7	Correct	779 ms	1488 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct

Subtask #2
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	6528 KB	Output is correct
2	Correct	4 ms	6608 KB	Output is correct
3	Correct	4 ms	6608 KB	Output is correct
4	Correct	4 ms	6480 KB	Output is correct
5	Correct	3 ms	6608 KB	Output is correct
6	Correct	3 ms	6608 KB	Output is correct
7	Correct	3 ms	6608 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	3 ms	6608 KB	Output is correct
11	Correct	4 ms	6480 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	0 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	208 KB	Output is correct
22	Correct	0 ms	208 KB	Output is correct
23	Correct	1 ms	208 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	4 ms	6480 KB	Output is correct
26	Correct	4 ms	6608 KB	Output is correct
27	Correct	4 ms	6572 KB	Output is correct
28	Correct	4 ms	6608 KB	Output is correct
29	Correct	4 ms	6608 KB	Output is correct
30	Correct	5 ms	6608 KB	Output is correct
31	Correct	4 ms	6608 KB	Output is correct
32	Correct	1 ms	208 KB	Output is correct
33	Correct	1 ms	208 KB	Output is correct
34	Correct	5 ms	6580 KB	Output is correct
35	Correct	4 ms	6608 KB	Output is correct

Subtask #3
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	6528 KB	Output is correct
2	Correct	4 ms	6608 KB	Output is correct
3	Correct	4 ms	6608 KB	Output is correct
4	Correct	4 ms	6480 KB	Output is correct
5	Correct	3 ms	6608 KB	Output is correct
6	Correct	3 ms	6608 KB	Output is correct
7	Correct	3 ms	6608 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	3 ms	6608 KB	Output is correct
11	Correct	4 ms	6480 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	0 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	208 KB	Output is correct
22	Correct	0 ms	208 KB	Output is correct
23	Correct	1 ms	208 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	4 ms	6480 KB	Output is correct
26	Correct	4 ms	6608 KB	Output is correct
27	Correct	4 ms	6572 KB	Output is correct
28	Correct	4 ms	6608 KB	Output is correct
29	Correct	4 ms	6608 KB	Output is correct
30	Correct	5 ms	6608 KB	Output is correct
31	Correct	4 ms	6608 KB	Output is correct
32	Correct	1 ms	208 KB	Output is correct
33	Correct	1 ms	208 KB	Output is correct
34	Correct	5 ms	6580 KB	Output is correct
35	Correct	4 ms	6608 KB	Output is correct
36	Correct	20 ms	7468 KB	Output is correct
37	Correct	25 ms	8000 KB	Output is correct
38	Correct	22 ms	7824 KB	Output is correct
39	Correct	22 ms	7968 KB	Output is correct
40	Correct	21 ms	7836 KB	Output is correct
41	Correct	67 ms	8460 KB	Output is correct
42	Correct	18 ms	7736 KB	Output is correct
43	Correct	10 ms	1360 KB	Output is correct
44	Correct	10 ms	1444 KB	Output is correct
45	Correct	13 ms	7696 KB	Output is correct
46	Correct	14 ms	7708 KB	Output is correct
47	Correct	11 ms	1848 KB	Output is correct
48	Correct	11 ms	1824 KB	Output is correct
49	Correct	12 ms	1836 KB	Output is correct
50	Correct	10 ms	1452 KB	Output is correct
51	Correct	11 ms	1820 KB	Output is correct
52	Correct	11 ms	1840 KB	Output is correct
53	Correct	11 ms	1872 KB	Output is correct
54	Correct	19 ms	1840 KB	Output is correct
55	Correct	10 ms	1352 KB	Output is correct
56	Correct	10 ms	1828 KB	Output is correct
57	Correct	58 ms	8400 KB	Output is correct
58	Correct	64 ms	8544 KB	Output is correct
59	Correct	79 ms	8512 KB	Output is correct
60	Correct	76 ms	8616 KB	Output is correct
61	Correct	79 ms	8640 KB	Output is correct
62	Correct	76 ms	8528 KB	Output is correct
63	Correct	88 ms	8544 KB	Output is correct
64	Correct	11 ms	1456 KB	Output is correct
65	Correct	11 ms	1568 KB	Output is correct
66	Correct	50 ms	8476 KB	Output is correct
67	Correct	50 ms	8512 KB	Output is correct

Subtask #4
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	589 ms	1956 KB	Output is correct
2	Correct	850 ms	1836 KB	Output is correct
3	Correct	1008 ms	1836 KB	Output is correct
4	Correct	783 ms	1840 KB	Output is correct
5	Correct	567 ms	1812 KB	Output is correct
6	Correct	705 ms	1824 KB	Output is correct
7	Correct	895 ms	1836 KB	Output is correct
8	Correct	770 ms	1488 KB	Output is correct
9	Correct	797 ms	1440 KB	Output is correct
10	Correct	854 ms	1872 KB	Output is correct
11	Correct	868 ms	1864 KB	Output is correct
12	Correct	748 ms	1440 KB	Output is correct
13	Correct	822 ms	1488 KB	Output is correct
14	Correct	0 ms	208 KB	Output is correct
15	Correct	0 ms	208 KB	Output is correct
16	Correct	1 ms	208 KB	Output is correct
17	Correct	16 ms	1824 KB	Output is correct
18	Correct	11 ms	1824 KB	Output is correct
19	Correct	11 ms	1848 KB	Output is correct
20	Correct	10 ms	1452 KB	Output is correct
21	Correct	10 ms	1920 KB	Output is correct
22	Correct	11 ms	1840 KB	Output is correct
23	Correct	15 ms	1832 KB	Output is correct
24	Correct	19 ms	1836 KB	Output is correct
25	Correct	10 ms	1448 KB	Output is correct
26	Correct	11 ms	1836 KB	Output is correct
27	Correct	1 ms	336 KB	Output is correct
28	Correct	0 ms	336 KB	Output is correct
29	Correct	1 ms	336 KB	Output is correct
30	Correct	0 ms	208 KB	Output is correct
31	Correct	1 ms	336 KB	Output is correct
32	Correct	0 ms	336 KB	Output is correct
33	Correct	0 ms	208 KB	Output is correct
34	Correct	0 ms	336 KB	Output is correct
35	Correct	1 ms	208 KB	Output is correct
36	Correct	0 ms	336 KB	Output is correct

Subtask #5
0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	4038 ms	7144 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	6528 KB	Output is correct
2	Correct	4 ms	6608 KB	Output is correct
3	Correct	4 ms	6608 KB	Output is correct
4	Correct	4 ms	6480 KB	Output is correct
5	Correct	3 ms	6608 KB	Output is correct
6	Correct	3 ms	6608 KB	Output is correct
7	Correct	3 ms	6608 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	3 ms	6608 KB	Output is correct
11	Correct	4 ms	6480 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	0 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	208 KB	Output is correct
22	Correct	0 ms	208 KB	Output is correct
23	Correct	1 ms	208 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	4 ms	6480 KB	Output is correct
26	Correct	4 ms	6608 KB	Output is correct
27	Correct	4 ms	6572 KB	Output is correct
28	Correct	4 ms	6608 KB	Output is correct
29	Correct	4 ms	6608 KB	Output is correct
30	Correct	5 ms	6608 KB	Output is correct
31	Correct	4 ms	6608 KB	Output is correct
32	Correct	1 ms	208 KB	Output is correct
33	Correct	1 ms	208 KB	Output is correct
34	Correct	5 ms	6580 KB	Output is correct
35	Correct	4 ms	6608 KB	Output is correct
36	Correct	20 ms	7468 KB	Output is correct
37	Correct	25 ms	8000 KB	Output is correct
38	Correct	22 ms	7824 KB	Output is correct
39	Correct	22 ms	7968 KB	Output is correct
40	Correct	21 ms	7836 KB	Output is correct
41	Correct	67 ms	8460 KB	Output is correct
42	Correct	18 ms	7736 KB	Output is correct
43	Correct	10 ms	1360 KB	Output is correct
44	Correct	10 ms	1444 KB	Output is correct
45	Correct	13 ms	7696 KB	Output is correct
46	Correct	14 ms	7708 KB	Output is correct
47	Correct	11 ms	1848 KB	Output is correct
48	Correct	11 ms	1824 KB	Output is correct
49	Correct	12 ms	1836 KB	Output is correct
50	Correct	10 ms	1452 KB	Output is correct
51	Correct	11 ms	1820 KB	Output is correct
52	Correct	11 ms	1840 KB	Output is correct
53	Correct	11 ms	1872 KB	Output is correct
54	Correct	19 ms	1840 KB	Output is correct
55	Correct	10 ms	1352 KB	Output is correct
56	Correct	10 ms	1828 KB	Output is correct
57	Correct	58 ms	8400 KB	Output is correct
58	Correct	64 ms	8544 KB	Output is correct
59	Correct	79 ms	8512 KB	Output is correct
60	Correct	76 ms	8616 KB	Output is correct
61	Correct	79 ms	8640 KB	Output is correct
62	Correct	76 ms	8528 KB	Output is correct
63	Correct	88 ms	8544 KB	Output is correct
64	Correct	11 ms	1456 KB	Output is correct
65	Correct	11 ms	1568 KB	Output is correct
66	Correct	50 ms	8476 KB	Output is correct
67	Correct	50 ms	8512 KB	Output is correct
68	Correct	589 ms	1956 KB	Output is correct
69	Correct	850 ms	1836 KB	Output is correct
70	Correct	1008 ms	1836 KB	Output is correct
71	Correct	783 ms	1840 KB	Output is correct
72	Correct	567 ms	1812 KB	Output is correct
73	Correct	705 ms	1824 KB	Output is correct
74	Correct	895 ms	1836 KB	Output is correct
75	Correct	770 ms	1488 KB	Output is correct
76	Correct	797 ms	1440 KB	Output is correct
77	Correct	854 ms	1872 KB	Output is correct
78	Correct	868 ms	1864 KB	Output is correct
79	Correct	748 ms	1440 KB	Output is correct
80	Correct	822 ms	1488 KB	Output is correct
81	Correct	0 ms	208 KB	Output is correct
82	Correct	0 ms	208 KB	Output is correct
83	Correct	1 ms	208 KB	Output is correct
84	Correct	16 ms	1824 KB	Output is correct
85	Correct	11 ms	1824 KB	Output is correct
86	Correct	11 ms	1848 KB	Output is correct
87	Correct	10 ms	1452 KB	Output is correct
88	Correct	10 ms	1920 KB	Output is correct
89	Correct	11 ms	1840 KB	Output is correct
90	Correct	15 ms	1832 KB	Output is correct
91	Correct	19 ms	1836 KB	Output is correct
92	Correct	10 ms	1448 KB	Output is correct
93	Correct	11 ms	1836 KB	Output is correct
94	Correct	1 ms	336 KB	Output is correct
95	Correct	0 ms	336 KB	Output is correct
96	Correct	1 ms	336 KB	Output is correct
97	Correct	0 ms	208 KB	Output is correct
98	Correct	1 ms	336 KB	Output is correct
99	Correct	0 ms	336 KB	Output is correct
100	Correct	0 ms	208 KB	Output is correct
101	Correct	0 ms	336 KB	Output is correct
102	Correct	1 ms	208 KB	Output is correct
103	Correct	0 ms	336 KB	Output is correct
104	Execution timed out	4042 ms	8488 KB	Time limit exceeded
105	Halted	0 ms	0 KB	-

Subtask #7
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	300 ms	976 KB	Output is correct
2	Correct	954 ms	1352 KB	Output is correct
3	Correct	705 ms	1448 KB	Output is correct
4	Correct	737 ms	1448 KB	Output is correct
5	Correct	821 ms	1448 KB	Output is correct
6	Correct	920 ms	1456 KB	Output is correct
7	Correct	779 ms	1488 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	4 ms	6528 KB	Output is correct
12	Correct	4 ms	6608 KB	Output is correct
13	Correct	4 ms	6608 KB	Output is correct
14	Correct	4 ms	6480 KB	Output is correct
15	Correct	3 ms	6608 KB	Output is correct
16	Correct	3 ms	6608 KB	Output is correct
17	Correct	3 ms	6608 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	1 ms	208 KB	Output is correct
20	Correct	3 ms	6608 KB	Output is correct
21	Correct	4 ms	6480 KB	Output is correct
22	Correct	0 ms	208 KB	Output is correct
23	Correct	1 ms	208 KB	Output is correct
24	Correct	0 ms	208 KB	Output is correct
25	Correct	1 ms	208 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	1 ms	208 KB	Output is correct
28	Correct	1 ms	208 KB	Output is correct
29	Correct	1 ms	336 KB	Output is correct
30	Correct	1 ms	336 KB	Output is correct
31	Correct	1 ms	208 KB	Output is correct
32	Correct	0 ms	208 KB	Output is correct
33	Correct	1 ms	208 KB	Output is correct
34	Correct	1 ms	336 KB	Output is correct
35	Correct	4 ms	6480 KB	Output is correct
36	Correct	4 ms	6608 KB	Output is correct
37	Correct	4 ms	6572 KB	Output is correct
38	Correct	4 ms	6608 KB	Output is correct
39	Correct	4 ms	6608 KB	Output is correct
40	Correct	5 ms	6608 KB	Output is correct
41	Correct	4 ms	6608 KB	Output is correct
42	Correct	1 ms	208 KB	Output is correct
43	Correct	1 ms	208 KB	Output is correct
44	Correct	5 ms	6580 KB	Output is correct
45	Correct	4 ms	6608 KB	Output is correct
46	Correct	20 ms	7468 KB	Output is correct
47	Correct	25 ms	8000 KB	Output is correct
48	Correct	22 ms	7824 KB	Output is correct
49	Correct	22 ms	7968 KB	Output is correct
50	Correct	21 ms	7836 KB	Output is correct
51	Correct	67 ms	8460 KB	Output is correct
52	Correct	18 ms	7736 KB	Output is correct
53	Correct	10 ms	1360 KB	Output is correct
54	Correct	10 ms	1444 KB	Output is correct
55	Correct	13 ms	7696 KB	Output is correct
56	Correct	14 ms	7708 KB	Output is correct
57	Correct	11 ms	1848 KB	Output is correct
58	Correct	11 ms	1824 KB	Output is correct
59	Correct	12 ms	1836 KB	Output is correct
60	Correct	10 ms	1452 KB	Output is correct
61	Correct	11 ms	1820 KB	Output is correct
62	Correct	11 ms	1840 KB	Output is correct
63	Correct	11 ms	1872 KB	Output is correct
64	Correct	19 ms	1840 KB	Output is correct
65	Correct	10 ms	1352 KB	Output is correct
66	Correct	10 ms	1828 KB	Output is correct
67	Correct	58 ms	8400 KB	Output is correct
68	Correct	64 ms	8544 KB	Output is correct
69	Correct	79 ms	8512 KB	Output is correct
70	Correct	76 ms	8616 KB	Output is correct
71	Correct	79 ms	8640 KB	Output is correct
72	Correct	76 ms	8528 KB	Output is correct
73	Correct	88 ms	8544 KB	Output is correct
74	Correct	11 ms	1456 KB	Output is correct
75	Correct	11 ms	1568 KB	Output is correct
76	Correct	50 ms	8476 KB	Output is correct
77	Correct	50 ms	8512 KB	Output is correct
78	Correct	589 ms	1956 KB	Output is correct
79	Correct	850 ms	1836 KB	Output is correct
80	Correct	1008 ms	1836 KB	Output is correct
81	Correct	783 ms	1840 KB	Output is correct
82	Correct	567 ms	1812 KB	Output is correct
83	Correct	705 ms	1824 KB	Output is correct
84	Correct	895 ms	1836 KB	Output is correct
85	Correct	770 ms	1488 KB	Output is correct
86	Correct	797 ms	1440 KB	Output is correct
87	Correct	854 ms	1872 KB	Output is correct
88	Correct	868 ms	1864 KB	Output is correct
89	Correct	748 ms	1440 KB	Output is correct
90	Correct	822 ms	1488 KB	Output is correct
91	Correct	0 ms	208 KB	Output is correct
92	Correct	0 ms	208 KB	Output is correct
93	Correct	1 ms	208 KB	Output is correct
94	Correct	16 ms	1824 KB	Output is correct
95	Correct	11 ms	1824 KB	Output is correct
96	Correct	11 ms	1848 KB	Output is correct
97	Correct	10 ms	1452 KB	Output is correct
98	Correct	10 ms	1920 KB	Output is correct
99	Correct	11 ms	1840 KB	Output is correct
100	Correct	15 ms	1832 KB	Output is correct
101	Correct	19 ms	1836 KB	Output is correct
102	Correct	10 ms	1448 KB	Output is correct
103	Correct	11 ms	1836 KB	Output is correct
104	Correct	1 ms	336 KB	Output is correct
105	Correct	0 ms	336 KB	Output is correct
106	Correct	1 ms	336 KB	Output is correct
107	Correct	0 ms	208 KB	Output is correct
108	Correct	1 ms	336 KB	Output is correct
109	Correct	0 ms	336 KB	Output is correct
110	Correct	0 ms	208 KB	Output is correct
111	Correct	0 ms	336 KB	Output is correct
112	Correct	1 ms	208 KB	Output is correct
113	Correct	0 ms	336 KB	Output is correct
114	Execution timed out	4038 ms	7144 KB	Time limit exceeded
115	Halted	0 ms	0 KB	-

Submission #626019

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 11.0 / 11.0

Subtask #3 12.0 / 12.0

Subtask #4 14.0 / 14.0

Subtask #5 0 / 17.0

Subtask #6 0 / 19.0

Subtask #7 0 / 23.0

Subtask #1
4.0 / 4.0

Subtask #2
11.0 / 11.0

Subtask #3
12.0 / 12.0

Subtask #4
14.0 / 14.0

Subtask #5
0 / 17.0

Subtask #6
0 / 19.0

Subtask #7
0 / 23.0