oj.uz

Submission #476634

# Submission time Handle Problem Language Result Execution time Memory
476634 2021-09-27T20:25:29 Z cheissmart Two Antennas (JOI19_antennas) C++14
100 / 100
 1465 ms 43448 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("trapv")
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

string _reset = "\u001b[0m", _yellow = "\u001b[33m", _bold = "\u001b[1m";
void DBG() { cerr << "]" << _reset << endl; }
template<class H, class...T> void DBG(H h, T ...t) {
	cerr << to_string(h);
	if(sizeof ...(t)) cerr << ", ";
	DBG(t...);
}
#ifdef CHEISSMART
#define debug(...) cerr << _yellow << _bold << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define debug(...)
#endif

const int INF = 1e9 + 7, N = 2e5 + 7;
void cmax(int& a, int b) {
	a = max(a, b);
}

int h[N], a[N], b[N], l[N], r[N], ans[N];
vi G[N];

int n;

int seg_a[N];

struct node {
	int base_mx, lz_mx, sum_mx;
	node() {
		base_mx = lz_mx = sum_mx = -INF;
	}
} t[N * 4];

void pull(int v) {
	t[v].base_mx = max(t[v * 2].base_mx, t[v * 2 + 1].base_mx);
	t[v].sum_mx = max(t[v * 2].sum_mx, t[v * 2 + 1].sum_mx);
}

void apply(int v, int x) {
	cmax(t[v].sum_mx, t[v].base_mx + x);
	cmax(t[v].lz_mx, x);
}

void push(int v) {
	apply(v * 2, t[v].lz_mx);
	apply(v * 2 + 1, t[v].lz_mx);
	t[v].lz_mx = -INF;
}

void build(int v = 1, int tl = 0, int tr = n) {
	t[v] = node();
	if(tr - tl == 1) return;
	int tm = (tl + tr) / 2;
	build(v * 2, tl, tm);
	build(v * 2 + 1, tm, tr);
	pull(v);
}

void activate(int pos, bool op, int v = 1, int tl = 0, int tr = n) {
	if(tr - tl == 1) {
		assert(tl == pos);
		if(op)
			t[v].base_mx = seg_a[pos];
		else
			t[v].base_mx = -INF;
		return;
	}
	push(v);
	int tm = (tl + tr) / 2;
	if(pos < tm)
		activate(pos, op, v * 2, tl, tm);
	else
		activate(pos, op, v * 2 + 1, tm, tr);
	pull(v);
}

void upd(int l, int r, int x, int v = 1, int tl = 0, int tr = n) {
	if(l <= tl && tr <= r) {
		apply(v, x);
		return;
	}
	push(v);
	int tm = (tl + tr) / 2;
	if(l < tm)
		upd(l, r, x, v * 2, tl, tm);
	if(r > tm)
		upd(l, r, x, v * 2 + 1, tm, tr);
	pull(v);
}

int qry(int l, int r, int v = 1, int tl = 0, int tr = n) {
	if(l <= tl && tr <= r)
		return t[v].sum_mx;
	push(v);
	int tm = (tl + tr) / 2;
	int ans = -INF;
	if(l < tm)
		cmax(ans, qry(l, r, v * 2, tl, tm));
	if(r > tm)
		cmax(ans, qry(l, r, v * 2 + 1, tm, tr));
	return ans;
}

V<pair<int, bool>> ev[N];

