oj.uz

답안 #482251

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
482251 2021-10-23T21:53:34 Z nonsensenonsense1 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 17652 KB 
#include <cstdio>
#include <utility>
#include <algorithm>
#include <cstring>
#include <vector>

const int INF = 0x3f3f3f3f;

struct store {
	int x, t, l, r;
	bool operator<(store arg) {
		return x < arg.x;
	}
};

struct query {
	int l, y, ind;
	bool operator<(query arg) {
		return y < arg.y;
	}
};

bool cmp_l(query a, query b) 
{
	return a.l < b.l;
}

const int N = 300000;
const int K = 500;
int n, k, q, next[N + 1], type_amt[N], ans[N], it[N], fi[N], last[N], right[N], to[N];
bool ut[N], active[N];
store a[N + 1];
query qr[N];

int main() 
{
	scanf("%d%d%d", &n, &k, &q);
	a[n].x = INF;
	next[n] = n;
	memset(to, 0x3f, k << 2);
	for (int i = 0; i < n; ++i) {
		scanf("%d%d%d%d", &a[i].x, &a[i].t, &a[i].l, &a[i].r);
		--a[i].t;
		++a[i].r;
	}
	std::sort(a, a + n);
	for (int i = 0; i < q; ++i) {
		scanf("%d%d", &qr[i].l, &qr[i].y);
		qr[i].ind = i;
	}
	std::sort(qr, qr + q);
	std::vector<int> inter, inter_type;
	for (int i = 0; i < q;) {
		memset(ut, 0, k);
		int until = std::min(i + K, q);
		inter.resize(0);
		inter_type.resize(0);
		for (int j = 0; j < n; ++j) if (a[j].l >= qr[i].y + 1 && a[j].l <= qr[until - 1].y || a[j].r >= qr[i].y + 1 && a[j].r <= qr[until - 1].y) {
			if (!ut[a[j].t]) {
				inter_type.push_back(a[j].t);
				fi[a[j].t] = n;
			}
			ut[a[j].t] = 1;
			inter.push_back(j);
		}
		memset(last, -1, n << 2);
		for (int j = 0; j < n; ++j) {
			if (a[j].l <= qr[i].y && a[j].r > qr[until - 1].y) {
				if (ut[a[j].t]) {
					active[j] = false;
					if (last[a[j].t] == -1) fi[a[j].t] = j;
					else next[last[a[j].t]] = j;
					last[a[j].t] = j;
					next[j] = n;
				}
				else active[j] = true;
			}
			else active[j] = false;
		}
		for (int j = 0, l = 0, amt = 0; j < n; ++j) {
			while (l == j || l <= n && amt < k - inter_type.size()) {
				if (l < n && active[l]) {
					if (!type_amt[a[l].t]) ++amt;
					++type_amt[a[l].t];
				}
				++l;
			}
			right[j] = l;
			if (active[j]) {
				--type_amt[a[j].t];
				if (!type_amt[a[j].t]) --amt;
			}
		}
		std::sort(qr + i, qr + until, cmp_l);
		for (int j = 0; i < until; ++i) {
			while (qr[i].l - a[j].x > a[right[j] - 1].x - qr[i].l) ++j;
			int res = std::min(j ? qr[i].l - a[j - 1].x : INF, a[right[j] - 1].x - qr[i].l);
			for (int k = 0; k < (int)inter.size(); ++k) if (a[inter[k]].l <= qr[i].y && a[inter[k]].r > qr[i].y) to[a[inter[k]].t] = std::min(to[a[inter[k]].t], abs(qr[i].l - a[inter[k]].x));
			for (int k = 0; k < (int)inter_type.size(); ++k) {
				int cur = inter_type[k], &pos = fi[cur];
				while (a[next[pos]].x <= qr[i].l) pos = next[pos];
				res = std::max(res, std::min(to[cur], std::min(abs(qr[i].l - a[pos].x), a[next[pos]].x - qr[i].l)));
				to[cur] = INF;
			}
			ans[qr[i].ind] = res > INF / 2 ? -1 : res;
		}
	}
	for (int i = 0; i < q; ++i) printf("%d\n", ans[i]);
	return 0;
}

Compilation message

