【Poj】-2253-Frogger(最短路,变化)
来源:互联网 发布:ar2048n 网络打印设置 编辑:程序博客网 时间:2024/05/22 04:39
Frogger
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 37629 Accepted: 12119
Description
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.
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
20 03 4317 419 418 50
Sample Output
Scenario #1Frog Distance = 5.000Scenario #2Frog Distance = 1.414
#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>using namespace std;#define CLR(a,b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3fint n;int vis[210];double dis[210];double dp[210][210];void init() { for(int i=1;i<210;i++) { dis[i]=INF; vis[i]=0; for(int j=1;j<210;j++) dp[i][j]=dp[j][i]=INF; } } struct node{double x,y;}data[210];double check(node a,node b){return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));}void dijkstra(){dis[1]=0;int i;for(i=1;i<=n;i++)dis[i]=dp[1][i];while(1){int v=-1;for(i=1;i<=n;i++)if(!vis[i]&&(v==-1||dis[i]<dis[v]))v=i;if(v==-1)break;vis[v]=1;for(i=1;i<=n;i++){//if(!vis[i])dis[i]=min(max(dis[v],dp[v][i]),dis[i]);}}}int main(){int ca=1;while(~scanf("%d",&n)&&n){init();for(int i=1;i<=n;i++)scanf("%lf %lf",&data[i].x,&data[i].y);for(int i=1;i<n;i++){for(int j=i+1;j<=n;j++){double c=check(data[i],data[j]);dp[i][j]=dp[j][i]=c; }}dijkstra();printf("Scenario #%d\nFrog Distance = %.3lf\n\n",ca++,dis[2]);}return 0 ;}
0 0
- 【Poj】-2253-Frogger(最短路,变化)
- poj 2253 Frogger (最短路Floyd)
- POJ 2253 Frogger(最短路 Floyd)
- POJ 2253 - Frogger(最短路`dijkstra)
- POJ 2253 Frogger最短路(floyd)
- POJ 2253 Frogger(最短路变形)
- poj 2253 Frogger (dijkstra最短路)
- POJ-2253 Frogger (最短路)
- POJ 2253 Frogger(最短路/迪杰斯特拉)
- POJ 2253Frogger(最短路floyd)
- [POJ 2253] Frogger [最短路]
- POJ 2253 Frogger 最短路
- poj-2253-Frogger-最短路
- poj 2253 Frogger【最短路】
- POJ 2253 Frogger 最短路
- POJ 2253 Frogger(最短路)
- POJ-----2253---Frogger---最短路
- POJ 2253 Frogger 最短路
- Bootstrap入门基础(三)
- javascript的window.ActiveXObject对象,区别浏览器的方法
- 第七章.复用类 初始化和类的加载 总结
- 拍照上传、相册获取逻辑实现
- POJ 1679 The Unique MST 次小生成树
- 【Poj】-2253-Frogger(最短路,变化)
- 332. Reconstruct Itinerary(重要)
- 【HDU 2063 过山车】
- 数据结构实验之排序二:交换排序
- 前端-笔试面试知识点
- hdu5810Balls and Boxes+数学期望
- 英语信件常用句式
- HDU1166:敌兵布阵(树状数组)
- set和get方法