68pts求助

#include <iostream>
#include <queue>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
const ll inf = (1ll << 31) - 1;

struct node{
    ll v , w;
};
vector<node>e[100010];
ll d[100010];
bool vis[100010];
struct cmp{
    bool operator()(int a ,int b){return d[a] > d[b];}
};
priority_queue<int , vector<int> , cmp>q;
int main()
{
    int n , m , s;
    cin >> n >> m >> s;
    for (int i = 1; i <= m; i++){
        int u , v , w;
        cin >> u >>  v >> w;
        e[u].push_back(node{v , w});
    }
    for (int i = 0; i <= n; i++)d[i] = inf;
    d[s] = 0;
    q.push(s);
    while (!q.empty()){
        int fr = q.top();
        q.pop();
        //cout << fr << endl;
        if (vis[fr])continue;
        vis[fr] = true;
        for (node i:e[fr]){
            ll v = i.v , w = i.w;
            //if (vis[v])continue;
            if (d[v] > d[fr] + w){
                d[v] = d[fr] + w;
                if (!vis[v])q.push(v);
            }
        }
    }
    for (int i = 1; i <= n; i++)cout << d[i] << ' ';
    return 0;
}

WA on#1,#4