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 ...
随机推荐
- SQLyog使用,连接ubuntu虚拟机(Error No.2003)
1.为mysql设置远程访问权限 mysql> grant all PRIVILEGES on *.* to ‘账号’@’%’ identified by ‘密码′; mysql> flu ...
- Kinect插件使用
Kinect Scripts文件夹下所有managers(管理器)的用途: 这些在KinectScripts文件夹下的管理器都是组件,你可以根据你想实现的功能在项目中使用它. KinectManage ...
- .NET 实体转换辅助类
/// <summary> /// 实体转换辅助类 /// </summary> public class ModelConvertHelper<T> where ...
- 「ZOJ 1354」Extended Lights Out「高斯消元」
题意:给定一个\(5\times 6\)的棋盘的\(01\)状态,每次操作可以使它自己和周围四个格子状态取反,求如何操作,输出一个\(01\)矩阵 题解:这题可以通过枚举第一行的状态然后剩下递推来做, ...
- Redis源码阅读---连接建立
对于并发请求很高的生产环境,单个Redis满足不了性能要求,通常都会配置Redis集群来提高服务性能.3.0之后的Redis支持了集群模式. Redis官方提供的集群功能是无中心的,命令请求可以发送到 ...
- poj1811(pollard_rho模板)
题目链接: http://poj.org/problem?id=1811 题意: 判断一个数 n (2 <= n < 2^54)是否为质数, 是的话输出 "Prime" ...
- Eclipse中Spring插件的安装及使用
一.安装流程 1.Help——Install New Software——在Work With中添加地址http://dist.springsource.com/release/TOOLS/updat ...
- 老男孩Day6作业:计算器
作业需求: 1.实现加减乘除及拓号优先级解析 2.用户输入 1 - 2 * ( (60-30 +(-40/5) * (9-2*5/3 + 7 /3*99/4*2998 +10 * 568/14 )) ...
- 移动app整合个推进行消息推送
首先前端代码写好之后进行发行打包: 然后再进行发行打包: 然后登录个推官网: 测试: 点击推送,在手机端就可以获取到信息了. java代码测试: package com.cxy.bean; impor ...
- Cocoapds pod install时报错 :The sandbox is not sync with the Podfile.lock
解决方法简单:仅供其他小伙伴参考 删除项目工程本地文件夹中的xxx.workspace和Podfile.lock文件,然后重新pod install即可