poj 2253 Frogger [dijkstra]
2015-02-13 13:16
337 查看
传送门:http://poj.org/problem?id=2253
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
思路:最短路or最小生成树,松弛过程中,取点时收入集合边的最大值,即Answer;
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#define INF 0x3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long LL;
const int N=1002;
int x
,y
;
double gra
;
double dist
;
int vis
;
double ans;
void dijkstra(int n)
{
for(int i=1;i<=n;i++)
{
dist[i]=INF;
vis[i]=0;
}
dist[1]=0;
for(int i=1;i<=n;i++)
{
int pos=-1;
double minn=INF;
for(int j=1;j<=n;j++)
{
if(!vis[j]&&dist[j]<minn)
{
minn=dist[j];
pos=j;
}
}
if(ans<minn)
ans=minn;
if(pos==2) break;
vis[pos]=1;
for(int j=1;j<=n;j++)
{
if(!vis[j]&&dist[j]>gra[pos][j])
{
dist[j]=gra[pos][j];
}
}
}
}
int main()
{
int n;
int cas=0;
while(scanf("%d",&n)==1)
{
if(n==0) break;
for(int i=1;i<=n;i++)
{
scanf("%d%d",x+i,y+i);
}
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
gra[i][j]=gra[j][i]=(double)sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
}
}
ans=0;
dijkstra(n);
printf("Scenario #%d\nFrog Distance = %.3f\n\n",++cas,ans);
}
return 0;
}
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
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
思路:最短路or最小生成树,松弛过程中,取点时收入集合边的最大值,即Answer;
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#define INF 0x3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long LL;
const int N=1002;
int x
,y
;
double gra
;
double dist
;
int vis
;
double ans;
void dijkstra(int n)
{
for(int i=1;i<=n;i++)
{
dist[i]=INF;
vis[i]=0;
}
dist[1]=0;
for(int i=1;i<=n;i++)
{
int pos=-1;
double minn=INF;
for(int j=1;j<=n;j++)
{
if(!vis[j]&&dist[j]<minn)
{
minn=dist[j];
pos=j;
}
}
if(ans<minn)
ans=minn;
if(pos==2) break;
vis[pos]=1;
for(int j=1;j<=n;j++)
{
if(!vis[j]&&dist[j]>gra[pos][j])
{
dist[j]=gra[pos][j];
}
}
}
}
int main()
{
int n;
int cas=0;
while(scanf("%d",&n)==1)
{
if(n==0) break;
for(int i=1;i<=n;i++)
{
scanf("%d%d",x+i,y+i);
}
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
gra[i][j]=gra[j][i]=(double)sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
}
}
ans=0;
dijkstra(n);
printf("Scenario #%d\nFrog Distance = %.3f\n\n",++cas,ans);
}
return 0;
}
相关文章推荐
- poj 2253 Frogger(变式Dijkstra)
- POJ 1797 Heavy Transportation&&POJ 2253 Frogger 最短路 dijkstra变形
- poj-2253 Frogger(dijkstra变形)
- POJ - 2253 Frogger(Dijkstra)
- POJ 1797 Heavy Transportation&&POJ 2253 Frogger 最短路 dijkstra变形
- POJ - 2253 - Frogger (Dijkstra)
- [POJ 2253][最短路dijkstra]Frogger
- (POJ 2253)Frogger 求所有可达路径中的最大边的最小值 dijkstra || floyd 变形
- POJ 2253 Frogger 最短路-Dijkstra的变形形式
- poj 2253 Frogger(dijkstra)
- POJ 2253 Frogger (求每条路径中最大值的最小值,Dijkstra变形)
- POJ 2253 Frogger (求每条路径中最大值的最小值,Dijkstra变形)
- POJ 2253 ——Frogger——————【最短路、Dijkstra、最长边最小化】
- POJ 2253 Frogger dijkstra 变形
- Poj_2253 Frogger(最短路-SPFA+Dijkstra)
- POJ 2253 Frogger(dijkstra变形)
- POJ-2253 Frogger(Dijkstra)(Floyd)
- POJ 2253 Frogger 最短路-Dijkstra的变形形式
- (简单) POJ 2253 Frogger,Dijkstra。
- poj 2253 Frogger(dijkstra变形)