oj.uz

Submission #406194

# Submission time Handle Problem Language Result Execution time Memory
406194 2021-05-17T09:19:52 Z kshitij_sodani New Home (APIO18_new_home) C++14
47 / 100
 5000 ms 673044 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'
int n,k,q;
int ans[300001];
set<int> pre[300001];
map<int,int> pre2[300001];
bool vis[3000001];
map<pair<int,pair<int,int>>,int> xx;
map<pair<int,pair<int,int>>,int> xx2;
map<int,int> ss;
map<int,int> ss2;
vector<pair<int,int>> yy;

int ne=0;
int nn;
pair<int,int> solve(int i,int j){
	pair<int,int> ac={i,0};
	pair<int,int> ac2={j+1,0};
	return {lower_bound(yy.begin(),yy.end(),ac)-yy.begin(),lower_bound(yy.begin(),yy.end(),ac2)-yy.begin()-1};
}
priority_queue<pair<int,int>> tree[4*800001];
priority_queue<pair<int,int>> tree2[4*800001];
int kk=1;
//int ans[300001];
void update(int no,int l,int r,int aa,int bb,pair<int,int> x,int st){
	/*if(no==0){
		cout<<aa<<":"<<bb<<":"<<x.a<<":"<<x.b<<endl;
	}*/
	
	if(r<aa or l>bb){
		return;
	}
	if(aa<=l and r<=bb){
		//cout<<l<<",,"<<r<<endl;
		if(kk){
			if(false){//tree[no].size()){
				pair<int,int> ma=tree[no].top();
				tree[no].pop();
				tree[no].push(max(ma,x));
				 ma=tree2[no].top();
				tree2[no].pop();
				tree2[no].push(max(ma,{-x.a,x.b}));
			}
			else{
				tree[no].push(x);

				tree2[no].push({-x.a,x.b});

			}
			return ;
		}
		tree[no].push(x);

		tree2[no].push({-x.a,x.b});


	}
	else{
		int mid=(l+r)/2;
		update(no*2+1,l,mid,aa,bb,x,st);
		update(no*2+2,mid+1,r,aa,bb,x,st);
	}
}
int query(int no,int l,int r,int i){
	int cur=0;
	while(tree[no].size()){
		if(vis[(tree[no].top()).b]){
			tree[no].pop();

		}
		else{
			break;
		}
	}
	while(tree2[no].size()){
		if(vis[(tree2[no].top()).b]){
			tree2[no].pop();
			
		}
		else{
			break;
		}
	}

	if(tree[no].size()){
		//cout<<l<<","<<r<<","<<yy[i].a<<endl;
		cur=max(cur,abs((tree[no].top()).a-yy[i].a));
		
		cur=max(cur,abs(-(tree2[no].top()).a-yy[i].a));
	}
	if(l<r){
		int mid=(l+r)/2;
		if(i<=mid){
			cur=max(cur,query(no*2+1,l,mid,i));
		}
		else{
			cur=max(cur,query(no*2+2,mid+1,r,i));
		}
	}
	return cur;

}
void add(int i,int aa,int bb,int st){
	int mid=(aa+bb)/2;
	if(st==1){
		xx[{i,{aa,mid}}]=ne;
		
		pair<int,int> ind=solve(aa,mid);

		update(0,0,nn-1,ind.a,ind.b,{aa,ne},0);
		ne++;
		xx[{i,{mid+1,bb}}]=ne;
		ind=solve(mid+1,bb);
		update(0,0,nn-1,ind.a,ind.b,{bb,ne},1);
		ne++;
	}
	else{
		vis[xx[{i,{aa,mid}}]]=1;
		vis[xx[{i,{mid+1,bb}}]]=1;
	}
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>k>>q;

	vector<pair<pair<int,int>,pair<int,int>>> cur;
	vector<pair<int,int>> zz5;
	for(int i=0;i<n;i++){
		int x,aa,bb,tt;
		cin>>x>>tt>>aa>>bb;
		ss[x]++;
		tt--;
		if(aa!=1 or bb!=1e8){
			kk=0;
		}
		cur.pb({{aa,-1},{x,tt}});
		cur.pb({{bb,1},{x,tt}});
	//	pre[tt].insert(x);
		zz5.pb({tt,x});
	}
	if(kk){
		for(auto j:zz5){
			pre[j.a].insert(j.b);
		}
	}
	for(int i=0;i<q;i++){
		int x,aa;
		cin>>x>>aa;
		ss[x]++;
		cur.pb({{aa,0},{x,i}});
		/*if(kk){
			//pre[aa].insert(x);
		}*/
	}

	sort(cur.begin(),cur.end());
	int ind5=-1;
	
	ss[-2e8]++;
	
	ss[2e8]++;
	for(auto j:ss){
		ind5++;
		ss2[j.a]=ind5;
		yy.pb({j.a,ind5});
	}
	nn=yy.size();
	//sort(cur.begin(),cur.end());
/*	for(auto j:yy){
		cout<<j.a<<",";
	}
	cout<<endl;*/
	
	for(int i=0;i<k;i++){
		pre[i].insert(-2e8);
		pre2[i][-2e8]++;
		pre[i].insert(2e8);
		pre2[i][2e8]++;
		//if(kk==0){
		/*if(kk==0){
			add(i,-2e8,2e8,1);
		}*/

	//	xx[{i,{-2e8,2e8}}]=;
	//	update(0,0,nn-1,0,nn-1);
	}

	for(int i=0;i<k;i++){
		vector<int> xx;
		for(auto j:pre[i]){
			xx.pb(j);
		}
		for(int j=0;j+1<xx.size();j++){
			add(i,xx[j],xx[j+1],1);
			//cout<<i<<":"<<xx[j]<<":"<<xx[j+1]<<endl;
		}
	}

	for(auto j:cur){
		if(j.a.b==-1){
			//add
			if(kk){
				continue;
			}
			//continue;
			if(pre2[j.b.b].find(j.b.a)!=pre2[j.b.b].end()){
				if(pre2[j.b.b][j.b.a]>0){
					pre2[j.b.b][j.b.a]++;
					continue;
				}
			}
			//else{
				pre2[j.b.b][j.b.a]++;
				int re=*(pre[j.b.b].lower_bound(j.b.a));
				auto jj=pre[j.b.b].lower_bound(j.b.a);
				jj--;
				int le=*jj;
				pre[j.b.b].insert(j.b.a);
				add(j.b.b,le,re,0);
				add(j.b.b,le,j.b.a,1);
				add(j.b.b,j.b.a,re,1);
			//}
		}
		else if(j.a.b==1){
			//remove 
			if(kk){
				continue;
			}
			//continue;
			pre2[j.b.b][j.b.a]--;
			if(pre2[j.b.b][j.b.a]==0){
				pre[j.b.b].erase(j.b.a);
				int re=*(pre[j.b.b].lower_bound(j.b.a));
				auto jj=pre[j.b.b].lower_bound(j.b.a);
				jj--;
				int le=*jj;
				add(j.b.b,le,j.b.a,0);
				add(j.b.b,j.b.a,re,0);
				add(j.b.b,le,re,1);
				
			}
		}
		else{
			//cout<<j.b.a<<":"<<j.b.b<<endl;
			int ans2=query(0,0,nn-1,ss2[j.b.a]);
			if(ans2>1e8){
				ans2=-1;
			}
			ans[j.b.b]=ans2;
		}
	}
	for(int i=0;i<q;i++){
		cout<<ans[i]<<endl;
	}
	/*for(int i=0;i<cur.size();i++){
		cur[i].b.a=ss2[cur[i].b.a];
	}*/





	return 0;
}

