oj.uz

Submission #1014197

# Submission time Handle Problem Language Result Execution time Memory
1014197 2024-07-04T13:56:13 Z pcc New Home (APIO18_new_home) C++17
47 / 100
 5000 ms 802636 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,popcnt,sse4")

#define _all(T) T.begin(),T.end()
#define pii pair<int,int>
#define fs first
#define sc second
const int mxn = 1e6;
const int inf = 1e9;
const int lim = 1e8+10;

struct SEG{
#define mid ((l+r)>>1)
#define ls now*2+1
#define rs now*2+2
	int seg[mxn*4];
	pii op[mxn*8];
	int head[mxn*8];
	int cnt = 0;
	SEG(){
		fill(seg,seg+mxn*4,-inf);
	}
	void modify(int now,int l,int r,int s,int e,int v,bool rec = false){
		if(rec&&now == 0){
			cnt++;
			head[cnt] = head[cnt-1];
		}
		if(l>=s&&e>=r){
			if(rec){
				op[++head[cnt]] = pii(now,seg[now]);
			}
			seg[now] = max(seg[now],v);
			return;
		}
		if(mid>=s)modify(ls,l,mid,s,e,v,rec);
		if(mid<e)modify(rs,mid+1,r,s,e,v,rec);
		return;
	}
	void undo(){
		assert(cnt);
		while(head[cnt]>head[cnt-1]){
			auto &[p,v] = op[head[cnt]--];
			seg[p] = v;
		}
		cnt--;
		return;
	}
	int getval(int now,int l,int r,int p){
		if(l == r)return seg[now];
		if(mid>=p)return max(seg[now],getval(ls,l,mid,p));
		else return max(seg[now],getval(rs,mid+1,r,p));
	}
#undef mid
#undef ls
#undef rs
};

SEG seg1,seg2;
int N,K,Q;
multiset<int> st[mxn];
vector<int> all;
vector<int> allt;
vector<pii> req;
array<int,4> shop[mxn];
int ans[mxn];
vector<pii> tseg[mxn*4];
vector<pii> ask[mxn];

void addev(int now,int l,int r,int s,int e,pii val){
	assert(e>=s);
	if(l>=s&&e>=r){
		tseg[now].push_back(val);
		return;
	}
	int mid = (l+r)>>1;
	if(mid>=s)addev(now*2+1,l,mid,s,e,val);
	if(mid<e)addev(now*2+2,mid+1,r,s,e,val);
	return;
}

void del(int pos,int tp){
	st[tp].erase(st[tp].find(pos));
	auto lit = --st[tp].lower_bound(pos);
	auto rit = st[tp].lower_bound(pos);
	int mid = all[*lit]+(all[*rit]-all[*lit])/2;
	int mp = upper_bound(_all(all),mid)-all.begin();
	//cerr<<"DEL: "<<pos<<' '<<tp<<"::"<<*lit<<' '<<mp<<' '<<*rit<<endl;
	seg1.modify(0,0,all.size(),*lit,mp-1,-all[*lit],1);
	seg2.modify(0,0,all.size(),mp,*rit,all[*rit],1);
	//cerr<<"DEL DONE! "<<endl;
	return;
}

void undo(){
	seg1.undo();
	seg2.undo();
}

void dfs(int now,int l,int r){
	//cerr<<"DFS IN: "<<l<<' '<<r<<endl;
	for(auto &i:tseg[now])del(i.fs,i.sc);
	if(l == r){
		for(auto &i:ask[l]){//p,idx
			//cerr<<"ASK: "<<i.fs<<','<<i.sc<<' '<<all[i.fs]<<' '<<seg1.getval(0,0,all.size(),i.fs)<<' '<<seg2.getval(0,0,all.size(),i.fs)<<endl;
			ans[i.sc] = max(all[i.fs]+seg1.getval(0,0,all.size(),i.fs),seg2.getval(0,0,all.size(),i.fs)-all[i.fs]);
		}
	}
	else{
		int mid = (l+r)>>1;
		dfs(now*2+1,l,mid);
		dfs(now*2+2,mid+1,r);
	}
	for(auto &[pos,tp]:tseg[now]){
		undo();
		//cerr<<"UNDO: "<<pos<<','<<tp<<endl;
		st[tp].insert(pos);
	}
	//cerr<<"DFS OUT: "<<l<<' '<<r<<endl;
	return;
}

