pat06-图4. Saving James Bond - Hard Version (30)
06-图4. Saving James Bond - Hard Version (30)
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 a shortest path to reach one of the banks. The length of a path is the number of jumps that James has to make.
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, if James can escape, output in one line the minimum number of jumps he must make. Then starting from the next line, output the position (x, y) of each crocodile on the path, each pair in one line, from the island to the bank. If it is impossible for James to escape that way, simply give him 0 as the number of jumps. If there are many shortest paths, just output the one with the minimum first jump, which is guaranteed to be unique.
Sample Input 1:
17 15
10 -21
10 21
-40 10
30 -50
20 40
35 10
0 -10
-25 22
40 -40
-30 30
-10 22
0 11
25 21
25 10
10 10
10 35
-30 10
Sample Output 1:
4
0 11
10 21
10 35
Sample Input 2:
4 13
-12 12
12 12
-12 -12
12 -12
Sample Output 2:
0
本题测试点5是从小岛范围内可以直接跳到岸边。
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<queue>
#include<stack>
#include<cmath>
#include<string>
using namespace std;
#define R 7.5
struct point
{
int x,y,last;
bool vis;
point()
{
vis=false;
}
point(int num)
{
vis=false;
last=num;
}
};
point p[];
queue<int> q;
double getdis(int x1,int y1,int x2,int y2)
{
int x=x1-x2;
int y=y1-y2;
return sqrt(x*x+y*y);
}
int abs(int a)
{
return a>?a:-a;
}
int main()
{
//freopen("D:\\INPUT.txt","r",stdin);
int n,J;
scanf("%d %d",&n,&J);
int i,level=,last=-,tail;
for(i=; i<n; i++)
{
scanf("%d %d",&p[i].x,&p[i].y);
p[i].last=i;
}
if(R+J>=){//小岛内直接跳到岸边
printf("1\n");
return ;
}
for(i=; i<n; i++)
{
if(getdis(,,p[i].x,p[i].y)<=R){//无效点
p[i].vis=true;
continue;
}
if(R+J>=getdis(,,p[i].x,p[i].y))
{
q.push(i);
p[i].vis=true;
last=i;
if(abs(p[i].x)+J>=||abs(p[i].y)+J>=)
{
printf("2\n");
printf("%d %d\n",p[i].x,p[i].y);
return ;
}
}
}
if(last==-){//一开始就没有可以跳的点
printf("0\n");
return ;
}
int cur,firstj=J+,fitp,count=;
while(!q.empty())
{
cur=q.front();
q.pop();
for(i=; i<n; i++)
{
if(!p[i].vis&&J>=getdis(p[cur].x,p[cur].y,p[i].x,p[i].y))
{//没有入队并且符合要求
p[i].vis=true;
q.push(i);//入队
p[i].last=cur;
tail=i;
if(abs(p[i].x)+J>=||abs(p[i].y)+J>=)
{
int now=i;
while(p[now].last!=now){
now=p[now].last;
}
if(getdis(,,p[now].x,p[now].y)-R<firstj){
firstj=getdis(,,p[now].x,p[now].y)-R;
fitp=i;
count=level+;
}
}
}
}
if(cur==last){
level++;//向下一层进发
last=tail;
}
if(level==count){
break;
}
}
stack<int> s;
if(count)
{
count++;
while(p[fitp].last!=fitp)
{
s.push(fitp);
fitp=p[fitp].last;
}
s.push(fitp);
}
printf("%d\n",count);
while(!s.empty())
{
printf("%d %d\n",p[s.top()].x,p[s.top()].y);
s.pop();
}
return ;
}
pat06-图4. Saving James Bond - Hard Version (30)的更多相关文章
- PTA 07-图5 Saving James Bond - Hard Version (30分)
07-图5 Saving James Bond - Hard Version (30分) This time let us consider the situation in the movie ...
- 07-图5 Saving James Bond - Hard Version (30 分)
This time let us consider the situation in the movie "Live and Let Die" in which James Bon ...
- Saving James Bond - Easy Version (MOOC)
06-图2 Saving James Bond - Easy Version (25 分) This time let us consider the situation in the movie & ...
- pat05-图2. Saving James Bond - Easy Version (25)
05-图2. Saving James Bond - Easy Version (25) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 8000 B 判题程序 Standard 作 ...
- Saving James Bond - Hard Version
07-图5 Saving James Bond - Hard Version(30 分) This time let us consider the situation in the movie &q ...
- Saving James Bond - Easy Version 原创 2017年11月23日 13:07:33
06-图2 Saving James Bond - Easy Version(25 分) This time let us consider the situation in the movie &q ...
- PAT Saving James Bond - Easy Version
Saving James Bond - Easy Version This time let us consider the situation in the movie "Live and ...
- 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 ...
- PTA 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 Bon ...
随机推荐
- 海量推荐系统:mapreduce的方法
1. Motivation 2. MapReduce MapReduce是一种数据密集型并行计算框架. 待处理数据以"块"为单位存储在集群机器文件系统中(HDFS),并以(key, ...
- [转]Marshaling a SAFEARRAY of Managed Structures by P/Invoke Part 4.
1. Introduction. 1.1 In parts 1 through 3 of this series of articles, I have thoroughly discussed th ...
- nodejs nodejs的操作
nodejs的操作 由于版本造成的命令不能正常安装,请参考五问题 一.概念: 参考百度百科: http://baike.baidu.com/link?url=aUrGlI8Sf20M_YGk8mh-- ...
- docker常用命令行集锦
对工作中用到的docker命令行进行一个汇总,方便以后的命令行查询,同时也为了加强记忆,会把工作中用到的命令,持续更新上 1.查看私有仓库都有哪些镜像 curl -X GET http://10.27 ...
- 如何在Linux上使用x2go设置远程桌面
Until ACS supports Spice, if ever,you're better off with "on-VM" softare such RDP for Wind ...
- Django之表单form
在登录系统以及需要上传填入的信息时候,用的最多就是表单系统,例如像下面的这种格式 <form action="/form1/" method="post" ...
- position用法
fixed的用法 <!DOCTYPE html> <html lang="en"> <head> <meta charset=" ...
- 【bzoj2434】: [Noi2011]阿狸的打字机 字符串-AC自动机-BIT
[bzoj2434]: [Noi2011]阿狸的打字机 x串在y串上的匹配次数就是y在自动机所有节点上能够通过fail走到x最后一个节点的个数 (就是y串任意一个前缀的后缀能匹配到x的个数)和[bzo ...
- web安全-密码安全
web安全-密码安全 1.密码的作用 2.储存 3.传输 4.替代方案 5.生物特征密码 (指纹 人脸) 6.密码单向变换彩虹表 组合 密码变换次数越多越安全 加密成本几乎不变(生成密码速度慢一点) ...
- (Python OpenGL)【 0】关于VAO和VBO以及OpenGL新特性
(Python OpenGL)关于新版OpenGL需要了解的: 随着OpenGL状态和固定管线模式的移除,我们不在用任何glEnable函数调用,而且也不会有glVertex.glColor等函数调用 ...