oj.uz

Submission #123405

# Submission time Handle Problem Language Result Execution time Memory
123405 2019-07-01T11:48:27 Z youngyojun Two Antennas (JOI19_antennas) C++11
100 / 100
 1185 ms 48100 KB 
#include <bits/stdc++.h>
#define eb emplace_back
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define INF (0x3f3f3f3f)
using namespace std;
 
const int MAXN = 200055;
const int MAXQ = 200055;
 
struct SEG {
	SEG() { init(); }
	int dp[MAXN*3], dmn[MAXN*3], dmx[MAXN*3];
 
	void init() {
		fill(dp, dp+MAXN*3, -INF);
		fill(dmn, dmn+MAXN*3, INF);
		memset(dmx, 0, MAXN*12);
	}
 
	void prop(int i, int s, int e) {
		upmax(dp[i], dmx[i] - dmn[i]);
		if(s != e) {
			upmax(dmx[i<<1], dmx[i]);
			upmax(dmx[i<<1|1], dmx[i]);
		}
		dmx[i] = 0;
	}
	void cal(int i, int s, int e) {
		if(s == e) return;
		upmax(dp[i], max(dp[i<<1], dp[i<<1|1]));
		dmn[i] = min(dmn[i<<1], dmn[i<<1|1]);
	}
	void upd(int i, int s, int e, int p, int q, int r) {
		prop(i, s, e); if(q < p || e < p || q < s) return;
		if(p <= s && e <= q) {
			dmx[i] = r;
			upmax(dp[i], r - dmn[i]);
			return;
		}
		int m = (s+e) >> 1;
		upd(i<<1, s, m, p, q, r);
		upd(i<<1|1, m+1, e, p, q, r);
		cal(i, s, e);
	}
	void upd(int i, int s, int e, int x, int r) {
		prop(i, s, e); if(x < s || e < x) return;
		if(s == e) {
			dmn[i] = r;
			return;
		}
		int m = (s+e) >> 1;
		upd(i<<1, s, m, x, r);
		upd(i<<1|1, m+1, e, x, r);
		cal(i, s, e);
	}
	int get(int i, int s, int e, int p, int q) {
		prop(i, s, e); if(q < p || e < p || q < s) return -INF;
		if(p <= s && e <= q) {
			int ret = dp[i];
			cal(i, s, e);
			return ret;
		}
		int m = (s+e) >> 1;
		int ret = max(get(i<<1, s, m, p, q), get(i<<1|1, m+1, e, p, q));
		cal(i, s, e);
		return ret;
	}
} seg;
 
vector<int> PushV[MAXN], PopV[MAXN], QV[MAXN];
 
int A[MAXN], B[MAXN], H[MAXN];
int S[MAXQ], E[MAXQ];
 
int Ans[MAXQ];
int N, Q;
 
void solve() {
	for(int i = 1; i <= Q; i++) QV[E[i]].eb(i);
	for(int i = 1; i <= N; i++) {
		PushV[min(N+1, i+A[i])].eb(i);
		PopV[min(N+1, i+B[i]+1)].eb(i);
	}
	for(int j = 1; j <= N; j++) {
		for(int i : PushV[j]) seg.upd(1, 1, N, i, H[i]);
		for(int i : PopV[j]) seg.upd(1, 1, N, i, INF);
		seg.upd(1, 1, N, max(1, j-B[j]), j-A[j], H[j]);
		for(int q : QV[j]) upmax(Ans[q], seg.get(1, 1, N, S[q], j-1));
	}
}
 
