Shortest Routes I

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

void printSolution(int V, int dist[]) {
    for (int i = 1; i <= V; i++) {
        cout << dist[i] << " ";
    }
    cout << endl;
}

void dijkstra(int n, vector<vector<pair<int,int>>>& adj, int x) {
    priority_queue<pair<int, int>> q;
    int distance[n+1];
    bool processed[n+1] = {false};
    for (int i = 1; i <= n; i++) distance[i] = INT_MAX;
    distance[x] = 0;
    q.push({0,x});
    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});
            }
        }
    }
    
    printSolution(n, distance);
}

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

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

    dijkstra(n, graph, 1);

    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: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED