oj.uz

답안 #872576

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
872576 2023-11-13T11:40:38 Z serifefedartar Two Antennas (JOI19_antennas) C++17
100 / 100
 671 ms 86252 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 1e9+9;
const ll LOGN = 20; 
const ll MAXN = 2e5 + 100;

struct Ant {
	ll H, A, B;
	Ant() { }
	void read() {
		cin >> H >> A >> B;		
	}
};

vector<Ant> antenna;
vector<pair<int,int>> query;
ll sg[4*MAXN], negative[4*MAXN], positive[4*MAXN], lazy[4*MAXN], ans[MAXN];
vector<int> add[2*MAXN], rem[2*MAXN];
vector<pair<int,int>> qs[2*MAXN];
int n, q;
void push(int k, int a, int b) {
	sg[k] = max(sg[k], negative[k] + lazy[k]);
	if (a != b) {
		lazy[2*k] = max(lazy[2*k], lazy[k]);
		lazy[2*k+1] = max(lazy[2*k+1], lazy[k]);
	}
	lazy[k] = 0;
}

void update_pos(int k, int a, int b, int q_l, int q_r, ll val) {
	push(k, a, b);
	if (b < q_l || a > q_r)
		return ;
	if (q_l <= a && b <= q_r) {
		lazy[k] = val;
		push(k, a, b);
		return ;
	}
	update_pos(2*k, a, (a+b)/2, q_l, q_r, val);
	update_pos(2*k+1, (a+b)/2+1, b, q_l, q_r, val);
	sg[k] = max(sg[k], max(sg[2*k], sg[2*k+1]));
}

void update(int k, int a, int b, int plc, ll val) {
	push(k, a, b);
	if (b < plc || a > plc)
		return ;
	if (a == b) {
		negative[k] = val;
		return ;
	}
	update(2*k, a, (a+b)/2, plc, val);
	update(2*k+1, (a+b)/2+1, b, plc, val);
	negative[k] = max(negative[2*k], negative[2*k+1]);
}

ll qry(int k, int a, int b, int q_l, int q_r) {
	push(k, a, b);
	if (b < q_l || a > q_r)
		return -1e12;
	if (q_l <= a && b <= q_r)
		return sg[k];
	return max(qry(2*k, a, (a+b)/2, q_l, q_r), 
				qry(2*k+1, (a+b)/2+1, b, q_l, q_r));
}

void solve() {
	for (int i = 0; i < 4*MAXN; i++)
		sg[i] = -1e12, negative[i] = -1e12, lazy[i] = 0;
	for (int i = 0; i < 2*MAXN; i++)
		add[i].clear(), rem[i].clear(), qs[i].clear();
	for (int i = 0; i < q; i++)
		qs[query[i].s].push_back({query[i].f, i});
	for (int i = 1; i <= n; i++)
		add[i+antenna[i].A].push_back(i), rem[i+antenna[i].B+1].push_back(i);

	for (int i = 1; i <= n; i++) {
		for (auto u : rem[i])
			update(1, 1, n, u, -1e12);
		for (auto u : add[i])
			update(1, 1, n, u, -antenna[u].H);
		if (i - antenna[i].A >= 1)
			update_pos(1, 1, n, max(1LL, i - antenna[i].B), max(1LL, i - antenna[i].A), antenna[i].H);

		for (auto u : qs[i])
			ans[u.s] = max(ans[u.s], qry(1, 1, n, u.f, i));
	}
}

