oj.uz

답안 #1014203

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1014203 2024-07-04T14:00:21 Z pcc 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 481584 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];
	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(){

	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 152 ms 387920 KB Output is correct
2 Correct 150 ms 387924 KB Output is correct
3 Correct 146 ms 387792 KB Output is correct
4 Correct 158 ms 387720 KB Output is correct
5 Correct 201 ms 387948 KB Output is correct
6 Correct 155 ms 387928 KB Output is correct
7 Correct 171 ms 387920 KB Output is correct
8 Correct 159 ms 387884 KB Output is correct
9 Correct 152 ms 387920 KB Output is correct
10 Correct 158 ms 387872 KB Output is correct
11 Correct 159 ms 388180 KB Output is correct
12 Correct 160 ms 387904 KB Output is correct
13 Correct 161 ms 387924 KB Output is correct
14 Correct 165 ms 387840 KB Output is correct
15 Correct 160 ms 387924 KB Output is correct
16 Correct 154 ms 387920 KB Output is correct
17 Correct 161 ms 387920 KB Output is correct
18 Correct 165 ms 387916 KB Output is correct
19 Correct 161 ms 387936 KB Output is correct
20 Correct 161 ms 388048 KB Output is correct
21 Correct 157 ms 387924 KB Output is correct
22 Correct 156 ms 387920 KB Output is correct
23 Correct 159 ms 387916 KB Output is correct
24 Correct 158 ms 387920 KB Output is correct
25 Correct 159 ms 387920 KB Output is correct
26 Correct 157 ms 387860 KB Output is correct
27 Correct 158 ms 387924 KB Output is correct
28 Correct 154 ms 387920 KB Output is correct
29 Correct 156 ms 387920 KB Output is correct
30 Correct 152 ms 387800 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 387920 KB Output is correct
2 Correct 150 ms 387924 KB Output is correct
3 Correct 146 ms 387792 KB Output is correct
4 Correct 158 ms 387720 KB Output is correct
5 Correct 201 ms 387948 KB Output is correct
6 Correct 155 ms 387928 KB Output is correct
7 Correct 171 ms 387920 KB Output is correct
8 Correct 159 ms 387884 KB Output is correct
9 Correct 152 ms 387920 KB Output is correct
10 Correct 158 ms 387872 KB Output is correct
11 Correct 159 ms 388180 KB Output is correct
12 Correct 160 ms 387904 KB Output is correct
13 Correct 161 ms 387924 KB Output is correct
14 Correct 165 ms 387840 KB Output is correct
15 Correct 160 ms 387924 KB Output is correct
16 Correct 154 ms 387920 KB Output is correct
17 Correct 161 ms 387920 KB Output is correct
18 Correct 165 ms 387916 KB Output is correct
19 Correct 161 ms 387936 KB Output is correct
20 Correct 161 ms 388048 KB Output is correct
21 Correct 157 ms 387924 KB Output is correct
22 Correct 156 ms 387920 KB Output is correct
23 Correct 159 ms 387916 KB Output is correct
24 Correct 158 ms 387920 KB Output is correct
25 Correct 159 ms 387920 KB Output is correct
26 Correct 157 ms 387860 KB Output is correct
27 Correct 158 ms 387924 KB Output is correct
28 Correct 154 ms 387920 KB Output is correct
29 Correct 156 ms 387920 KB Output is correct
30 Correct 152 ms 387800 KB Output is correct
31 Correct 1136 ms 410820 KB Output is correct
32 Correct 277 ms 397504 KB Output is correct
33 Correct 1131 ms 412356 KB Output is correct
34 Correct 1417 ms 412632 KB Output is correct
35 Correct 1246 ms 410560 KB Output is correct
36 Correct 1281 ms 410564 KB Output is correct
37 Correct 1073 ms 412792 KB Output is correct
38 Correct 1181 ms 412664 KB Output is correct
39 Correct 861 ms 412740 KB Output is correct
40 Correct 883 ms 412732 KB Output is correct
41 Correct 980 ms 412352 KB Output is correct
42 Correct 980 ms 412356 KB Output is correct
43 Correct 252 ms 399000 KB Output is correct
44 Correct 999 ms 412556 KB Output is correct
45 Correct 1002 ms 412200 KB Output is correct
46 Correct 1059 ms 412104 KB Output is correct
47 Correct 720 ms 411076 KB Output is correct
48 Correct 740 ms 410820 KB Output is correct
49 Correct 790 ms 411628 KB Output is correct
50 Correct 856 ms 412376 KB Output is correct
51 Correct 901 ms 411284 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1863 ms 452564 KB Output is correct
2 Correct 1956 ms 444324 KB Output is correct
3 Correct 1811 ms 474776 KB Output is correct
4 Correct 1849 ms 452140 KB Output is correct
5 Correct 1974 ms 440256 KB Output is correct
6 Correct 2045 ms 440584 KB Output is correct
7 Correct 1317 ms 470788 KB Output is correct
8 Correct 1536 ms 451652 KB Output is correct
9 Correct 1626 ms 445012 KB Output is correct
10 Correct 1779 ms 441556 KB Output is correct
11 Correct 1288 ms 440184 KB Output is correct
12 Correct 1436 ms 441420 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 387920 KB Output is correct
2 Correct 150 ms 387924 KB Output is correct
3 Correct 146 ms 387792 KB Output is correct
4 Correct 158 ms 387720 KB Output is correct
5 Correct 201 ms 387948 KB Output is correct
6 Correct 155 ms 387928 KB Output is correct
7 Correct 171 ms 387920 KB Output is correct
8 Correct 159 ms 387884 KB Output is correct
9 Correct 152 ms 387920 KB Output is correct
10 Correct 158 ms 387872 KB Output is correct
11 Correct 159 ms 388180 KB Output is correct
12 Correct 160 ms 387904 KB Output is correct
13 Correct 161 ms 387924 KB Output is correct
14 Correct 165 ms 387840 KB Output is correct
15 Correct 160 ms 387924 KB Output is correct
16 Correct 154 ms 387920 KB Output is correct
17 Correct 161 ms 387920 KB Output is correct
18 Correct 165 ms 387916 KB Output is correct
19 Correct 161 ms 387936 KB Output is correct
20 Correct 161 ms 388048 KB Output is correct
21 Correct 157 ms 387924 KB Output is correct
22 Correct 156 ms 387920 KB Output is correct
23 Correct 159 ms 387916 KB Output is correct
24 Correct 158 ms 387920 KB Output is correct
25 Correct 159 ms 387920 KB Output is correct
26 Correct 157 ms 387860 KB Output is correct
27 Correct 158 ms 387924 KB Output is correct
28 Correct 154 ms 387920 KB Output is correct
29 Correct 156 ms 387920 KB Output is correct
30 Correct 152 ms 387800 KB Output is correct
31 Correct 1136 ms 410820 KB Output is correct
32 Correct 277 ms 397504 KB Output is correct
33 Correct 1131 ms 412356 KB Output is correct
34 Correct 1417 ms 412632 KB Output is correct
35 Correct 1246 ms 410560 KB Output is correct
36 Correct 1281 ms 410564 KB Output is correct
37 Correct 1073 ms 412792 KB Output is correct
38 Correct 1181 ms 412664 KB Output is correct
39 Correct 861 ms 412740 KB Output is correct
40 Correct 883 ms 412732 KB Output is correct
41 Correct 980 ms 412352 KB Output is correct
42 Correct 980 ms 412356 KB Output is correct
43 Correct 252 ms 399000 KB Output is correct
44 Correct 999 ms 412556 KB Output is correct
45 Correct 1002 ms 412200 KB Output is correct
46 Correct 1059 ms 412104 KB Output is correct
47 Correct 720 ms 411076 KB Output is correct
48 Correct 740 ms 410820 KB Output is correct
49 Correct 790 ms 411628 KB Output is correct
50 Correct 856 ms 412376 KB Output is correct
51 Correct 901 ms 411284 KB Output is correct
52 Correct 845 ms 416200 KB Output is correct
53 Correct 800 ms 418156 KB Output is correct
54 Correct 916 ms 412360 KB Output is correct
55 Correct 903 ms 414148 KB Output is correct
56 Correct 816 ms 414920 KB Output is correct
57 Correct 970 ms 412872 KB Output is correct
58 Correct 948 ms 413904 KB Output is correct
59 Correct 832 ms 414664 KB Output is correct
60 Correct 996 ms 413380 KB Output is correct
61 Correct 251 ms 404376 KB Output is correct
62 Correct 790 ms 417856 KB Output is correct
63 Correct 827 ms 413940 KB Output is correct
64 Correct 904 ms 413636 KB Output is correct
65 Correct 903 ms 413128 KB Output is correct
66 Correct 1033 ms 412364 KB Output is correct
67 Correct 343 ms 400040 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 387920 KB Output is correct
2 Correct 150 ms 387924 KB Output is correct
3 Correct 146 ms 387792 KB Output is correct
4 Correct 158 ms 387720 KB Output is correct
5 Correct 201 ms 387948 KB Output is correct
6 Correct 155 ms 387928 KB Output is correct
7 Correct 171 ms 387920 KB Output is correct
8 Correct 159 ms 387884 KB Output is correct
9 Correct 152 ms 387920 KB Output is correct
10 Correct 158 ms 387872 KB Output is correct
11 Correct 159 ms 388180 KB Output is correct
12 Correct 160 ms 387904 KB Output is correct
13 Correct 161 ms 387924 KB Output is correct
14 Correct 165 ms 387840 KB Output is correct
15 Correct 160 ms 387924 KB Output is correct
16 Correct 154 ms 387920 KB Output is correct
17 Correct 161 ms 387920 KB Output is correct
18 Correct 165 ms 387916 KB Output is correct
19 Correct 161 ms 387936 KB Output is correct
20 Correct 161 ms 388048 KB Output is correct
21 Correct 157 ms 387924 KB Output is correct
22 Correct 156 ms 387920 KB Output is correct
23 Correct 159 ms 387916 KB Output is correct
24 Correct 158 ms 387920 KB Output is correct
25 Correct 159 ms 387920 KB Output is correct
26 Correct 157 ms 387860 KB Output is correct
27 Correct 158 ms 387924 KB Output is correct
28 Correct 154 ms 387920 KB Output is correct
29 Correct 156 ms 387920 KB Output is correct
30 Correct 152 ms 387800 KB Output is correct
31 Correct 1136 ms 410820 KB Output is correct
32 Correct 277 ms 397504 KB Output is correct
33 Correct 1131 ms 412356 KB Output is correct
34 Correct 1417 ms 412632 KB Output is correct
35 Correct 1246 ms 410560 KB Output is correct
36 Correct 1281 ms 410564 KB Output is correct
37 Correct 1073 ms 412792 KB Output is correct
38 Correct 1181 ms 412664 KB Output is correct
39 Correct 861 ms 412740 KB Output is correct
40 Correct 883 ms 412732 KB Output is correct
41 Correct 980 ms 412352 KB Output is correct
42 Correct 980 ms 412356 KB Output is correct
43 Correct 252 ms 399000 KB Output is correct
44 Correct 999 ms 412556 KB Output is correct
45 Correct 1002 ms 412200 KB Output is correct
46 Correct 1059 ms 412104 KB Output is correct
47 Correct 720 ms 411076 KB Output is correct
48 Correct 740 ms 410820 KB Output is correct
49 Correct 790 ms 411628 KB Output is correct
50 Correct 856 ms 412376 KB Output is correct
51 Correct 901 ms 411284 KB Output is correct
52 Correct 1863 ms 452564 KB Output is correct
53 Correct 1956 ms 444324 KB Output is correct
54 Correct 1811 ms 474776 KB Output is correct
55 Correct 1849 ms 452140 KB Output is correct
56 Correct 1974 ms 440256 KB Output is correct
57 Correct 2045 ms 440584 KB Output is correct
58 Correct 1317 ms 470788 KB Output is correct
59 Correct 1536 ms 451652 KB Output is correct
60 Correct 1626 ms 445012 KB Output is correct
61 Correct 1779 ms 441556 KB Output is correct
62 Correct 1288 ms 440184 KB Output is correct
63 Correct 1436 ms 441420 KB Output is correct
64 Execution timed out 5028 ms 481584 KB Time limit exceeded
65 Halted 0 ms 0 KB -