Submission #49561

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
49561	2018-05-31T09:58:04 Z	Diuven	New Home (APIO18_new_home)	C++11	57 / 100	5000 ms	139432 KB

new_home

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef priority_queue<pii, vector<pii>, greater<pii>> min_heap;
const int MX=300010, inf=1<<29;

struct SHOP {
	int x, type, s, e, idx;
} S[MX];

struct QUERY {
	int x, t, idx, ans;
} Q[MX];

inline int max(int x, int y){ return x>y ? x : y; }

int n, q, k;

void input(){
	cin>>n>>k>>q;
	for(int i=1; i<=n; i++){
		int t, x, s, e;
		cin>>x>>t>>s>>e;
		S[i]={x,t,s,e,i};
	}
	for(int i=1; i<=q; i++){
		int x, t;
		cin>>x>>t;
		Q[i]={x,t,i};
	}
}

vector<int> X;
int xmax;

int lo(int x){
	return upper_bound(X.begin(), X.end(), x)-X.begin()-1;
}
int hi(int x){
	return lower_bound(X.begin(), X.end(), x)-X.begin();
}

void prec(){
	for(int i=1; i<=n; i++){
		S[i].x*=2;
	}
	for(int i=1; i<=q; i++){
		Q[i].x*=2;
		X.push_back(Q[i].x);
	}
	sort(X.begin(), X.end());
	X.resize(unique(X.begin(), X.end())-X.begin());
	xmax=X.size()-1U;
}

//////

multiset<int> pos[MX];
int nonzero_cnt;

// seg

struct SegTree {
	int tree[4*MX]={};
	multiset<int> leaf[MX];
	// [0, xmax]

	void init(){
		for(int i=1; i<=4*xmax; i++) tree[i]=-inf;
	}

	int mx(int v, int s, int e, int l, int r){
		if(r<s || e<l) return -inf;
		if(l<=s && e<=r) return tree[v];
		return max(mx(v*2, s, (s+e)/2, l, r), mx(v*2+1, (s+e)/2+1, e, l, r));
	}
	int mx(int l, int r){
		return mx(1,0,xmax,l,r);
	}
	void upt(int v, int s, int e, int x){
		if(x<s || e<x) return;
		if(s==e){
			if(leaf[x].empty()) tree[v]=-inf;
			else tree[v]=*leaf[x].rbegin();
			return;
		}
		upt(v*2, s, (s+e)/2, x);
		upt(v*2+1, (s+e)/2+1, e, x);
		tree[v]=max(tree[v*2], tree[v*2+1]);
	}
	void put(int x, int val){
		if(x<0 || xmax<x) return;
		leaf[x].insert(val);
		upt(1,0,xmax,x);
	}
	void pop(int x, int val){
		if(x<0 || xmax<x) return;
		leaf[x].erase(leaf[x].find(val));
		upt(1,0,xmax,x);
	}
} Seg1, Seg2;

// 1이 /, 2가 \
1: max(y-x), 2: max(y+x)

void add(int x1, int x2){
	int mx=(0LL+x1+x2)/2, my=(0LL+x2-x1)/2;
	Seg1.put(lo(mx), my-mx);
	Seg2.put(hi(mx), my+mx);
}

void del(int x1, int x2){
	int mx=(0LL+x1+x2)/2, my=(0LL+x2-x1)/2;
	Seg1.pop(lo(mx), my-mx);
	Seg2.pop(hi(mx), my+mx);
}

int find(int qx){
	if(nonzero_cnt<k) return -2;
	int x=lo(qx);
	int ans=max(Seg1.mx(x, xmax)+qx, Seg2.mx(0, x)-qx);
	return ans;
}

////

void add_store(int idx){
	multiset<int> &stores = pos[S[idx].type];

	if(stores.size()==2U) nonzero_cnt++;

	int x=S[idx].x;

	if(stores.find(x)==stores.end()){
		auto it1=stores.lower_bound(x);
		auto it2=stores.lower_bound(x); it2--;
		int lx=*it2, rx=*it1;
		del(lx, rx);
		add(lx, x); add(x, rx);
	}

	stores.insert(x);
}

