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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include <iostream>
#include <string>
using namespace std;


int main()
{
	int n, pom, q = 0, wyn = 0, k=0;
	int tabn[n], tabp[n];
	
	cin >> n;
	
	for(int i = 0; i < n; i++)
	{
		cin >> pom;
		tabn[i] = pom;
		tabp[i] = pom;
	}
	
	cin >> pom;
	int tabm[pom];
	char l[pom];
	cin >> l;
	for(int i = 0; i < pom; i++)
	{
		if(l[i] == 'W') tabm[i] = 1;
		else tabm[i] = -1;
	}
	
	for(int i = 0; i < n * pom; i++)
	{
			tabp[i%n] += tabm[i%pom];
			wyn ++;	
			if(tabp[i%n] == 0)
			{	
				k=1;
				break;
			}
		
	}
	
	if(k == 1)
	{
		cout << wyn;
	}
	else
	{	
	for(int i = 0; i < n; i++)
	{
		if(tabp[i] < tabn[i]) q++;
	}
	
	if(q == 0) 
	{
	cout << -1;
	}
	else
	{
		for(int i = 0; 0==0; i++)
		{
			tabp[i%n] += tabm[i%pom];
			wyn ++;
			if(tabp[i] == 0)
			{
				cout << wyn;
				break;
			}
		}

	}
	}
	
	return 0;
}