← All problemsSign in

Colorblind Feast

CodeChefRating 2686Open on judge ↗

Chef is serving dishes at a feast full of colorblind people. He is adding dishes one by one to a long table to form a sequence of dishes; for each dish he adds, we know its color and deliciousness. A person with *colorblindness* $c$ can only see dishes with colors in the range $[c-K, c+K]$. You should process $Q$ queries. There are three types of queries: - $1\;c\;d$: Chef adds a dish with col

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

Sign in to chat with the tutor and save your progress.

Sign in to start