求助，马蜂良好

只 AC #5 ，其他全WA，调不出来

#include <bits/stdc++.h>
const int maxn = 1000005;
using namespace std;
const int inf = 2147483647;
int n, m, s, cnt;
int dis[maxn], h[maxn], to[maxn], val[maxn], nxt[maxn];
bool vis[maxn];
struct node
{
    int v, w;
    friend bool operator<(node a, node b)
    {
        return a.w < b.w;
    }
} tmp;

priority_queue<node> q;
void dijkstra()
{
    for (int i = 1; i <= n; i++)
    {
        dis[i] = inf;
    }
    dis[s] = 0;
    tmp.v = s, tmp.w = 0;
    q.push(tmp);
    while (!q.empty())
    {
        int u = q.top().v;
        q.pop();
        if (vis[u])
            continue;
        vis[u] = 1;
        for (int i = h[u]; i; i = nxt[i])
        {
            if (dis[to[i]] > (long long)dis[u] + val[i])
            {
                dis[to[i]] = dis[u] + val[i];
                tmp.w = dis[to[i]], tmp.v = to[i];
                q.push(tmp);
            }
        }
    }
}
void add(int a, int b, int c)
{
    to[++cnt] = b;
    val[cnt] = c;
    nxt[cnt] = h[a];
    h[a] = cnt;
}

int main()
{
    scanf("%d%d%d", &n, &m, &s);
    for (int i = 1, u, v, w; i <= m; i++)
    {
        scanf("%d%d%d", &u, &v, &w);
        add(u, v, w);
    }
    dijkstra();
    for (int i = 1; i <= n; i++)
    {
        printf("%d ", dis[i]);
    }
    //system("pause");
    return 0;
}