int main() {
	ios::sync_with_stdio(false);
 
	cin >> N; for(int i = 1; i <= N; i++) cin >> H[i] >> A[i] >> B[i];
	cin >> Q; for(int i = 1; i <= Q; i++) cin >> S[i] >> E[i];
 
	fill(Ans, Ans+Q+1, -1);
	solve();
 
	seg.init();
	reverse(A+1, A+N+1);
	reverse(B+1, B+N+1);
	reverse(H+1, H+N+1);
	for(int i = 1; i <= Q; i++) {
		swap(S[i], E[i]);
		S[i] = N-S[i]+1;
		E[i] = N-E[i]+1;
	}
	for(int i = 0; i <= N; i++) {
		PushV[i].clear();
		PopV[i].clear();
		QV[i].clear();
	}
 
	solve();
 
	for(int i = 1; i <= Q; i++) printf("%d\n", Ans[i]);
	return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 21496 KB Output is correct
2 Correct 22 ms 21496 KB Output is correct
3 Correct 22 ms 21536 KB Output is correct
4 Correct 22 ms 21600 KB Output is correct
5 Correct 21 ms 21592 KB Output is correct
6 Correct 22 ms 21496 KB Output is correct
7 Correct 22 ms 21496 KB Output is correct
8 Correct 22 ms 21496 KB Output is correct
9 Correct 22 ms 21624 KB Output is correct
10 Correct 22 ms 21496 KB Output is correct
11 Correct 22 ms 21496 KB Output is correct
12 Correct 22 ms 21496 KB Output is correct
13 Correct 22 ms 21496 KB Output is correct
14 Correct 22 ms 21496 KB Output is correct
15 Correct 22 ms 21496 KB Output is correct
16 Correct 22 ms 21496 KB Output is correct
17 Correct 21 ms 21496 KB Output is correct
18 Correct 22 ms 21496 KB Output is correct
19 Correct 21 ms 21496 KB Output is correct
20 Correct 22 ms 21584 KB Output is correct
21 Correct 22 ms 21496 KB Output is correct
22 Correct 22 ms 21496 KB Output is correct
23 Correct 22 ms 21496 KB Output is correct
24 Correct 22 ms 21496 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 21496 KB Output is correct
2 Correct 22 ms 21496 KB Output is correct
3 Correct 22 ms 21536 KB Output is correct
4 Correct 22 ms 21600 KB Output is correct
5 Correct 21 ms 21592 KB Output is correct
6 Correct 22 ms 21496 KB Output is correct
7 Correct 22 ms 21496 KB Output is correct
8 Correct 22 ms 21496 KB Output is correct
9 Correct 22 ms 21624 KB Output is correct
10 Correct 22 ms 21496 KB Output is correct
11 Correct 22 ms 21496 KB Output is correct
12 Correct 22 ms 21496 KB Output is correct
13 Correct 22 ms 21496 KB Output is correct
14 Correct 22 ms 21496 KB Output is correct
15 Correct 22 ms 21496 KB Output is correct
16 Correct 22 ms 21496 KB Output is correct
17 Correct 21 ms 21496 KB Output is correct
18 Correct 22 ms 21496 KB Output is correct
19 Correct 21 ms 21496 KB Output is correct
20 Correct 22 ms 21584 KB Output is correct
21 Correct 22 ms 21496 KB Output is correct
22 Correct 22 ms 21496 KB Output is correct
23 Correct 22 ms 21496 KB Output is correct
24 Correct 22 ms 21496 KB Output is correct
25 Correct 199 ms 25848 KB Output is correct
26 Correct 46 ms 22008 KB Output is correct
27 Correct 293 ms 27356 KB Output is correct
28 Correct 333 ms 27256 KB Output is correct
29 Correct 202 ms 25848 KB Output is correct
30 Correct 207 ms 25464 KB Output is correct
31 Correct 211 ms 26972 KB Output is correct
32 Correct 297 ms 27256 KB Output is correct
33 Correct 274 ms 27256 KB Output is correct
34 Correct 170 ms 24440 KB Output is correct
35 Correct 291 ms 27512 KB Output is correct
36 Correct 297 ms 27256 KB Output is correct
37 Correct 172 ms 24312 KB Output is correct
38 Correct 293 ms 26284 KB Output is correct
39 Correct 60 ms 22264 KB Output is correct
40 Correct 293 ms 26232 KB Output is correct
41 Correct 216 ms 25208 KB Output is correct
42 Correct 292 ms 26232 KB Output is correct
43 Correct 109 ms 23288 KB Output is correct
44 Correct 288 ms 26232 KB Output is correct
45 Correct 68 ms 22520 KB Output is correct
46 Correct 292 ms 26232 KB Output is correct
47 Correct 90 ms 22904 KB Output is correct
48 Correct 298 ms 26232 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 438 ms 31336 KB Output is correct
2 Correct 495 ms 33704 KB Output is correct
3 Correct 337 ms 30692 KB Output is correct
4 Correct 500 ms 33772 KB Output is correct
5 Correct 206 ms 28264 KB Output is correct
6 Correct 481 ms 33616 KB Output is correct
7 Correct 410 ms 31880 KB Output is correct
8 Correct 495 ms 33764 KB Output is correct
9 Correct 77 ms 23796 KB Output is correct
10 Correct 475 ms 33892 KB Output is correct
11 Correct 289 ms 29468 KB Output is correct
12 Correct 490 ms 33772 KB Output is correct
13 Correct 325 ms 30824 KB Output is correct
14 Correct 306 ms 30552 KB Output is correct
15 Correct 301 ms 29608 KB Output is correct
16 Correct 281 ms 29916 KB Output is correct
17 Correct 335 ms 31276 KB Output is correct
18 Correct 325 ms 30060 KB Output is correct
19 Correct 357 ms 30044 KB Output is correct
20 Correct 313 ms 30216 KB Output is correct
21 Correct 307 ms 31948 KB Output is correct
22 Correct 310 ms 30424 KB Output is correct
23 Correct 315 ms 30312 KB Output is correct
24 Correct 275 ms 29416 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 21496 KB Output is correct
2 Correct 22 ms 21496 KB Output is correct
3 Correct 22 ms 21536 KB Output is correct
4 Correct 22 ms 21600 KB Output is correct
5 Correct 21 ms 21592 KB Output is correct
6 Correct 22 ms 21496 KB Output is correct
7 Correct 22 ms 21496 KB Output is correct
8 Correct 22 ms 21496 KB Output is correct
9 Correct 22 ms 21624 KB Output is correct
10 Correct 22 ms 21496 KB Output is correct
11 Correct 22 ms 21496 KB Output is correct
12 Correct 22 ms 21496 KB Output is correct
13 Correct 22 ms 21496 KB Output is correct
14 Correct 22 ms 21496 KB Output is correct
15 Correct 22 ms 21496 KB Output is correct
16 Correct 22 ms 21496 KB Output is correct
17 Correct 21 ms 21496 KB Output is correct
18 Correct 22 ms 21496 KB Output is correct
19 Correct 21 ms 21496 KB Output is correct
20 Correct 22 ms 21584 KB Output is correct
21 Correct 22 ms 21496 KB Output is correct
22 Correct 22 ms 21496 KB Output is correct
23 Correct 22 ms 21496 KB Output is correct
24 Correct 22 ms 21496 KB Output is correct
25 Correct 199 ms 25848 KB Output is correct
26 Correct 46 ms 22008 KB Output is correct
27 Correct 293 ms 27356 KB Output is correct
28 Correct 333 ms 27256 KB Output is correct
29 Correct 202 ms 25848 KB Output is correct
30 Correct 207 ms 25464 KB Output is correct
31 Correct 211 ms 26972 KB Output is correct
32 Correct 297 ms 27256 KB Output is correct
33 Correct 274 ms 27256 KB Output is correct
34 Correct 170 ms 24440 KB Output is correct
35 Correct 291 ms 27512 KB Output is correct
36 Correct 297 ms 27256 KB Output is correct
37 Correct 172 ms 24312 KB Output is correct
38 Correct 293 ms 26284 KB Output is correct
39 Correct 60 ms 22264 KB Output is correct
40 Correct 293 ms 26232 KB Output is correct
41 Correct 216 ms 25208 KB Output is correct
42 Correct 292 ms 26232 KB Output is correct
43 Correct 109 ms 23288 KB Output is correct
44 Correct 288 ms 26232 KB Output is correct
45 Correct 68 ms 22520 KB Output is correct
46 Correct 292 ms 26232 KB Output is correct
47 Correct 90 ms 22904 KB Output is correct
48 Correct 298 ms 26232 KB Output is correct
49 Correct 438 ms 31336 KB Output is correct
50 Correct 495 ms 33704 KB Output is correct
51 Correct 337 ms 30692 KB Output is correct
52 Correct 500 ms 33772 KB Output is correct
53 Correct 206 ms 28264 KB Output is correct
54 Correct 481 ms 33616 KB Output is correct
55 Correct 410 ms 31880 KB Output is correct
56 Correct 495 ms 33764 KB Output is correct
57 Correct 77 ms 23796 KB Output is correct
58 Correct 475 ms 33892 KB Output is correct
59 Correct 289 ms 29468 KB Output is correct
60 Correct 490 ms 33772 KB Output is correct
61 Correct 325 ms 30824 KB Output is correct
62 Correct 306 ms 30552 KB Output is correct
63 Correct 301 ms 29608 KB Output is correct
64 Correct 281 ms 29916 KB Output is correct
65 Correct 335 ms 31276 KB Output is correct
66 Correct 325 ms 30060 KB Output is correct
67 Correct 357 ms 30044 KB Output is correct
68 Correct 313 ms 30216 KB Output is correct
69 Correct 307 ms 31948 KB Output is correct
70 Correct 310 ms 30424 KB Output is correct
71 Correct 315 ms 30312 KB Output is correct
72 Correct 275 ms 29416 KB Output is correct
73 Correct 959 ms 44028 KB Output is correct
74 Correct 554 ms 37912 KB Output is correct
75 Correct 948 ms 42668 KB Output is correct
76 Correct 1171 ms 48096 KB Output is correct
77 Correct 622 ms 35912 KB Output is correct
78 Correct 954 ms 44896 KB Output is correct
79 Correct 1067 ms 45712 KB Output is correct
80 Correct 1171 ms 48096 KB Output is correct
81 Correct 519 ms 32128 KB Output is correct
82 Correct 824 ms 42968 KB Output is correct
83 Correct 895 ms 41344 KB Output is correct
84 Correct 1185 ms 48100 KB Output is correct
85 Correct 702 ms 40512 KB Output is correct
86 Correct 932 ms 43948 KB Output is correct
87 Correct 406 ms 34800 KB Output is correct
88 Correct 910 ms 43528 KB Output is correct
89 Correct 816 ms 42320 KB Output is correct
90 Correct 922 ms 43756 KB Output is correct
91 Correct 538 ms 37456 KB Output is correct
92 Correct 939 ms 43996 KB Output is correct
93 Correct 417 ms 37284 KB Output is correct
94 Correct 945 ms 44036 KB Output is correct
95 Correct 489 ms 36864 KB Output is correct
96 Correct 889 ms 42980 KB Output is correct