1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
#include <iostream>
#include <vector>

using namespace std;

typedef long long ll;

int main()
{
    ios_base::sync_with_stdio(0);
    ll n, m;
    cin >> n;
    vector<ll> kw(n);
    for (int i = 0; i < n; ++i) cin >> kw[i];
    string cy;
    cin >> m >> cy;
    ll os = 0, poz = 0, nr = 1;
    while (1)
    {
        if (cy[poz] == 'W') ++kw[os];
        else --kw[os];
        if (kw[os] == 0)
        {
            cout << nr;
            return 0;
        }
        if (nr == 20000000)
        {
            cout << "-1";
            return 0;
        }
        ++poz;
        ++os;
        if (poz == m) poz = 0;
        if (os == n) os = 0;
        ++nr;
    }
    return 0;
}