Yes i will participate

Contest starts in ~ 30min.

Can anyone give testcase for Split problem? I am unable to figure out where it is failing

Problem Counting(inf)

Hi Dominater069 , The winner of Div3 is indeed an AI cheater please remove him.

Evidence:

Proof 1

Proof 2

Proof 3

Proof 4

Proof 5

UPD : He/She cheated on previous starters and got this :

Here Profile

My approach for problem C EVCOST is quite different from the editorial; here's the core idea:

Moves of type 1 are deterministic, so we can predict what the next move(s) will be. Either

• $$$111\dots12$$$ and we cannot predict the moves after this because type 2 moves are non-deterministic

Or

• $$$111\dots11$$$ and we reach position $$$N+1$$$ so there are no more moves

Intuitively, we can think of the first case $$$\underbrace{11\dots1}_{k\text{ ones}}2$$$ as "$$$B_x$$$ is too large", so we first move to $$$x+k$$$ by paying $$$A_x + A_{x+1} + \dots + A_{x+k-1}$$$. We can fix this by assigning $$$B_x := \min(B_x, A_x + B_{x+1})$$$.

So now the only time we will make type 1 moves is when $$$x \geq x'$$$ for some threshold $$$x'$$$. We can solve this for all $$$x'$$$ to get an $$$O(n)$$$ solution.

Submission