CCF回收站选址（100分）

#include<bits/stdc++.h>
using namespace std;
int findxy(int x,int y,int a[],int b[],int n);
int main()
{
	int n;
	scanf("%d",&n);
	int a[1000];
	int b[1000];
	int sum1=0;
	int sum2=0;
	int sum3=0;
	int sum4=0;
	int sum5=0;
	for(int i=0;i<n;i++)
	{
		scanf("%d %d",&a[i],&b[i]);
	}
	for(int k=0;k<n;k++)
	{
		int f=a[k];
		int g=b[k];
		int sign1=f-1;
		int sign2=f+1;
		int sign3=g-1;
		int sign4=g+1;
		int count=0;
		int biao=0;
	    if((findxy(f,sign4,a,b,n)+findxy(f,sign3,a,b,n)+findxy(sign1,g,a,b,n)+findxy(sign2,g,a,b,n))==4)
	    {
	    	    biao=1;
		}
		else
		{
			biao=0;
		}
		if(biao==1)
		{
			if(findxy(sign1,sign3,a,b,n)==1)
				{
					count++;
				}
				if(findxy(sign1,sign4,a,b,n)==1)
				{
					count++;
				}
				if(findxy(sign2,sign3,a,b,n)==1)
				{
					count++;
				}
				if(findxy(sign2,sign4,a,b,n)==1)
				{
					count++;
				}
		}
		else
		{
			continue;
		}
		if(count==0)
		{
			sum1++;
		}
		if(count==1)
		{
			sum2++;
		}
		if(count==2)
		{
			sum3++;
		}
		if(count==3)
		{
			sum4++;
		}
		if(count==4)
		{
			sum5++;
		}	
	}
	cout<<sum1<<endl;
	cout<<sum2<<endl;
	cout<<sum3<<endl;
	cout<<sum4<<endl;
	cout<<sum5<<endl;
	return 0;
}
int findxy(int x,int y,int a[],int b[],int n)
{
	int i,j;
	int sum=0;
	for(i=0;i<n;i++)
	{
		if(x==a[i])
		{
			if(y==b[i])
			{
				sum=1;
				break;
			}
			if(y!=b[i])
			{
				sum=0;
				continue;
			}
		}
		else
		{
			continue;
		}
	}
	return sum;
}