回收站选址

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

const int N=1000;
pair<int,int> p[N];
int cnt[5];
int main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int n;
    map<pair<int,int>,int> ps; 
    cin>>n;
    for(int i=0;i<n;++i){
        int x,y;
        cin>>x>>y;
        p[i] =make_pair(x,y);
        ps[p[i]] =1;
    }
    for(int i=0;i<n;++i){
        int x=p[i].first;
        int y=p[i].second;
        if(ps[make_pair(x,y+1)] && ps[make_pair(x,y-1)] &&ps[make_pair(x+1,y)] &&ps[make_pair(x-1,y)])
        {
            ++cnt[ps[make_pair(x+1,y+1)]+ps[make_pair(x+1,y-1)] +ps[make_pair(x-1,y+1)]+ps[make_pair(x-1,y-1)]];
        }
    }
    for(int i=0;i<5;i++)
    cout<<cnt[i]<<endl;
    return 0;
}