这道题不一个个删边真的过不去吗？

On line 1 column 1, read 659.0, expected 1081.. 得分0

By the way，测试点 #3 的最短路是473.9，也就是说如果有一条路径长度是659.0，那么就是测试数据的问题了。

#include<bits/stdc++.h>
using namespace std;
const int maxn=207;
const int INF=999999999;
typedef pair<double,int> T;
struct edge
{
    int to;
    double dist;
};
struct point
{
    int x,y;
}points[maxn];
vector<edge>G[maxn];
int n,m;
double dist(point a,point b)
{
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
void dijkstra()
{
    double dis_1st[maxn];fill(dis_1st+1,dis_1st+n+1,INF);dis_1st[1]=0;
    double dis_2nd[maxn];fill(dis_2nd+1,dis_2nd+n+1,INF);dis_2nd[1]=0;
    priority_queue<T,vector<T>,greater<T> >team;team.push(T(0,1));
    while(!team.empty())
    {
        T q=team.top();team.pop();
        int v=q.second;double d=q.first;
        if (d>dis_2nd[v]) continue;//如果当前点连次短路都不是，干掉
        for(int i=0;i<G[v].size();i++)
        {
            edge e=G[v][i];
            if (dis_1st[e.to]>d+e.dist)//更新最短距离
            {
                dis_2nd[e.to]=dis_1st[e.to];
                dis_1st[e.to]=d+e.dist;
                team.push(T(dis_1st[e.to], e.to));
            }
            if (dis_2nd[e.to]>d+e.dist&&dis_1st[e.to]<d+e.dist)//更新次短距离
            {
                dis_2nd[e.to]=d+e.dist;
                team.push(T(dis_2nd[e.to], e.to));
            }
        }
    }
    if (dis_2nd[n]!=INF) printf("%.2f",dis_2nd[n]);
    else printf("-1");
}
int main()
{
    scanf("%d %d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        int x,y;
        scanf("%d %d",&x,&y);
        points[i]=(point){x,y};
    }
    for(int i=1;i<=m;i++)
    {
        int u,v;
        scanf("%d %d",&u,&v);
        G[u].push_back((edge){v,dist(points[u],points[v])});
        G[v].push_back((edge){u,dist(points[u],points[v])});
    }
    dijkstra();
    return 0;
}