Easy Paths
CodeChefOpen on judge ↗
There are $N$ hill stations numbered from $0$ to $N-1$, all the stations have some fixed elevations and are connected with every other station directly or indirectly via roads. The roads are bidirectional and there is some cost associated with each of these roads. Roads are given in the format [$u$, $v$, $w$] which denotes that there is a road between station $u$ and station $v$ with cost $w$. A
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start