HDU 2112 HDU Today【spfa】

点击打开链接

题解：   单源最短路  跑spfa ，模板题。

#include<iostream>
#include<string>
#include<stdio.h>
#include<string.h>
#include<map>
#include<queue>
#include<algorithm>
using namespace std;
const int maxn=221;
const int maxm=20210;
const int inf = 0xffffff;
int n,q,val,cnt,len[maxm];
char st[33],ed[33],s1[maxm][33],s2[maxm][33];
map<string,int>m;
int head[maxn];
int dis[maxn];
int v[maxm];
struct node{
    int w,to,nxt;
}edge[maxm];
void addedge(int x,int y,int val){
    edge[++cnt].to=y;
    edge[cnt].w=val;
    edge[cnt].nxt=head[x];
    head[x]=cnt;
}
void spfa(int s)
{
    queue <int> que;
    for(int i=1;i<=q;i++)dis[i]=inf;
    memset(v,0,sizeof(v));

    que.push(s);
    dis[s]=0;
    while(!que.empty())
    {
        int u=que.front();
        que.pop();
        v[u]=0;
        for(int i=head[u];i!=-1;i=edge[i].nxt)
        {
            int vv=edge[i].to;
            if(dis[vv]>dis[u]+edge[i].w)
            {
                dis[vv]=dis[u]+edge[i].w;
                if(!v[vv])
                {
                    v[vv]=true;
                    que.push(vv);
                }
            }
        }
    }
}
int main(){

    while(scanf("%d",&n)){
        if(n==-1) break;
        memset(head,-1,sizeof(head));
        m.clear();cnt=0;q=1;
        scanf("%s %s",st,ed);
        for(int i=1;i<=n;++i){
            scanf("%s %s %d",s1[i],s2[i],&len[i]);
            if(!m[s1[i]]) m[s1[i]]=q++;
            if(!m[s2[i]]) m[s2[i]]=q++;
        }
        for(int i=1;i<=n;++i){
            addedge(m[s1[i]],m[s2[i]],len[i]);
            addedge(m[s2[i]],m[s1[i]],len[i]);
        }
        spfa(m[st]);
        int ans=dis[m[ed]];
        if(string(st)==string (ed)) {printf("0\n");continue;}
        if(ans==inf||ans==0) ans=-1;
        else ans=dis[m[ed]];
        printf("%d\n",ans);
    }

    return 0;
}