Submission #2448595

---

Source Code Expand

#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
	int N, K;
	cin >> N >> K;
	vector<int> x(K), y(K);
	for (int i = 0; i < K; i++) {
		cin >> x[i] >> y[i];
		x[i]--;
		y[i]--;
	}
	vector<int> cx, cy;
	for (int i = 0; i < K; i++) {
		for (int j = -2; j <= 2; j++) {
			if (0 <= x[i] + j && x[i] + j < N) {
				cx.push_back(x[i] + j);
			}
			if (0 <= y[i] + j && y[i] + j < N) {
				cy.push_back(y[i] + j);
			}
		}
	}
	sort(cx.begin(), cx.end()); 
	cx.erase(unique(cx.begin(), cx.end()), cx.end());
	sort(cy.begin(), cy.end());
	cy.erase(unique(cy.begin(), cy.end()), cy.end());
	int ret = 1;
	for (int i = 0; i < cx.size(); i++) {
		for (int j = i; j < cx.size(); j++) {
			for (int k = 0; k < cy.size(); k++) {
				for (int l = k; l < cy.size(); l++) {
					int cur = 0;
					if (cx[i] % 2 == cx[j] % 2 && cy[k] % 2 == cy[l] % 2) {
						if ((cx[i] + cy[k]) % 2 == 0) cur--;
						else cur++;
					}
					for (int m = 0; m < K; m++) {
						if (cx[i] <= x[m] && x[m] <= cx[j] && cy[k] <= y[m] && y[m] <= cy[l]) {
							if ((x[m] + y[m]) % 2 == 0) cur += 2;
							else cur -= 2;
						}
					}
					ret = max(ret, (cur > 0 ? cur : -cur));
				}
			}
		}
	}
	cout << ret << "\n";
	return 0;
}

Submission Info

Judge Result