不去掉只有九十分

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <queue>
#define int long long
using namespace std;
const int N=4e6+10,M=4e6+10;
int head[N],ver[M],edge[M],nxt[M],d[N],s;
bool v[N];
int n,m,tot;
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
    return x*f;
}
inline void add(int x,int y,int z){
    ver[++tot]=y,edge[tot]=z,nxt[tot]=head[x],head[x]=tot;
}
queue<int> q;
void spfa(){
    memset(d,0x3f,sizeof(d));
    d[s]=0;v[s]=1;
    q.push(s);
    while(q.size()){
	int x=q.front();q.pop();
	v[x]=0;
	for(int i=head[x];i;i=nxt[i]){
	    int y=ver[i],z=edge[i];
	    if(d[y]>d[x]+z){
		d[y]=d[x]+z;
		if(!v[y]) q.push(y),v[y]=1;
	    }
	}
    }
}
signed main(){
    n=read();m=read();s=read();
    for(int i=1;i<=m;i++){
	int x=read(),y=read(),z=read();
	add(x,y,z);
    }
    spfa();
    for(int i=1;i<=n;i++){
	if(d[i]==0x3f3f3f3f) cout<<2147483647<<" ";
	else cout<<d[i]<<" ";
    }
    return 0;
}