oj.uz

Submission #406169

# Submission time Handle Problem Language Result Execution time Memory
406169 2021-05-17T08:59:06 Z kshitij_sodani New Home (APIO18_new_home) C++14
47 / 100
 5000 ms 667036 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 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;
		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;
	for(int i=0;i<n;i++){
		int x,aa,bb,tt;
		cin>>x>>tt>>aa>>bb;
		ss[x]++;
		tt--;
		cur.pb({{aa,-1},{x,tt}});
		cur.pb({{bb,1},{x,tt}});
	}
	for(int i=0;i<q;i++){
		int x,aa;
		cin>>x>>aa;
		ss[x]++;
		cur.pb({{aa,0},{x,i}});
	}
	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]++;
		add(i,-2e8,2e8,1);
	//	xx[{i,{-2e8,2e8}}]=;
	//	update(0,0,nn-1,0,nn-1);
	}

	for(auto j:cur){
		if(j.a.b==-1){
			//add
			//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 
			//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;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 228828 KB Output is correct
2 Correct 142 ms 228804 KB Output is correct
3 Correct 126 ms 228804 KB Output is correct
4 Correct 122 ms 228900 KB Output is correct
5 Correct 132 ms 228956 KB Output is correct
6 Correct 127 ms 229340 KB Output is correct
7 Correct 127 ms 229688 KB Output is correct
8 Correct 136 ms 229616 KB Output is correct
9 Correct 127 ms 229704 KB Output is correct
10 Correct 143 ms 229348 KB Output is correct
11 Correct 129 ms 229372 KB Output is correct
12 Correct 136 ms 229324 KB Output is correct
13 Correct 145 ms 229452 KB Output is correct
14 Correct 168 ms 229344 KB Output is correct
15 Correct 145 ms 229504 KB Output is correct
16 Correct 129 ms 229544 KB Output is correct
17 Correct 139 ms 229512 KB Output is correct
18 Correct 137 ms 229520 KB Output is correct
19 Correct 150 ms 229600 KB Output is correct
20 Correct 138 ms 229512 KB Output is correct
21 Correct 127 ms 229292 KB Output is correct
22 Correct 151 ms 229696 KB Output is correct
23 Correct 144 ms 229572 KB Output is correct
24 Correct 127 ms 229572 KB Output is correct
25 Correct 126 ms 229492 KB Output is correct
26 Correct 130 ms 229444 KB Output is correct
27 Correct 129 ms 229312 KB Output is correct
28 Correct 128 ms 229388 KB Output is correct
29 Correct 129 ms 229332 KB Output is correct
30 Correct 128 ms 229268 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 228828 KB Output is correct
2 Correct 142 ms 228804 KB Output is correct
3 Correct 126 ms 228804 KB Output is correct
4 Correct 122 ms 228900 KB Output is correct
5 Correct 132 ms 228956 KB Output is correct
6 Correct 127 ms 229340 KB Output is correct
7 Correct 127 ms 229688 KB Output is correct
8 Correct 136 ms 229616 KB Output is correct
9 Correct 127 ms 229704 KB Output is correct
10 Correct 143 ms 229348 KB Output is correct
11 Correct 129 ms 229372 KB Output is correct
12 Correct 136 ms 229324 KB Output is correct
13 Correct 145 ms 229452 KB Output is correct
14 Correct 168 ms 229344 KB Output is correct
15 Correct 145 ms 229504 KB Output is correct
16 Correct 129 ms 229544 KB Output is correct
17 Correct 139 ms 229512 KB Output is correct
18 Correct 137 ms 229520 KB Output is correct
19 Correct 150 ms 229600 KB Output is correct
20 Correct 138 ms 229512 KB Output is correct
21 Correct 127 ms 229292 KB Output is correct
22 Correct 151 ms 229696 KB Output is correct
23 Correct 144 ms 229572 KB Output is correct
24 Correct 127 ms 229572 KB Output is correct
25 Correct 126 ms 229492 KB Output is correct
26 Correct 130 ms 229444 KB Output is correct
27 Correct 129 ms 229312 KB Output is correct
28 Correct 128 ms 229388 KB Output is correct
29 Correct 129 ms 229332 KB Output is correct
30 Correct 128 ms 229268 KB Output is correct
31 Correct 2703 ms 348828 KB Output is correct
32 Correct 204 ms 233160 KB Output is correct
33 Correct 2058 ms 311624 KB Output is correct
34 Correct 2925 ms 350900 KB Output is correct
35 Correct 2487 ms 336844 KB Output is correct
36 Correct 2066 ms 310676 KB Output is correct
37 Correct 1869 ms 316868 KB Output is correct
38 Correct 1424 ms 300628 KB Output is correct
39 Correct 1106 ms 305260 KB Output is correct
40 Correct 1089 ms 300696 KB Output is correct
41 Correct 2662 ms 331916 KB Output is correct
42 Correct 2719 ms 337636 KB Output is correct
43 Correct 227 ms 235180 KB Output is correct
44 Correct 2608 ms 333264 KB Output is correct
45 Correct 2653 ms 325552 KB Output is correct
46 Correct 2452 ms 314072 KB Output is correct
47 Correct 1204 ms 327684 KB Output is correct
48 Correct 1168 ms 325524 KB Output is correct
49 Correct 1437 ms 330300 KB Output is correct
50 Correct 1586 ms 342456 KB Output is correct
51 Correct 1493 ms 324912 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5062 ms 667036 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 5121 ms 655548 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 228828 KB Output is correct
2 Correct 142 ms 228804 KB Output is correct
3 Correct 126 ms 228804 KB Output is correct
4 Correct 122 ms 228900 KB Output is correct
5 Correct 132 ms 228956 KB Output is correct
6 Correct 127 ms 229340 KB Output is correct
7 Correct 127 ms 229688 KB Output is correct
8 Correct 136 ms 229616 KB Output is correct
9 Correct 127 ms 229704 KB Output is correct
10 Correct 143 ms 229348 KB Output is correct
11 Correct 129 ms 229372 KB Output is correct
12 Correct 136 ms 229324 KB Output is correct
13 Correct 145 ms 229452 KB Output is correct
14 Correct 168 ms 229344 KB Output is correct
15 Correct 145 ms 229504 KB Output is correct
16 Correct 129 ms 229544 KB Output is correct
17 Correct 139 ms 229512 KB Output is correct
18 Correct 137 ms 229520 KB Output is correct
19 Correct 150 ms 229600 KB Output is correct
20 Correct 138 ms 229512 KB Output is correct
21 Correct 127 ms 229292 KB Output is correct
22 Correct 151 ms 229696 KB Output is correct
23 Correct 144 ms 229572 KB Output is correct
24 Correct 127 ms 229572 KB Output is correct
25 Correct 126 ms 229492 KB Output is correct
26 Correct 130 ms 229444 KB Output is correct
27 Correct 129 ms 229312 KB Output is correct
28 Correct 128 ms 229388 KB Output is correct
29 Correct 129 ms 229332 KB Output is correct
30 Correct 128 ms 229268 KB Output is correct
31 Correct 2703 ms 348828 KB Output is correct
32 Correct 204 ms 233160 KB Output is correct
33 Correct 2058 ms 311624 KB Output is correct
34 Correct 2925 ms 350900 KB Output is correct
35 Correct 2487 ms 336844 KB Output is correct
36 Correct 2066 ms 310676 KB Output is correct
37 Correct 1869 ms 316868 KB Output is correct
38 Correct 1424 ms 300628 KB Output is correct
39 Correct 1106 ms 305260 KB Output is correct
40 Correct 1089 ms 300696 KB Output is correct
41 Correct 2662 ms 331916 KB Output is correct
42 Correct 2719 ms 337636 KB Output is correct
43 Correct 227 ms 235180 KB Output is correct
44 Correct 2608 ms 333264 KB Output is correct
45 Correct 2653 ms 325552 KB Output is correct
46 Correct 2452 ms 314072 KB Output is correct
47 Correct 1204 ms 327684 KB Output is correct
48 Correct 1168 ms 325524 KB Output is correct
49 Correct 1437 ms 330300 KB Output is correct
50 Correct 1586 ms 342456 KB Output is correct
51 Correct 1493 ms 324912 KB Output is correct
52 Correct 2120 ms 388640 KB Output is correct
53 Correct 2054 ms 380904 KB Output is correct
54 Correct 2331 ms 373112 KB Output is correct
55 Correct 2388 ms 358108 KB Output is correct
56 Correct 2187 ms 361452 KB Output is correct
57 Correct 2546 ms 342684 KB Output is correct
58 Correct 2531 ms 356204 KB Output is correct
59 Correct 2342 ms 359176 KB Output is correct
60 Correct 2695 ms 344136 KB Output is correct
61 Correct 484 ms 287280 KB Output is correct
62 Correct 1943 ms 378732 KB Output is correct
63 Correct 2159 ms 370664 KB Output is correct
64 Correct 2274 ms 373376 KB Output is correct
65 Correct 2431 ms 361444 KB Output is correct
66 Correct 2730 ms 342476 KB Output is correct
67 Correct 808 ms 277860 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 228828 KB Output is correct
2 Correct 142 ms 228804 KB Output is correct
3 Correct 126 ms 228804 KB Output is correct
4 Correct 122 ms 228900 KB Output is correct
5 Correct 132 ms 228956 KB Output is correct
6 Correct 127 ms 229340 KB Output is correct
7 Correct 127 ms 229688 KB Output is correct
8 Correct 136 ms 229616 KB Output is correct
9 Correct 127 ms 229704 KB Output is correct
10 Correct 143 ms 229348 KB Output is correct
11 Correct 129 ms 229372 KB Output is correct
12 Correct 136 ms 229324 KB Output is correct
13 Correct 145 ms 229452 KB Output is correct
14 Correct 168 ms 229344 KB Output is correct
15 Correct 145 ms 229504 KB Output is correct
16 Correct 129 ms 229544 KB Output is correct
17 Correct 139 ms 229512 KB Output is correct
18 Correct 137 ms 229520 KB Output is correct
19 Correct 150 ms 229600 KB Output is correct
20 Correct 138 ms 229512 KB Output is correct
21 Correct 127 ms 229292 KB Output is correct
22 Correct 151 ms 229696 KB Output is correct
23 Correct 144 ms 229572 KB Output is correct
24 Correct 127 ms 229572 KB Output is correct
25 Correct 126 ms 229492 KB Output is correct
26 Correct 130 ms 229444 KB Output is correct
27 Correct 129 ms 229312 KB Output is correct
28 Correct 128 ms 229388 KB Output is correct
29 Correct 129 ms 229332 KB Output is correct
30 Correct 128 ms 229268 KB Output is correct
31 Correct 2703 ms 348828 KB Output is correct
32 Correct 204 ms 233160 KB Output is correct
33 Correct 2058 ms 311624 KB Output is correct
34 Correct 2925 ms 350900 KB Output is correct
35 Correct 2487 ms 336844 KB Output is correct
36 Correct 2066 ms 310676 KB Output is correct
37 Correct 1869 ms 316868 KB Output is correct
38 Correct 1424 ms 300628 KB Output is correct
39 Correct 1106 ms 305260 KB Output is correct
40 Correct 1089 ms 300696 KB Output is correct
41 Correct 2662 ms 331916 KB Output is correct
42 Correct 2719 ms 337636 KB Output is correct
43 Correct 227 ms 235180 KB Output is correct
44 Correct 2608 ms 333264 KB Output is correct
45 Correct 2653 ms 325552 KB Output is correct
46 Correct 2452 ms 314072 KB Output is correct
47 Correct 1204 ms 327684 KB Output is correct
48 Correct 1168 ms 325524 KB Output is correct
49 Correct 1437 ms 330300 KB Output is correct
50 Correct 1586 ms 342456 KB Output is correct
51 Correct 1493 ms 324912 KB Output is correct
52 Execution timed out 5062 ms 667036 KB Time limit exceeded
53 Halted 0 ms 0 KB -