oj.uz

Submission #557205

# Submission time Handle Problem Language Result Execution time Memory
557205 2022-05-04T21:08:15 Z lunchbox Two Antennas (JOI19_antennas) C++17
100 / 100
 579 ms 36888 KB 
/*
https://oj.uz/problem/view/JOI19_antennas
Two Antennas
*/
#include <bits/stdc++.h>
using namespace std;

#define N	200000
#define N_	(1 << 18)	/* N_ = pow2(ceil(log2(N)) */
#define Q	200000
#define INF	0x3f3f3f3f

int st[N_ * 2], mx[N_ * 2], lz[N_ * 2];

void put(int i, int x) {
	lz[i] = max(lz[i], x);
	mx[i] = max(mx[i], lz[i] - st[i]);
}

void pus(int i) {
	if (lz[i] != -INF) {
		put(i << 1 | 0, lz[i]);
		put(i << 1 | 1, lz[i]);
		lz[i] = -INF;
	}
}

void pul(int i) {
	int l = i << 1 | 0, r = i << 1 | 1;

	st[i] = min(st[l], st[r]);
	mx[i] = max(mx[l], mx[r]);
}

void update(int u, int l, int r, int ql, int qr, int x) {
	int m;

	if (qr < l || ql > r)
		assert(0);
	if (ql <= l && qr >= r) {
		put(u, x);
		return;
	}
	pus(u);
	m = (l + r) >> 1;
	if (ql <= m)
		update(u << 1 | 0, l, m, ql, qr, x);
	if (m < qr)
		update(u << 1 | 1, m + 1, r, ql, qr, x);
	pul(u);
}

void update_point(int u, int l, int r, int i, int x) {
	int m;

	if (l == r) {
		st[u] = x;
		lz[u] = -INF;
		return;
	}
	pus(u);
	m = (l + r) >> 1;
	if (i <= m)
		update_point(u << 1 | 0, l, m, i, x);
	else
		update_point(u << 1 | 1, m + 1, r, i, x);
	pul(u);
}

int query(int u, int l, int r, int ql, int qr) {
	int m, x;

	if (qr < l || ql > r)
		assert(0);
	if (ql <= l && qr >= r)
		return mx[u];
	pus(u);
	m = (l + r) >> 1, x = -1;
	if (ql <= m)
		x = max(x, query(u << 1 | 0, l, m, ql, qr));
	if (m < qr)
		x = max(x, query(u << 1 | 1, m + 1, r, ql, qr));
	return x;
}

vector<array<int, 2>> ev[N + 1], qq[N];
int hh[N], aa[N], bb[N], ans[Q], n, n_;

void solve() {
	memset(st, 0x3f, n_ * 2 * sizeof * st);
	memset(mx, -1, n_ * 2 * sizeof * mx);
	memset(lz, -0x3f, n_ * 2 * sizeof * lz);
	for (int i = 0; i < n; i++) {
		for (auto [j, t] : ev[i]) {
			if (t == +1)
				update_point(1, 0, n - 1, j, hh[j]);
			else
				update_point(1, 0, n - 1, j, INF);
		}
		if (i - aa[i] >= 0)
			update(1, 0, n - 1, max(0, i - bb[i]), i - aa[i], hh[i]);
		for (auto [j, h] : qq[i]) {
			int x = query(1, 0, n - 1, j, i);

			ans[h] = max(ans[h], x);
		}
	}
}

