Submission #55260

# Submission time Handle Problem Language Result Execution time Memory
55260 2018-07-06T18:36:45 Z ksun48 Cultivation (JOI17_cultivation) C++14
15 / 100
59 ms 1380 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;;

LL r, c, n;
vector<pair<LL,LL> > seeds;
LL best;
const LL INF = 2100100100;
void tryx(LL x){
	set<LL> stuff[r + x];
	for(pair<LL,LL> z : seeds){
		for(int j = 0; j <= x; j++){
			stuff[j + z.first].insert(z.second);
		}
	}
	vector<LL> up(r+x, 0);
	vector<LL> down(r+x, 0);
	vector<LL> tot(r+x, 0);
	for(int j = 0; j < r+x; j++){
		vector<LL> grass;
		for(LL a : stuff[j]){
			grass.push_back(a);
		}
		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(int i = 0; i + 1 < grass.size(); i++){
				tot[j] = max(tot[j], grass[i+1] - grass[i] - 1);
			}
		}
	}
	for(int j = 0; j + r - 1 < r+x; j++){
		LL maxup = 0;
		LL maxdown = 0;
		LL maxtot = 0;
		for(int 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;
	best = r + c;
	for(int i = 0; i < n; i++){
		LL s, e;
		cin >> s >> e;
		s--; e--;
		seeds.push_back({s,e});
		// [0,r), [0,c)
	}
	for(int j = 0; j <= r; j++){
		tryx(j);
	}
	cout << best << '\n';
}

Compilation message

cultivation.cpp: In function 'void tryx(LL)':
cultivation.cpp:29:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i = 0; i + 1 < grass.size(); i++){
                   ~~~~~~^~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 3 ms 360 KB Output is correct
3 Correct 4 ms 360 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 652 KB Output is correct
10 Correct 2 ms 664 KB Output is correct
11 Correct 3 ms 664 KB Output is correct
12 Correct 3 ms 668 KB Output is correct
13 Correct 2 ms 728 KB Output is correct
14 Correct 3 ms 728 KB Output is correct
15 Correct 3 ms 768 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 3 ms 360 KB Output is correct
3 Correct 4 ms 360 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 652 KB Output is correct
10 Correct 2 ms 664 KB Output is correct
11 Correct 3 ms 664 KB Output is correct
12 Correct 3 ms 668 KB Output is correct
13 Correct 2 ms 728 KB Output is correct
14 Correct 3 ms 728 KB Output is correct
15 Correct 3 ms 768 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
17 Correct 3 ms 792 KB Output is correct
18 Correct 4 ms 796 KB Output is correct
19 Correct 6 ms 804 KB Output is correct
20 Correct 3 ms 812 KB Output is correct
21 Correct 6 ms 940 KB Output is correct
22 Correct 12 ms 940 KB Output is correct
23 Correct 6 ms 940 KB Output is correct
24 Correct 17 ms 940 KB Output is correct
25 Correct 17 ms 940 KB Output is correct
26 Correct 31 ms 940 KB Output is correct
27 Correct 18 ms 968 KB Output is correct
28 Correct 13 ms 968 KB Output is correct
29 Correct 17 ms 968 KB Output is correct
30 Correct 18 ms 980 KB Output is correct
31 Correct 23 ms 984 KB Output is correct
32 Correct 22 ms 988 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 3 ms 360 KB Output is correct
3 Correct 4 ms 360 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 652 KB Output is correct
10 Correct 2 ms 664 KB Output is correct
11 Correct 3 ms 664 KB Output is correct
12 Correct 3 ms 668 KB Output is correct
13 Correct 2 ms 728 KB Output is correct
14 Correct 3 ms 728 KB Output is correct
15 Correct 3 ms 768 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
17 Correct 3 ms 792 KB Output is correct
18 Correct 4 ms 796 KB Output is correct
19 Correct 6 ms 804 KB Output is correct
20 Correct 3 ms 812 KB Output is correct
21 Correct 6 ms 940 KB Output is correct
22 Correct 12 ms 940 KB Output is correct
23 Correct 6 ms 940 KB Output is correct
24 Correct 17 ms 940 KB Output is correct
25 Correct 17 ms 940 KB Output is correct
26 Correct 31 ms 940 KB Output is correct
27 Correct 18 ms 968 KB Output is correct
28 Correct 13 ms 968 KB Output is correct
29 Correct 17 ms 968 KB Output is correct
30 Correct 18 ms 980 KB Output is correct
31 Correct 23 ms 984 KB Output is correct
32 Correct 22 ms 988 KB Output is correct
33 Correct 3 ms 988 KB Output is correct
34 Incorrect 59 ms 1380 KB Output isn't correct
35 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 1380 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 2 ms 1380 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 248 KB Output is correct
2 Correct 3 ms 360 KB Output is correct
3 Correct 4 ms 360 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 652 KB Output is correct
10 Correct 2 ms 664 KB Output is correct
11 Correct 3 ms 664 KB Output is correct
12 Correct 3 ms 668 KB Output is correct
13 Correct 2 ms 728 KB Output is correct
14 Correct 3 ms 728 KB Output is correct
15 Correct 3 ms 768 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
17 Correct 3 ms 792 KB Output is correct
18 Correct 4 ms 796 KB Output is correct
19 Correct 6 ms 804 KB Output is correct
20 Correct 3 ms 812 KB Output is correct
21 Correct 6 ms 940 KB Output is correct
22 Correct 12 ms 940 KB Output is correct
23 Correct 6 ms 940 KB Output is correct
24 Correct 17 ms 940 KB Output is correct
25 Correct 17 ms 940 KB Output is correct
26 Correct 31 ms 940 KB Output is correct
27 Correct 18 ms 968 KB Output is correct
28 Correct 13 ms 968 KB Output is correct
29 Correct 17 ms 968 KB Output is correct
30 Correct 18 ms 980 KB Output is correct
31 Correct 23 ms 984 KB Output is correct
32 Correct 22 ms 988 KB Output is correct
33 Correct 3 ms 988 KB Output is correct
34 Incorrect 59 ms 1380 KB Output isn't correct
35 Halted 0 ms 0 KB -