oj.uz

답안 #124280

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
124280 2019-07-02T23:41:44 Z imyujin Two Antennas (JOI19_antennas) C++14
100 / 100
 966 ms 66064 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

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 23 ms 23928 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 24 ms 23928 KB Output is correct
5 Correct 29 ms 23928 KB Output is correct
6 Correct 28 ms 23928 KB Output is correct
7 Correct 28 ms 23900 KB Output is correct
8 Correct 28 ms 23928 KB Output is correct
9 Correct 25 ms 23820 KB Output is correct
10 Correct 28 ms 23928 KB Output is correct
11 Correct 28 ms 23928 KB Output is correct
12 Correct 27 ms 23928 KB Output is correct
13 Correct 23 ms 23928 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 28 ms 23800 KB Output is correct
16 Correct 31 ms 23932 KB Output is correct
17 Correct 28 ms 23928 KB Output is correct
18 Correct 29 ms 23840 KB Output is correct
19 Correct 28 ms 23956 KB Output is correct
20 Correct 24 ms 23928 KB Output is correct
21 Correct 29 ms 23928 KB Output is correct
22 Correct 24 ms 23928 KB Output is correct
23 Correct 25 ms 23900 KB Output is correct
24 Correct 23 ms 23928 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 23 ms 23928 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 24 ms 23928 KB Output is correct
5 Correct 29 ms 23928 KB Output is correct
6 Correct 28 ms 23928 KB Output is correct
7 Correct 28 ms 23900 KB Output is correct
8 Correct 28 ms 23928 KB Output is correct
9 Correct 25 ms 23820 KB Output is correct
10 Correct 28 ms 23928 KB Output is correct
11 Correct 28 ms 23928 KB Output is correct
12 Correct 27 ms 23928 KB Output is correct
13 Correct 23 ms 23928 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 28 ms 23800 KB Output is correct
16 Correct 31 ms 23932 KB Output is correct
17 Correct 28 ms 23928 KB Output is correct
18 Correct 29 ms 23840 KB Output is correct
19 Correct 28 ms 23956 KB Output is correct
20 Correct 24 ms 23928 KB Output is correct
21 Correct 29 ms 23928 KB Output is correct
22 Correct 24 ms 23928 KB Output is correct
23 Correct 25 ms 23900 KB Output is correct
24 Correct 23 ms 23928 KB Output is correct
25 Correct 142 ms 29280 KB Output is correct
26 Correct 42 ms 24780 KB Output is correct
27 Correct 205 ms 31520 KB Output is correct
28 Correct 201 ms 31632 KB Output is correct
29 Correct 139 ms 29432 KB Output is correct
30 Correct 143 ms 29128 KB Output is correct
31 Correct 154 ms 30712 KB Output is correct
32 Correct 198 ms 31520 KB Output is correct
33 Correct 179 ms 31224 KB Output is correct
34 Correct 109 ms 27768 KB Output is correct
35 Correct 191 ms 31736 KB Output is correct
36 Correct 200 ms 31480 KB Output is correct
37 Correct 121 ms 27896 KB Output is correct
38 Correct 193 ms 30672 KB Output is correct
39 Correct 49 ms 24952 KB Output is correct
40 Correct 191 ms 30584 KB Output is correct
41 Correct 148 ms 28920 KB Output is correct
42 Correct 200 ms 30500 KB Output is correct
43 Correct 81 ms 26360 KB Output is correct
44 Correct 193 ms 30584 KB Output is correct
45 Correct 54 ms 25208 KB Output is correct
46 Correct 193 ms 30584 KB Output is correct
47 Correct 68 ms 25720 KB Output is correct
48 Correct 190 ms 30584 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 491 ms 51064 KB Output is correct
2 Correct 541 ms 53944 KB Output is correct
3 Correct 362 ms 44952 KB Output is correct
4 Correct 611 ms 53900 KB Output is correct
5 Correct 223 ms 37624 KB Output is correct
6 Correct 518 ms 53852 KB Output is correct
7 Correct 462 ms 50424 KB Output is correct
8 Correct 507 ms 53880 KB Output is correct
9 Correct 79 ms 28536 KB Output is correct
10 Correct 516 ms 53880 KB Output is correct
11 Correct 306 ms 42588 KB Output is correct
12 Correct 592 ms 53852 KB Output is correct
13 Correct 309 ms 49200 KB Output is correct
14 Correct 304 ms 48500 KB Output is correct
15 Correct 296 ms 48328 KB Output is correct
16 Correct 287 ms 49136 KB Output is correct
17 Correct 316 ms 49568 KB Output is correct
18 Correct 303 ms 48352 KB Output is correct
19 Correct 302 ms 48592 KB Output is correct
20 Correct 305 ms 48816 KB Output is correct
21 Correct 311 ms 49784 KB Output is correct
22 Correct 305 ms 48908 KB Output is correct
23 Correct 307 ms 48756 KB Output is correct
24 Correct 298 ms 48372 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 23 ms 23928 KB Output is correct
3 Correct 23 ms 23928 KB Output is correct
4 Correct 24 ms 23928 KB Output is correct
5 Correct 29 ms 23928 KB Output is correct
6 Correct 28 ms 23928 KB Output is correct
7 Correct 28 ms 23900 KB Output is correct
8 Correct 28 ms 23928 KB Output is correct
9 Correct 25 ms 23820 KB Output is correct
10 Correct 28 ms 23928 KB Output is correct
11 Correct 28 ms 23928 KB Output is correct
12 Correct 27 ms 23928 KB Output is correct
13 Correct 23 ms 23928 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 28 ms 23800 KB Output is correct
16 Correct 31 ms 23932 KB Output is correct
17 Correct 28 ms 23928 KB Output is correct
18 Correct 29 ms 23840 KB Output is correct
19 Correct 28 ms 23956 KB Output is correct
20 Correct 24 ms 23928 KB Output is correct
21 Correct 29 ms 23928 KB Output is correct
22 Correct 24 ms 23928 KB Output is correct
23 Correct 25 ms 23900 KB Output is correct
24 Correct 23 ms 23928 KB Output is correct
25 Correct 142 ms 29280 KB Output is correct
26 Correct 42 ms 24780 KB Output is correct
27 Correct 205 ms 31520 KB Output is correct
28 Correct 201 ms 31632 KB Output is correct
29 Correct 139 ms 29432 KB Output is correct
30 Correct 143 ms 29128 KB Output is correct
31 Correct 154 ms 30712 KB Output is correct
32 Correct 198 ms 31520 KB Output is correct
33 Correct 179 ms 31224 KB Output is correct
34 Correct 109 ms 27768 KB Output is correct
35 Correct 191 ms 31736 KB Output is correct
36 Correct 200 ms 31480 KB Output is correct
37 Correct 121 ms 27896 KB Output is correct
38 Correct 193 ms 30672 KB Output is correct
39 Correct 49 ms 24952 KB Output is correct
40 Correct 191 ms 30584 KB Output is correct
41 Correct 148 ms 28920 KB Output is correct
42 Correct 200 ms 30500 KB Output is correct
43 Correct 81 ms 26360 KB Output is correct
44 Correct 193 ms 30584 KB Output is correct
45 Correct 54 ms 25208 KB Output is correct
46 Correct 193 ms 30584 KB Output is correct
47 Correct 68 ms 25720 KB Output is correct
48 Correct 190 ms 30584 KB Output is correct
49 Correct 491 ms 51064 KB Output is correct
50 Correct 541 ms 53944 KB Output is correct
51 Correct 362 ms 44952 KB Output is correct
52 Correct 611 ms 53900 KB Output is correct
53 Correct 223 ms 37624 KB Output is correct
54 Correct 518 ms 53852 KB Output is correct
55 Correct 462 ms 50424 KB Output is correct
56 Correct 507 ms 53880 KB Output is correct
57 Correct 79 ms 28536 KB Output is correct
58 Correct 516 ms 53880 KB Output is correct
59 Correct 306 ms 42588 KB Output is correct
60 Correct 592 ms 53852 KB Output is correct
61 Correct 309 ms 49200 KB Output is correct
62 Correct 304 ms 48500 KB Output is correct
63 Correct 296 ms 48328 KB Output is correct
64 Correct 287 ms 49136 KB Output is correct
65 Correct 316 ms 49568 KB Output is correct
66 Correct 303 ms 48352 KB Output is correct
67 Correct 302 ms 48592 KB Output is correct
68 Correct 305 ms 48816 KB Output is correct
69 Correct 311 ms 49784 KB Output is correct
70 Correct 305 ms 48908 KB Output is correct
71 Correct 307 ms 48756 KB Output is correct
72 Correct 298 ms 48372 KB Output is correct
73 Correct 772 ms 60628 KB Output is correct
74 Correct 554 ms 55292 KB Output is correct
75 Correct 728 ms 55928 KB Output is correct
76 Correct 966 ms 66040 KB Output is correct
77 Correct 464 ms 45304 KB Output is correct
78 Correct 797 ms 62736 KB Output is correct
79 Correct 837 ms 61988 KB Output is correct
80 Correct 961 ms 66064 KB Output is correct
81 Correct 334 ms 36956 KB Output is correct
82 Correct 756 ms 60920 KB Output is correct
83 Correct 663 ms 53368 KB Output is correct
84 Correct 957 ms 66040 KB Output is correct
85 Correct 531 ms 56564 KB Output is correct
86 Correct 676 ms 59460 KB Output is correct
87 Correct 372 ms 50676 KB Output is correct
88 Correct 767 ms 60188 KB Output is correct
89 Correct 613 ms 58228 KB Output is correct
90 Correct 673 ms 59488 KB Output is correct
91 Correct 431 ms 53384 KB Output is correct
92 Correct 684 ms 59844 KB Output is correct
93 Correct 368 ms 52568 KB Output is correct
94 Correct 656 ms 59756 KB Output is correct
95 Correct 401 ms 52568 KB Output is correct
96 Correct 635 ms 59516 KB Output is correct