Frogger
来源:互联网 发布:java的可变参数 编辑:程序博客网 时间:2024/06/05 03:16
Frogger(最短路的变形)
Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists’ sunscreen, he wants to avoid swimming and instead reach her by jumping.
Unfortunately Fiona’s stone is out of his jump range. Therefore Freddy considers to use other stones as intermediate stops and reach her by a sequence of several small jumps.
To execute a given sequence of jumps, a frog’s jump range obviously must be at least as long as the longest jump occuring in the sequence.
The frog distance (humans also call it minimax distance) between two stones therefore is defined as the minimum necessary jump range over all possible paths between the two stones.
You are given the coordinates of Freddy’s stone, Fiona’s stone and all other stones in the lake. Your job is to compute the frog distance between Freddy’s and Fiona’s stone.
Input
The input will contain one or more test cases. The first line of each test case will contain the number of stones n (2<=n<=200). The next n lines each contain two integers xi,yi (0 <= xi,yi <= 1000) representing the coordinates of stone #i. Stone #1 is Freddy’s stone, stone #2 is Fiona’s stone, the other n-2 stones are unoccupied. There’s a blank line following each test case. Input is terminated by a value of zero (0) for n.
Output
For each test case, print a line saying “Scenario #x” and a line saying “Frog Distance = y” where x is replaced by the test case number (they are numbered from 1) and y is replaced by the appropriate real number, printed to three decimals. Put a blank line after each test case, even after the last one.
Sample Input
2
0 0
3 4
3
17 4
19 4
18 5
0
Sample Output
Scenario #1
Frog Distance = 5.000
Scenario #2
Frog Distance = 1.414
解题报告
最短路有很多算法,下面我就用Bellman-Ford了。
注意输出%0.3lf WA了!说明在POJ sqrt()的返回值是float型。这与编译器的版本有关。
下图是C++11的std::sqrt 头文件< cmath>
//372kb 0ms#include<stdio.h>#include<math.h>#include<queue>#include<algorithm>#define MAX_N 202#define INF 0x3f3f3fusing namespace std;struct coord{int x,y;}cs[MAX_N];int N;int d[MAX_N];int dis(int a,int b){ return (cs[a].x-cs[b].x)*(cs[a].x-cs[b].x)+(cs[a].y-cs[b].y)*(cs[a].y-cs[b].y);}void bellman_ford(int s){ fill(d,d+N,INF); d[s]=0; while(true){ bool update=false; for(int i=0;i<N;i++) if(d[i]!=INF) for(int j=0;j<N;j++){ if(j==i) continue; int tmp=max(d[i],dis(i,j)); if(d[j]>tmp){ d[j]=tmp; update=true; } } if(!update) break; }}int main(){ int t=1; while(~scanf("%d",&N)&&N){ for(int i=0;i<N;i++) scanf("%d%d",&cs[i].x,&cs[i].y); bellman_ford(0); printf("Scenario #%d\nFrog Distance = %0.3f\n\n",t++,sqrt(d[1])); } return 0;}
- Frogger
- Frogger
- Frogger
- Frogger
- Frogger
- Frogger
- Frogger
- Frogger
- Frogger
- Frogger
- Frogger
- Frogger
- Frogger
- Frogger
- Frogger
- Frogger
- PKU2253 Frogger
- pku2253 Frogger
- 191. Number of 1 Bits
- nodejs开发微博网站(二)--mongoDB数据库
- 3D游戏引擎系列二
- [5]Linux时间编程
- 捕捉Java的异常Stacktrace
- Frogger
- 关于HTTPS一篇文章就够了
- 洛谷 1226_取余运算||快速幂_快速幂
- Mac 安装opencv(for java)
- LoRaWAN介绍20 中国地区
- HTML5新增的标签和属性归纳
- 深度学习研究和进展
- linux学习-day01
- Windows PE 背景知识