oj.uz

Submission #375007

# Submission time Handle Problem Language Result Execution time Memory
375007 2021-03-08T20:47:37 Z vot808 Two Antennas (JOI19_antennas) C++17
100 / 100
 1046 ms 56028 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) {
			Node ans;
			ans.ans = max(a.ans, b.ans);
			ans.mn = min(a.mn, b.mn);
			
			return ans;
		}
		
		void push(int &p, int &c1, int &c2) {
			if (lazy[p] != -INF) {
				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;
				if (val != INF) tree[p].ans = -INF;
				tree[p].mn = val;
				return;
			}
			
			int mid = (l + r) / 2;
			int c1 = 2*p+1, c2 = 2*p+2;
			
			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;
			
			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;
			
			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 2 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 492 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 2 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 492 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 101 ms 5988 KB Output is correct
26 Correct 16 ms 1516 KB Output is correct
27 Correct 155 ms 8652 KB Output is correct
28 Correct 159 ms 9572 KB Output is correct
29 Correct 117 ms 6336 KB Output is correct
30 Correct 108 ms 7076 KB Output is correct
31 Correct 112 ms 7400 KB Output is correct
32 Correct 157 ms 9788 KB Output is correct
33 Correct 147 ms 8072 KB Output is correct
34 Correct 75 ms 5140 KB Output is correct
35 Correct 146 ms 8464 KB Output is correct
36 Correct 158 ms 9564 KB Output is correct
37 Correct 89 ms 5484 KB Output is correct
38 Correct 147 ms 8160 KB Output is correct
39 Correct 23 ms 2028 KB Output is correct
40 Correct 152 ms 8300 KB Output is correct
41 Correct 109 ms 6536 KB Output is correct
42 Correct 154 ms 8172 KB Output is correct
43 Correct 49 ms 3564 KB Output is correct
44 Correct 153 ms 8172 KB Output is correct
45 Correct 28 ms 2284 KB Output is correct
46 Correct 148 ms 8172 KB Output is correct
47 Correct 39 ms 2924 KB Output is correct
48 Correct 148 ms 8172 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 540 ms 35432 KB Output is correct
2 Correct 606 ms 39344 KB Output is correct
3 Correct 404 ms 27936 KB Output is correct
4 Correct 620 ms 39472 KB Output is correct
5 Correct 242 ms 18384 KB Output is correct
6 Correct 610 ms 39476 KB Output is correct
7 Correct 524 ms 34152 KB Output is correct
8 Correct 612 ms 44096 KB Output is correct
9 Correct 68 ms 7188 KB Output is correct
10 Correct 623 ms 44024 KB Output is correct
11 Correct 360 ms 27504 KB Output is correct
12 Correct 627 ms 43880 KB Output is correct
13 Correct 370 ms 43152 KB Output is correct
14 Correct 348 ms 42536 KB Output is correct
15 Correct 338 ms 41552 KB Output is correct
16 Correct 315 ms 41964 KB Output is correct
17 Correct 378 ms 42968 KB Output is correct
18 Correct 352 ms 41964 KB Output is correct
19 Correct 347 ms 42140 KB Output is correct
20 Correct 346 ms 42240 KB Output is correct
21 Correct 337 ms 42756 KB Output is correct
22 Correct 352 ms 42312 KB Output is correct
23 Correct 349 ms 42648 KB Output is correct
24 Correct 303 ms 41448 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 2 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 492 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 101 ms 5988 KB Output is correct
26 Correct 16 ms 1516 KB Output is correct
27 Correct 155 ms 8652 KB Output is correct
28 Correct 159 ms 9572 KB Output is correct
29 Correct 117 ms 6336 KB Output is correct
30 Correct 108 ms 7076 KB Output is correct
31 Correct 112 ms 7400 KB Output is correct
32 Correct 157 ms 9788 KB Output is correct
33 Correct 147 ms 8072 KB Output is correct
34 Correct 75 ms 5140 KB Output is correct
35 Correct 146 ms 8464 KB Output is correct
36 Correct 158 ms 9564 KB Output is correct
37 Correct 89 ms 5484 KB Output is correct
38 Correct 147 ms 8160 KB Output is correct
39 Correct 23 ms 2028 KB Output is correct
40 Correct 152 ms 8300 KB Output is correct
41 Correct 109 ms 6536 KB Output is correct
42 Correct 154 ms 8172 KB Output is correct
43 Correct 49 ms 3564 KB Output is correct
44 Correct 153 ms 8172 KB Output is correct
45 Correct 28 ms 2284 KB Output is correct
46 Correct 148 ms 8172 KB Output is correct
47 Correct 39 ms 2924 KB Output is correct
48 Correct 148 ms 8172 KB Output is correct
49 Correct 540 ms 35432 KB Output is correct
50 Correct 606 ms 39344 KB Output is correct
51 Correct 404 ms 27936 KB Output is correct
52 Correct 620 ms 39472 KB Output is correct
53 Correct 242 ms 18384 KB Output is correct
54 Correct 610 ms 39476 KB Output is correct
55 Correct 524 ms 34152 KB Output is correct
56 Correct 612 ms 44096 KB Output is correct
57 Correct 68 ms 7188 KB Output is correct
58 Correct 623 ms 44024 KB Output is correct
59 Correct 360 ms 27504 KB Output is correct
60 Correct 627 ms 43880 KB Output is correct
61 Correct 370 ms 43152 KB Output is correct
62 Correct 348 ms 42536 KB Output is correct
63 Correct 338 ms 41552 KB Output is correct
64 Correct 315 ms 41964 KB Output is correct
65 Correct 378 ms 42968 KB Output is correct
66 Correct 352 ms 41964 KB Output is correct
67 Correct 347 ms 42140 KB Output is correct
68 Correct 346 ms 42240 KB Output is correct
69 Correct 337 ms 42756 KB Output is correct
70 Correct 352 ms 42312 KB Output is correct
71 Correct 349 ms 42648 KB Output is correct
72 Correct 303 ms 41448 KB Output is correct
73 Correct 890 ms 48564 KB Output is correct
74 Correct 639 ms 44976 KB Output is correct
75 Correct 811 ms 42396 KB Output is correct
76 Correct 1045 ms 56028 KB Output is correct
77 Correct 487 ms 28468 KB Output is correct
78 Correct 902 ms 52140 KB Output is correct
79 Correct 927 ms 49996 KB Output is correct
80 Correct 1046 ms 55992 KB Output is correct
81 Correct 308 ms 14996 KB Output is correct
82 Correct 816 ms 50096 KB Output is correct
83 Correct 820 ms 38908 KB Output is correct
84 Correct 1039 ms 55908 KB Output is correct
85 Correct 596 ms 49336 KB Output is correct
86 Correct 745 ms 53328 KB Output is correct
87 Correct 385 ms 43180 KB Output is correct
88 Correct 704 ms 52148 KB Output is correct
89 Correct 671 ms 51072 KB Output is correct
90 Correct 744 ms 52616 KB Output is correct
91 Correct 476 ms 46040 KB Output is correct
92 Correct 757 ms 52920 KB Output is correct
93 Correct 405 ms 44988 KB Output is correct
94 Correct 741 ms 53128 KB Output is correct
95 Correct 455 ms 45396 KB Output is correct
96 Correct 701 ms 52200 KB Output is correct