signed main()
{
	IO_OP;
	
	cin >> n;
	for(int i = 0; i < n; i++) {
		cin >> h[i] >> a[i] >> b[i];
	}
	int q;
	cin >> q;
	for(int i = 0; i < q; i++) {
		cin >> l[i] >> r[i];
		l[i]--, r[i]--;
		ans[i] = -1;
	}

	auto solve = [&] () {
		for(int i = 0; i < q; i++) {
			assert(l[i] < r[i]);
			G[r[i]].PB(i);
		}
		for(int i = 0; i < n; i++) {
			int L = i + a[i], R = i + b[i];
			if(L < n) ev[L].EB(i, true);
			if(R + 1 < n) ev[R + 1].EB(i, false);
		}
		for(int i = 0; i < n; i++) {
			seg_a[i] = -h[i];
		}
		build();
		for(int i = 0; i < n; i++) {
			for(auto[x, y]:ev[i]) {
				activate(x, y);
			}
			int L = max(0, i - b[i]), R = i - a[i];
			if(R >= L)
				upd(L, R + 1, h[i]);
			for(int j:G[i]) {
				assert(r[j] == i);
				cmax(ans[j], qry(l[j], i));
			}
		}
		for(int i = 0; i < n; i++) {
			G[i].clear();
			ev[i].clear();
		}
	};

	solve();
	reverse(h, h + n), reverse(a, a + n), reverse(b, b + n);
	for(int i = 0; i < q; i++) {
		l[i] = n - l[i] - 1, r[i] = n - r[i] - 1;
		swap(l[i], r[i]);
	}
	solve();

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

}

Compilation message

