Competitive Friends

CodeChefOpen on judge ↗

Problem Description Rohit and Dwij are best of friends and competitors when it comes to coding challenges. One day Rohit decides to give Dwij a problem to test his coding skills. Unfortunately, the problem is too difficult for him,so he asks you to help him out. He has a map of a city which can be represented as a weighted tree with N nodes,representing houses, numbered from 1 to N where each no

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