2024: [USACO 2024 February Contest Bronze] Problem 2. Milk Exchange

Farmer John's $N$ $(1\le N\le 2\cdot {10}^5)$ cows are lined up in a circle such that for each $i$ in $1,2,\dots ,N-1$, the cow to the right of cow $i$ is cow $i+1$, and the cow to the right of cow $N$ is cow $1$. The $i$th cow has a bucket with integer capacity $a_i$ $(1\le a_i\le {10}^9)$ liters. All buckets are initially full.

Every minute, the cows exchange milk according to a string $s_1{s}_2\dots s_N$ consisting solely of the characters $\text{‘L’}$ and $\text{‘R’}$. if the $i$th cow has at least $1$ liter of milk, she will pass $1$ liter of milk to the cow to her left if $s_i=\text{‘L’}$, or to the right if $s_i=\text{‘R’}$. All exchanges happen simultaneously (i.e., if a cow has a full bucket but gives away a liter of milk but also receives a liter, her milk is preserved). If a cow's total milk ever ends up exceeding $a_i$, then the excess milk will be lost.

FJ wants to know: after $M$ minutes $(1\le M\le {10}^9$), what is the total amount of milk left among all cows?

The second line contains a string $s_1{s}_2\dots s_N$ consisting solely of the characters ‘L’ or $\text{‘R’}$, denoting the direction each cow will pass their milk in.

The third line contains integers $a_1,a_2,\dots ,a_N$, the capacities of each bucket.

3 1
RRL
1 1 1

2