06-图2 Saving James Bond - Easy Version

题目来源:http://pta.patest.cn/pta/test/18/exam/4/question/625

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
/*
能够跳上的鳄鱼相当于相邻的点,第一步比较特殊单独处理
每次DFS代表一种拯救方案,只要存在一种方案即可获救
*/
#include <cstdio>
#include <cmath>
#include <cstdlib>

const double ISLAND_RADIUS = 15.0 / 2;      //孤岛半径
const double SQUARE_SIZE = 100.0;           //湖(正方形)的大小
const int N = 110;                          //鳄鱼(点)的最大数

typedef struct Point
{
    double x, y;
} Position;

Position P[N];
bool Visited[N];
int n;
double d;

void Save007();
bool DFS(int V);
bool FirstJump(int V);
bool Jump(int V1, int V2);
bool IsSave(int V);

int main()
{
    scanf("%d%lf", &n, &d);
    for (int i = 0; i < n; i++)
        scanf("%lf%lf", &(P[i].x), &(P[i].y));

    for (int i = 0; i < n; i++)
        Visited[i] = false;
    Save007();

    return 0;
}

void Save007()
{
    bool IsSave = false;
    for (int i = 0; i < n; i++)
    {
        if (!Visited[i] && FirstJump(i))
        {
            IsSave = DFS(i);
            if (IsSave)
                break;
        }
    }
    if (IsSave)
        printf("Yes\n");
    else
        printf("No\n");
}

bool DFS(int V)
{
    Visited[V] = true;
    bool answer = false;
    if (IsSave(V))
        return true;
    for (int i = 0; i < n; i++)
    {
        if (!Visited[i] && Jump(V, i))
            answer = DFS(i);
        if (answer)
            break;
    }
    return answer;
}

bool IsSave(int V)
{
    return (abs(P[V].x) >= 50 - d)
            || (abs(P[V].y) >= 50 - d);
}

bool FirstJump(int V)
{
    return sqrt(P[V].x * P[V].x + P[V].y * P[V].y)
            <= d + ISLAND_RADIUS;
}

bool Jump(int V1, int V2)
{
    return sqrt((P[V1].x - P[V2].x) * (P[V1].x - P[V2].x) +
                (P[V1].y - P[V2].y) * (P[V1].y - P[V2].y))
            <= d;
}

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏码匠的流水账

聊聊hystrix的execution.isolation.semaphore.maxConcurrentRequests属性

本文主要研究一下hystrix的execution.isolation.semaphore.maxConcurrentRequests属性

10410
来自专栏码匠的流水账

聊聊flink的CsvReader

flink-java-1.6.2-sources.jar!/org/apache/flink/api/java/ExecutionEnvironment.jav...

25320
来自专栏软件开发 -- 分享 互助 成长

CRC校验码

循环冗余校验码(CRC)的基本原理是:在K位信息码后再拼接R位的校验码,整个编码长度为N位,因此,这种编码也叫(N,K)码。对于一个给定的(N,K)码,可以证明...

32360
来自专栏码匠的流水账

聊聊springboot1.x及2.x的JvmGcMetrics的区别

本文主要研究一下springboot1.x及2.x的JvmGcMetrics的区别

37310
来自专栏小樱的经验随笔

HDU 4256 The Famous Clock

The Famous Clock Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/3...

28060
来自专栏西枫里博客

ASP格式化日期函数

45020
来自专栏码匠的流水账

聊聊HystrixEventStream

hystrix-core-1.5.12-sources.jar!/com/netflix/hystrix/metric/HystrixEventStream.j...

9110
来自专栏函数式编程语言及工具

SDP(7):Cassandra- Cassandra-Engine:Streaming

  akka在alpakka工具包里提供了对cassandra数据库的streaming功能。简单来讲就是用一个CQL-statement读取cassandra...

35060
来自专栏函数式编程语言及工具

PICE(3):CassandraStreaming - gRPC-CQL Service

  在上一篇博文里我们介绍了通过gRPC实现JDBC数据库的streaming,这篇我们介绍关于cassandra的streaming实现方式。如果我们需要从一...

20400
来自专栏码匠的流水账

聊聊storm的reportError

storm-2.0.0/storm-client/src/jvm/org/apache/storm/task/IErrorReporter.java

17430

扫码关注云+社区

领取腾讯云代金券