Beautiful Pairs

CodeChefOpen on judge ↗

You are given $N$ pairs of type $(start, end)$. Let's define beautiful pair, for any four integers $L1$, $R1$, $L2$, $R2$ such that $L1$ $ \leq$ $R1$ and $L2$ $\leq$ $R2$ . A pair $P$ is called beautiful iff $L1$ $\leq$ $P_{start}$ $\leq$ $R1$ and $L2$ $\leq$ $P_{end}$ $\leq$ $R2$. You have to answer $Q$ queries of type $L1$ $R1$ $L2$ $R2$. In each query, you have to find the count of

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