Liquor Hunting

CodeChefOpen on judge ↗

As Jignesh was always debarred from alcohol, this eventually made him an alcohol fanatic. The City in which Jignesh lives has N points and these are connected with M edges of non-negative length. There are B booze shops in the city located at different points. Due to his extreme obsession, he can have a craving irrespective of his position in the city, so he wants to know the distance of the neare

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