Submission #4241786

---

Source Code Expand

using namespace std;
#include<bits/stdc++.h>
#define BEGIN ios_base::sync_with_stdio(0);cin.tie(0);
#define END return EXIT_SUCCESS;
#define FOR(I,A,B) for((I)=(A);(I)<(B);(I)++)
#define REP(I,N) FOR((I),0,(N))
#define UP(I,A,B) for((I)=(A);(I)<=(B);(I)++)
#define DW(I,A,B) for((I)=(A);(I)>=(B);(I)--)
#define IN(P) cin>>(P)
#define IN2(P1,P2) cin>>(P1)>>(P2)
#define IN3(P1,P2,P3) cin>>(P1)>>(P2)>>(P3)
#define INS(I,N,V) REP((I),(N)) cin>>V[I]
#define INS2(I,N,V1,V2) REP((I),(N)) cin>>V1[I]>>V2[I];
#define INS3(I,N,V1,V2,V3) REP((I),(N)) cin>>V1[I]>>V2[I]>>V3[I];
#define OUT(P) cout<<(P)<<endl
#define OUT2(P1,P2) cout<<(P1)<<" "<<(P2)<<endl
#define OUT3(P1,P2,P3) cout<<(P1)<<" "<<(P2)<<" "<<(P3)<<endl
#define OUTS(I,N,V) REP((I),(N)) cout<<(V[i])<<endl
#define ALL(C) (C).begin(),(C).end()
#define RALL(C) (C).rbegin(),(C).rend()
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
template<class T>inline bool chmax(T& a,T b){if(a<b){a=b;return true;}return false;}
template<class T>inline bool chmin(T& a,T b){if(a>b){a=b;return true;}return false;}
template<class T>inline T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T>inline T lcm(T a,T b){return a*b/gcd(b,a%b);}

int W,H,N;
vector<int> X,Y;
map<tuple<int, int, int, int>, int> dp;

int rec(int lx,int ly,int rx,int ry){
  if(dp.count(tie(lx,ly,rx,ry)))return dp[tie(lx,ly,rx,ry)];
  int res=0;
  int i;
  REP(i,N){
    if(X[i]>=lx&&X[i]<rx&&Y[i]>=ly&&Y[i]<ry){
      int lu=rec(lx,Y[i]+1,X[i],ry);
      int ld=rec(lx,ly,X[i],Y[i]);
      int ru=rec(X[i]+1,Y[i]+1,rx,ry);
      int rd=rec(X[i]+1,ly,rx,Y[i]);
      chmax(res,lu+ld+ru+rd+rx-lx+ry-ly-1);
    }
  }
  return dp[tie(lx,ly,rx,ry)]=res;
}
inline void solve(){
  int i;
  IN3(W,H,N);
  X.resize(N);
  Y.resize(N);
  REP(i,N){
    IN2(X[i],Y[i]);
    X[i]--;Y[i]--;
  }
  OUT(rec(0,0,W,H));
}

int main(int argc,char**argv){
  BEGIN
  solve();
  END
}

Submission Info

Judge Result