Submission #127184

#	Time	Username	Problem	Language	Result	Execution time	Memory
127184		Utaha	Cultivation (JOI17_cultivation)	C++14	0 / 100	2 ms	504 KiB

cultivation

/*input
4 4
4
1 1
1 4
4 1
4 4
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i,n) for(int i=0;i<((int)n);i++)
#define pb emplace_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<'('<<P.F<<','<<P.S<<')';
    return out;
}

//}}}
const ll maxn=300005;
const ll maxlg=__lg(maxn)+2;
const ll INF64=8000000000000000000LL;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const ld PI=acos(-1);
const ld eps=1e-9;
//const ll p=880301;
//const ll P=31;

ll mypow(ll a,ll b){
    ll res=1LL;
    while(b){
        if(b&1) res=res*a%MOD;
        a=a*a%MOD;
        
        b>>=1;
    }
    return res;
}

ll x[305],y[305];

vector<ll> v[45];
int main(){
    IOS;
    ll n,m,q;
    cin>>n>>m>>q;
    REP(i,q) cin>>x[i]>>y[i];
    REP(i,q) x[i]--,y[i]--;

    ll ans=INF64;

    for(ll up=0;up<n;up++) for(ll dn=0;dn<n;dn++){
        REP(i,n) v[i].clear();
        REP(i,q){
            for(ll X=x[i]-dn;X<=x[i]+up;X++) if(X>=0&&X<n){
                v[X].pb(y[i]);
            }
        }
        REP(i,n) sort(ALL(v[i]));
        bool f=1;
        REP(i,n) if(SZ(v[i])==0) f=0;
        if(!f) continue;

        ll cur=0;
        REP(i,n){
            cur=max(cur,v[i][0]);
            cur=max(cur,m-1-v[i].back());
            REP(j,SZ(v[i])-1) cur=max(cur,v[i][j+1]-v[i][j]-1); 
        }
        ans=min(ans,cur+up+dn);
    }
    cout<<ans<<'\n';
    return 0;
}

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