rt，代码如下：

#include<iostream> 
#include<cstdio>
#include<cstring>
#include<deque>
#include<queue>
using namespace std;
const bool T=true,F=!T;
const int MAXN=5e5+10,INF=0x3f3f3f3f;
deque<pair<int,int> > g[MAXN];
queue<int> q;
static int h[MAXN],d[MAXN];
static bool vis[MAXN];
int n,m,s,ans,cnt;
inline int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
	return x*f;
}
void spfa(int s)
{
    memset(d,INF,sizeof(d));
    d[s]=0;q.push(s);vis[s]=T;
    int u,v,w;
    while(q.size())
    {
        u=q.front();q.pop();
        vis[u]=F;
        for(pair<int,int> i:g[u])
        {
            v=i.first;w=i.second;
            if(d[u]+w<d[v])
            {
                d[v]=d[u]+w;
                if(!vis[v])
                {
                    q.push(v);
                    vis[v]=T;
                }
            }
        }
    }
}
signed main()
{
	n=read();m=read();s=read();
	int u,v,w;
	for(int i=1;i<=m;i++)
	{
		u=read();v=read();w=read();
		g[u].push_back(make_pair(v,w));
	}
	spfa(s);
	for(int i=1;i<=n;i++)
	{
		if(d[i]!=INF)cout<<d[i]<<" ";
		else cout<<2147483647<<" ";
	}
	return 0;
}//MLE

将deque改为vector/list，AC。