are Codeforces Global Rounds discontinued? the year is about to end and we've not seen one

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.