Submission #59924

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
59924	2018-07-23T10:14:22 Z	ainta(#1720)	Cultivation (JOI17_cultivation)	C++11	30 / 100	825 ms	11700 KB

cultivation

#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() {
	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 = 3e9;
	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:60: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:62: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	504 KB	Output is correct
2	Correct	3 ms	504 KB	Output is correct
3	Correct	2 ms	504 KB	Output is correct
4	Correct	3 ms	504 KB	Output is correct
5	Correct	3 ms	524 KB	Output is correct
6	Correct	3 ms	676 KB	Output is correct
7	Correct	3 ms	676 KB	Output is correct
8	Correct	2 ms	676 KB	Output is correct
9	Correct	2 ms	676 KB	Output is correct
10	Correct	3 ms	676 KB	Output is correct
11	Correct	3 ms	676 KB	Output is correct
12	Correct	3 ms	676 KB	Output is correct
13	Correct	3 ms	676 KB	Output is correct
14	Correct	3 ms	676 KB	Output is correct
15	Correct	3 ms	676 KB	Output is correct
16	Correct	3 ms	676 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	3 ms	504 KB	Output is correct
3	Correct	2 ms	504 KB	Output is correct
4	Correct	3 ms	504 KB	Output is correct
5	Correct	3 ms	524 KB	Output is correct
6	Correct	3 ms	676 KB	Output is correct
7	Correct	3 ms	676 KB	Output is correct
8	Correct	2 ms	676 KB	Output is correct
9	Correct	2 ms	676 KB	Output is correct
10	Correct	3 ms	676 KB	Output is correct
11	Correct	3 ms	676 KB	Output is correct
12	Correct	3 ms	676 KB	Output is correct
13	Correct	3 ms	676 KB	Output is correct
14	Correct	3 ms	676 KB	Output is correct
15	Correct	3 ms	676 KB	Output is correct
16	Correct	3 ms	676 KB	Output is correct
17	Correct	4 ms	852 KB	Output is correct
18	Correct	11 ms	1236 KB	Output is correct
19	Correct	8 ms	1236 KB	Output is correct
20	Correct	4 ms	1236 KB	Output is correct
21	Correct	14 ms	1380 KB	Output is correct
22	Correct	36 ms	1652 KB	Output is correct
23	Correct	5 ms	1652 KB	Output is correct
24	Correct	61 ms	1652 KB	Output is correct
25	Correct	36 ms	1652 KB	Output is correct
26	Correct	72 ms	1652 KB	Output is correct
27	Correct	79 ms	1652 KB	Output is correct
28	Correct	51 ms	1764 KB	Output is correct
29	Correct	72 ms	1764 KB	Output is correct
30	Correct	80 ms	1764 KB	Output is correct
31	Correct	74 ms	1764 KB	Output is correct
32	Correct	82 ms	1764 KB	Output is correct

Subtask #3
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	3 ms	504 KB	Output is correct
3	Correct	2 ms	504 KB	Output is correct
4	Correct	3 ms	504 KB	Output is correct
5	Correct	3 ms	524 KB	Output is correct
6	Correct	3 ms	676 KB	Output is correct
7	Correct	3 ms	676 KB	Output is correct
8	Correct	2 ms	676 KB	Output is correct
9	Correct	2 ms	676 KB	Output is correct
10	Correct	3 ms	676 KB	Output is correct
11	Correct	3 ms	676 KB	Output is correct
12	Correct	3 ms	676 KB	Output is correct
13	Correct	3 ms	676 KB	Output is correct
14	Correct	3 ms	676 KB	Output is correct
15	Correct	3 ms	676 KB	Output is correct
16	Correct	3 ms	676 KB	Output is correct
17	Correct	4 ms	852 KB	Output is correct
18	Correct	11 ms	1236 KB	Output is correct
19	Correct	8 ms	1236 KB	Output is correct
20	Correct	4 ms	1236 KB	Output is correct
21	Correct	14 ms	1380 KB	Output is correct
22	Correct	36 ms	1652 KB	Output is correct
23	Correct	5 ms	1652 KB	Output is correct
24	Correct	61 ms	1652 KB	Output is correct
25	Correct	36 ms	1652 KB	Output is correct
26	Correct	72 ms	1652 KB	Output is correct
27	Correct	79 ms	1652 KB	Output is correct
28	Correct	51 ms	1764 KB	Output is correct
29	Correct	72 ms	1764 KB	Output is correct
30	Correct	80 ms	1764 KB	Output is correct
31	Correct	74 ms	1764 KB	Output is correct
32	Correct	82 ms	1764 KB	Output is correct
33	Correct	230 ms	10448 KB	Output is correct
34	Correct	749 ms	11408 KB	Output is correct
35	Correct	316 ms	11408 KB	Output is correct
36	Correct	764 ms	11628 KB	Output is correct
37	Correct	648 ms	11628 KB	Output is correct
38	Correct	800 ms	11640 KB	Output is correct
39	Correct	744 ms	11640 KB	Output is correct
40	Correct	816 ms	11700 KB	Output is correct
41	Correct	545 ms	11700 KB	Output is correct
42	Correct	319 ms	11700 KB	Output is correct
43	Correct	825 ms	11700 KB	Output is correct
44	Correct	399 ms	11700 KB	Output is correct

Subtask #4
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	42 ms	11700 KB	Output is correct
2	Correct	187 ms	11700 KB	Output is correct
3	Correct	214 ms	11700 KB	Output is correct
4	Incorrect	225 ms	11700 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	42 ms	11700 KB	Output is correct
2	Correct	187 ms	11700 KB	Output is correct
3	Correct	214 ms	11700 KB	Output is correct
4	Incorrect	225 ms	11700 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	3 ms	504 KB	Output is correct
3	Correct	2 ms	504 KB	Output is correct
4	Correct	3 ms	504 KB	Output is correct
5	Correct	3 ms	524 KB	Output is correct
6	Correct	3 ms	676 KB	Output is correct
7	Correct	3 ms	676 KB	Output is correct
8	Correct	2 ms	676 KB	Output is correct
9	Correct	2 ms	676 KB	Output is correct
10	Correct	3 ms	676 KB	Output is correct
11	Correct	3 ms	676 KB	Output is correct
12	Correct	3 ms	676 KB	Output is correct
13	Correct	3 ms	676 KB	Output is correct
14	Correct	3 ms	676 KB	Output is correct
15	Correct	3 ms	676 KB	Output is correct
16	Correct	3 ms	676 KB	Output is correct
17	Correct	4 ms	852 KB	Output is correct
18	Correct	11 ms	1236 KB	Output is correct
19	Correct	8 ms	1236 KB	Output is correct
20	Correct	4 ms	1236 KB	Output is correct
21	Correct	14 ms	1380 KB	Output is correct
22	Correct	36 ms	1652 KB	Output is correct
23	Correct	5 ms	1652 KB	Output is correct
24	Correct	61 ms	1652 KB	Output is correct
25	Correct	36 ms	1652 KB	Output is correct
26	Correct	72 ms	1652 KB	Output is correct
27	Correct	79 ms	1652 KB	Output is correct
28	Correct	51 ms	1764 KB	Output is correct
29	Correct	72 ms	1764 KB	Output is correct
30	Correct	80 ms	1764 KB	Output is correct
31	Correct	74 ms	1764 KB	Output is correct
32	Correct	82 ms	1764 KB	Output is correct
33	Correct	230 ms	10448 KB	Output is correct
34	Correct	749 ms	11408 KB	Output is correct
35	Correct	316 ms	11408 KB	Output is correct
36	Correct	764 ms	11628 KB	Output is correct
37	Correct	648 ms	11628 KB	Output is correct
38	Correct	800 ms	11640 KB	Output is correct
39	Correct	744 ms	11640 KB	Output is correct
40	Correct	816 ms	11700 KB	Output is correct
41	Correct	545 ms	11700 KB	Output is correct
42	Correct	319 ms	11700 KB	Output is correct
43	Correct	825 ms	11700 KB	Output is correct
44	Correct	399 ms	11700 KB	Output is correct
45	Correct	42 ms	11700 KB	Output is correct
46	Correct	187 ms	11700 KB	Output is correct
47	Correct	214 ms	11700 KB	Output is correct
48	Incorrect	225 ms	11700 KB	Output isn't correct
49	Halted	0 ms	0 KB	-

Submission #59924

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 15.0 / 15.0

Subtask #4 0 / 30.0

Subtask #5 0 / 20.0

Subtask #6 0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
15.0 / 15.0

Subtask #4
0 / 30.0

Subtask #5
0 / 20.0

Subtask #6
0 / 20.0