Submission #1929710

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) (y<0||x<0||y>=h||x>=w)
#define dump(...)
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
#define INF (1001001001)
#define INFLL (1001001001001001001ll)
template<class T> ostream& operator << (ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v)) os<<*i<<(i==end(v)-1?"":" "); return os; }
template<class T> istream& operator >> (istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i; return is; }
template<class T> istream& operator >> (istream &is, pair<T,T> &p) {
    is>>p.first>>p.second; return is; }
template <class T> bool chmax(T &a,const T &b) {if(a<b) {a=b;return 1;} return 0;}
template <class T> bool chmin(T &a,const T &b) {if(b<a) {a=b;return 1;} return 0;}
template <class T> using heap = priority_queue<T,vector<T>,greater<T>>;
struct { template <typename T> operator T() { T x; cin >> x; return x; } } IN;
struct before_main_function {
    before_main_function() {
        #ifdef int
            #undef INF
            #define INF INFLL
            #define stoi stoll
        #endif
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(15)<<fixed;
        #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

int dp[70][70][70][70];
signed main() {
    int W=IN,H=IN,N=IN;
    vector<pii> p(N);
    vector<int> X,Y;
    REP(i,N) {
        int x=IN,y=IN;
        x--,y--;
        X.push_back(x); X.push_back(x+1);
        Y.push_back(x); Y.push_back(x+1);
        p[i]={x,y};
    }
    X.push_back(0); X.push_back(W);
    Y.push_back(0); Y.push_back(H);

    sort(ALL(X)); X.erase(unique(ALL(X)),end(X));
    sort(ALL(Y)); Y.erase(unique(ALL(Y)),end(Y));
    auto getx=[&](int x){return distance(begin(X),lower_bound(ALL(X),x));};
    auto gety=[&](int y){return distance(begin(Y),lower_bound(ALL(Y),y));};

    fill((int*)dp,(int*)(dp+70),INF);
    function<int(int,int,int,int)> rec=[&](int x1,int y1,int x2,int y2) {
        int X1=getx(x1),Y1=gety(y1),X2=getx(x2),Y2=gety(y2);
        if(dp[X1][Y1][X2][Y2]!=INF) return dp[X1][Y1][X2][Y2];
        int ret=0;
        REP(i,N) {
            int x=p[i].first,y=p[i].second;
            if(x<x1 || x2<=x || y<y1 || y2<=y) continue;
            int tmp=(x2-x1)+(y2-y1)-1;
            tmp+=rec(x1,y1,x,y);
            tmp+=rec(x+1,y1,x2,y);
            tmp+=rec(x1,y+1,x,y2);
            tmp+=rec(x+1,y+1,x2,y2);
            chmax(ret,tmp);
        }
        return dp[X1][Y1][X2][Y2]=ret;
    };
    cout<<rec(0,0,W,H)<<endl;
    return 0;
}

Submission Info

Judge Result