Submission #1584965

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;

#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)

const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
    each(x,vec) is >> x;
    return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
    rep(i,vec.size()) {
        if (i) os << " ";
        os << vec[i];
    }
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
    rep(i,vec.size()) {
        if (i) os << endl;
        os << vec[i];
    }
    return os;
}
map<ll, ll> compress(vector<ll>& X) {
    map<ll, ll> res;
    sort(all(X));
    X.erase(unique(all(X)), X.end());
    rep(i, X.size()) res[X[i]] = i;
    return res;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll w, h; cin >> w >> h;
    vector<ll> X{0, w}, Y{0, h};
    ll n; cin >> n;
    vector<P> v;
    rep(i, n) {
        ll x, y; cin >> x >> y; --x, --y;
        v.pb({x, y});
        rep(j, -1, 2) {
            ll nx = x + j;
            ll ny = y + j;
            if (0 <= nx && nx <= w) X.pb(nx);
            if (0 <= ny && ny <= h) Y.pb(ny);
        }
    }
    map<ll, ll> xto = compress(X);
    map<ll, ll> yto = compress(Y);
    each(p, v) {
        p.first = xto[p.first];
        p.second = yto[p.second];
        // cout << "-> " << p.first << " " << p.second << endl;
    }
    w = xto.size();
    h = yto.size();
    vector<vector<vector<vector<bool>>>> m1(w, vector<vector<vector<bool>>>(h, vector<vector<bool>>(w+1, vector<bool>(h+1, false))));
    vector<vector<vector<vector<ll>>>> m2(w, vector<vector<vector<ll>>>(h, vector<vector<ll>>(w+1, vector<ll>(h+1))));
    function<ll(ll,ll,ll,ll)> dp = [&](ll x1, ll y1, ll x2, ll y2) {
        if (m1[x1][y1][x2][y2]) return m2[x1][y1][x2][y2];
        ll res = 0;
        rep(i, n) {
            ll x, y; tie(x, y) = v[i];
            if (x < x1 || x2 <= x || y < y1 || y2 <= y) continue;
            // cout << x << " " << y << endl;
            chmax(res,
                (X[x2]-X[x1])+(Y[y2]-Y[y1])-1
                + dp(x1, y1, x, y)
                + dp(x+1, y1, x2, y)
                + dp(x1, y+1, x, y2)
                + dp(x+1, y+1, x2, y2));
        }
        // cout << x1 << " " << y1 << " " << x2 << " " << y2 << " : " << res << endl;
        return m1[x1][y1][x2][y2] = true, m2[x1][y1][x2][y2] = res;
    };
    cout << dp(0, 0, w-1, h-1) << endl;
}

Submission Info

Judge Result