Submission #55267

# Submission time Handle Problem Language Result Execution time Memory
55267 2018-07-06T19:31:41 Z ksun48 Cultivation (JOI17_cultivation) C++14
30 / 100
66 ms 1036 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;;

LL r, c, n;
vector<pair<LL,LL> > seeds;
const LL INF = 3100100100;
LL best = INF;
void tryx(LL x){
	vector<LL> stuff[r + x];
	for(pair<LL,LL> z : seeds){
		for(LL j = 0; j <= x; j++){
			stuff[j + z.first].push_back(z.second);
		}
	}
	vector<LL> up(r+x, 0);
	vector<LL> down(r+x, 0);
	vector<LL> tot(r+x, 0);
	for(LL j = 0; j < r+x; j++){
		vector<LL> grass = stuff[j];
		sort(grass.begin(), grass.end());
		if(grass.size() == 0){
			up[j] = down[j] = tot[j] = INF;
		} else {
			up[j] = grass[0] - 0;
			down[j] = c-1 - grass[grass.size()-1];
			for(LL i = 0; i + 1 < grass.size(); i++){
				tot[j] = max(tot[j], grass[i+1] - grass[i] - 1);
			}
		}
	}
	for(LL j = 0; j <= x; j++){
		LL maxup = 0;
		LL maxdown = 0;
		LL maxtot = 0;
		for(LL i = j; i < j + r; i++){
			maxup = max(maxup, up[i]);
			maxdown = max(maxdown, down[i]);
			maxtot = max(maxtot, tot[i]);
		}
		best = min(best, max(maxup + maxdown, maxtot) + x);
	}
}
int main(){
	cin >> r >> c >> n;
	for(LL i = 0; i < n; i++){
		LL s, e;
		cin >> s >> e;
		s--; e--;
		seeds.push_back({s,e});
	}
	for(LL j = 0; j <= 2*r; j++){
		tryx(j);
	}
	cout << best << '\n';
}

Compilation message

