oj.uz

Submission #917349

# Submission time Handle Problem Language Result Execution time Memory
917349 2024-01-27T23:04:32 Z amirhoseinfar1385 Two Antennas (JOI19_antennas) C++17
100 / 100
 403 ms 47812 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn=200000+10;
int n,q;
int h[maxn],a[maxn],b[maxn];
int kaf=(1<<19),inf=1e9+5;
vector<int>del[maxn],ins[maxn];
vector<pair<int,int>>allq[maxn];
int res[maxn];
struct segment{
	struct node{
		int r,mxq,mnq,mx,mn;
		node(){
			r=-1;
			mxq=mx=-inf;
			mn=mnq=inf;
		}
	};
	void calr(int i){
		seg[i].r=max(seg[i].r,seg[i].mxq-seg[i].mn);
		seg[i].r=max(seg[i].r,seg[i].mx-seg[i].mnq);
	}
	void calc(int i){
		calr(i);
		if(i>=kaf){
			return ;
		}
		seg[i].r=max(seg[i].r,max(seg[(i<<1)].r,seg[(i<<1)^1].r));
		seg[i].mx=max(seg[(i<<1)].mx,seg[(i<<1)^1].mx);
		seg[i].mn=min(seg[(i<<1)].mn,seg[(i<<1)^1].mn);
	}

