POJ-2502 Subway(最短路)

POJ-2502

给出人和目标点的坐标，走路速度10km/h，地铁速度40km/h， 给出数条地铁线，相邻地铁间路径双向，求人到学校的最短时间

边权为时间，求最短路，地铁线不是直线注意，所以只能相邻地铁间连地铁边，其余各点间连走路的边

/*
求最短路，地铁线不是直线注意，所以只能相邻地铁间连边
*/
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>
#include <stack>
#include <cmath>
using namespace std;
typedef pair<int,int> PII;
const int MAXN=333;
const int MAXM=MAXN*MAXN/2;
const int INF=0x3f3f3f3f;
int n,m;
double pic[MAXN][MAXN],dist[MAXN];
inline double sqr(double a)
{
    return a*a;
}
stack<int> st;
vector<PII> vp;
int vis[MAXN],inq[MAXN];
double spfa(int s,int t)//s为源点，t为终点
{
    while(!st.empty())
        st.pop();
    for(int i=1;i<=n;i++)
        dist[i]=INF,vis[i]=0,inq[i]=0;
    dist[s]=0;
    st.push(s);
    inq[s]=1;
    while(!st.empty())
    {
        int fr=st.top();
        st.pop();
        inq[fr]=0;
        for(int v=1;v<=n;v++)
        {
            if(dist[v]>dist[fr]+pic[fr][v])
            {
                dist[v]=dist[fr]+pic[fr][v];
                if(inq[v])
                    continue;
                if(++vis[v]>=n)//有负环
                    return -1;
                st.push(v);
                inq[v]=1;
            }
        }
    }
    return dist[t];
}
double cal(int x1,int y1,int x2,int y2)
{
    return sqrt(sqr(x2-x1)+sqr(y2-y1))/1000;
}
int main()
{
    //freopen("in","r",stdin);
    int ta,tb,tc,td;
    scanf("%d%d%d%d",&ta,&tb,&tc,&td);
    vp.push_back(PII(ta,tb));
    vp.push_back(PII(tc,td));
    pic[1][2]=pic[2][1]=cal(ta,tb,tc,td)*6;
    while(~scanf("%d%d",&ta,&tb))
    {
        int st=vp.size();
        while(~ta||~tb)
        {
            if(vp.size()!=st)
                pic[vp.size()+1][vp.size()]=pic[vp.size()][vp.size()+1]=cal(ta,tb,vp.back().first,vp.back().second)*1.5;
            for(int i=st;i<vp.size()-1;i++)
                pic[vp.size()+1][i+1]=pic[i+1][vp.size()+1]=cal(ta,tb,vp[i].first,vp[i].second)*6;
            for(int i=0;i<st;i++)
                pic[vp.size()+1][i+1]=pic[i+1][vp.size()+1]=cal(ta,tb,vp[i].first,vp[i].second)*6;
            vp.push_back(PII(ta,tb));
            scanf("%d%d",&ta,&tb);
        }
    }
    n=vp.size();
    printf("%d\n",int(spfa(1,2)+0.5));
    return 0;
}