Shortest Routes I

#include <bits/stdc++.h>
using namespace std;
#define int long long

const int INF = LLONG_MAX;
vector<vector<pair<int, int>>> adj;

void dijkstra(int s, vector<int>& distance) {
    int n = adj.size();
    distance.assign(n, INF);
    vector<bool> processed(n, false);
    priority_queue<pair<int,int>> q;
    
    distance[s]=0;
    q.push({0,s});
    while(!q.empty()){
        int a=q.top().second;
        q.pop();
        if(processed[a])continue;
        processed[a]=true;
        for(auto u:adj[a]){
            int b=u.first,w=u.second;
            if(distance[a]+w<distance[b]){
                distance[b]=distance[a]+w;
                q.push({-distance[b],b});
            }
        }
    }
}

signed main() {
    int n, m;
    cin >> n >> m;

    adj.resize(n);

    for (int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        adj[a - 1].push_back({b - 1, c});
    }

    vector<int> d;
    dijkstra(0, d);

    for (int i = 0; i < n; i++) {
        cout << d[i] << " ";
    }

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED