# 06-图2 Saving James Bond - Easy Version

This time let us consider the situation in the movie “Live and Let Die” in which James Bond, the world’s most famous spy, was captured by a group of drug dealers. He was sent to a small piece of land at the center of a lake filled with crocodiles. There he performed the most daring action to escape – he jumped onto the head of the nearest crocodile! Before the animal realized what was happening, James jumped again onto the next big head… Finally he reached the bank before the last crocodile could bite him (actually the stunt man was caught by the big mouth and barely escaped with his extra thick boot).

Assume that the lake is a 100 by 100 square one. Assume that the center of the lake is at (0,0) and the northeast corner at (50,50). The central island is a disk centered at (0,0) with the diameter of 15. A number of crocodiles are in the lake at various positions. Given the coordinates of each crocodile and the distance that James could jump, you must tell him whether or not he can escape.

Input Specification:

Each input file contains one test case. Each case starts with a line containing two positive integers N (N≤100), the number of crocodiles, and D, the maximum distance that James could jump. Then N lines follow, each containing the (x,y) location of a crocodile. Note that no two crocodiles are staying at the same position.

Output Specification:

For each test case, print in a line “Yes” if James can escape, or “No” if not.

Sample Input 1:

14 20
25 -15
-25 28
8 49
29 15
-35 -2
5 28
27 -29
-8 -28
-20 -35
-25 -20
-13 29
-30 15
-35 40
12 12
Sample Output 1:

Yes
Sample Input 2:

4 13
-12 12
12 12
-12 -12
12 -12
Sample Output 2:

No

#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=102;
typedef struct position position;
struct position{
int x,y;
}pos[maxn];
int N,D,visit[maxn];
bool flag=false;
void dfs(int index){
visit[index]=1;
if(pos[index].x+D>=50||pos[index].x-D<=-50||pos[index].y+D>=50||pos[index].y-D<=-50){
flag=true;
return;
}
for(int i=0;i<N;i++){
if(!visit[i]&&((pos[i].x-pos[index].x)*(pos[i].x-pos[index].x)+(pos[i].y-pos[index].y)*(pos[i].y-pos[index].y)<=D*D)){
dfs(i);
}
}
}
int main(){
//freopen("in.txt","r",stdin);
memset(visit,0,sizeof(visit));
scanf("%d%d",&N,&D);
for(int i=0;i<N;i++){
scanf("%d%d",&pos[i].x,&pos[i].y);
}
for(int i=0;i<N;i++){
if(D+7.5>=50){
flag=true;//直接跳上岸
}
else if(!visit[i]&&(pos[i].x*pos[i].x+pos[i].y*pos[i].y<=D*D+15*D+56)){
dfs(i);//起点能够到的位置
}
if(flag)
break;
}
if(flag){
puts("Yes");
}
else{
puts("No");
}
return 0;
}

• 本文已收录于以下专栏：

## 06-图2. Saving James Bond - Easy Version (25)

06-图2. Saving James Bond - Easy Version (25) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 8000 B 判...
• Jimko_Penng
• 2015年04月16日 19:22
• 877

## Saving James Bond - Easy Version

• Phenixfate
• 2015年01月04日 23:58
• 808

## 06-图2. Saving James Bond - Easy Version

This time let us consider the situation in the movie “Live and Let Die” in which James Bond, the wor...
• qq_22902423
• 2015年05月21日 01:27
• 427

## 06-图2 Saving James Bond - Easy Version

#include #include #define Island_Diameter 15 int Visited[105]; int FirstJump(int *a, int i, int...
• asunamashiro
• 2015年09月27日 16:36
• 328

## 06-图2 Saving James Bond - Easy Version   (25分)

This time let us consider the situation in the movie "Live and Let Die" in which James Bond, the wor...
• yeternity
• 2017年04月27日 16:08
• 252

## 06-图2 Saving James Bond - Easy Version (25分)

06-图2 Saving James Bond - Easy Version   (25分) This time let us consider the situation in the...
• sysusyf
• 2016年04月17日 11:24
• 370

## 06-图2 Saving James Bond - Easy Version（25 分）

This time let us consider the situation in the movie "Live and Let Die" in which James Bond, the wor...
• qq_38191717
• 2017年10月26日 20:40
• 60

## pat 06-图2. Saving James Bond - Easy Version (25)

dfs
• xinag578
• 2015年05月03日 20:09
• 311

## 【UVa】11354 Bond 最小生成树，动态LCA，倍增思想

Once again, James Bond is on his way tosaving the world. Bond's latest mission requires him to trave...
• u013368721
• 2014年07月02日 20:08
• 987

## uva11354 - Bond 最小瓶颈路+LCA

Once again, James Bond is on his way tosaving the world. Bond's latest mission requires him to trave...
• corncsd
• 2014年09月26日 20:08
• 376

举报原因： 您举报文章：06-图2 Saving James Bond - Easy Version 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)