DS reUNION

CodeChefOpen on judge ↗

The $2015$ Data Science batch is planning for a reunion after $7$ years since graduation. But Mr. ST, the most famous person in the batch, is stuck on a task and might not be able to attend the reunion if the task is not completed. There are $N$ datasets which are numbered $1$ to $N$. These data sets are actually axis-aligned rectangles (the ones with edges parallel to the coordinate axes). Say $

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