oj.uz

Submission #124155

# Submission time Handle Problem Language Result Execution time Memory
124155 2019-07-02T15:11:03 Z imyujin Two Antennas (JOI19_antennas) C++14
100 / 100
 1075 ms 66028 KB 
#include<stdio.h>
#include<vector>
#include<algorithm>
 
using namespace std;
 
#define MAXN 200005
 
const int INF = 1 << 30;
int N, Q;
int H[MAXN], A[MAXN], B[MAXN], L[MAXN], R[MAXN];
int ans[MAXN];
int minc[4*MAXN], maxd[4*MAXN], lazy[4*MAXN];
vector<int> query[MAXN], on[2*MAXN], off[2*MAXN];
 
void spreadlazy(int idx) {
	if(lazy[idx] != -1) {
		lazy[idx * 2] = max(lazy[idx * 2], lazy[idx]);
		lazy[idx * 2 + 1] = max(lazy[idx * 2 + 1], lazy[idx]);
		maxd[idx * 2] = max(maxd[idx * 2], lazy[idx * 2] - minc[idx * 2]);
		maxd[idx * 2 + 1] = max(maxd[idx * 2 + 1], lazy[idx * 2 + 1] - minc[idx * 2 + 1]);
		lazy[idx] = -1;
	}
}
 
void updc(int idx, int l, int r, int x, int c) {
	//if(idx == 1) printf("updc(x = %d, c = %d)\n", x, c);
	if(l == r) {
		minc[idx] = c;
		
		lazy[idx] = -1;return;	
}
	spreadlazy(idx);
	int m = (l + r) / 2;
	if(x <= m) updc(idx * 2, l, m, x, c);
	else updc(idx * 2 + 1, m + 1, r, x, c);
	minc[idx] = min(minc[idx * 2], minc[idx * 2 + 1]);
	maxd[idx] = max(maxd[idx * 2], maxd[idx * 2 + 1]);
}
 
void updlazy(int idx, int l, int r, int x, int y, int z) {
	//if(idx == 1) printf("updlazy(x = %d, y = %d, z = %d)\n", x, y, z);
	if(x <= l && r <= y) {
		lazy[idx] = max(lazy[idx], z);
		maxd[idx] = max(maxd[idx], lazy[idx] - minc[idx]);
		return;
	}
	if(r < x || y < l) return;
	spreadlazy(idx);
	int m = (l + r) / 2;
	updlazy(idx * 2, l, m, x, y, z);
	updlazy(idx * 2 + 1, m + 1, r, x, y, z);
	maxd[idx] = max(maxd[idx * 2], maxd[idx * 2 + 1]);
}
 
int gmaxd(int idx, int l, int r, int x, int y) {
	if(x <= l && r <= y) return maxd[idx];
	if(r < x || y < l) return -1;
	int m = (l + r) / 2;
	spreadlazy(idx);
	return max(gmaxd(idx * 2, l, m, x, y), gmaxd(idx * 2 + 1, m + 1, r, x, y));
}
 
void print(int x){
	printf("#%d\n", x);
	for(int i = 1; i < 10; i++) 
		printf("i = %d, maxd = %d, minc = %d, lazy = %d\n", i, maxd[i], minc[i], lazy[i]);
	for(int i = 0; i < Q; i++) printf("ans[%d] = %d\n", i, ans[i]);
	printf("\n");
}
 
void solve() {
	for(int i = 0; i < 2 * N; i++) {
		query[i].clear();
		on[i].clear();
		off[i].clear();
	}
	
	for(int i = 0; i < Q; i++) query[R[i]].push_back(i);
	for(int i = 0; i < N; i++) {
		on[i + A[i]].push_back(i);
		off[i + B[i]].push_back(i);
	}
	for(int i = 1; i < 4 * N; i++) {
		minc[i] = INF;
		maxd[i] = lazy[i] = -1;
	}
 
	for(int i = 0; i < N; i++) {
		for(auto a : on[i]) updc(1, 0, N-1, a, H[a]);
		//print(1);
		updlazy(1, 0, N-1, i - B[i], i - A[i], H[i]);
		//print(2);
		for(auto a : query[i]) ans[a] = max(ans[a], gmaxd(1, 0, N-1, L[a], i));
		//print(3);
		for(auto a : off[i]) updc(1, 0, N-1, a, INF);
		//print(4);
	}
}
 
int main() {
	scanf("%d", &N);
	for(int i = 0; i < N; i++) scanf("%d%d%d", H+i, A+i, B+i);
	scanf("%d", &Q);
	for(int i = 0; i < Q; i++) scanf("%d%d", L+i, R+i);
 
	for(int i = 0; i < Q; i++) {
		ans[i] = -1;
		L[i]--;
		R[i]--;
	}
	solve();
	for(int i = 0; i < N/2; i++){
		swap(H[i], H[N - i - 1]);
		swap(A[i], A[N - i - 1]);
		swap(B[i], B[N - i - 1]);
	}
	for(int i = 0; i < Q; i++) {
		swap(L[i], R[i]);
		L[i] = N - L[i] - 1;
		R[i] = N - R[i] - 1;
	}
	solve();
 
	for(int i = 0; i < Q; i++) printf("%d\n", ans[i]);
	return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:102:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
antennas.cpp:103:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 0; i < N; i++) scanf("%d%d%d", H+i, A+i, B+i);
                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:104:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &Q);
  ~~~~~^~~~~~~~~~
