oj.uz

Submission #526829

# Submission time Handle Problem Language Result Execution time Memory
526829 2022-02-16T08:29:00 Z fhvirus Two Antennas (JOI19_antennas) C++17
100 / 100
 597 ms 38724 KB 
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")

const int INF = 1e9 + 7;

struct SGT {
	int n; vector<int> min_height, tag, max_dif;
	SGT(int _n): n(_n), min_height(n * 4 + 4, INF),
		tag(n * 4 + 4, -INF), max_dif(n * 4 + 4, -1) {}
	void upd(int i, int v) {
		tag[i] = max(tag[i], v);
		max_dif[i] = max(max_dif[i], tag[i] - min_height[i]);
	}
	void push(int i) {
		if (tag[i] == -INF) return;
		upd(i * 2, tag[i]);
		upd(i * 2 + 1, tag[i]);
		tag[i] = -INF;
	}
	void pull(int i) {
		min_height[i] = min(min_height[i * 2], min_height[i * 2 + 1]);
		max_dif[i] = max(max_dif[i * 2], max_dif[i * 2 + 1]);
	}
	void set_height(int i, int l, int r, int p, int v) {
		if (l == r) {
			min_height[i] = v;
			tag[i] = -INF;
			return;
		}
		push(i);
		int m = (l + r) / 2;
		if (p <= m) set_height(i * 2, l, m, p, v);
		else set_height(i * 2 + 1, m + 1, r, p, v);
		pull(i);
		return;
	}
	void chmax(int i, int l, int r, int ql, int qr, int v) {
		if (ql <= l and r <= qr) {
			upd(i, v);
			return;
		}
		push(i);
		int m = (l + r) / 2;
		if (ql <= m) chmax(i * 2, l, m, ql, qr, v);
		if (m < qr) chmax(i * 2 + 1, m + 1, r, ql, qr, v);
		pull(i);
		return;
	}
	int query(int i, int l, int r, int ql, int qr) {
		if (ql <= l and r <= qr)
			return max_dif[i];
		push(i);
		int m = (l + r) / 2, ans = -1;
		if (ql <= m) ans = max(ans, query(i * 2, l, m, ql, qr));
		if (m < qr) ans = max(ans, query(i * 2 + 1, m + 1, r, ql, qr));
		return ans;
	}
	void set_height(int p, int v) { set_height(1, 1, n, p, v); }
	void chmax(int ql, int qr, int v) { chmax(1, 1, n, ql, qr, v); }
	int query(int ql, int qr) { return query(1, 1, n, ql, qr); }
};

signed main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	int N; cin >> N;
	vector<int> H(N + 1), A(N + 1), B(N + 1);
	for (int i = 1; i <= N; ++i)
		cin >> H[i] >> A[i] >> B[i];

	int Q; cin >> Q;
	vector<int> L(Q + 1), R(Q + 1);
	for (int i = 1; i <= Q; ++i)
		cin >> L[i] >> R[i];

	vector<int> ans(Q + 1, -1);
	auto solve = [&]() -> void {
		vector<vector<int>> in(N + 1);
		vector<vector<int>> ou(N + 2);
		for (int i = 1; i <= N; ++i) {
			int lb = min(N + 1, i + A[i]);
			int rb = min(N, i + B[i]);
			if (lb < N + 1) {
				in[lb].push_back(i);
				ou[rb + 1].push_back(i);
			}
		}

		vector<vector<pair<int, int>>> qs(N + 1);
		for (int i = 1; i <= Q; ++i)
			qs[R[i]].emplace_back(L[i], i);

		SGT sgt(N);
		for (int i = 1; i <= N; ++i) {
			for (int &j: in[i])
				sgt.set_height(j, H[j]);
			for (int &j: ou[i])
				sgt.set_height(j, INF);

			int lb = max(1, i - B[i]);
			int rb = max(0, i - A[i]);
			if (rb > 0)
				sgt.chmax(lb, rb, H[i]);

			for (auto &[ql, id]: qs[i])
				ans[id] = max(ans[id], sgt.query(ql, i));
		}
	};

	solve();
	reverse(begin(H) + 1, end(H));
	reverse(begin(A) + 1, end(A));
	reverse(begin(B) + 1, end(B));
	for (int i = 1; i <= Q; ++i) {
		L[i] = N - L[i] + 1;
		R[i] = N - R[i] + 1;
		swap(L[i], R[i]);
	}
	solve();

	for (int i = 1; i <= Q; ++i)
		cout << ans[i] << '\n';

	return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 360 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 316 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 360 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 316 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 78 ms 5204 KB Output is correct
