oj.uz

Submission #671335

# Submission time Handle Problem Language Result Execution time Memory
671335 2022-12-12T21:35:47 Z rainboy Hamburg Steak (JOI20_hamburg) C
21 / 100
 3000 ms 18128 KB 
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
 
#define N	200000
#define K	4
#define INF	0x3f3f3f3f3f3f3f3fLL
 
long long min(long long a, long long b) { return a < b ? a : b; }
long long max(long long a, long long b) { return a > b ? a : b; }
 
long long xxl[N], xxr[N], yyl[N], yyr[N], xx[K], yy[K]; int n, k;
 
int pierced(int i, int h_) {
	int h;
 
	for (h = 0; h < h_; h++)
		if (xxl[i] <= xx[h] && xx[h] <= xxr[i] && yyl[i] <= yy[h] && yy[h] <= yyr[i])
			return 1;
	return 0;
}
 
void solve(int h_) {
	int h, i;
	long long xl, xr, yl, yr;
 
	xl = INF, xr = -1, yl = INF, yr = -1;
	for (i = 0; i < n; i++)
		if (!pierced(i, h_))
			xl = min(xl, xxr[i]), xr = max(xr, xxl[i]), yl = min(yl, yyr[i]), yr = max(yr, yyl[i]);
	if (xl == INF) {
		for (h = h_; h < k; h++)
			xx[h] = 1, yy[h] = 1;
		for (h = 0; h < k; h++)
			printf("%lld %lld\n", xx[h], yy[h]);
		exit(0);
	} else if (h_ < k) {
		xx[h_] = xl, yy[h_] = yl, solve(h_ + 1);
		xx[h_] = xl, yy[h_] = yr, solve(h_ + 1);
		xx[h_] = xr, yy[h_] = yl, solve(h_ + 1);
		xx[h_] = xr, yy[h_] = yr, solve(h_ + 1);
	}
}
 
long long ll[N], rr[N]; int ii0[N], ii1[N], ii2[N], n0, n1, n2; long long xl, xr, yl, yr, z1, z2, z3, z4;
 
long long idx(long long x, long long y) {
	if (y == yl)
		return x - xl;
	if (x == xr)
		return z1 + y - yl;
	if (y == yr)
		return z2 + xr - x;
	if (x == xl)
		return z3 + yr - y;
	return -1;
}
 
void get_min_max(int h_, long long *xl_, long long *xr_, long long *yl_, long long *yr_) {
	int h, i, i_, pierced;
 
	*xl_ = INF, *xr_ = -1, *yl_ = INF, *yr_ = -1;
	for (i = 0; i < n0; i++) {
		i_ = ii0[i], pierced = 0;
		for (h = 0; h < h_; h++) {
			long long z = idx(xx[h], yy[h]);
 
			if (ll[i_] <= z && z <= rr[i_] || ll[i_] <= z4 + z && z4 + z <= rr[i_]) {
				pierced = 1;
				break;
			}
		}
		if (!pierced)
			*xl_ = min(*xl_, xxr[i_]), *xr_ = max(*xr_, xxl[i_]), *yl_ = min(*yl_, yyr[i_]), *yr_ = max(*yr_, yyl[i_]);
	}
	for (i = 0; i < n1; i++) {
		i_ = ii1[i], pierced = 0;
		for (h = 0; h < h_; h++)
			if (ll[i_] <= xx[h] && xx[h] <= rr[i_]) {
				pierced = 1;
				break;
			}
		if (!pierced)
			*xl_ = min(*xl_, xxr[i_]), *xr_ = max(*xr_, xxl[i_]), *yl_ = min(*yl_, yyr[i_]), *yr_ = max(*yr_, yyl[i_]);
	}
	for (i = 0; i < n2; i++) {
		i_ = ii2[i], pierced = 0;
		for (h = 0; h < h_; h++)
			if (ll[i_] <= yy[h] && yy[h] <= rr[i_]) {
				pierced = 1;
				break;
			}
		if (!pierced)
			*xl_ = min(*xl_, xxr[i_]), *xr_ = max(*xr_, xxl[i_]), *yl_ = min(*yl_, yyr[i_]), *yr_ = max(*yr_, yyl[i_]);
	}
}
 
void solve_(int h_) {
	int h, i;
	long long xl_, yl_, xr_, yr_;
 
	if (h_ > 0 && idx(xx[h_ - 1], yy[h_ - 1]) == -1)
		return;
	get_min_max(h_, &xl_, &xr_, &yl_, &yr_);
	if (xl_ == INF) {
		for (h = h_; h < k; h++)
			xx[h] = 1, yy[h] = 1;
		for (h = 0; h < k; h++)
			printf("%lld %lld\n", xx[h], yy[h]);
		exit(0);
	} else if (h_ == 0) {
		xx[h_] = xl_;
		for (i = 0; i < n; i++)
			yy[h_] = yyl[i], solve_(h_ + 1);
	} else if (h_ < k) {
		xx[h_] = xl_, yy[h_] = yl_, solve_(h_ + 1);
		xx[h_] = xl_, yy[h_] = yr_, solve_(h_ + 1);
		xx[h_] = xr_, yy[h_] = yl_, solve_(h_ + 1);
		xx[h_] = xr_, yy[h_] = yr_, solve_(h_ + 1);
	}
}
 
