Shortest Routes I

#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> iPair;

int main() {
    const int INF = 2e9;
    int n, m;
    cin >> n >> m;
    vector<int> dist(n);
    vector<bool> been(n);
    vector<vector<iPair>> adj(n); // to, len
    priority_queue<iPair> q;
    q.push(iPair(0, 0)); // dist, to

    for (int i=0; i<n; i++) {
        dist[i] = INF;
    }
    dist[0] = 0;

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

    while (!q.empty()) {
        int a = q.top().second; q.pop();
        if (been[a]) continue;
        been[a] = true;
        for (auto u : adj[a]) {
            int b = u.first, w = u.second;
            if (dist[a]+w < dist[b]) {
                dist[b] = dist[a]+w;
                q.push(iPair(-dist[b], b));
            }
        }
    }

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

    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