26 Correct 11 ms 1224 KB Output is correct
27 Correct 118 ms 7448 KB Output is correct
28 Correct 115 ms 8608 KB Output is correct
29 Correct 80 ms 5460 KB Output is correct
30 Correct 75 ms 6388 KB Output is correct
31 Correct 89 ms 6740 KB Output is correct
32 Correct 115 ms 8824 KB Output is correct
33 Correct 102 ms 7052 KB Output is correct
34 Correct 58 ms 4568 KB Output is correct
35 Correct 113 ms 7664 KB Output is correct
36 Correct 115 ms 7928 KB Output is correct
37 Correct 61 ms 4832 KB Output is correct
38 Correct 104 ms 7240 KB Output is correct
39 Correct 18 ms 1740 KB Output is correct
40 Correct 131 ms 7256 KB Output is correct
41 Correct 77 ms 5836 KB Output is correct
42 Correct 104 ms 7236 KB Output is correct
43 Correct 37 ms 3140 KB Output is correct
44 Correct 139 ms 7216 KB Output is correct
45 Correct 20 ms 1880 KB Output is correct
46 Correct 103 ms 7236 KB Output is correct
47 Correct 30 ms 2568 KB Output is correct
48 Correct 110 ms 7276 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 31076 KB Output is correct
2 Correct 348 ms 33892 KB Output is correct
3 Correct 255 ms 24400 KB Output is correct
4 Correct 341 ms 33728 KB Output is correct
5 Correct 143 ms 15948 KB Output is correct
6 Correct 347 ms 32936 KB Output is correct
7 Correct 301 ms 29112 KB Output is correct
8 Correct 345 ms 33088 KB Output is correct
9 Correct 40 ms 5580 KB Output is correct
10 Correct 331 ms 33004 KB Output is correct
11 Correct 206 ms 21608 KB Output is correct
12 Correct 339 ms 33124 KB Output is correct
13 Correct 210 ms 32160 KB Output is correct
14 Correct 197 ms 31744 KB Output is correct
15 Correct 191 ms 30812 KB Output is correct
16 Correct 178 ms 31072 KB Output is correct
17 Correct 217 ms 32260 KB Output is correct
18 Correct 193 ms 31112 KB Output is correct
19 Correct 199 ms 31308 KB Output is correct
20 Correct 210 ms 31524 KB Output is correct
21 Correct 185 ms 31988 KB Output is correct
22 Correct 195 ms 31556 KB Output is correct
23 Correct 200 ms 31324 KB Output is correct
24 Correct 172 ms 29972 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 360 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 316 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 78 ms 5204 KB Output is correct
26 Correct 11 ms 1224 KB Output is correct
27 Correct 118 ms 7448 KB Output is correct
28 Correct 115 ms 8608 KB Output is correct
29 Correct 80 ms 5460 KB Output is correct
30 Correct 75 ms 6388 KB Output is correct
31 Correct 89 ms 6740 KB Output is correct
32 Correct 115 ms 8824 KB Output is correct
33 Correct 102 ms 7052 KB Output is correct
34 Correct 58 ms 4568 KB Output is correct
35 Correct 113 ms 7664 KB Output is correct
36 Correct 115 ms 7928 KB Output is correct
37 Correct 61 ms 4832 KB Output is correct
38 Correct 104 ms 7240 KB Output is correct
39 Correct 18 ms 1740 KB Output is correct
40 Correct 131 ms 7256 KB Output is correct
41 Correct 77 ms 5836 KB Output is correct
42 Correct 104 ms 7236 KB Output is correct
43 Correct 37 ms 3140 KB Output is correct
44 Correct 139 ms 7216 KB Output is correct
45 Correct 20 ms 1880 KB Output is correct
46 Correct 103 ms 7236 KB Output is correct
47 Correct 30 ms 2568 KB Output is correct
48 Correct 110 ms 7276 KB Output is correct
49 Correct 303 ms 31076 KB Output is correct
50 Correct 348 ms 33892 KB Output is correct
51 Correct 255 ms 24400 KB Output is correct
52 Correct 341 ms 33728 KB Output is correct
53 Correct 143 ms 15948 KB Output is correct
54 Correct 347 ms 32936 KB Output is correct
55 Correct 301 ms 29112 KB Output is correct
56 Correct 345 ms 33088 KB Output is correct
57 Correct 40 ms 5580 KB Output is correct
58 Correct 331 ms 33004 KB Output is correct
59 Correct 206 ms 21608 KB Output is correct
60 Correct 339 ms 33124 KB Output is correct
61 Correct 210 ms 32160 KB Output is correct
62 Correct 197 ms 31744 KB Output is correct
63 Correct 191 ms 30812 KB Output is correct
64 Correct 178 ms 31072 KB Output is correct
65 Correct 217 ms 32260 KB Output is correct
66 Correct 193 ms 31112 KB Output is correct
67 Correct 199 ms 31308 KB Output is correct
68 Correct 210 ms 31524 KB Output is correct
69 Correct 185 ms 31988 KB Output is correct
70 Correct 195 ms 31556 KB Output is correct
71 Correct 200 ms 31324 KB Output is correct
72 Correct 172 ms 29972 KB Output is correct
73 Correct 502 ms 34252 KB Output is correct
74 Correct 351 ms 32604 KB Output is correct
75 Correct 445 ms 29368 KB Output is correct
76 Correct 584 ms 38584 KB Output is correct
77 Correct 299 ms 20716 KB Output is correct
78 Correct 550 ms 36632 KB Output is correct
79 Correct 525 ms 34504 KB Output is correct
80 Correct 596 ms 38724 KB Output is correct
81 Correct 206 ms 12132 KB Output is correct
82 Correct 472 ms 35648 KB Output is correct
83 Correct 428 ms 27080 KB Output is correct
84 Correct 597 ms 38580 KB Output is correct
85 Correct 348 ms 35396 KB Output is correct
86 Correct 415 ms 37244 KB Output is correct
87 Correct 225 ms 31032 KB Output is correct
88 Correct 393 ms 36028 KB Output is correct
89 Correct 381 ms 36228 KB Output is correct
90 Correct 416 ms 36384 KB Output is correct
91 Correct 282 ms 32616 KB Output is correct
92 Correct 424 ms 36496 KB Output is correct
93 Correct 235 ms 32084 KB Output is correct
94 Correct 417 ms 36652 KB Output is correct
95 Correct 260 ms 32132 KB Output is correct
96 Correct 393 ms 35664 KB Output is correct