oj.uz

Submission #252432

# Submission time Handle Problem Language Result Execution time Memory
252432 2020-07-25T15:00:13 Z Saboon New Home (APIO18_new_home) C++14
47 / 100
 5000 ms 262984 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 3e5 + 20;
const int inf = 1e9;

set<pair<int,int>> tindex[maxn];
int ans[maxn];
vector<int> cmp;
multiset<int> seg[8*maxn];

pair<int,int> get(int id, int L, int R, int idx){
	if (R <= idx or idx < L)
		return {inf, 0};
	if (L + 1 == R){
		if (seg[id].empty())
			return {inf,0};
		return {*seg[id].begin(), *seg[id].rbegin()};
	}
	pair<int,int> ret = {inf,0};
	if (!seg[id].empty())
		ret = {*seg[id].begin(), *seg[id].rbegin()};
	int mid = (L + R) >> 1;
	auto it1 = get(2*id+0, L, mid, idx);
	auto it2 = get(2*id+1, mid, R, idx);
	ret.first = min({ret.first, it1.first, it2.first});
	ret.second = max({ret.second, it1.second, it2.second});
	return ret;
}

void change(int id, int L, int R, int l, int r, int x, char type){
	if (r <= L or R <= l)
		return;
	if (l <= L and R <= r){
		if (type == 'A')
			seg[id].insert(x);
		else
			seg[id].erase(seg[id].find(x));
		return;
	}
	int mid = (L + R) >> 1;
	change(2*id+0, L, mid, l, r, x, type);
	change(2*id+1, mid, R, l, r, x, type);
}

int m;

pair<int,int> getpre(int x, int idx, int type){
	auto it = tindex[type].lower_bound(make_pair(x,idx));
	if (it == tindex[type].end()){
		cout << "WTF";
		exit(0);
	}
	if (it == tindex[type].begin())
		return {-1,-1};
	it --;
	return *it;
}

pair<int,int> getnex(int x, int idx, int type){
	auto it = tindex[type].lower_bound(make_pair(x,idx));
	if (it == tindex[type].end()){
		cout << "WTF";
		exit(0);
	}
	it ++;
	if (it == tindex[type].end())
		return {-1,-1};
	return *it;
}

void add(int x, int idx, int type){
	if (x == -1)
		return;
	int pre = getpre(x,idx,type).first, nex = getnex(x,idx,type).first;
	if (pre == -1)
		pre = 0;
	else
		pre = lower_bound(cmp.begin(), cmp.end(), (cmp[pre]+cmp[x]+1)/2) - cmp.begin();
	if (nex == -1)
		nex = m;
	else
		nex = lower_bound(cmp.begin(), cmp.end(), (cmp[nex]+cmp[x]+1)/2) - cmp.begin();
	change(1, 0, m, pre, nex, x, 'A');
}

void del(int x, int idx, int type){
	if (x == -1)
		return;
	int pre = getpre(x,idx,type).first, nex = getnex(x,idx,type).first;
	if (pre == -1)
		pre = 0;
	else
		pre = lower_bound(cmp.begin(), cmp.end(), (cmp[pre]+cmp[x]+1)/2) - cmp.begin();
	if (nex == -1)
		nex = m;
	else
		nex = lower_bound(cmp.begin(), cmp.end(), (cmp[nex]+cmp[x]+1)/2) - cmp.begin();
	change(1, 0, m, pre, nex, x, 'D');
}

