H - Segment Elimination

CodeChefOpen on judge ↗

*As part of the Drone Shakti initiative, the Directorate General of Civil Aviation (DGCA) is managing a high-density "Green Zone" for autonomous delivery drones. On a specific aerial corridor, $n$ drones are scheduled to pass through, each occupying a specific time segment $[l_i,r_i]$. To prevent mid-air collisions, two drones are considered to be in conflict if their time segments intersect. To

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