CSES - Flight Routes
Author: Benjamin Qi
Maintain a priority queue of the best distances found for each vertex. We'll iterate through the adjacency list of each vertex at most 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!