답안 #55269 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
55269	2018-07-06T19:35:10 Z	ksun48	Cultivation (JOI17_cultivation)	C++14	5 / 100	2000 ms	980 KB

cultivation

#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){
	if(x < 0){
		return;
	}
	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});
	}
	sort(seeds.begin(), seeds.end());
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			tryx(seeds[i].first + r-1 - seeds[j].first);
		}
	}
	cout << best << '\n';
}

Compilation message

cultivation.cpp: In function 'void tryx(LL)':
cultivation.cpp:30:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(LL i = 0; i + 1 < grass.size(); i++){
                  ~~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	476 KB	Output is correct
3	Correct	2 ms	496 KB	Output is correct
4	Correct	2 ms	496 KB	Output is correct
5	Correct	2 ms	496 KB	Output is correct
6	Correct	2 ms	520 KB	Output is correct
7	Correct	2 ms	520 KB	Output is correct
8	Correct	3 ms	520 KB	Output is correct
9	Correct	3 ms	520 KB	Output is correct
10	Correct	2 ms	544 KB	Output is correct
11	Correct	2 ms	544 KB	Output is correct
12	Correct	3 ms	544 KB	Output is correct
13	Correct	2 ms	544 KB	Output is correct
14	Correct	3 ms	544 KB	Output is correct
15	Correct	2 ms	544 KB	Output is correct
16	Correct	2 ms	544 KB	Output is correct

Subtask #2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	476 KB	Output is correct
3	Correct	2 ms	496 KB	Output is correct
4	Correct	2 ms	496 KB	Output is correct
5	Correct	2 ms	496 KB	Output is correct
6	Correct	2 ms	520 KB	Output is correct
7	Correct	2 ms	520 KB	Output is correct
8	Correct	3 ms	520 KB	Output is correct
9	Correct	3 ms	520 KB	Output is correct
10	Correct	2 ms	544 KB	Output is correct
11	Correct	2 ms	544 KB	Output is correct
12	Correct	3 ms	544 KB	Output is correct
13	Correct	2 ms	544 KB	Output is correct
14	Correct	3 ms	544 KB	Output is correct
15	Correct	2 ms	544 KB	Output is correct
16	Correct	2 ms	544 KB	Output is correct
17	Correct	8 ms	548 KB	Output is correct
18	Correct	296 ms	548 KB	Output is correct
19	Correct	37 ms	596 KB	Output is correct
20	Correct	5 ms	596 KB	Output is correct
21	Correct	183 ms	628 KB	Output is correct
22	Execution timed out	2082 ms	980 KB	Time limit exceeded
23	Halted	0 ms	0 KB	-

Subtask #3
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	476 KB	Output is correct
3	Correct	2 ms	496 KB	Output is correct
4	Correct	2 ms	496 KB	Output is correct
5	Correct	2 ms	496 KB	Output is correct
6	Correct	2 ms	520 KB	Output is correct
7	Correct	2 ms	520 KB	Output is correct
8	Correct	3 ms	520 KB	Output is correct
9	Correct	3 ms	520 KB	Output is correct
10	Correct	2 ms	544 KB	Output is correct
11	Correct	2 ms	544 KB	Output is correct
12	Correct	3 ms	544 KB	Output is correct
13	Correct	2 ms	544 KB	Output is correct
14	Correct	3 ms	544 KB	Output is correct
15	Correct	2 ms	544 KB	Output is correct
16	Correct	2 ms	544 KB	Output is correct
17	Correct	8 ms	548 KB	Output is correct
18	Correct	296 ms	548 KB	Output is correct
19	Correct	37 ms	596 KB	Output is correct
20	Correct	5 ms	596 KB	Output is correct
21	Correct	183 ms	628 KB	Output is correct
22	Execution timed out	2082 ms	980 KB	Time limit exceeded
23	Halted	0 ms	0 KB	-

Subtask #4
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	3 ms	980 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	3 ms	980 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	476 KB	Output is correct
3	Correct	2 ms	496 KB	Output is correct
4	Correct	2 ms	496 KB	Output is correct
5	Correct	2 ms	496 KB	Output is correct
6	Correct	2 ms	520 KB	Output is correct
7	Correct	2 ms	520 KB	Output is correct
8	Correct	3 ms	520 KB	Output is correct
9	Correct	3 ms	520 KB	Output is correct
10	Correct	2 ms	544 KB	Output is correct
11	Correct	2 ms	544 KB	Output is correct
12	Correct	3 ms	544 KB	Output is correct
13	Correct	2 ms	544 KB	Output is correct
14	Correct	3 ms	544 KB	Output is correct
15	Correct	2 ms	544 KB	Output is correct
16	Correct	2 ms	544 KB	Output is correct
17	Correct	8 ms	548 KB	Output is correct
18	Correct	296 ms	548 KB	Output is correct
19	Correct	37 ms	596 KB	Output is correct
20	Correct	5 ms	596 KB	Output is correct
21	Correct	183 ms	628 KB	Output is correct
22	Execution timed out	2082 ms	980 KB	Time limit exceeded
23	Halted	0 ms	0 KB	-

답안 #55269

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 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
0 / 10.0

Subtask #3
0 / 15.0

Subtask #4
0 / 30.0

Subtask #5
0 / 20.0

Subtask #6
0 / 20.0