oj.uz

Submission #254902

# Submission time Handle Problem Language Result Execution time Memory
254902 2020-07-30T20:00:14 Z amoo_safar New Home (APIO18_new_home) C++14
47 / 100
 5000 ms 300640 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();
	assert(V.size() < N);
	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

# Verdict Execution time Memory Grader output
1 Correct 48 ms 77884 KB Output is correct
2 Correct 47 ms 77856 KB Output is correct
3 Correct 44 ms 77944 KB Output is correct
4 Correct 46 ms 77944 KB Output is correct
5 Correct 59 ms 78076 KB Output is correct
6 Correct 50 ms 78072 KB Output is correct
7 Correct 46 ms 78072 KB Output is correct
8 Correct 49 ms 78072 KB Output is correct
9 Correct 46 ms 78072 KB Output is correct
10 Correct 50 ms 78200 KB Output is correct
11 Correct 46 ms 78072 KB Output is correct
12 Correct 49 ms 78204 KB Output is correct
13 Correct 46 ms 78072 KB Output is correct
14 Correct 47 ms 78072 KB Output is correct
15 Correct 48 ms 78072 KB Output is correct
16 Correct 47 ms 78072 KB Output is correct
17 Correct 48 ms 78072 KB Output is correct
18 Correct 48 ms 78072 KB Output is correct
19 Correct 46 ms 78072 KB Output is correct
20 Correct 48 ms 78112 KB Output is correct
21 Correct 45 ms 77944 KB Output is correct
22 Correct 46 ms 78072 KB Output is correct
23 Correct 46 ms 78072 KB Output is correct
24 Correct 47 ms 78072 KB Output is correct
25 Correct 48 ms 78072 KB Output is correct
26 Correct 51 ms 78072 KB Output is correct
27 Correct 51 ms 77944 KB Output is correct
28 Correct 51 ms 78160 KB Output is correct
29 Correct 47 ms 78072 KB Output is correct
30 Correct 46 ms 78072 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 77884 KB Output is correct
2 Correct 47 ms 77856 KB Output is correct
3 Correct 44 ms 77944 KB Output is correct
4 Correct 46 ms 77944 KB Output is correct
5 Correct 59 ms 78076 KB Output is correct
6 Correct 50 ms 78072 KB Output is correct
7 Correct 46 ms 78072 KB Output is correct
8 Correct 49 ms 78072 KB Output is correct
9 Correct 46 ms 78072 KB Output is correct
10 Correct 50 ms 78200 KB Output is correct
11 Correct 46 ms 78072 KB Output is correct
12 Correct 49 ms 78204 KB Output is correct
13 Correct 46 ms 78072 KB Output is correct
14 Correct 47 ms 78072 KB Output is correct
15 Correct 48 ms 78072 KB Output is correct
16 Correct 47 ms 78072 KB Output is correct
17 Correct 48 ms 78072 KB Output is correct
18 Correct 48 ms 78072 KB Output is correct
19 Correct 46 ms 78072 KB Output is correct
20 Correct 48 ms 78112 KB Output is correct
21 Correct 45 ms 77944 KB Output is correct
22 Correct 46 ms 78072 KB Output is correct
23 Correct 46 ms 78072 KB Output is correct
24 Correct 47 ms 78072 KB Output is correct
25 Correct 48 ms 78072 KB Output is correct
26 Correct 51 ms 78072 KB Output is correct
27 Correct 51 ms 77944 KB Output is correct
28 Correct 51 ms 78160 KB Output is correct
29 Correct 47 ms 78072 KB Output is correct
30 Correct 46 ms 78072 KB Output is correct
31 Correct 2724 ms 133248 KB Output is correct
32 Correct 108 ms 83572 KB Output is correct
33 Correct 1467 ms 118196 KB Output is correct
34 Correct 2130 ms 132712 KB Output is correct
35 Correct 1919 ms 129800 KB Output is correct
36 Correct 1539 ms 118060 KB Output is correct
37 Correct 1308 ms 120084 KB Output is correct
38 Correct 1269 ms 111244 KB Output is correct
39 Correct 859 ms 113176 KB Output is correct
40 Correct 833 ms 111220 KB Output is correct
41 Correct 1141 ms 114576 KB Output is correct
42 Correct 1257 ms 114260 KB Output is correct
43 Correct 109 ms 83960 KB Output is correct
44 Correct 1180 ms 114588 KB Output is correct
45 Correct 1510 ms 114672 KB Output is correct
46 Correct 1102 ms 114628 KB Output is correct
47 Correct 568 ms 108272 KB Output is correct
48 Correct 576 ms 108392 KB Output is correct
49 Correct 756 ms 110408 KB Output is correct
50 Correct 778 ms 110312 KB Output is correct
51 Correct 794 ms 111348 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5021 ms 274032 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 5117 ms 300640 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 77884 KB Output is correct
2 Correct 47 ms 77856 KB Output is correct
3 Correct 44 ms 77944 KB Output is correct
4 Correct 46 ms 77944 KB Output is correct
5 Correct 59 ms 78076 KB Output is correct
6 Correct 50 ms 78072 KB Output is correct
7 Correct 46 ms 78072 KB Output is correct
8 Correct 49 ms 78072 KB Output is correct
9 Correct 46 ms 78072 KB Output is correct
10 Correct 50 ms 78200 KB Output is correct
11 Correct 46 ms 78072 KB Output is correct
12 Correct 49 ms 78204 KB Output is correct
13 Correct 46 ms 78072 KB Output is correct
14 Correct 47 ms 78072 KB Output is correct
15 Correct 48 ms 78072 KB Output is correct
16 Correct 47 ms 78072 KB Output is correct
17 Correct 48 ms 78072 KB Output is correct
18 Correct 48 ms 78072 KB Output is correct
19 Correct 46 ms 78072 KB Output is correct
20 Correct 48 ms 78112 KB Output is correct
21 Correct 45 ms 77944 KB Output is correct
22 Correct 46 ms 78072 KB Output is correct
23 Correct 46 ms 78072 KB Output is correct
24 Correct 47 ms 78072 KB Output is correct
25 Correct 48 ms 78072 KB Output is correct
26 Correct 51 ms 78072 KB Output is correct
27 Correct 51 ms 77944 KB Output is correct
28 Correct 51 ms 78160 KB Output is correct
29 Correct 47 ms 78072 KB Output is correct
30 Correct 46 ms 78072 KB Output is correct
31 Correct 2724 ms 133248 KB Output is correct
32 Correct 108 ms 83572 KB Output is correct
33 Correct 1467 ms 118196 KB Output is correct
34 Correct 2130 ms 132712 KB Output is correct
35 Correct 1919 ms 129800 KB Output is correct
36 Correct 1539 ms 118060 KB Output is correct
37 Correct 1308 ms 120084 KB Output is correct
38 Correct 1269 ms 111244 KB Output is correct
39 Correct 859 ms 113176 KB Output is correct
40 Correct 833 ms 111220 KB Output is correct
41 Correct 1141 ms 114576 KB Output is correct
42 Correct 1257 ms 114260 KB Output is correct
43 Correct 109 ms 83960 KB Output is correct
44 Correct 1180 ms 114588 KB Output is correct
45 Correct 1510 ms 114672 KB Output is correct
46 Correct 1102 ms 114628 KB Output is correct
47 Correct 568 ms 108272 KB Output is correct
48 Correct 576 ms 108392 KB Output is correct
49 Correct 756 ms 110408 KB Output is correct
50 Correct 778 ms 110312 KB Output is correct
51 Correct 794 ms 111348 KB Output is correct
52 Correct 455 ms 100464 KB Output is correct
53 Correct 406 ms 98928 KB Output is correct
54 Correct 1107 ms 114032 KB Output is correct
55 Correct 929 ms 110660 KB Output is correct
56 Correct 763 ms 108000 KB Output is correct
57 Correct 1162 ms 113396 KB Output is correct
58 Correct 1014 ms 110220 KB Output is correct
59 Correct 843 ms 107612 KB Output is correct
60 Correct 1145 ms 113268 KB Output is correct
61 Correct 138 ms 90224 KB Output is correct
62 Correct 458 ms 100716 KB Output is correct
63 Correct 823 ms 106992 KB Output is correct
64 Correct 934 ms 108932 KB Output is correct
65 Correct 1174 ms 113136 KB Output is correct
66 Correct 1197 ms 114292 KB Output is correct
67 Correct 280 ms 92404 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 77884 KB Output is correct
2 Correct 47 ms 77856 KB Output is correct
3 Correct 44 ms 77944 KB Output is correct
4 Correct 46 ms 77944 KB Output is correct
5 Correct 59 ms 78076 KB Output is correct
6 Correct 50 ms 78072 KB Output is correct
7 Correct 46 ms 78072 KB Output is correct
8 Correct 49 ms 78072 KB Output is correct
9 Correct 46 ms 78072 KB Output is correct
10 Correct 50 ms 78200 KB Output is correct
11 Correct 46 ms 78072 KB Output is correct
12 Correct 49 ms 78204 KB Output is correct
13 Correct 46 ms 78072 KB Output is correct
14 Correct 47 ms 78072 KB Output is correct
15 Correct 48 ms 78072 KB Output is correct
16 Correct 47 ms 78072 KB Output is correct
17 Correct 48 ms 78072 KB Output is correct
18 Correct 48 ms 78072 KB Output is correct
19 Correct 46 ms 78072 KB Output is correct
20 Correct 48 ms 78112 KB Output is correct
21 Correct 45 ms 77944 KB Output is correct
22 Correct 46 ms 78072 KB Output is correct
23 Correct 46 ms 78072 KB Output is correct
24 Correct 47 ms 78072 KB Output is correct
25 Correct 48 ms 78072 KB Output is correct
26 Correct 51 ms 78072 KB Output is correct
27 Correct 51 ms 77944 KB Output is correct
28 Correct 51 ms 78160 KB Output is correct
29 Correct 47 ms 78072 KB Output is correct
30 Correct 46 ms 78072 KB Output is correct
31 Correct 2724 ms 133248 KB Output is correct
32 Correct 108 ms 83572 KB Output is correct
33 Correct 1467 ms 118196 KB Output is correct
34 Correct 2130 ms 132712 KB Output is correct
35 Correct 1919 ms 129800 KB Output is correct
36 Correct 1539 ms 118060 KB Output is correct
37 Correct 1308 ms 120084 KB Output is correct
38 Correct 1269 ms 111244 KB Output is correct
39 Correct 859 ms 113176 KB Output is correct
40 Correct 833 ms 111220 KB Output is correct
41 Correct 1141 ms 114576 KB Output is correct
42 Correct 1257 ms 114260 KB Output is correct
43 Correct 109 ms 83960 KB Output is correct
44 Correct 1180 ms 114588 KB Output is correct
45 Correct 1510 ms 114672 KB Output is correct
46 Correct 1102 ms 114628 KB Output is correct
47 Correct 568 ms 108272 KB Output is correct
48 Correct 576 ms 108392 KB Output is correct
49 Correct 756 ms 110408 KB Output is correct
50 Correct 778 ms 110312 KB Output is correct
51 Correct 794 ms 111348 KB Output is correct
52 Execution timed out 5021 ms 274032 KB Time limit exceeded
53 Halted 0 ms 0 KB -