Gaitonde The King

CodeChefOpen on judge ↗

Gaitonde consider himself as the king of Bombay.He is planning to increase the trouble of citizens , He will select $2$ Stations $A$ and $B$ , and will destroy all the tracks occuring in Least Cost Path between the two Station . Being a good friend of Gaitonde and a considerate citizen you have to tell whether it is still possible to travel from $A$ to $B$(after the removal of Least Cost Path), if

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