Shortest Routes I

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <limits>

using namespace std;

using ll  = long long;

using vi  = vector<int>;
using vc = vector<char>;
using vll = vector<long long>;
using vs  = vector<string>;
using vb = vector<bool>;
using vvi  = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vvc  = vector<vector<char>>;
using vvb  = vector<vector<bool>>;
using vvpll = vector<vector<pair<ll,ll>>>;

using pii = pair<int, int>;
using pll = pair<ll, ll>;

using pq_ll = priority_queue<ll>;
using pq_pll = priority_queue<pll>;
using pq_pll_g = priority_queue<pll, vector<pll>, greater<pll>>;


#define all(x) (x).begin(), (x).end()
#define pb push_back
#define sz(x) ((int)(x).size())
#define forn(i, n) for (int i = 0; i < (n); ++i)
#define fore(i, ini, n) for (int i = ini; i < (n); ++i)

int n, m, x, c;
const ll INF = 1e18;
const int MODULO = 1e9 + 7;

int dr[] = {-1, 1, 0, 0};
int dc[] = {0, 0, -1, 1};
char dir[] = {'U', 'D', 'L', 'R'};
bool pos_ok(int a, int b){
  return a >= 0 and a < n and b >= 0 and b < m;
}

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  cin >> n >> m;

  vvpll adj(n+1);

  ll a, b, w;
  forn(i, m){
    cin >> a >> b >> w;
    adj[a].pb({w,b});
  }

  pq_pll_g q;

  vb visited(n+1);
  vll distance(n+1, INF);
  distance[1] = 0;

  q.push({0,1});


  while(!q.empty()){
    ll node = q.top().second; q.pop();

    if(visited[node]) continue;
    visited[node] = true;

    for(auto& nei : adj[node]){
      if(distance[node]+nei.first < distance[nei.second]){
        distance[nei.second] = distance[node]+nei.first;
        q.push({distance[nei.second], nei.second});
      }
    }
  }

  fore(i, 1, n) cout << distance[i] << " ";
  cout << distance[n] << 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