The Melancholy of Problem Setter
Roughly speaking, this problem asks you to create the checker of [*the problem used in December CookOff*](https://www.codechef.com/problems/RGBCONST). You are given a tree with $N$ vertices and a string $C$ of length $N$, consisting of the characters `'R'`, `'G'` and `'B'`. For each integer $i\ (1\leq i\leq N)$, $C_i$ is the color of vertex $i$ — `'R'` is for Red, `'G'` is for Green and `'B'` is
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