Raju and his Trees

CodeChefOpen on judge ↗

Raju loves data structures. He has a special knack for problems related to trees. One day, he stumbled upon one such problem related to nodes & edges of weighted trees. The problem asked him to find the total number of vertex triplets (i, j, k) on the way from i to j and from i to k such that there exists at least one lucky edge. A triplet (1, 2, 3) is different from (1, 3, 2) or (2, 1, 3). Also,

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