Saving James Bond - Easy Version (25分)【C语言】二维数组实现

习题讲解视频

题目：

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.

输入格式

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.

输出格式

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

输入样例

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

输出样例

Yes

算法

算法描述

• 二维数组存储结点坐标
• 遍历每个连通集

代码实现

int main()
{	
	int N;
	scanf("%d%lf",&N,&D);
	int i,j;
	for(i=0;i<N;i++){
	    for(j=0;j<2;j++){
	        scanf("%d",&(Graph[i][j]));
	    }
	}
	ListComponent(N);
	return 0;
}
		

ListComponent：遍历每个连通集，当得到答案时暂停

void ListComponent(int N)
{
	int i,j;
	int x,y;
	int answer=-1;
	for(i=0;i<N;i++){
	    x=Graph[i][0];
	    y=Graph[i][1];
	    if(visited[i]==0&&JumpFirst(x,y)){
	        answer=DFS(i,N);
	        if(answer==YES)break;
	    }
	}
	if(answer==YES){
	    printf("Yes");
	}else{
	    printf("No");
	}
}

DFS：带有返回参数的递归，当得到答案时返回至最初

递归必须有边界值，在这里边界值为 0和YES

int DFS(int V,int N)
{
	int ret=0;
	visited[V]=1;
	if(IsSafe(V)){
	    ret=YES;
	}else{
	    int i;
	    for(i=0;i<N;i++){
	        if(visited[i]==0&&Jump(V,i)){
	            ret=DFS(i,N);
	            if(ret==YES)break;
	        }
	    }
	}
	return ret;
}		

其他函数：JumpFirst（寻找第一跳的邻接点）、IsSafe（判断现在是否可以上岸）、Jump（寻找普通结点的邻接点）

#define MAXVERTEXNUM 100 
#define YES 1
double diameter=15;
double D;
double distination=50;
int Graph[MAXVERTEXNUM][2];
int visited[MAXVERTEXNUM];
int JumpFirst(double x,double y)
{
	double distance=pow(x,2.0)+pow(y,2.0);
	if(distance<=pow(diameter/2.0+D,2.0)){
	    return 1;
	}else{
	    return 0;
	}
}
int IsSafe(int V)
{
	double x=Graph[V][0];
	double y=Graph[V][1];
	x=(x<0?-x:x);
	y=(y<0?-y:y);
	if(x+D>=distination||y+D>=distination){
	    return 1;
	}else{
	    return 0;
	}
}
int Jump(int V,int W)
{
	double x1=Graph[V][0];
	double y1=Graph[V][1];
	double x2=Graph[W][0];
	double y2=Graph[W][1];
	double distance=pow(x1-x2,2.0)+pow(y1-y2,2.0);
	if(distance<=pow(D,2.0)){
	    return 1;
	}else{
	    return 0;
	}
}