Submission #127187

#	Time	Username	Problem	Language	Result	Execution time	Memory
127187		briansu	Cultivation (JOI17_cultivation)	C++14	30 / 100	559 ms	784 KiB

cultivation

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> ii;
#define REP(i, n) for(int i = 0;i < n;i ++)
#define REP1(i, n) for(int i = 1;i <= n;i ++)
#define FILL(i, n) memset(i, n, sizeof(i))
#define X first
#define Y second
#define pb push_back
#define SZ(_a) ((int)(_a).size())
#define ALL(_a) (_a).begin(), (_a).end()
#ifdef brian
#define IOS()
template<typename T>void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...t>void _do(T &&x, t &&...X){cerr<<x<<", ";_do(X...);}
#define debug(...) {\
	fprintf(stderr, "%s - %d (%s) = ", __PRETTY_FUNCTION__, __LINE__, #__VA_ARGS__);\
	_do(__VA_ARGS__);\
}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define debug(...)
#endif

const ll MAXn = 1e5 + 5;
const ll INF = ll(1e18);
const ll MOD = 1000000007;

vector<ii> d;

vector<ll> dt[45];

int main(){
	IOS();
	ll r, c, n;
	cin>>r>>c>>n;
	REP1(i, n)
	{
		ll x, y;
		cin>>x>>y;
		d.pb(ii(x, y));
	}
	ll ans = INF;
	REP(a, r)REP(b, r)
	{
		REP1(i, r)dt[i].clear();
		for(auto &p:d)for(int i = -a;i <= b;i ++)if(p.X + i > 0 && p.X + i <= r)dt[p.X + i].pb(p.Y);
		REP1(i, r)sort(ALL(dt[i])), dt[i].resize(unique(ALL(dt[i])) - dt[i].begin());
		bool fg = 0;
		ll x = 0, y = 0, mx = 0;
		REP1(i, r)
		{
			if(!SZ(dt[i])){
				fg = 1;
				break;
			}
			x = max(x, dt[i][0] - 1);
			y = max(y, c - dt[i].back());
			for(int j = 0;j < SZ(dt[i]) - 1;j ++)mx = max(mx, dt[i][j + 1] - dt[i][j] - 1);
		}
		if(fg)continue;
		ans = min(ans, max(x + y, mx) + a + b);
	}
	cout<<ans<<endl;
}

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