제출 #55260

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
55260		ksun48	Cultivation (JOI17_cultivation)	C++14	15 / 100	59 ms	1380 KiB

cultivation

#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';
}

컴파일 시 표준 에러 (stderr) 메시지

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++){
                   ~~~~~~^~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 30
• Subtask 5: 0 / 20
• Subtask 6: 0 / 20