Network Message Passing

CodeChefOpen on judge ↗

Alexander is the leader of the Kingdom ‘MACEDONIA’. The team consisted of n warriors including the leader himself for war against other kingdoms. All warriors are not directly in contact with him. So he wants to find out the minimum time required for a message to be received by all warriors sent by him. Here warriors are represented by the numbers from 1 to n and Alexander is represented by 1. Yo

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