oj.uz

Submission #59927

# Submission time Handle Problem Language Result Execution time Memory
59927 2018-07-23T10:16:45 Z ainta(#1720) Cultivation (JOI17_cultivation) C++11
60 / 100
 2000 ms 14332 KB 
#include<cstdio>
#include<algorithm>
#include<set>
using namespace std;
long long W, H, n, S[610][610], M[610][610], U[610][610];
set<long long>SX, SY;
long long YY[1000000];
struct point {
	long long x, y;
}w[330];
struct Rect {
	long long x1, y1, x2, y2;
}R[330];
long long X[610], Y[610];
bool Pos(long long dx, long long dy) {
	long long i, j;
	long long CX = 0, CY = 0;
	for (i = 1; i <= n; i++) {
		X[CX++] = w[i].x;
		X[CX++] = w[i].x + dx + 1;
		Y[CY++] = w[i].y;
		Y[CY++] = w[i].y + dy + 1;
	}
	sort(X, X + CX);
	sort(Y, Y + CY);
	CX = unique(X, X + CX) - X;
	CY = unique(Y, Y + CY) - Y;
	for (i = 0; i <= CX; i++)for (j = 0; j <= CY; j++)S[i][j] = 0;
	for (i = 1; i <= n; i++) {
		R[i].x1 = lower_bound(X, X + CX, w[i].x) - X;
		R[i].x2 = lower_bound(X, X + CX, w[i].x + dx + 1) - X;
		R[i].y1 = lower_bound(Y, Y + CY, w[i].y) - Y;
		R[i].y2 = lower_bound(Y, Y + CY, w[i].y + dy + 1) - Y;
		S[R[i].x1][R[i].y1]++;
		S[R[i].x1][R[i].y2]--;
		S[R[i].x2][R[i].y1]--;
		S[R[i].x2][R[i].y2]++;
	}
	for (i = 0; i < CX; i++)for (j = 1; j < CY; j++)S[i][j] += S[i][j - 1];
	for (i = 1; i < CX; i++)for (j = 0; j < CY; j++)S[i][j] += S[i -1][j];
	for (i = 0; i < CX - 1; i++) {
		for (j = 0; j < CY - 1; j++) {
			if (!S[i][j])M[i][j] = 0;
			else if (j == 0)M[i][j] = Y[j + 1] - Y[j];
			else M[i][j] = Y[j + 1] - Y[j] + M[i][j - 1];
			if (M[i][j] >= H) {
				if (i == 0)U[i][j] = X[i + 1] - X[i];
				else U[i][j] = U[i - 1][j] + X[i + 1] - X[i];
				if (U[i][j] >= W)return true;
			}
			else {
				U[i][j] = 0;
			}
		}
	}
	return false;
}
int main() {
	//freopen("input.txt", "r", stdin);
	long long i, j, CY = 0;
	scanf("%lld%lld%lld", &W, &H, &n);
	for (i = 1; i <= n; i++) {
		scanf("%lld%lld", &w[i].x, &w[i].y);
	}
	for (i = 1; i <= n; i++) {
		for (j = 1; j <= n; j++) {
			if (w[i].x <= w[j].x) {
				if(w[j].x>w[i].x)SX.insert(w[j].x - w[i].x - 1);
			}
			SX.insert(w[i].x - 1 + W - w[j].x);
			SX.insert(w[j].x - w[i].x + W);
			if (w[i].y <= w[j].y) {
				if (w[j].y>w[i].y)SY.insert(w[j].y - w[i].y - 1);
			}
			SY.insert(w[i].y - 1 + H - w[j].y);
			SY.insert(w[j].y - w[i].y + H);
		}
	}
	long long res = 4e9;
	for (auto &y : SY) {
		YY[CY++] = y;
	}
	for (auto &x : SX) {
		long long b = 0, e = CY - 1, r = CY;
		while (b <= e) {
			long long mid = (b + e) >> 1;
			if (Pos(x, YY[mid])) {
				r = mid;
				e = mid - 1;
			}
			else b = mid + 1;
		}
		if (r != CY) {
			res = min(res, x + YY[r]);
		}
	}
	printf("%lld\n", res);
	return 0;
}

Compilation message

cultivation.cpp: In function 'int main()':
cultivation.cpp:61:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld", &W, &H, &n);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
cultivation.cpp:63:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld", &w[i].x, &w[i].y);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 3 ms 536 KB Output is correct
4 Correct 3 ms 536 KB Output is correct
5 Correct 2 ms 656 KB Output is correct
6 Correct 3 ms 656 KB Output is correct
7 Correct 2 ms 656 KB Output is correct
8 Correct 2 ms 656 KB Output is correct
9 Correct 3 ms 656 KB Output is correct
10 Correct 2 ms 656 KB Output is correct
11 Correct 2 ms 656 KB Output is correct
12 Correct 3 ms 656 KB Output is correct
13 Correct 2 ms 656 KB Output is correct
14 Correct 2 ms 656 KB Output is correct
15 Correct 2 ms 656 KB Output is correct
16 Correct 3 ms 656 KB Output is correct
17 Correct 4 ms 876 KB Output is correct
18 Correct 13 ms 1260 KB Output is correct
19 Correct 8 ms 1260 KB Output is correct
20 Correct 4 ms 1260 KB Output is correct
21 Correct 19 ms 1388 KB Output is correct
22 Correct 44 ms 1828 KB Output is correct
23 Correct 7 ms 1828 KB Output is correct
24 Correct 59 ms 1828 KB Output is correct
25 Correct 47 ms 1828 KB Output is correct
26 Correct 78 ms 1828 KB Output is correct
27 Correct 78 ms 1828 KB Output is correct
28 Correct 54 ms 1828 KB Output is correct
29 Correct 77 ms 1828 KB Output is correct
30 Correct 80 ms 1828 KB Output is correct
31 Correct 84 ms 1828 KB Output is correct
32 Correct 79 ms 1828 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 3 ms 536 KB Output is correct
4 Correct 3 ms 536 KB Output is correct
5 Correct 2 ms 656 KB Output is correct
6 Correct 3 ms 656 KB Output is correct
7 Correct 2 ms 656 KB Output is correct
8 Correct 2 ms 656 KB Output is correct
9 Correct 3 ms 656 KB Output is correct
10 Correct 2 ms 656 KB Output is correct
11 Correct 2 ms 656 KB Output is correct
12 Correct 3 ms 656 KB Output is correct
13 Correct 2 ms 656 KB Output is correct
14 Correct 2 ms 656 KB Output is correct
15 Correct 2 ms 656 KB Output is correct
16 Correct 3 ms 656 KB Output is correct
17 Correct 4 ms 876 KB Output is correct
18 Correct 13 ms 1260 KB Output is correct
19 Correct 8 ms 1260 KB Output is correct
20 Correct 4 ms 1260 KB Output is correct
21 Correct 19 ms 1388 KB Output is correct
22 Correct 44 ms 1828 KB Output is correct
23 Correct 7 ms 1828 KB Output is correct
24 Correct 59 ms 1828 KB Output is correct
25 Correct 47 ms 1828 KB Output is correct
26 Correct 78 ms 1828 KB Output is correct
27 Correct 78 ms 1828 KB Output is correct
28 Correct 54 ms 1828 KB Output is correct
29 Correct 77 ms 1828 KB Output is correct
30 Correct 80 ms 1828 KB Output is correct
31 Correct 84 ms 1828 KB Output is correct
32 Correct 79 ms 1828 KB Output is correct
33 Correct 248 ms 12908 KB Output is correct
34 Correct 796 ms 13676 KB Output is correct
35 Correct 318 ms 13676 KB Output is correct
36 Correct 810 ms 14188 KB Output is correct
37 Correct 740 ms 14188 KB Output is correct
38 Correct 873 ms 14188 KB Output is correct
39 Correct 701 ms 14188 KB Output is correct
40 Correct 914 ms 14332 KB Output is correct
41 Correct 687 ms 14332 KB Output is correct
42 Correct 379 ms 14332 KB Output is correct
43 Correct 884 ms 14332 KB Output is correct
44 Correct 432 ms 14332 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 14332 KB Output is correct
2 Correct 290 ms 14332 KB Output is correct
3 Correct 294 ms 14332 KB Output is correct
4 Correct 294 ms 14332 KB Output is correct
5 Correct 316 ms 14332 KB Output is correct
6 Correct 27 ms 14332 KB Output is correct
7 Correct 12 ms 14332 KB Output is correct
8 Correct 302 ms 14332 KB Output is correct
9 Correct 109 ms 14332 KB Output is correct
10 Correct 368 ms 14332 KB Output is correct
11 Correct 360 ms 14332 KB Output is correct
12 Correct 357 ms 14332 KB Output is correct
13 Correct 25 ms 14332 KB Output is correct
14 Correct 94 ms 14332 KB Output is correct
15 Correct 28 ms 14332 KB Output is correct
16 Correct 303 ms 14332 KB Output is correct
17 Correct 298 ms 14332 KB Output is correct
18 Correct 108 ms 14332 KB Output is correct
19 Correct 348 ms 14332 KB Output is correct
20 Correct 290 ms 14332 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 14332 KB Output is correct
2 Correct 290 ms 14332 KB Output is correct
3 Correct 294 ms 14332 KB Output is correct
4 Correct 294 ms 14332 KB Output is correct
5 Correct 316 ms 14332 KB Output is correct
6 Correct 27 ms 14332 KB Output is correct
7 Correct 12 ms 14332 KB Output is correct
8 Correct 302 ms 14332 KB Output is correct
9 Correct 109 ms 14332 KB Output is correct
10 Correct 368 ms 14332 KB Output is correct
11 Correct 360 ms 14332 KB Output is correct
12 Correct 357 ms 14332 KB Output is correct
13 Correct 25 ms 14332 KB Output is correct
14 Correct 94 ms 14332 KB Output is correct
15 Correct 28 ms 14332 KB Output is correct
16 Correct 303 ms 14332 KB Output is correct
17 Correct 298 ms 14332 KB Output is correct
18 Correct 108 ms 14332 KB Output is correct
19 Correct 348 ms 14332 KB Output is correct
20 Correct 290 ms 14332 KB Output is correct
21 Execution timed out 2043 ms 14332 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 3 ms 536 KB Output is correct
4 Correct 3 ms 536 KB Output is correct
5 Correct 2 ms 656 KB Output is correct
6 Correct 3 ms 656 KB Output is correct
7 Correct 2 ms 656 KB Output is correct
8 Correct 2 ms 656 KB Output is correct
9 Correct 3 ms 656 KB Output is correct
10 Correct 2 ms 656 KB Output is correct
11 Correct 2 ms 656 KB Output is correct
12 Correct 3 ms 656 KB Output is correct
13 Correct 2 ms 656 KB Output is correct
14 Correct 2 ms 656 KB Output is correct
15 Correct 2 ms 656 KB Output is correct
16 Correct 3 ms 656 KB Output is correct
17 Correct 4 ms 876 KB Output is correct
18 Correct 13 ms 1260 KB Output is correct
19 Correct 8 ms 1260 KB Output is correct
20 Correct 4 ms 1260 KB Output is correct
21 Correct 19 ms 1388 KB Output is correct
22 Correct 44 ms 1828 KB Output is correct
23 Correct 7 ms 1828 KB Output is correct
24 Correct 59 ms 1828 KB Output is correct
25 Correct 47 ms 1828 KB Output is correct
26 Correct 78 ms 1828 KB Output is correct
27 Correct 78 ms 1828 KB Output is correct
28 Correct 54 ms 1828 KB Output is correct
29 Correct 77 ms 1828 KB Output is correct
30 Correct 80 ms 1828 KB Output is correct
31 Correct 84 ms 1828 KB Output is correct
32 Correct 79 ms 1828 KB Output is correct
33 Correct 248 ms 12908 KB Output is correct
34 Correct 796 ms 13676 KB Output is correct
35 Correct 318 ms 13676 KB Output is correct
36 Correct 810 ms 14188 KB Output is correct
37 Correct 740 ms 14188 KB Output is correct
38 Correct 873 ms 14188 KB Output is correct
39 Correct 701 ms 14188 KB Output is correct
40 Correct 914 ms 14332 KB Output is correct
41 Correct 687 ms 14332 KB Output is correct
42 Correct 379 ms 14332 KB Output is correct
43 Correct 884 ms 14332 KB Output is correct
44 Correct 432 ms 14332 KB Output is correct
45 Correct 81 ms 14332 KB Output is correct
46 Correct 290 ms 14332 KB Output is correct
47 Correct 294 ms 14332 KB Output is correct
48 Correct 294 ms 14332 KB Output is correct
49 Correct 316 ms 14332 KB Output is correct
50 Correct 27 ms 14332 KB Output is correct
51 Correct 12 ms 14332 KB Output is correct
52 Correct 302 ms 14332 KB Output is correct
53 Correct 109 ms 14332 KB Output is correct
54 Correct 368 ms 14332 KB Output is correct
55 Correct 360 ms 14332 KB Output is correct
56 Correct 357 ms 14332 KB Output is correct
57 Correct 25 ms 14332 KB Output is correct
58 Correct 94 ms 14332 KB Output is correct
59 Correct 28 ms 14332 KB Output is correct
60 Correct 303 ms 14332 KB Output is correct
61 Correct 298 ms 14332 KB Output is correct
62 Correct 108 ms 14332 KB Output is correct
63 Correct 348 ms 14332 KB Output is correct
64 Correct 290 ms 14332 KB Output is correct
65 Execution timed out 2043 ms 14332 KB Time limit exceeded
66 Halted 0 ms 0 KB -