洛谷P2984 [USACO10FEB]Chocolate Giving S（spfa）

原题链接
直接spfa

#include <iostream>
#include <cstring>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <cstdio>
#include <stdio.h>
#include<queue>
#include<math.h>
#include<stack>
#include<set>
#include<map>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
inline ll read(){ll k = 0, f = 1; char ch = getchar();
while (ch < '0' || ch>'9'){if (ch == '-')f = -1;ch = getchar();}
while (ch >= '0' && ch <= '9'){k = k * 10 + ch - '0';
ch = getchar();}return k * f;}
#define maxn 210000
ll head[maxn],to[maxn],val[maxn],nex[maxn],in[maxn],dis[maxn];
ll num_v=0;
void add(ll u,ll v,ll w){to[++num_v]=v;val[num_v]=w,nex[num_v]=head[u];head[u]=num_v;}
ll num[maxn];
ll n,m,s;
bool spfa(ll s)
{
    memset(dis,inf,sizeof(dis));
    dis[s]=0;
    queue<ll>que;
    que.push(s);
    in[s]=1;
    num[s]++;
    while(!que.empty())
    {
        ll u=que.front();
        que.pop();
        in[u]=0;
        for(int i=head[u];i;i=nex[i])
        {
            if(dis[to[i]]>dis[u]+val[i])
            {
                dis[to[i]]=dis[u]+val[i];
                if(!in[to[i]])
                {
                    que.push(to[i]);
                    in[to[i]]=1;
                    num[to[i]]++;
                    if(num[to[i]]>=n)return false;
                }
            }
        }
    }
    return true;
}
int main()
{
    n=read(),m=read(),s=read();
    for(int i=1;i<=m;i++)
    {
        ll t1=read(),t2=read(),t3=read();
        add(t1,t2,t3);add(t2,t1,t3);
    }
    spfa(1);
    while(s--)
    {
        ll t1=read(),t2=read();
        cout<<dis[t1]+dis[t2]<<'\n';
    }
}