Given a big interval [S, E] and a bunch of small intervals [xi, yi], check whether the big one has intersections with any of small ones.
Two intersections [a, b] and [c, d] has intersections if and only if max(a, c) < min(b, d).
The algorithm should be that going through all small intervals and having checks with the big one.
AUTHOR’S AND TESTER’S SOLUTIONS:
Solutions will be available soon.