oj.uz

답안 #1014210

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1014210 2024-07-04T14:13:59 Z pcc 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 527136 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*15];
	int head[mxn];
	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(){
 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 191 ms 430776 KB Output is correct
2 Correct 171 ms 430748 KB Output is correct
3 Correct 176 ms 430772 KB Output is correct
4 Correct 167 ms 430932 KB Output is correct
5 Correct 176 ms 430848 KB Output is correct
6 Correct 172 ms 430928 KB Output is correct
7 Correct 165 ms 430932 KB Output is correct
8 Correct 166 ms 430928 KB Output is correct
9 Correct 163 ms 430932 KB Output is correct
10 Correct 165 ms 430932 KB Output is correct
11 Correct 173 ms 430932 KB Output is correct
12 Correct 172 ms 431048 KB Output is correct
13 Correct 170 ms 430928 KB Output is correct
14 Correct 172 ms 430888 KB Output is correct
15 Correct 174 ms 430932 KB Output is correct
16 Correct 171 ms 430936 KB Output is correct
17 Correct 170 ms 430980 KB Output is correct
18 Correct 173 ms 430928 KB Output is correct
19 Correct 196 ms 430932 KB Output is correct
20 Correct 171 ms 430928 KB Output is correct
21 Correct 174 ms 431044 KB Output is correct
22 Correct 179 ms 431100 KB Output is correct
23 Correct 198 ms 431088 KB Output is correct
24 Correct 170 ms 431100 KB Output is correct
25 Correct 186 ms 431188 KB Output is correct
26 Correct 167 ms 430932 KB Output is correct
27 Correct 169 ms 430932 KB Output is correct
28 Correct 174 ms 430888 KB Output is correct
29 Correct 185 ms 430928 KB Output is correct
30 Correct 179 ms 431184 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 191 ms 430776 KB Output is correct
2 Correct 171 ms 430748 KB Output is correct
3 Correct 176 ms 430772 KB Output is correct
4 Correct 167 ms 430932 KB Output is correct
5 Correct 176 ms 430848 KB Output is correct
6 Correct 172 ms 430928 KB Output is correct
7 Correct 165 ms 430932 KB Output is correct
8 Correct 166 ms 430928 KB Output is correct
9 Correct 163 ms 430932 KB Output is correct
10 Correct 165 ms 430932 KB Output is correct
11 Correct 173 ms 430932 KB Output is correct
12 Correct 172 ms 431048 KB Output is correct
13 Correct 170 ms 430928 KB Output is correct
14 Correct 172 ms 430888 KB Output is correct
15 Correct 174 ms 430932 KB Output is correct
16 Correct 171 ms 430936 KB Output is correct
17 Correct 170 ms 430980 KB Output is correct
18 Correct 173 ms 430928 KB Output is correct
19 Correct 196 ms 430932 KB Output is correct
20 Correct 171 ms 430928 KB Output is correct
21 Correct 174 ms 431044 KB Output is correct
22 Correct 179 ms 431100 KB Output is correct
23 Correct 198 ms 431088 KB Output is correct
24 Correct 170 ms 431100 KB Output is correct
25 Correct 186 ms 431188 KB Output is correct
26 Correct 167 ms 430932 KB Output is correct
27 Correct 169 ms 430932 KB Output is correct
28 Correct 174 ms 430888 KB Output is correct
29 Correct 185 ms 430928 KB Output is correct
30 Correct 179 ms 431184 KB Output is correct
31 Correct 1150 ms 451140 KB Output is correct
32 Correct 315 ms 439624 KB Output is correct
33 Correct 1123 ms 452932 KB Output is correct
34 Correct 1163 ms 452952 KB Output is correct
35 Correct 1177 ms 450972 KB Output is correct
36 Correct 1141 ms 451144 KB Output is correct
37 Correct 1025 ms 453228 KB Output is correct
38 Correct 1066 ms 453248 KB Output is correct
39 Correct 855 ms 453196 KB Output is correct
40 Correct 843 ms 453192 KB Output is correct
41 Correct 977 ms 452904 KB Output is correct
42 Correct 945 ms 452636 KB Output is correct
43 Correct 219 ms 439564 KB Output is correct
44 Correct 1070 ms 452936 KB Output is correct
45 Correct 1079 ms 452820 KB Output is correct
46 Correct 1076 ms 452668 KB Output is correct
47 Correct 756 ms 451660 KB Output is correct
48 Correct 785 ms 451400 KB Output is correct
49 Correct 827 ms 451932 KB Output is correct
50 Correct 835 ms 452680 KB Output is correct
51 Correct 837 ms 451920 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1684 ms 483932 KB Output is correct
2 Correct 1758 ms 476888 KB Output is correct
3 Correct 1767 ms 506332 KB Output is correct
4 Correct 1567 ms 487632 KB Output is correct
5 Correct 1619 ms 476644 KB Output is correct
6 Correct 1777 ms 476900 KB Output is correct
7 Correct 1166 ms 506276 KB Output is correct
8 Correct 1280 ms 487636 KB Output is correct
9 Correct 1332 ms 480988 KB Output is correct
10 Correct 1456 ms 477704 KB Output is correct
11 Correct 1006 ms 476736 KB Output is correct
12 Correct 1103 ms 477648 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4623 ms 517300 KB Output is correct
2 Correct 764 ms 478128 KB Output is correct
3 Execution timed out 5057 ms 527136 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 191 ms 430776 KB Output is correct
2 Correct 171 ms 430748 KB Output is correct
3 Correct 176 ms 430772 KB Output is correct
4 Correct 167 ms 430932 KB Output is correct
5 Correct 176 ms 430848 KB Output is correct
6 Correct 172 ms 430928 KB Output is correct
7 Correct 165 ms 430932 KB Output is correct
8 Correct 166 ms 430928 KB Output is correct
9 Correct 163 ms 430932 KB Output is correct
10 Correct 165 ms 430932 KB Output is correct
11 Correct 173 ms 430932 KB Output is correct
12 Correct 172 ms 431048 KB Output is correct
13 Correct 170 ms 430928 KB Output is correct
14 Correct 172 ms 430888 KB Output is correct
15 Correct 174 ms 430932 KB Output is correct
16 Correct 171 ms 430936 KB Output is correct
17 Correct 170 ms 430980 KB Output is correct
18 Correct 173 ms 430928 KB Output is correct
19 Correct 196 ms 430932 KB Output is correct
20 Correct 171 ms 430928 KB Output is correct
21 Correct 174 ms 431044 KB Output is correct
22 Correct 179 ms 431100 KB Output is correct
23 Correct 198 ms 431088 KB Output is correct
24 Correct 170 ms 431100 KB Output is correct
25 Correct 186 ms 431188 KB Output is correct
26 Correct 167 ms 430932 KB Output is correct
27 Correct 169 ms 430932 KB Output is correct
28 Correct 174 ms 430888 KB Output is correct
29 Correct 185 ms 430928 KB Output is correct
30 Correct 179 ms 431184 KB Output is correct
31 Correct 1150 ms 451140 KB Output is correct
32 Correct 315 ms 439624 KB Output is correct
33 Correct 1123 ms 452932 KB Output is correct
34 Correct 1163 ms 452952 KB Output is correct
35 Correct 1177 ms 450972 KB Output is correct
36 Correct 1141 ms 451144 KB Output is correct
37 Correct 1025 ms 453228 KB Output is correct
38 Correct 1066 ms 453248 KB Output is correct
39 Correct 855 ms 453196 KB Output is correct
40 Correct 843 ms 453192 KB Output is correct
41 Correct 977 ms 452904 KB Output is correct
42 Correct 945 ms 452636 KB Output is correct
43 Correct 219 ms 439564 KB Output is correct
44 Correct 1070 ms 452936 KB Output is correct
45 Correct 1079 ms 452820 KB Output is correct
46 Correct 1076 ms 452668 KB Output is correct
47 Correct 756 ms 451660 KB Output is correct
48 Correct 785 ms 451400 KB Output is correct
49 Correct 827 ms 451932 KB Output is correct
50 Correct 835 ms 452680 KB Output is correct
51 Correct 837 ms 451920 KB Output is correct
52 Correct 733 ms 458312 KB Output is correct
53 Correct 781 ms 460148 KB Output is correct
54 Correct 838 ms 454308 KB Output is correct
55 Correct 768 ms 456264 KB Output is correct
56 Correct 756 ms 457036 KB Output is correct
57 Correct 881 ms 454836 KB Output is correct
58 Correct 802 ms 456004 KB Output is correct
59 Correct 758 ms 456704 KB Output is correct
60 Correct 1061 ms 455404 KB Output is correct
61 Correct 225 ms 446796 KB Output is correct
62 Correct 650 ms 459920 KB Output is correct
63 Correct 725 ms 455920 KB Output is correct
64 Correct 764 ms 455796 KB Output is correct
65 Correct 847 ms 455244 KB Output is correct
66 Correct 892 ms 454596 KB Output is correct
67 Correct 321 ms 442536 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 191 ms 430776 KB Output is correct
2 Correct 171 ms 430748 KB Output is correct
3 Correct 176 ms 430772 KB Output is correct
4 Correct 167 ms 430932 KB Output is correct
5 Correct 176 ms 430848 KB Output is correct
6 Correct 172 ms 430928 KB Output is correct
7 Correct 165 ms 430932 KB Output is correct
8 Correct 166 ms 430928 KB Output is correct
9 Correct 163 ms 430932 KB Output is correct
10 Correct 165 ms 430932 KB Output is correct
11 Correct 173 ms 430932 KB Output is correct
12 Correct 172 ms 431048 KB Output is correct
13 Correct 170 ms 430928 KB Output is correct
14 Correct 172 ms 430888 KB Output is correct
15 Correct 174 ms 430932 KB Output is correct
16 Correct 171 ms 430936 KB Output is correct
17 Correct 170 ms 430980 KB Output is correct
18 Correct 173 ms 430928 KB Output is correct
19 Correct 196 ms 430932 KB Output is correct
20 Correct 171 ms 430928 KB Output is correct
21 Correct 174 ms 431044 KB Output is correct
22 Correct 179 ms 431100 KB Output is correct
23 Correct 198 ms 431088 KB Output is correct
24 Correct 170 ms 431100 KB Output is correct
25 Correct 186 ms 431188 KB Output is correct
26 Correct 167 ms 430932 KB Output is correct
27 Correct 169 ms 430932 KB Output is correct
28 Correct 174 ms 430888 KB Output is correct
29 Correct 185 ms 430928 KB Output is correct
30 Correct 179 ms 431184 KB Output is correct
31 Correct 1150 ms 451140 KB Output is correct
32 Correct 315 ms 439624 KB Output is correct
33 Correct 1123 ms 452932 KB Output is correct
34 Correct 1163 ms 452952 KB Output is correct
35 Correct 1177 ms 450972 KB Output is correct
36 Correct 1141 ms 451144 KB Output is correct
37 Correct 1025 ms 453228 KB Output is correct
38 Correct 1066 ms 453248 KB Output is correct
39 Correct 855 ms 453196 KB Output is correct
40 Correct 843 ms 453192 KB Output is correct
41 Correct 977 ms 452904 KB Output is correct
42 Correct 945 ms 452636 KB Output is correct
43 Correct 219 ms 439564 KB Output is correct
44 Correct 1070 ms 452936 KB Output is correct
45 Correct 1079 ms 452820 KB Output is correct
46 Correct 1076 ms 452668 KB Output is correct
47 Correct 756 ms 451660 KB Output is correct
48 Correct 785 ms 451400 KB Output is correct
49 Correct 827 ms 451932 KB Output is correct
50 Correct 835 ms 452680 KB Output is correct
51 Correct 837 ms 451920 KB Output is correct
52 Correct 1684 ms 483932 KB Output is correct
53 Correct 1758 ms 476888 KB Output is correct
54 Correct 1767 ms 506332 KB Output is correct
55 Correct 1567 ms 487632 KB Output is correct
56 Correct 1619 ms 476644 KB Output is correct
57 Correct 1777 ms 476900 KB Output is correct
58 Correct 1166 ms 506276 KB Output is correct
59 Correct 1280 ms 487636 KB Output is correct
60 Correct 1332 ms 480988 KB Output is correct
61 Correct 1456 ms 477704 KB Output is correct
62 Correct 1006 ms 476736 KB Output is correct
63 Correct 1103 ms 477648 KB Output is correct
64 Correct 4623 ms 517300 KB Output is correct
65 Correct 764 ms 478128 KB Output is correct
66 Execution timed out 5057 ms 527136 KB Time limit exceeded
67 Halted 0 ms 0 KB -