Biker Spider

CodeChefOpen on judge ↗

Spider-Man is travelling from Delhi to Ladakh. He plans to visit all the $N$ tourist spots between Delhi and Ladakh (both included). These tourist spots are connected to one another (directly or via some other spots) and have different distances. Spider-Man has data of all the connecting routes, i.e., he knows the distance $D$ from spot $X$ to $Y$. Delhi is numbered as spot $1$ and Ladakh is numb

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.

voice by Sarvam AI