SPFA【模板】单源最短路径

题目传送 https://www.luogu.org/problem/show?pid=3371没啥解释，SPFA纯模版qaq//Gang
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<queue>
#include<cmath>
#define FOR(x,y,z) for(int x=y;x<=z;x++)
#define REP(x,y,z) for(int x=y;x>=z;x--)
#define ll long long
using namespace std;
int n,m,s;
],gi[],wi[];
],hd[];
];
int cnt;
struct node{
    int dis,next,v;
}e[];
void add(int u,int v,int dis)
{
    cnt++;
    e[cnt].next=hd[u];
    e[cnt].v=v;
    e[cnt].dis=dis;
    hd[u]=cnt;
}
void SPFA(int x)
{
    queue<int>q;
    q.push(x);
    dis[x]=;
    book[x]=;
    while(!q.empty())
    {
        int u=q.front();q.pop();
        book[u]=;
        for(int i=hd[u];i;i=e[i].next)
        {
            int v=e[i].v;
            if(dis[v]>dis[u]+e[i].dis)
            {
                dis[v]=dis[u]+e[i].dis;
                if(!book[v])
                {
                    q.push(v);
                    book[v]=;
                }
            }
        }
    }
    ;i<=n;i++)
    {
        )
        printf();
        else printf("%d ",dis[i]);
    }
}
int main()
{
    scanf("%d%d%d",&n,&m,&s);
    FOR(i,,m)
    {
        scanf("%d%d%d",&fi[i],&gi[i],&wi[i]);
        add(fi[i],gi[i],wi[i]);
    }
    ;i<=n;i++)
    dis[i]=;
    SPFA(s);
    ;
}