Washington Town

CodeChefOpen on judge ↗

Washington Town is a city that consists of N special junctions and (N-1) pathways. There is exactly one shortest path between each pair of junctions. Junction i is located at (xi, yi) and the distance between two junctions i,j is defined by the Taxicab geometry. Tim has recently afforded a taxicab to work as a taxicab driver. His vehicle was very cheap, but has a very big flaw. It can only driv

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