Rest in peace

For problem E, we can calculate every position, the first 0 to the right of every bit.

Then for each query, iterate each bit from low to high, and check first 0 to the right. If the current bit of k is 1, it needs to satisfy all the smallest right end points that are not 0. If the current bit of k is 0, since we iterate from low to high, the rightmost non-0 can be greater than or equal to k.

I am not sure if my solution is correct, after all, it has not passed the system test. But I want to share my ideas with you, and the code is as follows:

https://mirror.codeforces.com/contest/1878/submission/225352692

Why is the C problem so TLE-constrained for python……

It's a really good contest and let me return to violet, thanks to problems setter~

Fully agree. I spent most of time to understanding what to do and then very little time to coding.

Me too!

Thanks so much for there're py solution~

Sure enough, I got further away from purple。。

There are so many submission still in queue, I'm really worried about getting stuck in the contest tonight.

How far is purple?

Finally I become red handle in this special timing.

According to the rating was rolled back, so I participate in this round will be rated or not?

Me too(^_^)

And there is no editorial too