void del_store(int idx){
	multiset<int> &stores = pos[S[idx].type];

	if(stores.size()==3U) nonzero_cnt--;

	int x=S[idx].x;

	stores.erase(stores.find(x));

	if(stores.find(x)!=stores.end())
		return;

	auto it1=stores.lower_bound(x);
	auto it2=stores.lower_bound(x); it2--;
	int lx=*it2, rx=*it1;
	del(lx, x); del(x, rx);
	add(lx, rx);
}

void init(){
	Seg1.init();
	Seg2.init();
	for(int i=1; i<=k; i++){
		pos[i].insert(inf);
		pos[i].insert(-inf);
		add(-inf, inf);
	}
}

void solve(){
	min_heap in, out;
	for(int i=1; i<=n; i++){
		in.push({S[i].s, i});
		out.push({S[i].e, i});
	}
	sort(Q+1, Q+q+1, [](QUERY &a, QUERY &b){ return a.t<b.t; });

	init();

	for(int i=1; i<=q; i++){
		int qt=Q[i].t, qx=Q[i].x;
		while(!in.empty()){
			int t,idx; tie(t,idx)=in.top();
			if(qt<t) break;
			in.pop();
			add_store(idx);
		}
		while(!out.empty()){
			int t,idx; tie(t,idx)=out.top();
			if(qt<=t) break;
			out.pop();
			del_store(idx);
		}
		Q[i].ans=find(qx);
	}
}


int main(){
	ios::sync_with_stdio(0); cin.tie(0);
	input();
	prec();
	solve();

	sort(Q+1, Q+q+1, [](QUERY &a, QUERY &b){ return a.idx<b.idx; });
	for(int i=1; i<=q; i++){
		cout<<Q[i].ans/2<<'\n';
	}
	return 0;
}

Compilation message

