Painting Tree

CodeChefOpen on judge ↗

You are given a tree with $N$ nodes numbered $1$ through $N$. Each node is initially colored white. We perform the following process on this tree: - choose an unordered pair of vertices $(a, b)$ uniformly at random (i.e. each pair has an equal probability of being picked) - if there is a black node on the shortest path between $a$ and $b$ (including $a$ and $b$), the process stops - otherwise:

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