int main() {
	int i;
	long long l, r;
 
	scanf("%d%d", &n, &k);
	for (i = 0; i < n; i++)
		scanf("%lld%lld%lld%lld", &xxl[i], &yyl[i], &xxr[i], &yyr[i]);
	solve(0);
	xl = INF, xr = -1, yl = INF, yr = -1;
	for (i = 0; i < n; i++)
		xl = min(xl, xxr[i]), xr = max(xr, xxl[i]), yl = min(yl, yyr[i]), yr = max(yr, yyl[i]);
	assert(k == 4 && xl < xr && yl < yr);
	z1 = xr - xl, z2 = z1 + yr - yl, z3 = z2 + xr - xl, z4 = z3 + yr - yl;
	for (i = 0; i < n; i++)
		xxl[i] = max(xxl[i], xl), xxr[i] = min(xxr[i], xr), yyl[i] = max(yyl[i], yl), yyr[i] = min(yyr[i], yr);
	for (i = 0; i < n; i++)
		if (xl < xxl[i] && xxr[i] < xr && yyl[i] == yl && yyr[i] == yr)
			ll[i] = xxl[i], rr[i] = xxr[i], ii1[n1++] = i;
		else if (yl < yyl[i] && yyr[i] < yr && xxl[i] == xl && xxr[i] == xr)
			ll[i] = yyl[i], rr[i] = yyr[i], ii2[n2++] = i;
		else {
			l = INF, r = -1;
			if (yyl[i] == yl)
				l = min(l, xxl[i] - xl), r = max(r, xxr[i] - xl);
			if (xxr[i] == xr)
				l = min(l, z1 + yyl[i] - yl), r = max(r, z1 + yyr[i] - yl);
			if (xxl[i] == xl && yyl[i] == yl)
				l += z4, r += z4;
			if (yyr[i] == yr)
				l = min(l, z2 + xr - xxr[i]), r = max(r, z2 + xr - xxl[i]);
			if (xxl[i] == xl)
				l = min(l, z3 + yr - yyr[i]), r = max(r, z3 + yr - yyl[i]);
			ll[i] = l, rr[i] = r, ii0[n0++] = i;
		}
	solve_(0);
	return 0;
}

Compilation message

