oj.uz

Submission #482253

# Submission time Handle Problem Language Result Execution time Memory
482253 2021-10-23T21:56:10 Z nonsensenonsense1 New Home (APIO18_new_home) C++17
57 / 100
 5000 ms 17636 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 = 700;
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

# Verdict Execution time Memory 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 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 2 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 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 1 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

# Verdict Execution time Memory 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 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 2 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 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 1 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 903 ms 3364 KB Output is correct
32 Correct 604 ms 3200 KB Output is correct
33 Correct 853 ms 3268 KB Output is correct
34 Correct 985 ms 3520 KB Output is correct
35 Correct 849 ms 3352 KB Output is correct
36 Correct 731 ms 3268 KB Output is correct
37 Correct 627 ms 3368 KB Output is correct
38 Correct 619 ms 3240 KB Output is correct
39 Correct 328 ms 3268 KB Output is correct
40 Correct 410 ms 3268 KB Output is correct
41 Correct 730 ms 3332 KB Output is correct
42 Correct 768 ms 3268 KB Output is correct
43 Correct 87 ms 3140 KB Output is correct
44 Correct 639 ms 3484 KB Output is correct
45 Correct 377 ms 3340 KB Output is correct
46 Correct 261 ms 3268 KB Output is correct
47 Correct 125 ms 2888 KB Output is correct
48 Correct 122 ms 2876 KB Output is correct
49 Correct 194 ms 3020 KB Output is correct
50 Correct 434 ms 3432 KB Output is correct
51 Correct 208 ms 3012 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1597 ms 15532 KB Output is correct
2 Correct 1814 ms 13764 KB Output is correct
3 Correct 1830 ms 17636 KB Output is correct
4 Correct 1628 ms 15884 KB Output is correct
5 Correct 1636 ms 13392 KB Output is correct
6 Correct 2072 ms 13736 KB Output is correct
7 Correct 1831 ms 17632 KB Output is correct
8 Correct 1654 ms 15924 KB Output is correct
9 Correct 1585 ms 15300 KB Output is correct
10 Correct 1662 ms 14432 KB Output is correct
11 Correct 1568 ms 14028 KB Output is correct
12 Correct 1573 ms 14636 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5074 ms 13476 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory 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 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 2 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 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 1 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 903 ms 3364 KB Output is correct
32 Correct 604 ms 3200 KB Output is correct
33 Correct 853 ms 3268 KB Output is correct
34 Correct 985 ms 3520 KB Output is correct
35 Correct 849 ms 3352 KB Output is correct
36 Correct 731 ms 3268 KB Output is correct
37 Correct 627 ms 3368 KB Output is correct
38 Correct 619 ms 3240 KB Output is correct
39 Correct 328 ms 3268 KB Output is correct
40 Correct 410 ms 3268 KB Output is correct
41 Correct 730 ms 3332 KB Output is correct
42 Correct 768 ms 3268 KB Output is correct
43 Correct 87 ms 3140 KB Output is correct
44 Correct 639 ms 3484 KB Output is correct
45 Correct 377 ms 3340 KB Output is correct
46 Correct 261 ms 3268 KB Output is correct
47 Correct 125 ms 2888 KB Output is correct
48 Correct 122 ms 2876 KB Output is correct
49 Correct 194 ms 3020 KB Output is correct
50 Correct 434 ms 3432 KB Output is correct
51 Correct 208 ms 3012 KB Output is correct
52 Correct 1158 ms 3568 KB Output is correct
53 Correct 1318 ms 3620 KB Output is correct
54 Correct 1308 ms 3360 KB Output is correct
55 Correct 834 ms 4040 KB Output is correct
56 Correct 845 ms 4296 KB Output is correct
57 Correct 777 ms 3524 KB Output is correct
58 Correct 958 ms 3632 KB Output is correct
59 Correct 1053 ms 3688 KB Output is correct
60 Correct 841 ms 3396 KB Output is correct
61 Correct 86 ms 3784 KB Output is correct
62 Correct 1234 ms 3788 KB Output is correct
63 Correct 1349 ms 3652 KB Output is correct
64 Correct 1428 ms 3636 KB Output is correct
65 Correct 1398 ms 3496 KB Output is correct
66 Correct 996 ms 3420 KB Output is correct
67 Correct 1318 ms 3212 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory 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 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 2 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 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 1 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 903 ms 3364 KB Output is correct
32 Correct 604 ms 3200 KB Output is correct
33 Correct 853 ms 3268 KB Output is correct
34 Correct 985 ms 3520 KB Output is correct
35 Correct 849 ms 3352 KB Output is correct
36 Correct 731 ms 3268 KB Output is correct
37 Correct 627 ms 3368 KB Output is correct
38 Correct 619 ms 3240 KB Output is correct
39 Correct 328 ms 3268 KB Output is correct
40 Correct 410 ms 3268 KB Output is correct
41 Correct 730 ms 3332 KB Output is correct
42 Correct 768 ms 3268 KB Output is correct
43 Correct 87 ms 3140 KB Output is correct
44 Correct 639 ms 3484 KB Output is correct
45 Correct 377 ms 3340 KB Output is correct
46 Correct 261 ms 3268 KB Output is correct
47 Correct 125 ms 2888 KB Output is correct
48 Correct 122 ms 2876 KB Output is correct
49 Correct 194 ms 3020 KB Output is correct
50 Correct 434 ms 3432 KB Output is correct
51 Correct 208 ms 3012 KB Output is correct
52 Correct 1597 ms 15532 KB Output is correct
53 Correct 1814 ms 13764 KB Output is correct
54 Correct 1830 ms 17636 KB Output is correct
55 Correct 1628 ms 15884 KB Output is correct
56 Correct 1636 ms 13392 KB Output is correct
57 Correct 2072 ms 13736 KB Output is correct
58 Correct 1831 ms 17632 KB Output is correct
59 Correct 1654 ms 15924 KB Output is correct
60 Correct 1585 ms 15300 KB Output is correct
61 Correct 1662 ms 14432 KB Output is correct
62 Correct 1568 ms 14028 KB Output is correct
63 Correct 1573 ms 14636 KB Output is correct
64 Execution timed out 5074 ms 13476 KB Time limit exceeded
65 Halted 0 ms 0 KB -