The Trains

CodeChefOpen on judge ↗

There are $N$ trains running on $M$ tracks. The $i$-th train currently has its ends at distances $l_i$ and $r_i$ from the starting of occupied track. Find the minimum value of $M$ such that no two trains intersect or touch each other. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - First line each testcase contains a single line integer $N$. Then

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