oj.uz

답안 #254846

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
254846 2020-07-30T17:46:09 Z amoo_safar 새 집 (APIO18_new_home) C++11
47 / 100
 5000 ms 261108 KB 
// Zende bad Shoma nasime faghat !
#include <bits/stdc++.h>

#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'

using namespace std;

typedef pair<int, int> pii;

const int N = 3e5 + 10;

int n, q, k;
int x[N], t[N], a[N], b[N];
int y[N], c[N], ans[N];

vector<int> V;


map<int, int> mp[N];
set<int> rec[N];

multiset<int> seg[N << 2];

void Ins(int id, int l, int r, int x, int L, int R){
	if(r <= L || R <= l) return ;
	if(l <= L && R <= r){
		seg[id].insert(x);
		return ;
	}
	int mid = (L + R) >> 1;
	Ins(id << 1, l, r, x, L, mid);
	Ins(id << 1 | 1, l, r, x, mid, R);
}
void Rem(int id, int l, int r, int x, int L, int R){
	if(r <= L || R <= l) return ;
	if(l <= L && R <= r){
		seg[id].erase(seg[id].find(x));
		return ;
	}
	int mid = (L + R) >> 1;
	Rem(id << 1, l, r, x, L, mid);
	Rem(id << 1 | 1, l, r, x, mid, R);
}

int MN, MX, CNT;
void Get(int id, int idx, int L, int R){
	CNT += seg[id].size();
	if(!seg[id].empty()){
		MN = min(MN, *seg[id].begin());
		MX = max(MX, *seg[id].rbegin());
	}
	if(R - L == 1) return ;
	int mid = (L + R) >> 1;
	if(idx < mid) Get(id << 1, idx, L, mid);
	else Get(id << 1 | 1, idx, mid, R);
}

template<typename T>
T Prev(T A){return --A; };
template<typename T>
T Next(T A){return ++A; };

inline pii GetRange(pii R){
	return pii(lower_bound(all(V), R.F) - V.begin(), upper_bound(all(V), R.S) - V.begin());
}
inline pii GetRange(int tp, int pl){
	set<int>::iterator it = rec[tp].find(pl);
	int resL, resR;

	if(it == rec[tp].begin()) resL = 1;
	else resL = ( (*Prev(it)) + (*it)) / 2 + 1;

	if(Next(it) == rec[tp].end()) resR = 1e8;
	else resR = ( (*Next(it)) + (*it)) / 2;
	return pii(resL, resR);
}

int SegGet(int pl){
	//cerr << "? " << pl << '\n';
	MN = 1e8 + 1;
	MX = 0;
	CNT = 0;
	Get(1, lower_bound(all(V), pl) - V.begin(), 0, V.size());
	if(CNT != k) return -1;
	return max(MX - pl, pl - MN);
}
void SegRem(int tp, int pl){
	pii ran = GetRange(GetRange(tp, pl));
	Rem(1, ran.F, ran.S, pl, 0, V.size());
}
void SegAdd(int tp, int pl){
	pii ran = GetRange(GetRange(tp, pl));
	Ins(1, ran.F, ran.S, pl, 0, V.size());
}
void Add(int tp, int pl){
	//cerr << "+ " << tp << ' ' << pl << '\n';
	mp[tp][pl] ++;
	if(mp[tp][pl] > 1) return ;

	auto it = rec[tp].lower_bound(pl);
	int nx = -1, la = -1;
	if(it != rec[tp].end()) nx = *it;
	if(it != rec[tp].begin()) la = *Prev(it);
	if(nx != -1) SegRem(tp, nx);
	if(la != -1) SegRem(tp, la);

	rec[tp].insert(pl);
	if(nx != -1) SegAdd(tp, nx);
	if(la != -1) SegAdd(tp, la);
	SegAdd(tp, pl);
}
void Erase(int tp, int pl){
	//cerr << "- " << tp << ' ' << pl << '\n';
	mp[tp][pl] --;
	if(mp[tp][pl] > 0) return ;

	auto it = rec[tp].find(pl);
	int nx = -1, la = -1;
	
	if(Next(it) != rec[tp].end()) nx = *Next(it);
	if(it != rec[tp].begin()) la = *Prev(it);
	
	if(nx != -1) SegRem(tp, nx);
	if(la != -1) SegRem(tp, la);
	SegRem(tp, pl);

	rec[tp].erase(pl);
	
	if(nx != -1) SegAdd(tp, nx);
	if(la != -1) SegAdd(tp, la);
}

