Shortest Routes I

#include<iostream>
#include<vector>
#include<limits>
#include<queue>
#include <utility>
#include <functional>

using namespace std;

void dijkstra(const vector<vector<pair<int,long long>>> & adj, 
vector<long long> & distance, int n){
    priority_queue <pair<long long,int>> q;
    int ini = 0;
    distance[ini] = 0;
    q.push({0,ini});
    vector<bool> processed(n,false);
    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});
            }
        }
    }
}
const long long INF = (10e9)+1;
int main(){
    int n;
    cin >> n;
    vector<vector<pair<int,long long>>> adj(n);
    int m;
    cin >> m;
    for(int i = 0; i < m; ++i){
        int a, b;
        long long  c;
        cin >> a >> b >> c;
        --a;
        --b;
        adj[a].push_back(make_pair(b, c));
    }
    vector<long long> distance (n, INF);
    dijkstra(adj, distance, n);
    for(auto i : distance){
        cout << i<<' ';
    }
    cout <<endl;
}

Test 1

Verdict: ACCEPTED

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

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