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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
//============================================================================
// Name        : Hazard.cpp
// Author      : Tytus Bierwiaczonek
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <stdint.h>
#include <string.h>
#include <stdlib.h>
using namespace std;

uint32_t nwd(uint32_t a, uint32_t b)
{
	while (a != 0 && b != 0)
	{
		if (a > b)
		{
			a = a % b;
		}
		else
		{
			b = b % a;
		}
	}

	return a + b;
}

int main()
{
//	std::ios_base::sync_with_stdio(false);
//	cin.tie(NULL);

	const uint32_t mMax = 1001;
	const uint32_t nMax = 1001;

	char tape[mMax];
	int money[nMax];
	int reszty[mMax], maxLosts[mMax], maxLost, reszta, lost;
	uint64_t result = mMax * nMax;
	bool existsBelow0 = false;

	uint64_t n, m, i, j, k, sw;
	uint64_t d;

	cin >> n;
	for (i = 0; i < n; ++i)
	{
		cin >> money[i];
	}

	cin >> m;
	memset(tape, 0, m + 1);
	cin >> tape;

	for (i = 0; i < m; ++i)
	{
		tape[i] = (tape[i] == 'W' ? 1 : -1);
	}

	d = nwd(n, m);

	for (i = 0; i < d; ++i)
	{
		maxLost = 0;
		lost = 0;
		reszta = 0;
		for (j = i; j < m; j += d)
		{
			reszta += tape[j];
			lost += tape[j];
			if (lost > 0)
			{
				lost = 0;
			}
			maxLost = min(maxLost, lost);
		}
		reszty[i] = reszta;
		maxLosts[i] = maxLost;
		if (!existsBelow0)
		{
			existsBelow0 = (reszta < 0);
		}
	}

	sw = n % m;

	for (i = 0; i < n; ++i)
	{
		if (money[i] <= -maxLosts[i % d])
		{
			uint64_t tempResult = 0;
			int t = money[i];
			for (j = 0; j < m; ++j)
			{
				t += tape[(j * sw + i) % m];
				if (t == 0)
				{
					tempResult = i + 1 + j * n;
					result = min(result, tempResult);
				}
			}
		}
	}

	if (mMax * nMax == result && existsBelow0)
	{
		for (j = 0; j < d; ++j)
		{
			if (reszty[j] < 0)
			{
				for (i = j; i < n; i += d)
				{
					int t = money[i];
					int l = -t / reszty[j]; // t = - reszty[j] * l + c
					t += l * reszty[j]; // t = c
					if (0 == t)
					{
						uint64_t tempResult = n / d * m * (l );
						result = min(result, tempResult);
					}

					for (k = 1; k <= m / d; ++k)
					{
						t += tape[(k * sw + i) % m];
						if (0 == t)
						{
							uint64_t tempResult = m / d * n * (l ) + i + 1 + k * n;
							result = min(result, tempResult);
							break;
						}
					}
				}

			}
		}
	}

	if (result < mMax * nMax)
	{
		cout << result << endl;
	}
	else
	{
		cout << -1 << endl;
	}
	//
	return 0;
}