Submission #3784646

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define fore(i,a) for(auto &i:a)
typedef long long ll;
typedef pair <int, int> P;
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
const int  INF = 2147483647;
const ll INFL = 9223372036854775807;
const ll mod = 1000000007;


int N, K;
vector<long long> b;
long long dp[210000][2];

int main() {
	ll h, w, n;
	cin >> h >> w >> n;
	vector <int> dx = { 1,-1,0,0,1,1,-1,-1 };
	vector<int> dy = { 0,0,1,-1,1,-1,1,-1 };
	VI r(n), c(n);
	ll ans = h * (w - 1) + w * (h - 1) - 4 * n;
	REP(i, n) {
		cin >> r[i] >> c[i];
		if (r[i] == 1)ans++;
		if (r[i] == h)ans++;
		if (c[i] == 1)ans++;
		if (c[i] == w)ans++;
	}
	REP(i, n) {
		for (int j = i + 1; j < n; j++) {
			if (abs(c[i] - c[j]) + abs(r[i] - r[j]) == 1)ans++;
		}
	}

	cout << ans << endl;



}

Submission Info

Judge Result