Throw and Take

There is a line consisting of $N$ piles of coins on the table. For each $i$ ($1 \leq i \leq N$), the $i$-th pile contains $C_i$ coins, each with value $V_i$. There is also a bin under the table. Alice and Bob play a game, moving alternately. A move consists of two steps: - Throw a prefix of the piles in the bin (the prefix can be empty). Then, if there are no coins left on the table, the game end