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 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 12Sample Output 1:
YesSample Input 2:
4 13 -12 12 12 12 -12 -12 12 -12Sample Output 2:
No
以小岛中心为原点,小岛半径为7.5,对007的第一跳要做特殊处理;对能到达的坐标点进行DFS搜索,当满足条件可以成功跳出时,输出Yes;否则继续对其它坐标点进行搜索;若都不能成功跳出,最后输出No。
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
#define MinLen 42.5
struct Point{
int x;
int y;
bool visited;
};
Point O;
int N,D;
vector<Point> s;
double Distance(Point a,Point b)
{
return sqrt(pow((a.x-b.x),2)+pow((a.y-b.y),2));
}
void Search(int i)
{
int j;
s[i].visited=true;
if((50-abs(s[i].x))<=D || (50-abs(s[i].y))<=D){
cout<<"Yes"<<endl;
exit(0);
}
for(j=0;j<N;j++){
if(!s[j].visited && Distance(s[i],s[j])<=D)
Search(j);
}
}
int main()
{
int i;
Point p;
vector<int> Firstjump;
cin>>N>>D;
for(i=0;i<N;i++){
cin>>p.x>>p.y;
p.visited=false;
s.push_back(p);
}
if(D>=MinLen){
cout<<"Yes"<<endl;
return 0;
}
for(i=0;i<N;i++){
if(Distance(s[i],O) <= (D+7.5))
Firstjump.push_back(i);
}
if(Firstjump.empty()){
cout<<"No"<<endl;
return 0;
}
for(i=0;i<Firstjump.size();i++)
Search(Firstjump[i]);
cout<<"No"<<endl;
return 0;
}