Rick Tries CP

CodeChefOpen on judge ↗

Rick is bored again. This time he decides to try out competitive programming. When he came across the travelling salesman problem, he instantly coded the algorithm and decided to test it out right away. For this, he used his number generator gun to generate $N$ numbers on the X-axis, and stores them in an array $D$. To obtain some information about the numbers, he asks $Q$ queries on the X-axis.

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