Submission #1088510

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

int main() {
  ll h, w;
  int n;
  scanf("%lld %lld %d", &h, &w, &n);
  vi y(n), x(n);
  rep (i, n) {
    scanf("%d %d", &y[i], &x[i]);
    y[i] *= 2;
    x[i] *= 2;
  }
  set<pii> x_edges;
  rep (i, n) {
    if (x[i] != 2) {
      x_edges.insert(make_pair(x[i]-1, y[i]));
    }
    if (x[i] != w*2) {
      x_edges.insert(make_pair(x[i]+1, y[i]));
    }
    if (y[i] != 2) {
      x_edges.insert(make_pair(x[i], y[i]-1));
    }
    if (y[i] != h*2) {
      x_edges.insert(make_pair(x[i], y[i]+1));
    }
  }
  printf("%lld\n", h*(w-1) + (h-1)*w - (ll)x_edges.size());
  return 0;
}

Submission Info

Judge Result