oj.uz

Submission #471990

# Submission time Handle Problem Language Result Execution time Memory
471990 2021-09-12T06:02:33 Z 1bin Two Antennas (JOI19_antennas) C++14
100 / 100
 1183 ms 59588 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(v) v.begin(), v.end()
typedef long long ll;
const int NMAX = 2e5 + 5;
const ll inf = 1e18;
ll n, h[NMAX], a[NMAX], b[NMAX], Q, ans[NMAX], l[NMAX], r[NMAX], base = 1, s, e;
vector<ll> p[NMAX], m[NMAX];
vector<pair<ll, ll>> query[NMAX];
vector<ll> c, d, lazy;

void init() {
	for (int i = 1; i <= n + 1; i++) {
		p[i].clear();
		m[i].clear();
	}
	for (int i = 1; i < base * 2; i++) c[i] = inf, d[i] = -inf, lazy[i] = -1;
	return;
}

void upd_lazy(ll idx) {
	if (lazy[idx] == -1) return;
	d[idx] = max(d[idx], lazy[idx] - c[idx]);
	if (idx < base) {
		lazy[idx * 2] = max(lazy[idx * 2], lazy[idx]);
		lazy[idx * 2 + 1] = max(lazy[idx * 2 + 1], lazy[idx]);
	}
	lazy[idx] = -1;
	return;
}

void updc(ll idx, ll nl, ll nr, ll k, ll v) {
	upd_lazy(idx);
	if (nl == nr) {
		c[idx] = v;
		return;
	}
	ll mid = (nl + nr) / 2;
	if (k <= mid) updc(idx * 2, nl, mid, k, v);
	else updc(idx * 2 + 1, mid + 1, nr, k, v);
	c[idx] = min(c[idx * 2], c[idx * 2 + 1]);
	return;
}

ll minc(ll l, ll r) {
	ll ret = inf;
	l += base; r += base;
	while (l <= r) {
		if (l & 1) ret = min(ret, c[l++]);
		if (!(r & 1)) ret = min(ret, c[r--]);
		l /= 2; r /= 2;
	}
	return ret;
}

void updd(ll idx, ll nl, ll nr, ll l, ll r, ll v) {
	upd_lazy(idx);
	if (nr < l || nl > r) return;
	if (nl >= l && nr <= r) {
		d[idx] = max(d[idx], v - c[idx]);
		if (nl != nr) {
			lazy[idx * 2] = max(lazy[idx * 2], v);
			lazy[idx * 2 + 1] = max(lazy[idx * 2 + 1], v);
		}
		return;
	}
	ll mid = (nl + nr) / 2;
	updd(idx * 2, nl, mid, l, r, v);
	updd(idx * 2 + 1, mid + 1, nr, l, r, v);
	d[idx] = max(d[idx * 2], d[idx * 2 + 1]);
	return;
}

ll mxd(ll idx, ll nl, ll nr, ll l, ll r) {
	upd_lazy(idx);
	if (nr < l || nl > r) return -inf;
	if (nl >= l && nr <= r) return d[idx];
	ll mid = (nl + nr) / 2;
	return max(mxd(idx * 2, nl, mid, l, r), mxd(idx * 2 + 1, mid + 1, nr, l, r));
}

void go() {
	init();
	for (int i = 1; i <= n; i++) {
		s = i + a[i];
		e = min(i + b[i] + 1, n + 1);
		if (s <= n) {
			p[s].emplace_back(i);
			m[e].emplace_back(i);
		}

		for (ll x : p[i]) updc(1, 0, base - 1, x, h[x]);
		for (ll x : m[i]) updc(1, 0, base - 1, x, inf);
		if (i > 1) {
			s = max(i - b[i], 1LL);
			e = i - a[i];
			if (e >= 1) updd(1, 0, base - 1, s, e, h[i]);
			for (auto& q : query[i])
				ans[q.second] = max(ans[q.second], mxd(1, 0, base - 1, q.first, i));
		}
	}
	return;
}