new_home.cpp:104:1: warning: multi-line comment [-Wcomment]
 // 1이 /, 2가 \
 ^

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	41 ms	51960 KB	Output is correct
2	Correct	44 ms	52196 KB	Output is correct
3	Correct	40 ms	52196 KB	Output is correct
4	Correct	45 ms	52196 KB	Output is correct
5	Correct	53 ms	52376 KB	Output is correct
6	Correct	42 ms	52376 KB	Output is correct
7	Correct	41 ms	52376 KB	Output is correct
8	Correct	43 ms	52376 KB	Output is correct
9	Correct	46 ms	52376 KB	Output is correct
10	Correct	46 ms	52376 KB	Output is correct
11	Correct	46 ms	52376 KB	Output is correct
12	Correct	47 ms	52376 KB	Output is correct
13	Correct	52 ms	52376 KB	Output is correct
14	Correct	46 ms	52376 KB	Output is correct
15	Correct	46 ms	52376 KB	Output is correct
16	Correct	46 ms	52376 KB	Output is correct
17	Correct	50 ms	52376 KB	Output is correct
18	Correct	47 ms	52376 KB	Output is correct
19	Correct	52 ms	52376 KB	Output is correct
20	Correct	46 ms	52376 KB	Output is correct
21	Correct	45 ms	52376 KB	Output is correct
22	Correct	49 ms	52376 KB	Output is correct
23	Correct	48 ms	52376 KB	Output is correct
24	Correct	46 ms	52376 KB	Output is correct
25	Correct	47 ms	52376 KB	Output is correct
26	Correct	49 ms	52376 KB	Output is correct
27	Correct	46 ms	52376 KB	Output is correct
28	Correct	45 ms	52376 KB	Output is correct
29	Correct	46 ms	52376 KB	Output is correct
30	Correct	48 ms	52376 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	41 ms	51960 KB	Output is correct
2	Correct	44 ms	52196 KB	Output is correct
3	Correct	40 ms	52196 KB	Output is correct
4	Correct	45 ms	52196 KB	Output is correct
5	Correct	53 ms	52376 KB	Output is correct
6	Correct	42 ms	52376 KB	Output is correct
7	Correct	41 ms	52376 KB	Output is correct
8	Correct	43 ms	52376 KB	Output is correct
9	Correct	46 ms	52376 KB	Output is correct
10	Correct	46 ms	52376 KB	Output is correct
11	Correct	46 ms	52376 KB	Output is correct
12	Correct	47 ms	52376 KB	Output is correct
13	Correct	52 ms	52376 KB	Output is correct
14	Correct	46 ms	52376 KB	Output is correct
15	Correct	46 ms	52376 KB	Output is correct
16	Correct	46 ms	52376 KB	Output is correct
17	Correct	50 ms	52376 KB	Output is correct
18	Correct	47 ms	52376 KB	Output is correct
19	Correct	52 ms	52376 KB	Output is correct
20	Correct	46 ms	52376 KB	Output is correct
21	Correct	45 ms	52376 KB	Output is correct
22	Correct	49 ms	52376 KB	Output is correct
23	Correct	48 ms	52376 KB	Output is correct
24	Correct	46 ms	52376 KB	Output is correct
25	Correct	47 ms	52376 KB	Output is correct
26	Correct	49 ms	52376 KB	Output is correct
27	Correct	46 ms	52376 KB	Output is correct
28	Correct	45 ms	52376 KB	Output is correct
29	Correct	46 ms	52376 KB	Output is correct
30	Correct	48 ms	52376 KB	Output is correct
31	Correct	901 ms	64116 KB	Output is correct
32	Correct	164 ms	64116 KB	Output is correct
33	Correct	806 ms	64116 KB	Output is correct
34	Correct	839 ms	64116 KB	Output is correct
35	Correct	883 ms	64164 KB	Output is correct
36	Correct	869 ms	64176 KB	Output is correct
37	Correct	589 ms	64176 KB	Output is correct
38	Correct	580 ms	64176 KB	Output is correct
39	Correct	432 ms	64176 KB	Output is correct
40	Correct	448 ms	64176 KB	Output is correct
41	Correct	455 ms	64176 KB	Output is correct
42	Correct	424 ms	64176 KB	Output is correct
43	Correct	124 ms	64176 KB	Output is correct
44	Correct	526 ms	64176 KB	Output is correct
45	Correct	473 ms	64176 KB	Output is correct
46	Correct	394 ms	64176 KB	Output is correct
47	Correct	265 ms	64176 KB	Output is correct
48	Correct	271 ms	64176 KB	Output is correct
49	Correct	301 ms	64176 KB	Output is correct
50	Correct	339 ms	64176 KB	Output is correct
51	Correct	292 ms	64176 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2647 ms	116784 KB	Output is correct
2	Correct	2615 ms	116784 KB	Output is correct
3	Correct	2483 ms	139432 KB	Output is correct
4	Correct	2343 ms	139432 KB	Output is correct
5	Correct	2325 ms	139432 KB	Output is correct
6	Correct	2806 ms	139432 KB	Output is correct
7	Correct	1856 ms	139432 KB	Output is correct
8	Correct	1804 ms	139432 KB	Output is correct
9	Correct	1905 ms	139432 KB	Output is correct
10	Correct	2197 ms	139432 KB	Output is correct
11	Correct	1374 ms	139432 KB	Output is correct
12	Correct	1437 ms	139432 KB	Output is correct

