oj.uz

Submission #1074301

# Submission time Handle Problem Language Result Execution time Memory
1074301 2024-08-25T09:33:14 Z Gromp15 Radio Towers (IOI22_towers) C++17
37 / 100
 4000 ms 4060 KB 
#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, pref;
int D;
int test(int i) {
	return (i && i+1 < n && ((h[i] > h[i-1] && h[i] > h[i+1])));
}
bool one_peak = 1;
int peak = -1;
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();
	pref.resize(n);
	for (int i = 0; i < n; i++) {
		pref[i] = test(i) + (i ? pref[i-1] : 0);
	}
	peak = max_element(all(h)) - h.begin();
	for (int i = peak-1; i >= 0; i--) one_peak &= h[i] < h[i+1];
	for (int i = peak+1; i < n; i++) one_peak &= h[i] < h[i-1];
}

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 Q = 0;
int max_towers(int L, int R, int _D) {
	D = _D;
	if (one_peak) {
		return 1 + (L < peak && R > peak && (max(h[L], h[R]) <= h[peak] - D));
	}
	if (Q++ == 0) {
		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);
	}
	if (D == 1) {
		return pref[R] - (L ? pref[L-1] : 0) + 1 - test(L) - test(R) + (L == R ? test(L) : 0);
	}
	int ans = 1;
	set<int> SL, SR;
	for (int i = L+1; i <= R-1; i++) if (h[i] > h[i-1] && h[i] > h[i+1]) {
		int l = -1, r = -1;
		for (int j = i-1; j >= L; j--) {
			if (h2[h[i]] - D >= h2[h[j]]) { 
				if (SL.count(j)) break;
				l = j;
			}
		}
		for (int j = i+1; j <= R; j++) {
			if (h2[h[i]] - D >= h2[h[j]]) { 
				if (SR.count(j)) break;
				r = j;
			}
		}
		if (~l && ~r) {
			ans++;
			SL.insert(l);
			SR.insert(r);
		}
	}
	return ans;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 287 ms 1388 KB 12th lines differ - on the 1st token, expected: '2', found: '1'
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 0 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 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 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 1 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 344 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 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 424 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 0 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 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 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 1 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 344 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 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 424 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 29 ms 2392 KB Output is correct
37 Correct 34 ms 4044 KB Output is correct
38 Correct 31 ms 3912 KB Output is correct
39 Correct 28 ms 3924 KB Output is correct
40 Correct 30 ms 3916 KB Output is correct
41 Correct 51 ms 4024 KB Output is correct
42 Correct 26 ms 4040 KB Output is correct
43 Correct 14 ms 2392 KB Output is correct
44 Correct 14 ms 2392 KB Output is correct
45 Correct 15 ms 4000 KB Output is correct
46 Correct 22 ms 4048 KB Output is correct
47 Correct 43 ms 3912 KB Output is correct
48 Correct 37 ms 4044 KB Output is correct
49 Correct 29 ms 4040 KB Output is correct
50 Correct 14 ms 2392 KB Output is correct
51 Correct 31 ms 4052 KB Output is correct
52 Correct 77 ms 4048 KB Output is correct
53 Correct 80 ms 4040 KB Output is correct
54 Correct 74 ms 4040 KB Output is correct
55 Correct 20 ms 2392 KB Output is correct
56 Correct 45 ms 4048 KB Output is correct
57 Correct 46 ms 3804 KB Output is correct
58 Correct 58 ms 3916 KB Output is correct
59 Correct 68 ms 4040 KB Output is correct
60 Correct 78 ms 4048 KB Output is correct
61 Correct 74 ms 4048 KB Output is correct
62 Correct 64 ms 4048 KB Output is correct
63 Correct 68 ms 4048 KB Output is correct
64 Correct 14 ms 2392 KB Output is correct
65 Correct 14 ms 2368 KB Output is correct
66 Correct 37 ms 4024 KB Output is correct
67 Correct 36 ms 4048 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 531 ms 4048 KB Output is correct
2 Correct 656 ms 3912 KB Output is correct
3 Correct 664 ms 4040 KB Output is correct
4 Correct 634 ms 4048 KB Output is correct
5 Correct 684 ms 4040 KB Output is correct
6 Correct 647 ms 4036 KB Output is correct
7 Correct 652 ms 4040 KB Output is correct
8 Correct 612 ms 2392 KB Output is correct
9 Correct 681 ms 2392 KB Output is correct
10 Correct 648 ms 4012 KB Output is correct
11 Correct 640 ms 4048 KB Output is correct
12 Correct 632 ms 2392 KB Output is correct
13 Correct 629 ms 2392 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 44 ms 4060 KB Output is correct
18 Correct 42 ms 4044 KB Output is correct
19 Correct 35 ms 4020 KB Output is correct
20 Correct 15 ms 2392 KB Output is correct
21 Correct 32 ms 4048 KB Output is correct
22 Correct 78 ms 4048 KB Output is correct
23 Correct 74 ms 4048 KB Output is correct
24 Correct 76 ms 4048 KB Output is correct
25 Correct 13 ms 2368 KB Output is correct
26 Correct 41 ms 4048 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 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 344 KB Output is correct
32 Correct 1 ms 344 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 1 ms 344 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4054 ms 1368 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 0 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 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 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 1 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 344 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 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 424 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 29 ms 2392 KB Output is correct
37 Correct 34 ms 4044 KB Output is correct
38 Correct 31 ms 3912 KB Output is correct
39 Correct 28 ms 3924 KB Output is correct
40 Correct 30 ms 3916 KB Output is correct
41 Correct 51 ms 4024 KB Output is correct
42 Correct 26 ms 4040 KB Output is correct
43 Correct 14 ms 2392 KB Output is correct
44 Correct 14 ms 2392 KB Output is correct
45 Correct 15 ms 4000 KB Output is correct
46 Correct 22 ms 4048 KB Output is correct
47 Correct 43 ms 3912 KB Output is correct
48 Correct 37 ms 4044 KB Output is correct
49 Correct 29 ms 4040 KB Output is correct
50 Correct 14 ms 2392 KB Output is correct
51 Correct 31 ms 4052 KB Output is correct
52 Correct 77 ms 4048 KB Output is correct
53 Correct 80 ms 4040 KB Output is correct
54 Correct 74 ms 4040 KB Output is correct
55 Correct 20 ms 2392 KB Output is correct
56 Correct 45 ms 4048 KB Output is correct
57 Correct 46 ms 3804 KB Output is correct
58 Correct 58 ms 3916 KB Output is correct
59 Correct 68 ms 4040 KB Output is correct
60 Correct 78 ms 4048 KB Output is correct
61 Correct 74 ms 4048 KB Output is correct
62 Correct 64 ms 4048 KB Output is correct
63 Correct 68 ms 4048 KB Output is correct
64 Correct 14 ms 2392 KB Output is correct
65 Correct 14 ms 2368 KB Output is correct
66 Correct 37 ms 4024 KB Output is correct
67 Correct 36 ms 4048 KB Output is correct
68 Correct 531 ms 4048 KB Output is correct
69 Correct 656 ms 3912 KB Output is correct
70 Correct 664 ms 4040 KB Output is correct
71 Correct 634 ms 4048 KB Output is correct
72 Correct 684 ms 4040 KB Output is correct
73 Correct 647 ms 4036 KB Output is correct
74 Correct 652 ms 4040 KB Output is correct
75 Correct 612 ms 2392 KB Output is correct
76 Correct 681 ms 2392 KB Output is correct
77 Correct 648 ms 4012 KB Output is correct
78 Correct 640 ms 4048 KB Output is correct
79 Correct 632 ms 2392 KB Output is correct
80 Correct 629 ms 2392 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 44 ms 4060 KB Output is correct
85 Correct 42 ms 4044 KB Output is correct
86 Correct 35 ms 4020 KB Output is correct
87 Correct 15 ms 2392 KB Output is correct
88 Correct 32 ms 4048 KB Output is correct
89 Correct 78 ms 4048 KB Output is correct
90 Correct 74 ms 4048 KB Output is correct
91 Correct 76 ms 4048 KB Output is correct
92 Correct 13 ms 2368 KB Output is correct
93 Correct 41 ms 4048 KB Output is correct
94 Correct 1 ms 344 KB Output is correct
95 Correct 1 ms 344 KB Output is correct
96 Correct 1 ms 344 KB Output is correct
97 Correct 1 ms 344 KB Output is correct
98 Correct 1 ms 344 KB Output is correct
99 Correct 1 ms 344 KB Output is correct
100 Correct 1 ms 344 KB Output is correct
101 Correct 1 ms 344 KB Output is correct
102 Correct 1 ms 344 KB Output is correct
103 Correct 1 ms 344 KB Output is correct
104 Execution timed out 4003 ms 3872 KB Time limit exceeded
105 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 287 ms 1388 KB 12th lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -