답안 #55262 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
55262	2018-07-06T18:45:15 Z	ksun48	Cultivation (JOI17_cultivation)	C++14	30 / 100	266 ms	2036 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){
	set<LL> stuff[r + x];
	for(pair<LL,LL> z : seeds){
		for(LL 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(LL 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(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:29: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	248 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	2 ms	568 KB	Output is correct
4	Correct	2 ms	568 KB	Output is correct
5	Correct	2 ms	568 KB	Output is correct
6	Correct	2 ms	568 KB	Output is correct
7	Correct	2 ms	584 KB	Output is correct
8	Correct	2 ms	584 KB	Output is correct
9	Correct	2 ms	584 KB	Output is correct
10	Correct	3 ms	584 KB	Output is correct
11	Correct	2 ms	584 KB	Output is correct
12	Correct	2 ms	584 KB	Output is correct
13	Correct	3 ms	584 KB	Output is correct
14	Correct	2 ms	584 KB	Output is correct
15	Correct	3 ms	628 KB	Output is correct
16	Correct	3 ms	628 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	2 ms	568 KB	Output is correct
4	Correct	2 ms	568 KB	Output is correct
5	Correct	2 ms	568 KB	Output is correct
6	Correct	2 ms	568 KB	Output is correct
7	Correct	2 ms	584 KB	Output is correct
8	Correct	2 ms	584 KB	Output is correct
9	Correct	2 ms	584 KB	Output is correct
10	Correct	3 ms	584 KB	Output is correct
11	Correct	2 ms	584 KB	Output is correct
12	Correct	2 ms	584 KB	Output is correct
13	Correct	3 ms	584 KB	Output is correct
14	Correct	2 ms	584 KB	Output is correct
15	Correct	3 ms	628 KB	Output is correct
16	Correct	3 ms	628 KB	Output is correct
17	Correct	3 ms	628 KB	Output is correct
18	Correct	9 ms	628 KB	Output is correct
19	Correct	10 ms	628 KB	Output is correct
20	Correct	4 ms	628 KB	Output is correct
21	Correct	17 ms	628 KB	Output is correct
22	Correct	31 ms	772 KB	Output is correct
23	Correct	18 ms	772 KB	Output is correct
24	Correct	37 ms	772 KB	Output is correct
25	Correct	33 ms	772 KB	Output is correct
26	Correct	47 ms	772 KB	Output is correct
27	Correct	50 ms	772 KB	Output is correct
28	Correct	68 ms	940 KB	Output is correct
29	Correct	60 ms	940 KB	Output is correct
30	Correct	55 ms	940 KB	Output is correct
31	Correct	49 ms	940 KB	Output is correct
32	Correct	49 ms	940 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	2 ms	568 KB	Output is correct
4	Correct	2 ms	568 KB	Output is correct
5	Correct	2 ms	568 KB	Output is correct
6	Correct	2 ms	568 KB	Output is correct
7	Correct	2 ms	584 KB	Output is correct
8	Correct	2 ms	584 KB	Output is correct
9	Correct	2 ms	584 KB	Output is correct
10	Correct	3 ms	584 KB	Output is correct
11	Correct	2 ms	584 KB	Output is correct
12	Correct	2 ms	584 KB	Output is correct
13	Correct	3 ms	584 KB	Output is correct
14	Correct	2 ms	584 KB	Output is correct
15	Correct	3 ms	628 KB	Output is correct
16	Correct	3 ms	628 KB	Output is correct
17	Correct	3 ms	628 KB	Output is correct
18	Correct	9 ms	628 KB	Output is correct
19	Correct	10 ms	628 KB	Output is correct
20	Correct	4 ms	628 KB	Output is correct
21	Correct	17 ms	628 KB	Output is correct
22	Correct	31 ms	772 KB	Output is correct
23	Correct	18 ms	772 KB	Output is correct
24	Correct	37 ms	772 KB	Output is correct
25	Correct	33 ms	772 KB	Output is correct
26	Correct	47 ms	772 KB	Output is correct
27	Correct	50 ms	772 KB	Output is correct
28	Correct	68 ms	940 KB	Output is correct
29	Correct	60 ms	940 KB	Output is correct
30	Correct	55 ms	940 KB	Output is correct
31	Correct	49 ms	940 KB	Output is correct
32	Correct	49 ms	940 KB	Output is correct
33	Correct	3 ms	940 KB	Output is correct
34	Correct	262 ms	1876 KB	Output is correct
35	Correct	191 ms	1876 KB	Output is correct
36	Correct	266 ms	1876 KB	Output is correct
37	Correct	163 ms	1876 KB	Output is correct
38	Correct	243 ms	1876 KB	Output is correct
39	Correct	204 ms	1876 KB	Output is correct
40	Correct	241 ms	1972 KB	Output is correct
41	Correct	232 ms	1972 KB	Output is correct
42	Correct	178 ms	1972 KB	Output is correct
43	Correct	260 ms	2036 KB	Output is correct
44	Correct	162 ms	2036 KB	Output is correct

Subtask #4
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	3 ms	2036 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	2036 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	248 KB	Output is correct
2	Correct	2 ms	484 KB	Output is correct
3	Correct	2 ms	568 KB	Output is correct
4	Correct	2 ms	568 KB	Output is correct
5	Correct	2 ms	568 KB	Output is correct
6	Correct	2 ms	568 KB	Output is correct
7	Correct	2 ms	584 KB	Output is correct
8	Correct	2 ms	584 KB	Output is correct
9	Correct	2 ms	584 KB	Output is correct
10	Correct	3 ms	584 KB	Output is correct
11	Correct	2 ms	584 KB	Output is correct
12	Correct	2 ms	584 KB	Output is correct
13	Correct	3 ms	584 KB	Output is correct
14	Correct	2 ms	584 KB	Output is correct
15	Correct	3 ms	628 KB	Output is correct
16	Correct	3 ms	628 KB	Output is correct
17	Correct	3 ms	628 KB	Output is correct
18	Correct	9 ms	628 KB	Output is correct
19	Correct	10 ms	628 KB	Output is correct
20	Correct	4 ms	628 KB	Output is correct
21	Correct	17 ms	628 KB	Output is correct
22	Correct	31 ms	772 KB	Output is correct
23	Correct	18 ms	772 KB	Output is correct
24	Correct	37 ms	772 KB	Output is correct
25	Correct	33 ms	772 KB	Output is correct
26	Correct	47 ms	772 KB	Output is correct
27	Correct	50 ms	772 KB	Output is correct
28	Correct	68 ms	940 KB	Output is correct
29	Correct	60 ms	940 KB	Output is correct
30	Correct	55 ms	940 KB	Output is correct
31	Correct	49 ms	940 KB	Output is correct
32	Correct	49 ms	940 KB	Output is correct
33	Correct	3 ms	940 KB	Output is correct
34	Correct	262 ms	1876 KB	Output is correct
35	Correct	191 ms	1876 KB	Output is correct
36	Correct	266 ms	1876 KB	Output is correct
37	Correct	163 ms	1876 KB	Output is correct
38	Correct	243 ms	1876 KB	Output is correct
39	Correct	204 ms	1876 KB	Output is correct
40	Correct	241 ms	1972 KB	Output is correct
41	Correct	232 ms	1972 KB	Output is correct
42	Correct	178 ms	1972 KB	Output is correct
43	Correct	260 ms	2036 KB	Output is correct
44	Correct	162 ms	2036 KB	Output is correct
45	Runtime error	3 ms	2036 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
46	Halted	0 ms	0 KB	-

답안 #55262

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 15.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
15.0 / 15.0

Subtask #4
0 / 30.0

Subtask #5
0 / 20.0

Subtask #6
0 / 20.0