oj.uz

답안 #767652

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
767652 2023-06-27T02:08:29 Z minhcool Two Antennas (JOI19_antennas) C++17
100 / 100
 624 ms 85784 KB 
#define local
#ifndef local
#include ""
#endif
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 4e5 + 5;

const int oo = 1e18 + 7, mod = 1e9 + 7;

mt19937 rng(1);

int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}

int n, a[N], b[N], h[N];
int cal[N];

int mini[N << 2], maxi[N << 2];
ii updates[N << 2];

int total[N << 2];

void build(int id, int l, int r){
	mini[id] = oo, maxi[id] = -oo;
	updates[id] = {oo, -oo};
	total[id] = -oo;
	if(l == r) return;
	int mid = (l + r) >> 1;
	build(id << 1, l, mid);
	build(id << 1 | 1, mid + 1, r);
}

// ins1, er1, get1 -> for calculating cal[]
void ins1(int id, int l, int r, int pos){
	if(l == r){
		mini[id] = maxi[id] = h[pos];
		return;
	}
	int mid = (l + r) >> 1;
	if(pos <= mid) ins1(id << 1, l, mid, pos);
	else ins1(id << 1 | 1, mid + 1, r, pos);
	mini[id] = min(mini[id << 1], mini[id << 1 | 1]);
	maxi[id] = max(maxi[id << 1], maxi[id << 1 | 1]);
}

void er1(int id, int l, int r, int pos){
	if(l == r){
		mini[id] = oo;
		maxi[id] = -oo;
		return;
	}
	int mid = (l + r) >> 1;
	if(pos <= mid) er1(id << 1, l, mid, pos);
	else er1(id << 1 | 1, mid + 1, r, pos);
	mini[id] = min(mini[id << 1], mini[id << 1 | 1]);
	maxi[id] = max(maxi[id << 1], maxi[id << 1 | 1]);
}

ii get1(int id, int l, int r, int L, int R){
	if(l > R || r < L || l > r) return {oo, -oo};
	if(l >= L && r <= R) return {mini[id], maxi[id]};
	int mid = (l + r) >> 1;
	ii a = get1(id << 1, l, mid, L, R);
	ii b = get1(id << 1 | 1, mid + 1, r, L, R);
	return {min(a.fi, b.fi), max(a.se, b.se)};
}

void lazy(int id){
	int mn = updates[id].fi, mx = updates[id].se;
	updates[id << 1].fi = min(updates[id << 1].fi, mn);
	updates[id << 1 | 1].fi = min(updates[id << 1 | 1].fi, mn);
	updates[id << 1].se = max(updates[id << 1].se, mx);
	updates[id << 1 | 1].se = max(updates[id << 1 | 1].se, mx);
	total[id << 1] = max(total[id << 1], max(updates[id << 1].se - mini[id << 1], maxi[id << 1] - updates[id << 1].fi));
	total[id << 1 | 1] = max(total[id << 1 | 1], max(updates[id << 1 | 1].se - mini[id << 1 | 1], maxi[id << 1 | 1] - updates[id << 1 | 1].fi));
	updates[id] = {oo, -oo};
}

void merge(int id){
	total[id] = max(total[id], max(total[id << 1], total[id << 1 | 1]));
	mini[id] = min(mini[id << 1], mini[id << 1 | 1]);
	maxi[id] = max(maxi[id << 1], maxi[id << 1 | 1]);
//	cout << "PRINT " << id << " " << total[id] << "\n";
}

void ins2(int id, int l, int r, int pos){
	if(l == r){
		updates[id] = {oo, -oo}; total[id] = -oo;
		//minni[id] = {a[pos], a[pos]};
		mini[id] = maxi[id] = h[pos];
		return;
	}
	lazy(id);
	int mid = (l + r) >> 1;
	if(pos <= mid) ins2(id << 1, l, mid, pos);
	else ins2(id << 1 | 1, mid + 1, r, pos);
	merge(id);
}