int main() {
	int q;

	scanf("%d", &n);
	n_ = 1;
	while (n_ < n)
		n_ <<= 1;
	for (int i = 0; i < n; i++) {
		scanf("%d%d%d", &hh[i], &aa[i], &bb[i]);
		ev[min(n, i + aa[i])].push_back({ i, +1 });
		ev[min(n, i + bb[i] + 1)].push_back({ i, -1 });
	}
	scanf("%d", &q);
	memset(ans, -1, q * sizeof * ans);
	for (int h = 0; h < q; h++) {
		int l, r;

		scanf("%d%d", &l, &r), l--, r--;
		qq[r].push_back({l, h});
	}
	solve();
	for (int i = 0; i < n; i++)
		hh[i] *= -1;
	solve();
	for (int h = 0; h < q; h++)
		printf("%d\n", ans[h]);
	return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:113:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  113 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
antennas.cpp:118:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  118 |   scanf("%d%d%d", &hh[i], &aa[i], &bb[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:122:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  122 |  scanf("%d", &q);
      |  ~~~~~^~~~~~~~~~
antennas.cpp:127:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  127 |   scanf("%d%d", &l, &r), l--, r--;
      |   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9716 KB Output is correct
2 Correct 5 ms 9720 KB Output is correct
3 Correct 6 ms 9696 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 7 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 6 ms 9716 KB Output is correct
15 Correct 5 ms 9720 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9724 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9716 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9716 KB Output is correct
23 Correct 6 ms 9720 KB Output is correct
24 Correct 5 ms 9716 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9716 KB Output is correct
2 Correct 5 ms 9720 KB Output is correct
3 Correct 6 ms 9696 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 7 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 6 ms 9716 KB Output is correct
15 Correct 5 ms 9720 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9724 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9716 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9716 KB Output is correct
23 Correct 6 ms 9720 KB Output is correct
24 Correct 5 ms 9716 KB Output is correct
25 Correct 91 ms 14540 KB Output is correct
26 Correct 16 ms 10328 KB Output is correct
27 Correct 121 ms 16588 KB Output is correct
28 Correct 146 ms 16676 KB Output is correct
29 Correct 86 ms 14528 KB Output is correct
30 Correct 92 ms 14408 KB Output is correct
31 Correct 101 ms 15616 KB Output is correct
32 Correct 137 ms 16696 KB Output is correct
33 Correct 113 ms 16192 KB Output is correct
34 Correct 81 ms 13112 KB Output is correct
35 Correct 122 ms 16532 KB Output is correct
36 Correct 134 ms 16644 KB Output is correct
37 Correct 81 ms 13132 KB Output is correct
38 Correct 131 ms 15676 KB Output is correct
39 Correct 30 ms 10588 KB Output is correct
40 Correct 129 ms 15632 KB Output is correct
41 Correct 95 ms 14072 KB Output is correct
42 Correct 131 ms 15820 KB Output is correct
43 Correct 45 ms 11796 KB Output is correct
44 Correct 114 ms 15744 KB Output is correct
45 Correct 26 ms 10828 KB Output is correct
46 Correct 131 ms 15748 KB Output is correct
47 Correct 39 ms 11260 KB Output is correct
48 Correct 117 ms 15768 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 26656 KB Output is correct
2 Correct 346 ms 27856 KB Output is correct
3 Correct 202 ms 24244 KB Output is correct
4 Correct 321 ms 28000 KB Output is correct
5 Correct 140 ms 18212 KB Output is correct
6 Correct 287 ms 27848 KB Output is correct
7 Correct 308 ms 26252 KB Output is correct
8 Correct 349 ms 27832 KB Output is correct
9 Correct 39 ms 12492 KB Output is correct
10 Correct 309 ms 27848 KB Output is correct
11 Correct 192 ms 20160 KB Output is correct
12 Correct 307 ms 27964 KB Output is correct
13 Correct 208 ms 26456 KB Output is correct
14 Correct 208 ms 26164 KB Output is correct
15 Correct 187 ms 26200 KB Output is correct
16 Correct 176 ms 26592 KB Output is correct
17 Correct 211 ms 26516 KB Output is correct
18 Correct 186 ms 26588 KB Output is correct
19 Correct 201 ms 26036 KB Output is correct
20 Correct 195 ms 26204 KB Output is correct
21 Correct 181 ms 26004 KB Output is correct
22 Correct 205 ms 26216 KB Output is correct
23 Correct 191 ms 26400 KB Output is correct
24 Correct 167 ms 26152 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9716 KB Output is correct
2 Correct 5 ms 9720 KB Output is correct
3 Correct 6 ms 9696 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 7 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 6 ms 9716 KB Output is correct
15 Correct 5 ms 9720 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9724 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9716 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9716 KB Output is correct
23 Correct 6 ms 9720 KB Output is correct
24 Correct 5 ms 9716 KB Output is correct
25 Correct 91 ms 14540 KB Output is correct
26 Correct 16 ms 10328 KB Output is correct
27 Correct 121 ms 16588 KB Output is correct
28 Correct 146 ms 16676 KB Output is correct
29 Correct 86 ms 14528 KB Output is correct
30 Correct 92 ms 14408 KB Output is correct
31 Correct 101 ms 15616 KB Output is correct
32 Correct 137 ms 16696 KB Output is correct
33 Correct 113 ms 16192 KB Output is correct
34 Correct 81 ms 13112 KB Output is correct
35 Correct 122 ms 16532 KB Output is correct
36 Correct 134 ms 16644 KB Output is correct
37 Correct 81 ms 13132 KB Output is correct
38 Correct 131 ms 15676 KB Output is correct
39 Correct 30 ms 10588 KB Output is correct
40 Correct 129 ms 15632 KB Output is correct
41 Correct 95 ms 14072 KB Output is correct
42 Correct 131 ms 15820 KB Output is correct
43 Correct 45 ms 11796 KB Output is correct
44 Correct 114 ms 15744 KB Output is correct
45 Correct 26 ms 10828 KB Output is correct
46 Correct 131 ms 15748 KB Output is correct
47 Correct 39 ms 11260 KB Output is correct
48 Correct 117 ms 15768 KB Output is correct
49 Correct 290 ms 26656 KB Output is correct
50 Correct 346 ms 27856 KB Output is correct
51 Correct 202 ms 24244 KB Output is correct
52 Correct 321 ms 28000 KB Output is correct
53 Correct 140 ms 18212 KB Output is correct
54 Correct 287 ms 27848 KB Output is correct
55 Correct 308 ms 26252 KB Output is correct
56 Correct 349 ms 27832 KB Output is correct
57 Correct 39 ms 12492 KB Output is correct
58 Correct 309 ms 27848 KB Output is correct
59 Correct 192 ms 20160 KB Output is correct
60 Correct 307 ms 27964 KB Output is correct
61 Correct 208 ms 26456 KB Output is correct
62 Correct 208 ms 26164 KB Output is correct
63 Correct 187 ms 26200 KB Output is correct
64 Correct 176 ms 26592 KB Output is correct
65 Correct 211 ms 26516 KB Output is correct
66 Correct 186 ms 26588 KB Output is correct
67 Correct 201 ms 26036 KB Output is correct
68 Correct 195 ms 26204 KB Output is correct
69 Correct 181 ms 26004 KB Output is correct
70 Correct 205 ms 26216 KB Output is correct
71 Correct 191 ms 26400 KB Output is correct
72 Correct 167 ms 26152 KB Output is correct
73 Correct 504 ms 33492 KB Output is correct
74 Correct 358 ms 28748 KB Output is correct
75 Correct 436 ms 32860 KB Output is correct
76 Correct 579 ms 36888 KB Output is correct
77 Correct 293 ms 24340 KB Output is correct
78 Correct 476 ms 34124 KB Output is correct
79 Correct 550 ms 35112 KB Output is correct
80 Correct 576 ms 36880 KB Output is correct
81 Correct 211 ms 19748 KB Output is correct
82 Correct 452 ms 32512 KB Output is correct
83 Correct 390 ms 28736 KB Output is correct
84 Correct 570 ms 36888 KB Output is correct
85 Correct 336 ms 30860 KB Output is correct
86 Correct 418 ms 34132 KB Output is correct
87 Correct 226 ms 27448 KB Output is correct
88 Correct 407 ms 34480 KB Output is correct
89 Correct 381 ms 32220 KB Output is correct
90 Correct 415 ms 34476 KB Output is correct
91 Correct 277 ms 29016 KB Output is correct
92 Correct 410 ms 33940 KB Output is correct
93 Correct 233 ms 27640 KB Output is correct
94 Correct 409 ms 34148 KB Output is correct
95 Correct 256 ms 28436 KB Output is correct
96 Correct 401 ms 34144 KB Output is correct