P1491 集合位置

https://www.luogu.org/problem/P1491

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#include <cmath>
#define DU double
using namespace std;

const int MAXN=205;
const int MAXM=40050;
const int INF=1000000000;
int n,m,x[MAXN],y[MAXN],p[MAXN],ec;
DU dis[MAXN],ans;
struct cyq{
	int v,next;
	DU w;
}edge[MAXM];
int prev[MAXN];
bool ins[MAXN];

double num(int i,int j){
    return sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
}

void add(int u, int v,DU ww){	 
	edge[++ec].v = v;
	edge[ec].w = ww;
	edge[ec].next = p[u];
	p[u] = ec;
}

void spfa(int aa,int bb){
	for(int i=1;i<=n;i++) dis[i]=INF;
	memset(ins,0,sizeof(ins));
	queue <int > q;
	dis[1]=0;ins[1]=1; q.push(1);
	while(!q.empty()){
		int u=q.front();
		ins[u]=0;q.pop();
		for(int i=p[u];i;i=edge[i].next){
			int v=edge[i].v;
			DU va=edge[i].w;
			if(u==aa&&v==bb || v==bb&&u==aa) continue;
			if(dis[v]>dis[u]+va){
				if(aa==-1 && bb==-1)  prev[v]=u;
				dis[v]=dis[u]+va;
				if(ins[v]==0){ins[v]=1;q.push(v);}
			}
		}
	}
}

int main(){
	ans=INF;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
		scanf("%d%d",&x[i],&y[i]);
	int uuu,vvv;
	for(int i=1;i<=m;i++){
		scanf("%d%d",&uuu,&vvv);
		DU z=num(uuu,vvv);
		add(uuu,vvv,z);
		add(vvv,uuu,z);
	}
	spfa(-1,-1);
	for(int i=n;prev[i];i=prev[i]){
		spfa(prev[i],i);
		ans=min(ans,dis[n]);
	}
	if(ans==INF) printf("-1\n");
	else printf("%.2lf",ans);
	return 0;
}