new_home.cpp: In function 'int main()':
new_home.cpp:58:57: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   58 |   for (int j = 0; j < n; ++j) if (a[j].l >= qr[i].y + 1 && a[j].l <= qr[until - 1].y || a[j].r >= qr[i].y + 1 && a[j].r <= qr[until - 1].y) {
      |                                   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:81:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |    while (l == j || l <= n && amt < k - inter_type.size()) {
      |                               ~~~~^~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:81:28: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   81 |    while (l == j || l <= n && amt < k - inter_type.size()) {
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:37:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |  scanf("%d%d%d", &n, &k, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:42:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |   scanf("%d%d%d%d", &a[i].x, &a[i].t, &a[i].l, &a[i].r);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:48:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |   scanf("%d%d", &qr[i].l, &qr[i].y);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 1 ms 356 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 1 ms 356 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 750 ms 3360 KB Output is correct
32 Correct 521 ms 3140 KB Output is correct
33 Correct 661 ms 3396 KB Output is correct
34 Correct 781 ms 3524 KB Output is correct
35 Correct 651 ms 3408 KB Output is correct
36 Correct 591 ms 3268 KB Output is correct
37 Correct 519 ms 3408 KB Output is correct
38 Correct 508 ms 3400 KB Output is correct
39 Correct 302 ms 3280 KB Output is correct
40 Correct 360 ms 3416 KB Output is correct
41 Correct 663 ms 3396 KB Output is correct
42 Correct 678 ms 3244 KB Output is correct
43 Correct 108 ms 3252 KB Output is correct
44 Correct 598 ms 3496 KB Output is correct
45 Correct 367 ms 3268 KB Output is correct
46 Correct 245 ms 3256 KB Output is correct
47 Correct 128 ms 2884 KB Output is correct
48 Correct 126 ms 2980 KB Output is correct
49 Correct 187 ms 3032 KB Output is correct
50 Correct 388 ms 3264 KB Output is correct
51 Correct 207 ms 3012 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2149 ms 15532 KB Output is correct
2 Correct 2446 ms 13900 KB Output is correct
3 Correct 2430 ms 17652 KB Output is correct
4 Correct 2175 ms 15916 KB Output is correct
5 Correct 2341 ms 13344 KB Output is correct
6 Correct 3009 ms 13732 KB Output is correct
7 Correct 2573 ms 17632 KB Output is correct
8 Correct 2464 ms 15888 KB Output is correct
9 Correct 2223 ms 15272 KB Output is correct
10 Correct 2296 ms 14400 KB Output is correct
11 Correct 2196 ms 14024 KB Output is correct
12 Correct 2179 ms 14412 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 1 ms 356 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 750 ms 3360 KB Output is correct
32 Correct 521 ms 3140 KB Output is correct
33 Correct 661 ms 3396 KB Output is correct
34 Correct 781 ms 3524 KB Output is correct
35 Correct 651 ms 3408 KB Output is correct
36 Correct 591 ms 3268 KB Output is correct
37 Correct 519 ms 3408 KB Output is correct
38 Correct 508 ms 3400 KB Output is correct
39 Correct 302 ms 3280 KB Output is correct
40 Correct 360 ms 3416 KB Output is correct
41 Correct 663 ms 3396 KB Output is correct
42 Correct 678 ms 3244 KB Output is correct
43 Correct 108 ms 3252 KB Output is correct
44 Correct 598 ms 3496 KB Output is correct
45 Correct 367 ms 3268 KB Output is correct
46 Correct 245 ms 3256 KB Output is correct
47 Correct 128 ms 2884 KB Output is correct
48 Correct 126 ms 2980 KB Output is correct
49 Correct 187 ms 3032 KB Output is correct
50 Correct 388 ms 3264 KB Output is correct
51 Correct 207 ms 3012 KB Output is correct
52 Correct 919 ms 3636 KB Output is correct
53 Correct 1022 ms 3660 KB Output is correct
54 Correct 1012 ms 3356 KB Output is correct
55 Correct 784 ms 4036 KB Output is correct
56 Correct 778 ms 4188 KB Output is correct
57 Correct 727 ms 3612 KB Output is correct
58 Correct 835 ms 3620 KB Output is correct
59 Correct 871 ms 3612 KB Output is correct
60 Correct 751 ms 3436 KB Output is correct
61 Correct 108 ms 3780 KB Output is correct
62 Correct 924 ms 3872 KB Output is correct
63 Correct 1002 ms 3612 KB Output is correct
64 Correct 1055 ms 3524 KB Output is correct
65 Correct 1091 ms 3444 KB Output is correct
66 Correct 823 ms 3492 KB Output is correct
67 Correct 984 ms 3212 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 1 ms 356 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 750 ms 3360 KB Output is correct
32 Correct 521 ms 3140 KB Output is correct
33 Correct 661 ms 3396 KB Output is correct
34 Correct 781 ms 3524 KB Output is correct
35 Correct 651 ms 3408 KB Output is correct
36 Correct 591 ms 3268 KB Output is correct
37 Correct 519 ms 3408 KB Output is correct
38 Correct 508 ms 3400 KB Output is correct
39 Correct 302 ms 3280 KB Output is correct
40 Correct 360 ms 3416 KB Output is correct
41 Correct 663 ms 3396 KB Output is correct
42 Correct 678 ms 3244 KB Output is correct
43 Correct 108 ms 3252 KB Output is correct
44 Correct 598 ms 3496 KB Output is correct
45 Correct 367 ms 3268 KB Output is correct
46 Correct 245 ms 3256 KB Output is correct
47 Correct 128 ms 2884 KB Output is correct
48 Correct 126 ms 2980 KB Output is correct
49 Correct 187 ms 3032 KB Output is correct
50 Correct 388 ms 3264 KB Output is correct
51 Correct 207 ms 3012 KB Output is correct
52 Correct 2149 ms 15532 KB Output is correct
53 Correct 2446 ms 13900 KB Output is correct
54 Correct 2430 ms 17652 KB Output is correct
55 Correct 2175 ms 15916 KB Output is correct
56 Correct 2341 ms 13344 KB Output is correct
57 Correct 3009 ms 13732 KB Output is correct
58 Correct 2573 ms 17632 KB Output is correct
59 Correct 2464 ms 15888 KB Output is correct
60 Correct 2223 ms 15272 KB Output is correct
61 Correct 2296 ms 14400 KB Output is correct
62 Correct 2196 ms 14024 KB Output is correct
63 Correct 2179 ms 14412 KB Output is correct
64 Execution timed out 5085 ms 13572 KB Time limit exceeded
65 Halted 0 ms 0 KB -