10086. 「一本通 3.3 练习 3」Easy SSSP

#include<algorithm>
#include<bitset>
#include<complex>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<cmath>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#define E 2000010
#define eps 1e-10
#define ll long long
using namespace std;
inline ll read(){
    ll res=0,f=1;char ch=getchar();
    while(ch<'0'ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') res=res*10+ch-'0',ch=getchar();
    return res*f;
}
inline void write(ll x){
    if(x<0) putchar('-'),x=-x;
    if(x<10) putchar(x+'0');
    else{
        write(x/10);
        putchar(x%10+'0');
    }
}
//queue<ll> q;
//set<ll> s;
//priority_queue<ll> q1;
//priority_queue<ll,vector<ll>,greater<ll> > q2;
//list<ll> l;
//stack<ll> s;
ll n,m;
ll fir[E],nxt[E],son[E],tot;
double w[E],Max;
void add(ll x,ll y,double z){++tot;nxt[tot]=fir[x];son[tot]=y;fir[x]=tot;w[tot]=z;}
double dis[E],flag;
ll vis[E];
queue<int> q;
int tt[E];
ll spfa(ll s){
    vis[s]=1;
    q.push(s);
    while(!q.empty()){
        int u=q.front();q.pop();
        for(ll i=fir[u];i;i=nxt[i]){
            ll to=son[i];
            if(dis[u]+w[i]<dis[to]){
                dis[to]=dis[u]+w[i];
                tt[to]++;
                if(tt[to]>n+1){
                    puts("-1");
                    exit(0);
                }
                if(vis[to]==0){
                    vis[to]=1;
                    q.push(to);
                }
            }
        }
        vis[u]=0;
    }
    return 0;
}
ll st[E];
int main(){
    ll T=1,S;
    while(T--){
        n=read();m=read();S=read();
        tot=0;
        memset(fir,0,sizeof(fir));
        for(ll i=1;i<=m;i++){
            ll x=read(),y=read();double z;
            cin>>z;
            add(x,y,(double)z);
        }
        for(ll i=0;i<=n;i++) dis[i]=2e18;
        dis[S]=0;
        memset(vis,0,sizeof(vis));
        spfa(2);
        for(ll i=0;i<=n;i++) dis[i]=2e18;
        dis[S]=0;
        memset(vis,0,sizeof(vis));
        spfa(S);

        for(ll i=1;i<=n;i++){
            if(i==S) puts("0");
            else if(dis[i]>=2e18) puts("NoPath");
            else{
                printf("%.0lf\n",dis[i]);
            }
        }
    }
    return 0;
}