oj.uz

답안 #917350

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
917350 2024-01-27T23:06:01 Z amirhoseinfar1385 Two Antennas (JOI19_antennas) C++17
100 / 100
 372 ms 47956 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#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

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 37464 KB Output is correct
2 Correct 10 ms 37468 KB Output is correct
3 Correct 10 ms 37724 KB Output is correct
4 Correct 10 ms 37468 KB Output is correct
5 Correct 10 ms 37468 KB Output is correct
6 Correct 10 ms 37500 KB Output is correct
7 Correct 10 ms 37468 KB Output is correct
8 Correct 11 ms 37468 KB Output is correct
9 Correct 10 ms 37468 KB Output is correct
10 Correct 11 ms 37468 KB Output is correct
11 Correct 10 ms 37468 KB Output is correct
12 Correct 10 ms 37468 KB Output is correct
13 Correct 10 ms 37464 KB Output is correct
14 Correct 11 ms 37464 KB Output is correct
15 Correct 10 ms 37468 KB Output is correct
16 Correct 10 ms 37468 KB Output is correct
17 Correct 11 ms 37464 KB Output is correct
18 Correct 10 ms 37468 KB Output is correct
19 Correct 10 ms 37468 KB Output is correct
20 Correct 10 ms 37464 KB Output is correct
21 Correct 10 ms 37468 KB Output is correct
22 Correct 10 ms 37468 KB Output is correct
23 Correct 10 ms 37464 KB Output is correct
24 Correct 9 ms 37492 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 37464 KB Output is correct
2 Correct 10 ms 37468 KB Output is correct
3 Correct 10 ms 37724 KB Output is correct
4 Correct 10 ms 37468 KB Output is correct
5 Correct 10 ms 37468 KB Output is correct
6 Correct 10 ms 37500 KB Output is correct
7 Correct 10 ms 37468 KB Output is correct
8 Correct 11 ms 37468 KB Output is correct
9 Correct 10 ms 37468 KB Output is correct
10 Correct 11 ms 37468 KB Output is correct
11 Correct 10 ms 37468 KB Output is correct
12 Correct 10 ms 37468 KB Output is correct
13 Correct 10 ms 37464 KB Output is correct
14 Correct 11 ms 37464 KB Output is correct
15 Correct 10 ms 37468 KB Output is correct
16 Correct 10 ms 37468 KB Output is correct
17 Correct 11 ms 37464 KB Output is correct
18 Correct 10 ms 37468 KB Output is correct
19 Correct 10 ms 37468 KB Output is correct
20 Correct 10 ms 37464 KB Output is correct
21 Correct 10 ms 37468 KB Output is correct
22 Correct 10 ms 37468 KB Output is correct
23 Correct 10 ms 37464 KB Output is correct
24 Correct 9 ms 37492 KB Output is correct
25 Correct 71 ms 40728 KB Output is correct
26 Correct 19 ms 37720 KB Output is correct
27 Correct 102 ms 41900 KB Output is correct
28 Correct 97 ms 41808 KB Output is correct
29 Correct 73 ms 40476 KB Output is correct
30 Correct 69 ms 40276 KB Output is correct
31 Correct 86 ms 41088 KB Output is correct
32 Correct 99 ms 41668 KB Output is correct
33 Correct 90 ms 41552 KB Output is correct
34 Correct 55 ms 39588 KB Output is correct
35 Correct 102 ms 41620 KB Output is correct
36 Correct 96 ms 41808 KB Output is correct
37 Correct 61 ms 39296 KB Output is correct
38 Correct 99 ms 40872 KB Output is correct
39 Correct 23 ms 37976 KB Output is correct
40 Correct 125 ms 40676 KB Output is correct
41 Correct 73 ms 39884 KB Output is correct
42 Correct 97 ms 40784 KB Output is correct
43 Correct 39 ms 38732 KB Output is correct
44 Correct 95 ms 40872 KB Output is correct
45 Correct 26 ms 37984 KB Output is correct
46 Correct 96 ms 40884 KB Output is correct
47 Correct 37 ms 38236 KB Output is correct
48 Correct 121 ms 40892 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 169 ms 42076 KB Output is correct
2 Correct 190 ms 41720 KB Output is correct
3 Correct 150 ms 42580 KB Output is correct
4 Correct 212 ms 41724 KB Output is correct
5 Correct 100 ms 41820 KB Output is correct
6 Correct 211 ms 41808 KB Output is correct
7 Correct 168 ms 42104 KB Output is correct
8 Correct 190 ms 41728 KB Output is correct
9 Correct 37 ms 38744 KB Output is correct
10 Correct 203 ms 41948 KB Output is correct
11 Correct 131 ms 42480 KB Output is correct
12 Correct 186 ms 41552 KB Output is correct
13 Correct 153 ms 39356 KB Output is correct
14 Correct 166 ms 39416 KB Output is correct
15 Correct 137 ms 39504 KB Output is correct
16 Correct 152 ms 39760 KB Output is correct
17 Correct 152 ms 39384 KB Output is correct
18 Correct 147 ms 39764 KB Output is correct
19 Correct 145 ms 39208 KB Output is correct
20 Correct 137 ms 39452 KB Output is correct
21 Correct 125 ms 39224 KB Output is correct
22 Correct 134 ms 39536 KB Output is correct
23 Correct 141 ms 39212 KB Output is correct
24 Correct 144 ms 39356 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 37464 KB Output is correct
2 Correct 10 ms 37468 KB Output is correct
3 Correct 10 ms 37724 KB Output is correct
4 Correct 10 ms 37468 KB Output is correct
5 Correct 10 ms 37468 KB Output is correct
6 Correct 10 ms 37500 KB Output is correct
7 Correct 10 ms 37468 KB Output is correct
8 Correct 11 ms 37468 KB Output is correct
9 Correct 10 ms 37468 KB Output is correct
10 Correct 11 ms 37468 KB Output is correct
11 Correct 10 ms 37468 KB Output is correct
12 Correct 10 ms 37468 KB Output is correct
13 Correct 10 ms 37464 KB Output is correct
14 Correct 11 ms 37464 KB Output is correct
15 Correct 10 ms 37468 KB Output is correct
16 Correct 10 ms 37468 KB Output is correct
17 Correct 11 ms 37464 KB Output is correct
18 Correct 10 ms 37468 KB Output is correct
19 Correct 10 ms 37468 KB Output is correct
20 Correct 10 ms 37464 KB Output is correct
21 Correct 10 ms 37468 KB Output is correct
22 Correct 10 ms 37468 KB Output is correct
23 Correct 10 ms 37464 KB Output is correct
24 Correct 9 ms 37492 KB Output is correct
25 Correct 71 ms 40728 KB Output is correct
26 Correct 19 ms 37720 KB Output is correct
27 Correct 102 ms 41900 KB Output is correct
28 Correct 97 ms 41808 KB Output is correct
29 Correct 73 ms 40476 KB Output is correct
30 Correct 69 ms 40276 KB Output is correct
31 Correct 86 ms 41088 KB Output is correct
32 Correct 99 ms 41668 KB Output is correct
33 Correct 90 ms 41552 KB Output is correct
34 Correct 55 ms 39588 KB Output is correct
35 Correct 102 ms 41620 KB Output is correct
36 Correct 96 ms 41808 KB Output is correct
37 Correct 61 ms 39296 KB Output is correct
38 Correct 99 ms 40872 KB Output is correct
39 Correct 23 ms 37976 KB Output is correct
40 Correct 125 ms 40676 KB Output is correct
41 Correct 73 ms 39884 KB Output is correct
42 Correct 97 ms 40784 KB Output is correct
43 Correct 39 ms 38732 KB Output is correct
44 Correct 95 ms 40872 KB Output is correct
45 Correct 26 ms 37984 KB Output is correct
46 Correct 96 ms 40884 KB Output is correct
47 Correct 37 ms 38236 KB Output is correct
48 Correct 121 ms 40892 KB Output is correct
49 Correct 169 ms 42076 KB Output is correct
50 Correct 190 ms 41720 KB Output is correct
51 Correct 150 ms 42580 KB Output is correct
52 Correct 212 ms 41724 KB Output is correct
53 Correct 100 ms 41820 KB Output is correct
54 Correct 211 ms 41808 KB Output is correct
55 Correct 168 ms 42104 KB Output is correct
56 Correct 190 ms 41728 KB Output is correct
57 Correct 37 ms 38744 KB Output is correct
58 Correct 203 ms 41948 KB Output is correct
59 Correct 131 ms 42480 KB Output is correct
60 Correct 186 ms 41552 KB Output is correct
61 Correct 153 ms 39356 KB Output is correct
62 Correct 166 ms 39416 KB Output is correct
63 Correct 137 ms 39504 KB Output is correct
64 Correct 152 ms 39760 KB Output is correct
65 Correct 152 ms 39384 KB Output is correct
66 Correct 147 ms 39764 KB Output is correct
67 Correct 145 ms 39208 KB Output is correct
68 Correct 137 ms 39452 KB Output is correct
69 Correct 125 ms 39224 KB Output is correct
70 Correct 134 ms 39536 KB Output is correct
71 Correct 141 ms 39212 KB Output is correct
72 Correct 144 ms 39356 KB Output is correct
73 Correct 325 ms 46424 KB Output is correct
74 Correct 219 ms 42324 KB Output is correct
75 Correct 280 ms 47824 KB Output is correct
76 Correct 346 ms 47372 KB Output is correct
77 Correct 209 ms 45728 KB Output is correct
78 Correct 293 ms 45660 KB Output is correct
79 Correct 354 ms 47560 KB Output is correct
80 Correct 372 ms 47440 KB Output is correct
81 Correct 142 ms 43348 KB Output is correct
82 Correct 281 ms 44648 KB Output is correct
83 Correct 264 ms 47956 KB Output is correct
84 Correct 335 ms 47188 KB Output is correct
85 Correct 237 ms 42076 KB Output is correct
86 Correct 304 ms 43772 KB Output is correct
87 Correct 185 ms 40312 KB Output is correct
88 Correct 315 ms 44460 KB Output is correct
89 Correct 274 ms 42788 KB Output is correct
90 Correct 305 ms 44368 KB Output is correct
91 Correct 195 ms 41036 KB Output is correct
92 Correct 295 ms 43884 KB Output is correct
93 Correct 158 ms 40188 KB Output is correct
94 Correct 330 ms 43852 KB Output is correct
95 Correct 180 ms 40808 KB Output is correct
96 Correct 285 ms 43984 KB Output is correct