201912-2 试题名称： 回收站选址CSP

#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<map>
#include<string>
#include<cstring>
using namespace std;

struct Point
{
	long long int x;
	long long int y;
//	int flag;
	int score;
	int cnt;
	Point()
	{
		x=0;
		y=0;
//		flag=0;
		score=0;
		cnt=0;
	}
};
Point point[1005];//某个傻瓜开了305的动态数组？？？100分变成20分？
int n;
Point process(Point a)
{
	for(int i=0;i<n;i++)
	{
		if(((point[i].x==a.x+1)&&(point[i].y==a.y))||
		((point[i].x==a.x-1)&&(point[i].y==a.y))||
		((point[i].x==a.x)&&(point[i].y==a.y+1))||
		((point[i].x==a.x)&&(point[i].y==a.y-1)))
		{
			a.cnt++;
		}
	}
	return a;
}

int grade(Point a,Point b)
{
	if(((a.x-1==b.x)&&(a.y+1==b.y))||
	((a.x-1==b.x)&&(a.y-1==b.y))||
	((a.x+1==b.x)&&(a.y+1==b.y))||
	((a.x+1==b.x)&&(a.y-1==b.y)))
	{
		return 1;
	}
	else
	{
		return 0;
	}
}

int main()
{

	cin>>n;

	for(int i=0;i<n;i++)
	{
		int x,y;
		cin>>x>>y;
		point[i].x=x;
		point[i].y=y;
	}
	for(int i=0;i<n;i++)
	{
		point[i]=process(point[i]);
		if(point[i].cnt==4)
		{
			for(int j=0;j<n;j++)
			{
				point[i].score+=grade(point[i],point[j]);
			 } 
		}
	}
	int ans[5];
	for(int i=0;i<5;i++)
	{
		ans[i]=0;
	}
	for(int i=0;i<n;i++)
	{
		if(point[i].cnt==4)
		{
		//	cout<<point[i].x<<" "<<point[i].y<<endl;
			ans[point[i].score]++;
		}
	}
	for(int i=0;i<5;i++)
	{
		cout<<ans[i]<<endl;
	}
	return 0;
}


//7
//1 2