Submission #1688576

---

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]--;
  }
  if(h*w <= 100000LL){
    vector<vector<int>> cnt(h, vector<int>(w, 0));
    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 < 0 || h <= na || nb < 0 || w <= nb) continue;
          cnt[na][nb]++;
        }
      }
    }
    vector<ll> ans(10, 0);
    REP(i, 1, h-1) REP(j, 1, w-1) ans[cnt[i][j]]++;
    rep(i, 10) cout << ans[i] << endl;
  }
  else{
    assert(false);
  }



  return 0;
}

Submission Info

Judge Result