Subtask #4
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4338 ms	139432 KB	Output is correct
2	Correct	751 ms	139432 KB	Output is correct
3	Execution timed out	5013 ms	139432 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #5
35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	41 ms	51960 KB	Output is correct
2	Correct	44 ms	52196 KB	Output is correct
3	Correct	40 ms	52196 KB	Output is correct
4	Correct	45 ms	52196 KB	Output is correct
5	Correct	53 ms	52376 KB	Output is correct
6	Correct	42 ms	52376 KB	Output is correct
7	Correct	41 ms	52376 KB	Output is correct
8	Correct	43 ms	52376 KB	Output is correct
9	Correct	46 ms	52376 KB	Output is correct
10	Correct	46 ms	52376 KB	Output is correct
11	Correct	46 ms	52376 KB	Output is correct
12	Correct	47 ms	52376 KB	Output is correct
13	Correct	52 ms	52376 KB	Output is correct
14	Correct	46 ms	52376 KB	Output is correct
15	Correct	46 ms	52376 KB	Output is correct
16	Correct	46 ms	52376 KB	Output is correct
17	Correct	50 ms	52376 KB	Output is correct
18	Correct	47 ms	52376 KB	Output is correct
19	Correct	52 ms	52376 KB	Output is correct
20	Correct	46 ms	52376 KB	Output is correct
21	Correct	45 ms	52376 KB	Output is correct
22	Correct	49 ms	52376 KB	Output is correct
23	Correct	48 ms	52376 KB	Output is correct
24	Correct	46 ms	52376 KB	Output is correct
25	Correct	47 ms	52376 KB	Output is correct
26	Correct	49 ms	52376 KB	Output is correct
27	Correct	46 ms	52376 KB	Output is correct
28	Correct	45 ms	52376 KB	Output is correct
29	Correct	46 ms	52376 KB	Output is correct
30	Correct	48 ms	52376 KB	Output is correct
31	Correct	901 ms	64116 KB	Output is correct
32	Correct	164 ms	64116 KB	Output is correct
33	Correct	806 ms	64116 KB	Output is correct
34	Correct	839 ms	64116 KB	Output is correct
35	Correct	883 ms	64164 KB	Output is correct
36	Correct	869 ms	64176 KB	Output is correct
37	Correct	589 ms	64176 KB	Output is correct
38	Correct	580 ms	64176 KB	Output is correct
39	Correct	432 ms	64176 KB	Output is correct
40	Correct	448 ms	64176 KB	Output is correct
41	Correct	455 ms	64176 KB	Output is correct
42	Correct	424 ms	64176 KB	Output is correct
43	Correct	124 ms	64176 KB	Output is correct
44	Correct	526 ms	64176 KB	Output is correct
45	Correct	473 ms	64176 KB	Output is correct
46	Correct	394 ms	64176 KB	Output is correct
47	Correct	265 ms	64176 KB	Output is correct
48	Correct	271 ms	64176 KB	Output is correct
49	Correct	301 ms	64176 KB	Output is correct
50	Correct	339 ms	64176 KB	Output is correct
51	Correct	292 ms	64176 KB	Output is correct
52	Correct	603 ms	139432 KB	Output is correct
53	Correct	531 ms	139432 KB	Output is correct
54	Correct	679 ms	139432 KB	Output is correct
55	Correct	529 ms	139432 KB	Output is correct
56	Correct	534 ms	139432 KB	Output is correct
57	Correct	504 ms	139432 KB	Output is correct
58	Correct	527 ms	139432 KB	Output is correct
59	Correct	630 ms	139432 KB	Output is correct
60	Correct	480 ms	139432 KB	Output is correct
61	Correct	207 ms	139432 KB	Output is correct
62	Correct	550 ms	139432 KB	Output is correct
63	Correct	631 ms	139432 KB	Output is correct
64	Correct	707 ms	139432 KB	Output is correct
65	Correct	598 ms	139432 KB	Output is correct
66	Correct	476 ms	139432 KB	Output is correct
67	Correct	407 ms	139432 KB	Output is correct