Compilation message

new_home.cpp: In function 'int main()':
new_home.cpp:201:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  201 |   for(int j=0;j+1<xx.size();j++){
      |               ~~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 228932 KB Output is correct
2 Correct 121 ms 229028 KB Output is correct
3 Correct 123 ms 228892 KB Output is correct
4 Correct 123 ms 228908 KB Output is correct
5 Correct 124 ms 228980 KB Output is correct
6 Correct 125 ms 229376 KB Output is correct
7 Correct 137 ms 229660 KB Output is correct
8 Correct 123 ms 229556 KB Output is correct
9 Correct 126 ms 229716 KB Output is correct
10 Correct 133 ms 229372 KB Output is correct
11 Correct 123 ms 229408 KB Output is correct
12 Correct 135 ms 229376 KB Output is correct
13 Correct 126 ms 229588 KB Output is correct
14 Correct 132 ms 229416 KB Output is correct
15 Correct 126 ms 229576 KB Output is correct
16 Correct 120 ms 229548 KB Output is correct
17 Correct 131 ms 229508 KB Output is correct
18 Correct 128 ms 229532 KB Output is correct
19 Correct 131 ms 229668 KB Output is correct
20 Correct 133 ms 229432 KB Output is correct
21 Correct 120 ms 229172 KB Output is correct
22 Correct 127 ms 229700 KB Output is correct
23 Correct 125 ms 229612 KB Output is correct
24 Correct 121 ms 229620 KB Output is correct
25 Correct 126 ms 229444 KB Output is correct
26 Correct 127 ms 229352 KB Output is correct
27 Correct 120 ms 229148 KB Output is correct
28 Correct 119 ms 229444 KB Output is correct
29 Correct 123 ms 229460 KB Output is correct
30 Correct 119 ms 229232 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 228932 KB Output is correct
2 Correct 121 ms 229028 KB Output is correct
3 Correct 123 ms 228892 KB Output is correct
4 Correct 123 ms 228908 KB Output is correct
5 Correct 124 ms 228980 KB Output is correct
6 Correct 125 ms 229376 KB Output is correct
7 Correct 137 ms 229660 KB Output is correct
8 Correct 123 ms 229556 KB Output is correct
9 Correct 126 ms 229716 KB Output is correct
10 Correct 133 ms 229372 KB Output is correct
11 Correct 123 ms 229408 KB Output is correct
12 Correct 135 ms 229376 KB Output is correct
13 Correct 126 ms 229588 KB Output is correct
14 Correct 132 ms 229416 KB Output is correct
15 Correct 126 ms 229576 KB Output is correct
16 Correct 120 ms 229548 KB Output is correct
17 Correct 131 ms 229508 KB Output is correct
18 Correct 128 ms 229532 KB Output is correct
19 Correct 131 ms 229668 KB Output is correct
20 Correct 133 ms 229432 KB Output is correct
21 Correct 120 ms 229172 KB Output is correct
22 Correct 127 ms 229700 KB Output is correct
23 Correct 125 ms 229612 KB Output is correct
24 Correct 121 ms 229620 KB Output is correct
25 Correct 126 ms 229444 KB Output is correct
26 Correct 127 ms 229352 KB Output is correct
27 Correct 120 ms 229148 KB Output is correct
28 Correct 119 ms 229444 KB Output is correct
29 Correct 123 ms 229460 KB Output is correct
30 Correct 119 ms 229232 KB Output is correct
31 Correct 2615 ms 350592 KB Output is correct
32 Correct 188 ms 234832 KB Output is correct
33 Correct 2056 ms 313388 KB Output is correct
34 Correct 2670 ms 352616 KB Output is correct
35 Correct 2474 ms 337976 KB Output is correct
36 Correct 1918 ms 311788 KB Output is correct
37 Correct 1659 ms 318092 KB Output is correct
38 Correct 1334 ms 301736 KB Output is correct
39 Correct 1059 ms 306296 KB Output is correct
40 Correct 1178 ms 301880 KB Output is correct
41 Correct 2628 ms 332772 KB Output is correct
42 Correct 2588 ms 336024 KB Output is correct
43 Correct 188 ms 234632 KB Output is correct
44 Correct 2466 ms 331372 KB Output is correct
45 Correct 2371 ms 323664 KB Output is correct
46 Correct 2252 ms 312456 KB Output is correct
47 Correct 1195 ms 326144 KB Output is correct
48 Correct 1151 ms 324036 KB Output is correct
49 Correct 1341 ms 328512 KB Output is correct
50 Correct 1568 ms 341016 KB Output is correct
51 Correct 1387 ms 323380 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5086 ms 615932 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5113 ms 673044 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 228932 KB Output is correct
2 Correct 121 ms 229028 KB Output is correct
3 Correct 123 ms 228892 KB Output is correct
4 Correct 123 ms 228908 KB Output is correct
5 Correct 124 ms 228980 KB Output is correct
6 Correct 125 ms 229376 KB Output is correct
7 Correct 137 ms 229660 KB Output is correct
8 Correct 123 ms 229556 KB Output is correct
9 Correct 126 ms 229716 KB Output is correct
10 Correct 133 ms 229372 KB Output is correct
11 Correct 123 ms 229408 KB Output is correct
12 Correct 135 ms 229376 KB Output is correct
13 Correct 126 ms 229588 KB Output is correct
14 Correct 132 ms 229416 KB Output is correct
15 Correct 126 ms 229576 KB Output is correct
16 Correct 120 ms 229548 KB Output is correct
17 Correct 131 ms 229508 KB Output is correct
18 Correct 128 ms 229532 KB Output is correct
19 Correct 131 ms 229668 KB Output is correct
20 Correct 133 ms 229432 KB Output is correct
21 Correct 120 ms 229172 KB Output is correct
22 Correct 127 ms 229700 KB Output is correct
23 Correct 125 ms 229612 KB Output is correct
24 Correct 121 ms 229620 KB Output is correct
25 Correct 126 ms 229444 KB Output is correct
26 Correct 127 ms 229352 KB Output is correct
27 Correct 120 ms 229148 KB Output is correct
28 Correct 119 ms 229444 KB Output is correct
29 Correct 123 ms 229460 KB Output is correct
30 Correct 119 ms 229232 KB Output is correct
31 Correct 2615 ms 350592 KB Output is correct
32 Correct 188 ms 234832 KB Output is correct
33 Correct 2056 ms 313388 KB Output is correct
34 Correct 2670 ms 352616 KB Output is correct
35 Correct 2474 ms 337976 KB Output is correct
36 Correct 1918 ms 311788 KB Output is correct
37 Correct 1659 ms 318092 KB Output is correct
38 Correct 1334 ms 301736 KB Output is correct
39 Correct 1059 ms 306296 KB Output is correct
40 Correct 1178 ms 301880 KB Output is correct
41 Correct 2628 ms 332772 KB Output is correct
42 Correct 2588 ms 336024 KB Output is correct
43 Correct 188 ms 234632 KB Output is correct
44 Correct 2466 ms 331372 KB Output is correct
45 Correct 2371 ms 323664 KB Output is correct
46 Correct 2252 ms 312456 KB Output is correct
47 Correct 1195 ms 326144 KB Output is correct
48 Correct 1151 ms 324036 KB Output is correct
49 Correct 1341 ms 328512 KB Output is correct
50 Correct 1568 ms 341016 KB Output is correct
51 Correct 1387 ms 323380 KB Output is correct
52 Correct 2075 ms 386736 KB Output is correct
53 Correct 1993 ms 379052 KB Output is correct
54 Correct 2318 ms 371284 KB Output is correct
55 Correct 2301 ms 356268 KB Output is correct
56 Correct 2156 ms 359756 KB Output is correct
57 Correct 2515 ms 340940 KB Output is correct
58 Correct 2401 ms 354528 KB Output is correct
59 Correct 2286 ms 357460 KB Output is correct
60 Correct 2656 ms 342456 KB Output is correct
61 Correct 323 ms 267716 KB Output is correct
62 Correct 2093 ms 376876 KB Output is correct
63 Correct 2301 ms 368852 KB Output is correct
64 Correct 2521 ms 371548 KB Output is correct
65 Correct 2783 ms 359632 KB Output is correct
66 Correct 2943 ms 340676 KB Output is correct
67 Correct 964 ms 277876 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 228932 KB Output is correct
2 Correct 121 ms 229028 KB Output is correct
3 Correct 123 ms 228892 KB Output is correct
4 Correct 123 ms 228908 KB Output is correct
5 Correct 124 ms 228980 KB Output is correct
6 Correct 125 ms 229376 KB Output is correct
7 Correct 137 ms 229660 KB Output is correct
8 Correct 123 ms 229556 KB Output is correct
9 Correct 126 ms 229716 KB Output is correct
10 Correct 133 ms 229372 KB Output is correct
11 Correct 123 ms 229408 KB Output is correct
12 Correct 135 ms 229376 KB Output is correct
13 Correct 126 ms 229588 KB Output is correct
14 Correct 132 ms 229416 KB Output is correct
15 Correct 126 ms 229576 KB Output is correct
16 Correct 120 ms 229548 KB Output is correct
17 Correct 131 ms 229508 KB Output is correct
18 Correct 128 ms 229532 KB Output is correct
19 Correct 131 ms 229668 KB Output is correct
20 Correct 133 ms 229432 KB Output is correct
21 Correct 120 ms 229172 KB Output is correct
22 Correct 127 ms 229700 KB Output is correct
23 Correct 125 ms 229612 KB Output is correct
24 Correct 121 ms 229620 KB Output is correct
25 Correct 126 ms 229444 KB Output is correct
26 Correct 127 ms 229352 KB Output is correct
27 Correct 120 ms 229148 KB Output is correct
28 Correct 119 ms 229444 KB Output is correct
29 Correct 123 ms 229460 KB Output is correct
30 Correct 119 ms 229232 KB Output is correct
31 Correct 2615 ms 350592 KB Output is correct
32 Correct 188 ms 234832 KB Output is correct
33 Correct 2056 ms 313388 KB Output is correct
34 Correct 2670 ms 352616 KB Output is correct
35 Correct 2474 ms 337976 KB Output is correct
36 Correct 1918 ms 311788 KB Output is correct
37 Correct 1659 ms 318092 KB Output is correct
38 Correct 1334 ms 301736 KB Output is correct
39 Correct 1059 ms 306296 KB Output is correct
40 Correct 1178 ms 301880 KB Output is correct
41 Correct 2628 ms 332772 KB Output is correct
42 Correct 2588 ms 336024 KB Output is correct
43 Correct 188 ms 234632 KB Output is correct
44 Correct 2466 ms 331372 KB Output is correct
45 Correct 2371 ms 323664 KB Output is correct
46 Correct 2252 ms 312456 KB Output is correct
47 Correct 1195 ms 326144 KB Output is correct
48 Correct 1151 ms 324036 KB Output is correct
49 Correct 1341 ms 328512 KB Output is correct
50 Correct 1568 ms 341016 KB Output is correct
51 Correct 1387 ms 323380 KB Output is correct
52 Execution timed out 5086 ms 615932 KB Time limit exceeded
53 Halted 0 ms 0 KB -