Submission #259793

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
259793	2020-08-08T14:53:47 Z	minhcool	Cultivation (JOI17_cultivation)	C++17	15 / 100	1492 ms	512 KB

cultivation

#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
#define ins insert
#define er erase
 
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
int n, r, c, s[305], e[305], pref[45][45], ans = 10005;
 
bool ck(int up, int left, int down, int right){
	for(int i = 1; i <= r; ++i){
		for(int j = 1; j <= c; ++j) pref[i][j] = 0;
	}
	for(int i = 1; i <= n; ++i){
		pref[max(1, s[i] - up)][max(1, e[i] - left)]++;
		pref[min(r, s[i] + down) + 1][max(1, e[i] - left)]--;
		pref[max(1, s[i] - up)][min(c, e[i] + right) + 1]--;
		pref[min(r, s[i] + down) + 1][min(c, e[i] + right) + 1]++;
		//cout << max(1, s[i] - up) << " " << max(1, e[i] - left) << " " << min(r + 1, s[i] + down + 1) << " " << min(c + 1, e[i] + right) << "\n";
	}
	for(int i = 1; i <= r; ++i){
		for(int j = 1; j <= c; ++j) pref[i][j] += pref[i][j - 1];
	}
	for(int i = 1; i <= r; ++i){
		for(int j = 1; j <= c; ++j){
			pref[i][j] += pref[i - 1][j];
			if(!pref[i][j]) return 0;
		}
	}
	return 1;
}
 
void mini(int &a, int b){
	a = ((a < b) ? a : b);
}
 
signed main(){
	//freopen("cultivation.inp", "r", stdin);
	//freopen("cultivation.out", "w", stdout);
	ios_base::sync_with_stdio(0);
	cin >> r >> c >> n;
	for(int i = 1; i <= n; i++) cin >> s[i] >> e[i];
	//cout << ck(0, 1, 2, 2) << "\n";
	for(int i = 0; i < r; i++){
		for(int j = 0; j < c; j++){
			int itr = c - 1, temp = i + j - 1;
			for(int k = 0; k <= r - 1; k++){
				while(itr >= 0 && ck(i, j, k, itr)) --itr;
				++itr;
				++temp;
				//cout << i << " " << j << " " << k << " " << itr << " " << temp + itr << "\n";
				if(ck(i, j, k, itr)) mini(ans, temp + itr);
			}
		}
	}
	cout << ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	11 ms	384 KB	Output is correct
18	Correct	119 ms	384 KB	Output is correct
19	Correct	553 ms	384 KB	Output is correct
20	Correct	24 ms	384 KB	Output is correct
21	Correct	500 ms	504 KB	Output is correct
22	Correct	1047 ms	388 KB	Output is correct
23	Correct	924 ms	504 KB	Output is correct
24	Correct	1153 ms	504 KB	Output is correct
25	Correct	1202 ms	504 KB	Output is correct
26	Correct	1492 ms	388 KB	Output is correct
27	Correct	1364 ms	388 KB	Output is correct
28	Correct	1128 ms	388 KB	Output is correct
29	Correct	1052 ms	396 KB	Output is correct
30	Correct	1322 ms	504 KB	Output is correct
31	Correct	1311 ms	396 KB	Output is correct
32	Correct	1327 ms	504 KB	Output is correct

Subtask #3
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	11 ms	384 KB	Output is correct
18	Correct	119 ms	384 KB	Output is correct
19	Correct	553 ms	384 KB	Output is correct
20	Correct	24 ms	384 KB	Output is correct
21	Correct	500 ms	504 KB	Output is correct
22	Correct	1047 ms	388 KB	Output is correct
23	Correct	924 ms	504 KB	Output is correct
24	Correct	1153 ms	504 KB	Output is correct
25	Correct	1202 ms	504 KB	Output is correct
26	Correct	1492 ms	388 KB	Output is correct
27	Correct	1364 ms	388 KB	Output is correct
28	Correct	1128 ms	388 KB	Output is correct
29	Correct	1052 ms	396 KB	Output is correct
30	Correct	1322 ms	504 KB	Output is correct
31	Correct	1311 ms	396 KB	Output is correct
32	Correct	1327 ms	504 KB	Output is correct
33	Runtime error	1 ms	512 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
34	Halted	0 ms	0 KB	-

Subtask #4
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	512 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	512 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	11 ms	384 KB	Output is correct
18	Correct	119 ms	384 KB	Output is correct
19	Correct	553 ms	384 KB	Output is correct
20	Correct	24 ms	384 KB	Output is correct
21	Correct	500 ms	504 KB	Output is correct
22	Correct	1047 ms	388 KB	Output is correct
23	Correct	924 ms	504 KB	Output is correct
24	Correct	1153 ms	504 KB	Output is correct
25	Correct	1202 ms	504 KB	Output is correct
26	Correct	1492 ms	388 KB	Output is correct
27	Correct	1364 ms	388 KB	Output is correct
28	Correct	1128 ms	388 KB	Output is correct
29	Correct	1052 ms	396 KB	Output is correct
30	Correct	1322 ms	504 KB	Output is correct
31	Correct	1311 ms	396 KB	Output is correct
32	Correct	1327 ms	504 KB	Output is correct
33	Runtime error	1 ms	512 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
34	Halted	0 ms	0 KB	-

Submission #259793

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