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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
#include<iostream>

#include<cstdio>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;

long long n,m;
long long savings[1000002];
long long result[1000002];
long long sum[1000002];
long long cycle[1000002];
long long group[1000002];

long long res[1000002];
long long INF = 1000000000000000000LL;

long long values[2000005];
vector< vector<long long> > players(1000001, vector<long long>() );

long long CONST=1000002;
void solve(long long cycle_sum, long long cycle_min, long long len){
  //printf("solve cycle_sum %lld\n", cycle_sum);
  long long players_count = 0;
  long long xmin=CONST, xmax=CONST;
  long long xmin2=CONST, xmax2=CONST;
  sum[0] = result[cycle[0]];
    map<long long, long long> mymap;
  mymap.insert ( std::pair<long long, long long>(sum[0],0) );

  //printf("%d, %lld\n",cycle[0], sum[0]);
  for(int i = 1; i < len; i++){
    sum[i] = sum[i-1] + result[cycle[i]];
    if(mymap.find(sum[i])== mymap.end())
      mymap.insert ( std::pair<long long, long long>(sum[i],i) );
  //  printf("%d, %lld\n",cycle[i], sum[i]);
  }
  long long sum_rev = 0;
  for(int i = len-1; i >=0; i--) {
    int index = cycle[i];
    //printf("cycle %d\n",cycle[i]);
    sum_rev += result[index];
    long long converted = sum[i]+CONST;
    //printf("SET %lld\n",  sum[i]);
    values[converted] = i;
    xmin = min(xmin, converted);
    xmin = max(xmax, converted);
    
    for(vector<long long>::iterator it = players[index].begin(); it != players[index].end(); ++it) {
      //printf("player %d\n", *it);
      long long player_number = *it;
      long long prev = 0;
      if(i>0) prev = sum[i-1];
      long long save = savings[player_number];
      //printf("value %lld\n", values[(prev - save) + CONST]);
      //printf("GET %lld\n", (prev - save));
      if(values[(prev - save) + CONST]>=0) {
        res[*it] = (player_number + 1) + (values[(prev - save) + CONST] - i) * n;
        savings[player_number] = 0;
      } else {
          //if(savings[player_number]<=0)
        //printf("nr %lld, savings %lld\n", player_number, savings[player_number]);
        savings[player_number] += (sum[len-1] - prev);
        //if(savings[player_number]<=0)
        //printf("nr %lld, savings %lld, diff %lld\n", player_number, savings[player_number], (sum[len-1] - prev));
        res[player_number] = (player_number + 1) + ((len-1) - i + 1) * n;
      }
    }
  }
  
  for(long long i = 0; i < len; i++) {
    int index = cycle[i];
    for(vector<long long>::iterator it = players[index].begin(); it != players[index].end(); ++it) {
      int player_number = *it;
      if(savings[player_number]>0){
        if((savings[player_number] + cycle_min)>0){
          if(cycle_sum>=0){
            res[player_number] = -1;
          } else {
            long long count = (savings[player_number] + cycle_min)/abs(cycle_sum);
            
            res[player_number] += count * n * len;
            savings[player_number] += count * cycle_sum;
            //if (savings[player_number] < 0)
            //printf("nr %d, savings %lld, cycle_sum %lld , cycle_min %lld\n", player_number, savings[player_number], cycle_sum, cycle_min);
          }
        }
        int ind = mymap[-savings[player_number]];
        res[player_number] +=ind * n;

      }
    }
  }
  for(long a = xmin; a <=xmax; a++){
    values[a] = -1;
  }
}

int main(){
  scanf("%lld", &n);
 
  for(int i = 0; i < n; i++){
    scanf("%lld", &savings[i]);
    //printf("%d\n", savings[i]);
  }
  char c;
  scanf("%lld", &m);
  scanf("%c", &c);
  for(int i = 0; i < m; i++){
    scanf("%c", &c);
    if(c=='W') result[i] = 1; else result[i] = -1;
    //printf("%d\n", result[i]);
  }
 
   for(long i = 0; i <= 2000003; i++){
    values[i] = -1;
  }
  int gr = 1;
  for(int i = 0; i < n; i++) {
    int k = i % m;
    if (group[k] == 0) {
      int len = 0;
      while(group[k] == 0){
        group[k] = gr;
        k = (k + n) % m;
        len++;
      }
      //printf("gr %d, count %d\n", gr, len);
      gr++;
    }
  }

  for(int i = 0; i < n; i++) {
    players[i % m].push_back(i);
    //printf("%d %d\n", group[i % m], i);
  }
 
  for(int i = 0; i < m; i++) {
    group[i] = 0;
  }

  gr = 1;
  long long cycle_sum = 0;
  long long cycle_min;
  for(int i = 0; i < n; i++) {
    int k = i % m;
    if (group[k] == 0) {
      int len = 0;
      cycle_sum = 0;
      cycle_min = INF;
      while(group[k] == 0){
        cycle_sum += result[k];
        cycle_min = cycle_min < cycle_sum ? cycle_min :  cycle_sum;
        cycle[len] = k;
        group[k] = gr;
        k = (k + n) % m;
        len++;
      }
      //printf("gr %d, count %d, cycle_sum %lld, cycle_min %lld\n", gr, len, cycle_sum, cycle_min);
      solve(cycle_sum, cycle_min, len);
      gr++;
    }
  }  

  long long val = INF;
  for(int i = 0; i < n; i++) {
    //printf("nr %d, res %lld, savings %d\n", i, res[i], savings[i]);
    if(val > res[i]) val = res[i];
  }
  printf("%lld\n", val);
  return 0;
}