oj.uz

Submission #123404

# Submission time Handle Problem Language Result Execution time Memory
123404 2019-07-01T11:47:58 Z youngyojun Two Antennas (JOI19_antennas) C++11
13 / 100
 3000 ms 29392 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;

int dp[MAXN], dc[MAXN];
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);
	}
	fill(dp, dp+N+1, -INF);
	fill(dc, dc+N+1, INF);
	for(int j = 1; j <= N; j++) {
		for(int i : PushV[j]) dc[i] = H[i];
		for(int i : PopV[j]) dc[i] = INF;
		for(int i = max(1, j-B[j]); i <= j-A[j]; i++)
			upmax(dp[i], H[j] - dc[i]);
		for(int q : QV[j]) {
			int ret = -INF;
			for(int i = S[q]; i < E[q]; i++)
				upmax(ret, dp[i]);
			upmax(Ans[q], ret);
		}
	}
	/*
	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]), max(1, 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 21 ms 21496 KB Output is correct
2 Correct 27 ms 21624 KB Output is correct
3 Correct 22 ms 21596 KB Output is correct
4 Correct 22 ms 21496 KB Output is correct
5 Correct 22 ms 21600 KB Output is correct
6 Correct 22 ms 21596 KB Output is correct
7 Correct 23 ms 21496 KB Output is correct
8 Correct 23 ms 21624 KB Output is correct
9 Correct 22 ms 21496 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 21624 KB Output is correct
13 Correct 21 ms 21496 KB Output is correct
14 Correct 22 ms 21496 KB Output is correct
15 Correct 22 ms 21628 KB Output is correct
16 Correct 21 ms 21496 KB Output is correct
17 Correct 22 ms 21528 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 21500 KB Output is correct
21 Correct 26 ms 21624 KB Output is correct
22 Correct 22 ms 21496 KB Output is correct
23 Correct 23 ms 21624 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 21 ms 21496 KB Output is correct
2 Correct 27 ms 21624 KB Output is correct
3 Correct 22 ms 21596 KB Output is correct
4 Correct 22 ms 21496 KB Output is correct
5 Correct 22 ms 21600 KB Output is correct
6 Correct 22 ms 21596 KB Output is correct
7 Correct 23 ms 21496 KB Output is correct
8 Correct 23 ms 21624 KB Output is correct
9 Correct 22 ms 21496 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 21624 KB Output is correct
13 Correct 21 ms 21496 KB Output is correct
14 Correct 22 ms 21496 KB Output is correct
15 Correct 22 ms 21628 KB Output is correct
16 Correct 21 ms 21496 KB Output is correct
17 Correct 22 ms 21528 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 21500 KB Output is correct
21 Correct 26 ms 21624 KB Output is correct
22 Correct 22 ms 21496 KB Output is correct
23 Correct 23 ms 21624 KB Output is correct
24 Correct 22 ms 21496 KB Output is correct
25 Correct 142 ms 26956 KB Output is correct
26 Correct 44 ms 22264 KB Output is correct
27 Correct 264 ms 29280 KB Output is correct
28 Correct 318 ms 29304 KB Output is correct
29 Correct 143 ms 27000 KB Output is correct
30 Correct 234 ms 26812 KB Output is correct
31 Correct 125 ms 28308 KB Output is correct
32 Correct 305 ms 29220 KB Output is correct
33 Correct 212 ms 29048 KB Output is correct
34 Correct 151 ms 25336 KB Output is correct
35 Correct 246 ms 29232 KB Output is correct
36 Correct 299 ms 29176 KB Output is correct
37 Correct 170 ms 25464 KB Output is correct
38 Correct 294 ms 28276 KB Output is correct
39 Correct 59 ms 22648 KB Output is correct
40 Correct 289 ms 28176 KB Output is correct
41 Correct 220 ms 26588 KB Output is correct
42 Correct 296 ms 28164 KB Output is correct
43 Correct 107 ms 23928 KB Output is correct
44 Correct 298 ms 28152 KB Output is correct
45 Correct 66 ms 22776 KB Output is correct
46 Correct 320 ms 28236 KB Output is correct
47 Correct 95 ms 23288 KB Output is correct
48 Correct 291 ms 28152 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3048 ms 29392 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 21496 KB Output is correct
2 Correct 27 ms 21624 KB Output is correct
3 Correct 22 ms 21596 KB Output is correct
4 Correct 22 ms 21496 KB Output is correct
5 Correct 22 ms 21600 KB Output is correct
6 Correct 22 ms 21596 KB Output is correct
7 Correct 23 ms 21496 KB Output is correct
8 Correct 23 ms 21624 KB Output is correct
9 Correct 22 ms 21496 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 21624 KB Output is correct
13 Correct 21 ms 21496 KB Output is correct
14 Correct 22 ms 21496 KB Output is correct
15 Correct 22 ms 21628 KB Output is correct
16 Correct 21 ms 21496 KB Output is correct
17 Correct 22 ms 21528 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 21500 KB Output is correct
21 Correct 26 ms 21624 KB Output is correct
22 Correct 22 ms 21496 KB Output is correct
23 Correct 23 ms 21624 KB Output is correct
24 Correct 22 ms 21496 KB Output is correct
25 Correct 142 ms 26956 KB Output is correct
26 Correct 44 ms 22264 KB Output is correct
27 Correct 264 ms 29280 KB Output is correct
28 Correct 318 ms 29304 KB Output is correct
29 Correct 143 ms 27000 KB Output is correct
30 Correct 234 ms 26812 KB Output is correct
31 Correct 125 ms 28308 KB Output is correct
32 Correct 305 ms 29220 KB Output is correct
33 Correct 212 ms 29048 KB Output is correct
34 Correct 151 ms 25336 KB Output is correct
35 Correct 246 ms 29232 KB Output is correct
36 Correct 299 ms 29176 KB Output is correct
37 Correct 170 ms 25464 KB Output is correct
38 Correct 294 ms 28276 KB Output is correct
39 Correct 59 ms 22648 KB Output is correct
40 Correct 289 ms 28176 KB Output is correct
41 Correct 220 ms 26588 KB Output is correct
42 Correct 296 ms 28164 KB Output is correct
43 Correct 107 ms 23928 KB Output is correct
44 Correct 298 ms 28152 KB Output is correct
45 Correct 66 ms 22776 KB Output is correct
46 Correct 320 ms 28236 KB Output is correct
47 Correct 95 ms 23288 KB Output is correct
48 Correct 291 ms 28152 KB Output is correct
49 Execution timed out 3048 ms 29392 KB Time limit exceeded
50 Halted 0 ms 0 KB -