oj.uz

답안 #1014207

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1014207 2024-07-04T14:06:20 Z pcc 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 478280 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 = 9e5+10;
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*15];
	bitset<mxn*15> head;
	int ptr = 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){
			head[ptr] = true;
		}
		if(l>=s&&e>=r){
			if(rec){
				op[++ptr] = 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(ptr);
		while(!head[ptr]){
			auto &[p,v] = op[ptr--];
			seg[p] = v;
		}
		head[ptr] = 0;
		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.ptr);
	assert(!seg2.ptr);
	//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

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 391060 KB Output is correct
2 Correct 190 ms 390976 KB Output is correct
3 Correct 155 ms 390992 KB Output is correct
4 Correct 154 ms 391120 KB Output is correct
5 Correct 156 ms 391256 KB Output is correct
6 Correct 158 ms 391248 KB Output is correct
7 Correct 164 ms 391180 KB Output is correct
8 Correct 166 ms 391244 KB Output is correct
9 Correct 161 ms 391288 KB Output is correct
10 Correct 161 ms 391248 KB Output is correct
11 Correct 160 ms 391236 KB Output is correct
12 Correct 169 ms 391240 KB Output is correct
13 Correct 149 ms 391252 KB Output is correct
14 Correct 161 ms 391252 KB Output is correct
15 Correct 167 ms 391464 KB Output is correct
16 Correct 147 ms 391252 KB Output is correct
17 Correct 162 ms 391192 KB Output is correct
18 Correct 143 ms 391328 KB Output is correct
19 Correct 152 ms 391196 KB Output is correct
20 Correct 151 ms 391156 KB Output is correct
21 Correct 157 ms 391248 KB Output is correct
22 Correct 144 ms 391248 KB Output is correct
23 Correct 158 ms 391260 KB Output is correct
24 Correct 156 ms 391508 KB Output is correct
25 Correct 152 ms 391288 KB Output is correct
26 Correct 162 ms 391252 KB Output is correct
27 Correct 154 ms 391252 KB Output is correct
28 Correct 172 ms 391252 KB Output is correct
29 Correct 175 ms 391172 KB Output is correct
30 Correct 156 ms 391312 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 391060 KB Output is correct
2 Correct 190 ms 390976 KB Output is correct
3 Correct 155 ms 390992 KB Output is correct
4 Correct 154 ms 391120 KB Output is correct
5 Correct 156 ms 391256 KB Output is correct
6 Correct 158 ms 391248 KB Output is correct
7 Correct 164 ms 391180 KB Output is correct
8 Correct 166 ms 391244 KB Output is correct
9 Correct 161 ms 391288 KB Output is correct
10 Correct 161 ms 391248 KB Output is correct
11 Correct 160 ms 391236 KB Output is correct
12 Correct 169 ms 391240 KB Output is correct
13 Correct 149 ms 391252 KB Output is correct
14 Correct 161 ms 391252 KB Output is correct
15 Correct 167 ms 391464 KB Output is correct
16 Correct 147 ms 391252 KB Output is correct
17 Correct 162 ms 391192 KB Output is correct
18 Correct 143 ms 391328 KB Output is correct
19 Correct 152 ms 391196 KB Output is correct
20 Correct 151 ms 391156 KB Output is correct
21 Correct 157 ms 391248 KB Output is correct
22 Correct 144 ms 391248 KB Output is correct
23 Correct 158 ms 391260 KB Output is correct
24 Correct 156 ms 391508 KB Output is correct
25 Correct 152 ms 391288 KB Output is correct
26 Correct 162 ms 391252 KB Output is correct
27 Correct 154 ms 391252 KB Output is correct
28 Correct 172 ms 391252 KB Output is correct
29 Correct 175 ms 391172 KB Output is correct
30 Correct 156 ms 391312 KB Output is correct
31 Correct 1144 ms 412552 KB Output is correct
32 Correct 304 ms 400044 KB Output is correct
33 Correct 1232 ms 414536 KB Output is correct
34 Correct 1158 ms 414660 KB Output is correct
35 Correct 1170 ms 412560 KB Output is correct
36 Correct 1155 ms 412504 KB Output is correct
37 Correct 1072 ms 414916 KB Output is correct
38 Correct 1077 ms 414660 KB Output is correct
39 Correct 886 ms 414668 KB Output is correct
40 Correct 907 ms 414660 KB Output is correct
41 Correct 989 ms 414404 KB Output is correct
42 Correct 963 ms 414404 KB Output is correct
43 Correct 246 ms 400836 KB Output is correct
44 Correct 1029 ms 414216 KB Output is correct
45 Correct 1045 ms 414548 KB Output is correct
46 Correct 1108 ms 414096 KB Output is correct
47 Correct 757 ms 413292 KB Output is correct
48 Correct 737 ms 413128 KB Output is correct
49 Correct 854 ms 413636 KB Output is correct
50 Correct 819 ms 414468 KB Output is correct
51 Correct 903 ms 413532 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2848 ms 449504 KB Output is correct
2 Correct 1966 ms 441680 KB Output is correct
3 Correct 1869 ms 471884 KB Output is correct
4 Correct 1919 ms 453008 KB Output is correct
5 Correct 2155 ms 441172 KB Output is correct
6 Correct 1936 ms 441396 KB Output is correct
7 Correct 1280 ms 471812 KB Output is correct
8 Correct 1451 ms 452948 KB Output is correct
9 Correct 1620 ms 446160 KB Output is correct
10 Correct 1769 ms 442704 KB Output is correct
11 Correct 1281 ms 441244 KB Output is correct
12 Correct 1375 ms 442372 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5031 ms 478280 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 391060 KB Output is correct
2 Correct 190 ms 390976 KB Output is correct
3 Correct 155 ms 390992 KB Output is correct
4 Correct 154 ms 391120 KB Output is correct
5 Correct 156 ms 391256 KB Output is correct
6 Correct 158 ms 391248 KB Output is correct
7 Correct 164 ms 391180 KB Output is correct
8 Correct 166 ms 391244 KB Output is correct
9 Correct 161 ms 391288 KB Output is correct
10 Correct 161 ms 391248 KB Output is correct
11 Correct 160 ms 391236 KB Output is correct
12 Correct 169 ms 391240 KB Output is correct
13 Correct 149 ms 391252 KB Output is correct
14 Correct 161 ms 391252 KB Output is correct
15 Correct 167 ms 391464 KB Output is correct
16 Correct 147 ms 391252 KB Output is correct
17 Correct 162 ms 391192 KB Output is correct
18 Correct 143 ms 391328 KB Output is correct
19 Correct 152 ms 391196 KB Output is correct
20 Correct 151 ms 391156 KB Output is correct
21 Correct 157 ms 391248 KB Output is correct
22 Correct 144 ms 391248 KB Output is correct
23 Correct 158 ms 391260 KB Output is correct
24 Correct 156 ms 391508 KB Output is correct
25 Correct 152 ms 391288 KB Output is correct
26 Correct 162 ms 391252 KB Output is correct
27 Correct 154 ms 391252 KB Output is correct
28 Correct 172 ms 391252 KB Output is correct
29 Correct 175 ms 391172 KB Output is correct
30 Correct 156 ms 391312 KB Output is correct
31 Correct 1144 ms 412552 KB Output is correct
32 Correct 304 ms 400044 KB Output is correct
33 Correct 1232 ms 414536 KB Output is correct
34 Correct 1158 ms 414660 KB Output is correct
35 Correct 1170 ms 412560 KB Output is correct
36 Correct 1155 ms 412504 KB Output is correct
37 Correct 1072 ms 414916 KB Output is correct
38 Correct 1077 ms 414660 KB Output is correct
39 Correct 886 ms 414668 KB Output is correct
40 Correct 907 ms 414660 KB Output is correct
41 Correct 989 ms 414404 KB Output is correct
42 Correct 963 ms 414404 KB Output is correct
43 Correct 246 ms 400836 KB Output is correct
44 Correct 1029 ms 414216 KB Output is correct
45 Correct 1045 ms 414548 KB Output is correct
46 Correct 1108 ms 414096 KB Output is correct
47 Correct 757 ms 413292 KB Output is correct
48 Correct 737 ms 413128 KB Output is correct
49 Correct 854 ms 413636 KB Output is correct
50 Correct 819 ms 414468 KB Output is correct
51 Correct 903 ms 413532 KB Output is correct
52 Correct 817 ms 416248 KB Output is correct
53 Correct 775 ms 418008 KB Output is correct
54 Correct 826 ms 412360 KB Output is correct
55 Correct 850 ms 414148 KB Output is correct
56 Correct 764 ms 415068 KB Output is correct
57 Correct 878 ms 412760 KB Output is correct
58 Correct 827 ms 414152 KB Output is correct
59 Correct 846 ms 414912 KB Output is correct
60 Correct 941 ms 413332 KB Output is correct
61 Correct 241 ms 404932 KB Output is correct
62 Correct 671 ms 417848 KB Output is correct
63 Correct 780 ms 413768 KB Output is correct
64 Correct 789 ms 413444 KB Output is correct
65 Correct 890 ms 413112 KB Output is correct
66 Correct 1083 ms 412864 KB Output is correct
67 Correct 305 ms 401672 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 391060 KB Output is correct
2 Correct 190 ms 390976 KB Output is correct
3 Correct 155 ms 390992 KB Output is correct
4 Correct 154 ms 391120 KB Output is correct
5 Correct 156 ms 391256 KB Output is correct
6 Correct 158 ms 391248 KB Output is correct
7 Correct 164 ms 391180 KB Output is correct
8 Correct 166 ms 391244 KB Output is correct
9 Correct 161 ms 391288 KB Output is correct
10 Correct 161 ms 391248 KB Output is correct
11 Correct 160 ms 391236 KB Output is correct
12 Correct 169 ms 391240 KB Output is correct
13 Correct 149 ms 391252 KB Output is correct
14 Correct 161 ms 391252 KB Output is correct
15 Correct 167 ms 391464 KB Output is correct
16 Correct 147 ms 391252 KB Output is correct
17 Correct 162 ms 391192 KB Output is correct
18 Correct 143 ms 391328 KB Output is correct
19 Correct 152 ms 391196 KB Output is correct
20 Correct 151 ms 391156 KB Output is correct
21 Correct 157 ms 391248 KB Output is correct
22 Correct 144 ms 391248 KB Output is correct
23 Correct 158 ms 391260 KB Output is correct
24 Correct 156 ms 391508 KB Output is correct
25 Correct 152 ms 391288 KB Output is correct
26 Correct 162 ms 391252 KB Output is correct
27 Correct 154 ms 391252 KB Output is correct
28 Correct 172 ms 391252 KB Output is correct
29 Correct 175 ms 391172 KB Output is correct
30 Correct 156 ms 391312 KB Output is correct
31 Correct 1144 ms 412552 KB Output is correct
32 Correct 304 ms 400044 KB Output is correct
33 Correct 1232 ms 414536 KB Output is correct
34 Correct 1158 ms 414660 KB Output is correct
35 Correct 1170 ms 412560 KB Output is correct
36 Correct 1155 ms 412504 KB Output is correct
37 Correct 1072 ms 414916 KB Output is correct
38 Correct 1077 ms 414660 KB Output is correct
39 Correct 886 ms 414668 KB Output is correct
40 Correct 907 ms 414660 KB Output is correct
41 Correct 989 ms 414404 KB Output is correct
42 Correct 963 ms 414404 KB Output is correct
43 Correct 246 ms 400836 KB Output is correct
44 Correct 1029 ms 414216 KB Output is correct
45 Correct 1045 ms 414548 KB Output is correct
46 Correct 1108 ms 414096 KB Output is correct
47 Correct 757 ms 413292 KB Output is correct
48 Correct 737 ms 413128 KB Output is correct
49 Correct 854 ms 413636 KB Output is correct
50 Correct 819 ms 414468 KB Output is correct
51 Correct 903 ms 413532 KB Output is correct
52 Correct 2848 ms 449504 KB Output is correct
53 Correct 1966 ms 441680 KB Output is correct
54 Correct 1869 ms 471884 KB Output is correct
55 Correct 1919 ms 453008 KB Output is correct
56 Correct 2155 ms 441172 KB Output is correct
57 Correct 1936 ms 441396 KB Output is correct
58 Correct 1280 ms 471812 KB Output is correct
59 Correct 1451 ms 452948 KB Output is correct
60 Correct 1620 ms 446160 KB Output is correct
61 Correct 1769 ms 442704 KB Output is correct
62 Correct 1281 ms 441244 KB Output is correct
63 Correct 1375 ms 442372 KB Output is correct
64 Execution timed out 5031 ms 478280 KB Time limit exceeded
65 Halted 0 ms 0 KB -