PATH

CodeChefOpen on judge ↗

Problem description: Harvey and Mike have now settled their bases at better places. Presently they need to frame a system, that is, they need that each one of their bases ought to be reachable from every base. One base is reachable from other base if there is a path of tunnels connecting bases. Bases are assumed to be in a 2-D plane having integer co-ordinates. The Cost of building tunnels betwee

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