Shortest Routes I

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

using namespace std;
const int INF = 1e9;

int main(){
    int n, m, c1, c2, c;
    cin >> n >> m;
    vector<int> distances(n + 1, INF);
    vector<vector<pair<int, int>>> adj(n + 1);
    vector<bool> processed(n+1);
    priority_queue<pair<int,int>> q;
    for(int i = 0; i < m; i++){
        cin >> c1 >> c2 >> c;
        adj[c1].push_back({c2, c});
    }
    distances[1] = 0; 
    q.push({0, 1});
    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 (distances[a]+w < distances[b]) {
                distances[b] = distances[a]+w;
                q.push({-distances[b],b});
            }
        }
    }
}

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

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER