CSES - Flight Routes

Author: Benjamin Qi


Time Complexity: O(mklog(mk))\mathcal{O}(mk\log (mk))

Maintain a priority queue of the kk best distances found for each vertex. We'll iterate through the adjacency list of each vertex at most kk times.

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
using str = string; // yay python!
using pi = pair<int,int>;
using pl = pair<ll,ll>;

Join the USACO Forum!

Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!