Subtask #6
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	41 ms	51960 KB	Output is correct
2	Correct	44 ms	52196 KB	Output is correct
3	Correct	40 ms	52196 KB	Output is correct
4	Correct	45 ms	52196 KB	Output is correct
5	Correct	53 ms	52376 KB	Output is correct
6	Correct	42 ms	52376 KB	Output is correct
7	Correct	41 ms	52376 KB	Output is correct
8	Correct	43 ms	52376 KB	Output is correct
9	Correct	46 ms	52376 KB	Output is correct
10	Correct	46 ms	52376 KB	Output is correct
11	Correct	46 ms	52376 KB	Output is correct
12	Correct	47 ms	52376 KB	Output is correct
13	Correct	52 ms	52376 KB	Output is correct
14	Correct	46 ms	52376 KB	Output is correct
15	Correct	46 ms	52376 KB	Output is correct
16	Correct	46 ms	52376 KB	Output is correct
17	Correct	50 ms	52376 KB	Output is correct
18	Correct	47 ms	52376 KB	Output is correct
19	Correct	52 ms	52376 KB	Output is correct
20	Correct	46 ms	52376 KB	Output is correct
21	Correct	45 ms	52376 KB	Output is correct
22	Correct	49 ms	52376 KB	Output is correct
23	Correct	48 ms	52376 KB	Output is correct
24	Correct	46 ms	52376 KB	Output is correct
25	Correct	47 ms	52376 KB	Output is correct
26	Correct	49 ms	52376 KB	Output is correct
27	Correct	46 ms	52376 KB	Output is correct
28	Correct	45 ms	52376 KB	Output is correct
29	Correct	46 ms	52376 KB	Output is correct
30	Correct	48 ms	52376 KB	Output is correct
31	Correct	901 ms	64116 KB	Output is correct
32	Correct	164 ms	64116 KB	Output is correct
33	Correct	806 ms	64116 KB	Output is correct
34	Correct	839 ms	64116 KB	Output is correct
35	Correct	883 ms	64164 KB	Output is correct
36	Correct	869 ms	64176 KB	Output is correct
37	Correct	589 ms	64176 KB	Output is correct
38	Correct	580 ms	64176 KB	Output is correct
39	Correct	432 ms	64176 KB	Output is correct
40	Correct	448 ms	64176 KB	Output is correct
41	Correct	455 ms	64176 KB	Output is correct
42	Correct	424 ms	64176 KB	Output is correct
43	Correct	124 ms	64176 KB	Output is correct
44	Correct	526 ms	64176 KB	Output is correct
45	Correct	473 ms	64176 KB	Output is correct
46	Correct	394 ms	64176 KB	Output is correct
47	Correct	265 ms	64176 KB	Output is correct
48	Correct	271 ms	64176 KB	Output is correct
49	Correct	301 ms	64176 KB	Output is correct
50	Correct	339 ms	64176 KB	Output is correct
51	Correct	292 ms	64176 KB	Output is correct
52	Correct	2647 ms	116784 KB	Output is correct
53	Correct	2615 ms	116784 KB	Output is correct
54	Correct	2483 ms	139432 KB	Output is correct
55	Correct	2343 ms	139432 KB	Output is correct
56	Correct	2325 ms	139432 KB	Output is correct
57	Correct	2806 ms	139432 KB	Output is correct
58	Correct	1856 ms	139432 KB	Output is correct
59	Correct	1804 ms	139432 KB	Output is correct
60	Correct	1905 ms	139432 KB	Output is correct
61	Correct	2197 ms	139432 KB	Output is correct
62	Correct	1374 ms	139432 KB	Output is correct
63	Correct	1437 ms	139432 KB	Output is correct
64	Correct	4338 ms	139432 KB	Output is correct
65	Correct	751 ms	139432 KB	Output is correct
66	Execution timed out	5013 ms	139432 KB	Time limit exceeded
67	Halted	0 ms	0 KB	-

Submission #49561

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 10.0 / 10.0

Subtask #4 0 / 23.0

Subtask #5 35.0 / 35.0

Subtask #6 0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
10.0 / 10.0

Subtask #4
0 / 23.0

Subtask #5
35.0 / 35.0

Subtask #6
0 / 20.0