int main(){
	ios_base::sync_with_stdio(false);
	int n, k, q;
	cin >> n >> k >> q;
	vector<pair<pair<int,int>, pair<int,int>>> event;
	for (int i = 0; i < n; i++){
		int x, t, a, b;
		cin >> x >> t >> a >> b;
		event.push_back({{a,i}, {x,t}}); 
		event.push_back({{b,n+1+i}, {x,t}});
		cmp.push_back(x);
	}
	for (int i = 0; i < q; i++){
		int l, y;
		cin >> l >> y;
		cmp.push_back(l);
		event.push_back({{y,n}, {l,i}});
	}
	sort(cmp.begin(), cmp.end());
	cmp.resize(unique(cmp.begin(), cmp.end()) - cmp.begin());
	m = cmp.size();
	for (int i = 0; i < event.size(); i++)
		event[i].second.first = lower_bound(cmp.begin(), cmp.end(), event[i].second.first) - cmp.begin();
	sort(event.begin(), event.end());
	int cnt = 0;
	for (auto Q : event){
		if (Q.first.second < n){
			int x = Q.second.first, type = Q.second.second, idx = Q.first.second;
			if (tindex[type].empty())
				cnt ++;
			tindex[type].insert({x,idx});
			auto nex = getnex(x, idx, type), pre = getpre(x, idx, type);
			tindex[type].erase({x,idx});
			del(pre.first, pre.second, type);
			del(nex.first, nex.second, type);
			tindex[type].insert({x,idx});
			add(x, idx, type);
			add(pre.first, pre.second, type);
			add(nex.first, nex.second, type);
		}
		else if (Q.first.second > n){
			int x = Q.second.first, type = Q.second.second, idx = Q.first.second - n - 1;
			auto nex = getnex(x,idx,type), pre = getpre(x,idx,type);
			del(x, idx, type);
			del(pre.first, pre.second, type);
			del(nex.first, nex.second, type);
			tindex[type].erase({x,idx});
			if (tindex[type].empty())
				cnt --;
			add(pre.first, pre.second, type);
			add(nex.first, nex.second, type);
		}
		else{
			int x = Q.second.first, idx = Q.second.second;
			if (cnt < k){
				ans[idx] = -1;
				continue;
			}
			auto it = get(1, 0, m, x);
			ans[idx] = max(cmp[x]-cmp[it.first], cmp[it.second]-cmp[x]);
		}
	}
	for (int i = 0; i < q; i++)
		cout << ans[i] << '\n';
}

Compilation message

new_home.cpp: In function 'int main()':
new_home.cpp:123:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < event.size(); i++)
                  ~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 127096 KB Output is correct
