Problem of nowdays contexts.
Big amount of calculations on sets of integers.
Can't avoid TLE.
WHAT IS COMPLEXITY FOR RIGHT ALGO?
I think that O(N^3) because new interval [xi,yi]
can born ~O(N^2) new pathes of ajust intervals
all of which must be checked.
Thus limit N=5000 demand heuristics.