Submission #1688597

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX

typedef long long ll;
typedef pair<int, int> ii;

int main(){

  ll h, w, n;
  cin >> h >> w >> n;
  vector<ll> a(n), b(n);
  rep(i, n){
    cin >> a[i] >> b[i];
    a[i]--;
    b[i]--;
  }

  map<ii, int> mp;
  rep(i, n){
    for(int j = -1; j <= 1; j++){
      for(int k = -1; k <= 1; k++){
        ll na = a[i] + j;
        ll nb = b[i] + k;
        if(na < 1 || h - 1 <= na || nb < 1 || w - 1 <= nb) continue;
        mp[make_pair(na, nb)]++;
      }
    }
  }
  vector<ll> ans(10, 0);
  for(auto it : mp){
    ans[it.second]++;
  }
 ans[0] = (h-2)*(w-2) - mp.size();
 rep(i, 10) cout << ans[i] << endl;

  return 0;
}

Submission Info

Judge Result