oj.uz

Submission #684545

# Submission time Handle Problem Language Result Execution time Memory
684545 2023-01-21T16:09:02 Z rainboy Cultivation (JOI17_cultivation) C
100 / 100
 1379 ms 1392 KB 
#include <stdio.h>

#define N	300
#define N2	(N * 2)
#define INF	0x3f3f3f3f
#define LINF	0x3f3f3f3f3f3f3f3fLL

long long min(long long a, long long b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

long long xx[N], yy[N], x_, y_; int n;

void sort(int *ii, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;

		while (j < k)
			if (xx[ii[j]] == xx[i_])
				j++;
			else if (xx[ii[j]] < xx[i_]) {
				tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = ii[j], ii[j] = ii[k], ii[k] = tmp;
			}
		sort(ii, l, i);
		l = k;
	}
}

int lll[N][N], rrr[N][N], ccc[N][N];

long long solve(long long w) {
	static int ll[N2], rr[N2], cc[N2], qul[N2], qur[N2], quc[N2];
	static long long xx_[N2];
	int m, h, h_, il, ir, l, r, c, x, headl, cntl, headr, cntr, headc, cntc;
	long long ans;

	if (w < 0)
		return LINF;
	il = 0, ir = 0, m = 0;
	while (il < n || ir < n) {
		x = il == n || ir < n && xx[ir] <= xx[il] + w + 1 ? xx[ir++] : xx[il++] + w + 1;
		if (m == 0 || xx_[m - 1] != x)
			xx_[m++] = x;
		if (il == ir)
			ll[m - 1] = INF, rr[m - 1] = -1, cc[m - 1] = INF;
		else
			ll[m - 1] = lll[il][ir - 1], rr[m - 1] = rrr[il][ir - 1], cc[m - 1] = ccc[il][ir - 1];
	}
	ans = LINF, headl = cntl = 0, headr = cntr = 0, headc = cntc = 0;
	for (h = 0, h_ = 0; h < m && xx_[h] <= w; h++) {
		while (h_ < m && xx_[h_] < xx_[h] + x_) {
			while (cntl && ll[qul[headl + cntl - 1]] <= ll[h_])
				cntl--;
			qul[headl + cntl++] = h_;
			while (cntr && rr[qur[headr + cntr - 1]] >= rr[h_])
				cntr--;
			qur[headr + cntr++] = h_;
			while (cntc && cc[quc[headc + cntc - 1]] <= cc[h_])
				cntc--;
			quc[headc + cntc++] = h_;
			h_++;
		}
		l = ll[qul[headl]], r = rr[qur[headr]], c = cc[quc[headc]];
		if (l != INF && r != -1 && c != INF)
			ans = min(ans, w + max(l + y_ - 1 - r, c));
		if (qul[headl] == h)
			headl++, cntl--;
		if (qur[headr] == h)
			headr++, cntr--;
		if (quc[headc] == h)
			headc++, cntc--;
	}
	return ans;
}

int main() {
	static int ii[N], xx_[N], yy_[N];
	int k, h, i, j, tmp;
	long long ans;

	scanf("%lld%lld%d", &x_, &y_, &n);
	for (i = 0; i < n; i++)
		scanf("%lld%lld", &xx[i], &yy[i]), xx[i]--, yy[i]--;
	for (i = 0; i < n; i++)
		ii[i] = i;
	sort(ii, 0, n);
	for (i = 0; i < n; i++)
		xx_[i] = xx[ii[i]], yy_[i] = yy[ii[i]];
	for (i = 0; i < n; i++)
		xx[i] = xx_[i], yy[i] = yy_[i];
	for (i = 0; i < n; i++) {
		k = 0;
		for (j = i; j < n; j++) {
			ii[k++] = j;
			for (h = k - 1; h > 0 && yy[ii[h]] < yy[ii[h - 1]]; h--)
				tmp = ii[h], ii[h] = ii[h - 1], ii[h - 1] = tmp;
			lll[i][j] = yy[ii[0]], rrr[i][j] = yy[ii[k - 1]];
			for (h = 1; h < k; h++)
				ccc[i][j] = max(ccc[i][j], yy[ii[h]] - yy[ii[h - 1]] - 1);
		}
	}
	ans = LINF;
	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++)
			ans = min(ans, min(solve(xx[j] - xx[i] - 1), solve(x_ + xx[j] - xx[i] - 1)));
	printf("%lld\n", ans);
	return 0;
}

Compilation message

cultivation.c: In function 'solve':
cultivation.c:50:25: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   50 |   x = il == n || ir < n && xx[ir] <= xx[il] + w + 1 ? xx[ir++] : xx[il++] + w + 1;
      |                  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
