oj.uz

Submission #934905

# Submission time Handle Problem Language Result Execution time Memory
934905 2024-02-28T07:08:41 Z IBory New Home (APIO18_new_home) C++17
47 / 100
 5000 ms 555180 KB 
#include <bits/stdc++.h>
#define pii pair<int, int>
using namespace std;

const int SZ = 1 << 20;
int P[SZ], S[SZ], X[SZ], ans[SZ];
multiset<int> CX[SZ];

struct Seg {
	priority_queue<int> T[SZ << 1], E[SZ << 1];
	int CL[SZ << 1], CR[SZ << 1];

	void Update(int L, int R, int v, bool e, int sL = 1, int sR = SZ, int n = 1) {
		if (R < sL || sR < L) return;
		if (L <= sL && sR <= R) {
			(e ? E[n] : T[n]).push(v);
			return;
		}
		int mid = (sL + sR) >> 1;
		Update(L, R, v, e, sL, mid, n * 2);
		Update(L, R, v, e, mid + 1, sR, n * 2 + 1);
	}
	int Query(int p) {
		int sL = 1, sR = SZ, n = 1, ret = -1e9;
		while (1) {
			while (!T[n].empty() && !E[n].empty() && T[n].top() == E[n].top()) T[n].pop(), E[n].pop();
			if (!T[n].empty()) ret = max(ret, T[n].top());
			if (sL == sR) return ret;
			int mid = (sL + sR) >> 1;
			if (p <= mid) sR = mid, n = n * 2;
			else sL = mid + 1, n = n * 2 + 1;
		}
	}
} T1, T2;

