oj.uz

답안 #934904

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
934904 2024-02-28T07:03:13 Z IBory 새 집 (APIO18_new_home) C++17
47 / 100
 5000 ms 535808 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, sR = SZ, n = 1;
		queue<tuple<int, int, int>> Q;
		Q.emplace(1, SZ, 1);
		while (!Q.empty()) {
			auto [sL, sR, n] = Q.front(); Q.pop();
			if (R < sL || sR < L) continue;
			if (L <= sL && sR <= R) {
				(e ? E[n] : T[n]).push(v);
				continue;
			}
			int mid = (sL + sR) >> 1;
			Q.emplace(sL, mid, n * 2);
			Q.emplace(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;
}

Compilation message

new_home.cpp: In member function 'void Seg::Update(int, int, int, bool)':
new_home.cpp:14:7: warning: unused variable 'sL' [-Wunused-variable]
   14 |   int sL = 1, sR = SZ, n = 1;
      |       ^~
new_home.cpp:14:15: warning: unused variable 'sR' [-Wunused-variable]
   14 |   int sL = 1, sR = SZ, n = 1;
      |               ^~
new_home.cpp:14:24: warning: unused variable 'n' [-Wunused-variable]
   14 |   int sL = 1, sR = SZ, n = 1;
      |                        ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 128 ms 320440 KB Output is correct
2 Correct 82 ms 320336 KB Output is correct
3 Correct 82 ms 320400 KB Output is correct
4 Correct 96 ms 320300 KB Output is correct
5 Correct 83 ms 320336 KB Output is correct
6 Correct 87 ms 320596 KB Output is correct
7 Correct 92 ms 320484 KB Output is correct
8 Correct 91 ms 320604 KB Output is correct
9 Correct 89 ms 320328 KB Output is correct
10 Correct 94 ms 320596 KB Output is correct
11 Correct 97 ms 320592 KB Output is correct
12 Correct 86 ms 320580 KB Output is correct
13 Correct 88 ms 320580 KB Output is correct
14 Correct 84 ms 320596 KB Output is correct
15 Correct 87 ms 320512 KB Output is correct
16 Correct 94 ms 320444 KB Output is correct
17 Correct 86 ms 320520 KB Output is correct
18 Correct 86 ms 320644 KB Output is correct
19 Correct 87 ms 320484 KB Output is correct
20 Correct 90 ms 320592 KB Output is correct
21 Correct 85 ms 320464 KB Output is correct
22 Correct 86 ms 320480 KB Output is correct
23 Correct 90 ms 320672 KB Output is correct
24 Correct 87 ms 320504 KB Output is correct
25 Correct 86 ms 320592 KB Output is correct
26 Correct 88 ms 320592 KB Output is correct
27 Correct 85 ms 320380 KB Output is correct
28 Correct 87 ms 320596 KB Output is correct
29 Correct 86 ms 320592 KB Output is correct
30 Correct 93 ms 320588 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 128 ms 320440 KB Output is correct
2 Correct 82 ms 320336 KB Output is correct
3 Correct 82 ms 320400 KB Output is correct
4 Correct 96 ms 320300 KB Output is correct
5 Correct 83 ms 320336 KB Output is correct
6 Correct 87 ms 320596 KB Output is correct
7 Correct 92 ms 320484 KB Output is correct
8 Correct 91 ms 320604 KB Output is correct
9 Correct 89 ms 320328 KB Output is correct
10 Correct 94 ms 320596 KB Output is correct
11 Correct 97 ms 320592 KB Output is correct
12 Correct 86 ms 320580 KB Output is correct
13 Correct 88 ms 320580 KB Output is correct
14 Correct 84 ms 320596 KB Output is correct
15 Correct 87 ms 320512 KB Output is correct
16 Correct 94 ms 320444 KB Output is correct
17 Correct 86 ms 320520 KB Output is correct
18 Correct 86 ms 320644 KB Output is correct
19 Correct 87 ms 320484 KB Output is correct
20 Correct 90 ms 320592 KB Output is correct
21 Correct 85 ms 320464 KB Output is correct
22 Correct 86 ms 320480 KB Output is correct
23 Correct 90 ms 320672 KB Output is correct
24 Correct 87 ms 320504 KB Output is correct
25 Correct 86 ms 320592 KB Output is correct
26 Correct 88 ms 320592 KB Output is correct
27 Correct 85 ms 320380 KB Output is correct
28 Correct 87 ms 320596 KB Output is correct
29 Correct 86 ms 320592 KB Output is correct
30 Correct 93 ms 320588 KB Output is correct
31 Correct 2312 ms 388208 KB Output is correct
32 Correct 301 ms 327512 KB Output is correct
33 Correct 1656 ms 374088 KB Output is correct
34 Correct 2250 ms 388896 KB Output is correct
35 Correct 2161 ms 383668 KB Output is correct
36 Correct 1613 ms 373136 KB Output is correct
37 Correct 1401 ms 376184 KB Output is correct
38 Correct 962 ms 370772 KB Output is correct
39 Correct 856 ms 370936 KB Output is correct
40 Correct 762 ms 370024 KB Output is correct
41 Correct 1373 ms 362692 KB Output is correct
42 Correct 1324 ms 368540 KB Output is correct
43 Correct 218 ms 330948 KB Output is correct
44 Correct 1319 ms 363972 KB Output is correct
45 Correct 1293 ms 357920 KB Output is correct
46 Correct 1252 ms 358056 KB Output is correct
47 Correct 565 ms 360312 KB Output is correct
48 Correct 595 ms 359480 KB Output is correct
49 Correct 752 ms 364132 KB Output is correct
50 Correct 816 ms 368524 KB Output is correct
51 Correct 773 ms 362832 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 128 ms 320440 KB Output is correct
2 Correct 82 ms 320336 KB Output is correct
3 Correct 82 ms 320400 KB Output is correct
4 Correct 96 ms 320300 KB Output is correct
5 Correct 83 ms 320336 KB Output is correct
6 Correct 87 ms 320596 KB Output is correct
7 Correct 92 ms 320484 KB Output is correct
8 Correct 91 ms 320604 KB Output is correct
9 Correct 89 ms 320328 KB Output is correct
10 Correct 94 ms 320596 KB Output is correct
11 Correct 97 ms 320592 KB Output is correct
12 Correct 86 ms 320580 KB Output is correct
13 Correct 88 ms 320580 KB Output is correct
14 Correct 84 ms 320596 KB Output is correct
15 Correct 87 ms 320512 KB Output is correct
16 Correct 94 ms 320444 KB Output is correct
17 Correct 86 ms 320520 KB Output is correct
18 Correct 86 ms 320644 KB Output is correct
19 Correct 87 ms 320484 KB Output is correct
20 Correct 90 ms 320592 KB Output is correct
21 Correct 85 ms 320464 KB Output is correct
22 Correct 86 ms 320480 KB Output is correct
23 Correct 90 ms 320672 KB Output is correct
24 Correct 87 ms 320504 KB Output is correct
25 Correct 86 ms 320592 KB Output is correct
26 Correct 88 ms 320592 KB Output is correct
27 Correct 85 ms 320380 KB Output is correct
28 Correct 87 ms 320596 KB Output is correct
29 Correct 86 ms 320592 KB Output is correct
30 Correct 93 ms 320588 KB Output is correct
31 Correct 2312 ms 388208 KB Output is correct
32 Correct 301 ms 327512 KB Output is correct
33 Correct 1656 ms 374088 KB Output is correct
34 Correct 2250 ms 388896 KB Output is correct
35 Correct 2161 ms 383668 KB Output is correct
36 Correct 1613 ms 373136 KB Output is correct
37 Correct 1401 ms 376184 KB Output is correct
38 Correct 962 ms 370772 KB Output is correct
39 Correct 856 ms 370936 KB Output is correct
40 Correct 762 ms 370024 KB Output is correct
41 Correct 1373 ms 362692 KB Output is correct
42 Correct 1324 ms 368540 KB Output is correct
43 Correct 218 ms 330948 KB Output is correct
44 Correct 1319 ms 363972 KB Output is correct
45 Correct 1293 ms 357920 KB Output is correct
46 Correct 1252 ms 358056 KB Output is correct
47 Correct 565 ms 360312 KB Output is correct
48 Correct 595 ms 359480 KB Output is correct
49 Correct 752 ms 364132 KB Output is correct
50 Correct 816 ms 368524 KB Output is correct
51 Correct 773 ms 362832 KB Output is correct
52 Correct 442 ms 347316 KB Output is correct
53 Correct 538 ms 346552 KB Output is correct
54 Correct 1164 ms 373880 KB Output is correct
55 Correct 1061 ms 361468 KB Output is correct
56 Correct 882 ms 359368 KB Output is correct
57 Correct 1290 ms 365256 KB Output is correct
58 Correct 1058 ms 363112 KB Output is correct
59 Correct 931 ms 361836 KB Output is correct
60 Correct 1232 ms 368576 KB Output is correct
61 Correct 159 ms 329156 KB Output is correct
62 Correct 502 ms 349268 KB Output is correct
63 Correct 885 ms 362436 KB Output is correct
64 Correct 1059 ms 368188 KB Output is correct
65 Correct 1364 ms 372176 KB Output is correct
66 Correct 1395 ms 366144 KB Output is correct
67 Correct 330 ms 332880 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 128 ms 320440 KB Output is correct
2 Correct 82 ms 320336 KB Output is correct
3 Correct 82 ms 320400 KB Output is correct
4 Correct 96 ms 320300 KB Output is correct
5 Correct 83 ms 320336 KB Output is correct
6 Correct 87 ms 320596 KB Output is correct
7 Correct 92 ms 320484 KB Output is correct
8 Correct 91 ms 320604 KB Output is correct
9 Correct 89 ms 320328 KB Output is correct
10 Correct 94 ms 320596 KB Output is correct
11 Correct 97 ms 320592 KB Output is correct
12 Correct 86 ms 320580 KB Output is correct
13 Correct 88 ms 320580 KB Output is correct
14 Correct 84 ms 320596 KB Output is correct
15 Correct 87 ms 320512 KB Output is correct
16 Correct 94 ms 320444 KB Output is correct
17 Correct 86 ms 320520 KB Output is correct
18 Correct 86 ms 320644 KB Output is correct
19 Correct 87 ms 320484 KB Output is correct
20 Correct 90 ms 320592 KB Output is correct
21 Correct 85 ms 320464 KB Output is correct
22 Correct 86 ms 320480 KB Output is correct
23 Correct 90 ms 320672 KB Output is correct
24 Correct 87 ms 320504 KB Output is correct
25 Correct 86 ms 320592 KB Output is correct
26 Correct 88 ms 320592 KB Output is correct
27 Correct 85 ms 320380 KB Output is correct
28 Correct 87 ms 320596 KB Output is correct
29 Correct 86 ms 320592 KB Output is correct
30 Correct 93 ms 320588 KB Output is correct
31 Correct 2312 ms 388208 KB Output is correct
32 Correct 301 ms 327512 KB Output is correct
33 Correct 1656 ms 374088 KB Output is correct
34 Correct 2250 ms 388896 KB Output is correct
35 Correct 2161 ms 383668 KB Output is correct
36 Correct 1613 ms 373136 KB Output is correct
37 Correct 1401 ms 376184 KB Output is correct
38 Correct 962 ms 370772 KB Output is correct
39 Correct 856 ms 370936 KB Output is correct
40 Correct 762 ms 370024 KB Output is correct
41 Correct 1373 ms 362692 KB Output is correct
42 Correct 1324 ms 368540 KB Output is correct
43 Correct 218 ms 330948 KB Output is correct
44 Correct 1319 ms 363972 KB Output is correct
45 Correct 1293 ms 357920 KB Output is correct
46 Correct 1252 ms 358056 KB Output is correct
47 Correct 565 ms 360312 KB Output is correct
48 Correct 595 ms 359480 KB Output is correct
49 Correct 752 ms 364132 KB Output is correct
50 Correct 816 ms 368524 KB Output is correct
51 Correct 773 ms 362832 KB Output is correct
52 Execution timed out 5027 ms 534012 KB Time limit exceeded
53 Halted 0 ms 0 KB -