Submission #1688570

---

Source Code Expand

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

int a[100005]={0}, b[100005]={0};
int dx[9]={0,1,1,1,0,-1,-1,-1,0}, dy[9]={-1,-1,0,1,1,1,0,-1,0};


int main(){
    long long int h, w, n;
    cin >> h >> w >> n;
    set<pair<int, int> > p;
    for(int i=0;i<n;++i){
        cin >> a[i] >> b[i];
        p.insert(pair<int, int>(a[i], b[i]));
    }

    set<pair<int, int> > st[10];
    for(int i=0;i<n;++i){
        for(int j=0;j<9;++j){
            int cx = a[i] + dx[j], cy = b[i] + dy[j];
            if(cx > 1 && cx < h && cy > 1 && cy < w){
                int cnt = 0;
                for(int k=0;k<9;++k){
                    if(p.count(pair<int,int>(cx+dx[k], cy+dy[k])))cnt++;
                }
                st[cnt].insert(pair<int,int>(cx, cy));
            }
        }
    }

    long long int tmp = 0;
    for(int i=1;i<10;++i)tmp += st[i].size();
    cout << (h-2)*(w-2) - tmp << endl;
    for(int i=1;i<10;++i){
        cout << st[i].size() << endl;
    }

    return 0;
}

Submission Info

Judge Result