Segmentation

CodeChefOpen on judge ↗

Problem Statement You are given with N segments on x-axis in the form of their endpoints. You have to output the number of distinct integral points that are covered by the line segments. INPUT First line contains the no. of test cases T. First line of each test case contains the number N, then N line follows containing two integers A and B, the endpoints of the ith segment. OUTPUT Output a s

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