oj.uz

답안 #482249

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
482249 2021-10-23T21:38:25 Z nonsensenonsense1 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 17724 KB 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#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:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
new_home.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      | 
new_home.cpp: In function 'int main()':
new_home.cpp:61:57: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   61 |   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:84:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |    while (l == j || l <= n && amt < k - inter_type.size()) {
      |                               ~~~~^~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:84:28: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   84 |    while (l == j || l <= n && amt < k - inter_type.size()) {
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:40:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |  scanf("%d%d%d", &n, &k, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:45:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |   scanf("%d%d%d%d", &a[i].x, &a[i].t, &a[i].l, &a[i].r);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:51:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |   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 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 1 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 332 KB Output is correct
18 Correct 2 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 0 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 2 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 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 1 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 332 KB Output is correct
18 Correct 2 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 0 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 2 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 737 ms 3356 KB Output is correct
32 Correct 527 ms 3088 KB Output is correct
33 Correct 682 ms 3368 KB Output is correct
34 Correct 775 ms 3372 KB Output is correct
35 Correct 668 ms 3360 KB Output is correct
36 Correct 604 ms 3224 KB Output is correct
37 Correct 518 ms 3344 KB Output is correct
38 Correct 518 ms 3220 KB Output is correct
39 Correct 306 ms 3268 KB Output is correct
40 Correct 360 ms 3500 KB Output is correct
41 Correct 654 ms 3404 KB Output is correct
42 Correct 667 ms 3224 KB Output is correct
43 Correct 119 ms 3524 KB Output is correct
44 Correct 597 ms 3500 KB Output is correct
45 Correct 391 ms 3268 KB Output is correct
46 Correct 274 ms 3268 KB Output is correct
47 Correct 131 ms 2920 KB Output is correct
48 Correct 130 ms 2940 KB Output is correct
49 Correct 203 ms 2960 KB Output is correct
50 Correct 394 ms 3276 KB Output is correct
51 Correct 218 ms 3016 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2225 ms 15528 KB Output is correct
2 Correct 2505 ms 13816 KB Output is correct
3 Correct 2498 ms 17680 KB Output is correct
4 Correct 2185 ms 15940 KB Output is correct
5 Correct 2239 ms 13412 KB Output is correct
6 Correct 2847 ms 13728 KB Output is correct
7 Correct 2593 ms 17724 KB Output is correct
8 Correct 2191 ms 15848 KB Output is correct
9 Correct 2144 ms 15268 KB Output is correct
10 Correct 2223 ms 14432 KB Output is correct
11 Correct 2137 ms 13900 KB Output is correct
12 Correct 2085 ms 14440 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5099 ms 13508 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 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 1 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 332 KB Output is correct
18 Correct 2 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 0 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 2 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 737 ms 3356 KB Output is correct
32 Correct 527 ms 3088 KB Output is correct
33 Correct 682 ms 3368 KB Output is correct
34 Correct 775 ms 3372 KB Output is correct
35 Correct 668 ms 3360 KB Output is correct
36 Correct 604 ms 3224 KB Output is correct
37 Correct 518 ms 3344 KB Output is correct
38 Correct 518 ms 3220 KB Output is correct
39 Correct 306 ms 3268 KB Output is correct
40 Correct 360 ms 3500 KB Output is correct
41 Correct 654 ms 3404 KB Output is correct
42 Correct 667 ms 3224 KB Output is correct
43 Correct 119 ms 3524 KB Output is correct
44 Correct 597 ms 3500 KB Output is correct
45 Correct 391 ms 3268 KB Output is correct
46 Correct 274 ms 3268 KB Output is correct
47 Correct 131 ms 2920 KB Output is correct
48 Correct 130 ms 2940 KB Output is correct
49 Correct 203 ms 2960 KB Output is correct
50 Correct 394 ms 3276 KB Output is correct
51 Correct 218 ms 3016 KB Output is correct
52 Correct 820 ms 3640 KB Output is correct
53 Correct 891 ms 3624 KB Output is correct
54 Correct 850 ms 3360 KB Output is correct
55 Correct 717 ms 4048 KB Output is correct
56 Correct 691 ms 4180 KB Output is correct
57 Correct 696 ms 3652 KB Output is correct
58 Correct 754 ms 3620 KB Output is correct
59 Correct 777 ms 3616 KB Output is correct
60 Correct 708 ms 3432 KB Output is correct
61 Correct 111 ms 3680 KB Output is correct
62 Correct 802 ms 3780 KB Output is correct
63 Correct 862 ms 3620 KB Output is correct
64 Correct 916 ms 3560 KB Output is correct
65 Correct 912 ms 3448 KB Output is correct
66 Correct 755 ms 3500 KB Output is correct
67 Correct 960 ms 3172 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 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 1 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 332 KB Output is correct
18 Correct 2 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 0 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 2 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 737 ms 3356 KB Output is correct
32 Correct 527 ms 3088 KB Output is correct
33 Correct 682 ms 3368 KB Output is correct
34 Correct 775 ms 3372 KB Output is correct
35 Correct 668 ms 3360 KB Output is correct
36 Correct 604 ms 3224 KB Output is correct
37 Correct 518 ms 3344 KB Output is correct
38 Correct 518 ms 3220 KB Output is correct
39 Correct 306 ms 3268 KB Output is correct
40 Correct 360 ms 3500 KB Output is correct
41 Correct 654 ms 3404 KB Output is correct
42 Correct 667 ms 3224 KB Output is correct
43 Correct 119 ms 3524 KB Output is correct
44 Correct 597 ms 3500 KB Output is correct
45 Correct 391 ms 3268 KB Output is correct
46 Correct 274 ms 3268 KB Output is correct
47 Correct 131 ms 2920 KB Output is correct
48 Correct 130 ms 2940 KB Output is correct
49 Correct 203 ms 2960 KB Output is correct
50 Correct 394 ms 3276 KB Output is correct
51 Correct 218 ms 3016 KB Output is correct
52 Correct 2225 ms 15528 KB Output is correct
53 Correct 2505 ms 13816 KB Output is correct
54 Correct 2498 ms 17680 KB Output is correct
55 Correct 2185 ms 15940 KB Output is correct
56 Correct 2239 ms 13412 KB Output is correct
57 Correct 2847 ms 13728 KB Output is correct
58 Correct 2593 ms 17724 KB Output is correct
59 Correct 2191 ms 15848 KB Output is correct
60 Correct 2144 ms 15268 KB Output is correct
61 Correct 2223 ms 14432 KB Output is correct
62 Correct 2137 ms 13900 KB Output is correct
63 Correct 2085 ms 14440 KB Output is correct
64 Execution timed out 5099 ms 13508 KB Time limit exceeded
65 Halted 0 ms 0 KB -