![在这里插入图片描述](https://img-blog.csdnimg.cn/20200208145412118.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ1NzcyNDgz,size_16,color_FFFFFF,t_70
#include<iostream>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=100010;
typedef pair<int,int> PII;
PII s[N];
const int M=5;
map<PII,int> ps;
int cnt[M+1];
int n;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
int x,y;
scanf("%d%d",&x,&y);
s[i]={x,y};
ps[s[i]]=1;
}
memset(cnt,0,sizeof cnt);
for(int i=1;i<=n;i++)
{
int x=s[i].first;
int y=s[i].second;
if(ps[{x-1,y}] && ps[{x+1,y}] && ps[{x,y+1}] && ps[{x,y-1}])
{
cnt[ps[{x-1,y+1}] + ps[{x-1,y-1}] + ps[{x+1,y+1}] + ps[{x+1,y-1}]]++;
}
}
for(int i=0;i<=4;i++)
printf("%d\n",cnt[i]);
return 0;
}