← All problemsSign in

City Travelling

DYCUR is the currency popular in the Chef Dynasty. The Dynasty has control over $N$ cities which are connected by directed roads. The construction of these roads as demanded by Chef was done in the form of a tree. Every road has a direction in which the soldiers of Chef Dynasty permit the people to travel in. For going in the opposite direction, a person would have to bribe these soldiers with $K

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

Sign in to chat with the tutor and save your progress.

Sign in to start