oj.uz

Submission #375008

# Submission time Handle Problem Language Result Execution time Memory
375008 2021-03-08T20:50:19 Z vot808 Two Antennas (JOI19_antennas) C++17
100 / 100
 1056 ms 48944 KB 
#include "bits/stdc++.h"
using namespace std;
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef array<int, 2> ii;
#define endl '\n'

const ll INF = 1e15;
struct Node {
	ll ans = -INF, mn = INF;
};

class SegmentTree {
	public:
		vector<Node> tree; int n;
		vector<ll> lazy;
		
		Node merge(Node &a, Node &b) {
			return {max(a.ans, b.ans), min(a.mn, b.mn)};
		}
		
		void push(int &p, int &c1, int &c2) {
			lazy[c1] = max(lazy[c1], lazy[p]);
			lazy[c2] = max(lazy[c2], lazy[p]);
			tree[c1].ans = max(tree[c1].ans, lazy[c1]-tree[c1].mn);
			tree[c2].ans = max(tree[c2].ans, lazy[c2]-tree[c2].mn);
			lazy[p] = -INF;
		}
		
		void updateMin(int i, ll val, int l, int r, int p) {
			if (l > i or r < i) return;
			if (l == r) {
				lazy[p] = -INF;
				tree[p].mn = val;
				return;
			}
			
			int mid = (l + r) / 2;
			int c1 = 2*p+1, c2 = 2*p+2;
			
			if (lazy[p] != -INF) push(p, c1, c2);
			
			updateMin(i, val, l, mid, c1); updateMin(i, val, mid+1, r, c2);
			tree[p] = merge(tree[c1], tree[c2]);
		}
		
		void updateRangeMax(int i, int j, ll val, int l, int r, int p) {
			if (r < i or l > j) return;
			if (l >= i and r <= j) {
				lazy[p] = max(lazy[p], val);
				tree[p].ans = max(tree[p].ans, lazy[p]-tree[p].mn);
				return;
			}
			
			int mid = (l + r) / 2;
			int c1 = 2*p+1, c2 = 2*p+2;
			
			if (lazy[p] != -INF) push(p, c1, c2);
			
			updateRangeMax(i, j, val, l, mid, c1); updateRangeMax(i, j, val, mid+1, r, c2);
			tree[p] = merge(tree[c1], tree[c2]);
		}
		
		ll ans(int i, int j, int l, int r, int p) {
			if (l > j or r < i) return -INF;
			if (l >= i and r <= j) return tree[p].ans;
			
			int mid = (l + r) / 2;
			int c1 = 2*p+1, c2 = 2*p+2;
			
			if (lazy[p] != -INF) push(p, c1, c2);
			
			return max(ans(i, j, l, mid, c1), ans(i, j, mid+1, r, c2));
		}
	
		SegmentTree(int N) {
			n = N;
			tree.resize(4*n); lazy.resize(4*n, -INF);
		}
};

int n, q;
vector<array<int, 3>> nums; // {height, a, b}
vector<ii> qrs;
vector<ll> ans;

void solve() {
	SegmentTree tree(n);
	vector<vector<array<int, 2>>> qrLeft(n);
	
	for_(i, 0, q) qrLeft[qrs[i][1]].push_back({qrs[i][0], i});

	vector<vi> enter(n), bye(n);
	for_(i, 0, n) {
		if (i+nums[i][1] < n) enter[i+nums[i][1]].push_back(i);
		if (i+nums[i][1] < n-1) bye[min(i+nums[i][2], n-1)].push_back(i);
	}
	
	for_(i, 0, n) {
		for (auto &e: enter[i]) tree.updateMin(e, nums[e][0], 0, n-1, 0);
		
		if (i-nums[i][1] >= 0) tree.updateRangeMax(max(i-nums[i][2], 0), i-nums[i][1], nums[i][0], 0, n-1, 0);
		
		for (auto &l: qrLeft[i]) ans[l[1]] = max(ans[l[1]], tree.ans(l[0], i, 0, n-1, 0));
		
		for (auto &e: bye[i]) tree.updateMin(e, INF, 0, n-1, 0);
	}
}