2 Correct 70 ms 127096 KB Output is correct
3 Correct 69 ms 127096 KB Output is correct
4 Correct 69 ms 127096 KB Output is correct
5 Correct 64 ms 127224 KB Output is correct
6 Correct 75 ms 127224 KB Output is correct
7 Correct 66 ms 127224 KB Output is correct
8 Correct 75 ms 127352 KB Output is correct
9 Correct 77 ms 127224 KB Output is correct
10 Correct 77 ms 127224 KB Output is correct
11 Correct 64 ms 127352 KB Output is correct
12 Correct 68 ms 127196 KB Output is correct
13 Correct 64 ms 127224 KB Output is correct
14 Correct 68 ms 127224 KB Output is correct
15 Correct 65 ms 127224 KB Output is correct
16 Correct 67 ms 127260 KB Output is correct
17 Correct 68 ms 127224 KB Output is correct
18 Correct 67 ms 127224 KB Output is correct
19 Correct 65 ms 127224 KB Output is correct
20 Correct 64 ms 127224 KB Output is correct
21 Correct 64 ms 127224 KB Output is correct
22 Correct 66 ms 127236 KB Output is correct
23 Correct 65 ms 127224 KB Output is correct
24 Correct 65 ms 127224 KB Output is correct
25 Correct 64 ms 127232 KB Output is correct
26 Correct 66 ms 127232 KB Output is correct
27 Correct 74 ms 127224 KB Output is correct
28 Correct 72 ms 127224 KB Output is correct
29 Correct 65 ms 127224 KB Output is correct
30 Correct 64 ms 127232 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 127096 KB Output is correct
2 Correct 70 ms 127096 KB Output is correct
3 Correct 69 ms 127096 KB Output is correct
4 Correct 69 ms 127096 KB Output is correct
5 Correct 64 ms 127224 KB Output is correct
6 Correct 75 ms 127224 KB Output is correct
7 Correct 66 ms 127224 KB Output is correct
8 Correct 75 ms 127352 KB Output is correct
9 Correct 77 ms 127224 KB Output is correct
10 Correct 77 ms 127224 KB Output is correct
11 Correct 64 ms 127352 KB Output is correct
12 Correct 68 ms 127196 KB Output is correct
13 Correct 64 ms 127224 KB Output is correct
14 Correct 68 ms 127224 KB Output is correct
15 Correct 65 ms 127224 KB Output is correct
16 Correct 67 ms 127260 KB Output is correct
17 Correct 68 ms 127224 KB Output is correct
18 Correct 67 ms 127224 KB Output is correct
19 Correct 65 ms 127224 KB Output is correct
20 Correct 64 ms 127224 KB Output is correct
21 Correct 64 ms 127224 KB Output is correct
22 Correct 66 ms 127236 KB Output is correct
23 Correct 65 ms 127224 KB Output is correct
24 Correct 65 ms 127224 KB Output is correct
25 Correct 64 ms 127232 KB Output is correct
26 Correct 66 ms 127232 KB Output is correct
27 Correct 74 ms 127224 KB Output is correct
28 Correct 72 ms 127224 KB Output is correct
29 Correct 65 ms 127224 KB Output is correct
30 Correct 64 ms 127232 KB Output is correct
31 Correct 3107 ms 160544 KB Output is correct
32 Correct 343 ms 133004 KB Output is correct
33 Correct 1331 ms 140748 KB Output is correct
34 Correct 3018 ms 146012 KB Output is correct
35 Correct 2461 ms 158480 KB Output is correct
36 Correct 1293 ms 148608 KB Output is correct
37 Correct 937 ms 135552 KB Output is correct
38 Correct 754 ms 134912 KB Output is correct
39 Correct 673 ms 134488 KB Output is correct
40 Correct 675 ms 134400 KB Output is correct
41 Correct 604 ms 134660 KB Output is correct
42 Correct 628 ms 134472 KB Output is correct
43 Correct 196 ms 136448 KB Output is correct
44 Correct 595 ms 134656 KB Output is correct
45 Correct 570 ms 134852 KB Output is correct
46 Correct 486 ms 134656 KB Output is correct
47 Correct 349 ms 134280 KB Output is correct
48 Correct 353 ms 134280 KB Output is correct
49 Correct 431 ms 134280 KB Output is correct
50 Correct 520 ms 134528 KB Output is correct
51 Correct 431 ms 134308 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5104 ms 262984 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5098 ms 222488 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 127096 KB Output is correct
2 Correct 70 ms 127096 KB Output is correct
3 Correct 69 ms 127096 KB Output is correct
4 Correct 69 ms 127096 KB Output is correct
5 Correct 64 ms 127224 KB Output is correct
6 Correct 75 ms 127224 KB Output is correct
7 Correct 66 ms 127224 KB Output is correct
8 Correct 75 ms 127352 KB Output is correct
9 Correct 77 ms 127224 KB Output is correct
10 Correct 77 ms 127224 KB Output is correct
11 Correct 64 ms 127352 KB Output is correct
12 Correct 68 ms 127196 KB Output is correct
13 Correct 64 ms 127224 KB Output is correct
14 Correct 68 ms 127224 KB Output is correct
15 Correct 65 ms 127224 KB Output is correct
16 Correct 67 ms 127260 KB Output is correct
17 Correct 68 ms 127224 KB Output is correct
18 Correct 67 ms 127224 KB Output is correct
19 Correct 65 ms 127224 KB Output is correct
20 Correct 64 ms 127224 KB Output is correct
21 Correct 64 ms 127224 KB Output is correct
22 Correct 66 ms 127236 KB Output is correct
23 Correct 65 ms 127224 KB Output is correct
24 Correct 65 ms 127224 KB Output is correct
25 Correct 64 ms 127232 KB Output is correct
26 Correct 66 ms 127232 KB Output is correct
27 Correct 74 ms 127224 KB Output is correct
28 Correct 72 ms 127224 KB Output is correct
29 Correct 65 ms 127224 KB Output is correct
30 Correct 64 ms 127232 KB Output is correct
31 Correct 3107 ms 160544 KB Output is correct
32 Correct 343 ms 133004 KB Output is correct
33 Correct 1331 ms 140748 KB Output is correct
34 Correct 3018 ms 146012 KB Output is correct
35 Correct 2461 ms 158480 KB Output is correct
36 Correct 1293 ms 148608 KB Output is correct
37 Correct 937 ms 135552 KB Output is correct
38 Correct 754 ms 134912 KB Output is correct
39 Correct 673 ms 134488 KB Output is correct
40 Correct 675 ms 134400 KB Output is correct
41 Correct 604 ms 134660 KB Output is correct
42 Correct 628 ms 134472 KB Output is correct
43 Correct 196 ms 136448 KB Output is correct
44 Correct 595 ms 134656 KB Output is correct
45 Correct 570 ms 134852 KB Output is correct
46 Correct 486 ms 134656 KB Output is correct
47 Correct 349 ms 134280 KB Output is correct
48 Correct 353 ms 134280 KB Output is correct
49 Correct 431 ms 134280 KB Output is correct
50 Correct 520 ms 134528 KB Output is correct
51 Correct 431 ms 134308 KB Output is correct
52 Correct 245 ms 139520 KB Output is correct
53 Correct 232 ms 136192 KB Output is correct
54 Correct 1695 ms 165092 KB Output is correct
55 Correct 492 ms 136320 KB Output is correct
56 Correct 440 ms 137260 KB Output is correct
57 Correct 573 ms 135040 KB Output is correct
58 Correct 509 ms 136320 KB Output is correct
59 Correct 459 ms 137244 KB Output is correct
60 Correct 603 ms 135032 KB Output is correct
61 Correct 169 ms 139396 KB Output is correct
62 Correct 249 ms 139644 KB Output is correct
63 Correct 816 ms 152556 KB Output is correct
64 Correct 1037 ms 151776 KB Output is correct
65 Correct 1200 ms 140164 KB Output is correct
66 Correct 672 ms 134784 KB Output is correct
67 Correct 436 ms 134784 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 127096 KB Output is correct
2 Correct 70 ms 127096 KB Output is correct
3 Correct 69 ms 127096 KB Output is correct
4 Correct 69 ms 127096 KB Output is correct
5 Correct 64 ms 127224 KB Output is correct
6 Correct 75 ms 127224 KB Output is correct
7 Correct 66 ms 127224 KB Output is correct
8 Correct 75 ms 127352 KB Output is correct
9 Correct 77 ms 127224 KB Output is correct
10 Correct 77 ms 127224 KB Output is correct
11 Correct 64 ms 127352 KB Output is correct
12 Correct 68 ms 127196 KB Output is correct
13 Correct 64 ms 127224 KB Output is correct
14 Correct 68 ms 127224 KB Output is correct
15 Correct 65 ms 127224 KB Output is correct
16 Correct 67 ms 127260 KB Output is correct
17 Correct 68 ms 127224 KB Output is correct
18 Correct 67 ms 127224 KB Output is correct
19 Correct 65 ms 127224 KB Output is correct
20 Correct 64 ms 127224 KB Output is correct
21 Correct 64 ms 127224 KB Output is correct
22 Correct 66 ms 127236 KB Output is correct
23 Correct 65 ms 127224 KB Output is correct
24 Correct 65 ms 127224 KB Output is correct
25 Correct 64 ms 127232 KB Output is correct
26 Correct 66 ms 127232 KB Output is correct
27 Correct 74 ms 127224 KB Output is correct
28 Correct 72 ms 127224 KB Output is correct
29 Correct 65 ms 127224 KB Output is correct
30 Correct 64 ms 127232 KB Output is correct
31 Correct 3107 ms 160544 KB Output is correct
32 Correct 343 ms 133004 KB Output is correct
33 Correct 1331 ms 140748 KB Output is correct
34 Correct 3018 ms 146012 KB Output is correct
35 Correct 2461 ms 158480 KB Output is correct
36 Correct 1293 ms 148608 KB Output is correct
37 Correct 937 ms 135552 KB Output is correct
38 Correct 754 ms 134912 KB Output is correct
39 Correct 673 ms 134488 KB Output is correct
40 Correct 675 ms 134400 KB Output is correct
41 Correct 604 ms 134660 KB Output is correct
42 Correct 628 ms 134472 KB Output is correct
43 Correct 196 ms 136448 KB Output is correct
44 Correct 595 ms 134656 KB Output is correct
45 Correct 570 ms 134852 KB Output is correct
46 Correct 486 ms 134656 KB Output is correct
47 Correct 349 ms 134280 KB Output is correct
48 Correct 353 ms 134280 KB Output is correct
49 Correct 431 ms 134280 KB Output is correct
50 Correct 520 ms 134528 KB Output is correct
51 Correct 431 ms 134308 KB Output is correct
52 Execution timed out 5104 ms 262984 KB Time limit exceeded
53 Halted 0 ms 0 KB -