csp回收站選址(201912-2)

#include<bits/stdc++.h>
using namespace std;
typedef  long long ull;
int n;
int score[5]={0};
typedef struct 
{
		ull x;
		ull y;
} point;

point pt[1005];
int cmp(point a,point b)
{
	return a.x<b.x&&a.y<b.y;
}
int is_exist(point pt1)
{
	for(int i=0;i<n;i++)
		if(pt[i].x==pt1.x&&pt[i].y==pt1.y) return 1;
	return 0;
}
int is_cd(int i)
{
	point z_pt=pt[i]; z_pt.x-=1;
	point y_pt=pt[i]; y_pt.x+=1;
	point s_pt=pt[i]; s_pt.y+=1;
	point x_pt=pt[i]; x_pt.y-=1;
	if(is_exist(z_pt)&&is_exist(y_pt)&&is_exist(s_pt)&&is_exist(x_pt))
          return 1;
    return 0;
}
int get_score(int i)
{
	int score=0;
	point zs_pt=pt[i]; zs_pt.x-=1; zs_pt.y+=1;
	point zx_pt=pt[i]; zx_pt.x-=1; zx_pt.y-=1;
	point ys_pt=pt[i]; ys_pt.x+=1; ys_pt.y+=1;
	point yx_pt=pt[i]; yx_pt.x+=1; yx_pt.y-=1;
	if(is_exist(zs_pt)) score+=1;
	if(is_exist(zx_pt)) score+=1;
	if(is_exist(ys_pt)) score+=1;
	if(is_exist(yx_pt)) score+=1;
	
	return score;
}

int main()
{
	int s;
	scanf("%d",&n);
	
	for(int i=0;i<n;i++)
		scanf("%d %d",&pt[i].x,&pt[i].y);
	sort(pt,pt+n,cmp);
	
	for(int i=0;i<n;i++)
		if(is_cd(i))
		{
			s=get_score(i);
			score[s]+=1;
		}
	
	for(int i=0;i<5;i++)
		printf("%d\n",score[i]);	
	
}