Tours on Tree
CodeChefOpen on judge ↗
There are $N$ cities in your country numbered $1,2,3....,N$ with population $A_1, A_2, A_3,..., A_N$. There are $N-1$ bidirectional roads connecting these cities such that every city is reachable from every other city. A tour between two cities $x$ and $y$ is considered beautiful if the population of all the cities on the path from $x$ to $y$ ($x$ and $y$ are distinct.) is in one of the followin
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.
Sign in to chat with the tutor and save your progress.
Sign in to start