Submission #1588889

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,bg,ed) for(ll i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) for(ll i=1;i<=(n);i++)
#define MOD 1000000007
#define int long long
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<int> vec;
typedef vector<vec> mat;
const int INF = 1e9;

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

map<tuple<int, int, int, int>, int> dp;

int rec(int x1, int y1, int x2, int y2)
{
    if (dp.find(make_tuple(x1, y1, x2, y2)) != dp.end()) return dp[make_tuple(x1, y1, x2, y2)];

    int res = 0;
    REP(i,N) {
        if (x1 <= X[i] && X[i] <= x2 && y1 <= Y[i] && Y[i] <= y2) {
            res = max(res, (x2-x1+y2-y1+1) + rec(x1,y1,X[i]-1,Y[i]-1) + rec(X[i]+1,y1,x2,Y[i]-1) + rec(x1,Y[i]+1,X[i]-1,y2) + rec(X[i]+1,Y[i]+1,x2,y2));
        }
    }
    return dp[make_tuple(x1, y1, x2, y2)] = res;
}

signed main()
{
    cin >> W >> H;
    cin >> N;
    REP(i,N) {
        cin >> X[i] >> Y[i];
    }

    cout << rec(1, 1, W, H) << endl;
}

Submission Info

Judge Result