样例过了，但是全RE（悲 代码：```cpp

include <stdio.h> //Dijkstra

include <string.h>

include

include

using namespace std; int n,m,s,num=0,dis[11451]={0}; int head[11451]={0}; bool vis[11451]={0}; struct Edge{ int from; int to; int Next; int Distance; }edge[21451]; void AddEdge(int From,int To,int Dis){ edge[++num].Next=head[From]; head[From]=num; edge[num].from=From; edge[num].to=To; edge[num].Distance=Dis; return; } int main(){

scanf("%d%d%d",&n,&m,&s);
for(int i=0;i<m;i++){
	int u,v,d;
	scanf("%d%d%d",&u,&v,&d);
	AddEdge(u,v,d);
}
memset(dis,0x3f,sizeof(dis));
queue<int>qu;
qu.push(1);
dis[1]=0;
vis[1]=1;
while(!qu.empty()){
	int Now=qu.front();
	qu.pop();vis[Now]=0;
	for(int i=head[Now];i;i=edge[i].Next){
		if(dis[edge[i].to]>dis[Now]+edge[i].Distance){
			dis[edge[i].to]=dis[Now]+edge[i].Distance;
			if(!vis[edge[i].to]){
				vis[edge[i].to]=1;
				qu.push(edge[i].to);
			}
		}
	}
}
for(int i=1;i<=n;i++){
	printf("%d ",dis[i]);
}
return 0;

}