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
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
#include<bits/stdc++.h>

using namespace std;

#define int long long

int n, m;
int t[1000001];
int T[1000001];

int wyn = -1;


#undef int
int main(){
	
	//ios_base::sync_with_stdio(0);
	//cin >> n;
	scanf("%lld", &n);
	#define int long long
	for(int i = 0; i < n; i++){
		//cin >> t[i];
		scanf("%lld", &t[i]);
	}
	
	//cin >> m;
	scanf("%lld", &m);
	for(int i = 0; i < m; i++){
		char a;
		//cin >> a;
		scanf(" %c", &a);
		if(a == 'W'){
			T[i] = 1;
		}
		else{
			T[i] = -1;
		}
	}
	vector<int>V[n];
	
	int i = 0;
	
	do{
		for(int j = 0; j < m; j++){
			int pom = j + i;
			if(pom >= n){
				pom %= n;
			}
			V[pom].push_back(T[j]);
			//cout << T[j] << " ";
		}
		i += m;
		//cout << endl;
		if(i >= n){
			i %= n;
		}
	}while(i != 0);
	
	for(int i = 0; i < n; i++){
		int mini = 0;
		int r = 0;
		//int pam = 0;
		
		for(int j = 0; j < V[i].size(); j++){
			r += V[i][j];
			if(r < mini){
				mini = r;
			}
			//cout << V[i][j] << " ";
		}
		//cout << endl;
		int blok = 0ll, row = 0ll;
		int czy = 0;
		if(r >= 0){
			//cout << "r >= 0 " << i << endl;
			if(-mini >= t[i]){
				int pam = 0;
				for(int j = 0; j < V[i].size(); j++){
					pam += V[i][j];
					if(-pam >= t[i]){
						row = j;
						czy = 1;
						break;
					}
				}
			}
		}
		else{
			czy = 1;
			if(-mini >= t[i]){
				int pam = 0;
				for(int j = 0; j < V[i].size(); j++){
					pam += V[i][j];
					if(-pam >= t[i]){
						row = j;
						break;
					}
				}
			}
			else{
				//cout << "r > 0 " << i << endl;
				int mon = t[i] + mini;
				int k = mon / (-r);
				if(mon % r != 0){
					k++;
				}
				blok = k;
				int mm = mon + k * r - mini;
				//cout << mon << " " << k << " " << r << endl;
				int pam = 0;
				for(int j = 0; j < V[i].size(); j++){
					pam += V[i][j];
					if(-pam >= mm){
						row = j;
						break;
					}
				}
				
				//cout << "mm: " << mm << endl;
			}
		}
		//cout << "blok: " << blok << endl;
		int WYN = blok * (m / __gcd(n, m)) * n + row * n + i + 1;
		if(czy && (WYN < wyn || wyn == -1)){
			wyn = WYN;
		}
	}
	//cout << wyn << endl;
	printf("%lld", wyn);
	return 0;
}