Shortest Routes I

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

const long long INF = 1e18;

using namespace std;

void djstra(const vector<vector<pair<int,long long>>>& dist, vector<long long>& d, int ini){
    vector<bool> processed(d.size(), false);
    priority_queue<pair<long long, int>> q;

    q.push(make_pair(0,ini));
    d[ini] = 0;

    while(not q.empty()){
        long long rec = -(q.top().first);
        int nod = q.top().second;

        q.pop();

        if(processed[nod])continue;

        processed[nod]=true;

        for(auto adj : dist[nod]){
            long long temps = adj.second;
            int desti = adj.first;

            if((rec+temps) < d[desti]){
                d[desti] = (rec+temps);
                q.push(make_pair(-(rec+temps), desti));
            }
        }
    }
    
}


int main(){
    int cities, flights;
    cin >> cities >> flights;

    vector<vector<pair<int,long long>>> dist(cities);

    for(int i=0; i< flights; i++){
        int a,b;
        long long c;
        cin >> a >> b >> c;
        dist[a-1].push_back(make_pair(b-1,c));
    }

    vector<long long> d(cities,INF);

    djstra(dist, d, 0);

    for(int i=0; i< cities; i++){
        cout << d[i];
        if(i!= cities-1)cout <<" ";
    } 
    cout <<endl;

}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED