CCF刷题打卡-回收站选址
解题思路
1、存坐标(结构体存两个成员变量)
2、检测回收站(一定注意if里面语句 不要因为多层嵌套而逻辑乱套)
3、判断星级(判断的过程中注意位置 i和p的位置哪个进行加减)
我的代码(C++)
#include<iostream>
using namespace std;
int main()
{
int n;int tmp=0;int star=0;
int zero_star=0;int one_star=0;int two_star=0;int three_star=0;int four_star=0;
cin >> n;
struct Points
{
int x;
int y;
};
Points point[n+5];
for(int i=0;i<n;i++)
{
cin >> point[i].x >> point[i].y;
}
for(int i=0;i<n;i++)
{
tmp = 0;
//判断垃圾站
for(int j=0;j<n;j++)
{
if((point[i].x == point[j].x)&&((point[i].y)-1 == point[j].y)) tmp++;
if((point[i].x == point[j].x)&&((point[i].y)+1 == point[j].y)) tmp++;
if(((point[i].x)+1 == point[j].x)&&(point[i].y == point[j].y)) tmp++;
if(((point[i].x)-1 == point[j].x)&&(point[i].y == point[j].y)) tmp++;
}
//用来判断斜对角
if(tmp == 4)
{
for(int p=0;p<n;p++)
{
if(((point[i].x)-1 == point[p].x)&&((point[i].y)-1 == point[p].y)) star++;
if(((point[i].x)-1 == point[p].x)&&((point[i].y)+1 == point[p].y)) star++;
if(((point[i].x)+1 == point[p].x)&&((point[i].y)-1 == point[p].y)) star++;
if(((point[i].x)+1 == point[p].x)&&((point[i].y)+1 == point[p].y)) star++;
}
if(star == 0) zero_star++;
if(star == 1) one_star++;
if(star == 2) two_star++;
if(star == 3) three_star++;
if(star == 4) four_star++;
star = 0;
}
}
cout << zero_star << "\n" << one_star << "\n" << two_star << "\n" << three_star << "\n" << four_star << endl;
return 0;
}