vector<int> UX;
int Find(int x) {
	return lower_bound(UX.begin(), UX.end(), x) - UX.begin();
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int N, K, Q;
	cin >> N >> K >> Q;
	vector<pii> ord;
	for (int i = 1; i <= N; ++i) {
		int a, b;
		cin >> P[i] >> S[i] >> a >> b;
		P[i] <<= 1;
		ord.emplace_back(a, i);
		ord.emplace_back(b + 1, -i);
	}
	for (int i = 1; i <= Q; ++i) {
		int t;
		cin >> X[i] >> t;
		X[i] <<= 1;
		ord.emplace_back(t, SZ + i);
	}
	sort(ord.begin(), ord.end());

	UX.push_back(-1); UX.push_back(1); UX.push_back(1e8);
	for (auto [_, id] : ord) {
		// Line Add
		if (0 < id && id < SZ) {
			int pos = P[abs(id)], type = S[abs(id)];
			UX.push_back(pos);
			auto it = CX[type].insert(pos);
			if (it != CX[type].begin()) {
				int h = abs(pos - *prev(it)) / 2;
				UX.push_back(*prev(it) + h);
			}
			if (next(it) != CX[type].end()) {
				int h = abs(pos - *next(it)) / 2;
				UX.push_back(pos + h);
			}
		}
		// Line Erase
		else if (id < 0) {
			int pos = P[abs(id)], type = S[abs(id)];
			auto it = CX[type].find(pos);
			if (it != CX[type].begin() && next(it) != CX[type].end()) {
				int h = abs(*next(it) - *prev(it)) / 2;
				UX.push_back(*prev(it) + h);
			}
			CX[type].erase(it);
		}
		else UX.push_back(X[id - SZ]);
	}
	sort(UX.begin(), UX.end());
	UX.erase(unique(UX.begin(), UX.end()), UX.end());

	memset(ans, 0xf3, sizeof(ans));
	int curOpen = 0, L_LIM = 1, R_LIM = UX.size() - 1;
	for (auto [_, id] : ord) {
		// Line Add/Erase
		if (id < SZ) {
			int pos = P[abs(id)], type = S[abs(id)], x = Find(pos);
			bool out = id < 0;

			if (CX[type].empty()) curOpen++;
			auto it = (out ? CX[type].find(pos) : CX[type].insert(pos));
			bool isPrev = it != CX[type].begin();
			bool isNext = next(it) != CX[type].end();
			int ph = (isPrev ? Find(pos - (pos - *prev(it)) / 2) : L_LIM);
			int nh = (isNext ? Find(pos + (*next(it) - pos) / 2) : R_LIM);
			int all = (isPrev && isNext ? Find(*next(it) - (*next(it) - *prev(it)) / 2) : 0);

			// Add
			T2.Update(ph, x, pos, out);
			T1.Update(x, nh, -pos, out);

			// Modify
			if (isNext) {
				int nx = Find(*next(it));
				T2.Update(isPrev ? all : L_LIM, nx, *next(it), !out);
				T2.Update(nh, nx, *next(it), out);
			}
			if (isPrev) {
				int px = Find(*prev(it));
				T1.Update(px, isNext ? all : R_LIM, -*prev(it), !out);
				T1.Update(px, ph, -*prev(it), out);
			}

			if (out) CX[type].erase(it);
			if (CX[type].empty()) curOpen--;
		}
		// Query
		else if (curOpen == K) {
			id -= SZ;
			int x = X[id], p = Find(x);
			int b1 = T1.Query(p);
			int b2 = T2.Query(p);
			ans[id] = max(x + b1, b2 - x);
		}
	}

	for (int i = 1; i <= Q; ++i) cout << (ans[i] < 0 ? -1 : ans[i] / 2) << '\n';
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 320216 KB Output is correct
2 Correct 84 ms 320412 KB Output is correct
3 Correct 87 ms 320408 KB Output is correct
4 Correct 101 ms 320344 KB Output is correct
5 Correct 86 ms 320336 KB Output is correct
6 Correct 88 ms 320704 KB Output is correct
7 Correct 87 ms 320444 KB Output is correct
8 Correct 85 ms 320596 KB Output is correct
9 Correct 87 ms 320336 KB Output is correct
10 Correct 91 ms 320592 KB Output is correct
11 Correct 88 ms 320592 KB Output is correct
12 Correct 92 ms 321108 KB Output is correct
13 Correct 86 ms 320336 KB Output is correct
14 Correct 86 ms 320596 KB Output is correct
15 Correct 98 ms 320476 KB Output is correct
16 Correct 86 ms 320484 KB Output is correct
17 Correct 87 ms 320596 KB Output is correct
18 Correct 88 ms 320640 KB Output is correct
19 Correct 93 ms 320592 KB Output is correct
20 Correct 94 ms 320592 KB Output is correct
21 Correct 85 ms 320436 KB Output is correct
22 Correct 86 ms 320336 KB Output is correct
23 Correct 86 ms 320596 KB Output is correct
24 Correct 86 ms 320632 KB Output is correct
25 Correct 89 ms 320416 KB Output is correct
26 Correct 89 ms 320640 KB Output is correct
27 Correct 90 ms 320340 KB Output is correct
28 Correct 86 ms 320612 KB Output is correct
29 Correct 84 ms 320592 KB Output is correct
30 Correct 83 ms 320336 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 320216 KB Output is correct
2 Correct 84 ms 320412 KB Output is correct
3 Correct 87 ms 320408 KB Output is correct
4 Correct 101 ms 320344 KB Output is correct
5 Correct 86 ms 320336 KB Output is correct
6 Correct 88 ms 320704 KB Output is correct
7 Correct 87 ms 320444 KB Output is correct
8 Correct 85 ms 320596 KB Output is correct
9 Correct 87 ms 320336 KB Output is correct
10 Correct 91 ms 320592 KB Output is correct
11 Correct 88 ms 320592 KB Output is correct
12 Correct 92 ms 321108 KB Output is correct
13 Correct 86 ms 320336 KB Output is correct
14 Correct 86 ms 320596 KB Output is correct
15 Correct 98 ms 320476 KB Output is correct
16 Correct 86 ms 320484 KB Output is correct
17 Correct 87 ms 320596 KB Output is correct
18 Correct 88 ms 320640 KB Output is correct
19 Correct 93 ms 320592 KB Output is correct
20 Correct 94 ms 320592 KB Output is correct
21 Correct 85 ms 320436 KB Output is correct
22 Correct 86 ms 320336 KB Output is correct
23 Correct 86 ms 320596 KB Output is correct
24 Correct 86 ms 320632 KB Output is correct
25 Correct 89 ms 320416 KB Output is correct
26 Correct 89 ms 320640 KB Output is correct
27 Correct 90 ms 320340 KB Output is correct
28 Correct 86 ms 320612 KB Output is correct
29 Correct 84 ms 320592 KB Output is correct
30 Correct 83 ms 320336 KB Output is correct
31 Correct 1930 ms 385408 KB Output is correct
32 Correct 283 ms 326596 KB Output is correct
33 Correct 1652 ms 371588 KB Output is correct
34 Correct 2073 ms 386032 KB Output is correct
35 Correct 1828 ms 380976 KB Output is correct
36 Correct 1430 ms 370292 KB Output is correct
37 Correct 1189 ms 373300 KB Output is correct
38 Correct 865 ms 367680 KB Output is correct
39 Correct 806 ms 368024 KB Output is correct
40 Correct 793 ms 367256 KB Output is correct
41 Correct 1239 ms 359516 KB Output is correct
42 Correct 1175 ms 365716 KB Output is correct
43 Correct 185 ms 328388 KB Output is correct
44 Correct 1177 ms 360880 KB Output is correct
45 Correct 1162 ms 355340 KB Output is correct
46 Correct 1053 ms 355392 KB Output is correct
47 Correct 567 ms 357272 KB Output is correct
48 Correct 561 ms 356880 KB Output is correct
49 Correct 671 ms 361108 KB Output is correct
50 Correct 747 ms 365440 KB Output is correct
51 Correct 756 ms 360208 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5103 ms 555180 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 5064 ms 538600 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 320216 KB Output is correct
2 Correct 84 ms 320412 KB Output is correct
3 Correct 87 ms 320408 KB Output is correct
4 Correct 101 ms 320344 KB Output is correct
5 Correct 86 ms 320336 KB Output is correct
6 Correct 88 ms 320704 KB Output is correct
7 Correct 87 ms 320444 KB Output is correct
8 Correct 85 ms 320596 KB Output is correct
9 Correct 87 ms 320336 KB Output is correct
10 Correct 91 ms 320592 KB Output is correct
11 Correct 88 ms 320592 KB Output is correct
12 Correct 92 ms 321108 KB Output is correct
13 Correct 86 ms 320336 KB Output is correct
14 Correct 86 ms 320596 KB Output is correct
15 Correct 98 ms 320476 KB Output is correct
16 Correct 86 ms 320484 KB Output is correct
17 Correct 87 ms 320596 KB Output is correct
18 Correct 88 ms 320640 KB Output is correct
19 Correct 93 ms 320592 KB Output is correct
20 Correct 94 ms 320592 KB Output is correct
21 Correct 85 ms 320436 KB Output is correct
22 Correct 86 ms 320336 KB Output is correct
23 Correct 86 ms 320596 KB Output is correct
24 Correct 86 ms 320632 KB Output is correct
25 Correct 89 ms 320416 KB Output is correct
26 Correct 89 ms 320640 KB Output is correct
27 Correct 90 ms 320340 KB Output is correct
28 Correct 86 ms 320612 KB Output is correct
29 Correct 84 ms 320592 KB Output is correct
30 Correct 83 ms 320336 KB Output is correct
31 Correct 1930 ms 385408 KB Output is correct
32 Correct 283 ms 326596 KB Output is correct
33 Correct 1652 ms 371588 KB Output is correct
34 Correct 2073 ms 386032 KB Output is correct
35 Correct 1828 ms 380976 KB Output is correct
36 Correct 1430 ms 370292 KB Output is correct
37 Correct 1189 ms 373300 KB Output is correct
38 Correct 865 ms 367680 KB Output is correct
39 Correct 806 ms 368024 KB Output is correct
40 Correct 793 ms 367256 KB Output is correct
41 Correct 1239 ms 359516 KB Output is correct
42 Correct 1175 ms 365716 KB Output is correct
43 Correct 185 ms 328388 KB Output is correct
44 Correct 1177 ms 360880 KB Output is correct
45 Correct 1162 ms 355340 KB Output is correct
46 Correct 1053 ms 355392 KB Output is correct
47 Correct 567 ms 357272 KB Output is correct
48 Correct 561 ms 356880 KB Output is correct
49 Correct 671 ms 361108 KB Output is correct
50 Correct 747 ms 365440 KB Output is correct
51 Correct 756 ms 360208 KB Output is correct
52 Correct 416 ms 344316 KB Output is correct
53 Correct 440 ms 343656 KB Output is correct
54 Correct 949 ms 370472 KB Output is correct
55 Correct 937 ms 358496 KB Output is correct
56 Correct 775 ms 356632 KB Output is correct
57 Correct 1095 ms 362120 KB Output is correct
58 Correct 877 ms 360172 KB Output is correct
59 Correct 751 ms 358716 KB Output is correct
60 Correct 1114 ms 365472 KB Output is correct
61 Correct 157 ms 326652 KB Output is correct
62 Correct 472 ms 345780 KB Output is correct
63 Correct 736 ms 359264 KB Output is correct
64 Correct 895 ms 365008 KB Output is correct
65 Correct 1175 ms 369320 KB Output is correct
66 Correct 1264 ms 363096 KB Output is correct
67 Correct 306 ms 331444 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 320216 KB Output is correct
2 Correct 84 ms 320412 KB Output is correct
3 Correct 87 ms 320408 KB Output is correct
4 Correct 101 ms 320344 KB Output is correct
5 Correct 86 ms 320336 KB Output is correct
6 Correct 88 ms 320704 KB Output is correct
7 Correct 87 ms 320444 KB Output is correct
8 Correct 85 ms 320596 KB Output is correct
9 Correct 87 ms 320336 KB Output is correct
10 Correct 91 ms 320592 KB Output is correct
11 Correct 88 ms 320592 KB Output is correct
12 Correct 92 ms 321108 KB Output is correct
13 Correct 86 ms 320336 KB Output is correct
14 Correct 86 ms 320596 KB Output is correct
15 Correct 98 ms 320476 KB Output is correct
16 Correct 86 ms 320484 KB Output is correct
17 Correct 87 ms 320596 KB Output is correct
18 Correct 88 ms 320640 KB Output is correct
19 Correct 93 ms 320592 KB Output is correct
20 Correct 94 ms 320592 KB Output is correct
21 Correct 85 ms 320436 KB Output is correct
22 Correct 86 ms 320336 KB Output is correct
23 Correct 86 ms 320596 KB Output is correct
24 Correct 86 ms 320632 KB Output is correct
25 Correct 89 ms 320416 KB Output is correct
26 Correct 89 ms 320640 KB Output is correct
27 Correct 90 ms 320340 KB Output is correct
28 Correct 86 ms 320612 KB Output is correct
29 Correct 84 ms 320592 KB Output is correct
30 Correct 83 ms 320336 KB Output is correct
31 Correct 1930 ms 385408 KB Output is correct
32 Correct 283 ms 326596 KB Output is correct
33 Correct 1652 ms 371588 KB Output is correct
34 Correct 2073 ms 386032 KB Output is correct
35 Correct 1828 ms 380976 KB Output is correct
36 Correct 1430 ms 370292 KB Output is correct
37 Correct 1189 ms 373300 KB Output is correct
38 Correct 865 ms 367680 KB Output is correct
39 Correct 806 ms 368024 KB Output is correct
40 Correct 793 ms 367256 KB Output is correct
41 Correct 1239 ms 359516 KB Output is correct
42 Correct 1175 ms 365716 KB Output is correct
43 Correct 185 ms 328388 KB Output is correct
44 Correct 1177 ms 360880 KB Output is correct
45 Correct 1162 ms 355340 KB Output is correct
46 Correct 1053 ms 355392 KB Output is correct
47 Correct 567 ms 357272 KB Output is correct
48 Correct 561 ms 356880 KB Output is correct
49 Correct 671 ms 361108 KB Output is correct
50 Correct 747 ms 365440 KB Output is correct
51 Correct 756 ms 360208 KB Output is correct
52 Execution timed out 5103 ms 555180 KB Time limit exceeded
53 Halted 0 ms 0 KB -