int main() {
	fast
	cin >> n;

	antenna = vector<Ant>(n+1);
	for (int i = 1; i <= n; i++)
		antenna[i].read();

	int l, r;
	cin >> q;
	for (int i = 0; i < q; i++) {
		cin >> l >> r;
		query.push_back({l, r});
	}
	for (int i = 0; i < q; i++)
		ans[i] = -1;

	solve();
	for (int i = 1; i < n+1-i; i++)
		swap(antenna[i], antenna[n+1-i]);
	for (int i = 0; i < q; i++) {
		int new_s = n + 1 - query[i].f;
		int new_f = n + 1 - query[i].s;
		query[i].f = new_f; 
		query[i].s = new_s;
	}
	solve();

	for (int i = 0; i < q; i++)
		cout << ans[i] << "\n";
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 51032 KB Output is correct
2 Correct 13 ms 51036 KB Output is correct
3 Correct 14 ms 51036 KB Output is correct
4 Correct 14 ms 51124 KB Output is correct
5 Correct 14 ms 51036 KB Output is correct
6 Correct 14 ms 51132 KB Output is correct
7 Correct 15 ms 51160 KB Output is correct
8 Correct 14 ms 51188 KB Output is correct
9 Correct 14 ms 51180 KB Output is correct
10 Correct 14 ms 51220 KB Output is correct
11 Correct 14 ms 51036 KB Output is correct
12 Correct 14 ms 51036 KB Output is correct
13 Correct 14 ms 51036 KB Output is correct
14 Correct 13 ms 51036 KB Output is correct
15 Correct 14 ms 51036 KB Output is correct
16 Correct 14 ms 51036 KB Output is correct
17 Correct 14 ms 51036 KB Output is correct
18 Correct 14 ms 51036 KB Output is correct
19 Correct 14 ms 51036 KB Output is correct
20 Correct 14 ms 51036 KB Output is correct
21 Correct 13 ms 51036 KB Output is correct
22 Correct 14 ms 51036 KB Output is correct
23 Correct 14 ms 51160 KB Output is correct
24 Correct 13 ms 51036 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 51032 KB Output is correct
2 Correct 13 ms 51036 KB Output is correct
3 Correct 14 ms 51036 KB Output is correct
4 Correct 14 ms 51124 KB Output is correct
5 Correct 14 ms 51036 KB Output is correct
6 Correct 14 ms 51132 KB Output is correct
7 Correct 15 ms 51160 KB Output is correct
8 Correct 14 ms 51188 KB Output is correct
9 Correct 14 ms 51180 KB Output is correct
10 Correct 14 ms 51220 KB Output is correct
11 Correct 14 ms 51036 KB Output is correct
12 Correct 14 ms 51036 KB Output is correct
13 Correct 14 ms 51036 KB Output is correct
14 Correct 13 ms 51036 KB Output is correct
15 Correct 14 ms 51036 KB Output is correct
16 Correct 14 ms 51036 KB Output is correct
17 Correct 14 ms 51036 KB Output is correct
18 Correct 14 ms 51036 KB Output is correct
19 Correct 14 ms 51036 KB Output is correct
20 Correct 14 ms 51036 KB Output is correct
21 Correct 13 ms 51036 KB Output is correct
22 Correct 14 ms 51036 KB Output is correct
23 Correct 14 ms 51160 KB Output is correct
24 Correct 13 ms 51036 KB Output is correct
25 Correct 102 ms 57172 KB Output is correct
26 Correct 25 ms 51804 KB Output is correct
27 Correct 148 ms 59716 KB Output is correct
28 Correct 148 ms 59940 KB Output is correct
29 Correct 102 ms 57284 KB Output is correct
30 Correct 109 ms 57024 KB Output is correct
31 Correct 113 ms 58564 KB Output is correct
32 Correct 149 ms 59548 KB Output is correct
33 Correct 145 ms 59360 KB Output is correct
34 Correct 80 ms 55300 KB Output is correct
35 Correct 146 ms 59840 KB Output is correct
36 Correct 147 ms 59416 KB Output is correct
37 Correct 90 ms 55420 KB Output is correct
38 Correct 146 ms 58612 KB Output is correct
39 Correct 34 ms 52184 KB Output is correct
40 Correct 146 ms 58388 KB Output is correct
41 Correct 112 ms 56768 KB Output is correct
42 Correct 148 ms 58492 KB Output is correct
43 Correct 58 ms 53704 KB Output is correct
44 Correct 151 ms 59072 KB Output is correct
45 Correct 38 ms 52560 KB Output is correct
46 Correct 145 ms 58624 KB Output is correct
47 Correct 49 ms 53036 KB Output is correct
48 Correct 150 ms 58596 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 374 ms 67664 KB Output is correct
2 Correct 389 ms 69524 KB Output is correct
3 Correct 242 ms 63892 KB Output is correct
4 Correct 372 ms 69408 KB Output is correct
5 Correct 154 ms 59496 KB Output is correct
6 Correct 395 ms 69504 KB Output is correct
7 Correct 347 ms 67156 KB Output is correct
8 Correct 399 ms 69660 KB Output is correct
9 Correct 57 ms 54532 KB Output is correct
10 Correct 404 ms 74008 KB Output is correct
11 Correct 256 ms 65388 KB Output is correct
12 Correct 392 ms 74100 KB Output is correct
13 Correct 235 ms 69276 KB Output is correct
14 Correct 219 ms 68672 KB Output is correct
15 Correct 231 ms 68668 KB Output is correct
16 Correct 200 ms 69524 KB Output is correct
17 Correct 246 ms 69776 KB Output is correct
18 Correct 223 ms 68436 KB Output is correct
19 Correct 237 ms 68684 KB Output is correct
20 Correct 229 ms 69168 KB Output is correct
21 Correct 210 ms 69944 KB Output is correct
22 Correct 231 ms 69484 KB Output is correct
23 Correct 225 ms 68816 KB Output is correct
24 Correct 207 ms 68644 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 51032 KB Output is correct
2 Correct 13 ms 51036 KB Output is correct
3 Correct 14 ms 51036 KB Output is correct
4 Correct 14 ms 51124 KB Output is correct
5 Correct 14 ms 51036 KB Output is correct
6 Correct 14 ms 51132 KB Output is correct
7 Correct 15 ms 51160 KB Output is correct
8 Correct 14 ms 51188 KB Output is correct
9 Correct 14 ms 51180 KB Output is correct
10 Correct 14 ms 51220 KB Output is correct
11 Correct 14 ms 51036 KB Output is correct
12 Correct 14 ms 51036 KB Output is correct
13 Correct 14 ms 51036 KB Output is correct
14 Correct 13 ms 51036 KB Output is correct
15 Correct 14 ms 51036 KB Output is correct
16 Correct 14 ms 51036 KB Output is correct
17 Correct 14 ms 51036 KB Output is correct
18 Correct 14 ms 51036 KB Output is correct
19 Correct 14 ms 51036 KB Output is correct
20 Correct 14 ms 51036 KB Output is correct
21 Correct 13 ms 51036 KB Output is correct
22 Correct 14 ms 51036 KB Output is correct
23 Correct 14 ms 51160 KB Output is correct
24 Correct 13 ms 51036 KB Output is correct
25 Correct 102 ms 57172 KB Output is correct
26 Correct 25 ms 51804 KB Output is correct
27 Correct 148 ms 59716 KB Output is correct
28 Correct 148 ms 59940 KB Output is correct
29 Correct 102 ms 57284 KB Output is correct
30 Correct 109 ms 57024 KB Output is correct
31 Correct 113 ms 58564 KB Output is correct
32 Correct 149 ms 59548 KB Output is correct
33 Correct 145 ms 59360 KB Output is correct
34 Correct 80 ms 55300 KB Output is correct
35 Correct 146 ms 59840 KB Output is correct
36 Correct 147 ms 59416 KB Output is correct
37 Correct 90 ms 55420 KB Output is correct
38 Correct 146 ms 58612 KB Output is correct
39 Correct 34 ms 52184 KB Output is correct
40 Correct 146 ms 58388 KB Output is correct
41 Correct 112 ms 56768 KB Output is correct
42 Correct 148 ms 58492 KB Output is correct
43 Correct 58 ms 53704 KB Output is correct
44 Correct 151 ms 59072 KB Output is correct
45 Correct 38 ms 52560 KB Output is correct
46 Correct 145 ms 58624 KB Output is correct
47 Correct 49 ms 53036 KB Output is correct
48 Correct 150 ms 58596 KB Output is correct
49 Correct 374 ms 67664 KB Output is correct
50 Correct 389 ms 69524 KB Output is correct
51 Correct 242 ms 63892 KB Output is correct
52 Correct 372 ms 69408 KB Output is correct
53 Correct 154 ms 59496 KB Output is correct
54 Correct 395 ms 69504 KB Output is correct
55 Correct 347 ms 67156 KB Output is correct
56 Correct 399 ms 69660 KB Output is correct
57 Correct 57 ms 54532 KB Output is correct
58 Correct 404 ms 74008 KB Output is correct
59 Correct 256 ms 65388 KB Output is correct
60 Correct 392 ms 74100 KB Output is correct
61 Correct 235 ms 69276 KB Output is correct
62 Correct 219 ms 68672 KB Output is correct
63 Correct 231 ms 68668 KB Output is correct
64 Correct 200 ms 69524 KB Output is correct
65 Correct 246 ms 69776 KB Output is correct
66 Correct 223 ms 68436 KB Output is correct
67 Correct 237 ms 68684 KB Output is correct
68 Correct 229 ms 69168 KB Output is correct
69 Correct 210 ms 69944 KB Output is correct
70 Correct 231 ms 69484 KB Output is correct
71 Correct 225 ms 68816 KB Output is correct
72 Correct 207 ms 68644 KB Output is correct
73 Correct 559 ms 81064 KB Output is correct
74 Correct 416 ms 75576 KB Output is correct
75 Correct 485 ms 78288 KB Output is correct
76 Correct 636 ms 86248 KB Output is correct
77 Correct 330 ms 69580 KB Output is correct
78 Correct 558 ms 82688 KB Output is correct
79 Correct 617 ms 82664 KB Output is correct
80 Correct 671 ms 86252 KB Output is correct
81 Correct 246 ms 63948 KB Output is correct
82 Correct 491 ms 80844 KB Output is correct
83 Correct 456 ms 76304 KB Output is correct
84 Correct 669 ms 86220 KB Output is correct
85 Correct 418 ms 76496 KB Output is correct
86 Correct 524 ms 79888 KB Output is correct
87 Correct 272 ms 70756 KB Output is correct
88 Correct 506 ms 80332 KB Output is correct
89 Correct 476 ms 78468 KB Output is correct
90 Correct 536 ms 79564 KB Output is correct
91 Correct 341 ms 73468 KB Output is correct
92 Correct 577 ms 80332 KB Output is correct
93 Correct 276 ms 72492 KB Output is correct
94 Correct 543 ms 80040 KB Output is correct
95 Correct 337 ms 72636 KB Output is correct
96 Correct 486 ms 79664 KB Output is correct