vector<int> Ea[N], Er[N], Eq[N];

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> k >> q;
	for(int i = 1; i <= n; i++){
		cin >> x[i] >> t[i] >> a[i] >> b[i];
		b[i] ++;
		V.pb(a[i]); V.pb(b[i]);
	}
	for(int i = 1; i <= q; i++){
		cin >> y[i] >> c[i];
	}

	sort(all(V)); V.resize(unique(all(V)) - V.begin());
	int AllT = V.size();
	for(int i = 1; i <= n; i++){
		a[i] = lower_bound(all(V), a[i]) - V.begin();
		b[i] = lower_bound(all(V), b[i]) - V.begin();
		Ea[a[i]].pb(i);
		Er[b[i]].pb(i);
		//cerr << "!!! " << a[i] << ' ' << b[i] << '\n';
	}
	for(int i = 1; i <= q; i++){
		if(c[i] < V[0]){
			ans[i] = -1;
			continue;
		}
		c[i] = (upper_bound(all(V), c[i]) - V.begin() ) - 1;
		Eq[c[i]].pb(i);
		//cerr << "? " << c[i] << '\n';
	}

	V.clear();
	//for(int i = 1; i <= n; i++) V.pb(x[i]);
	for(int i = 1; i <= q; i++) V.pb(y[i]);
	sort(all(V)); V.resize(unique(all(V)) - V.begin());

	for(int tm = 0; tm < AllT; tm++){
		for(auto i : Er[tm])
			Erase(t[i], x[i]);
		for(auto i : Ea[tm])
			Add(t[i], x[i]);
		for(auto i : Eq[tm])
			ans[i] = SegGet(y[i]);
		//cerr << '\n';
	}
	for(int i = 1; i <= q; i++) cout << ans[i] << '\n';
	return 0;
}
/*
4 2 4
3 1 1 10
9 2 2 4
7 2 5 7
4 1 8 10
5 3
5 6
5 9
1 10

2 1 3
1 1 1 4
1 1 2 6
1 3
1 5
1 7

1 1 1
100000000 1 1 1
1 1

*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 106104 KB Output is correct
2 Correct 63 ms 106104 KB Output is correct
3 Correct 66 ms 106104 KB Output is correct
4 Correct 58 ms 106108 KB Output is correct
5 Correct 66 ms 106232 KB Output is correct
6 Correct 65 ms 106232 KB Output is correct
7 Correct 62 ms 106104 KB Output is correct
8 Correct 63 ms 106232 KB Output is correct
9 Correct 60 ms 106232 KB Output is correct
10 Correct 65 ms 106232 KB Output is correct
11 Correct 62 ms 106104 KB Output is correct
12 Correct 64 ms 106104 KB Output is correct
13 Correct 61 ms 106104 KB Output is correct
14 Correct 62 ms 106192 KB Output is correct
15 Correct 62 ms 106232 KB Output is correct
16 Correct 67 ms 106232 KB Output is correct
17 Correct 63 ms 106236 KB Output is correct
18 Correct 63 ms 106232 KB Output is correct
19 Correct 70 ms 106144 KB Output is correct
20 Correct 71 ms 106232 KB Output is correct
21 Correct 69 ms 106104 KB Output is correct
22 Correct 62 ms 106232 KB Output is correct
23 Correct 76 ms 106232 KB Output is correct
24 Correct 63 ms 106232 KB Output is correct
25 Correct 69 ms 106232 KB Output is correct
26 Correct 63 ms 106104 KB Output is correct
27 Correct 73 ms 106232 KB Output is correct
28 Correct 62 ms 106104 KB Output is correct
29 Correct 63 ms 106104 KB Output is correct
30 Correct 61 ms 106104 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 106104 KB Output is correct
2 Correct 63 ms 106104 KB Output is correct
3 Correct 66 ms 106104 KB Output is correct
4 Correct 58 ms 106108 KB Output is correct
5 Correct 66 ms 106232 KB Output is correct
6 Correct 65 ms 106232 KB Output is correct
7 Correct 62 ms 106104 KB Output is correct
8 Correct 63 ms 106232 KB Output is correct
9 Correct 60 ms 106232 KB Output is correct
10 Correct 65 ms 106232 KB Output is correct
11 Correct 62 ms 106104 KB Output is correct
12 Correct 64 ms 106104 KB Output is correct
13 Correct 61 ms 106104 KB Output is correct
14 Correct 62 ms 106192 KB Output is correct
15 Correct 62 ms 106232 KB Output is correct
16 Correct 67 ms 106232 KB Output is correct
17 Correct 63 ms 106236 KB Output is correct
18 Correct 63 ms 106232 KB Output is correct
19 Correct 70 ms 106144 KB Output is correct
20 Correct 71 ms 106232 KB Output is correct
21 Correct 69 ms 106104 KB Output is correct
22 Correct 62 ms 106232 KB Output is correct
23 Correct 76 ms 106232 KB Output is correct
24 Correct 63 ms 106232 KB Output is correct
25 Correct 69 ms 106232 KB Output is correct
26 Correct 63 ms 106104 KB Output is correct
27 Correct 73 ms 106232 KB Output is correct
28 Correct 62 ms 106104 KB Output is correct
29 Correct 63 ms 106104 KB Output is correct
30 Correct 61 ms 106104 KB Output is correct
31 Correct 2771 ms 145260 KB Output is correct
32 Correct 113 ms 110068 KB Output is correct
33 Correct 1229 ms 124020 KB Output is correct
34 Correct 2417 ms 129300 KB Output is correct
35 Correct 2259 ms 140920 KB Output is correct
36 Correct 1277 ms 131188 KB Output is correct
37 Correct 972 ms 120436 KB Output is correct
38 Correct 750 ms 119800 KB Output is correct
39 Correct 655 ms 119412 KB Output is correct
40 Correct 643 ms 119284 KB Output is correct
41 Correct 702 ms 119668 KB Output is correct
42 Correct 752 ms 119716 KB Output is correct
43 Correct 111 ms 112116 KB Output is correct
44 Correct 707 ms 119660 KB Output is correct
45 Correct 634 ms 119496 KB Output is correct
46 Correct 558 ms 119540 KB Output is correct
47 Correct 402 ms 118768 KB Output is correct
48 Correct 409 ms 118772 KB Output is correct
49 Correct 492 ms 118900 KB Output is correct
50 Correct 600 ms 119284 KB Output is correct
51 Correct 481 ms 119020 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 106104 KB Output is correct
2 Correct 63 ms 106104 KB Output is correct
3 Correct 66 ms 106104 KB Output is correct
4 Correct 58 ms 106108 KB Output is correct
5 Correct 66 ms 106232 KB Output is correct
6 Correct 65 ms 106232 KB Output is correct
7 Correct 62 ms 106104 KB Output is correct
8 Correct 63 ms 106232 KB Output is correct
9 Correct 60 ms 106232 KB Output is correct
10 Correct 65 ms 106232 KB Output is correct
11 Correct 62 ms 106104 KB Output is correct
12 Correct 64 ms 106104 KB Output is correct
13 Correct 61 ms 106104 KB Output is correct
14 Correct 62 ms 106192 KB Output is correct
15 Correct 62 ms 106232 KB Output is correct
16 Correct 67 ms 106232 KB Output is correct
17 Correct 63 ms 106236 KB Output is correct
18 Correct 63 ms 106232 KB Output is correct
19 Correct 70 ms 106144 KB Output is correct
20 Correct 71 ms 106232 KB Output is correct
21 Correct 69 ms 106104 KB Output is correct
22 Correct 62 ms 106232 KB Output is correct
23 Correct 76 ms 106232 KB Output is correct
24 Correct 63 ms 106232 KB Output is correct
25 Correct 69 ms 106232 KB Output is correct
26 Correct 63 ms 106104 KB Output is correct
27 Correct 73 ms 106232 KB Output is correct
28 Correct 62 ms 106104 KB Output is correct
29 Correct 63 ms 106104 KB Output is correct
30 Correct 61 ms 106104 KB Output is correct
31 Correct 2771 ms 145260 KB Output is correct
32 Correct 113 ms 110068 KB Output is correct
33 Correct 1229 ms 124020 KB Output is correct
34 Correct 2417 ms 129300 KB Output is correct
35 Correct 2259 ms 140920 KB Output is correct
36 Correct 1277 ms 131188 KB Output is correct
37 Correct 972 ms 120436 KB Output is correct
38 Correct 750 ms 119800 KB Output is correct
39 Correct 655 ms 119412 KB Output is correct
40 Correct 643 ms 119284 KB Output is correct
41 Correct 702 ms 119668 KB Output is correct
42 Correct 752 ms 119716 KB Output is correct
43 Correct 111 ms 112116 KB Output is correct
44 Correct 707 ms 119660 KB Output is correct
45 Correct 634 ms 119496 KB Output is correct
46 Correct 558 ms 119540 KB Output is correct
47 Correct 402 ms 118768 KB Output is correct
48 Correct 409 ms 118772 KB Output is correct
49 Correct 492 ms 118900 KB Output is correct
50 Correct 600 ms 119284 KB Output is correct
51 Correct 481 ms 119020 KB Output is correct
52 Correct 348 ms 124916 KB Output is correct
53 Correct 322 ms 120440 KB Output is correct
54 Correct 1685 ms 148572 KB Output is correct
55 Correct 574 ms 121592 KB Output is correct
56 Correct 500 ms 122176 KB Output is correct
57 Correct 729 ms 120312 KB Output is correct
58 Correct 639 ms 121200 KB Output is correct
59 Correct 551 ms 122100 KB Output is correct
60 Correct 693 ms 119864 KB Output is correct
61 Correct 146 ms 120308 KB Output is correct
62 Correct 332 ms 124788 KB Output is correct
63 Correct 920 ms 136948 KB Output is correct
64 Correct 1193 ms 135540 KB Output is correct
65 Correct 1238 ms 124692 KB Output is correct
66 Correct 873 ms 120144 KB Output is correct
67 Correct 453 ms 115312 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 106104 KB Output is correct
2 Correct 63 ms 106104 KB Output is correct
3 Correct 66 ms 106104 KB Output is correct
4 Correct 58 ms 106108 KB Output is correct
5 Correct 66 ms 106232 KB Output is correct
6 Correct 65 ms 106232 KB Output is correct
7 Correct 62 ms 106104 KB Output is correct
8 Correct 63 ms 106232 KB Output is correct
9 Correct 60 ms 106232 KB Output is correct
10 Correct 65 ms 106232 KB Output is correct
11 Correct 62 ms 106104 KB Output is correct
12 Correct 64 ms 106104 KB Output is correct
13 Correct 61 ms 106104 KB Output is correct
14 Correct 62 ms 106192 KB Output is correct
15 Correct 62 ms 106232 KB Output is correct
16 Correct 67 ms 106232 KB Output is correct
17 Correct 63 ms 106236 KB Output is correct
18 Correct 63 ms 106232 KB Output is correct
19 Correct 70 ms 106144 KB Output is correct
20 Correct 71 ms 106232 KB Output is correct
21 Correct 69 ms 106104 KB Output is correct
22 Correct 62 ms 106232 KB Output is correct
23 Correct 76 ms 106232 KB Output is correct
24 Correct 63 ms 106232 KB Output is correct
25 Correct 69 ms 106232 KB Output is correct
26 Correct 63 ms 106104 KB Output is correct
27 Correct 73 ms 106232 KB Output is correct
28 Correct 62 ms 106104 KB Output is correct
29 Correct 63 ms 106104 KB Output is correct
30 Correct 61 ms 106104 KB Output is correct
31 Correct 2771 ms 145260 KB Output is correct
32 Correct 113 ms 110068 KB Output is correct
33 Correct 1229 ms 124020 KB Output is correct
34 Correct 2417 ms 129300 KB Output is correct
35 Correct 2259 ms 140920 KB Output is correct
36 Correct 1277 ms 131188 KB Output is correct
37 Correct 972 ms 120436 KB Output is correct
38 Correct 750 ms 119800 KB Output is correct
39 Correct 655 ms 119412 KB Output is correct
40 Correct 643 ms 119284 KB Output is correct
41 Correct 702 ms 119668 KB Output is correct
42 Correct 752 ms 119716 KB Output is correct
43 Correct 111 ms 112116 KB Output is correct
44 Correct 707 ms 119660 KB Output is correct
45 Correct 634 ms 119496 KB Output is correct
46 Correct 558 ms 119540 KB Output is correct
47 Correct 402 ms 118768 KB Output is correct
48 Correct 409 ms 118772 KB Output is correct
49 Correct 492 ms 118900 KB Output is correct
50 Correct 600 ms 119284 KB Output is correct
51 Correct 481 ms 119020 KB Output is correct
52 Execution timed out 5092 ms 261108 KB Time limit exceeded
53 Halted 0 ms 0 KB -