oj.uz

답안 #254894

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
254894 2020-07-30T19:50:52 Z amoo_safar 새 집 (APIO18_new_home) C++14
47 / 100
 5000 ms 274400 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;
const int Log = 19;

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

vector<int> V;


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

vector<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].pb(x << 2);
		//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].pb((x << 2) | 1);
		//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, QN;
void Get(int id, int idx, int L, int R){
	seg[id].pb((QN << 2) | 2);
	/*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 qn){
	QN = qn;
	int pl = y[qn];
	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 fen[N];
void AddFen(int idx, int d){
	for(; idx < N; idx += (idx & -idx))
		fen[idx] += d;
}
int GetFen(int idx){
	int res = 0;
	for(; idx; idx -= (idx & -idx))
		res += fen[idx];
	return res;
}



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(i);
		//cerr << '\n';
	}
	
	V.clear();
	V.pb(-1);
	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());

	int et, val;
	for(int i = 0; i < 4*N; i++){
		if(seg[i].empty()) continue;
		//cerr << "# " << i << '\n';
		for(auto &ev : seg[i]){
			val = ev >> 2;
			et = ev & 3;
			//cerr << "! " << val << ' ' << et << '\n';
			if(et == 0){
				AddFen(lower_bound(all(V), val) - V.begin(), 1);
				continue;
			}
			if(et == 1){
				AddFen(lower_bound(all(V), val) - V.begin(), -1);
				continue;
			}
			int sm = GetFen(N - 1);
			if(sm == 0) continue;
			cn[val] += sm;
			int mn = 0;
			for(int j = 1 << (Log - 1); j ; j >>= 1){
				if((mn | j) < N && fen[mn | j] == 0) mn |= j;
			}
			mn = V[mn + 1];
			ans[val] = max(ans[val], y[val] - mn);
			
			int mx = 0;
			for(int j = 1 << (Log - 1); j ; j >>= 1){
				if((mx | j) < N && fen[mx | j] < sm){
					mx |= j;
					sm -= fen[mx];
				}
			}
			mx = V[mx + 1];
			ans[val] = max(ans[val], mx - y[val]);
		}
	}
	//for(int i = 1; i <= q; i++) cerr << cn[i] << '\n';
	for(int i = 1; i <= q; i++) cout << (cn[i] == k ? ans[i] : -1) << '\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 63 ms 77944 KB Output is correct
2 Correct 51 ms 78072 KB Output is correct
3 Correct 51 ms 77944 KB Output is correct
4 Correct 49 ms 77944 KB Output is correct
5 Correct 54 ms 77944 KB Output is correct
6 Correct 57 ms 78072 KB Output is correct
7 Correct 51 ms 78100 KB Output is correct
8 Correct 54 ms 78080 KB Output is correct
9 Correct 52 ms 78072 KB Output is correct
10 Correct 57 ms 78200 KB Output is correct
11 Correct 51 ms 78072 KB Output is correct
12 Correct 55 ms 78076 KB Output is correct
13 Correct 49 ms 78072 KB Output is correct
14 Correct 63 ms 78200 KB Output is correct
15 Correct 52 ms 78052 KB Output is correct
16 Correct 51 ms 78072 KB Output is correct
17 Correct 53 ms 78072 KB Output is correct
18 Correct 51 ms 78200 KB Output is correct
19 Correct 53 ms 78076 KB Output is correct
20 Correct 51 ms 78072 KB Output is correct
21 Correct 49 ms 77944 KB Output is correct
22 Correct 49 ms 78072 KB Output is correct
23 Correct 50 ms 78080 KB Output is correct
24 Correct 56 ms 78200 KB Output is correct
25 Correct 57 ms 78072 KB Output is correct
26 Correct 51 ms 78072 KB Output is correct
27 Correct 63 ms 77948 KB Output is correct
28 Correct 52 ms 78072 KB Output is correct
29 Correct 56 ms 78072 KB Output is correct
30 Correct 52 ms 78072 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 77944 KB Output is correct
2 Correct 51 ms 78072 KB Output is correct
3 Correct 51 ms 77944 KB Output is correct
4 Correct 49 ms 77944 KB Output is correct
5 Correct 54 ms 77944 KB Output is correct
6 Correct 57 ms 78072 KB Output is correct
7 Correct 51 ms 78100 KB Output is correct
8 Correct 54 ms 78080 KB Output is correct
9 Correct 52 ms 78072 KB Output is correct
10 Correct 57 ms 78200 KB Output is correct
11 Correct 51 ms 78072 KB Output is correct
12 Correct 55 ms 78076 KB Output is correct
13 Correct 49 ms 78072 KB Output is correct
14 Correct 63 ms 78200 KB Output is correct
15 Correct 52 ms 78052 KB Output is correct
16 Correct 51 ms 78072 KB Output is correct
17 Correct 53 ms 78072 KB Output is correct
18 Correct 51 ms 78200 KB Output is correct
19 Correct 53 ms 78076 KB Output is correct
20 Correct 51 ms 78072 KB Output is correct
21 Correct 49 ms 77944 KB Output is correct
22 Correct 49 ms 78072 KB Output is correct
23 Correct 50 ms 78080 KB Output is correct
24 Correct 56 ms 78200 KB Output is correct
25 Correct 57 ms 78072 KB Output is correct
26 Correct 51 ms 78072 KB Output is correct
27 Correct 63 ms 77948 KB Output is correct
28 Correct 52 ms 78072 KB Output is correct
29 Correct 56 ms 78072 KB Output is correct
30 Correct 52 ms 78072 KB Output is correct
31 Correct 1984 ms 131616 KB Output is correct
32 Correct 120 ms 82932 KB Output is correct
33 Correct 1538 ms 116468 KB Output is correct
34 Correct 1946 ms 130956 KB Output is correct
35 Correct 2090 ms 127880 KB Output is correct
36 Correct 1461 ms 116200 KB Output is correct
37 Correct 1304 ms 118168 KB Output is correct
38 Correct 1102 ms 109428 KB Output is correct
39 Correct 1034 ms 111504 KB Output is correct
40 Correct 828 ms 109272 KB Output is correct
41 Correct 1134 ms 112756 KB Output is correct
42 Correct 1154 ms 112304 KB Output is correct
43 Correct 106 ms 82672 KB Output is correct
44 Correct 1127 ms 112756 KB Output is correct
45 Correct 1106 ms 112712 KB Output is correct
46 Correct 1057 ms 112700 KB Output is correct
47 Correct 552 ms 106480 KB Output is correct
48 Correct 570 ms 107640 KB Output is correct
49 Correct 740 ms 110028 KB Output is correct
50 Correct 815 ms 109812 KB Output is correct
51 Correct 831 ms 111092 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 77944 KB Output is correct
2 Correct 51 ms 78072 KB Output is correct
3 Correct 51 ms 77944 KB Output is correct
4 Correct 49 ms 77944 KB Output is correct
5 Correct 54 ms 77944 KB Output is correct
6 Correct 57 ms 78072 KB Output is correct
7 Correct 51 ms 78100 KB Output is correct
8 Correct 54 ms 78080 KB Output is correct
9 Correct 52 ms 78072 KB Output is correct
10 Correct 57 ms 78200 KB Output is correct
11 Correct 51 ms 78072 KB Output is correct
12 Correct 55 ms 78076 KB Output is correct
13 Correct 49 ms 78072 KB Output is correct
14 Correct 63 ms 78200 KB Output is correct
15 Correct 52 ms 78052 KB Output is correct
16 Correct 51 ms 78072 KB Output is correct
17 Correct 53 ms 78072 KB Output is correct
18 Correct 51 ms 78200 KB Output is correct
19 Correct 53 ms 78076 KB Output is correct
20 Correct 51 ms 78072 KB Output is correct
21 Correct 49 ms 77944 KB Output is correct
22 Correct 49 ms 78072 KB Output is correct
23 Correct 50 ms 78080 KB Output is correct
24 Correct 56 ms 78200 KB Output is correct
25 Correct 57 ms 78072 KB Output is correct
26 Correct 51 ms 78072 KB Output is correct
27 Correct 63 ms 77948 KB Output is correct
28 Correct 52 ms 78072 KB Output is correct
29 Correct 56 ms 78072 KB Output is correct
30 Correct 52 ms 78072 KB Output is correct
31 Correct 1984 ms 131616 KB Output is correct
32 Correct 120 ms 82932 KB Output is correct
33 Correct 1538 ms 116468 KB Output is correct
34 Correct 1946 ms 130956 KB Output is correct
35 Correct 2090 ms 127880 KB Output is correct
36 Correct 1461 ms 116200 KB Output is correct
37 Correct 1304 ms 118168 KB Output is correct
38 Correct 1102 ms 109428 KB Output is correct
39 Correct 1034 ms 111504 KB Output is correct
40 Correct 828 ms 109272 KB Output is correct
41 Correct 1134 ms 112756 KB Output is correct
42 Correct 1154 ms 112304 KB Output is correct
43 Correct 106 ms 82672 KB Output is correct
44 Correct 1127 ms 112756 KB Output is correct
45 Correct 1106 ms 112712 KB Output is correct
46 Correct 1057 ms 112700 KB Output is correct
47 Correct 552 ms 106480 KB Output is correct
48 Correct 570 ms 107640 KB Output is correct
49 Correct 740 ms 110028 KB Output is correct
50 Correct 815 ms 109812 KB Output is correct
51 Correct 831 ms 111092 KB Output is correct
52 Correct 373 ms 98276 KB Output is correct
53 Correct 468 ms 96624 KB Output is correct
54 Correct 1178 ms 111888 KB Output is correct
55 Correct 923 ms 108400 KB Output is correct
56 Correct 858 ms 106240 KB Output is correct
57 Correct 1122 ms 111816 KB Output is correct
58 Correct 964 ms 108376 KB Output is correct
59 Correct 774 ms 105964 KB Output is correct
60 Correct 1132 ms 111508 KB Output is correct
61 Correct 177 ms 89168 KB Output is correct
62 Correct 454 ms 98932 KB Output is correct
63 Correct 785 ms 105200 KB Output is correct
64 Correct 1030 ms 107052 KB Output is correct
65 Correct 1305 ms 111412 KB Output is correct
66 Correct 1252 ms 113192 KB Output is correct
67 Correct 281 ms 91764 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 77944 KB Output is correct
2 Correct 51 ms 78072 KB Output is correct
3 Correct 51 ms 77944 KB Output is correct
4 Correct 49 ms 77944 KB Output is correct
5 Correct 54 ms 77944 KB Output is correct
6 Correct 57 ms 78072 KB Output is correct
7 Correct 51 ms 78100 KB Output is correct
8 Correct 54 ms 78080 KB Output is correct
9 Correct 52 ms 78072 KB Output is correct
10 Correct 57 ms 78200 KB Output is correct
11 Correct 51 ms 78072 KB Output is correct
12 Correct 55 ms 78076 KB Output is correct
13 Correct 49 ms 78072 KB Output is correct
14 Correct 63 ms 78200 KB Output is correct
15 Correct 52 ms 78052 KB Output is correct
16 Correct 51 ms 78072 KB Output is correct
17 Correct 53 ms 78072 KB Output is correct
18 Correct 51 ms 78200 KB Output is correct
19 Correct 53 ms 78076 KB Output is correct
20 Correct 51 ms 78072 KB Output is correct
21 Correct 49 ms 77944 KB Output is correct
22 Correct 49 ms 78072 KB Output is correct
23 Correct 50 ms 78080 KB Output is correct
24 Correct 56 ms 78200 KB Output is correct
25 Correct 57 ms 78072 KB Output is correct
26 Correct 51 ms 78072 KB Output is correct
27 Correct 63 ms 77948 KB Output is correct
28 Correct 52 ms 78072 KB Output is correct
29 Correct 56 ms 78072 KB Output is correct
30 Correct 52 ms 78072 KB Output is correct
31 Correct 1984 ms 131616 KB Output is correct
32 Correct 120 ms 82932 KB Output is correct
33 Correct 1538 ms 116468 KB Output is correct
34 Correct 1946 ms 130956 KB Output is correct
35 Correct 2090 ms 127880 KB Output is correct
36 Correct 1461 ms 116200 KB Output is correct
37 Correct 1304 ms 118168 KB Output is correct
38 Correct 1102 ms 109428 KB Output is correct
39 Correct 1034 ms 111504 KB Output is correct
40 Correct 828 ms 109272 KB Output is correct
41 Correct 1134 ms 112756 KB Output is correct
42 Correct 1154 ms 112304 KB Output is correct
43 Correct 106 ms 82672 KB Output is correct
44 Correct 1127 ms 112756 KB Output is correct
45 Correct 1106 ms 112712 KB Output is correct
46 Correct 1057 ms 112700 KB Output is correct
47 Correct 552 ms 106480 KB Output is correct
48 Correct 570 ms 107640 KB Output is correct
49 Correct 740 ms 110028 KB Output is correct
50 Correct 815 ms 109812 KB Output is correct
51 Correct 831 ms 111092 KB Output is correct
52 Execution timed out 5081 ms 272972 KB Time limit exceeded
53 Halted 0 ms 0 KB -