oj.uz

Submission #503005

# Submission time Handle Problem Language Result Execution time Memory
503005 2022-01-06T21:45:15 Z sidon Two Antennas (JOI19_antennas) C++17
100 / 100
 1210 ms 85544 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
 
#define remax(X, Y) X = max(X, Y)
#define remin(X, Y) X = min(X, Y)
 
const int Z = 2e5, INF = 1e12;
 
int sL, sR, sV;
struct SegmentTree{
	int l, r, sMin = INF, sMax = -INF, res = -INF;
	SegmentTree *L, *R;
	void pull() {
		sMin = min(L->sMin, R->sMin);
		res = max({L->res, R->res, sMax - sMin});
	}
	void apply(int val) {
		remax(sMax, val);
		res = max(res, sMax - sMin);
		if(r - l > 1) pull();
	}
	void push() {
		L->apply(sMax);
		R->apply(sMax);
		sMax = -INF;
	}
	SegmentTree(int lx, int rx) : l(lx), r(rx) {
		if(r - l > 1) {
			int m = (l + r) / 2;
			L = new SegmentTree(l, m);
			R = new SegmentTree(m, r);
		}
	}
	void rangeMaximise(int lx, int rx, int v) {
		sL = lx, sR = rx, sV = v;
		rangeMaximise();
	}
	void rangeMaximise() {
		if(sL<=l && r<=sR) return apply(sV);
		if(sR<=l || r<=sL) return;
		push();
		L->rangeMaximise(), R->rangeMaximise();
		pull();
	}
	void pointUpdate(int i, int v) {
		sL = i, sV = v;
		pointUpdate();
	}
	void pointUpdate() {
		if(r - l < 2) {
			sMax = -INF;
			sMin = sV, res = max(res, sMax - sMin);
			return;
		}
		push();
		(sL < L->r ? L : R)->pointUpdate();
		pull();
	}
	int rangeMaxDiff(int lx, int rx) {
		sL = lx, sR = rx;
		return query();
	}
	int query() {
		if(sL<=l && r<=sR) return res;
		if(sR<=l || r<=sL) return -INF;
		push();
		return max(L->query(), R->query());
	}
};
 
int N, Q, H[Z], A[Z], B[Z], qL[Z], qR[Z], ans[Z];
 
vector<int> add[Z+1], qAt[Z];
 
