Auto comment: topic has been updated by Juve45 (previous revision, new revision, compare).

Auto comment: topic has been updated by Juve45 (previous revision, new revision, compare).

Rated contest in CSA :o

The solutions have just been published, with extra bonus challenges.

Can you solve problem F's bonus challenge?

Even though the editorial for E is simple, there is another easy solution to E (one with no edges cases);

We can treat this as a 1 player game for P1. For each removal of a $$$b$$$, P1 gets 1 point. After all operations, for each sequence of $$$X$$$ $$$a$$$'s, P1 loses $$$\lfloor X/3 \rfloor$$$ points. P1 wins iff the maximal amount of points he can get is positive.

We can solve with dp: $$$dp_{i, j}$$$ is the maximal amount of points P1 can get, if we only consider the prefix of length $$$i$$$, and the last sequence of $$$a$$$'s was of length $$$j$$$ (modulo 3). Transitions are easy in constant time.

i am unable to submit to the tasks on CSA since the contest has ended. does anyone else have the same issue?