cultivation.c: In function 'main':
cultivation.c:90:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |  scanf("%lld%lld%d", &x_, &y_, &n);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
cultivation.c:92:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   92 |   scanf("%lld%lld", &xx[i], &yy[i]), xx[i]--, yy[i]--;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 7 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 5 ms 468 KB Output is correct
22 Correct 37 ms 724 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 130 ms 980 KB Output is correct
25 Correct 66 ms 816 KB Output is correct
26 Correct 352 ms 1344 KB Output is correct
27 Correct 364 ms 1336 KB Output is correct
28 Correct 136 ms 1004 KB Output is correct
29 Correct 339 ms 1340 KB Output is correct
30 Correct 349 ms 1340 KB Output is correct
31 Correct 356 ms 1236 KB Output is correct
32 Correct 356 ms 1336 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 7 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 5 ms 468 KB Output is correct
22 Correct 37 ms 724 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 130 ms 980 KB Output is correct
25 Correct 66 ms 816 KB Output is correct
26 Correct 352 ms 1344 KB Output is correct
27 Correct 364 ms 1336 KB Output is correct
28 Correct 136 ms 1004 KB Output is correct
29 Correct 339 ms 1340 KB Output is correct
30 Correct 349 ms 1340 KB Output is correct
31 Correct 356 ms 1236 KB Output is correct
32 Correct 356 ms 1336 KB Output is correct
33 Correct 161 ms 1340 KB Output is correct
34 Correct 336 ms 1344 KB Output is correct
35 Correct 366 ms 1356 KB Output is correct
36 Correct 356 ms 1340 KB Output is correct
37 Correct 343 ms 1336 KB Output is correct
38 Correct 350 ms 1236 KB Output is correct
39 Correct 369 ms 1228 KB Output is correct
40 Correct 354 ms 1356 KB Output is correct
41 Correct 227 ms 1340 KB Output is correct
42 Correct 304 ms 1336 KB Output is correct
43 Correct 353 ms 1236 KB Output is correct
44 Correct 356 ms 1236 KB Output is correct

Subtask #4
30.0 / 30.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 2 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 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 408 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #5
20.0 / 20.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 2 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 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 408 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 54 ms 652 KB Output is correct
22 Correct 52 ms 596 KB Output is correct
23 Correct 41 ms 596 KB Output is correct
24 Correct 39 ms 596 KB Output is correct
25 Correct 54 ms 596 KB Output is correct
26 Correct 35 ms 648 KB Output is correct
27 Correct 55 ms 596 KB Output is correct
28 Correct 56 ms 652 KB Output is correct
29 Correct 45 ms 596 KB Output is correct
30 Correct 54 ms 648 KB Output is correct
31 Correct 55 ms 596 KB Output is correct
32 Correct 54 ms 648 KB Output is correct
33 Correct 37 ms 652 KB Output is correct
34 Correct 54 ms 596 KB Output is correct
35 Correct 49 ms 596 KB Output is correct
36 Correct 45 ms 596 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 7 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 5 ms 468 KB Output is correct
22 Correct 37 ms 724 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 130 ms 980 KB Output is correct
25 Correct 66 ms 816 KB Output is correct
26 Correct 352 ms 1344 KB Output is correct
27 Correct 364 ms 1336 KB Output is correct
28 Correct 136 ms 1004 KB Output is correct
29 Correct 339 ms 1340 KB Output is correct
30 Correct 349 ms 1340 KB Output is correct
31 Correct 356 ms 1236 KB Output is correct
32 Correct 356 ms 1336 KB Output is correct
33 Correct 161 ms 1340 KB Output is correct
34 Correct 336 ms 1344 KB Output is correct
35 Correct 366 ms 1356 KB Output is correct
36 Correct 356 ms 1340 KB Output is correct
37 Correct 343 ms 1336 KB Output is correct
38 Correct 350 ms 1236 KB Output is correct
39 Correct 369 ms 1228 KB Output is correct
40 Correct 354 ms 1356 KB Output is correct
41 Correct 227 ms 1340 KB Output is correct
42 Correct 304 ms 1336 KB Output is correct
43 Correct 353 ms 1236 KB Output is correct
44 Correct 356 ms 1236 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 2 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 408 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 54 ms 652 KB Output is correct
66 Correct 52 ms 596 KB Output is correct
67 Correct 41 ms 596 KB Output is correct
68 Correct 39 ms 596 KB Output is correct
69 Correct 54 ms 596 KB Output is correct
70 Correct 35 ms 648 KB Output is correct
71 Correct 55 ms 596 KB Output is correct
72 Correct 56 ms 652 KB Output is correct
73 Correct 45 ms 596 KB Output is correct
74 Correct 54 ms 648 KB Output is correct
75 Correct 55 ms 596 KB Output is correct
76 Correct 54 ms 648 KB Output is correct
77 Correct 37 ms 652 KB Output is correct
78 Correct 54 ms 596 KB Output is correct
79 Correct 49 ms 596 KB Output is correct
80 Correct 45 ms 596 KB Output is correct
81 Correct 551 ms 1076 KB Output is correct
82 Correct 545 ms 1084 KB Output is correct
83 Correct 749 ms 1176 KB Output is correct
84 Correct 815 ms 1192 KB Output is correct
85 Correct 1243 ms 1352 KB Output is correct
86 Correct 1192 ms 1336 KB Output is correct
87 Correct 1194 ms 1336 KB Output is correct
88 Correct 1002 ms 1336 KB Output is correct
89 Correct 1160 ms 1340 KB Output is correct
90 Correct 722 ms 1244 KB Output is correct
91 Correct 1257 ms 1344 KB Output is correct
92 Correct 1369 ms 1336 KB Output is correct
93 Correct 1082 ms 1392 KB Output is correct
94 Correct 1148 ms 1340 KB Output is correct
95 Correct 1379 ms 1340 KB Output is correct
96 Correct 1169 ms 1340 KB Output is correct
97 Correct 1124 ms 1336 KB Output is correct
98 Correct 223 ms 1340 KB Output is correct