#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<math.h>
using namespace std;
queue<int> q;
double m[209][209];
int p[209][500];
int a[209][2];
int num[209];
double dis[209];
int flag[209];
void spfa()
{
memset(dis,0x7f,sizeof(dis));
dis[1]=0;
memset(flag,0,sizeof(flag));
q.push(1);
flag[1]=1;
while(q.empty()==0)
{
int u=q.front();
flag[u]=0;
q.pop();
for(int i=1;i<=num[u];i++)
{
double ppp;
if(dis[u]>m[u][p[u][i]])
ppp=dis[u];
else ppp=m[u][p[u][i]];
if(dis[p[u][i]]>ppp)
{
dis[p[u][i]]=ppp;
if(flag[p[u][i]]==0)
{
flag[p[u][i]]=1;
q.push(p[u][i]);
}
}
}
}
}
int main()
{
int n;
int cmt=0;
while(scanf("%d",&n)!=EOF)
{
memset(m,0,sizeof(m));
memset(num,0,sizeof(num));
memset(p,0,sizeof(p));
memset(a,0,sizeof(a));
if(n==0)return 0;
for(int i=1;i<=n;i++)
scanf("%d%d",&a[i][0],&a[i][1]);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
m[i][j]=sqrt((double)(a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(double)(a[i][1]-a[j][1])*(a[i][1]-a[j][1]));
p[i][++num[i]]=j;
p[j][++num[j]]=i;
}
spfa();
printf("Scenario #%d\n",++cmt);
printf("Frog Distance = %.3lf\n",dis[2]);
}
return 0;
}
frogger
最新推荐文章于 2022-01-22 09:07:19 发布