Submission #833192

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
833192	2023-08-22T03:03:40 Z	pavement	Radio Towers (IOI22_towers)	C++17	23 / 100	4000 ms	4108 KB

towers

#include "towers.h"
#include <bits/stdc++.h>
using namespace std;

#define eb emplace_back
#define mp make_pair

using ii = pair<int, int>;

int N;
vector<int> H;

void init(int N, vector<int> H) {
	::N = N;
	::H = H;
}

int max_towers(int L, int R, int D) {
	vector<int> V(H.begin() + L, H.begin() + R + 1), cl(V.size(), -1), cr(V.size(), V.size());
	vector<ii> vec;
	for (int i = 0; i < (int)V.size(); i++) {
		{
			int lo = 0, hi = (int)vec.size() - 1;
			while (lo <= hi) {
				int mid = (lo + hi) / 2;
				if (vec[mid].first <= V[i] - D) {
					cl[i] = vec[mid].second;
					lo = mid + 1;
				} else {
					hi = mid - 1;
				}
			}
		}
		while (!vec.empty() && vec.back().first >= V[i]) {
			vec.pop_back();
		}
		vec.eb(V[i], i);
	}
	vec.clear();
	for (int i = (int)V.size() - 1; i >= 0; i--) {
		{
			int lo = 0, hi = (int)vec.size() - 1;
			while (lo <= hi) {
				int mid = (lo + hi) / 2;
				if (vec[mid].first <= V[i] - D) {
					cr[i] = vec[mid].second;
					lo = mid + 1;
				} else {
					hi = mid - 1;
				}
			}
		}
		while (!vec.empty() && vec.back().first >= V[i]) {
			vec.pop_back();
		}
		vec.eb(V[i], i);
	}
	vector<ii> segs;
	for (int i = 0; i < (int)V.size(); i++) {
		if (cl[i] != -1 && cr[i] != (int)V.size()) {
			segs.eb(cr[i], cl[i]);
		}
	}
	sort(segs.begin(), segs.end());
	int ans = 0, max_r = -1;
	for (auto [r, l] : segs) {
		if (l >= max_r) {
			ans++;
			max_r = r;
		}
	}
	return ans + 1;
}

Subtask #1
0 / 4.0

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

Subtask #2
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	0 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	0 ms	208 KB	Output is correct
11	Correct	0 ms	208 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	0 ms	336 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	0 ms	208 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	0 ms	336 KB	Output is correct
25	Correct	0 ms	208 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	1 ms	336 KB	Output is correct
28	Correct	1 ms	336 KB	Output is correct
29	Correct	0 ms	336 KB	Output is correct
30	Correct	1 ms	336 KB	Output is correct
31	Correct	1 ms	336 KB	Output is correct
32	Correct	1 ms	336 KB	Output is correct
33	Correct	1 ms	336 KB	Output is correct
34	Correct	0 ms	336 KB	Output is correct
35	Correct	1 ms	336 KB	Output is correct

Subtask #3
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	0 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	0 ms	208 KB	Output is correct
11	Correct	0 ms	208 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	0 ms	336 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	0 ms	208 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	0 ms	336 KB	Output is correct
25	Correct	0 ms	208 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	1 ms	336 KB	Output is correct
28	Correct	1 ms	336 KB	Output is correct
29	Correct	0 ms	336 KB	Output is correct
30	Correct	1 ms	336 KB	Output is correct
31	Correct	1 ms	336 KB	Output is correct
32	Correct	1 ms	336 KB	Output is correct
33	Correct	1 ms	336 KB	Output is correct
34	Correct	0 ms	336 KB	Output is correct
35	Correct	1 ms	336 KB	Output is correct
36	Correct	7 ms	1312 KB	Output is correct
37	Correct	11 ms	1684 KB	Output is correct
38	Correct	10 ms	1488 KB	Output is correct
39	Correct	10 ms	1460 KB	Output is correct
40	Correct	10 ms	1488 KB	Output is correct
41	Correct	14 ms	2840 KB	Output is correct
42	Correct	10 ms	1424 KB	Output is correct
43	Correct	11 ms	2528 KB	Output is correct
44	Correct	9 ms	1444 KB	Output is correct
45	Correct	13 ms	1456 KB	Output is correct
46	Correct	9 ms	1436 KB	Output is correct
47	Correct	15 ms	2264 KB	Output is correct
48	Correct	11 ms	1820 KB	Output is correct
49	Correct	12 ms	1444 KB	Output is correct
50	Correct	10 ms	1684 KB	Output is correct
51	Correct	10 ms	2376 KB	Output is correct
52	Correct	17 ms	3776 KB	Output is correct
53	Correct	16 ms	3784 KB	Output is correct
54	Correct	16 ms	3728 KB	Output is correct
55	Correct	12 ms	3760 KB	Output is correct
56	Correct	21 ms	3608 KB	Output is correct
57	Correct	15 ms	2992 KB	Output is correct
58	Correct	16 ms	3124 KB	Output is correct
59	Correct	17 ms	3760 KB	Output is correct
60	Correct	17 ms	3784 KB	Output is correct
61	Correct	22 ms	3736 KB	Output is correct
62	Correct	15 ms	3144 KB	Output is correct
63	Correct	17 ms	3752 KB	Output is correct
64	Correct	13 ms	3784 KB	Output is correct
65	Correct	13 ms	3728 KB	Output is correct
66	Correct	15 ms	3220 KB	Output is correct
67	Correct	13 ms	3712 KB	Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
0 / 17.0

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

