Submission #1074044

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1074044	2024-08-25T07:11:20 Z	Gromp15	Radio Towers (IOI22_towers)	C++17	23 / 100	4000 ms	3768 KB

towers

#include <bits/stdc++.h>
#include "towers.h"
#define ll long long
#define ar array
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T> bool ckmin(T &a, const T &b ) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b ) { return a < b ? a = b, 1 : 0; }

int n; vector<int> h, h2;
void init(int N, std::vector<int> H) {
	n = N;
	h = H;
	h2 = H;
	sort(all(h2));
	h2.erase(unique(all(h2)), h2.end());
	for (int &x : h) x = lower_bound(all(h2), x) - h2.begin();
}

struct seg {
	int N; vector<int> tree;
	seg(int n) : N(1<<(__lg(n)+1)), tree(2*N, -1e9) {}
	void update(int pos, int x) {
		for (int i = pos + N; i; i >>= 1) ckmax(tree[i], x);
	}
	int query(int node, int nl, int nr, int ql, int qr) {
		if (ql > nr || qr < nl) return -1e9;
		if (ql <= nl && nr <= qr) return tree[node];
		int mid = (nl+nr)/2;
		return max(query(node*2, nl, mid, ql, qr), query(node*2+1, mid+1, nr, ql, qr));
	}
	int query(int l, int r) {
		return query(1, 0, N-1, l, r);
	}
};



int max_towers(int L, int R, int D) {
	const int N = sz(h2);
	seg st0(N), st1(N); 
	for (int i = L; i <= R; i++) {
		auto it = lower_bound(all(h2), h2[h[i]] + D);
		if (it != h2.end()) {
			st1.update(h[i], st0.query(it - h2.begin(), N - 1) + 1);
		}
		auto it2 = upper_bound(all(h2), h2[h[i]] - D);
		if (it2 != h2.begin()) {
			it2--;
			st0.update(h[i], st1.query(0, it2 - h2.begin()));
		}
		st1.update(h[i], 1);
	}
	return st1.query(0, N-1);
}

Subtask #1
0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	4021 ms	2232 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	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	356 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	2 ms	344 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 ms	344 KB	Output is correct
28	Correct	1 ms	504 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	1 ms	344 KB	Output is correct
31	Correct	1 ms	496 KB	Output is correct
32	Correct	1 ms	380 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	1 ms	344 KB	Output is correct

Subtask #3
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	356 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	2 ms	344 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 ms	344 KB	Output is correct
28	Correct	1 ms	504 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	1 ms	344 KB	Output is correct
31	Correct	1 ms	496 KB	Output is correct
32	Correct	1 ms	380 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	1 ms	344 KB	Output is correct
36	Correct	24 ms	2136 KB	Output is correct
37	Correct	30 ms	3528 KB	Output is correct
38	Correct	35 ms	3512 KB	Output is correct
39	Correct	30 ms	3528 KB	Output is correct
40	Correct	36 ms	3404 KB	Output is correct
41	Correct	48 ms	3652 KB	Output is correct
42	Correct	26 ms	3532 KB	Output is correct
43	Correct	26 ms	3536 KB	Output is correct
44	Correct	19 ms	3536 KB	Output is correct
45	Correct	16 ms	3536 KB	Output is correct
46	Correct	24 ms	3768 KB	Output is correct
47	Correct	42 ms	3660 KB	Output is correct
48	Correct	35 ms	3408 KB	Output is correct
49	Correct	34 ms	3528 KB	Output is correct
50	Correct	21 ms	3536 KB	Output is correct
51	Correct	25 ms	3536 KB	Output is correct
52	Correct	76 ms	3536 KB	Output is correct
53	Correct	79 ms	3744 KB	Output is correct
54	Correct	76 ms	3528 KB	Output is correct
55	Correct	42 ms	3536 KB	Output is correct
56	Correct	42 ms	3536 KB	Output is correct
57	Correct	52 ms	3500 KB	Output is correct
58	Correct	57 ms	3536 KB	Output is correct
59	Correct	68 ms	3536 KB	Output is correct
60	Correct	77 ms	3536 KB	Output is correct
61	Correct	68 ms	3528 KB	Output is correct
62	Correct	57 ms	3536 KB	Output is correct
63	Correct	72 ms	3404 KB	Output is correct
64	Correct	29 ms	3536 KB	Output is correct
65	Correct	29 ms	3536 KB	Output is correct
66	Correct	38 ms	3536 KB	Output is correct
67	Correct	32 ms	3536 KB	Output is correct

Subtask #4
0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	4054 ms	3732 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	4040 ms	1352 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	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	356 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	2 ms	344 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 ms	344 KB	Output is correct
28	Correct	1 ms	504 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	1 ms	344 KB	Output is correct
31	Correct	1 ms	496 KB	Output is correct
32	Correct	1 ms	380 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	1 ms	344 KB	Output is correct
36	Correct	24 ms	2136 KB	Output is correct
37	Correct	30 ms	3528 KB	Output is correct
38	Correct	35 ms	3512 KB	Output is correct
39	Correct	30 ms	3528 KB	Output is correct
40	Correct	36 ms	3404 KB	Output is correct
41	Correct	48 ms	3652 KB	Output is correct
42	Correct	26 ms	3532 KB	Output is correct
43	Correct	26 ms	3536 KB	Output is correct
44	Correct	19 ms	3536 KB	Output is correct
45	Correct	16 ms	3536 KB	Output is correct
46	Correct	24 ms	3768 KB	Output is correct
47	Correct	42 ms	3660 KB	Output is correct
48	Correct	35 ms	3408 KB	Output is correct
49	Correct	34 ms	3528 KB	Output is correct
50	Correct	21 ms	3536 KB	Output is correct
51	Correct	25 ms	3536 KB	Output is correct
52	Correct	76 ms	3536 KB	Output is correct
53	Correct	79 ms	3744 KB	Output is correct
54	Correct	76 ms	3528 KB	Output is correct
55	Correct	42 ms	3536 KB	Output is correct
56	Correct	42 ms	3536 KB	Output is correct
57	Correct	52 ms	3500 KB	Output is correct
58	Correct	57 ms	3536 KB	Output is correct
59	Correct	68 ms	3536 KB	Output is correct
60	Correct	77 ms	3536 KB	Output is correct
61	Correct	68 ms	3528 KB	Output is correct
62	Correct	57 ms	3536 KB	Output is correct
63	Correct	72 ms	3404 KB	Output is correct
64	Correct	29 ms	3536 KB	Output is correct
65	Correct	29 ms	3536 KB	Output is correct
66	Correct	38 ms	3536 KB	Output is correct
67	Correct	32 ms	3536 KB	Output is correct
68	Execution timed out	4054 ms	3732 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	4021 ms	2232 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Submission #1074044

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