antennas.cpp: In lambda function:
antennas.cpp:153:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  153 |    for(auto[x, y]:ev[i]) {
      |            ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19148 KB Output is correct
2 Correct 10 ms 19148 KB Output is correct
3 Correct 11 ms 19216 KB Output is correct
4 Correct 10 ms 19164 KB Output is correct
5 Correct 12 ms 19148 KB Output is correct
6 Correct 10 ms 19092 KB Output is correct
7 Correct 10 ms 19148 KB Output is correct
8 Correct 10 ms 19132 KB Output is correct
9 Correct 10 ms 19148 KB Output is correct
10 Correct 10 ms 19120 KB Output is correct
11 Correct 10 ms 19148 KB Output is correct
12 Correct 10 ms 19148 KB Output is correct
13 Correct 10 ms 19148 KB Output is correct
14 Correct 11 ms 19120 KB Output is correct
15 Correct 10 ms 19148 KB Output is correct
16 Correct 10 ms 19148 KB Output is correct
17 Correct 10 ms 19148 KB Output is correct
18 Correct 10 ms 19148 KB Output is correct
19 Correct 10 ms 19148 KB Output is correct
20 Correct 11 ms 19116 KB Output is correct
21 Correct 10 ms 19148 KB Output is correct
22 Correct 10 ms 19116 KB Output is correct
23 Correct 10 ms 19276 KB Output is correct
24 Correct 11 ms 19148 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19148 KB Output is correct
2 Correct 10 ms 19148 KB Output is correct
3 Correct 11 ms 19216 KB Output is correct
4 Correct 10 ms 19164 KB Output is correct
5 Correct 12 ms 19148 KB Output is correct
6 Correct 10 ms 19092 KB Output is correct
7 Correct 10 ms 19148 KB Output is correct
8 Correct 10 ms 19132 KB Output is correct
9 Correct 10 ms 19148 KB Output is correct
10 Correct 10 ms 19120 KB Output is correct
11 Correct 10 ms 19148 KB Output is correct
12 Correct 10 ms 19148 KB Output is correct
13 Correct 10 ms 19148 KB Output is correct
14 Correct 11 ms 19120 KB Output is correct
15 Correct 10 ms 19148 KB Output is correct
16 Correct 10 ms 19148 KB Output is correct
17 Correct 10 ms 19148 KB Output is correct
18 Correct 10 ms 19148 KB Output is correct
19 Correct 10 ms 19148 KB Output is correct
20 Correct 11 ms 19116 KB Output is correct
21 Correct 10 ms 19148 KB Output is correct
22 Correct 10 ms 19116 KB Output is correct
23 Correct 10 ms 19276 KB Output is correct
24 Correct 11 ms 19148 KB Output is correct
25 Correct 214 ms 24524 KB Output is correct
26 Correct 39 ms 19780 KB Output is correct
27 Correct 323 ms 26668 KB Output is correct
28 Correct 332 ms 26744 KB Output is correct
29 Correct 218 ms 24564 KB Output is correct
30 Correct 217 ms 24336 KB Output is correct
31 Correct 232 ms 25936 KB Output is correct
32 Correct 342 ms 26692 KB Output is correct
33 Correct 285 ms 26316 KB Output is correct
34 Correct 159 ms 22784 KB Output is correct
35 Correct 308 ms 26928 KB Output is correct
36 Correct 316 ms 26652 KB Output is correct
37 Correct 200 ms 22980 KB Output is correct
38 Correct 335 ms 25720 KB Output is correct
39 Correct 65 ms 20164 KB Output is correct
40 Correct 346 ms 25736 KB Output is correct
41 Correct 236 ms 24132 KB Output is correct
42 Correct 330 ms 25712 KB Output is correct
43 Correct 125 ms 21444 KB Output is correct
44 Correct 329 ms 25636 KB Output is correct
45 Correct 64 ms 20420 KB Output is correct
46 Correct 313 ms 25664 KB Output is correct
47 Correct 87 ms 20840 KB Output is correct
48 Correct 331 ms 25652 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 547 ms 26076 KB Output is correct
2 Correct 621 ms 26756 KB Output is correct
3 Correct 408 ms 24428 KB Output is correct
4 Correct 587 ms 26796 KB Output is correct
5 Correct 251 ms 22724 KB Output is correct
6 Correct 571 ms 26896 KB Output is correct
7 Correct 534 ms 25716 KB Output is correct
8 Correct 600 ms 26796 KB Output is correct
9 Correct 79 ms 20260 KB Output is correct
10 Correct 633 ms 26944 KB Output is correct
11 Correct 395 ms 23880 KB Output is correct
12 Correct 604 ms 26784 KB Output is correct
13 Correct 590 ms 27024 KB Output is correct
14 Correct 541 ms 26800 KB Output is correct
15 Correct 550 ms 26072 KB Output is correct
16 Correct 484 ms 25900 KB Output is correct
17 Correct 614 ms 27688 KB Output is correct
18 Correct 550 ms 26368 KB Output is correct
19 Correct 586 ms 26672 KB Output is correct
20 Correct 574 ms 26584 KB Output is correct
21 Correct 512 ms 26648 KB Output is correct
22 Correct 579 ms 26556 KB Output is correct
23 Correct 556 ms 26724 KB Output is correct
24 Correct 520 ms 25272 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19148 KB Output is correct
2 Correct 10 ms 19148 KB Output is correct
3 Correct 11 ms 19216 KB Output is correct
4 Correct 10 ms 19164 KB Output is correct
5 Correct 12 ms 19148 KB Output is correct
6 Correct 10 ms 19092 KB Output is correct
7 Correct 10 ms 19148 KB Output is correct
8 Correct 10 ms 19132 KB Output is correct
9 Correct 10 ms 19148 KB Output is correct
10 Correct 10 ms 19120 KB Output is correct
11 Correct 10 ms 19148 KB Output is correct
12 Correct 10 ms 19148 KB Output is correct
13 Correct 10 ms 19148 KB Output is correct
14 Correct 11 ms 19120 KB Output is correct
15 Correct 10 ms 19148 KB Output is correct
16 Correct 10 ms 19148 KB Output is correct
17 Correct 10 ms 19148 KB Output is correct
18 Correct 10 ms 19148 KB Output is correct
19 Correct 10 ms 19148 KB Output is correct
20 Correct 11 ms 19116 KB Output is correct
21 Correct 10 ms 19148 KB Output is correct
22 Correct 10 ms 19116 KB Output is correct
23 Correct 10 ms 19276 KB Output is correct
24 Correct 11 ms 19148 KB Output is correct
25 Correct 214 ms 24524 KB Output is correct
26 Correct 39 ms 19780 KB Output is correct
27 Correct 323 ms 26668 KB Output is correct
28 Correct 332 ms 26744 KB Output is correct
29 Correct 218 ms 24564 KB Output is correct
30 Correct 217 ms 24336 KB Output is correct
31 Correct 232 ms 25936 KB Output is correct
32 Correct 342 ms 26692 KB Output is correct
33 Correct 285 ms 26316 KB Output is correct
34 Correct 159 ms 22784 KB Output is correct
35 Correct 308 ms 26928 KB Output is correct
36 Correct 316 ms 26652 KB Output is correct
37 Correct 200 ms 22980 KB Output is correct
38 Correct 335 ms 25720 KB Output is correct
39 Correct 65 ms 20164 KB Output is correct
40 Correct 346 ms 25736 KB Output is correct
41 Correct 236 ms 24132 KB Output is correct
42 Correct 330 ms 25712 KB Output is correct
43 Correct 125 ms 21444 KB Output is correct
44 Correct 329 ms 25636 KB Output is correct
45 Correct 64 ms 20420 KB Output is correct
46 Correct 313 ms 25664 KB Output is correct
47 Correct 87 ms 20840 KB Output is correct
48 Correct 331 ms 25652 KB Output is correct
49 Correct 547 ms 26076 KB Output is correct
50 Correct 621 ms 26756 KB Output is correct
51 Correct 408 ms 24428 KB Output is correct
52 Correct 587 ms 26796 KB Output is correct
53 Correct 251 ms 22724 KB Output is correct
54 Correct 571 ms 26896 KB Output is correct
55 Correct 534 ms 25716 KB Output is correct
56 Correct 600 ms 26796 KB Output is correct
57 Correct 79 ms 20260 KB Output is correct
58 Correct 633 ms 26944 KB Output is correct
59 Correct 395 ms 23880 KB Output is correct
60 Correct 604 ms 26784 KB Output is correct
61 Correct 590 ms 27024 KB Output is correct
62 Correct 541 ms 26800 KB Output is correct
63 Correct 550 ms 26072 KB Output is correct
64 Correct 484 ms 25900 KB Output is correct
65 Correct 614 ms 27688 KB Output is correct
66 Correct 550 ms 26368 KB Output is correct
67 Correct 586 ms 26672 KB Output is correct
68 Correct 574 ms 26584 KB Output is correct
69 Correct 512 ms 26648 KB Output is correct
70 Correct 579 ms 26556 KB Output is correct
71 Correct 556 ms 26724 KB Output is correct
72 Correct 520 ms 25272 KB Output is correct
73 Correct 1035 ms 39568 KB Output is correct
74 Correct 734 ms 32784 KB Output is correct
75 Correct 1066 ms 38668 KB Output is correct
76 Correct 1465 ms 43440 KB Output is correct
77 Correct 714 ms 32380 KB Output is correct
78 Correct 1177 ms 40276 KB Output is correct
79 Correct 1415 ms 41352 KB Output is correct
80 Correct 1416 ms 43448 KB Output is correct
81 Correct 668 ms 29272 KB Output is correct
82 Correct 1034 ms 38280 KB Output is correct
83 Correct 1036 ms 37332 KB Output is correct
84 Correct 1436 ms 43448 KB Output is correct
85 Correct 1059 ms 38744 KB Output is correct
86 Correct 1267 ms 42128 KB Output is correct
87 Correct 682 ms 32532 KB Output is correct
88 Correct 1251 ms 41276 KB Output is correct
89 Correct 1244 ms 40660 KB Output is correct
90 Correct 1292 ms 41708 KB Output is correct
91 Correct 855 ms 35828 KB Output is correct
92 Correct 1223 ms 42024 KB Output is correct
93 Correct 639 ms 33772 KB Output is correct
94 Correct 1276 ms 41952 KB Output is correct
95 Correct 726 ms 35036 KB Output is correct
96 Correct 1188 ms 40740 KB Output is correct