cultivation.cpp: In function 'void tryx(LL)':
cultivation.cpp:27:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(LL i = 0; i + 1 < grass.size(); i++){
                  ~~~~~~^~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 484 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 644 KB Output is correct
9 Correct 3 ms 644 KB Output is correct
10 Correct 2 ms 644 KB Output is correct
11 Correct 3 ms 644 KB Output is correct
12 Correct 2 ms 644 KB Output is correct
13 Correct 2 ms 644 KB Output is correct
14 Correct 2 ms 644 KB Output is correct
15 Correct 2 ms 644 KB Output is correct
16 Correct 2 ms 644 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 484 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 644 KB Output is correct
9 Correct 3 ms 644 KB Output is correct
10 Correct 2 ms 644 KB Output is correct
11 Correct 3 ms 644 KB Output is correct
12 Correct 2 ms 644 KB Output is correct
13 Correct 2 ms 644 KB Output is correct
14 Correct 2 ms 644 KB Output is correct
15 Correct 2 ms 644 KB Output is correct
16 Correct 2 ms 644 KB Output is correct
17 Correct 2 ms 644 KB Output is correct
18 Correct 5 ms 644 KB Output is correct
19 Correct 4 ms 644 KB Output is correct
20 Correct 2 ms 644 KB Output is correct
21 Correct 9 ms 644 KB Output is correct
22 Correct 20 ms 644 KB Output is correct
23 Correct 8 ms 644 KB Output is correct
24 Correct 29 ms 804 KB Output is correct
25 Correct 24 ms 804 KB Output is correct
26 Correct 47 ms 948 KB Output is correct
27 Correct 43 ms 948 KB Output is correct
28 Correct 29 ms 948 KB Output is correct
29 Correct 46 ms 960 KB Output is correct
30 Correct 43 ms 960 KB Output is correct
31 Correct 44 ms 960 KB Output is correct
32 Correct 52 ms 996 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 484 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 644 KB Output is correct
9 Correct 3 ms 644 KB Output is correct
10 Correct 2 ms 644 KB Output is correct
11 Correct 3 ms 644 KB Output is correct
12 Correct 2 ms 644 KB Output is correct
13 Correct 2 ms 644 KB Output is correct
14 Correct 2 ms 644 KB Output is correct
15 Correct 2 ms 644 KB Output is correct
16 Correct 2 ms 644 KB Output is correct
17 Correct 2 ms 644 KB Output is correct
18 Correct 5 ms 644 KB Output is correct
19 Correct 4 ms 644 KB Output is correct
20 Correct 2 ms 644 KB Output is correct
21 Correct 9 ms 644 KB Output is correct
22 Correct 20 ms 644 KB Output is correct
23 Correct 8 ms 644 KB Output is correct
24 Correct 29 ms 804 KB Output is correct
25 Correct 24 ms 804 KB Output is correct
26 Correct 47 ms 948 KB Output is correct
27 Correct 43 ms 948 KB Output is correct
28 Correct 29 ms 948 KB Output is correct
29 Correct 46 ms 960 KB Output is correct
30 Correct 43 ms 960 KB Output is correct
31 Correct 44 ms 960 KB Output is correct
32 Correct 52 ms 996 KB Output is correct
33 Correct 2 ms 996 KB Output is correct
34 Correct 53 ms 996 KB Output is correct
35 Correct 45 ms 996 KB Output is correct
36 Correct 45 ms 996 KB Output is correct
37 Correct 35 ms 996 KB Output is correct
38 Correct 45 ms 996 KB Output is correct
39 Correct 44 ms 996 KB Output is correct
40 Correct 66 ms 1036 KB Output is correct
41 Correct 47 ms 1036 KB Output is correct
42 Correct 46 ms 1036 KB Output is correct
43 Correct 49 ms 1036 KB Output is correct
44 Correct 52 ms 1036 KB Output is correct
# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 1036 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 1036 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 484 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 644 KB Output is correct
9 Correct 3 ms 644 KB Output is correct
10 Correct 2 ms 644 KB Output is correct
11 Correct 3 ms 644 KB Output is correct
12 Correct 2 ms 644 KB Output is correct
13 Correct 2 ms 644 KB Output is correct
14 Correct 2 ms 644 KB Output is correct
15 Correct 2 ms 644 KB Output is correct
16 Correct 2 ms 644 KB Output is correct
17 Correct 2 ms 644 KB Output is correct
18 Correct 5 ms 644 KB Output is correct
19 Correct 4 ms 644 KB Output is correct
20 Correct 2 ms 644 KB Output is correct
21 Correct 9 ms 644 KB Output is correct
22 Correct 20 ms 644 KB Output is correct
23 Correct 8 ms 644 KB Output is correct
24 Correct 29 ms 804 KB Output is correct
25 Correct 24 ms 804 KB Output is correct
26 Correct 47 ms 948 KB Output is correct
27 Correct 43 ms 948 KB Output is correct
28 Correct 29 ms 948 KB Output is correct
29 Correct 46 ms 960 KB Output is correct
30 Correct 43 ms 960 KB Output is correct
31 Correct 44 ms 960 KB Output is correct
32 Correct 52 ms 996 KB Output is correct
33 Correct 2 ms 996 KB Output is correct
34 Correct 53 ms 996 KB Output is correct
35 Correct 45 ms 996 KB Output is correct
36 Correct 45 ms 996 KB Output is correct
37 Correct 35 ms 996 KB Output is correct
38 Correct 45 ms 996 KB Output is correct
39 Correct 44 ms 996 KB Output is correct
40 Correct 66 ms 1036 KB Output is correct
41 Correct 47 ms 1036 KB Output is correct
42 Correct 46 ms 1036 KB Output is correct
43 Correct 49 ms 1036 KB Output is correct
44 Correct 52 ms 1036 KB Output is correct
45 Runtime error 3 ms 1036 KB Execution killed with signal 11 (could be triggered by violating memory limits)
46 Halted 0 ms 0 KB -