int main(){

	cin>>N>>K>>Q;
	allt.push_back(-1);
	for(int i = 1;i<=N;i++){
		cin>>shop[i][0]>>shop[i][1]>>shop[i][2]>>shop[i][3];//x,t,a,b
		all.push_back(shop[i][0]);
		allt.push_back(shop[i][2]);
		allt.push_back(shop[i][3]);
	}
	for(int i = 0;i<Q;i++){
		int l,y;
		cin>>l>>y;
		all.push_back(l);
		allt.push_back(y);
		req.push_back(pii(l,y));
	}
	all.push_back(-inf);all.push_back(inf);
	sort(_all(all));all.resize(unique(_all(all))-all.begin());
	sort(_all(allt));allt.resize(unique(_all(allt))-allt.begin());
	//cerr<<"ALL: ";for(auto &i:all)cerr<<i<<' ';cerr<<endl;
	//cerr<<"ALLT: ";for(auto &i:allt)cerr<<i<<' ';cerr<<endl;
	for(int i = 1;i<=K;i++){
		st[i].insert(0);
		st[i].insert(all.size()-1);
	}
	for(int i = 1;i<=N;i++){
		shop[i][0] = lower_bound(_all(all),shop[i][0])-all.begin();
		st[shop[i][1]].insert(shop[i][0]);
		shop[i][2] = lower_bound(_all(allt),shop[i][2])-allt.begin();
		shop[i][3] = lower_bound(_all(allt),shop[i][3])-allt.begin();
	}
	for(int i = 1;i<=K;i++){
		for(auto it = ++st[i].begin();it != st[i].end();it++){
			int l = *prev(it),r = *it;
			int mid = all[l]+(all[r]-all[l])/2;
			auto pos = upper_bound(_all(all),mid)-all.begin();
			seg1.modify(0,0,all.size(),l,pos-1,-all[l]);
			seg2.modify(0,0,all.size(),pos,r,all[r]);
		}
	}
	//cerr<<"INIT DONE!"<<endl;
	for(int i = 1;i<=N;i++){
		int pos = shop[i][0],tp = shop[i][1],s = shop[i][2],e = shop[i][3];
		//cerr<<"ADDEV: "<<0<<' '<<s-1<<' '<<pos<<' '<<tp<<endl;
		//cerr<<"ADDEV: "<<e+1<<' '<<allt.size()<<' '<<pos<<' '<<tp<<endl;
		addev(0,0,allt.size(),0,s-1,pii(pos,tp));
		addev(0,0,allt.size(),e+1,allt.size(),pii(pos,tp));
	}
	for(int i = 0;i<Q;i++){
		auto &[p,t] = req[i];
		p = lower_bound(_all(all),p)-all.begin();
		t = lower_bound(_all(allt),t)-allt.begin();
		//cerr<<"ASK POS: "<<p<<' '<<t<<endl;
		ask[t].push_back(pii(p,i));
	}

	//cerr<<"ADDEV DONE!"<<' '<<seg1.getval(0,0,all.size(),req[0].fs)<<' '<<seg2.getval(0,0,all.size(),req[0].fs)<<endl;

	dfs(0,0,allt.size());
	assert(!seg1.cnt);
	assert(!seg2.cnt);
	//cerr<<"DFS DONE! "<<endl;
	for(int i = 0;i<Q;i++)cout<<(ans[i]>lim?-1:ans[i])<<'\n';
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 321364 KB Output is correct
2 Correct 120 ms 321360 KB Output is correct
3 Correct 116 ms 321360 KB Output is correct
4 Correct 115 ms 321364 KB Output is correct
5 Correct 120 ms 321356 KB Output is correct
6 Correct 129 ms 321452 KB Output is correct
7 Correct 128 ms 321360 KB Output is correct
8 Correct 126 ms 321392 KB Output is correct
9 Correct 121 ms 321336 KB Output is correct
10 Correct 124 ms 321296 KB Output is correct
11 Correct 126 ms 321340 KB Output is correct
12 Correct 124 ms 321368 KB Output is correct
13 Correct 125 ms 321332 KB Output is correct
14 Correct 133 ms 321428 KB Output is correct
15 Correct 126 ms 321368 KB Output is correct
16 Correct 123 ms 321436 KB Output is correct
17 Correct 129 ms 321372 KB Output is correct
18 Correct 124 ms 321356 KB Output is correct
19 Correct 151 ms 321360 KB Output is correct
20 Correct 125 ms 321364 KB Output is correct
21 Correct 124 ms 321360 KB Output is correct
22 Correct 128 ms 321360 KB Output is correct
23 Correct 130 ms 321424 KB Output is correct
24 Correct 127 ms 321364 KB Output is correct
25 Correct 130 ms 321412 KB Output is correct
26 Correct 130 ms 321356 KB Output is correct
27 Correct 128 ms 321424 KB Output is correct
28 Correct 122 ms 321528 KB Output is correct
29 Correct 129 ms 321360 KB Output is correct
30 Correct 132 ms 321488 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 321364 KB Output is correct
2 Correct 120 ms 321360 KB Output is correct
3 Correct 116 ms 321360 KB Output is correct
4 Correct 115 ms 321364 KB Output is correct
5 Correct 120 ms 321356 KB Output is correct
6 Correct 129 ms 321452 KB Output is correct
7 Correct 128 ms 321360 KB Output is correct
8 Correct 126 ms 321392 KB Output is correct
9 Correct 121 ms 321336 KB Output is correct
10 Correct 124 ms 321296 KB Output is correct
11 Correct 126 ms 321340 KB Output is correct
12 Correct 124 ms 321368 KB Output is correct
13 Correct 125 ms 321332 KB Output is correct
14 Correct 133 ms 321428 KB Output is correct
15 Correct 126 ms 321368 KB Output is correct
16 Correct 123 ms 321436 KB Output is correct
17 Correct 129 ms 321372 KB Output is correct
18 Correct 124 ms 321356 KB Output is correct
19 Correct 151 ms 321360 KB Output is correct
20 Correct 125 ms 321364 KB Output is correct
21 Correct 124 ms 321360 KB Output is correct
22 Correct 128 ms 321360 KB Output is correct
23 Correct 130 ms 321424 KB Output is correct
24 Correct 127 ms 321364 KB Output is correct
25 Correct 130 ms 321412 KB Output is correct
26 Correct 130 ms 321356 KB Output is correct
27 Correct 128 ms 321424 KB Output is correct
28 Correct 122 ms 321528 KB Output is correct
29 Correct 129 ms 321360 KB Output is correct
30 Correct 132 ms 321488 KB Output is correct
31 Correct 1239 ms 343332 KB Output is correct
32 Correct 270 ms 330692 KB Output is correct
33 Correct 1276 ms 345092 KB Output is correct
34 Correct 1284 ms 345120 KB Output is correct
35 Correct 1310 ms 343132 KB Output is correct
36 Correct 1261 ms 343208 KB Output is correct
37 Correct 1130 ms 345360 KB Output is correct
38 Correct 1094 ms 345276 KB Output is correct
39 Correct 918 ms 345328 KB Output is correct
40 Correct 960 ms 345340 KB Output is correct
41 Correct 1046 ms 345044 KB Output is correct
42 Correct 1060 ms 344816 KB Output is correct
43 Correct 217 ms 331892 KB Output is correct
44 Correct 986 ms 344892 KB Output is correct
45 Correct 1066 ms 344776 KB Output is correct
46 Correct 1106 ms 344848 KB Output is correct
47 Correct 784 ms 344016 KB Output is correct
48 Correct 784 ms 343960 KB Output is correct
49 Correct 793 ms 344392 KB Output is correct
50 Correct 875 ms 345208 KB Output is correct
51 Correct 877 ms 344184 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1923 ms 381780 KB Output is correct
2 Correct 2267 ms 374048 KB Output is correct
3 Runtime error 1513 ms 802636 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 321364 KB Output is correct
2 Correct 120 ms 321360 KB Output is correct
3 Correct 116 ms 321360 KB Output is correct
4 Correct 115 ms 321364 KB Output is correct
5 Correct 120 ms 321356 KB Output is correct
6 Correct 129 ms 321452 KB Output is correct
7 Correct 128 ms 321360 KB Output is correct
8 Correct 126 ms 321392 KB Output is correct
9 Correct 121 ms 321336 KB Output is correct
10 Correct 124 ms 321296 KB Output is correct
11 Correct 126 ms 321340 KB Output is correct
12 Correct 124 ms 321368 KB Output is correct
13 Correct 125 ms 321332 KB Output is correct
14 Correct 133 ms 321428 KB Output is correct
15 Correct 126 ms 321368 KB Output is correct
16 Correct 123 ms 321436 KB Output is correct
17 Correct 129 ms 321372 KB Output is correct
18 Correct 124 ms 321356 KB Output is correct
19 Correct 151 ms 321360 KB Output is correct
20 Correct 125 ms 321364 KB Output is correct
21 Correct 124 ms 321360 KB Output is correct
22 Correct 128 ms 321360 KB Output is correct
23 Correct 130 ms 321424 KB Output is correct
24 Correct 127 ms 321364 KB Output is correct
25 Correct 130 ms 321412 KB Output is correct
26 Correct 130 ms 321356 KB Output is correct
27 Correct 128 ms 321424 KB Output is correct
28 Correct 122 ms 321528 KB Output is correct
29 Correct 129 ms 321360 KB Output is correct
30 Correct 132 ms 321488 KB Output is correct
31 Correct 1239 ms 343332 KB Output is correct
32 Correct 270 ms 330692 KB Output is correct
33 Correct 1276 ms 345092 KB Output is correct
34 Correct 1284 ms 345120 KB Output is correct
35 Correct 1310 ms 343132 KB Output is correct
36 Correct 1261 ms 343208 KB Output is correct
37 Correct 1130 ms 345360 KB Output is correct
38 Correct 1094 ms 345276 KB Output is correct
39 Correct 918 ms 345328 KB Output is correct
40 Correct 960 ms 345340 KB Output is correct
41 Correct 1046 ms 345044 KB Output is correct
42 Correct 1060 ms 344816 KB Output is correct
43 Correct 217 ms 331892 KB Output is correct
44 Correct 986 ms 344892 KB Output is correct
45 Correct 1066 ms 344776 KB Output is correct
46 Correct 1106 ms 344848 KB Output is correct
47 Correct 784 ms 344016 KB Output is correct
48 Correct 784 ms 343960 KB Output is correct
49 Correct 793 ms 344392 KB Output is correct
50 Correct 875 ms 345208 KB Output is correct
51 Correct 877 ms 344184 KB Output is correct
52 Correct 836 ms 348820 KB Output is correct
53 Correct 833 ms 350868 KB Output is correct
54 Correct 845 ms 345176 KB Output is correct
55 Correct 818 ms 346832 KB Output is correct
56 Correct 739 ms 348352 KB Output is correct
57 Correct 911 ms 346308 KB Output is correct
58 Correct 790 ms 347588 KB Output is correct
59 Correct 784 ms 348104 KB Output is correct
60 Correct 884 ms 346824 KB Output is correct
61 Correct 218 ms 337860 KB Output is correct
62 Correct 700 ms 351392 KB Output is correct
63 Correct 795 ms 347328 KB Output is correct
64 Correct 767 ms 347076 KB Output is correct
65 Correct 876 ms 346576 KB Output is correct
66 Correct 979 ms 345796 KB Output is correct
67 Correct 278 ms 333364 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 321364 KB Output is correct
2 Correct 120 ms 321360 KB Output is correct
3 Correct 116 ms 321360 KB Output is correct
4 Correct 115 ms 321364 KB Output is correct
5 Correct 120 ms 321356 KB Output is correct
6 Correct 129 ms 321452 KB Output is correct
7 Correct 128 ms 321360 KB Output is correct
8 Correct 126 ms 321392 KB Output is correct
9 Correct 121 ms 321336 KB Output is correct
10 Correct 124 ms 321296 KB Output is correct
11 Correct 126 ms 321340 KB Output is correct
12 Correct 124 ms 321368 KB Output is correct
13 Correct 125 ms 321332 KB Output is correct
14 Correct 133 ms 321428 KB Output is correct
15 Correct 126 ms 321368 KB Output is correct
16 Correct 123 ms 321436 KB Output is correct
17 Correct 129 ms 321372 KB Output is correct
18 Correct 124 ms 321356 KB Output is correct
19 Correct 151 ms 321360 KB Output is correct
20 Correct 125 ms 321364 KB Output is correct
21 Correct 124 ms 321360 KB Output is correct
22 Correct 128 ms 321360 KB Output is correct
23 Correct 130 ms 321424 KB Output is correct
24 Correct 127 ms 321364 KB Output is correct
25 Correct 130 ms 321412 KB Output is correct
26 Correct 130 ms 321356 KB Output is correct
27 Correct 128 ms 321424 KB Output is correct
28 Correct 122 ms 321528 KB Output is correct
29 Correct 129 ms 321360 KB Output is correct
30 Correct 132 ms 321488 KB Output is correct
31 Correct 1239 ms 343332 KB Output is correct
32 Correct 270 ms 330692 KB Output is correct
33 Correct 1276 ms 345092 KB Output is correct
34 Correct 1284 ms 345120 KB Output is correct
35 Correct 1310 ms 343132 KB Output is correct
36 Correct 1261 ms 343208 KB Output is correct
37 Correct 1130 ms 345360 KB Output is correct
38 Correct 1094 ms 345276 KB Output is correct
39 Correct 918 ms 345328 KB Output is correct
40 Correct 960 ms 345340 KB Output is correct
41 Correct 1046 ms 345044 KB Output is correct
42 Correct 1060 ms 344816 KB Output is correct
43 Correct 217 ms 331892 KB Output is correct
44 Correct 986 ms 344892 KB Output is correct
45 Correct 1066 ms 344776 KB Output is correct
46 Correct 1106 ms 344848 KB Output is correct
47 Correct 784 ms 344016 KB Output is correct
48 Correct 784 ms 343960 KB Output is correct
49 Correct 793 ms 344392 KB Output is correct
50 Correct 875 ms 345208 KB Output is correct
51 Correct 877 ms 344184 KB Output is correct
52 Correct 1923 ms 381780 KB Output is correct
53 Correct 2267 ms 374048 KB Output is correct
54 Runtime error 1513 ms 802636 KB Execution killed with signal 11
55 Halted 0 ms 0 KB -