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 (≤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<iostream>
#include<cstdio>
#include<math.h>
#include <queue>
using namespace std;
/*
图的邻接矩阵表示
*/
/*最多的结点数是100*/
#define MAXVertextNum 100
/*双字节无符号整数的最大值65535,即无穷大*/
#define INFINIIY 65535
typedef int Vertex;//用下标表示顶点
typedef int WeightType;//边的值表示权重
typedef int DataType;//顶点数据
bool Visted[MAXVertextNum] = {
false};
int maxJump;
/* 边的定义*/
typedef struct ENode *PtrToENode;
struct ENode{
//有向边<V1,V2>
Vertex V1,V2;
//权重
WeightType Weight;
};
typedef PtrToENode Edge;
/*邻接点定义*/
typedef struct AdjNode *ptrToAdjNode;
struct AdjNode{
//下标
Vertex AdjV;
//权重
WeightType Weight;
//指向连接点的指针
ptrToAdjNode Next;
};
/*邻接表的定义*/
typedef struct Vnode{
//边表的头指针
ptrToAdjNode firstEdge;
//存顶点的数据,不需要下标了,该结构体数组的索引就是顶点的下标
DataType data[2];
}AdjList[MAXVertextNum];/*Adj为邻接表*/
/*图的定义*/
typedef struct GNode *ptrToGNode;
struct GNode{
//顶点数
int Nv;