Пожалуйста, подпишитесь на официальный канал Codeforces в Telegram по ссылке https://t.me/codeforces_official. ×

An interesting problem

Правка en2, от serialcomder, 2023-03-21 22:00:34

Hey, I came across this problem in a course interview I am not sure how to solve it.

We are given a set of $$$n$$$ intervals, let's call it $$$S$$$. Now, we have to output any subset $$$T$$$ of $$$S$$$ such that all the intervals in $$$T$$$ are pairwise disjoint (non-overlapping) and all the intervals in $$$S \smallsetminus T$$$ should intersect with exactly one interval from $$$T$$$.

I am really curious to know what the solution could be.


  Rev. Язык Кто Когда Δ Комментарий
en2 Английский serialcomder 2023-03-21 22:00:34 18 Tiny change: ' disjoint and all t' -> ' disjoint (non-overlapping) and all t'
en1 Английский serialcomder 2023-03-21 21:27:14 425 Initial revision (published)