Zenny and Segments
CodeChefOpen on judge ↗
$Zenny$ has a difficult problem to solve. She has $N$ segments $[l1,r1],[l2,r2],…,[lN,rN]$ on the x-axis. A $K$-subset of these $N$ segments consists of any $K$ of these segments. For each $K$-subset, consider the common intersection of all the $K$ segments, i.e. the set of points which belong to each of the $K$ segments. The intersection of segments is also a segment; the length of a segment $[l,
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.
Sign in to chat with the tutor and save your progress.
Sign in to start