[USACO2.4]Bessie Come Home spfa

传送门： 原题在这里

没啥好说的，跑个最短路即可

#include<iostream>
#include<queue>
#include<cstdio>
#include<cstring>
#define inf 0x3f3f3f3f
using namespace std;

queue<int> q;
int nextt[20100],head[20100],v[20100],c[20100],dist[20100],f[20100],visit[20100];
int tot=0,ans=inf,m;
char cur;

void add_edge(int x,int y,int z){v[++tot]=y;c[tot]=z;nextt[tot]=head[x];head[x]=tot;}
int trans(char c)
{
    int ret=0;
    if (c>='a'&&c<='z') return ret=c-'a';
    if (c>='A'&&c<='Z') return ret=c-'A'+26;
}
void spfa(int o)
{
    memset(dist,inf,sizeof(dist));
    memset(visit,0,sizeof(visit));
    dist[o]=0;visit[o]=1;q.push(o);
    while(!q.empty())
    {
        int x=q.front();q.pop();visit[x]=0;
        for (int i=head[x];i;i=nextt[i])
        {
            int y=v[i];
            if (dist[y]>dist[x]+c[i])
            {
                dist[y]=dist[x]+c[i];
                if (!visit[y]) visit[y]=1,q.push(y);
            }
        }
    }
}


int main()
{
    memset(f,0,sizeof(f));
    scanf("%d",&m);
    for (int i=0;i<m;i++)
    {
        char c1,c2;int z,x,y;
        scanf(" %c %c %d",&c1,&c2,&z);
        x=trans(c1);y=trans(c2);
        f[x]=1;f[y]=1;
        add_edge(x,y,z);add_edge(y,x,z);
    }
    for (int i=26;i<51;i++)
        if (f[i])
        {
            spfa(i);
            if (dist[trans('Z')]<ans)
            {
                ans=dist[trans('Z')];
                cur=i;
            }
        }
    cur+=-26+'A';
    printf("%c %d\n",cur,ans);
    return 0;
}