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
#include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
#include <deque>
#include <tuple>

using std::begin;
using std::end;

class solution {
  std::deque<std::vector<int32_t>> altitudes = {{}};
  int32_t sea_level = 0, elements = 0;
  int32_t whole_sum;
  std::vector<int32_t>& at(const int32_t altitude) {
    int32_t position = sea_level + altitude;
    if(position < 0) {
      sea_level += 1;
      altitudes.emplace_front();
      return altitudes.front();
     }
    if(position >= static_cast<int32_t>(altitudes.size())) {
      altitudes.emplace_back();
      return altitudes.back();
     }
    return altitudes[position];
   }
  public:
   void clear() {
     sea_level = elements = 0;
     altitudes.clear();
     altitudes.emplace_back();
    }
   void add(const int32_t altitude, const int32_t game_number) {
     at(altitude).push_back(game_number);
     elements += 1;
     whole_sum = altitude;
    }
   size_t size() const {
     return elements;
    }
   bool is_that(int32_t altitude) const {
     const auto temp = sea_level + altitude;
     if(temp < 0 || temp >= static_cast<int32_t>(altitudes.size())) {
       return false;
      }
     return true;
    }
   int64_t distance(const int32_t p, const int32_t q) const { 
     if(p <= q) {
       return q-p+1;
      }
     return elements-p+q+1;
    }
   int64_t solve(const int32_t money, const int32_t altitude, const int32_t game_number) {
     if(money == 0) {
       return 0;
      }
     if(is_that(altitude - money) == false && whole_sum >=0) {
       return -1;
      }
     if(is_that(altitude - money) == true) {
       const auto& temp = at(altitude-money);
       const auto it = std::lower_bound(begin(temp), end(temp), game_number);
       const auto q = (it == end(temp) ? temp.front() : *it);
       return distance(game_number, q);
      }
     if(game_number != 0) {
       return (elements - game_number) + solve(money - (altitude-whole_sum), 0, 0);
      }
     const int64_t x = (money-sea_level-1)/(-whole_sum);
     if(x > 7)
      return elements*x + solve(money + x*whole_sum, 0, 0);
     return elements + solve(money + whole_sum, 0, 0);
    }
 };

typedef std::tuple<int32_t, int32_t> connection;

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  uint32_t n;
  std::cin >> n;
  std::vector<int32_t> money;
  money.reserve(n);
  std::copy_n(std::istream_iterator<int32_t>(std::cin), n,
              std::back_inserter(money));
  uint32_t m;
  std::cin >> m;
  std::string cycle;
  cycle.reserve(m);
  std::cin >> cycle;
  std::vector<bool> visited(m, false);
  std::vector<connection> info(m);
  std::vector<size_t> participants;
  participants.reserve(n);
  int64_t answer = -1;
  solution route;
  for(size_t i = 0; i < cycle.size(); ++i) {
    if(visited[i] == false) {
      participants.clear();
      route.clear();
      int32_t actual_altitude = 0;
      int32_t game_number = 0;
      for(size_t j = i; visited[j] == false; j += n, j %= m) {
        if(j < n)participants.push_back(j);
        visited[j] = true;
        info[j] = std::make_tuple(actual_altitude, game_number);
        if(cycle[j] == 'W') {
          actual_altitude += 1;
         }
        else {
          actual_altitude -= 1;
         }
        route.add(actual_altitude, game_number);
        ++game_number;
       }

      for(size_t number : participants) 
        for(size_t i = number; i < n; i += m) {
         const int64_t temp_answer = route.solve(money[i], std::get<0>(info[i%m]),
                                                           std::get<1>(info[i%m]));
         const int64_t value = 1 + static_cast<int64_t>(i) + n*(temp_answer-1);
        if(answer < 0 && temp_answer > 0) {
          answer = value;
         }
        else if(temp_answer > 0 && answer > value) {
          answer = value;
         }
       }
     }
   }
  std::cout << answer << '\n';
 }