Submission #1033456

---

Source Code Expand

#include <bits/stdc++.h>
#include <tuple>
 
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
#define RREP(i,n) for(int i=(int)(n); i>=0; --i)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);++i)
typedef long long int ll;
using namespace std;

int W, H;
int N;
int X[81], Y[81];

typedef tuple<int, int, int, int> T;
map<T, int> c;

int dp(int i, int j, int w, int h) {
    T t = make_tuple(i, j, w, h);
    if(c.count(t) == 1) return c[t];
    int ret = 0;
    REP(k, N) {
        int s = X[k]; int t = Y[k];
        if(s >= i && s <= w && t >= j && t <= h) {
            ret = max(ret, w+h-i-j+1 + dp(i, j, s-1, t-1) + dp(s+1, j, w, t-1)
                                     + dp(i, t+1, s-1, h) + dp(s+1, t+1, w, h));
        }
    }
    return (c[t] = ret);
}

int main(void) {
    cin >> W >> H;
    cin >> N;
    REP(i, N) cin >> X[i] >> Y[i];
    cout << dp(1, 1, W, H) << endl;
}

Submission Info

Judge Result