最近真的太自闭了，dij板子全T,求助。

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5; 
typedef pair<int,int> P; 
int n,m,Last[N],tot;
struct node
{
    int to,v,Next;
}edge[N];
int dis[N];
bool mark[N];
priority_queue<P,vector<P>,greater<P> >q;
int dij(int s)
{
    memset(dis,0x3f3f3f,sizeof(dis));
    dis[s] = 0;
    q.push(make_pair(dis[s],s));
    while(!q.empty())
    {
        int u = q.top().second,v = q.top().first;q.pop();
        if(mark[u])continue;
        mark[u] = true;
        for(int i=Last[u];i;i=edge[i].Next)
        {
            int k = edge[i].to;
            if(mark[k])continue;
            if(dis[k] > dis[u] + edge[i].v)
            {
                dis[k] = dis[u] + edge[i].v;
                q.push(make_pair(dis[k],k));
            }
        }
    }
}
void add(int x,int y,int v){edge[++tot].to = y,edge[tot].v = v,edge[tot].Next = Last[x],Last[x] = tot;}
int main()
{
    int s;
    scanf("%d %d %d",&n,&m,&s);
    for(int i=1;i<=m;i++)
    {
        int x,y,z;
        scanf("%d %d %d",&x,&y,&z);
        add(x,y,z);//add(y,x,z);
    }
    dij(s);
    for(int i=1;i<=n;i++)printf("%d ",dis[i]);
    return 0;
}