poj 2253 Frogger
2014-09-17 17:13
369 查看
Frogger
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.
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
Sample Output
这题的题解点击打开链接可以参考,就是最大值最小化。当然也可以用floyd,不过kruskal或者prim算法也是可以的,建完最小生成树后一遍dfs即可得到。
代码:
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
int x[210],y[210];
double adj[210][210];
const double inf=1<<30;
double dis(int i,int j){
return sqrt(double(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
}
int main()
{
int n,cas=1;
while(scanf("%d",&n),n){
for(int i=0;i<n;i++)
scanf("%d%d",x+i,y+i);
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++)
adj[i][j]=adj[j][i]=dis(i,j);
for(int i=0;i<n;i++) adj[i][i]=inf;
for(int k=0;k<n;k++)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
adj[i][j]=min(adj[i][j],max(adj[i][k],adj[k][j]));
printf("Scenario #%d\nFrog Distance = %.3f\n\n",cas++,adj[0][1]);
}
return 0;
}
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 26256 | Accepted: 8549 |
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
这题的题解点击打开链接可以参考,就是最大值最小化。当然也可以用floyd,不过kruskal或者prim算法也是可以的,建完最小生成树后一遍dfs即可得到。
代码:
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
int x[210],y[210];
double adj[210][210];
const double inf=1<<30;
double dis(int i,int j){
return sqrt(double(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
}
int main()
{
int n,cas=1;
while(scanf("%d",&n),n){
for(int i=0;i<n;i++)
scanf("%d%d",x+i,y+i);
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++)
adj[i][j]=adj[j][i]=dis(i,j);
for(int i=0;i<n;i++) adj[i][i]=inf;
for(int k=0;k<n;k++)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
adj[i][j]=min(adj[i][j],max(adj[i][k],adj[k][j]));
printf("Scenario #%d\nFrog Distance = %.3f\n\n",cas++,adj[0][1]);
}
return 0;
}
相关文章推荐
- POJ-2253-Frogger(弗洛伊德 迪杰斯特拉)
- poj 2253 Frogger
- POJ 2253 Frogger
- poj2253~Frogger(最短路floyd)
- POJ 2253 Frogger(青蛙跳石头)
- poj 2253 Frogger 【dijkstra】
- POJ 2253 Frogger(Dijkstra变形)
- POJ 2253 - Frogger (floyd)
- Poj 2253 Frogger(floyd的变形)
- POJ 2253 Frogger (dijkstra变形)
- POJ-----2253---Frogger---最短路
- poj 2253 Frogger
- poj 2253:Frogger
- B - Frogger POJ - 2253
- poj-2253 Frogger
- POJ 2253 Frogger
- POJ 2253 Frogger
- poj2253 - Frogger
- POJ 2253 Frogger【最短路变形——路径上最小的最大权】
- POJ 2253 Frogger(最小最大距离)