oj.uz

Submission #375017

# Submission time Handle Problem Language Result Execution time Memory
375017 2021-03-08T21:06:02 Z vot808 Two Antennas (JOI19_antennas) C++17
100 / 100
 1111 ms 48696 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'
 
namespace speedy_io {
	int read_nonneg() {
		int c;
		while ((c = getchar_unlocked()) < '0' || c > '9');
		int v = c - '0';
		while ((c = getchar_unlocked()) >= '0' && c <= '9') {
			v = (v << 3) + (v << 1) + (c - '0');
		}
		return v;
	}
	
	const int max_ll_size = 20;
	void put_nonneg(ll n) {
		int i = max_ll_size;
		char output_buffer[max_ll_size];
		do {
			output_buffer[--i] = (n % 10) + '0';
			n /= 10;
		} while (n);
		do {
			putchar_unlocked(output_buffer[i]);
		} while (++i < max_ll_size);
	}
}
 
using namespace speedy_io;
 
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) for_(j, 0, 3) nums[i][j] = read_nonneg();
	
	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) {
      if (i == -1) cout << -1;
		else put_nonneg(i);
		cout << 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 136 ms 4712 KB Output is correct
26 Correct 19 ms 1260 KB Output is correct
27 Correct 204 ms 6524 KB Output is correct
28 Correct 206 ms 7652 KB Output is correct
29 Correct 136 ms 4996 KB Output is correct
30 Correct 143 ms 5720 KB Output is correct
31 Correct 159 ms 5900 KB Output is correct
32 Correct 209 ms 7828 KB Output is correct
33 Correct 192 ms 6244 KB Output is correct
34 Correct 102 ms 4116 KB Output is correct
35 Correct 204 ms 6688 KB Output is correct
36 Correct 210 ms 7772 KB Output is correct
37 Correct 123 ms 4468 KB Output is correct
38 Correct 205 ms 6252 KB Output is correct
39 Correct 31 ms 1772 KB Output is correct
40 Correct 212 ms 6212 KB Output is correct
41 Correct 150 ms 5272 KB Output is correct
42 Correct 209 ms 6380 KB Output is correct
43 Correct 69 ms 2924 KB Output is correct
44 Correct 205 ms 6252 KB Output is correct
45 Correct 39 ms 1900 KB Output is correct
46 Correct 209 ms 6252 KB Output is correct
47 Correct 54 ms 2412 KB Output is correct
48 Correct 206 ms 6252 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 505 ms 35428 KB Output is correct
2 Correct 558 ms 39272 KB Output is correct
3 Correct 356 ms 27836 KB Output is correct
4 Correct 553 ms 39348 KB Output is correct
5 Correct 217 ms 18412 KB Output is correct
6 Correct 550 ms 39272 KB Output is correct
7 Correct 465 ms 34256 KB Output is correct
8 Correct 602 ms 39272 KB Output is correct
9 Correct 56 ms 6548 KB Output is correct
10 Correct 559 ms 39472 KB Output is correct
11 Correct 311 ms 24700 KB Output is correct
12 Correct 553 ms 39352 KB Output is correct
13 Correct 318 ms 38288 KB Output is correct
14 Correct 297 ms 38184 KB Output is correct
15 Correct 278 ms 37036 KB Output is correct
16 Correct 264 ms 37356 KB Output is correct
17 Correct 326 ms 38424 KB Output is correct
18 Correct 296 ms 37356 KB Output is correct
19 Correct 299 ms 37660 KB Output is correct
20 Correct 299 ms 37752 KB Output is correct
21 Correct 287 ms 38408 KB Output is correct
22 Correct 305 ms 37832 KB Output is correct
23 Correct 297 ms 38040 KB Output is correct
24 Correct 253 ms 36904 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 136 ms 4712 KB Output is correct
26 Correct 19 ms 1260 KB Output is correct
27 Correct 204 ms 6524 KB Output is correct
28 Correct 206 ms 7652 KB Output is correct
29 Correct 136 ms 4996 KB Output is correct
30 Correct 143 ms 5720 KB Output is correct
31 Correct 159 ms 5900 KB Output is correct
32 Correct 209 ms 7828 KB Output is correct
33 Correct 192 ms 6244 KB Output is correct
34 Correct 102 ms 4116 KB Output is correct
35 Correct 204 ms 6688 KB Output is correct
36 Correct 210 ms 7772 KB Output is correct
37 Correct 123 ms 4468 KB Output is correct
38 Correct 205 ms 6252 KB Output is correct
39 Correct 31 ms 1772 KB Output is correct
40 Correct 212 ms 6212 KB Output is correct
41 Correct 150 ms 5272 KB Output is correct
42 Correct 209 ms 6380 KB Output is correct
43 Correct 69 ms 2924 KB Output is correct
44 Correct 205 ms 6252 KB Output is correct
45 Correct 39 ms 1900 KB Output is correct
46 Correct 209 ms 6252 KB Output is correct
47 Correct 54 ms 2412 KB Output is correct
48 Correct 206 ms 6252 KB Output is correct
49 Correct 505 ms 35428 KB Output is correct
50 Correct 558 ms 39272 KB Output is correct
51 Correct 356 ms 27836 KB Output is correct
52 Correct 553 ms 39348 KB Output is correct
53 Correct 217 ms 18412 KB Output is correct
54 Correct 550 ms 39272 KB Output is correct
55 Correct 465 ms 34256 KB Output is correct
56 Correct 602 ms 39272 KB Output is correct
57 Correct 56 ms 6548 KB Output is correct
58 Correct 559 ms 39472 KB Output is correct
59 Correct 311 ms 24700 KB Output is correct
60 Correct 553 ms 39352 KB Output is correct
61 Correct 318 ms 38288 KB Output is correct
62 Correct 297 ms 38184 KB Output is correct
63 Correct 278 ms 37036 KB Output is correct
64 Correct 264 ms 37356 KB Output is correct
65 Correct 326 ms 38424 KB Output is correct
66 Correct 296 ms 37356 KB Output is correct
67 Correct 299 ms 37660 KB Output is correct
68 Correct 299 ms 37752 KB Output is correct
69 Correct 287 ms 38408 KB Output is correct
70 Correct 305 ms 37832 KB Output is correct
71 Correct 297 ms 38040 KB Output is correct
72 Correct 253 ms 36904 KB Output is correct
73 Correct 901 ms 42680 KB Output is correct
74 Correct 596 ms 40112 KB Output is correct
75 Correct 834 ms 36628 KB Output is correct
76 Correct 1080 ms 48688 KB Output is correct
77 Correct 524 ms 24756 KB Output is correct
78 Correct 903 ms 45752 KB Output is correct
79 Correct 971 ms 43400 KB Output is correct
80 Correct 1080 ms 48696 KB Output is correct
81 Correct 381 ms 12300 KB Output is correct
82 Correct 801 ms 44208 KB Output is correct
83 Correct 749 ms 33524 KB Output is correct
84 Correct 1111 ms 48696 KB Output is correct
85 Correct 600 ms 43320 KB Output is correct
86 Correct 823 ms 46184 KB Output is correct
87 Correct 349 ms 38444 KB Output is correct
88 Correct 749 ms 45108 KB Output is correct
89 Correct 685 ms 44828 KB Output is correct
90 Correct 770 ms 45560 KB Output is correct
91 Correct 456 ms 40664 KB Output is correct
92 Correct 777 ms 46008 KB Output is correct
93 Correct 373 ms 39876 KB Output is correct
94 Correct 786 ms 46008 KB Output is correct
95 Correct 432 ms 40404 KB Output is correct
96 Correct 731 ms 45112 KB Output is correct