Submission #170091

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <istream>
#include <sstream>
#include <iomanip>
#include <iterator>
#include <climits>
using namespace std;

typedef ostringstream OSS;
typedef istringstream ISS;

typedef vector<int> VI;
typedef vector< VI > VVI;

typedef long long LL;

typedef pair<int, int> PII;
typedef vector<PII> VPII;

typedef tuple<int, int, int, int> I4;

#define X first
#define Y second

int W, H, N;
VPII robots;
map<I4, int> memo;

int dfs(I4 area) {
	if (memo.count(area)) {
		return memo[area];
	}

	int w = get<2>(area) - get<0>(area);
	int h = get<3>(area) - get<1>(area);

	VI res(1, 0);
	for (auto &robot : robots) {
		if (get<0>(area) <= robot.X && robot.X < get<2>(area) &&
			get<1>(area) <= robot.Y && robot.Y < get<3>(area)) {

			int tmp = w + h - 1;
			tmp += dfs(make_tuple( get<0>(area), get<1>(area), robot.X,      robot.Y      ));
			tmp += dfs(make_tuple( get<0>(area), robot.Y + 1,  robot.X,      get<3>(area) ));
			tmp += dfs(make_tuple( robot.X + 1,  get<1>(area), get<2>(area), robot.Y      ));
			tmp += dfs(make_tuple( robot.X + 1,  robot.Y + 1,  get<2>(area), get<3>(area  )));

			res.push_back(tmp);
		}
	}

	return memo[area] = *max_element(res.begin(), res.end());
}

int main(void) {
	cin >> W >> H >> N;
	robots = VPII(N);
	for (auto &robot : robots) {
		cin >> robot.X >> robot.Y;
		robot.X--;
		robot.Y--;
	}

	cout << dfs(make_tuple(0, 0, W, H)) << endl;

	return 0;
}

Submission Info

Judge Result