void er2(int id, int l, int r, int pos){
	if(l == r){
		updates[id] = {oo, -oo}; total[id] = -oo;
		//minni[id] = {a[pos], a[pos]};
		mini[id] = oo, maxi[id] = -oo;
		return;
	}
	lazy(id);
	int mid = (l + r) >> 1;
	if(pos <= mid) er2(id << 1, l, mid, pos);
	else er2(id << 1 | 1, mid + 1, r, pos);
	merge(id);
}

void upd2(int id, int l, int r, int L, int R, int val){
	if(l > R || r < L || l > r) return;
	if(l >= L && r <= R){
		updates[id] = {min(updates[id].fi, val), max(updates[id].se, val)};
		total[id] = max(total[id], max(updates[id].se - mini[id], maxi[id] - updates[id].fi));
		return;
	}
	lazy(id);
	int mid = (l + r) >> 1;
	upd2(id << 1, l, mid, L, R, val);
	upd2(id << 1 | 1, mid + 1, r, L, R, val);
	merge(id);
}

int get2(int id, int l, int r, int L, int R){
//	cout << "TRAV " << id << " " << l << " " << r << " " << mini[id] << " " << maxi[id] << " " << total[id] << "\n";
	if(l > R || r < L || l > r) return -oo;
	if(l >= L && r <= R) return total[id];
	lazy(id);
	int mid = (l + r) >> 1;
	return max(get2(id << 1, l, mid, L, R), get2(id << 1 | 1, mid + 1, r, L, R));	
}
// this is just for storing the ones that are done
int IT2[N << 2];

void upd3(int id, int l, int r, int pos, int val){
	if(l == r){
		IT2[id] = val;
		return;
	}
	int mid = (l + r) >> 1;
	if(pos <= mid) upd3(id << 1, l, mid, pos, val);
	else upd3(id << 1 | 1, mid + 1, r, pos, val);
	IT2[id] = max(IT2[id << 1], IT2[id << 1 | 1]);
}

int get3(int id, int l, int r, int L, int R){
	if(l > R || r < L || l > r) return -oo;
	if(l >= L && r <= R) return IT2[id];
	int mid = (l + r) >> 1;
	return max(get3(id << 1, l, mid, L, R), get3(id << 1 | 1, mid + 1, r, L, R));
}

vector<ii> upds[N];

int q, answer[N];
vector<ii> queries[N];

