Comments

I don't think this is good...

Azerbaijanis are Turks.

Oh typical Turkish guys, $$$n \leq 2*10^5$$$.

Why I should love you!?
BTW If you are Israeli, yes, I love you very much.

Actually this isn't a fake account.

One of my friends told me that this site exists and I am just trying to selectively choose the people from the cleanity of your codes and their algorithmic talents for Autopilot and Full Self-Driving department.

and I say it cause I want to people know how cleanity of codes is important for you guys to choose (along with algorithmic knowledge and skill) so try to do your best.

I know you don't believe me, but I don't care.

Congratulations to Israel for this huge and incredible success. Indeed, you're the children of God. Smart and talented.

Can you explain the $$$O(n)$$$ solution?

Additionally, my solution for D1A was $$$O(k \log n \log nk)$$$ and I can't understand the editorial of $$$O(n + k)$$$ solution, can you explain it more in details!?

Can someone explain it?

I'm still waiting...

I'll continue to comment until someone answer.

The Editorial isn't clear. I can't understand!?

Can someone explain it?

I can't understand how problem solved for all roots in problem E!?

Is this some kind of trick to solve problem based on solving it for one root (because I know something like this exists) or not, am I missing something?