signed main() {
	ios::sync_with_stdio(0); cin.tie(0);
 
	cin >> N;
 
	for(int i = 0; i < N; ++i) {
		cin >> H[i] >> A[i] >> B[i];
 
		if(i + A[i] <  N) {
			add[i + A[i]].push_back(i);
			add[min(N, i+B[i]+1)].push_back(-i-1);
		}
	}
 
	cin >> Q;
	
	for(int i = 0; i < Q; ++i) {
		cin >> qL[i] >> qR[i];
		--qL[i], --qR[i];
		qAt[qR[i]].push_back(i);
		ans[i] = -1;
	}
 
	for(int _ : {1, 0}) {
		SegmentTree st(0, N);
		for(int i = 0; i < N; ++i) {
			for(int &j : add[i]) {
				if(j < 0) st.pointUpdate(-j-1, INF);
				else st.pointUpdate(j, H[j]);
			}
			if(i - A[i] >= 0) 
				st.rangeMaximise(max(0LL, i-B[i]), i-A[i]+1, H[i]);
			
			for(int &j : qAt[i])
				ans[j] = max(ans[j], st.rangeMaxDiff(qL[j], i+1));
		}
		if(_) for(int &i : H) i = -i;
	}
 
	for(int i = 0; i < Q; ++i) {
		cout << ans[i] << '\n';
	}
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11340 KB Output is correct
2 Correct 6 ms 11296 KB Output is correct
3 Correct 6 ms 11368 KB Output is correct
4 Correct 6 ms 11384 KB Output is correct
5 Correct 6 ms 11368 KB Output is correct
6 Correct 5 ms 11332 KB Output is correct
7 Correct 6 ms 11340 KB Output is correct
8 Correct 6 ms 11304 KB Output is correct
9 Correct 6 ms 11248 KB Output is correct
10 Correct 6 ms 11384 KB Output is correct
11 Correct 5 ms 11244 KB Output is correct
12 Correct 6 ms 11388 KB Output is correct
13 Correct 6 ms 11372 KB Output is correct
14 Correct 6 ms 11340 KB Output is correct
15 Correct 7 ms 11360 KB Output is correct
16 Correct 6 ms 11340 KB Output is correct
17 Correct 6 ms 11372 KB Output is correct
18 Correct 6 ms 11340 KB Output is correct
19 Correct 5 ms 11340 KB Output is correct
20 Correct 8 ms 11364 KB Output is correct
21 Correct 7 ms 11340 KB Output is correct
22 Correct 6 ms 11320 KB Output is correct
23 Correct 5 ms 11372 KB Output is correct
24 Correct 7 ms 11340 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11340 KB Output is correct
2 Correct 6 ms 11296 KB Output is correct
3 Correct 6 ms 11368 KB Output is correct
4 Correct 6 ms 11384 KB Output is correct
5 Correct 6 ms 11368 KB Output is correct
6 Correct 5 ms 11332 KB Output is correct
7 Correct 6 ms 11340 KB Output is correct
8 Correct 6 ms 11304 KB Output is correct
9 Correct 6 ms 11248 KB Output is correct
10 Correct 6 ms 11384 KB Output is correct
11 Correct 5 ms 11244 KB Output is correct
12 Correct 6 ms 11388 KB Output is correct
13 Correct 6 ms 11372 KB Output is correct
14 Correct 6 ms 11340 KB Output is correct
15 Correct 7 ms 11360 KB Output is correct
16 Correct 6 ms 11340 KB Output is correct
17 Correct 6 ms 11372 KB Output is correct
18 Correct 6 ms 11340 KB Output is correct
19 Correct 5 ms 11340 KB Output is correct
20 Correct 8 ms 11364 KB Output is correct
21 Correct 7 ms 11340 KB Output is correct
22 Correct 6 ms 11320 KB Output is correct
23 Correct 5 ms 11372 KB Output is correct
24 Correct 7 ms 11340 KB Output is correct
25 Correct 138 ms 19056 KB Output is correct
26 Correct 20 ms 12584 KB Output is correct
27 Correct 178 ms 22268 KB Output is correct
28 Correct 171 ms 22424 KB Output is correct
29 Correct 123 ms 19028 KB Output is correct
30 Correct 107 ms 18840 KB Output is correct
31 Correct 119 ms 21100 KB Output is correct
32 Correct 162 ms 22372 KB Output is correct
33 Correct 153 ms 21628 KB Output is correct
34 Correct 79 ms 16880 KB Output is correct
35 Correct 180 ms 22268 KB Output is correct
36 Correct 181 ms 22388 KB Output is correct
37 Correct 100 ms 17360 KB Output is correct
38 Correct 159 ms 21448 KB Output is correct
39 Correct 38 ms 13100 KB Output is correct
40 Correct 175 ms 21472 KB Output is correct
41 Correct 120 ms 18756 KB Output is correct
42 Correct 189 ms 21364 KB Output is correct
43 Correct 56 ms 14912 KB Output is correct
44 Correct 194 ms 21464 KB Output is correct
45 Correct 33 ms 13392 KB Output is correct
46 Correct 158 ms 21340 KB Output is correct
47 Correct 45 ms 14296 KB Output is correct
48 Correct 166 ms 21572 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 459 ms 62344 KB Output is correct
2 Correct 462 ms 72508 KB Output is correct
3 Correct 320 ms 54212 KB Output is correct
4 Correct 541 ms 72656 KB Output is correct
5 Correct 165 ms 39416 KB Output is correct
6 Correct 479 ms 72524 KB Output is correct
7 Correct 441 ms 64420 KB Output is correct
8 Correct 477 ms 72516 KB Output is correct
9 Correct 66 ms 21092 KB Output is correct
10 Correct 505 ms 72524 KB Output is correct
11 Correct 261 ms 49600 KB Output is correct
12 Correct 536 ms 72556 KB Output is correct
13 Correct 310 ms 70916 KB Output is correct
14 Correct 274 ms 71024 KB Output is correct
15 Correct 281 ms 71020 KB Output is correct
16 Correct 248 ms 71508 KB Output is correct
17 Correct 328 ms 71164 KB Output is correct
18 Correct 329 ms 71516 KB Output is correct
19 Correct 316 ms 70780 KB Output is correct
20 Correct 317 ms 70920 KB Output is correct
21 Correct 282 ms 70756 KB Output is correct
22 Correct 368 ms 71004 KB Output is correct
23 Correct 310 ms 70844 KB Output is correct
24 Correct 306 ms 70968 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11340 KB Output is correct
2 Correct 6 ms 11296 KB Output is correct
3 Correct 6 ms 11368 KB Output is correct
4 Correct 6 ms 11384 KB Output is correct
5 Correct 6 ms 11368 KB Output is correct
6 Correct 5 ms 11332 KB Output is correct
7 Correct 6 ms 11340 KB Output is correct
8 Correct 6 ms 11304 KB Output is correct
9 Correct 6 ms 11248 KB Output is correct
10 Correct 6 ms 11384 KB Output is correct
11 Correct 5 ms 11244 KB Output is correct
12 Correct 6 ms 11388 KB Output is correct
13 Correct 6 ms 11372 KB Output is correct
14 Correct 6 ms 11340 KB Output is correct
15 Correct 7 ms 11360 KB Output is correct
16 Correct 6 ms 11340 KB Output is correct
17 Correct 6 ms 11372 KB Output is correct
18 Correct 6 ms 11340 KB Output is correct
19 Correct 5 ms 11340 KB Output is correct
20 Correct 8 ms 11364 KB Output is correct
21 Correct 7 ms 11340 KB Output is correct
22 Correct 6 ms 11320 KB Output is correct
23 Correct 5 ms 11372 KB Output is correct
24 Correct 7 ms 11340 KB Output is correct
25 Correct 138 ms 19056 KB Output is correct
26 Correct 20 ms 12584 KB Output is correct
27 Correct 178 ms 22268 KB Output is correct
28 Correct 171 ms 22424 KB Output is correct
29 Correct 123 ms 19028 KB Output is correct
30 Correct 107 ms 18840 KB Output is correct
31 Correct 119 ms 21100 KB Output is correct
32 Correct 162 ms 22372 KB Output is correct
33 Correct 153 ms 21628 KB Output is correct
34 Correct 79 ms 16880 KB Output is correct
35 Correct 180 ms 22268 KB Output is correct
36 Correct 181 ms 22388 KB Output is correct
37 Correct 100 ms 17360 KB Output is correct
38 Correct 159 ms 21448 KB Output is correct
39 Correct 38 ms 13100 KB Output is correct
40 Correct 175 ms 21472 KB Output is correct
41 Correct 120 ms 18756 KB Output is correct
42 Correct 189 ms 21364 KB Output is correct
43 Correct 56 ms 14912 KB Output is correct
44 Correct 194 ms 21464 KB Output is correct
45 Correct 33 ms 13392 KB Output is correct
46 Correct 158 ms 21340 KB Output is correct
47 Correct 45 ms 14296 KB Output is correct
48 Correct 166 ms 21572 KB Output is correct
49 Correct 459 ms 62344 KB Output is correct
50 Correct 462 ms 72508 KB Output is correct
51 Correct 320 ms 54212 KB Output is correct
52 Correct 541 ms 72656 KB Output is correct
53 Correct 165 ms 39416 KB Output is correct
54 Correct 479 ms 72524 KB Output is correct
55 Correct 441 ms 64420 KB Output is correct
56 Correct 477 ms 72516 KB Output is correct
57 Correct 66 ms 21092 KB Output is correct
58 Correct 505 ms 72524 KB Output is correct
59 Correct 261 ms 49600 KB Output is correct
60 Correct 536 ms 72556 KB Output is correct
61 Correct 310 ms 70916 KB Output is correct
62 Correct 274 ms 71024 KB Output is correct
63 Correct 281 ms 71020 KB Output is correct
64 Correct 248 ms 71508 KB Output is correct
65 Correct 328 ms 71164 KB Output is correct
66 Correct 329 ms 71516 KB Output is correct
67 Correct 316 ms 70780 KB Output is correct
68 Correct 317 ms 70920 KB Output is correct
69 Correct 282 ms 70756 KB Output is correct
70 Correct 368 ms 71004 KB Output is correct
71 Correct 310 ms 70844 KB Output is correct
72 Correct 306 ms 70968 KB Output is correct
73 Correct 1000 ms 76184 KB Output is correct
74 Correct 681 ms 73688 KB Output is correct
75 Correct 868 ms 66836 KB Output is correct
76 Correct 1210 ms 85540 KB Output is correct
77 Correct 636 ms 48548 KB Output is correct
78 Correct 929 ms 81476 KB Output is correct
79 Correct 1060 ms 77208 KB Output is correct
80 Correct 1106 ms 85524 KB Output is correct
81 Correct 337 ms 32064 KB Output is correct
82 Correct 876 ms 79176 KB Output is correct
83 Correct 751 ms 62020 KB Output is correct
84 Correct 978 ms 85544 KB Output is correct
85 Correct 569 ms 77992 KB Output is correct
86 Correct 767 ms 82844 KB Output is correct
87 Correct 339 ms 72828 KB Output is correct
88 Correct 709 ms 83324 KB Output is correct
89 Correct 636 ms 79900 KB Output is correct
90 Correct 732 ms 83308 KB Output is correct
91 Correct 454 ms 74992 KB Output is correct
92 Correct 728 ms 82704 KB Output is correct
93 Correct 346 ms 72920 KB Output is correct
94 Correct 744 ms 82816 KB Output is correct
95 Correct 399 ms 74148 KB Output is correct
96 Correct 682 ms 82680 KB Output is correct