#ifdef local
void process(){
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> h[i] >> a[i] >> b[i];
	build(1, 1, n);
	cin >> q;
	for(int i = 1; i <= q; i++){
		int l, r;
		cin >> l >> r;
		queries[l].pb({r, i});
	}
	// step 1: calculate the value for i (assuming that i is at the right) for each i
	for(int i = 0; i <= n; i++) upds[i].clear();
	for(int i = 1; i <= n; i++){
		upds[i + a[i]].pb({i, 1});
		upds[i + b[i] + 1].pb({i, -1});
		//cout << i + a[i] << " " <<  i + b[i] + 1 << "\n";
	}
	for(int i = 1; i <= n; i++){
		for(auto it : upds[i]){
	//		cout << i << " " << it.fi << " " << it.se << "\n";
			if(it.se == 1) ins1(1, 1, n, it.fi);
			else er1(1, 1, n, it.fi);	
		}
		ii temp = get1(1, 1, n, max(1LL, i - b[i]), max(0LL, i - a[i]));
		//cout << max(1LL, i - b[i]) << " " << max(0LL, i - a[i]) << " " << temp.fi << " " << temp.se << "\n";
		//cout << i << " " << i - b[i] << " " << i - a[i] << "\n";
		cal[i] = max(h[i] - temp.fi, temp.se - h[i]);
	//	cout << cal[i] << "\n";
	}
	for(int i = 1; i <= (n << 2); i++) IT2[i] = -oo;
	build(1, 1, n);
	for(int i = 0; i <= n; i++) upds[i].clear();
	for(int i = 1; i <= n; i++){
		upds[max(0LL, i - a[i])].pb({i, 1});
		upds[max(0LL, i - b[i] - 1)].pb({i, -1});
	}
	for(int i = n; i >= 1; i--){
		for(auto it : upds[i]){
			if(it.se == 1) ins2(1, 1, n, it.fi); 
			else{
				er2(1, 1, n, it.fi);
		//		cout << it.fi << " " << it.fi - b[it.fi] - 1 << " " << cal[it.fi] << "\n";
				upd3(1, 1, n, it.fi, cal[it.fi]);
			}
	//		cout << "UPDS " << it.fi << " " << it.se << "\n";
		}
		upd2(1, 1, n, min(i + a[i], n + 1), min(i + b[i], n), h[i]);
		for(auto it : queries[i]){
		///	if(it.se == 13) cout << i << " " << it.fi << " " << get2(1, 1, n, i, it.fi) << " " << get3(1, 1, n, i, it.fi) << "\n";
			answer[it.se] = max(get2(1, 1, n, i, it.fi), get3(1, 1, n, i, it.fi));
		}
	}
	for(int i = 1; i <= q; i++) cout << max(answer[i], -1LL) << "\n";
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
//	freopen("grader.inp", "r", stdin);
//	freopen("grader.out", "w", stdout);
	process();
}
#endif

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 19224 KB Output is correct
2 Correct 11 ms 19284 KB Output is correct
3 Correct 9 ms 19156 KB Output is correct
4 Correct 10 ms 19284 KB Output is correct
5 Correct 11 ms 19156 KB Output is correct
6 Correct 11 ms 19284 KB Output is correct
7 Correct 10 ms 19260 KB Output is correct
8 Correct 9 ms 19260 KB Output is correct
9 Correct 11 ms 19340 KB Output is correct
10 Correct 10 ms 19256 KB Output is correct
11 Correct 9 ms 19156 KB Output is correct
12 Correct 10 ms 19284 KB Output is correct
13 Correct 11 ms 19156 KB Output is correct
14 Correct 9 ms 19156 KB Output is correct
15 Correct 10 ms 19264 KB Output is correct
16 Correct 9 ms 19156 KB Output is correct
17 Correct 9 ms 19156 KB Output is correct
18 Correct 9 ms 19268 KB Output is correct
19 Correct 9 ms 19156 KB Output is correct
20 Correct 10 ms 19156 KB Output is correct
21 Correct 10 ms 19260 KB Output is correct
22 Correct 10 ms 19256 KB Output is correct
23 Correct 10 ms 19156 KB Output is correct
24 Correct 11 ms 19156 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 19224 KB Output is correct
2 Correct 11 ms 19284 KB Output is correct
3 Correct 9 ms 19156 KB Output is correct
4 Correct 10 ms 19284 KB Output is correct
5 Correct 11 ms 19156 KB Output is correct
6 Correct 11 ms 19284 KB Output is correct
7 Correct 10 ms 19260 KB Output is correct
8 Correct 9 ms 19260 KB Output is correct
9 Correct 11 ms 19340 KB Output is correct
10 Correct 10 ms 19256 KB Output is correct
11 Correct 9 ms 19156 KB Output is correct
12 Correct 10 ms 19284 KB Output is correct
13 Correct 11 ms 19156 KB Output is correct
14 Correct 9 ms 19156 KB Output is correct
15 Correct 10 ms 19264 KB Output is correct
16 Correct 9 ms 19156 KB Output is correct
17 Correct 9 ms 19156 KB Output is correct
18 Correct 9 ms 19268 KB Output is correct
19 Correct 9 ms 19156 KB Output is correct
20 Correct 10 ms 19156 KB Output is correct
21 Correct 10 ms 19260 KB Output is correct
22 Correct 10 ms 19256 KB Output is correct
23 Correct 10 ms 19156 KB Output is correct
24 Correct 11 ms 19156 KB Output is correct
25 Correct 84 ms 26692 KB Output is correct
26 Correct 24 ms 20320 KB Output is correct
27 Correct 121 ms 29500 KB Output is correct
28 Correct 123 ms 29144 KB Output is correct
29 Correct 90 ms 27200 KB Output is correct
30 Correct 86 ms 26576 KB Output is correct
31 Correct 88 ms 28488 KB Output is correct
32 Correct 126 ms 29136 KB Output is correct
33 Correct 116 ms 29548 KB Output is correct
34 Correct 66 ms 24268 KB Output is correct
35 Correct 118 ms 30400 KB Output is correct
36 Correct 123 ms 29152 KB Output is correct
37 Correct 80 ms 24940 KB Output is correct
38 Correct 120 ms 28152 KB Output is correct
39 Correct 26 ms 20812 KB Output is correct
40 Correct 124 ms 28056 KB Output is correct
41 Correct 92 ms 26688 KB Output is correct
42 Correct 122 ms 28124 KB Output is correct
43 Correct 61 ms 22748 KB Output is correct
44 Correct 122 ms 28084 KB Output is correct
45 Correct 31 ms 21196 KB Output is correct
46 Correct 128 ms 28160 KB Output is correct
47 Correct 41 ms 21824 KB Output is correct
48 Correct 123 ms 28128 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 362 ms 66544 KB Output is correct
2 Correct 330 ms 69612 KB Output is correct
3 Correct 219 ms 60728 KB Output is correct
4 Correct 351 ms 69648 KB Output is correct
5 Correct 131 ms 43164 KB Output is correct
6 Correct 353 ms 69584 KB Output is correct
7 Correct 280 ms 65548 KB Output is correct
8 Correct 326 ms 69504 KB Output is correct
9 Correct 44 ms 26612 KB Output is correct
10 Correct 341 ms 69576 KB Output is correct
11 Correct 179 ms 48700 KB Output is correct
12 Correct 346 ms 69564 KB Output is correct
13 Correct 214 ms 68400 KB Output is correct
14 Correct 208 ms 72896 KB Output is correct
15 Correct 212 ms 73736 KB Output is correct
16 Correct 186 ms 73284 KB Output is correct
17 Correct 229 ms 73048 KB Output is correct
18 Correct 213 ms 72800 KB Output is correct
19 Correct 234 ms 72520 KB Output is correct
20 Correct 214 ms 72660 KB Output is correct
21 Correct 203 ms 73056 KB Output is correct
22 Correct 208 ms 72752 KB Output is correct
23 Correct 214 ms 72800 KB Output is correct
24 Correct 193 ms 73292 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 19224 KB Output is correct
2 Correct 11 ms 19284 KB Output is correct
3 Correct 9 ms 19156 KB Output is correct
4 Correct 10 ms 19284 KB Output is correct
5 Correct 11 ms 19156 KB Output is correct
6 Correct 11 ms 19284 KB Output is correct
7 Correct 10 ms 19260 KB Output is correct
8 Correct 9 ms 19260 KB Output is correct
9 Correct 11 ms 19340 KB Output is correct
10 Correct 10 ms 19256 KB Output is correct
11 Correct 9 ms 19156 KB Output is correct
12 Correct 10 ms 19284 KB Output is correct
13 Correct 11 ms 19156 KB Output is correct
14 Correct 9 ms 19156 KB Output is correct
15 Correct 10 ms 19264 KB Output is correct
16 Correct 9 ms 19156 KB Output is correct
17 Correct 9 ms 19156 KB Output is correct
18 Correct 9 ms 19268 KB Output is correct
19 Correct 9 ms 19156 KB Output is correct
20 Correct 10 ms 19156 KB Output is correct
21 Correct 10 ms 19260 KB Output is correct
22 Correct 10 ms 19256 KB Output is correct
23 Correct 10 ms 19156 KB Output is correct
24 Correct 11 ms 19156 KB Output is correct
25 Correct 84 ms 26692 KB Output is correct
26 Correct 24 ms 20320 KB Output is correct
27 Correct 121 ms 29500 KB Output is correct
28 Correct 123 ms 29144 KB Output is correct
29 Correct 90 ms 27200 KB Output is correct
30 Correct 86 ms 26576 KB Output is correct
31 Correct 88 ms 28488 KB Output is correct
32 Correct 126 ms 29136 KB Output is correct
33 Correct 116 ms 29548 KB Output is correct
34 Correct 66 ms 24268 KB Output is correct
35 Correct 118 ms 30400 KB Output is correct
36 Correct 123 ms 29152 KB Output is correct
37 Correct 80 ms 24940 KB Output is correct
38 Correct 120 ms 28152 KB Output is correct
39 Correct 26 ms 20812 KB Output is correct
40 Correct 124 ms 28056 KB Output is correct
41 Correct 92 ms 26688 KB Output is correct
42 Correct 122 ms 28124 KB Output is correct
43 Correct 61 ms 22748 KB Output is correct
44 Correct 122 ms 28084 KB Output is correct
45 Correct 31 ms 21196 KB Output is correct
46 Correct 128 ms 28160 KB Output is correct
47 Correct 41 ms 21824 KB Output is correct
48 Correct 123 ms 28128 KB Output is correct
49 Correct 362 ms 66544 KB Output is correct
50 Correct 330 ms 69612 KB Output is correct
51 Correct 219 ms 60728 KB Output is correct
52 Correct 351 ms 69648 KB Output is correct
53 Correct 131 ms 43164 KB Output is correct
54 Correct 353 ms 69584 KB Output is correct
55 Correct 280 ms 65548 KB Output is correct
56 Correct 326 ms 69504 KB Output is correct
57 Correct 44 ms 26612 KB Output is correct
58 Correct 341 ms 69576 KB Output is correct
59 Correct 179 ms 48700 KB Output is correct
60 Correct 346 ms 69564 KB Output is correct
61 Correct 214 ms 68400 KB Output is correct
62 Correct 208 ms 72896 KB Output is correct
63 Correct 212 ms 73736 KB Output is correct
64 Correct 186 ms 73284 KB Output is correct
65 Correct 229 ms 73048 KB Output is correct
66 Correct 213 ms 72800 KB Output is correct
67 Correct 234 ms 72520 KB Output is correct
68 Correct 214 ms 72660 KB Output is correct
69 Correct 203 ms 73056 KB Output is correct
70 Correct 208 ms 72752 KB Output is correct
71 Correct 214 ms 72800 KB Output is correct
72 Correct 193 ms 73292 KB Output is correct
73 Correct 513 ms 79228 KB Output is correct
74 Correct 377 ms 75052 KB Output is correct
75 Correct 445 ms 75012 KB Output is correct
76 Correct 580 ms 85536 KB Output is correct
77 Correct 312 ms 53312 KB Output is correct
78 Correct 526 ms 81828 KB Output is correct
79 Correct 583 ms 80892 KB Output is correct
80 Correct 601 ms 85784 KB Output is correct
81 Correct 213 ms 37184 KB Output is correct
82 Correct 488 ms 79792 KB Output is correct
83 Correct 415 ms 62012 KB Output is correct
84 Correct 624 ms 85612 KB Output is correct
85 Correct 372 ms 78952 KB Output is correct
86 Correct 512 ms 83268 KB Output is correct
87 Correct 259 ms 75180 KB Output is correct
88 Correct 454 ms 83660 KB Output is correct
89 Correct 438 ms 80592 KB Output is correct
90 Correct 519 ms 83040 KB Output is correct
91 Correct 329 ms 75952 KB Output is correct
92 Correct 556 ms 82992 KB Output is correct
93 Correct 261 ms 74768 KB Output is correct
94 Correct 540 ms 82968 KB Output is correct
95 Correct 315 ms 75612 KB Output is correct
96 Correct 461 ms 83572 KB Output is correct