	void shift(int i){
		if(i>=kaf){
			return ;
		}
		seg[(i<<1)].mxq=max(seg[(i<<1)].mxq,seg[i].mxq);
		seg[(i<<1)].mnq=min(seg[(i<<1)].mnq,seg[i].mnq);
		seg[(i<<1)^1].mxq=max(seg[(i<<1)^1].mxq,seg[i].mxq);
		seg[(i<<1)^1].mnq=min(seg[(i<<1)^1].mnq,seg[i].mnq);
		seg[i].mxq=-inf;
		seg[i].mnq=inf;
	}
	node seg[(1<<20)];
	void upd(int i,int l,int r,int tl,int tr,int mx,int mn){
		calr(i);
		if(l>r||l>tr||r<tl||tl>tr){
			return ;
		}
		if(l>=tl&&r<=tr){
			calr(i);
			seg[i].mxq=-inf;
			seg[i].mnq=inf;
			seg[i].mx=mx;
			seg[i].mn=mn;
			return ;
		}
		shift(i);
		int m=(l+r)>>1;
		upd((i<<1),l,m,tl,tr,mx,mn);
		upd((i<<1)^1,m+1,r,tl,tr,mx,mn);
		calc(i);
		return ;
	}
	void qu(int i,int l,int r,int tl,int tr,int w){
		calr(i);
		if(l>r||l>tr||r<tl||tl>tr){
			return ;
		}
		if(l>=tl&&r<=tr){
			seg[i].mnq=min(seg[i].mnq,w);
			seg[i].mxq=max(seg[i].mxq,w);
			calr(i);
			return ;
		}
		int m=(l+r)>>1;
		qu((i<<1),l,m,tl,tr,w);
		qu((i<<1)^1,m+1,r,tl,tr,w);
		calc(i);
	}
	int pors(int i,int l,int r,int tl,int tr){
		calr(i);
		if(l>r||l>tr||r<tl||tl>tr){
			return -1;
		}
		if(l>=tl&&r<=tr){
			return seg[i].r;
		}
		shift(i);
		int m=(l+r)>>1;
		return max(pors((i<<1),l,m,tl,tr),pors((i<<1)^1,m+1,r,tl,tr));	
	}
}seg;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>h[i]>>a[i]>>b[i];
		if(a[i]+i<maxn){
			ins[i+a[i]].push_back(i);
		}
		if(b[i]+i+1<maxn){
			del[b[i]+i+1].push_back(i);
		}
	}
	cin>>q;
	for(int i=0;i<q;i++){
		int l,r;
		cin>>l>>r;
		allq[r].push_back(make_pair(l,i));
	}
	for(int i=1;i<=n;i++){
		for(auto x:del[i]){
			seg.upd(1,0,kaf-1,x,x,-inf,inf);
		}
		for(auto x:ins[i]){
			seg.upd(1,0,kaf-1,x,x,h[x],h[x]);
		}
		seg.qu(1,0,kaf-1,i-b[i],i-a[i],h[i]);
		for(auto x:allq[i]){
			res[x.second]=seg.pors(1,0,kaf-1,x.first,i);
		}
	}
	for(int i=0;i<q;i++){
		cout<<res[i]<<"\n";
	}
}

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 37464 KB Output is correct
2 Correct 9 ms 37468 KB Output is correct
3 Correct 10 ms 37468 KB Output is correct
4 Correct 9 ms 37508 KB Output is correct
5 Correct 9 ms 37468 KB Output is correct
6 Correct 9 ms 37468 KB Output is correct
7 Correct 10 ms 37468 KB Output is correct
8 Correct 10 ms 37468 KB Output is correct
9 Correct 9 ms 37464 KB Output is correct
10 Correct 9 ms 37468 KB Output is correct
11 Correct 9 ms 37468 KB Output is correct
12 Correct 9 ms 37468 KB Output is correct
13 Correct 10 ms 37468 KB Output is correct
14 Correct 10 ms 37564 KB Output is correct
15 Correct 9 ms 37468 KB Output is correct
16 Correct 11 ms 37468 KB Output is correct
17 Correct 9 ms 37468 KB Output is correct
18 Correct 10 ms 37468 KB Output is correct
19 Correct 9 ms 37468 KB Output is correct
20 Correct 9 ms 37512 KB Output is correct
21 Correct 10 ms 37468 KB Output is correct
22 Correct 9 ms 37468 KB Output is correct
23 Correct 10 ms 37468 KB Output is correct
24 Correct 9 ms 37476 KB Output is correct
25 Correct 88 ms 40532 KB Output is correct
26 Correct 21 ms 38088 KB Output is correct
27 Correct 106 ms 41668 KB Output is correct
28 Correct 119 ms 41812 KB Output is correct
29 Correct 77 ms 40532 KB Output is correct
30 Correct 74 ms 40312 KB Output is correct
31 Correct 117 ms 41088 KB Output is correct
32 Correct 106 ms 41676 KB Output is correct
33 Correct 100 ms 41552 KB Output is correct
34 Correct 58 ms 39504 KB Output is correct
35 Correct 105 ms 41648 KB Output is correct
36 Correct 106 ms 41684 KB Output is correct
37 Correct 65 ms 39504 KB Output is correct
38 Correct 118 ms 40876 KB Output is correct
39 Correct 23 ms 37972 KB Output is correct
40 Correct 106 ms 40788 KB Output is correct
41 Correct 82 ms 39828 KB Output is correct
42 Correct 112 ms 40868 KB Output is correct
43 Correct 44 ms 38484 KB Output is correct
44 Correct 107 ms 40880 KB Output is correct
45 Correct 26 ms 37980 KB Output is correct
46 Correct 118 ms 40788 KB Output is correct
47 Correct 36 ms 38236 KB Output is correct
48 Correct 105 ms 40788 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 42064 KB Output is correct
2 Correct 218 ms 41808 KB Output is correct
3 Correct 158 ms 42580 KB Output is correct
4 Correct 213 ms 41720 KB Output is correct
5 Correct 115 ms 41936 KB Output is correct
6 Correct 216 ms 41552 KB Output is correct
7 Correct 189 ms 41940 KB Output is correct
8 Correct 223 ms 41892 KB Output is correct
9 Correct 40 ms 38744 KB Output is correct
10 Correct 263 ms 41724 KB Output is correct
11 Correct 142 ms 42680 KB Output is correct
12 Correct 208 ms 41556 KB Output is correct
13 Correct 170 ms 39172 KB Output is correct
14 Correct 163 ms 39420 KB Output is correct
15 Correct 181 ms 39712 KB Output is correct
16 Correct 174 ms 39764 KB Output is correct
17 Correct 177 ms 39372 KB Output is correct
18 Correct 173 ms 39924 KB Output is correct
19 Correct 167 ms 38996 KB Output is correct
20 Correct 159 ms 39356 KB Output is correct
21 Correct 145 ms 39244 KB Output is correct
22 Correct 157 ms 39356 KB Output is correct
23 Correct 162 ms 39188 KB Output is correct
24 Correct 165 ms 39376 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 37464 KB Output is correct
2 Correct 9 ms 37468 KB Output is correct
3 Correct 10 ms 37468 KB Output is correct
4 Correct 9 ms 37508 KB Output is correct
5 Correct 9 ms 37468 KB Output is correct
6 Correct 9 ms 37468 KB Output is correct
7 Correct 10 ms 37468 KB Output is correct
8 Correct 10 ms 37468 KB Output is correct
9 Correct 9 ms 37464 KB Output is correct
10 Correct 9 ms 37468 KB Output is correct
11 Correct 9 ms 37468 KB Output is correct
12 Correct 9 ms 37468 KB Output is correct
13 Correct 10 ms 37468 KB Output is correct
14 Correct 10 ms 37564 KB Output is correct
15 Correct 9 ms 37468 KB Output is correct
16 Correct 11 ms 37468 KB Output is correct
17 Correct 9 ms 37468 KB Output is correct
18 Correct 10 ms 37468 KB Output is correct
19 Correct 9 ms 37468 KB Output is correct
20 Correct 9 ms 37512 KB Output is correct
21 Correct 10 ms 37468 KB Output is correct
22 Correct 9 ms 37468 KB Output is correct
23 Correct 10 ms 37468 KB Output is correct
24 Correct 9 ms 37476 KB Output is correct
25 Correct 88 ms 40532 KB Output is correct
26 Correct 21 ms 38088 KB Output is correct
27 Correct 106 ms 41668 KB Output is correct
28 Correct 119 ms 41812 KB Output is correct
29 Correct 77 ms 40532 KB Output is correct
30 Correct 74 ms 40312 KB Output is correct
31 Correct 117 ms 41088 KB Output is correct
32 Correct 106 ms 41676 KB Output is correct
33 Correct 100 ms 41552 KB Output is correct
34 Correct 58 ms 39504 KB Output is correct
35 Correct 105 ms 41648 KB Output is correct
36 Correct 106 ms 41684 KB Output is correct
37 Correct 65 ms 39504 KB Output is correct
38 Correct 118 ms 40876 KB Output is correct
39 Correct 23 ms 37972 KB Output is correct
40 Correct 106 ms 40788 KB Output is correct
41 Correct 82 ms 39828 KB Output is correct
42 Correct 112 ms 40868 KB Output is correct
43 Correct 44 ms 38484 KB Output is correct
44 Correct 107 ms 40880 KB Output is correct
45 Correct 26 ms 37980 KB Output is correct
46 Correct 118 ms 40788 KB Output is correct
47 Correct 36 ms 38236 KB Output is correct
48 Correct 105 ms 40788 KB Output is correct
49 Correct 197 ms 42064 KB Output is correct
50 Correct 218 ms 41808 KB Output is correct
51 Correct 158 ms 42580 KB Output is correct
52 Correct 213 ms 41720 KB Output is correct
53 Correct 115 ms 41936 KB Output is correct
54 Correct 216 ms 41552 KB Output is correct
55 Correct 189 ms 41940 KB Output is correct
56 Correct 223 ms 41892 KB Output is correct
57 Correct 40 ms 38744 KB Output is correct
58 Correct 263 ms 41724 KB Output is correct
59 Correct 142 ms 42680 KB Output is correct
60 Correct 208 ms 41556 KB Output is correct
61 Correct 170 ms 39172 KB Output is correct
62 Correct 163 ms 39420 KB Output is correct
63 Correct 181 ms 39712 KB Output is correct
64 Correct 174 ms 39764 KB Output is correct
65 Correct 177 ms 39372 KB Output is correct
66 Correct 173 ms 39924 KB Output is correct
67 Correct 167 ms 38996 KB Output is correct
68 Correct 159 ms 39356 KB Output is correct
69 Correct 145 ms 39244 KB Output is correct
70 Correct 157 ms 39356 KB Output is correct
71 Correct 162 ms 39188 KB Output is correct
72 Correct 165 ms 39376 KB Output is correct
73 Correct 335 ms 46292 KB Output is correct
74 Correct 229 ms 42148 KB Output is correct
75 Correct 329 ms 47812 KB Output is correct
76 Correct 360 ms 47412 KB Output is correct
77 Correct 213 ms 45648 KB Output is correct
78 Correct 307 ms 45744 KB Output is correct
79 Correct 375 ms 47640 KB Output is correct
80 Correct 356 ms 47256 KB Output is correct
81 Correct 156 ms 43344 KB Output is correct
82 Correct 348 ms 44620 KB Output is correct
83 Correct 300 ms 47804 KB Output is correct
84 Correct 403 ms 47260 KB Output is correct
85 Correct 277 ms 42024 KB Output is correct
86 Correct 316 ms 43768 KB Output is correct
87 Correct 221 ms 40312 KB Output is correct
88 Correct 337 ms 44456 KB Output is correct
89 Correct 301 ms 42968 KB Output is correct
90 Correct 329 ms 44372 KB Output is correct
91 Correct 250 ms 40812 KB Output is correct
92 Correct 315 ms 43804 KB Output is correct
93 Correct 181 ms 40248 KB Output is correct
94 Correct 312 ms 44044 KB Output is correct
95 Correct 206 ms 40636 KB Output is correct
96 Correct 371 ms 43968 KB Output is correct