Nested Ranges Count

CSESSorting and SearchingOpen on judge ↗

Given n ranges, your task is to count for each range how many other ranges it contains and how many other ranges contain it. Range [a,b] contains range [c,d] if a \le c and d \le b. Input The first input line has an integer n: the number of ranges. After this, there are n lines that describe the ranges. Each line has two integers x and y: the range is [x,y]. You may assume that no range appea

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