D Agam vs Akhilhesh

CodeChefOpen on judge ↗

In order to entertain themselves during the long flight, Agam and Akhilesh invented the following very simple two players' games. The game is: First, Agam draws some graphs with bidirectional weighted edges. There are possibly multiple edges (probably, with different or same weights) in this graph. Then Akhilesh picks some spanning tree of this graph. If the tree appears to be the minimum sp

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