int main() {
#ifdef mlocal
	freopen("test.in", "r", stdin);
#endif
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> n;
	nums.resize(n);
	for_(i, 0, n) cin >> nums[i][0] >> nums[i][1] >> nums[i][2];
	
	cin >> q;
	qrs.resize(q); ans.resize(q, -1);
	
	for_(i, 0, q) {
		cin >> qrs[i][0] >> qrs[i][1];
		qrs[i][0] -= 1; qrs[i][1] -= 1;
	}
	
	solve();
	reverse(nums.begin(), nums.end());
	for_(i, 0, q) {
		qrs[i][0] = n-1-qrs[i][0];
		qrs[i][1] = n-1-qrs[i][1];
		swap(qrs[i][0], qrs[i][1]);
	}
	solve();
	
	for (auto i: ans) cout << i << endl;
}

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 97 ms 4964 KB Output is correct
26 Correct 16 ms 1516 KB Output is correct
27 Correct 147 ms 6984 KB Output is correct
28 Correct 160 ms 8040 KB Output is correct
29 Correct 103 ms 5248 KB Output is correct
30 Correct 105 ms 5924 KB Output is correct
31 Correct 111 ms 6244 KB Output is correct
32 Correct 153 ms 7996 KB Output is correct
33 Correct 167 ms 6372 KB Output is correct
34 Correct 76 ms 4372 KB Output is correct
35 Correct 146 ms 6820 KB Output is correct
36 Correct 156 ms 7900 KB Output is correct
37 Correct 105 ms 4588 KB Output is correct
38 Correct 147 ms 6380 KB Output is correct
39 Correct 23 ms 1900 KB Output is correct
40 Correct 157 ms 6508 KB Output is correct
41 Correct 108 ms 5420 KB Output is correct
42 Correct 146 ms 6380 KB Output is correct
43 Correct 49 ms 3052 KB Output is correct
44 Correct 149 ms 6508 KB Output is correct
45 Correct 27 ms 2028 KB Output is correct
46 Correct 144 ms 6508 KB Output is correct
47 Correct 40 ms 2564 KB Output is correct
48 Correct 144 ms 6508 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 538 ms 35512 KB Output is correct
2 Correct 600 ms 39352 KB Output is correct
3 Correct 397 ms 27832 KB Output is correct
4 Correct 615 ms 39344 KB Output is correct
5 Correct 238 ms 18412 KB Output is correct
6 Correct 632 ms 39468 KB Output is correct
7 Correct 520 ms 34440 KB Output is correct
8 Correct 604 ms 39600 KB Output is correct
9 Correct 66 ms 6804 KB Output is correct
10 Correct 610 ms 39472 KB Output is correct
11 Correct 345 ms 24984 KB Output is correct
12 Correct 630 ms 39480 KB Output is correct
13 Correct 368 ms 38416 KB Output is correct
14 Correct 348 ms 38072 KB Output is correct
15 Correct 331 ms 37228 KB Output is correct
16 Correct 315 ms 37608 KB Output is correct
17 Correct 377 ms 38744 KB Output is correct
18 Correct 352 ms 37576 KB Output is correct
19 Correct 350 ms 37788 KB Output is correct
20 Correct 351 ms 37960 KB Output is correct
21 Correct 340 ms 38464 KB Output is correct
22 Correct 356 ms 38028 KB Output is correct
23 Correct 355 ms 38296 KB Output is correct
24 Correct 309 ms 37096 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 97 ms 4964 KB Output is correct
26 Correct 16 ms 1516 KB Output is correct
27 Correct 147 ms 6984 KB Output is correct
28 Correct 160 ms 8040 KB Output is correct
29 Correct 103 ms 5248 KB Output is correct
30 Correct 105 ms 5924 KB Output is correct
31 Correct 111 ms 6244 KB Output is correct
32 Correct 153 ms 7996 KB Output is correct
33 Correct 167 ms 6372 KB Output is correct
34 Correct 76 ms 4372 KB Output is correct
35 Correct 146 ms 6820 KB Output is correct
36 Correct 156 ms 7900 KB Output is correct
37 Correct 105 ms 4588 KB Output is correct
38 Correct 147 ms 6380 KB Output is correct
39 Correct 23 ms 1900 KB Output is correct
40 Correct 157 ms 6508 KB Output is correct
41 Correct 108 ms 5420 KB Output is correct
42 Correct 146 ms 6380 KB Output is correct
43 Correct 49 ms 3052 KB Output is correct
44 Correct 149 ms 6508 KB Output is correct
45 Correct 27 ms 2028 KB Output is correct
46 Correct 144 ms 6508 KB Output is correct
47 Correct 40 ms 2564 KB Output is correct
48 Correct 144 ms 6508 KB Output is correct
49 Correct 538 ms 35512 KB Output is correct
50 Correct 600 ms 39352 KB Output is correct
51 Correct 397 ms 27832 KB Output is correct
52 Correct 615 ms 39344 KB Output is correct
53 Correct 238 ms 18412 KB Output is correct
54 Correct 632 ms 39468 KB Output is correct
55 Correct 520 ms 34440 KB Output is correct
56 Correct 604 ms 39600 KB Output is correct
57 Correct 66 ms 6804 KB Output is correct
58 Correct 610 ms 39472 KB Output is correct
59 Correct 345 ms 24984 KB Output is correct
60 Correct 630 ms 39480 KB Output is correct
61 Correct 368 ms 38416 KB Output is correct
62 Correct 348 ms 38072 KB Output is correct
63 Correct 331 ms 37228 KB Output is correct
64 Correct 315 ms 37608 KB Output is correct
65 Correct 377 ms 38744 KB Output is correct
66 Correct 352 ms 37576 KB Output is correct
67 Correct 350 ms 37788 KB Output is correct
68 Correct 351 ms 37960 KB Output is correct
69 Correct 340 ms 38464 KB Output is correct
70 Correct 356 ms 38028 KB Output is correct
71 Correct 355 ms 38296 KB Output is correct
72 Correct 309 ms 37096 KB Output is correct
73 Correct 841 ms 42676 KB Output is correct
74 Correct 639 ms 40368 KB Output is correct
75 Correct 769 ms 36884 KB Output is correct
76 Correct 1036 ms 48944 KB Output is correct
77 Correct 500 ms 25128 KB Output is correct
78 Correct 904 ms 45996 KB Output is correct
79 Correct 940 ms 43476 KB Output is correct
80 Correct 1051 ms 48816 KB Output is correct
81 Correct 307 ms 12428 KB Output is correct
82 Correct 830 ms 44336 KB Output is correct
83 Correct 718 ms 33648 KB Output is correct
84 Correct 1056 ms 48816 KB Output is correct
85 Correct 623 ms 43576 KB Output is correct
86 Correct 765 ms 46312 KB Output is correct
87 Correct 390 ms 38580 KB Output is correct
88 Correct 714 ms 45108 KB Output is correct
89 Correct 689 ms 45056 KB Output is correct
90 Correct 778 ms 45712 KB Output is correct
91 Correct 510 ms 40792 KB Output is correct
92 Correct 802 ms 46008 KB Output is correct
93 Correct 432 ms 40124 KB Output is correct
94 Correct 758 ms 46216 KB Output is correct
95 Correct 460 ms 40532 KB Output is correct
96 Correct 714 ms 45288 KB Output is correct