oj.uz

답안 #1014174

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1014174 2024-07-04T13:34:53 Z pcc 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 447516 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];
	vector<vector<pii>> op;
	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)op.push_back({});
		if(l>=s&&e>=r){
			if(rec)op.back().push_back(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(!op.empty());
		while(!op.back().empty()){
			auto &[p,v] = op.back().back();
			op.back().pop_back();
			seg[p] = v;
		}
		op.pop_back();
		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];
vector<pii> op;

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());
	//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 74 ms 195920 KB Output is correct
2 Correct 75 ms 196104 KB Output is correct
3 Correct 75 ms 195924 KB Output is correct
4 Correct 75 ms 195920 KB Output is correct
5 Correct 73 ms 196176 KB Output is correct
6 Correct 81 ms 196180 KB Output is correct
7 Correct 74 ms 196376 KB Output is correct
8 Correct 78 ms 196180 KB Output is correct
9 Correct 77 ms 196432 KB Output is correct
10 Correct 82 ms 196180 KB Output is correct
11 Correct 81 ms 196180 KB Output is correct
12 Correct 79 ms 196180 KB Output is correct
13 Correct 89 ms 196180 KB Output is correct
14 Correct 81 ms 196176 KB Output is correct
15 Correct 83 ms 196228 KB Output is correct
16 Correct 81 ms 196180 KB Output is correct
17 Correct 78 ms 196244 KB Output is correct
18 Correct 78 ms 196152 KB Output is correct
19 Correct 80 ms 196176 KB Output is correct
20 Correct 97 ms 196304 KB Output is correct
21 Correct 85 ms 196096 KB Output is correct
22 Correct 80 ms 196432 KB Output is correct
23 Correct 81 ms 196360 KB Output is correct
24 Correct 78 ms 196136 KB Output is correct
25 Correct 81 ms 196200 KB Output is correct
26 Correct 82 ms 196304 KB Output is correct
27 Correct 78 ms 196240 KB Output is correct
28 Correct 86 ms 196176 KB Output is correct
29 Correct 82 ms 196176 KB Output is correct
30 Correct 83 ms 196176 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 195920 KB Output is correct
2 Correct 75 ms 196104 KB Output is correct
3 Correct 75 ms 195924 KB Output is correct
4 Correct 75 ms 195920 KB Output is correct
5 Correct 73 ms 196176 KB Output is correct
6 Correct 81 ms 196180 KB Output is correct
7 Correct 74 ms 196376 KB Output is correct
8 Correct 78 ms 196180 KB Output is correct
9 Correct 77 ms 196432 KB Output is correct
10 Correct 82 ms 196180 KB Output is correct
11 Correct 81 ms 196180 KB Output is correct
12 Correct 79 ms 196180 KB Output is correct
13 Correct 89 ms 196180 KB Output is correct
14 Correct 81 ms 196176 KB Output is correct
15 Correct 83 ms 196228 KB Output is correct
16 Correct 81 ms 196180 KB Output is correct
17 Correct 78 ms 196244 KB Output is correct
18 Correct 78 ms 196152 KB Output is correct
19 Correct 80 ms 196176 KB Output is correct
20 Correct 97 ms 196304 KB Output is correct
21 Correct 85 ms 196096 KB Output is correct
22 Correct 80 ms 196432 KB Output is correct
23 Correct 81 ms 196360 KB Output is correct
24 Correct 78 ms 196136 KB Output is correct
25 Correct 81 ms 196200 KB Output is correct
26 Correct 82 ms 196304 KB Output is correct
27 Correct 78 ms 196240 KB Output is correct
28 Correct 86 ms 196176 KB Output is correct
29 Correct 82 ms 196176 KB Output is correct
30 Correct 83 ms 196176 KB Output is correct
31 Correct 1493 ms 234988 KB Output is correct
32 Correct 261 ms 209304 KB Output is correct
33 Correct 1309 ms 229928 KB Output is correct
34 Correct 1422 ms 237080 KB Output is correct
35 Correct 1526 ms 232892 KB Output is correct
36 Correct 1312 ms 228352 KB Output is correct
37 Correct 1315 ms 231588 KB Output is correct
38 Correct 1277 ms 227548 KB Output is correct
39 Correct 1083 ms 228544 KB Output is correct
40 Correct 1167 ms 227652 KB Output is correct
41 Correct 1367 ms 235996 KB Output is correct
42 Correct 1444 ms 236108 KB Output is correct
43 Correct 193 ms 209952 KB Output is correct
44 Correct 1412 ms 235816 KB Output is correct
45 Correct 1339 ms 233180 KB Output is correct
46 Correct 1357 ms 228520 KB Output is correct
47 Correct 1020 ms 231928 KB Output is correct
48 Correct 977 ms 229052 KB Output is correct
49 Correct 1061 ms 230460 KB Output is correct
50 Correct 1160 ms 236376 KB Output is correct
51 Correct 1147 ms 228276 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2600 ms 391888 KB Output is correct
2 Correct 2438 ms 297108 KB Output is correct
3 Correct 2106 ms 447516 KB Output is correct
4 Correct 2337 ms 407248 KB Output is correct
5 Correct 2182 ms 278560 KB Output is correct
6 Correct 2288 ms 290164 KB Output is correct
7 Correct 1693 ms 444704 KB Output is correct
8 Correct 1976 ms 393852 KB Output is correct
9 Correct 2105 ms 376408 KB Output is correct
10 Correct 2058 ms 329984 KB Output is correct
11 Correct 1536 ms 302644 KB Output is correct
12 Correct 1638 ms 326024 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 195920 KB Output is correct
2 Correct 75 ms 196104 KB Output is correct
3 Correct 75 ms 195924 KB Output is correct
4 Correct 75 ms 195920 KB Output is correct
5 Correct 73 ms 196176 KB Output is correct
6 Correct 81 ms 196180 KB Output is correct
7 Correct 74 ms 196376 KB Output is correct
8 Correct 78 ms 196180 KB Output is correct
9 Correct 77 ms 196432 KB Output is correct
10 Correct 82 ms 196180 KB Output is correct
11 Correct 81 ms 196180 KB Output is correct
12 Correct 79 ms 196180 KB Output is correct
13 Correct 89 ms 196180 KB Output is correct
14 Correct 81 ms 196176 KB Output is correct
15 Correct 83 ms 196228 KB Output is correct
16 Correct 81 ms 196180 KB Output is correct
17 Correct 78 ms 196244 KB Output is correct
18 Correct 78 ms 196152 KB Output is correct
19 Correct 80 ms 196176 KB Output is correct
20 Correct 97 ms 196304 KB Output is correct
21 Correct 85 ms 196096 KB Output is correct
22 Correct 80 ms 196432 KB Output is correct
23 Correct 81 ms 196360 KB Output is correct
24 Correct 78 ms 196136 KB Output is correct
25 Correct 81 ms 196200 KB Output is correct
26 Correct 82 ms 196304 KB Output is correct
27 Correct 78 ms 196240 KB Output is correct
28 Correct 86 ms 196176 KB Output is correct
29 Correct 82 ms 196176 KB Output is correct
30 Correct 83 ms 196176 KB Output is correct
31 Correct 1493 ms 234988 KB Output is correct
32 Correct 261 ms 209304 KB Output is correct
33 Correct 1309 ms 229928 KB Output is correct
34 Correct 1422 ms 237080 KB Output is correct
35 Correct 1526 ms 232892 KB Output is correct
36 Correct 1312 ms 228352 KB Output is correct
37 Correct 1315 ms 231588 KB Output is correct
38 Correct 1277 ms 227548 KB Output is correct
39 Correct 1083 ms 228544 KB Output is correct
40 Correct 1167 ms 227652 KB Output is correct
41 Correct 1367 ms 235996 KB Output is correct
42 Correct 1444 ms 236108 KB Output is correct
43 Correct 193 ms 209952 KB Output is correct
44 Correct 1412 ms 235816 KB Output is correct
45 Correct 1339 ms 233180 KB Output is correct
46 Correct 1357 ms 228520 KB Output is correct
47 Correct 1020 ms 231928 KB Output is correct
48 Correct 977 ms 229052 KB Output is correct
49 Correct 1061 ms 230460 KB Output is correct
50 Correct 1160 ms 236376 KB Output is correct
51 Correct 1147 ms 228276 KB Output is correct
52 Correct 1084 ms 242876 KB Output is correct
53 Correct 1119 ms 244856 KB Output is correct
54 Correct 1164 ms 240356 KB Output is correct
55 Correct 1164 ms 239616 KB Output is correct
56 Correct 1093 ms 240456 KB Output is correct
57 Correct 1158 ms 236724 KB Output is correct
58 Correct 1126 ms 239092 KB Output is correct
59 Correct 1135 ms 240296 KB Output is correct
60 Correct 1279 ms 237428 KB Output is correct
61 Correct 188 ms 216560 KB Output is correct
62 Correct 951 ms 244492 KB Output is correct
63 Correct 1110 ms 241084 KB Output is correct
64 Correct 1153 ms 241132 KB Output is correct
65 Correct 1210 ms 241088 KB Output is correct
66 Correct 1281 ms 236980 KB Output is correct
67 Correct 307 ms 214208 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 195920 KB Output is correct
2 Correct 75 ms 196104 KB Output is correct
3 Correct 75 ms 195924 KB Output is correct
4 Correct 75 ms 195920 KB Output is correct
5 Correct 73 ms 196176 KB Output is correct
6 Correct 81 ms 196180 KB Output is correct
7 Correct 74 ms 196376 KB Output is correct
8 Correct 78 ms 196180 KB Output is correct
9 Correct 77 ms 196432 KB Output is correct
10 Correct 82 ms 196180 KB Output is correct
11 Correct 81 ms 196180 KB Output is correct
12 Correct 79 ms 196180 KB Output is correct
13 Correct 89 ms 196180 KB Output is correct
14 Correct 81 ms 196176 KB Output is correct
15 Correct 83 ms 196228 KB Output is correct
16 Correct 81 ms 196180 KB Output is correct
17 Correct 78 ms 196244 KB Output is correct
18 Correct 78 ms 196152 KB Output is correct
19 Correct 80 ms 196176 KB Output is correct
20 Correct 97 ms 196304 KB Output is correct
21 Correct 85 ms 196096 KB Output is correct
22 Correct 80 ms 196432 KB Output is correct
23 Correct 81 ms 196360 KB Output is correct
24 Correct 78 ms 196136 KB Output is correct
25 Correct 81 ms 196200 KB Output is correct
26 Correct 82 ms 196304 KB Output is correct
27 Correct 78 ms 196240 KB Output is correct
28 Correct 86 ms 196176 KB Output is correct
29 Correct 82 ms 196176 KB Output is correct
30 Correct 83 ms 196176 KB Output is correct
31 Correct 1493 ms 234988 KB Output is correct
32 Correct 261 ms 209304 KB Output is correct
33 Correct 1309 ms 229928 KB Output is correct
34 Correct 1422 ms 237080 KB Output is correct
35 Correct 1526 ms 232892 KB Output is correct
36 Correct 1312 ms 228352 KB Output is correct
37 Correct 1315 ms 231588 KB Output is correct
38 Correct 1277 ms 227548 KB Output is correct
39 Correct 1083 ms 228544 KB Output is correct
40 Correct 1167 ms 227652 KB Output is correct
41 Correct 1367 ms 235996 KB Output is correct
42 Correct 1444 ms 236108 KB Output is correct
43 Correct 193 ms 209952 KB Output is correct
44 Correct 1412 ms 235816 KB Output is correct
45 Correct 1339 ms 233180 KB Output is correct
46 Correct 1357 ms 228520 KB Output is correct
47 Correct 1020 ms 231928 KB Output is correct
48 Correct 977 ms 229052 KB Output is correct
49 Correct 1061 ms 230460 KB Output is correct
50 Correct 1160 ms 236376 KB Output is correct
51 Correct 1147 ms 228276 KB Output is correct
52 Correct 2600 ms 391888 KB Output is correct
53 Correct 2438 ms 297108 KB Output is correct
54 Correct 2106 ms 447516 KB Output is correct
55 Correct 2337 ms 407248 KB Output is correct
56 Correct 2182 ms 278560 KB Output is correct
57 Correct 2288 ms 290164 KB Output is correct
58 Correct 1693 ms 444704 KB Output is correct
59 Correct 1976 ms 393852 KB Output is correct
60 Correct 2105 ms 376408 KB Output is correct
61 Correct 2058 ms 329984 KB Output is correct
62 Correct 1536 ms 302644 KB Output is correct
63 Correct 1638 ms 326024 KB Output is correct
64 Execution timed out 5069 ms 390040 KB Time limit exceeded
65 Halted 0 ms 0 KB -