Shortest Routes I

#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
#include <queue>

int main() {
    int n, m;
    std::cin >> n >> m;
    std::vector<std::vector<std::pair<int, int>>> flights(n + 1);
    for (int i = 0; i < m; i++) {
        std::vector<int> tmp(3);
        std::cin >> tmp.at(0) >> tmp.at(1) >> tmp.at(2);
        flights.at(tmp.at(0)).push_back({tmp.at(1), tmp.at(2)});
        flights.at(tmp.at(1)).push_back({tmp.at(0), tmp.at(2)});
    }
    int x = 1;
    std::vector<long long> distance(n + 1, LLONG_MAX);
    std::vector<bool> processed(n + 1, false);
    std::priority_queue<std::pair<int, int>> q;
    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 : flights.at(a)) {
            int b = u.first;
            int w = u.second;
            if (distance[a] + w < distance[b]) {
                distance[b] = distance[a] + w;
                q.push({distance[b],b});
            }
        }
    }
    for (int dist = 1; dist <= n; dist++) {
        std::cout << distance[dist] << ' ';
    }
    std::cout << std::endl;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

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: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: ACCEPTED

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: ACCEPTED