Light-Light Decomposition?

Your friend is dumb

Is it still rated?

Kind of defeats the whole purpose of "Top-200" Badge.

Were the problems also made by Chat GPT?

Stop crying it was almost two years ago

As someone that uses codeforces entirely zoomed in (because i don't see a pito), I wouldn't be able to see the snowflakes at all, so I don't really like this idea.

Also it completely kills the snowflakes for mobile version.

1E feels like a Div2C. I wonder why so few people solved it.

1E is not hard

Maybe Extending Set of Points? I found it very similar to this one.

Does this mean we will be able to choose tourist rank for New Year's Magic?

It doesn't TLE, the problem is that you are using a map to store the elements of the current range, and as you make $$$O(n\sqrt n)$$$ insertions and deletions on this map (because mo does $$$O(n\sqrt n)$$$ updates), your code ends up being $$$O(n\sqrt n\ log\ n)$$$ which is too much for $$$n\leq 2*10^5$$$. In fact, there exists a solution with mo for this problem, which got AC in 1528ms, here it is. Tell me if you want me to explain the idea behind that solution (the key is to keep updates in $$$O(1)$$$ and you can still do queries in $$$O(\sqrt n)$$$, as there are only $$$n$$$ queries).

I wouldn't say it's easy, I'm probably biased towards F, but I personally think that D > E > F.

The first three are actually YES. (And maybe 6th too, depending on your implementation)