oj.uz

Submission #1071181

# Submission time Handle Problem Language Result Execution time Memory
1071181 2024-08-23T05:39:10 Z sleepntsheep Cultivation (JOI17_cultivation) C++17
5 / 100
 281 ms 424 KB 
#pragma GCC optimize("O3,unroll-loops")
#include<cstring>
#include <cstdio>

#include <algorithm>
using namespace std;

int C,z=1e9,R, n, x[300], y[300], c[41][41];

int Check(int l, int u, int r, int d) {
	memset(c,0,sizeof c);
	for (int i = 0; i < n; ++i) {
		++c[max(0, x[i]-u)][max(0, y[i]-l)];
		--c[max(0, x[i]-u)][min(40,y[i]+r+1)];
		--c[min(40,x[i]+d+1)][max(0, y[i]-l)];
		++c[min(40,x[i]+d+1)][min(40,y[i]+r+1)];
	}
	for(int i=1;i<R;++i)c[i][0]+=c[i-1][0];
	for(int j=1;j<C;++j)c[0][j]+=c[0][j-1];
	for(int i=1;i<R;++i)for(int j=1;j<C;++j)c[i][j]+=c[i-1][j]+c[i][j-1]-c[i-1][j-1];
	for(int i=0;i<R;++i)for(int j=0;j<C;++j)if(!c[i][j])return 0;
	return 1;
}

int main() {
	scanf("%d%d%d", &R, &C, &n);
	for (int i = 0; i < n; ++i) scanf("%d%d", x + i, y + i), --x[i], --y[i];

	for(int l=0;l<=40;++l)for(int r=0;r<=40-l;++r){
		for(int u=0;u<=40;++u){
			int lb=-1,ub=41;
			while(ub-lb>1){
				int md=lb+(ub-lb)/2;
				if(Check(l,u,r,md))ub=md,z=min(z,l+u+r+md);
				else lb=md;
			}
		}
	}
	printf("%d",z);
}

Compilation message

cultivation.cpp: In function 'int main()':
cultivation.cpp:26:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |  scanf("%d%d%d", &R, &C, &n);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
cultivation.cpp:27:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |  for (int i = 0; i < n; ++i) scanf("%d%d", x + i, y + i), --x[i], --y[i];
      |                              ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 344 KB Output is correct
2 Correct 19 ms 348 KB Output is correct
3 Correct 21 ms 420 KB Output is correct
4 Correct 19 ms 420 KB Output is correct
5 Correct 29 ms 348 KB Output is correct
6 Correct 22 ms 348 KB Output is correct
7 Correct 23 ms 344 KB Output is correct
8 Correct 30 ms 348 KB Output is correct
9 Correct 27 ms 424 KB Output is correct
10 Correct 23 ms 348 KB Output is correct
11 Correct 20 ms 416 KB Output is correct
12 Correct 22 ms 348 KB Output is correct
13 Correct 22 ms 344 KB Output is correct
14 Correct 21 ms 348 KB Output is correct
15 Correct 22 ms 344 KB Output is correct
16 Correct 23 ms 348 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 344 KB Output is correct
2 Correct 19 ms 348 KB Output is correct
3 Correct 21 ms 420 KB Output is correct
4 Correct 19 ms 420 KB Output is correct
5 Correct 29 ms 348 KB Output is correct
6 Correct 22 ms 348 KB Output is correct
7 Correct 23 ms 344 KB Output is correct
8 Correct 30 ms 348 KB Output is correct
9 Correct 27 ms 424 KB Output is correct
10 Correct 23 ms 348 KB Output is correct
11 Correct 20 ms 416 KB Output is correct
12 Correct 22 ms 348 KB Output is correct
13 Correct 22 ms 344 KB Output is correct
14 Correct 21 ms 348 KB Output is correct
15 Correct 22 ms 344 KB Output is correct
16 Correct 23 ms 348 KB Output is correct
17 Correct 70 ms 348 KB Output is correct
18 Correct 166 ms 344 KB Output is correct
19 Correct 281 ms 348 KB Output is correct
20 Correct 95 ms 348 KB Output is correct
21 Incorrect 238 ms 344 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 344 KB Output is correct
2 Correct 19 ms 348 KB Output is correct
3 Correct 21 ms 420 KB Output is correct
4 Correct 19 ms 420 KB Output is correct
5 Correct 29 ms 348 KB Output is correct
6 Correct 22 ms 348 KB Output is correct
7 Correct 23 ms 344 KB Output is correct
8 Correct 30 ms 348 KB Output is correct
9 Correct 27 ms 424 KB Output is correct
10 Correct 23 ms 348 KB Output is correct
11 Correct 20 ms 416 KB Output is correct
12 Correct 22 ms 348 KB Output is correct
13 Correct 22 ms 344 KB Output is correct
14 Correct 21 ms 348 KB Output is correct
15 Correct 22 ms 344 KB Output is correct
16 Correct 23 ms 348 KB Output is correct
17 Correct 70 ms 348 KB Output is correct
18 Correct 166 ms 344 KB Output is correct
19 Correct 281 ms 348 KB Output is correct
20 Correct 95 ms 348 KB Output is correct
21 Incorrect 238 ms 344 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 344 KB Output is correct
2 Correct 19 ms 348 KB Output is correct
3 Correct 21 ms 420 KB Output is correct
4 Correct 19 ms 420 KB Output is correct
5 Correct 29 ms 348 KB Output is correct
6 Correct 22 ms 348 KB Output is correct
7 Correct 23 ms 344 KB Output is correct
8 Correct 30 ms 348 KB Output is correct
9 Correct 27 ms 424 KB Output is correct
10 Correct 23 ms 348 KB Output is correct
11 Correct 20 ms 416 KB Output is correct
12 Correct 22 ms 348 KB Output is correct
13 Correct 22 ms 344 KB Output is correct
14 Correct 21 ms 348 KB Output is correct
15 Correct 22 ms 344 KB Output is correct
16 Correct 23 ms 348 KB Output is correct
17 Correct 70 ms 348 KB Output is correct
18 Correct 166 ms 344 KB Output is correct
19 Correct 281 ms 348 KB Output is correct
20 Correct 95 ms 348 KB Output is correct
21 Incorrect 238 ms 344 KB Output isn't correct
22 Halted 0 ms 0 KB -