oj.uz

답안 #124281

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
124281 2019-07-02T23:43:43 Z imyujin Two Antennas (JOI19_antennas) C++14
100 / 100
 970 ms 59128 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) {
	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(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(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 solve() {
	for(int i = 0; i < 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]);
		updlazy(1, 0, N-1, i - B[i], i - A[i], H[i]);
		for(auto a : query[i]) ans[a] = max(ans[a], gmaxd(1, 0, N-1, L[a], i));
		for(auto a : off[i]) updc(1, 0, N-1, a, INF);
	}
}

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:86:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
antennas.cpp:87: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:88:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &Q);
  ~~~~~^~~~~~~~~~
antennas.cpp:89: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 22 ms 23800 KB Output is correct
2 Correct 23 ms 23928 KB Output is correct
3 Correct 23 ms 23800 KB Output is correct
4 Correct 23 ms 23836 KB Output is correct
5 Correct 28 ms 23928 KB Output is correct
6 Correct 23 ms 23924 KB Output is correct
7 Correct 28 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 23 ms 23928 KB Output is correct
10 Correct 23 ms 23928 KB Output is correct
11 Correct 23 ms 23928 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 23 ms 23928 KB Output is correct
14 Correct 23 ms 23800 KB Output is correct
15 Correct 23 ms 23800 KB Output is correct
16 Correct 23 ms 23928 KB Output is correct
17 Correct 28 ms 23928 KB Output is correct
18 Correct 28 ms 23924 KB Output is correct
19 Correct 28 ms 23800 KB Output is correct
20 Correct 28 ms 23800 KB Output is correct
21 Correct 22 ms 23928 KB Output is correct
22 Correct 22 ms 23928 KB Output is correct
23 Correct 22 ms 23800 KB Output is correct
24 Correct 23 ms 23928 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 23800 KB Output is correct
2 Correct 23 ms 23928 KB Output is correct
3 Correct 23 ms 23800 KB Output is correct
4 Correct 23 ms 23836 KB Output is correct
5 Correct 28 ms 23928 KB Output is correct
6 Correct 23 ms 23924 KB Output is correct
7 Correct 28 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 23 ms 23928 KB Output is correct
10 Correct 23 ms 23928 KB Output is correct
11 Correct 23 ms 23928 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 23 ms 23928 KB Output is correct
14 Correct 23 ms 23800 KB Output is correct
15 Correct 23 ms 23800 KB Output is correct
16 Correct 23 ms 23928 KB Output is correct
17 Correct 28 ms 23928 KB Output is correct
18 Correct 28 ms 23924 KB Output is correct
19 Correct 28 ms 23800 KB Output is correct
20 Correct 28 ms 23800 KB Output is correct
21 Correct 22 ms 23928 KB Output is correct
22 Correct 22 ms 23928 KB Output is correct
23 Correct 22 ms 23800 KB Output is correct
24 Correct 23 ms 23928 KB Output is correct
25 Correct 168 ms 28144 KB Output is correct
26 Correct 48 ms 24568 KB Output is correct
27 Correct 230 ms 29712 KB Output is correct
28 Correct 252 ms 29760 KB Output is correct
29 Correct 153 ms 28356 KB Output is correct
30 Correct 151 ms 28008 KB Output is correct
31 Correct 167 ms 29156 KB Output is correct
32 Correct 215 ms 29656 KB Output is correct
33 Correct 195 ms 29560 KB Output is correct
34 Correct 116 ms 26740 KB Output is correct
35 Correct 205 ms 29916 KB Output is correct
36 Correct 213 ms 29664 KB Output is correct
37 Correct 132 ms 26880 KB Output is correct
38 Correct 213 ms 28776 KB Output is correct
39 Correct 52 ms 24668 KB Output is correct
40 Correct 206 ms 28648 KB Output is correct
41 Correct 158 ms 27644 KB Output is correct
42 Correct 210 ms 28664 KB Output is correct
43 Correct 85 ms 25720 KB Output is correct
44 Correct 209 ms 28664 KB Output is correct
45 Correct 57 ms 24956 KB Output is correct
46 Correct 214 ms 28892 KB Output is correct
47 Correct 72 ms 25336 KB Output is correct
48 Correct 212 ms 28636 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 473 ms 46912 KB Output is correct
2 Correct 534 ms 49400 KB Output is correct
3 Correct 365 ms 41848 KB Output is correct
4 Correct 518 ms 49400 KB Output is correct
5 Correct 224 ms 35836 KB Output is correct
6 Correct 519 ms 49400 KB Output is correct
7 Correct 455 ms 46328 KB Output is correct
8 Correct 539 ms 49400 KB Output is correct
9 Correct 78 ms 27896 KB Output is correct
10 Correct 533 ms 49544 KB Output is correct
11 Correct 312 ms 39928 KB Output is correct
12 Correct 603 ms 49656 KB Output is correct
13 Correct 338 ms 44748 KB Output is correct
14 Correct 328 ms 44152 KB Output is correct
15 Correct 343 ms 44104 KB Output is correct
16 Correct 321 ms 44912 KB Output is correct
17 Correct 344 ms 45088 KB Output is correct
18 Correct 329 ms 44024 KB Output is correct
19 Correct 334 ms 44244 KB Output is correct
20 Correct 333 ms 44476 KB Output is correct
21 Correct 330 ms 45404 KB Output is correct
22 Correct 330 ms 44528 KB Output is correct
23 Correct 335 ms 44496 KB Output is correct
24 Correct 303 ms 44020 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 23800 KB Output is correct
2 Correct 23 ms 23928 KB Output is correct
3 Correct 23 ms 23800 KB Output is correct
4 Correct 23 ms 23836 KB Output is correct
5 Correct 28 ms 23928 KB Output is correct
6 Correct 23 ms 23924 KB Output is correct
7 Correct 28 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 23 ms 23928 KB Output is correct
10 Correct 23 ms 23928 KB Output is correct
11 Correct 23 ms 23928 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 23 ms 23928 KB Output is correct
14 Correct 23 ms 23800 KB Output is correct
15 Correct 23 ms 23800 KB Output is correct
16 Correct 23 ms 23928 KB Output is correct
17 Correct 28 ms 23928 KB Output is correct
18 Correct 28 ms 23924 KB Output is correct
19 Correct 28 ms 23800 KB Output is correct
20 Correct 28 ms 23800 KB Output is correct
21 Correct 22 ms 23928 KB Output is correct
22 Correct 22 ms 23928 KB Output is correct
23 Correct 22 ms 23800 KB Output is correct
24 Correct 23 ms 23928 KB Output is correct
25 Correct 168 ms 28144 KB Output is correct
26 Correct 48 ms 24568 KB Output is correct
27 Correct 230 ms 29712 KB Output is correct
28 Correct 252 ms 29760 KB Output is correct
29 Correct 153 ms 28356 KB Output is correct
30 Correct 151 ms 28008 KB Output is correct
31 Correct 167 ms 29156 KB Output is correct
32 Correct 215 ms 29656 KB Output is correct
33 Correct 195 ms 29560 KB Output is correct
34 Correct 116 ms 26740 KB Output is correct
35 Correct 205 ms 29916 KB Output is correct
36 Correct 213 ms 29664 KB Output is correct
37 Correct 132 ms 26880 KB Output is correct
38 Correct 213 ms 28776 KB Output is correct
39 Correct 52 ms 24668 KB Output is correct
40 Correct 206 ms 28648 KB Output is correct
41 Correct 158 ms 27644 KB Output is correct
42 Correct 210 ms 28664 KB Output is correct
43 Correct 85 ms 25720 KB Output is correct
44 Correct 209 ms 28664 KB Output is correct
45 Correct 57 ms 24956 KB Output is correct
46 Correct 214 ms 28892 KB Output is correct
47 Correct 72 ms 25336 KB Output is correct
48 Correct 212 ms 28636 KB Output is correct
49 Correct 473 ms 46912 KB Output is correct
50 Correct 534 ms 49400 KB Output is correct
51 Correct 365 ms 41848 KB Output is correct
52 Correct 518 ms 49400 KB Output is correct
53 Correct 224 ms 35836 KB Output is correct
54 Correct 519 ms 49400 KB Output is correct
55 Correct 455 ms 46328 KB Output is correct
56 Correct 539 ms 49400 KB Output is correct
57 Correct 78 ms 27896 KB Output is correct
58 Correct 533 ms 49544 KB Output is correct
59 Correct 312 ms 39928 KB Output is correct
60 Correct 603 ms 49656 KB Output is correct
61 Correct 338 ms 44748 KB Output is correct
62 Correct 328 ms 44152 KB Output is correct
63 Correct 343 ms 44104 KB Output is correct
64 Correct 321 ms 44912 KB Output is correct
65 Correct 344 ms 45088 KB Output is correct
66 Correct 329 ms 44024 KB Output is correct
67 Correct 334 ms 44244 KB Output is correct
68 Correct 333 ms 44476 KB Output is correct
69 Correct 330 ms 45404 KB Output is correct
70 Correct 330 ms 44528 KB Output is correct
71 Correct 335 ms 44496 KB Output is correct
72 Correct 303 ms 44020 KB Output is correct
73 Correct 873 ms 54484 KB Output is correct
74 Correct 562 ms 50680 KB Output is correct
75 Correct 723 ms 50296 KB Output is correct
76 Correct 950 ms 58964 KB Output is correct
77 Correct 476 ms 41720 KB Output is correct
78 Correct 835 ms 56696 KB Output is correct
79 Correct 829 ms 55160 KB Output is correct
80 Correct 970 ms 59000 KB Output is correct
81 Correct 356 ms 34168 KB Output is correct
82 Correct 747 ms 55160 KB Output is correct
83 Correct 669 ms 48032 KB Output is correct
84 Correct 950 ms 59128 KB Output is correct
85 Correct 579 ms 50672 KB Output is correct
86 Correct 741 ms 52512 KB Output is correct
87 Correct 385 ms 46068 KB Output is correct
88 Correct 731 ms 53220 KB Output is correct
89 Correct 656 ms 52084 KB Output is correct
90 Correct 783 ms 52600 KB Output is correct
91 Correct 471 ms 48080 KB Output is correct
92 Correct 719 ms 52908 KB Output is correct
93 Correct 396 ms 47708 KB Output is correct
94 Correct 742 ms 52976 KB Output is correct
95 Correct 444 ms 47732 KB Output is correct
96 Correct 741 ms 52348 KB Output is correct