Efficient Delivery

CodeChefRating 3713Open on judge ↗

Sergey works as a delivery boy. Every day he has a number of deliveries to be completed. Sergey lives in Bytetown - a city, consisting of N junctions, and M roads connecting these junctions. More precisely, the ith road connects the junctions with the numbers Xi and Yi. Each of these roads has its own (positive) length Zi, and no road connects a junction to itself. There are K delivery orders

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