int main(void) {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	cin >> n;
	while (base < n + 1) base *= 2;
	c.resize(base * 2); d.resize(base * 2); lazy.resize(base * 2);

	for (int i = 1; i <= n; i++) cin >> h[i] >> a[i] >> b[i];
	cin >> Q;
	for (int i = 0; i < Q; i++) {
		cin >> l[i] >> r[i];
		query[r[i]].emplace_back(l[i], i);
		ans[i] = -1;
	}
	go();

	reverse(h + 1, h + n + 1);
	reverse(a + 1, a + n + 1);
	reverse(b + 1, b + n + 1);
	for (int i = 1; i <= n; i++) query[i].clear();
	for (int i = 0; i < Q; i++) {
		l[i] = n + 1 - l[i];
		r[i] = n + 1 - r[i];
		swap(l[i], r[i]);
		query[r[i]].emplace_back(l[i], i);
	}
	go();

	for (int i = 0; i < Q; i++) {
		cout << ans[i] << '\n';
	}
	return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 8 ms 14416 KB Output is correct
3 Correct 9 ms 14424 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 8 ms 14384 KB Output is correct
6 Correct 9 ms 14452 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 10 ms 14512 KB Output is correct
9 Correct 9 ms 14404 KB Output is correct
10 Correct 9 ms 14412 KB Output is correct
11 Correct 9 ms 14416 KB Output is correct
12 Correct 9 ms 14412 KB Output is correct
13 Correct 8 ms 14452 KB Output is correct
14 Correct 9 ms 14668 KB Output is correct
15 Correct 9 ms 14488 KB Output is correct
16 Correct 9 ms 14412 KB Output is correct
17 Correct 9 ms 14412 KB Output is correct
18 Correct 9 ms 14412 KB Output is correct
19 Correct 9 ms 14412 KB Output is correct
20 Correct 10 ms 14424 KB Output is correct
21 Correct 8 ms 14412 KB Output is correct
22 Correct 8 ms 14412 KB Output is correct
23 Correct 8 ms 14416 KB Output is correct
24 Correct 9 ms 14412 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 8 ms 14416 KB Output is correct
3 Correct 9 ms 14424 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 8 ms 14384 KB Output is correct
6 Correct 9 ms 14452 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 10 ms 14512 KB Output is correct
9 Correct 9 ms 14404 KB Output is correct
10 Correct 9 ms 14412 KB Output is correct
11 Correct 9 ms 14416 KB Output is correct
12 Correct 9 ms 14412 KB Output is correct
13 Correct 8 ms 14452 KB Output is correct
14 Correct 9 ms 14668 KB Output is correct
15 Correct 9 ms 14488 KB Output is correct
16 Correct 9 ms 14412 KB Output is correct
17 Correct 9 ms 14412 KB Output is correct
18 Correct 9 ms 14412 KB Output is correct
19 Correct 9 ms 14412 KB Output is correct
20 Correct 10 ms 14424 KB Output is correct
21 Correct 8 ms 14412 KB Output is correct
22 Correct 8 ms 14412 KB Output is correct
23 Correct 8 ms 14416 KB Output is correct
24 Correct 9 ms 14412 KB Output is correct
25 Correct 137 ms 25292 KB Output is correct
26 Correct 28 ms 15820 KB Output is correct
27 Correct 205 ms 29400 KB Output is correct
28 Correct 217 ms 29016 KB Output is correct
29 Correct 145 ms 25592 KB Output is correct
30 Correct 143 ms 24796 KB Output is correct
31 Correct 155 ms 27844 KB Output is correct
32 Correct 218 ms 29152 KB Output is correct
33 Correct 197 ms 28804 KB Output is correct
34 Correct 102 ms 21584 KB Output is correct
35 Correct 209 ms 29888 KB Output is correct
36 Correct 249 ms 29088 KB Output is correct
37 Correct 119 ms 22596 KB Output is correct
38 Correct 208 ms 28044 KB Output is correct
39 Correct 44 ms 16580 KB Output is correct
40 Correct 207 ms 28064 KB Output is correct
41 Correct 147 ms 25044 KB Output is correct
42 Correct 223 ms 28140 KB Output is correct
43 Correct 71 ms 19244 KB Output is correct
44 Correct 196 ms 27972 KB Output is correct
45 Correct 43 ms 17048 KB Output is correct
46 Correct 204 ms 28080 KB Output is correct
47 Correct 58 ms 18116 KB Output is correct
48 Correct 197 ms 27972 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 528 ms 36504 KB Output is correct
2 Correct 586 ms 42024 KB Output is correct
3 Correct 396 ms 37508 KB Output is correct
4 Correct 600 ms 42076 KB Output is correct
5 Correct 219 ms 27684 KB Output is correct
6 Correct 570 ms 42160 KB Output is correct
7 Correct 494 ms 40204 KB Output is correct
8 Correct 596 ms 42144 KB Output is correct
9 Correct 66 ms 18372 KB Output is correct
10 Correct 568 ms 42056 KB Output is correct
11 Correct 345 ms 30204 KB Output is correct
12 Correct 573 ms 42044 KB Output is correct
13 Correct 370 ms 41148 KB Output is correct
14 Correct 363 ms 40864 KB Output is correct
15 Correct 322 ms 39800 KB Output is correct
16 Correct 309 ms 40108 KB Output is correct
17 Correct 387 ms 41776 KB Output is correct
18 Correct 329 ms 40700 KB Output is correct
19 Correct 333 ms 40580 KB Output is correct
20 Correct 346 ms 40684 KB Output is correct
21 Correct 332 ms 40976 KB Output is correct
22 Correct 355 ms 40720 KB Output is correct
23 Correct 332 ms 41144 KB Output is correct
24 Correct 330 ms 39468 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 8 ms 14416 KB Output is correct
3 Correct 9 ms 14424 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 8 ms 14384 KB Output is correct
6 Correct 9 ms 14452 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 10 ms 14512 KB Output is correct
9 Correct 9 ms 14404 KB Output is correct
10 Correct 9 ms 14412 KB Output is correct
11 Correct 9 ms 14416 KB Output is correct
12 Correct 9 ms 14412 KB Output is correct
13 Correct 8 ms 14452 KB Output is correct
14 Correct 9 ms 14668 KB Output is correct
15 Correct 9 ms 14488 KB Output is correct
16 Correct 9 ms 14412 KB Output is correct
17 Correct 9 ms 14412 KB Output is correct
18 Correct 9 ms 14412 KB Output is correct
19 Correct 9 ms 14412 KB Output is correct
20 Correct 10 ms 14424 KB Output is correct
21 Correct 8 ms 14412 KB Output is correct
22 Correct 8 ms 14412 KB Output is correct
23 Correct 8 ms 14416 KB Output is correct
24 Correct 9 ms 14412 KB Output is correct
25 Correct 137 ms 25292 KB Output is correct
26 Correct 28 ms 15820 KB Output is correct
27 Correct 205 ms 29400 KB Output is correct
28 Correct 217 ms 29016 KB Output is correct
29 Correct 145 ms 25592 KB Output is correct
30 Correct 143 ms 24796 KB Output is correct
31 Correct 155 ms 27844 KB Output is correct
32 Correct 218 ms 29152 KB Output is correct
33 Correct 197 ms 28804 KB Output is correct
34 Correct 102 ms 21584 KB Output is correct
35 Correct 209 ms 29888 KB Output is correct
36 Correct 249 ms 29088 KB Output is correct
37 Correct 119 ms 22596 KB Output is correct
38 Correct 208 ms 28044 KB Output is correct
39 Correct 44 ms 16580 KB Output is correct
40 Correct 207 ms 28064 KB Output is correct
41 Correct 147 ms 25044 KB Output is correct
42 Correct 223 ms 28140 KB Output is correct
43 Correct 71 ms 19244 KB Output is correct
44 Correct 196 ms 27972 KB Output is correct
45 Correct 43 ms 17048 KB Output is correct
46 Correct 204 ms 28080 KB Output is correct
47 Correct 58 ms 18116 KB Output is correct
48 Correct 197 ms 27972 KB Output is correct
49 Correct 528 ms 36504 KB Output is correct
50 Correct 586 ms 42024 KB Output is correct
51 Correct 396 ms 37508 KB Output is correct
52 Correct 600 ms 42076 KB Output is correct
53 Correct 219 ms 27684 KB Output is correct
54 Correct 570 ms 42160 KB Output is correct
55 Correct 494 ms 40204 KB Output is correct
56 Correct 596 ms 42144 KB Output is correct
57 Correct 66 ms 18372 KB Output is correct
58 Correct 568 ms 42056 KB Output is correct
59 Correct 345 ms 30204 KB Output is correct
60 Correct 573 ms 42044 KB Output is correct
61 Correct 370 ms 41148 KB Output is correct
62 Correct 363 ms 40864 KB Output is correct
63 Correct 322 ms 39800 KB Output is correct
64 Correct 309 ms 40108 KB Output is correct
65 Correct 387 ms 41776 KB Output is correct
66 Correct 329 ms 40700 KB Output is correct
67 Correct 333 ms 40580 KB Output is correct
68 Correct 346 ms 40684 KB Output is correct
69 Correct 332 ms 40976 KB Output is correct
70 Correct 355 ms 40720 KB Output is correct
71 Correct 332 ms 41144 KB Output is correct
72 Correct 330 ms 39468 KB Output is correct
73 Correct 932 ms 53900 KB Output is correct
74 Correct 641 ms 43656 KB Output is correct
75 Correct 880 ms 54328 KB Output is correct
76 Correct 1154 ms 59576 KB Output is correct
77 Correct 553 ms 39820 KB Output is correct
78 Correct 996 ms 54112 KB Output is correct
79 Correct 1051 ms 57300 KB Output is correct
80 Correct 1150 ms 59572 KB Output is correct
81 Correct 406 ms 33424 KB Output is correct
82 Correct 864 ms 51080 KB Output is correct
83 Correct 792 ms 46920 KB Output is correct
84 Correct 1183 ms 59588 KB Output is correct
85 Correct 635 ms 51016 KB Output is correct
86 Correct 776 ms 57220 KB Output is correct
87 Correct 374 ms 42456 KB Output is correct
88 Correct 789 ms 56560 KB Output is correct
89 Correct 733 ms 54004 KB Output is correct
90 Correct 808 ms 56852 KB Output is correct
91 Correct 487 ms 46456 KB Output is correct
92 Correct 830 ms 56964 KB Output is correct
93 Correct 441 ms 44176 KB Output is correct
94 Correct 842 ms 57024 KB Output is correct
95 Correct 462 ms 45772 KB Output is correct
96 Correct 776 ms 55776 KB Output is correct