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
40
41
42
43
44
45
46
#include <cstdio>
#pragma warning(disable : 4996)
#define LIMIT 1000000

using namespace std;

int n, m;
char S[LIMIT + 1];
int M[LIMIT + 1];

long long int NWD(long long int a, long long int b)
{
	if (b == 0)
		return a;
	return NWD(b, a%b);
}

int main()
{
	scanf("%d\n", &n);
	for (int i = 0; i < n; i++)
		scanf("%d", &M[i]);
	scanf("%d\n", &m);
	for (int i = 0; i < n; i++)
		scanf("%c", &S[i]);
	int ps=0, pm=0;
	long long int steps = 0, nww = n*m / NWD(n, m);
	bool lost = false;
	while (!lost && steps < nww)
	{
		if (S[ps] == 'W')
			M[pm]++;
		else
			M[pm]--;
		if (M[pm] == 0)
			lost = true;
		pm = (pm + 1) % n;
		ps = (ps + n) % m;
		steps++;
	}
	if (lost)
		printf("%lld", steps);
	else
		printf("-1");
	return 0;
}