Submission #995340

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
995340	2024-06-08T20:37:42 Z	jcelin	Cultivation (JOI17_cultivation)	C++14	5 / 100	2000 ms	600 KB

cultivation

#include<bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define PB push_back
#define PPB pop_back
#define all(x) (x).begin(), (x).end()

typedef vector<int> vi; 
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;

const int MAXN = 47;
const int logo = 21;
const int off = 1 << logo;
const int trsz = off << 1;
const int mod = 1e9 + 7;
const int inf = mod;

vii inp;
int pf[MAXN][MAXN];
int n, r, c;

bool check(int a, int b, int e, int f){
	for(int i=1; i<=r; i++) for(int j=1; j<=c; j++) pf[i][j] = 0;
	
	for(auto &x : inp){
		int up = max(1, x.X - a);
		int dwn = min(r, x.X + b);
		int le = max(1, x.Y - e);
		int ri = min(c, x.Y + f);
		
		pf[up][le]++;
		if(ri != c) pf[up][ri + 1]--;
		
		if(dwn != r){
			pf[dwn + 1][le]--;
			if(ri != c) pf[dwn + 1][ri + 1]++;
		}
	}
	
	for(int i=1; i<=r; i++){
		for(int j=1; j<=c; j++){
			pf[i][j] += pf[i - 1][j];
		}
	}
	
	
	
	for(int i=1; i<=r; i++){
		for(int j=1; j<=c; j++){
			pf[i][j] += pf[i][j - 1];
			if(pf[i][j] == 0) return 0;
		}
	}
	
	return 1;
}

void solve(){
	cin >> r >> c >> n;
	for(int i=1; i<=n; i++){
		int x, y;
		cin >> x >> y;
		inp.PB({x, y});
	}
	
	int ans = inf;
	for(int i=0; i<=r; i++){
		for(int j=0; j<=r; j++){
			for(int k=0; k<=c; k++){
				for(int l=0; l<=c; l++){
					if(check(i, j, k, l)) ans = min(ans, i + j + k + l);
				}
			}
		}
	}
	cout << ans << "\n";
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int tt = 1;
	//cin >> t;
	while(tt--) solve();
	return 0;
}

Subtask #1

5.0 / 5.0

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

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	456 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	460 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	30 ms	348 KB	Output is correct
18	Correct	759 ms	460 KB	Output is correct
19	Execution timed out	2029 ms	348 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-

Subtask #3

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	456 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	460 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	30 ms	348 KB	Output is correct
18	Correct	759 ms	460 KB	Output is correct
19	Execution timed out	2029 ms	348 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-

Subtask #4

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	600 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	600 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	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	456 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	460 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	30 ms	348 KB	Output is correct
18	Correct	759 ms	460 KB	Output is correct
19	Execution timed out	2029 ms	348 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-