TREE COLORING

CodeChefOpen on judge ↗

We have a tree rooted at $1$ of size $N$. Each node has a $color$ (initially 0). You are given $Q$ queries of the following two types: 0 V C: Find the count of nodes in the subtree of node V (including node V) with the color C. 1 V C: Update the color of the node V to C. ###NOTE: - The test cases are too tight, use fastio. ###Input: - The first line contains $T$, the number of test cases. - T

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