hamburg.c: In function 'get_min_max':
hamburg.c:68:20: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   68 |    if (ll[i_] <= z && z <= rr[i_] || ll[i_] <= z4 + z && z4 + z <= rr[i_]) {
      |        ~~~~~~~~~~~~^~~~~~~~~~~~~~
hamburg.c: In function 'main':
hamburg.c:127:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  127 |  scanf("%d%d", &n, &k);
      |  ^~~~~~~~~~~~~~~~~~~~~
hamburg.c:129:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  129 |   scanf("%lld%lld%lld%lld", &xxl[i], &yyl[i], &xxr[i], &yyr[i]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 10 ms 380 KB Output is correct
14 Correct 730 ms 416 KB Output is correct
15 Correct 10 ms 404 KB Output is correct
16 Correct 6 ms 460 KB Output is correct
17 Correct 672 ms 404 KB Output is correct
18 Correct 6 ms 340 KB Output is correct
19 Correct 9 ms 380 KB Output is correct
20 Correct 1458 ms 416 KB Output is correct
21 Correct 10 ms 340 KB Output is correct
22 Correct 7 ms 376 KB Output is correct
23 Correct 133 ms 424 KB Output is correct
24 Correct 8 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 4 ms 340 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 4 ms 344 KB Output is correct
31 Correct 580 ms 340 KB Output is correct
32 Correct 38 ms 344 KB Output is correct
33 Correct 62 ms 376 KB Output is correct
34 Correct 42 ms 344 KB Output is correct
35 Correct 315 ms 340 KB Output is correct
36 Correct 633 ms 468 KB Output is correct
37 Correct 2849 ms 460 KB Output is correct
38 Correct 382 ms 504 KB Output is correct
39 Correct 965 ms 496 KB Output is correct
40 Correct 1425 ms 500 KB Output is correct
41 Correct 1444 ms 500 KB Output is correct
42 Correct 726 ms 496 KB Output is correct
43 Correct 247 ms 496 KB Output is correct
44 Correct 1337 ms 512 KB Output is correct
45 Correct 5 ms 340 KB Output is correct
46 Correct 1655 ms 496 KB Output is correct
47 Correct 401 ms 492 KB Output is correct
48 Correct 204 ms 468 KB Output is correct
49 Correct 799 ms 592 KB Output is correct
50 Correct 308 ms 492 KB Output is correct
51 Correct 2191 ms 500 KB Output is correct
52 Correct 1084 ms 496 KB Output is correct
53 Correct 506 ms 492 KB Output is correct
54 Correct 314 ms 468 KB Output is correct
55 Correct 242 ms 500 KB Output is correct
56 Correct 778 ms 488 KB Output is correct
57 Correct 444 ms 488 KB Output is correct
58 Correct 115 ms 492 KB Output is correct

Subtask #5
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 81 ms 6504 KB Output is correct
6 Correct 75 ms 6476 KB Output is correct
7 Correct 74 ms 6440 KB Output is correct
8 Correct 81 ms 6556 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 79 ms 6484 KB Output is correct
6 Correct 86 ms 6496 KB Output is correct
7 Correct 78 ms 6508 KB Output is correct
8 Correct 87 ms 6476 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 78 ms 6428 KB Output is correct
14 Correct 80 ms 6608 KB Output is correct
15 Correct 78 ms 6408 KB Output is correct
16 Correct 78 ms 6440 KB Output is correct
17 Correct 81 ms 6512 KB Output is correct
18 Correct 78 ms 6512 KB Output is correct
19 Correct 80 ms 6532 KB Output is correct
20 Correct 93 ms 6412 KB Output is correct
21 Correct 241 ms 6452 KB Output is correct
22 Correct 162 ms 6416 KB Output is correct
23 Correct 129 ms 6520 KB Output is correct
24 Correct 149 ms 6500 KB Output is correct

Subtask #8
0 / 79.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 10 ms 380 KB Output is correct
14 Correct 730 ms 416 KB Output is correct
15 Correct 10 ms 404 KB Output is correct
16 Correct 6 ms 460 KB Output is correct
17 Correct 672 ms 404 KB Output is correct
18 Correct 6 ms 340 KB Output is correct
19 Correct 9 ms 380 KB Output is correct
20 Correct 1458 ms 416 KB Output is correct
21 Correct 10 ms 340 KB Output is correct
22 Correct 7 ms 376 KB Output is correct
23 Correct 133 ms 424 KB Output is correct
24 Correct 8 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 4 ms 340 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 4 ms 344 KB Output is correct
31 Correct 580 ms 340 KB Output is correct
32 Correct 38 ms 344 KB Output is correct
33 Correct 62 ms 376 KB Output is correct
34 Correct 42 ms 344 KB Output is correct
35 Correct 315 ms 340 KB Output is correct
36 Correct 633 ms 468 KB Output is correct
37 Correct 2849 ms 460 KB Output is correct
38 Correct 382 ms 504 KB Output is correct
39 Correct 965 ms 496 KB Output is correct
40 Correct 1425 ms 500 KB Output is correct
41 Correct 1444 ms 500 KB Output is correct
42 Correct 726 ms 496 KB Output is correct
43 Correct 247 ms 496 KB Output is correct
44 Correct 1337 ms 512 KB Output is correct
45 Correct 5 ms 340 KB Output is correct
46 Correct 1655 ms 496 KB Output is correct
47 Correct 401 ms 492 KB Output is correct
48 Correct 204 ms 468 KB Output is correct
49 Correct 799 ms 592 KB Output is correct
50 Correct 308 ms 492 KB Output is correct
51 Correct 2191 ms 500 KB Output is correct
52 Correct 1084 ms 496 KB Output is correct
53 Correct 506 ms 492 KB Output is correct
54 Correct 314 ms 468 KB Output is correct
55 Correct 242 ms 500 KB Output is correct
56 Correct 778 ms 488 KB Output is correct
57 Correct 444 ms 488 KB Output is correct
58 Correct 115 ms 492 KB Output is correct
59 Correct 88 ms 14188 KB Output is correct
60 Correct 89 ms 14196 KB Output is correct
61 Correct 85 ms 14156 KB Output is correct
62 Correct 85 ms 14156 KB Output is correct
63 Correct 88 ms 14236 KB Output is correct
64 Correct 82 ms 14260 KB Output is correct
65 Correct 88 ms 14268 KB Output is correct
66 Correct 99 ms 14156 KB Output is correct
67 Correct 271 ms 14276 KB Output is correct
68 Correct 215 ms 14168 KB Output is correct
69 Correct 143 ms 14156 KB Output is correct
70 Correct 167 ms 14196 KB Output is correct
71 Correct 1050 ms 14272 KB Output is correct
72 Execution timed out 3034 ms 18128 KB Time limit exceeded
73 Halted 0 ms 0 KB -