CCF CSP 201912-2 回收站选址

最新推荐文章于 2026-06-23 07:19:20 发布

原创最新推荐文章于 2026-06-23 07:19:20 发布 · 174 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#c++ #ccf #csp

算法&刷题专栏收录该内容

16 篇文章

订阅专栏

这是一个关于回收站选址问题的算法实现。程序通过输入垃圾点坐标，判断每个点周围是否存在足够的相邻点来建立回收站，并计算其得分。最后统计各得分段的垃圾点数量。

CCF CSP 201912-2 回收站选址

题目地址

#include<iostream>
#include<iomanip>
using namespace std;
#define N 100

typedef struct
{
	int x;
	int y;
}Point,*Ptr;
typedef Point ElemType;

int JudgeGarbagePoint(Point* Points,int n,int i) //返回分数，建不了则返回-1 
{
	int k,relevants=0;
	for(k=0;k<n;k++)
	{
		if(Points[k].x==Points[i].x-1&&Points[k].y==Points[i].y)
		relevants++;
		if(Points[k].x==Points[i].x+1&&Points[k].y==Points[i].y)
		relevants++;
		if(Points[k].x==Points[i].x&&Points[k].y==Points[i].y-1)
		relevants++;
		if(Points[k].x==Points[i].x&&Points[k].y==Points[i].y+1)
		relevants++;
	}
	if(relevants<4)return -1;//建不了垃圾站
	int score=0;
	for(k=0;k<n;k++)
	{
		if(Points[k].x==Points[i].x-1&&Points[k].y==Points[i].y-1)
		score++;
		if(Points[k].x==Points[i].x+1&&Points[k].y==Points[i].y+1)
		score++;
		if(Points[k].x==Points[i].x-1&&Points[k].y==Points[i].y+1)
		score++;
		if(Points[k].x==Points[i].x+1&&Points[k].y==Points[i].y-1)
		score++;
	}
	return score;
}


int main()
{
	int n;
	cin>>n;//垃圾点数量	
	int* Scores=new int[n]; 
	Point* Points=new Point[n];
	int x,y,i;
	for(i=0;i<n;i++)
	{
		 cin>>x>>y;
		 Points[i].x=x,Points[i].y=y;//Points[i].TrashFlag=1
	} 
	int results[5]={0};
	for(i=0;i<n;i++)
	{
		 int t=JudgeGarbagePoint(Points,n,i);
		 if(t!=-1)results[t]++;
	}
	for(i=0;i<5;i++)
	{
		cout<<results[i]<<"\n";
	}
	return 0;
}

/*
7
1 2
2 1
0 0
1 1
1 0
2 0
0 1

*/```