oj.uz

답안 #482244

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
482244 2021-10-23T21:03:59 Z nonsensenonsense1 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 17752 KB 
#include <cstdio>
#include <cassert>
#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 = 600;
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);
	int X = 0;
	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);
			++X;
		}
		assert(X < 3 * N);
		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) {
				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: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:83:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |    while (l == j || l <= n && amt < k - inter_type.size()) {
      |                               ~~~~^~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:83:28: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   83 |    while (l == j || l <= n && amt < k - inter_type.size()) {
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:38:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |  scanf("%d%d%d", &n, &k, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:43:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |   scanf("%d%d%d%d", &a[i].x, &a[i].t, &a[i].l, &a[i].r);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:49:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |   scanf("%d%d", &qr[i].l, &qr[i].y);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2 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 2 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 3 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 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2 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 2 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 3 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 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 798 ms 3480 KB Output is correct
32 Correct 571 ms 3268 KB Output is correct
33 Correct 776 ms 3368 KB Output is correct
34 Correct 914 ms 3448 KB Output is correct
35 Correct 731 ms 3484 KB Output is correct
36 Correct 675 ms 3224 KB Output is correct
37 Correct 588 ms 3316 KB Output is correct
38 Correct 594 ms 3396 KB Output is correct
39 Correct 346 ms 3140 KB Output is correct
40 Correct 390 ms 3288 KB Output is correct
41 Correct 744 ms 3388 KB Output is correct
42 Correct 753 ms 3524 KB Output is correct
43 Correct 101 ms 3244 KB Output is correct
44 Correct 641 ms 3512 KB Output is correct
45 Correct 374 ms 3244 KB Output is correct
46 Correct 263 ms 3200 KB Output is correct
47 Correct 138 ms 2968 KB Output is correct
48 Correct 126 ms 2876 KB Output is correct
49 Correct 210 ms 2952 KB Output is correct
50 Correct 436 ms 3260 KB Output is correct
51 Correct 206 ms 3056 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1959 ms 15608 KB Output is correct
2 Correct 2158 ms 13840 KB Output is correct
3 Correct 2127 ms 17752 KB Output is correct
4 Correct 1871 ms 15864 KB Output is correct
5 Correct 1919 ms 13344 KB Output is correct
6 Correct 2426 ms 13728 KB Output is correct
7 Correct 2105 ms 17564 KB Output is correct
8 Correct 1856 ms 15888 KB Output is correct
9 Correct 1840 ms 15268 KB Output is correct
10 Correct 1952 ms 14448 KB Output is correct
11 Correct 1842 ms 14112 KB Output is correct
12 Correct 1811 ms 14396 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2 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 2 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 3 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 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 798 ms 3480 KB Output is correct
32 Correct 571 ms 3268 KB Output is correct
33 Correct 776 ms 3368 KB Output is correct
34 Correct 914 ms 3448 KB Output is correct
35 Correct 731 ms 3484 KB Output is correct
36 Correct 675 ms 3224 KB Output is correct
37 Correct 588 ms 3316 KB Output is correct
38 Correct 594 ms 3396 KB Output is correct
39 Correct 346 ms 3140 KB Output is correct
40 Correct 390 ms 3288 KB Output is correct
41 Correct 744 ms 3388 KB Output is correct
42 Correct 753 ms 3524 KB Output is correct
43 Correct 101 ms 3244 KB Output is correct
44 Correct 641 ms 3512 KB Output is correct
45 Correct 374 ms 3244 KB Output is correct
46 Correct 263 ms 3200 KB Output is correct
47 Correct 138 ms 2968 KB Output is correct
48 Correct 126 ms 2876 KB Output is correct
49 Correct 210 ms 2952 KB Output is correct
50 Correct 436 ms 3260 KB Output is correct
51 Correct 206 ms 3056 KB Output is correct
52 Correct 1026 ms 3628 KB Output is correct
53 Correct 1203 ms 3752 KB Output is correct
54 Correct 1136 ms 3360 KB Output is correct
55 Correct 831 ms 3812 KB Output is correct
56 Correct 850 ms 3868 KB Output is correct
57 Correct 773 ms 3596 KB Output is correct
58 Correct 927 ms 3752 KB Output is correct
59 Correct 958 ms 3676 KB Output is correct
60 Correct 808 ms 3524 KB Output is correct
61 Correct 95 ms 3780 KB Output is correct
62 Correct 1078 ms 3756 KB Output is correct
63 Correct 1190 ms 3652 KB Output is correct
64 Correct 1254 ms 3488 KB Output is correct
65 Correct 1248 ms 3440 KB Output is correct
66 Correct 922 ms 3492 KB Output is correct
67 Correct 1157 ms 3216 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2 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 2 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 3 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 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 798 ms 3480 KB Output is correct
32 Correct 571 ms 3268 KB Output is correct
33 Correct 776 ms 3368 KB Output is correct
34 Correct 914 ms 3448 KB Output is correct
35 Correct 731 ms 3484 KB Output is correct
36 Correct 675 ms 3224 KB Output is correct
37 Correct 588 ms 3316 KB Output is correct
38 Correct 594 ms 3396 KB Output is correct
39 Correct 346 ms 3140 KB Output is correct
40 Correct 390 ms 3288 KB Output is correct
41 Correct 744 ms 3388 KB Output is correct
42 Correct 753 ms 3524 KB Output is correct
43 Correct 101 ms 3244 KB Output is correct
44 Correct 641 ms 3512 KB Output is correct
45 Correct 374 ms 3244 KB Output is correct
46 Correct 263 ms 3200 KB Output is correct
47 Correct 138 ms 2968 KB Output is correct
48 Correct 126 ms 2876 KB Output is correct
49 Correct 210 ms 2952 KB Output is correct
50 Correct 436 ms 3260 KB Output is correct
51 Correct 206 ms 3056 KB Output is correct
52 Correct 1959 ms 15608 KB Output is correct
53 Correct 2158 ms 13840 KB Output is correct
54 Correct 2127 ms 17752 KB Output is correct
55 Correct 1871 ms 15864 KB Output is correct
56 Correct 1919 ms 13344 KB Output is correct
57 Correct 2426 ms 13728 KB Output is correct
58 Correct 2105 ms 17564 KB Output is correct
59 Correct 1856 ms 15888 KB Output is correct
60 Correct 1840 ms 15268 KB Output is correct
61 Correct 1952 ms 14448 KB Output is correct
62 Correct 1842 ms 14112 KB Output is correct
63 Correct 1811 ms 14396 KB Output is correct
64 Execution timed out 5049 ms 13716 KB Time limit exceeded
65 Halted 0 ms 0 KB -