Subtask #6
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	0 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	1 ms	208 KB	Output is correct
10	Correct	0 ms	208 KB	Output is correct
11	Correct	0 ms	208 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	0 ms	336 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	0 ms	208 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	0 ms	336 KB	Output is correct
25	Correct	0 ms	208 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	1 ms	336 KB	Output is correct
28	Correct	1 ms	336 KB	Output is correct
29	Correct	0 ms	336 KB	Output is correct
30	Correct	1 ms	336 KB	Output is correct
31	Correct	1 ms	336 KB	Output is correct
32	Correct	1 ms	336 KB	Output is correct
33	Correct	1 ms	336 KB	Output is correct
34	Correct	0 ms	336 KB	Output is correct
35	Correct	1 ms	336 KB	Output is correct
36	Correct	7 ms	1312 KB	Output is correct
37	Correct	11 ms	1684 KB	Output is correct
38	Correct	10 ms	1488 KB	Output is correct
39	Correct	10 ms	1460 KB	Output is correct
40	Correct	10 ms	1488 KB	Output is correct
41	Correct	14 ms	2840 KB	Output is correct
42	Correct	10 ms	1424 KB	Output is correct
43	Correct	11 ms	2528 KB	Output is correct
44	Correct	9 ms	1444 KB	Output is correct
45	Correct	13 ms	1456 KB	Output is correct
46	Correct	9 ms	1436 KB	Output is correct
47	Correct	15 ms	2264 KB	Output is correct
48	Correct	11 ms	1820 KB	Output is correct
49	Correct	12 ms	1444 KB	Output is correct
50	Correct	10 ms	1684 KB	Output is correct
51	Correct	10 ms	2376 KB	Output is correct
52	Correct	17 ms	3776 KB	Output is correct
53	Correct	16 ms	3784 KB	Output is correct
54	Correct	16 ms	3728 KB	Output is correct
55	Correct	12 ms	3760 KB	Output is correct
56	Correct	21 ms	3608 KB	Output is correct
57	Correct	15 ms	2992 KB	Output is correct
58	Correct	16 ms	3124 KB	Output is correct
59	Correct	17 ms	3760 KB	Output is correct
60	Correct	17 ms	3784 KB	Output is correct
61	Correct	22 ms	3736 KB	Output is correct
62	Correct	15 ms	3144 KB	Output is correct
63	Correct	17 ms	3752 KB	Output is correct
64	Correct	13 ms	3784 KB	Output is correct
65	Correct	13 ms	3728 KB	Output is correct
66	Correct	15 ms	3220 KB	Output is correct
67	Correct	13 ms	3712 KB	Output is correct
68	Execution timed out	4013 ms	4108 KB	Time limit exceeded
69	Halted	0 ms	0 KB	-

Subtask #7
0 / 23.0

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

Submission #833192

Compilation message

Subtask #1 0 / 4.0

Subtask #2 11.0 / 11.0

Subtask #3 12.0 / 12.0

Subtask #4 0 / 14.0

Subtask #5 0 / 17.0

Subtask #6 0 / 19.0

Subtask #7 0 / 23.0

Subtask #1
0 / 4.0

Subtask #2
11.0 / 11.0

Subtask #3
12.0 / 12.0

Subtask #4
0 / 14.0

Subtask #5
0 / 17.0

Subtask #6
0 / 19.0

Subtask #7
0 / 23.0