antennas.cpp:105:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 0; i < Q; i++) scanf("%d%d", L+i, R+i);
                             ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23928 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 23 ms 23928 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 23 ms 23928 KB Output is correct
7 Correct 23 ms 23928 KB Output is correct
8 Correct 24 ms 23932 KB Output is correct
9 Correct 22 ms 23928 KB Output is correct
10 Correct 26 ms 23944 KB Output is correct
11 Correct 23 ms 23928 KB Output is correct
12 Correct 28 ms 23928 KB Output is correct
13 Correct 28 ms 23800 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 23 ms 23928 KB Output is correct
16 Correct 23 ms 23848 KB Output is correct
17 Correct 23 ms 23928 KB Output is correct
18 Correct 23 ms 23928 KB Output is correct
19 Correct 23 ms 23928 KB Output is correct
20 Correct 23 ms 23928 KB Output is correct
21 Correct 23 ms 23928 KB Output is correct
22 Correct 23 ms 23928 KB Output is correct
23 Correct 23 ms 23928 KB Output is correct
24 Correct 23 ms 23928 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23928 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 23 ms 23928 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 23 ms 23928 KB Output is correct
7 Correct 23 ms 23928 KB Output is correct
8 Correct 24 ms 23932 KB Output is correct
9 Correct 22 ms 23928 KB Output is correct
10 Correct 26 ms 23944 KB Output is correct
11 Correct 23 ms 23928 KB Output is correct
12 Correct 28 ms 23928 KB Output is correct
13 Correct 28 ms 23800 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 23 ms 23928 KB Output is correct
16 Correct 23 ms 23848 KB Output is correct
17 Correct 23 ms 23928 KB Output is correct
18 Correct 23 ms 23928 KB Output is correct
19 Correct 23 ms 23928 KB Output is correct
20 Correct 23 ms 23928 KB Output is correct
21 Correct 23 ms 23928 KB Output is correct
22 Correct 23 ms 23928 KB Output is correct
23 Correct 23 ms 23928 KB Output is correct
24 Correct 23 ms 23928 KB Output is correct
25 Correct 142 ms 29308 KB Output is correct
26 Correct 39 ms 24768 KB Output is correct
27 Correct 200 ms 31564 KB Output is correct
28 Correct 213 ms 31608 KB Output is correct
29 Correct 144 ms 29560 KB Output is correct
30 Correct 142 ms 29232 KB Output is correct
31 Correct 157 ms 30744 KB Output is correct
32 Correct 216 ms 31480 KB Output is correct
33 Correct 188 ms 31228 KB Output is correct
34 Correct 110 ms 27640 KB Output is correct
35 Correct 203 ms 31632 KB Output is correct
36 Correct 209 ms 31516 KB Output is correct
37 Correct 123 ms 27896 KB Output is correct
38 Correct 204 ms 30712 KB Output is correct
39 Correct 49 ms 25080 KB Output is correct
40 Correct 204 ms 30556 KB Output is correct
41 Correct 149 ms 29048 KB Output is correct
42 Correct 199 ms 30472 KB Output is correct
43 Correct 86 ms 26264 KB Output is correct
44 Correct 202 ms 30596 KB Output is correct
45 Correct 54 ms 25208 KB Output is correct
46 Correct 197 ms 30556 KB Output is correct
47 Correct 68 ms 25848 KB Output is correct
48 Correct 195 ms 30812 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 492 ms 47380 KB Output is correct
2 Correct 581 ms 49664 KB Output is correct
3 Correct 382 ms 41980 KB Output is correct
4 Correct 556 ms 49656 KB Output is correct
5 Correct 234 ms 35832 KB Output is correct
6 Correct 571 ms 49784 KB Output is correct
7 Correct 473 ms 46456 KB Output is correct
8 Correct 580 ms 53952 KB Output is correct
9 Correct 82 ms 28536 KB Output is correct
10 Correct 576 ms 53852 KB Output is correct
11 Correct 323 ms 42612 KB Output is correct
12 Correct 558 ms 54016 KB Output is correct
13 Correct 310 ms 49160 KB Output is correct
14 Correct 303 ms 48388 KB Output is correct
15 Correct 296 ms 48372 KB Output is correct
16 Correct 288 ms 49220 KB Output is correct
17 Correct 317 ms 49448 KB Output is correct
18 Correct 303 ms 48420 KB Output is correct
19 Correct 306 ms 48644 KB Output is correct
20 Correct 306 ms 48856 KB Output is correct
21 Correct 300 ms 49796 KB Output is correct
22 Correct 315 ms 48804 KB Output is correct
23 Correct 303 ms 48768 KB Output is correct
24 Correct 283 ms 48320 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23928 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 23 ms 23928 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 23 ms 23928 KB Output is correct
7 Correct 23 ms 23928 KB Output is correct
8 Correct 24 ms 23932 KB Output is correct
9 Correct 22 ms 23928 KB Output is correct
10 Correct 26 ms 23944 KB Output is correct
11 Correct 23 ms 23928 KB Output is correct
12 Correct 28 ms 23928 KB Output is correct
13 Correct 28 ms 23800 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 23 ms 23928 KB Output is correct
16 Correct 23 ms 23848 KB Output is correct
17 Correct 23 ms 23928 KB Output is correct
18 Correct 23 ms 23928 KB Output is correct
19 Correct 23 ms 23928 KB Output is correct
20 Correct 23 ms 23928 KB Output is correct
21 Correct 23 ms 23928 KB Output is correct
22 Correct 23 ms 23928 KB Output is correct
23 Correct 23 ms 23928 KB Output is correct
24 Correct 23 ms 23928 KB Output is correct
25 Correct 142 ms 29308 KB Output is correct
26 Correct 39 ms 24768 KB Output is correct
27 Correct 200 ms 31564 KB Output is correct
28 Correct 213 ms 31608 KB Output is correct
29 Correct 144 ms 29560 KB Output is correct
30 Correct 142 ms 29232 KB Output is correct
31 Correct 157 ms 30744 KB Output is correct
32 Correct 216 ms 31480 KB Output is correct
33 Correct 188 ms 31228 KB Output is correct
34 Correct 110 ms 27640 KB Output is correct
35 Correct 203 ms 31632 KB Output is correct
36 Correct 209 ms 31516 KB Output is correct
37 Correct 123 ms 27896 KB Output is correct
38 Correct 204 ms 30712 KB Output is correct
39 Correct 49 ms 25080 KB Output is correct
40 Correct 204 ms 30556 KB Output is correct
41 Correct 149 ms 29048 KB Output is correct
42 Correct 199 ms 30472 KB Output is correct
43 Correct 86 ms 26264 KB Output is correct
44 Correct 202 ms 30596 KB Output is correct
45 Correct 54 ms 25208 KB Output is correct
46 Correct 197 ms 30556 KB Output is correct
47 Correct 68 ms 25848 KB Output is correct
48 Correct 195 ms 30812 KB Output is correct
49 Correct 492 ms 47380 KB Output is correct
50 Correct 581 ms 49664 KB Output is correct
51 Correct 382 ms 41980 KB Output is correct
52 Correct 556 ms 49656 KB Output is correct
53 Correct 234 ms 35832 KB Output is correct
54 Correct 571 ms 49784 KB Output is correct
55 Correct 473 ms 46456 KB Output is correct
56 Correct 580 ms 53952 KB Output is correct
57 Correct 82 ms 28536 KB Output is correct
58 Correct 576 ms 53852 KB Output is correct
59 Correct 323 ms 42612 KB Output is correct
60 Correct 558 ms 54016 KB Output is correct
61 Correct 310 ms 49160 KB Output is correct
62 Correct 303 ms 48388 KB Output is correct
63 Correct 296 ms 48372 KB Output is correct
64 Correct 288 ms 49220 KB Output is correct
65 Correct 317 ms 49448 KB Output is correct
66 Correct 303 ms 48420 KB Output is correct
67 Correct 306 ms 48644 KB Output is correct
68 Correct 306 ms 48856 KB Output is correct
69 Correct 300 ms 49796 KB Output is correct
70 Correct 315 ms 48804 KB Output is correct
71 Correct 303 ms 48768 KB Output is correct
72 Correct 283 ms 48320 KB Output is correct
73 Correct 824 ms 60616 KB Output is correct
74 Correct 606 ms 55236 KB Output is correct
75 Correct 777 ms 55828 KB Output is correct
76 Correct 1008 ms 65960 KB Output is correct
77 Correct 496 ms 45328 KB Output is correct
78 Correct 875 ms 62784 KB Output is correct
79 Correct 916 ms 61928 KB Output is correct
80 Correct 1029 ms 65908 KB Output is correct
81 Correct 358 ms 36956 KB Output is correct
82 Correct 786 ms 60860 KB Output is correct
83 Correct 697 ms 53256 KB Output is correct
84 Correct 1075 ms 66028 KB Output is correct
85 Correct 550 ms 56436 KB Output is correct
86 Correct 704 ms 59524 KB Output is correct
87 Correct 373 ms 50640 KB Output is correct
88 Correct 684 ms 60244 KB Output is correct
89 Correct 617 ms 58256 KB Output is correct
90 Correct 700 ms 59384 KB Output is correct
91 Correct 445 ms 53388 KB Output is correct
92 Correct 690 ms 59952 KB Output is correct
93 Correct 381 ms 52468 KB Output is correct
94 Correct 701 ms 59824 KB Output is correct
95 Correct 414 ms 52596 KB Output is correct
96 Correct 657 ms 59388 KB Output is correct