不好，是WA，我们没救了！
me的 \color{red}{Wrong} \color{red}{Answer} 0 分代码：（样例已经过了）
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define back_push push_back
#define mian main
using namespace std;
struct e{
int u,v;
};
struct node{
int p,d;
bool operator < (const node & a)const{return a.d>d;}
};
vector<e>mp[500005];
int n,m;
int dis[100005];
bool vis[100005];
void init(){
memset(dis,0x3f,sizeof dis);
cin>>n>>m;
for(int i = 1;i<=m;i++){
int a,b,c;
cin>>a>>b>>c;
mp[a].back_push({b,c});
}
}
void dijkstra(){
priority_queue<node>q;
dis[1]=0;
q.push((node){1,0});
while(!q.empty()){
node temp = q.top();
q.pop();
int x = temp.p,d = temp.d;
//cout<<x<<" "<<d<<endl;
if(vis[x])continue;
vis[x]=1;
//cout<<mp[1].size();
for(int i = 0;i<mp[x].size();i++){
int tt = mp[x][i].u,ww=mp[x][i].v;
//cout<<"!!!"<<tt<<" "<<ww<<" "<<endl;
if(dis[tt]>dis[x]+ww){
dis[tt]=dis[x]+ww;
if(!vis[tt]){
q.push((node){tt,dis[tt]});
}
}
}
}
}
void write(){
for(int i = 1;i<=n;i++){
if(dis[i] == 0x3f3f3f3f3f3f3f3f){
cout<<"inf ";
}else cout<<dis[i]<<" ";
}
}
void solve(){
init();
dijkstra();
write();
}
signed mian() {
solve();
return 0;
}
