CSES 1671 Shortest Routes I - Problem Statement

You are given a directed weighted graph with $n$ nodes and $m$ edges. Find the shortest distance from node $1$ to every other node. If a node is unreachable, output $-1$.

Run Dijkstra from node $1$. Store the distance array. Print the result for each node from $1$ to $n$. Constraints: $n \leq 10^5$, $m \leq 2 \times 10^5$, weights up to $10^9$. Use long long for distances because the total path weight can exceed $32$-bit range. This is the textbook Dijkstra problem with no hidden tricks.