Distinct Colors

CSESTree AlgorithmsOpen on judge ↗

You are given a rooted tree consisting of n nodes. The nodes are numbered 1,2,\ldots,n, and node 1 is the root. Each node has a color. Your task is to determine for each node the number of distinct colors in the subtree of the node. Input The first input line contains an integer n: the number of nodes. The nodes are numbered 1,2,\ldots,n. The next line consists of n integers c_1,c_2,\ldots,c_n

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