oj.uz

답안 #219714

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
219714 2020-04-06T04:48:17 Z manh9203 Two Antennas (JOI19_antennas) C++17
100 / 100
 945 ms 48108 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
const int N = 2e5 + 5;
const int INF = 1e9 + 5;

int n, q;
int H[N], A[N], B[N];
int L[N], R[N];
int ans[N];
vector<int> queRy[N];
vector<int> add[N], sub[N];

struct node {
	int D, C, lz;
} st[4 * N];

void build(int id, int l, int r) {
	st[id].lz = INF;
	if (l == r) {
		st[id].D = st[id].C = -INF;
		return;
	}
	int mid = (l + r) >> 1;
	build(id << 1, l, mid);
	build(id << 1 | 1, mid + 1, r);
	st[id].D = max(st[id << 1].D, st[id << 1 | 1].D);
	st[id].C = max(st[id << 1].C, st[id << 1 | 1].C);
}

void pushDown(int id, int l, int r) {
	if (st[id].lz != INF) {
		st[id].D = max(st[id].D, st[id].C - st[id].lz);
		if (l < r) {
			st[id << 1].lz = min(st[id << 1].lz, st[id].lz);
			st[id << 1 | 1].lz = min(st[id << 1 | 1].lz, st[id].lz);
		}
		st[id].lz = INF;
	}
}

void update(int id, int l, int r, int i, int j, int x) {
	pushDown(id, l, r);
	if (l > j || r < i || i > j) {
		return;
	}
	if (l >= i && r <= j) {
		st[id].lz = x;
		pushDown(id, l, r);
		return;
	}
	int mid = (l + r) >> 1;
	update(id << 1, l, mid, i, j, x);
	update(id << 1 | 1, mid + 1, r, i, j, x);
	st[id].D = max(st[id << 1].D, st[id << 1 | 1].D);
	st[id].C = max(st[id << 1].C, st[id << 1 | 1].C);
}

void updPos(int id, int l, int r, int i, int x) {
	pushDown(id, l, r);
	if (l > i || r < i) {
		return;
	}
	if (l == r) {
		st[id].C = x;
		return;
	}
	int mid = (l + r) >> 1;
	updPos(id << 1, l, mid, i, x);
	updPos(id << 1 | 1, mid + 1, r, i, x);
	st[id].D = max(st[id << 1].D, st[id << 1 | 1].D);
	st[id].C = max(st[id << 1].C, st[id << 1 | 1].C);
}

int get(int id, int l, int r, int i, int j) {
	pushDown(id, l, r);
	if (l > j || r < i || i > j) {
		return -INF;
	}
	if (l >= i && r <= j) {
		return st[id].D;
	}
	int mid = (l + r) >> 1;
	return max(get(id << 1, l, mid, i, j), get(id << 1 | 1, mid + 1, r, i, j));
}


