I recently came to know about Small to Large trick from a blog.

It is useful technique and helps to improve O(N^2 * log(N)) to O(N*log^2(N))

Can someone please share links to few problems based on the same trick.

Thanks in advance !

I recently got to know about Tree Flattening using a DFS Traversal. Can someone suggest some nice problems on the same. Thanks!

Hi, I was trying to solve the question 161D - Расстояние в дереве but I'm getting WA on test 11 and can't figure out what's wrong. And the editorial is a bit confusing to me.

Here is my submission : 85076026 Can anyone suggest what might've gone wrong. Thanks in advance !

Hi, I was trying to solve this 102501H - Pseudo-Random Number Generator. I tried to find a pattern but couldn't due to the large constraints. The editorial claims that we need to find the Period of the sequence but I am unable to do so. Any help / suggestions are welcome.

I came across this song while doing CP. It might've unintentionally mentioned the meet in the middle algorithm quite a few times which makes it fun to listen to. Do listen to it.

I hope everyone is fine and practicing social distancing.

I am trying to solve 1284D - New Year and Conference I used a randomized approach involving hashes. I assigned random numbers to each lecture and then calculated for each lecture the xor of numbers assigned to lectures it intersects with. Now I checked that every lecture has same hashes in first location (a) and second location (b)

Take a look at my submission : 68617652 I am getting WA on test 6.

Any advice would be greatly appreciated.

Thanks in advance :)

I came across this problem : 1242B - 0-1 MST It requires us to find components of the complement of the graph. The editorial asks us to use DSU (Disjoint set union) to find the components but I'm not able to understand how to proceed after initializing the DSU.

Any suggestion / comment is greatly appreciated.