呜呜┭┮﹏┭┮本蒟蒻真的拜托各位大佬了orz

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<iomanip>
#define M 10025
double x[M];
double y[M];
bool visst[M];
double st[M];
int val[M][M];
bool vis[M][M];
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
	int n;
	int u,v;
	int flag=0;
	double uDr,uRr;
	cin>>uDr>>uRr;
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>x[i]>>y[i];
	while(cin>>u>>v){
		if(u!=0&&v!=0) break;
		int h,w;
		w=x[u]-x[v];
		h=y[u]-y[v];
	    vis[u][v]=vis[v][u]=true;
		val[u][v]=val[v][u]=uRr*sqrt(w*w+h*h);
	}
	int sx,sy,ex,ey;
	cin>>sx>>sy>>ex>>ey;
	x[0]=sx;y[0]=sy;
	x[n+1]=ex;y[n+1]=ey;
	for(int i=0;i<=n+1;i++)
	  for(int j=0;j<=i;j++)
	  {
	  	int h,w;
		w=x[i]-x[j];
		h=y[i]-y[j];
	  	if(!vis[i][j])
	  	  val[i][j]=val[j][i]=uDr*sqrt(w*w+h*h);
	  }
	memset(st,0x7f,sizeof(st));
	st[0]=0;
	for(int i=0;i<=n+1;i++){
		int t;
		double minn=1e6;
		for(int j=0;j<=n+1;j++)
		if(!visst[t]&&st[j]<minn){
			flag=1;
			minn=st[j];
			t=j;
		}
		if(flag==0) break;
		visst[t]=true;
		for(int j=0;j<=n+1;j++)
		  if(st[j]>st[t]+val[t][j]) st[j]=st[t]+val[t][j];
	}
	cout<<fixed<<setprecision(4)<<st[n+1];
	return 0;
}

感激不尽