int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> H[i] >> A[i] >> B[i];
		add[min(n + 1, i + A[i])].push_back(i);
		sub[min(n + 1, i + B[i])].push_back(i);
	}
	cin >> q;
	for (int i = 1; i <= q; i++) {
		cin >> L[i] >> R[i];
		queRy[R[i]].push_back(i);
		ans[i] = -INF;
	}
	
	build(1, 1, n);
	for (int i = 1; i <= n; i++) {
		for (int j : add[i]) {
			updPos(1, 1, n, j, H[j]);
		}
		update(1, 1, n, max(0, i - B[i]), max(0, i - A[i]), H[i]);
		for (int j: queRy[i]) {
			ans[j] = max(ans[j], get(1, 1, n, L[j], i));
		}
		for (int j: sub[i]) {
			updPos(1, 1, n, j, -INF);
		}
	}
	
	for (int i = 1; i <= n; i++) {
		add[i].clear();
		sub[i].clear();
		queRy[i].clear();
	}
	for (int i = 1; i <= n; i++) {
		add[max(0, i - A[i])].push_back(i);
		sub[max(0, i - B[i])].push_back(i);
	}
	for (int i = 1; i <= q; i++) {
		queRy[L[i]].push_back(i);
	}
	
	build(1, 1, n);
	for (int i = n; i >= 1; i--) {
		for (int j : add[i]) {
			updPos(1, 1, n, j, H[j]);
		}
		update(1, 1, n, min(n + 1, i + A[i]), min(n + 1, i + B[i]), H[i]);
		for (int j: queRy[i]) {
			ans[j] = max(ans[j], get(1, 1, n, i, R[j]));
		}
		for (int j : sub[i]) {
			updPos(1, 1, n, j, -INF);
		}
	}
	
	for (int i = 1; i <= q; i++) {
		if (ans[i] == -INF) {
			cout << "-1\n";
		} else {
			cout << ans[i] << "\n";
		}
	}
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 15 ms 14488 KB Output is correct
4 Correct 15 ms 14524 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 14 ms 14592 KB Output is correct
7 Correct 13 ms 14464 KB Output is correct
8 Correct 15 ms 14592 KB Output is correct
9 Correct 13 ms 14464 KB Output is correct
10 Correct 14 ms 14464 KB Output is correct
11 Correct 21 ms 14464 KB Output is correct
12 Correct 17 ms 14464 KB Output is correct
13 Correct 13 ms 14464 KB Output is correct
14 Correct 14 ms 14464 KB Output is correct
15 Correct 13 ms 14464 KB Output is correct
16 Correct 13 ms 14592 KB Output is correct
17 Correct 14 ms 14464 KB Output is correct
18 Correct 14 ms 14592 KB Output is correct
19 Correct 13 ms 14516 KB Output is correct
20 Correct 13 ms 14592 KB Output is correct
21 Correct 18 ms 14464 KB Output is correct
22 Correct 15 ms 14464 KB Output is correct
23 Correct 14 ms 14464 KB Output is correct
24 Correct 14 ms 14464 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 15 ms 14488 KB Output is correct
4 Correct 15 ms 14524 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 14 ms 14592 KB Output is correct
7 Correct 13 ms 14464 KB Output is correct
8 Correct 15 ms 14592 KB Output is correct
9 Correct 13 ms 14464 KB Output is correct
10 Correct 14 ms 14464 KB Output is correct
11 Correct 21 ms 14464 KB Output is correct
12 Correct 17 ms 14464 KB Output is correct
13 Correct 13 ms 14464 KB Output is correct
14 Correct 14 ms 14464 KB Output is correct
15 Correct 13 ms 14464 KB Output is correct
16 Correct 13 ms 14592 KB Output is correct
17 Correct 14 ms 14464 KB Output is correct
18 Correct 14 ms 14592 KB Output is correct
19 Correct 13 ms 14516 KB Output is correct
20 Correct 13 ms 14592 KB Output is correct
21 Correct 18 ms 14464 KB Output is correct
22 Correct 15 ms 14464 KB Output is correct
23 Correct 14 ms 14464 KB Output is correct
24 Correct 14 ms 14464 KB Output is correct
25 Correct 129 ms 19960 KB Output is correct
26 Correct 30 ms 15352 KB Output is correct
27 Correct 200 ms 22140 KB Output is correct
28 Correct 185 ms 22136 KB Output is correct
29 Correct 127 ms 19960 KB Output is correct
30 Correct 128 ms 19704 KB Output is correct
31 Correct 136 ms 21368 KB Output is correct
32 Correct 195 ms 22264 KB Output is correct
33 Correct 170 ms 21756 KB Output is correct
34 Correct 103 ms 18296 KB Output is correct
35 Correct 193 ms 22392 KB Output is correct
36 Correct 185 ms 22136 KB Output is correct
37 Correct 109 ms 18424 KB Output is correct
38 Correct 180 ms 21200 KB Output is correct
39 Correct 38 ms 15608 KB Output is correct
40 Correct 182 ms 21112 KB Output is correct
41 Correct 134 ms 19576 KB Output is correct
42 Correct 181 ms 21112 KB Output is correct
43 Correct 69 ms 16888 KB Output is correct
44 Correct 170 ms 21112 KB Output is correct
45 Correct 43 ms 15864 KB Output is correct
46 Correct 175 ms 21112 KB Output is correct
47 Correct 57 ms 16296 KB Output is correct
48 Correct 183 ms 21112 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 429 ms 34284 KB Output is correct
2 Correct 491 ms 36076 KB Output is correct
3 Correct 307 ms 31212 KB Output is correct
4 Correct 478 ms 35904 KB Output is correct
5 Correct 195 ms 24432 KB Output is correct
6 Correct 483 ms 35948 KB Output is correct
7 Correct 396 ms 33772 KB Output is correct
8 Correct 482 ms 35820 KB Output is correct
9 Correct 65 ms 17656 KB Output is correct
10 Correct 489 ms 35980 KB Output is correct
11 Correct 272 ms 26992 KB Output is correct
12 Correct 487 ms 35948 KB Output is correct
13 Correct 345 ms 32496 KB Output is correct
14 Correct 332 ms 32404 KB Output is correct
15 Correct 320 ms 31948 KB Output is correct
16 Correct 288 ms 32108 KB Output is correct
17 Correct 353 ms 33016 KB Output is correct
18 Correct 341 ms 32360 KB Output is correct
19 Correct 333 ms 31912 KB Output is correct
20 Correct 327 ms 32064 KB Output is correct
21 Correct 349 ms 32444 KB Output is correct
22 Correct 338 ms 32240 KB Output is correct
23 Correct 334 ms 32196 KB Output is correct
24 Correct 284 ms 31764 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 15 ms 14488 KB Output is correct
4 Correct 15 ms 14524 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 14 ms 14592 KB Output is correct
7 Correct 13 ms 14464 KB Output is correct
8 Correct 15 ms 14592 KB Output is correct
9 Correct 13 ms 14464 KB Output is correct
10 Correct 14 ms 14464 KB Output is correct
11 Correct 21 ms 14464 KB Output is correct
12 Correct 17 ms 14464 KB Output is correct
13 Correct 13 ms 14464 KB Output is correct
14 Correct 14 ms 14464 KB Output is correct
15 Correct 13 ms 14464 KB Output is correct
16 Correct 13 ms 14592 KB Output is correct
17 Correct 14 ms 14464 KB Output is correct
18 Correct 14 ms 14592 KB Output is correct
19 Correct 13 ms 14516 KB Output is correct
20 Correct 13 ms 14592 KB Output is correct
21 Correct 18 ms 14464 KB Output is correct
22 Correct 15 ms 14464 KB Output is correct
23 Correct 14 ms 14464 KB Output is correct
24 Correct 14 ms 14464 KB Output is correct
25 Correct 129 ms 19960 KB Output is correct
26 Correct 30 ms 15352 KB Output is correct
27 Correct 200 ms 22140 KB Output is correct
28 Correct 185 ms 22136 KB Output is correct
29 Correct 127 ms 19960 KB Output is correct
30 Correct 128 ms 19704 KB Output is correct
31 Correct 136 ms 21368 KB Output is correct
32 Correct 195 ms 22264 KB Output is correct
33 Correct 170 ms 21756 KB Output is correct
34 Correct 103 ms 18296 KB Output is correct
35 Correct 193 ms 22392 KB Output is correct
36 Correct 185 ms 22136 KB Output is correct
37 Correct 109 ms 18424 KB Output is correct
38 Correct 180 ms 21200 KB Output is correct
39 Correct 38 ms 15608 KB Output is correct
40 Correct 182 ms 21112 KB Output is correct
41 Correct 134 ms 19576 KB Output is correct
42 Correct 181 ms 21112 KB Output is correct
43 Correct 69 ms 16888 KB Output is correct
44 Correct 170 ms 21112 KB Output is correct
45 Correct 43 ms 15864 KB Output is correct
46 Correct 175 ms 21112 KB Output is correct
47 Correct 57 ms 16296 KB Output is correct
48 Correct 183 ms 21112 KB Output is correct
49 Correct 429 ms 34284 KB Output is correct
50 Correct 491 ms 36076 KB Output is correct
51 Correct 307 ms 31212 KB Output is correct
52 Correct 478 ms 35904 KB Output is correct
53 Correct 195 ms 24432 KB Output is correct
54 Correct 483 ms 35948 KB Output is correct
55 Correct 396 ms 33772 KB Output is correct
56 Correct 482 ms 35820 KB Output is correct
57 Correct 65 ms 17656 KB Output is correct
58 Correct 489 ms 35980 KB Output is correct
59 Correct 272 ms 26992 KB Output is correct
60 Correct 487 ms 35948 KB Output is correct
61 Correct 345 ms 32496 KB Output is correct
62 Correct 332 ms 32404 KB Output is correct
63 Correct 320 ms 31948 KB Output is correct
64 Correct 288 ms 32108 KB Output is correct
65 Correct 353 ms 33016 KB Output is correct
66 Correct 341 ms 32360 KB Output is correct
67 Correct 333 ms 31912 KB Output is correct
68 Correct 327 ms 32064 KB Output is correct
69 Correct 349 ms 32444 KB Output is correct
70 Correct 338 ms 32240 KB Output is correct
71 Correct 334 ms 32196 KB Output is correct
72 Correct 284 ms 31764 KB Output is correct
73 Correct 756 ms 43856 KB Output is correct
74 Correct 528 ms 37228 KB Output is correct
75 Correct 708 ms 42220 KB Output is correct
76 Correct 925 ms 48108 KB Output is correct
77 Correct 461 ms 32240 KB Output is correct
78 Correct 759 ms 44872 KB Output is correct
79 Correct 819 ms 45676 KB Output is correct
80 Correct 922 ms 48100 KB Output is correct
81 Correct 331 ms 26196 KB Output is correct
82 Correct 689 ms 42860 KB Output is correct
83 Correct 634 ms 37616 KB Output is correct
84 Correct 945 ms 47960 KB Output is correct
85 Correct 579 ms 39796 KB Output is correct
86 Correct 694 ms 43544 KB Output is correct
87 Correct 389 ms 33992 KB Output is correct
88 Correct 688 ms 42988 KB Output is correct
89 Correct 641 ms 41520 KB Output is correct
90 Correct 720 ms 43320 KB Output is correct
91 Correct 462 ms 36684 KB Output is correct
92 Correct 714 ms 43200 KB Output is correct
93 Correct 378 ms 35124 KB Output is correct
94 Correct 728 ms 43300 KB Output is correct
95 Correct 442 ms 36040 KB Output is correct
96 Correct 664 ms 42644 KB Output is correct