oj.uz

Submission #391233

# Submission time Handle Problem Language Result Execution time Memory
391233 2021-04-18T09:34:55 Z kshitij_sodani Two Antennas (JOI19_antennas) C++14
100 / 100
 1137 ms 50932 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'

llo n,q;
llo it[200001];
llo aa[200001];
llo bb[200001];

llo tree[4*200001];
llo tree2[4*200001];
llo lazy[4*200001];
vector<pair<llo,llo>> pre[200001];
vector<llo> pre2[200001];
vector<llo> pre3[200001];
llo ans[200001];
void push(llo no,llo l,llo r){
	tree2[no]=max(tree2[no],tree[no]-lazy[no]);
	/*if(tree[no]==10 and lazy[no]==1){
		cout<<no<<"."<<l<<"."<<r<<endl;
	}*/
	if(l<r){
		lazy[no*2+1]=min(lazy[no*2+1],lazy[no]);
		lazy[no*2+2]=min(lazy[no*2+2],lazy[no]);
	}
	lazy[no]=(llo)1e18;
}
void update(llo no,llo l,llo r,llo i,llo val){
	push(no,l,r);
	if(l==r){
		tree[no]=val;
	//	lazy[no]=(llo)1e18;
	}
	else{
		llo mid=(l+r)/2;
		if(i<=mid){
			update(no*2+1,l,mid,i,val);
			push(no*2+2,mid+1,r);
		}
		else{
			update(no*2+2,mid+1,r,i,val);
			push(no*2+1,l,mid);
		}
		tree[no]=max(tree[no*2+1],tree[no*2+2]);
		tree2[no]=max(tree2[no*2+1],tree2[no*2+2]);

	}
}
void update2(llo no,llo l,llo r,llo aa,llo bb,llo val){
	push(no,l,r);
	if(r<aa or l>bb){
		return;
	}
	if(aa<=l and r<=bb){
		lazy[no]=min(lazy[no],val);
		push(no,l,r);
	}
	else{
		llo mid=(l+r)/2;
		update2(no*2+1,l,mid,aa,bb,val);
		update2(no*2+2,mid+1,r,aa,bb,val);
		tree[no]=max(tree[no*2+1],tree[no*2+2]);
		tree2[no]=max(tree2[no*2+1],tree2[no*2+2]);
	}
}
llo query(llo no,llo l,llo r,llo aa,llo bb){
	push(no,l,r);
	if(r<aa or l>bb){
		return -1;
	}
	if(aa<=l and r<=bb){
		return tree2[no];
	}
	else{
		llo mid=(l+r)/2;
		llo x=query(no*2+1,l,mid,aa,bb);
		llo y=query(no*2+2,mid+1,r,aa,bb);
		tree[no]=max(tree[no*2+1],tree[no*2+2]);
		tree2[no]=max(tree2[no*2+1],tree2[no*2+2]);
		return max(x,y);
	}
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;
	for(llo i=0;i<n;i++){
		cin>>it[i]>>aa[i]>>bb[i];
		it[i]=-it[i];
		if(i+aa[i]<n){
			pre2[i+aa[i]].pb(i);
		}
		if(i+bb[i]<n){
			pre3[i+bb[i]].pb(i);
		}
	}
	cin>>q;
	for(llo i=0;i<q;i++){
		llo l,r;
		cin>>l>>r;
		l--;
		r--;
		pre[r].pb({l,i});
		ans[i]=-1;
	}

	for(llo i=0;i<4*n;i++){
		tree[i]=-(llo)1e18;
		tree2[i]=-1;
		lazy[i]=(llo)1e18;
	}
	for(llo i=0;i<n;i++){
		for(auto j:pre2[i]){
			//cout<<i<<":"<<j<<endl;
			update(0,0,n-1,j,it[j]);
		}
		if(i-aa[i]>=0){
			//cout<<max(i-bb[i],(llo)0)<<"<"<<i-aa[i]<<"<"<<it[i]<<endl;
			update2(0,0,n-1,max(i-bb[i],(llo)0),i-aa[i],it[i]);
		}
		//cout<<query(0,0,n-1,0,n-1)<<endl;
		for(auto j:pre[i]){
			ans[j.b]=query(0,0,n-1,j.a,i);
		}
		for(auto j:pre3[i]){
			//cout<<i<<",,"<<j<<endl;
			update(0,0,n-1,j,-(llo)1e18);
		}
	}
	for(int i=0;i<n;i++){
		it[i]=-it[i];
	}
	for(llo i=0;i<4*n;i++){
		tree[i]=-(llo)1e18;
		tree2[i]=-1;
		lazy[i]=(llo)1e18;
	}
	for(llo i=0;i<n;i++){
		for(auto j:pre2[i]){
			//cout<<i<<":"<<j<<endl;
			update(0,0,n-1,j,it[j]);
		}
		if(i-aa[i]>=0){
			//cout<<max(i-bb[i],(llo)0)<<"<"<<i-aa[i]<<"<"<<it[i]<<endl;
			update2(0,0,n-1,max(i-bb[i],(llo)0),i-aa[i],it[i]);
		}
		//cout<<query(0,0,n-1,0,n-1)<<endl;
		for(auto j:pre[i]){
			ans[j.b]=max(ans[j.b],query(0,0,n-1,j.a,i));
		}
		for(auto j:pre3[i]){
			//cout<<i<<",,"<<j<<endl;
			update(0,0,n-1,j,-(llo)1e18);
		}
	}
	for(llo i=0;i<q;i++){
		cout<<ans[i]<<endl;
	}






 
 
	return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14412 KB Output is correct
2 Correct 10 ms 14412 KB Output is correct
3 Correct 10 ms 14444 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 10 ms 14448 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 10 ms 14480 KB Output is correct
8 Correct 11 ms 14408 KB Output is correct
9 Correct 10 ms 14424 KB Output is correct
10 Correct 10 ms 14412 KB Output is correct
11 Correct 10 ms 14412 KB Output is correct
12 Correct 10 ms 14412 KB Output is correct
13 Correct 10 ms 14428 KB Output is correct
14 Correct 10 ms 14412 KB Output is correct
15 Correct 10 ms 14468 KB Output is correct
16 Correct 10 ms 14460 KB Output is correct
17 Correct 10 ms 14412 KB Output is correct
18 Correct 11 ms 14420 KB Output is correct
19 Correct 10 ms 14456 KB Output is correct
20 Correct 10 ms 14412 KB Output is correct
21 Correct 10 ms 14428 KB Output is correct
22 Correct 10 ms 14412 KB Output is correct
23 Correct 10 ms 14412 KB Output is correct
24 Correct 10 ms 14424 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14412 KB Output is correct
2 Correct 10 ms 14412 KB Output is correct
3 Correct 10 ms 14444 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 10 ms 14448 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 10 ms 14480 KB Output is correct
8 Correct 11 ms 14408 KB Output is correct
9 Correct 10 ms 14424 KB Output is correct
10 Correct 10 ms 14412 KB Output is correct
11 Correct 10 ms 14412 KB Output is correct
12 Correct 10 ms 14412 KB Output is correct
13 Correct 10 ms 14428 KB Output is correct
14 Correct 10 ms 14412 KB Output is correct
15 Correct 10 ms 14468 KB Output is correct
16 Correct 10 ms 14460 KB Output is correct
17 Correct 10 ms 14412 KB Output is correct
18 Correct 11 ms 14420 KB Output is correct
19 Correct 10 ms 14456 KB Output is correct
20 Correct 10 ms 14412 KB Output is correct
21 Correct 10 ms 14428 KB Output is correct
22 Correct 10 ms 14412 KB Output is correct
23 Correct 10 ms 14412 KB Output is correct
24 Correct 10 ms 14424 KB Output is correct
25 Correct 164 ms 21028 KB Output is correct
26 Correct 32 ms 15552 KB Output is correct
27 Correct 245 ms 23448 KB Output is correct
28 Correct 254 ms 23504 KB Output is correct
29 Correct 168 ms 21056 KB Output is correct
30 Correct 170 ms 20764 KB Output is correct
31 Correct 183 ms 22468 KB Output is correct
32 Correct 256 ms 23468 KB Output is correct
33 Correct 229 ms 22980 KB Output is correct
34 Correct 129 ms 19336 KB Output is correct
35 Correct 241 ms 23380 KB Output is correct
36 Correct 256 ms 23532 KB Output is correct
37 Correct 149 ms 19488 KB Output is correct
38 Correct 246 ms 22468 KB Output is correct
39 Correct 48 ms 15860 KB Output is correct
40 Correct 245 ms 22488 KB Output is correct
41 Correct 196 ms 20620 KB Output is correct
42 Correct 252 ms 22724 KB Output is correct
43 Correct 88 ms 17604 KB Output is correct
44 Correct 249 ms 22596 KB Output is correct
45 Correct 58 ms 16216 KB Output is correct
46 Correct 248 ms 22624 KB Output is correct
47 Correct 73 ms 16944 KB Output is correct
48 Correct 299 ms 22596 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 489 ms 38872 KB Output is correct
2 Correct 562 ms 41536 KB Output is correct
3 Correct 360 ms 33480 KB Output is correct
4 Correct 560 ms 41492 KB Output is correct
5 Correct 210 ms 26960 KB Output is correct
6 Correct 554 ms 41508 KB Output is correct
7 Correct 463 ms 37944 KB Output is correct
8 Correct 609 ms 42872 KB Output is correct
9 Correct 66 ms 19400 KB Output is correct
10 Correct 557 ms 42916 KB Output is correct
11 Correct 312 ms 32760 KB Output is correct
12 Correct 557 ms 42820 KB Output is correct
13 Correct 415 ms 41368 KB Output is correct
14 Correct 384 ms 41384 KB Output is correct
15 Correct 382 ms 41352 KB Output is correct
16 Correct 314 ms 41732 KB Output is correct
17 Correct 409 ms 41392 KB Output is correct
18 Correct 365 ms 41884 KB Output is correct
19 Correct 388 ms 41004 KB Output is correct
20 Correct 380 ms 41520 KB Output is correct
21 Correct 392 ms 41148 KB Output is correct
22 Correct 400 ms 41284 KB Output is correct
23 Correct 396 ms 41204 KB Output is correct
24 Correct 315 ms 41144 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14412 KB Output is correct
2 Correct 10 ms 14412 KB Output is correct
3 Correct 10 ms 14444 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 10 ms 14448 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 10 ms 14480 KB Output is correct
8 Correct 11 ms 14408 KB Output is correct
9 Correct 10 ms 14424 KB Output is correct
10 Correct 10 ms 14412 KB Output is correct
11 Correct 10 ms 14412 KB Output is correct
12 Correct 10 ms 14412 KB Output is correct
13 Correct 10 ms 14428 KB Output is correct
14 Correct 10 ms 14412 KB Output is correct
15 Correct 10 ms 14468 KB Output is correct
16 Correct 10 ms 14460 KB Output is correct
17 Correct 10 ms 14412 KB Output is correct
18 Correct 11 ms 14420 KB Output is correct
19 Correct 10 ms 14456 KB Output is correct
20 Correct 10 ms 14412 KB Output is correct
21 Correct 10 ms 14428 KB Output is correct
22 Correct 10 ms 14412 KB Output is correct
23 Correct 10 ms 14412 KB Output is correct
24 Correct 10 ms 14424 KB Output is correct
25 Correct 164 ms 21028 KB Output is correct
26 Correct 32 ms 15552 KB Output is correct
27 Correct 245 ms 23448 KB Output is correct
28 Correct 254 ms 23504 KB Output is correct
29 Correct 168 ms 21056 KB Output is correct
30 Correct 170 ms 20764 KB Output is correct
31 Correct 183 ms 22468 KB Output is correct
32 Correct 256 ms 23468 KB Output is correct
33 Correct 229 ms 22980 KB Output is correct
34 Correct 129 ms 19336 KB Output is correct
35 Correct 241 ms 23380 KB Output is correct
36 Correct 256 ms 23532 KB Output is correct
37 Correct 149 ms 19488 KB Output is correct
38 Correct 246 ms 22468 KB Output is correct
39 Correct 48 ms 15860 KB Output is correct
40 Correct 245 ms 22488 KB Output is correct
41 Correct 196 ms 20620 KB Output is correct
42 Correct 252 ms 22724 KB Output is correct
43 Correct 88 ms 17604 KB Output is correct
44 Correct 249 ms 22596 KB Output is correct
45 Correct 58 ms 16216 KB Output is correct
46 Correct 248 ms 22624 KB Output is correct
47 Correct 73 ms 16944 KB Output is correct
48 Correct 299 ms 22596 KB Output is correct
49 Correct 489 ms 38872 KB Output is correct
50 Correct 562 ms 41536 KB Output is correct
51 Correct 360 ms 33480 KB Output is correct
52 Correct 560 ms 41492 KB Output is correct
53 Correct 210 ms 26960 KB Output is correct
54 Correct 554 ms 41508 KB Output is correct
55 Correct 463 ms 37944 KB Output is correct
56 Correct 609 ms 42872 KB Output is correct
57 Correct 66 ms 19400 KB Output is correct
58 Correct 557 ms 42916 KB Output is correct
59 Correct 312 ms 32760 KB Output is correct
60 Correct 557 ms 42820 KB Output is correct
61 Correct 415 ms 41368 KB Output is correct
62 Correct 384 ms 41384 KB Output is correct
63 Correct 382 ms 41352 KB Output is correct
64 Correct 314 ms 41732 KB Output is correct
65 Correct 409 ms 41392 KB Output is correct
66 Correct 365 ms 41884 KB Output is correct
67 Correct 388 ms 41004 KB Output is correct
68 Correct 380 ms 41520 KB Output is correct
69 Correct 392 ms 41148 KB Output is correct
70 Correct 400 ms 41284 KB Output is correct
71 Correct 396 ms 41204 KB Output is correct
72 Correct 315 ms 41144 KB Output is correct
73 Correct 920 ms 45976 KB Output is correct
74 Correct 612 ms 42912 KB Output is correct
75 Correct 882 ms 42748 KB Output is correct
76 Correct 1134 ms 50916 KB Output is correct
77 Correct 566 ms 33904 KB Output is correct
78 Correct 946 ms 48148 KB Output is correct
79 Correct 1051 ms 47180 KB Output is correct
80 Correct 1137 ms 50884 KB Output is correct
81 Correct 428 ms 27424 KB Output is correct
82 Correct 828 ms 46660 KB Output is correct
83 Correct 825 ms 40644 KB Output is correct
84 Correct 1124 ms 50932 KB Output is correct
85 Correct 764 ms 44896 KB Output is correct
86 Correct 983 ms 48144 KB Output is correct
87 Correct 480 ms 41700 KB Output is correct
88 Correct 894 ms 48704 KB Output is correct
89 Correct 834 ms 46140 KB Output is correct
90 Correct 957 ms 48708 KB Output is correct
91 Correct 596 ms 42932 KB Output is correct
92 Correct 962 ms 48048 KB Output is correct
93 Correct 504 ms 41744 KB Output is correct
94 Correct 1022 ms 48048 KB Output is correct
95 Correct 543 ms 42292 KB Output is correct
96 Correct 983 ms 47852 KB Output is correct