版权声明:本文为博主原创文章,需表明来源,方可随意转载。 https://blog.csdn.net/qq_36589706/article/details/84316293
#include<cstdio>
int const maxn=110;
int N, D, answer;
int visit[maxn];
struct point{
int x, y;
}arr[maxn]; //三种结点 原点、鳄鱼、岸边
int Jump(int v, int i){
int flag;
int a=arr[i].x-arr[v].x, b=arr[i].y-arr[v].y;
int c=D*D;
a=a*a; b=b*b;
if(a+b<=c)flag=1;
else flag=0;
return flag;
}
int IsSafe(int v){//是否能够到达岸边
int a=arr[v].x, b=arr[v].y;
if(a<0)a=-a;
if(b<0) b=-b;
if(a+D>=50||b+D>=50)return 1;
else return 0;
}
int DFS(int v){
visit[v]=1;
if(IsSafe(v))answer=1;
else{
for(int i=0; i<N; i++){
if(visit[i]==0&&Jump(v, i)){
answer=DFS(i);
if(answer==1)break;
}
}
}
return answer;
}
int FirstJump(int i){//每次起跳(岛屿半径+跳跃能力)
int flag;
int a=arr[i].x, b=arr[i].y;
a=a*a; b=b*b;
double c=(15/2+D)*(15/2+D);
if(a+b<=c)flag=1;
else flag=0;
return flag;
}
void Save007(){
for(int i=0; i<N; i++){
if(visit[i]==0&&FirstJump(i)){//原点周围可以起跳的每个点
answer=DFS(i);
if(answer)break;
}
}
if(answer)printf("Yes\n");
else printf("No\n");
}
int main(){
scanf("%d%d", &N, &D);
for(int i=0; i<N; i++){
scanf("%d%d", &arr[i].x, &arr[i].y);
}
Save007();
return 0;
}