답안 #59917 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
59917	2018-07-23T10:09:26 Z	ainta(#1720)	Cultivation (JOI17_cultivation)	C++11	15 / 100	277 ms	20448 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[100000];
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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	440 KB	Output is correct
3	Correct	2 ms	524 KB	Output is correct
4	Correct	3 ms	524 KB	Output is correct
5	Correct	2 ms	528 KB	Output is correct
6	Correct	3 ms	564 KB	Output is correct
7	Correct	3 ms	564 KB	Output is correct
8	Correct	3 ms	564 KB	Output is correct
9	Correct	2 ms	584 KB	Output is correct
10	Correct	2 ms	584 KB	Output is correct
11	Correct	3 ms	584 KB	Output is correct
12	Correct	3 ms	584 KB	Output is correct
13	Correct	3 ms	584 KB	Output is correct
14	Correct	3 ms	584 KB	Output is correct
15	Correct	2 ms	584 KB	Output is correct
16	Correct	3 ms	584 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	440 KB	Output is correct
3	Correct	2 ms	524 KB	Output is correct
4	Correct	3 ms	524 KB	Output is correct
5	Correct	2 ms	528 KB	Output is correct
6	Correct	3 ms	564 KB	Output is correct
7	Correct	3 ms	564 KB	Output is correct
8	Correct	3 ms	564 KB	Output is correct
9	Correct	2 ms	584 KB	Output is correct
10	Correct	2 ms	584 KB	Output is correct
11	Correct	3 ms	584 KB	Output is correct
12	Correct	3 ms	584 KB	Output is correct
13	Correct	3 ms	584 KB	Output is correct
14	Correct	3 ms	584 KB	Output is correct
15	Correct	2 ms	584 KB	Output is correct
16	Correct	3 ms	584 KB	Output is correct
17	Correct	3 ms	932 KB	Output is correct
18	Correct	13 ms	1108 KB	Output is correct
19	Correct	10 ms	1108 KB	Output is correct
20	Correct	3 ms	1108 KB	Output is correct
21	Correct	15 ms	1364 KB	Output is correct
22	Correct	33 ms	1620 KB	Output is correct
23	Correct	5 ms	1620 KB	Output is correct
24	Correct	50 ms	1828 KB	Output is correct
25	Correct	39 ms	1828 KB	Output is correct
26	Correct	71 ms	1828 KB	Output is correct
27	Correct	71 ms	1844 KB	Output is correct
28	Correct	52 ms	1844 KB	Output is correct
29	Correct	69 ms	1844 KB	Output is correct
30	Correct	77 ms	1844 KB	Output is correct
31	Correct	79 ms	1844 KB	Output is correct
32	Correct	71 ms	1844 KB	Output is correct

Subtask #3
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	440 KB	Output is correct
3	Correct	2 ms	524 KB	Output is correct
4	Correct	3 ms	524 KB	Output is correct
5	Correct	2 ms	528 KB	Output is correct
6	Correct	3 ms	564 KB	Output is correct
7	Correct	3 ms	564 KB	Output is correct
8	Correct	3 ms	564 KB	Output is correct
9	Correct	2 ms	584 KB	Output is correct
10	Correct	2 ms	584 KB	Output is correct
11	Correct	3 ms	584 KB	Output is correct
12	Correct	3 ms	584 KB	Output is correct
13	Correct	3 ms	584 KB	Output is correct
14	Correct	3 ms	584 KB	Output is correct
15	Correct	2 ms	584 KB	Output is correct
16	Correct	3 ms	584 KB	Output is correct
17	Correct	3 ms	932 KB	Output is correct
18	Correct	13 ms	1108 KB	Output is correct
19	Correct	10 ms	1108 KB	Output is correct
20	Correct	3 ms	1108 KB	Output is correct
21	Correct	15 ms	1364 KB	Output is correct
22	Correct	33 ms	1620 KB	Output is correct
23	Correct	5 ms	1620 KB	Output is correct
24	Correct	50 ms	1828 KB	Output is correct
25	Correct	39 ms	1828 KB	Output is correct
26	Correct	71 ms	1828 KB	Output is correct
27	Correct	71 ms	1844 KB	Output is correct
28	Correct	52 ms	1844 KB	Output is correct
29	Correct	69 ms	1844 KB	Output is correct
30	Correct	77 ms	1844 KB	Output is correct
31	Correct	79 ms	1844 KB	Output is correct
32	Correct	71 ms	1844 KB	Output is correct
33	Runtime error	207 ms	20448 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
34	Halted	0 ms	0 KB	-

Subtask #4
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	70 ms	20448 KB	Output is correct
2	Correct	245 ms	20448 KB	Output is correct
3	Correct	266 ms	20448 KB	Output is correct
4	Incorrect	277 ms	20448 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	70 ms	20448 KB	Output is correct
2	Correct	245 ms	20448 KB	Output is correct
3	Correct	266 ms	20448 KB	Output is correct
4	Incorrect	277 ms	20448 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	440 KB	Output is correct
3	Correct	2 ms	524 KB	Output is correct
4	Correct	3 ms	524 KB	Output is correct
5	Correct	2 ms	528 KB	Output is correct
6	Correct	3 ms	564 KB	Output is correct
7	Correct	3 ms	564 KB	Output is correct
8	Correct	3 ms	564 KB	Output is correct
9	Correct	2 ms	584 KB	Output is correct
10	Correct	2 ms	584 KB	Output is correct
11	Correct	3 ms	584 KB	Output is correct
12	Correct	3 ms	584 KB	Output is correct
13	Correct	3 ms	584 KB	Output is correct
14	Correct	3 ms	584 KB	Output is correct
15	Correct	2 ms	584 KB	Output is correct
16	Correct	3 ms	584 KB	Output is correct
17	Correct	3 ms	932 KB	Output is correct
18	Correct	13 ms	1108 KB	Output is correct
19	Correct	10 ms	1108 KB	Output is correct
20	Correct	3 ms	1108 KB	Output is correct
21	Correct	15 ms	1364 KB	Output is correct
22	Correct	33 ms	1620 KB	Output is correct
23	Correct	5 ms	1620 KB	Output is correct
24	Correct	50 ms	1828 KB	Output is correct
25	Correct	39 ms	1828 KB	Output is correct
26	Correct	71 ms	1828 KB	Output is correct
27	Correct	71 ms	1844 KB	Output is correct
28	Correct	52 ms	1844 KB	Output is correct
29	Correct	69 ms	1844 KB	Output is correct
30	Correct	77 ms	1844 KB	Output is correct
31	Correct	79 ms	1844 KB	Output is correct
32	Correct	71 ms	1844 KB	Output is correct
33	Runtime error	207 ms	20448 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
34	Halted	0 ms	0 KB	-

답안 #59917

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 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
0 / 15.0

Subtask #4
0 / 30.0

Subtask #5
0 / 20.0

Subtask #6
0 / 20.0