oj.uz

Submission #951056

# Submission time Handle Problem Language Result Execution time Memory
951056 2024-03-21T05:21:46 Z Gromp15 Two Antennas (JOI19_antennas) C++17
100 / 100
 632 ms 40132 KB 
#include <bits/stdc++.h>
#define ll long long
#define ar array
#define db double
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define rint(l, r) uniform_int_distribution<int>(l, r)(rng)
template<typename T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
const int INF = int(1e9) + 5;
struct seg {
	int N; vector<int> tree, tree2, lazy;
	seg(int n) : N(1<<(__lg(n)+1)), tree(2*N, -1), tree2(2*N, 1e9), lazy(2*N, -INF) {}
	void push(int node) {
		if (lazy[node] == -INF) return;
		ckmax(tree[node], lazy[node] - tree2[node]);
		if (node < N) {
			ckmax(lazy[node*2], lazy[node]);
			ckmax(lazy[node*2+1], lazy[node]);
		}
		lazy[node] = -INF;
	}
	void update(int node, int nl, int nr, int pos, int x) {
		push(node);
		if (pos > nr || pos < nl) return;
		if (nl == nr && nl == pos) {
			tree2[node] = x; return;
		}
		int mid = (nl+nr)/2;
		update(node*2, nl, mid, pos, x);
		update(node*2+1, mid+1, nr, pos, x);
		tree[node] = max(tree[node*2], tree[node*2+1]);
		tree2[node] = min(tree2[node*2], tree2[node*2+1]);
	}
	void update2(int node, int nl, int nr, int ql, int qr, int x) {
		push(node);
		if (ql > nr || qr < nl) return;
		if (ql <= nl && nr <= qr) {
			ckmax(lazy[node], x); push(node); return;
		}
		int mid = (nl+nr)/2;
		update2(node*2, nl, mid, ql, qr, x);
		update2(node*2+1, mid+1, nr, ql, qr, x);
		tree[node] = max(tree[node*2], tree[node*2+1]);
	}
	int query(int node, int nl, int nr, int ql, int qr) {
		push(node);
		if (ql > nr || qr < nl) return -1;
		if (ql <= nl && nr <= qr) {
			return tree[node];
		}
		int mid = (nl+nr)/2;
		return max(query(node*2, nl, mid, ql, qr), query(node*2+1, mid+1, nr, ql, qr));
	}
	void update(int pos, int x) {
		update(1, 0, N-1, pos, x);
	}
	void update2(int l, int r, int x) {
		update2(1, 0, N-1, l, r, x);
	}
	int query(int l, int r) {
		return query(1, 0, N-1, l, r);
	}
};
void test_case() {
	int n; cin >> n;
	vector<int> h(n), a(n), b(n);
	for (int i = 0; i < n; i++) cin >> h[i] >> a[i] >> b[i];
	int q; cin >> q;
	vector<int> ans(q, -1);
	vector<vector<ar<int, 2>>> queries(n);
	for (int i = 0; i < q; i++) {
		int l, r; cin >> l >> r;
		l--, r--;
		queries[r].push_back({l, i});
	}
	for (int t = 0; t < 2; t++) {
		seg st(n);
		vector<vector<int>> in(n), out(n);
		for (int i = 0; i < n; i++) {
			if (i + a[i] < n) in[i + a[i]].emplace_back(i);
			if (i + b[i] + 1 < n) out[i + b[i] + 1].emplace_back(i);
		}
		for (int i = 0; i < n; i++) {
			for (int p : in[i]) st.update(p, h[p]);
			for (int p : out[i]) st.update(p, 1e9);
			int l = max(0, i - b[i]), r = i - a[i];
			if (l <= r) {
				st.update2(l, r, h[i]);
			}
			for (auto [from, ans_idx] : queries[i]) {
				ckmax(ans[ans_idx], st.query(from, i));
			}
		}
		for (int &x : h) x *= -1;
	}
	for (int i = 0; i < q; i++) cout << ans[i] << '\n';


}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
//    cin >> t;
    while (t--) test_case();
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 456 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 456 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 64 ms 5204 KB Output is correct
26 Correct 14 ms 1168 KB Output is correct
27 Correct 108 ms 7448 KB Output is correct
28 Correct 115 ms 7352 KB Output is correct
29 Correct 67 ms 5176 KB Output is correct
30 Correct 69 ms 5100 KB Output is correct
31 Correct 70 ms 6412 KB Output is correct
32 Correct 105 ms 7356 KB Output is correct
33 Correct 102 ms 6948 KB Output is correct
34 Correct 50 ms 3900 KB Output is correct
35 Correct 94 ms 7252 KB Output is correct
36 Correct 100 ms 7420 KB Output is correct
37 Correct 68 ms 3920 KB Output is correct
38 Correct 96 ms 6464 KB Output is correct
39 Correct 15 ms 1372 KB Output is correct
40 Correct 111 ms 6528 KB Output is correct
41 Correct 68 ms 4828 KB Output is correct
42 Correct 91 ms 6528 KB Output is correct
43 Correct 33 ms 2652 KB Output is correct
44 Correct 98 ms 6572 KB Output is correct
45 Correct 18 ms 1620 KB Output is correct
46 Correct 92 ms 6456 KB Output is correct
47 Correct 25 ms 2140 KB Output is correct
48 Correct 92 ms 6496 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 305 ms 28660 KB Output is correct
2 Correct 337 ms 31084 KB Output is correct
3 Correct 232 ms 23840 KB Output is correct
4 Correct 343 ms 31144 KB Output is correct
5 Correct 139 ms 14684 KB Output is correct
6 Correct 329 ms 31084 KB Output is correct
7 Correct 295 ms 27880 KB Output is correct
8 Correct 333 ms 31152 KB Output is correct
9 Correct 42 ms 4980 KB Output is correct
10 Correct 376 ms 31160 KB Output is correct
11 Correct 211 ms 18840 KB Output is correct
12 Correct 414 ms 31312 KB Output is correct
13 Correct 191 ms 28856 KB Output is correct
14 Correct 198 ms 28612 KB Output is correct
15 Correct 177 ms 28816 KB Output is correct
16 Correct 214 ms 29280 KB Output is correct
17 Correct 211 ms 28824 KB Output is correct
18 Correct 193 ms 29236 KB Output is correct
19 Correct 186 ms 28708 KB Output is correct
20 Correct 173 ms 28588 KB Output is correct
21 Correct 182 ms 28528 KB Output is correct
22 Correct 176 ms 28620 KB Output is correct
23 Correct 225 ms 28544 KB Output is correct
24 Correct 167 ms 28844 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 456 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 64 ms 5204 KB Output is correct
26 Correct 14 ms 1168 KB Output is correct
27 Correct 108 ms 7448 KB Output is correct
28 Correct 115 ms 7352 KB Output is correct
29 Correct 67 ms 5176 KB Output is correct
30 Correct 69 ms 5100 KB Output is correct
31 Correct 70 ms 6412 KB Output is correct
32 Correct 105 ms 7356 KB Output is correct
33 Correct 102 ms 6948 KB Output is correct
34 Correct 50 ms 3900 KB Output is correct
35 Correct 94 ms 7252 KB Output is correct
36 Correct 100 ms 7420 KB Output is correct
37 Correct 68 ms 3920 KB Output is correct
38 Correct 96 ms 6464 KB Output is correct
39 Correct 15 ms 1372 KB Output is correct
40 Correct 111 ms 6528 KB Output is correct
41 Correct 68 ms 4828 KB Output is correct
42 Correct 91 ms 6528 KB Output is correct
43 Correct 33 ms 2652 KB Output is correct
44 Correct 98 ms 6572 KB Output is correct
45 Correct 18 ms 1620 KB Output is correct
46 Correct 92 ms 6456 KB Output is correct
47 Correct 25 ms 2140 KB Output is correct
48 Correct 92 ms 6496 KB Output is correct
49 Correct 305 ms 28660 KB Output is correct
50 Correct 337 ms 31084 KB Output is correct
51 Correct 232 ms 23840 KB Output is correct
52 Correct 343 ms 31144 KB Output is correct
53 Correct 139 ms 14684 KB Output is correct
54 Correct 329 ms 31084 KB Output is correct
55 Correct 295 ms 27880 KB Output is correct
56 Correct 333 ms 31152 KB Output is correct
57 Correct 42 ms 4980 KB Output is correct
58 Correct 376 ms 31160 KB Output is correct
59 Correct 211 ms 18840 KB Output is correct
60 Correct 414 ms 31312 KB Output is correct
61 Correct 191 ms 28856 KB Output is correct
62 Correct 198 ms 28612 KB Output is correct
63 Correct 177 ms 28816 KB Output is correct
64 Correct 214 ms 29280 KB Output is correct
65 Correct 211 ms 28824 KB Output is correct
66 Correct 193 ms 29236 KB Output is correct
67 Correct 186 ms 28708 KB Output is correct
68 Correct 173 ms 28588 KB Output is correct
69 Correct 182 ms 28528 KB Output is correct
70 Correct 176 ms 28620 KB Output is correct
71 Correct 225 ms 28544 KB Output is correct
72 Correct 167 ms 28844 KB Output is correct
73 Correct 517 ms 33884 KB Output is correct
74 Correct 346 ms 31892 KB Output is correct
75 Correct 482 ms 32336 KB Output is correct
76 Correct 601 ms 40120 KB Output is correct
77 Correct 292 ms 20804 KB Output is correct
78 Correct 553 ms 37404 KB Output is correct
79 Correct 584 ms 36888 KB Output is correct
80 Correct 579 ms 40128 KB Output is correct
81 Correct 212 ms 10576 KB Output is correct
82 Correct 471 ms 35728 KB Output is correct
83 Correct 406 ms 27200 KB Output is correct
84 Correct 632 ms 40132 KB Output is correct
85 Correct 290 ms 33500 KB Output is correct
86 Correct 392 ms 36384 KB Output is correct
87 Correct 200 ms 30016 KB Output is correct
88 Correct 374 ms 37492 KB Output is correct
89 Correct 320 ms 34128 KB Output is correct
90 Correct 367 ms 37012 KB Output is correct
91 Correct 296 ms 31724 KB Output is correct
92 Correct 353 ms 35716 KB Output is correct
93 Correct 213 ms 30072 KB Output is correct
94 Correct 371 ms 36140 KB Output is correct
95 Correct 223 ms 30748 KB Output is correct
96 Correct 364 ms 36600 KB Output is correct