Submission #588743

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define whole(xs) xs.begin(), xs.end()
#define uniq(xs) (xs.erase(unique(xs.begin(), xs.end()), xs.end()))

namespace {
    typedef long long ll;

    template<class T> ostream& operator<<(ostream& os, const vector<T>& vs) {
        if (vs.empty()) return os << "[]";
        os << "[" << vs[0];
        for (int i = 1; i < vs.size(); i++) os << " " << vs[i];
        return os << "]";
    }

    int W, H;
    int N;
    vector<int> X, Y;
    void input() {
        cin >> W >> H >> N;
        X.clear(); X.resize(N);
        Y.clear(); Y.resize(N);
        for (int i = 0; i < N; i++) {
            cin >> X[i] >> Y[i];
            X[i]--; Y[i]--;
        }
    }

    map< tuple<int, int, int, int>, ll > memo;
    ll calc(int sy, int sx, int gy, int gx) {
        auto key = make_tuple(sy, sx, gy, gx);
        if (memo.count(key)) return memo[key];

        vector<int> xs, ys;
        for (int i = 0; i < N; i++) {
            int x = X[i], y = Y[i];
            if (sx <= x && x < gx && sy <= y && y < gy) {
                xs.push_back(x);
                ys.push_back(y);
            }
        }

        ll ans = 0;
        for (int i = 0; i < xs.size(); i++) {
            int x = xs[i], y = ys[i];
            ans = max(ans, 
                    calc(sy, sx, y, x) + 
                    calc(y + 1, sx, gy, x) + 
                    calc(sy, x + 1, y, gx) + 
                    calc(y + 1, x + 1, gy, gx) + 
                    (gy - sy) + (gx - sx) - 1);
        }
        return memo[key] = ans;
    }

    void solve() {
        cout << calc(0, 0, H, W) << endl;
    }
}

int main() {
    input(); solve();
    return 0;
}

Submission Info

Judge Result