oj.uz

답안 #482240

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
482240 2021-10-23T20:33:16 Z nonsensenonsense1 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 17672 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 = 300;
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);
	for (int i = 0; i < q;) {
		memset(ut, 0, k);
		int until = std::min(i + K, q);
		std::vector<int> inter, inter_type;
		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;
		}
		memset(type_amt, 0, k << 2);
		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) {
				while (a[next[fi[inter_type[k]]]].x <= qr[i].l) fi[inter_type[k]] = next[fi[inter_type[k]]];
				res = std::max(res, std::min(to[inter_type[k]], std::min(abs(qr[i].l - a[fi[inter_type[k]]].x), a[next[fi[inter_type[k]]]].x - qr[i].l)));
				to[inter_type[k]] = 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:56:57: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   56 |   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:80:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |    while (l == j || l <= n && amt < k - inter_type.size()) {
      |                               ~~~~^~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:80:28: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   80 |    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 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 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 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 1 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 1 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 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 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 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 1 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 1 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 677 ms 3356 KB Output is correct
32 Correct 503 ms 3196 KB Output is correct
33 Correct 555 ms 3480 KB Output is correct
34 Correct 679 ms 3396 KB Output is correct
35 Correct 597 ms 3344 KB Output is correct
36 Correct 511 ms 3264 KB Output is correct
37 Correct 414 ms 3396 KB Output is correct
38 Correct 398 ms 3272 KB Output is correct
39 Correct 287 ms 3436 KB Output is correct
40 Correct 302 ms 3224 KB Output is correct
41 Correct 588 ms 3468 KB Output is correct
42 Correct 575 ms 3228 KB Output is correct
43 Correct 168 ms 3144 KB Output is correct
44 Correct 544 ms 3452 KB Output is correct
45 Correct 382 ms 3348 KB Output is correct
46 Correct 281 ms 3236 KB Output is correct
47 Correct 159 ms 2948 KB Output is correct
48 Correct 157 ms 2884 KB Output is correct
49 Correct 210 ms 2948 KB Output is correct
50 Correct 369 ms 3436 KB Output is correct
51 Correct 200 ms 3032 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3524 ms 15536 KB Output is correct
2 Correct 4101 ms 13740 KB Output is correct
3 Correct 3905 ms 17672 KB Output is correct
4 Correct 3591 ms 15884 KB Output is correct
5 Correct 3708 ms 13356 KB Output is correct
6 Correct 4598 ms 13724 KB Output is correct
7 Correct 3964 ms 17632 KB Output is correct
8 Correct 3560 ms 15888 KB Output is correct
9 Correct 3450 ms 15264 KB Output is correct
10 Correct 3661 ms 14308 KB Output is correct
11 Correct 3522 ms 13928 KB Output is correct
12 Correct 3466 ms 14384 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5083 ms 13576 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 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 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 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 1 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 1 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 677 ms 3356 KB Output is correct
32 Correct 503 ms 3196 KB Output is correct
33 Correct 555 ms 3480 KB Output is correct
34 Correct 679 ms 3396 KB Output is correct
35 Correct 597 ms 3344 KB Output is correct
36 Correct 511 ms 3264 KB Output is correct
37 Correct 414 ms 3396 KB Output is correct
38 Correct 398 ms 3272 KB Output is correct
39 Correct 287 ms 3436 KB Output is correct
40 Correct 302 ms 3224 KB Output is correct
41 Correct 588 ms 3468 KB Output is correct
42 Correct 575 ms 3228 KB Output is correct
43 Correct 168 ms 3144 KB Output is correct
44 Correct 544 ms 3452 KB Output is correct
45 Correct 382 ms 3348 KB Output is correct
46 Correct 281 ms 3236 KB Output is correct
47 Correct 159 ms 2948 KB Output is correct
48 Correct 157 ms 2884 KB Output is correct
49 Correct 210 ms 2948 KB Output is correct
50 Correct 369 ms 3436 KB Output is correct
51 Correct 200 ms 3032 KB Output is correct
52 Correct 694 ms 3624 KB Output is correct
53 Correct 754 ms 3652 KB Output is correct
54 Correct 737 ms 3392 KB Output is correct
55 Correct 637 ms 3820 KB Output is correct
56 Correct 610 ms 4152 KB Output is correct
57 Correct 614 ms 3524 KB Output is correct
58 Correct 672 ms 3620 KB Output is correct
59 Correct 661 ms 3616 KB Output is correct
60 Correct 627 ms 3440 KB Output is correct
61 Correct 159 ms 3708 KB Output is correct
62 Correct 678 ms 3756 KB Output is correct
63 Correct 742 ms 3604 KB Output is correct
64 Correct 783 ms 3524 KB Output is correct
65 Correct 770 ms 3432 KB Output is correct
66 Correct 639 ms 3544 KB Output is correct
67 Correct 721 ms 3308 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 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 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 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 1 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 1 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 677 ms 3356 KB Output is correct
32 Correct 503 ms 3196 KB Output is correct
33 Correct 555 ms 3480 KB Output is correct
34 Correct 679 ms 3396 KB Output is correct
35 Correct 597 ms 3344 KB Output is correct
36 Correct 511 ms 3264 KB Output is correct
37 Correct 414 ms 3396 KB Output is correct
38 Correct 398 ms 3272 KB Output is correct
39 Correct 287 ms 3436 KB Output is correct
40 Correct 302 ms 3224 KB Output is correct
41 Correct 588 ms 3468 KB Output is correct
42 Correct 575 ms 3228 KB Output is correct
43 Correct 168 ms 3144 KB Output is correct
44 Correct 544 ms 3452 KB Output is correct
45 Correct 382 ms 3348 KB Output is correct
46 Correct 281 ms 3236 KB Output is correct
47 Correct 159 ms 2948 KB Output is correct
48 Correct 157 ms 2884 KB Output is correct
49 Correct 210 ms 2948 KB Output is correct
50 Correct 369 ms 3436 KB Output is correct
51 Correct 200 ms 3032 KB Output is correct
52 Correct 3524 ms 15536 KB Output is correct
53 Correct 4101 ms 13740 KB Output is correct
54 Correct 3905 ms 17672 KB Output is correct
55 Correct 3591 ms 15884 KB Output is correct
56 Correct 3708 ms 13356 KB Output is correct
57 Correct 4598 ms 13724 KB Output is correct
58 Correct 3964 ms 17632 KB Output is correct
59 Correct 3560 ms 15888 KB Output is correct
60 Correct 3450 ms 15264 KB Output is correct
61 Correct 3661 ms 14308 KB Output is correct
62 Correct 3522 ms 13928 KB Output is correct
63 Correct 3466 ms 14384 KB Output is correct
64 Execution timed out 5083 ms 13576 KB Time limit exceeded
65 Halted 0 ms 0 KB -