Problem p02820 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
// created [2019/12/29] 20:04:22
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using uint = unsigned int;
using usize = std::size_t;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <typename T, usize n> using arr = T (&)[n];
template <typename T, usize n> using c_arr = const T (&)[n];
template <typename T> constexpr T popcount(const T u) {
  return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u)))
           : static_cast<T>(0);
}
template <typename T> constexpr T log2p1(const T u) {
  return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u)))
           : static_cast<T>(0);
}
template <typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template <typename T> constexpr T lsbp1(const T u) {
  return __builtin_ffsll(u);
}
template <typename T> constexpr T clog(const T u) {
  return u ? log2p1(u - 1) : static_cast<T>(u);
}
template <typename T> constexpr bool ispow2(const T u) {
  return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0;
}
template <typename T> constexpr T ceil2(const T u) {
  return static_cast<T>(1) << clog(u);
}
template <typename T> constexpr T floor2(const T u) {
  return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1);
}
template <typename T> constexpr bool btest(const T mask, const usize ind) {
  return static_cast<bool>((static_cast<u64>(mask) >> ind) &
                           static_cast<u64>(1));
}
template <typename T> void bset(T &mask, const usize ind) {
  mask |= (static_cast<T>(1) << ind);
}
template <typename T> void breset(T &mask, const usize ind) {
  mask &= ~(static_cast<T>(1) << ind);
}
template <typename T> void bflip(T &mask, const usize ind) {
  mask ^= (static_cast<T>(1) << ind);
}
template <typename T> void bset(T &mask, const usize ind, const bool b) {
  (b ? bset(mask, ind) : breset(mask, ind));
}
template <typename T> constexpr T bcut(const T mask, const usize ind) {
  return ind == 0 ? static_cast<T>(0)
                  : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >>
                                   (64 - ind));
}
template <typename T> bool chmin(T &a, const T &b) {
  return (a > b ? a = b, true : false);
}
template <typename T> bool chmax(T &a, const T &b) {
  return (a < b ? a = b, true : false);
}
constexpr unsigned int mod = 1000000007;
template <typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4;
template <typename Real>
constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
auto mfp = [](auto &&f) {
  return [=](auto &&...args) {
    return f(f, std::forward<decltype(args)>(args)...);
  };
};

template <typename T> T in() {
  T v;
  return std::cin >> v, v;
}
template <typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) {
  return in<T>();
}
template <typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type &szs) {
  const usize s = (usize)szs[i];
  std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
  for (usize j = 0; j < s; j++) {
    ans[j] = in_v<T, Uint, n, i + 1>(szs);
  }
  return ans;
}
template <typename T, typename Uint, usize n> auto in_v(c_arr<Uint, n> szs) {
  return in_v<T, Uint, n, 0>(szs);
}
template <typename... Types> auto in_t() {
  return std::tuple<std::decay_t<Types>...>{in<Types>()...};
}
struct io_init {
  io_init() {
    std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(20);
  }
  void clear() { std::cin.tie(), std::ios::sync_with_stdio(true); }
} io_setting;

template <typename T> int out(const T &v) { return std::cout << v, 0; }
template <typename T> int out(const std::vector<T> &v) {
  for (usize i = 0; i < v.size(); i++) {
    if (i > 0) {
      std::cout << ' ';
    }
    out(v[i]);
  }
  return std::cout << "\n", 0;
}
template <typename T1, typename T2> int out(const std::pair<T1, T2> &v) {
  return out(v.first), std::cout << ' ', out(v.second), 0;
}
template <typename T, typename... Args>
int out(const T &v, const Args... args) {
  return out(v), std::cout << ' ', out(args...), 0;
}
template <typename... Args> int outln(const Args... args) {
  return out(args...), std::cout << '\n', 0;
}
template <typename... Args> void outel(const Args... args) {
  return out(args...), std::cout << std::endl, 0;
}
#define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }

template <typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type,
            const T &v = T{}) {
  return v;
}
template <typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs,
            const T &v = T{}) {
  const usize s = (usize)szs[i];
  return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(
      s, make_v<T, Uint, n, i + 1>(szs, v));
}
template <typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T &t = T{}) {
  return make_v<T, Uint, n, 0>(szs, t);
}
int main() {
  const int N = in<int>();
  const int K = in<int>();
  const auto S = in_v<ll>({3});
  const auto T = in<std::string>();
  std::vector<std::string> Q(K);
  for (int i = 0; i < K; i++) {
    for (int j = i; j < N; j += K) {
      Q[i].push_back(T[j] == 's' ? 0 : T[j] == 'p' ? 1 : 2);
    }
  }
  ll ans = 0;
  for (int i = 0; i < K; i++) {
    const int N = Q[i].size();
    auto dp = make_v({N + 1, 4}, -inf_v<ll>);
    dp[0][3] = 0;
    for (int j = 0; j < N; j++) {
      const int q = Q[i][j];
      for (int p = 0; p <= 3; p++) {
        for (int np = 0; np < 3; np++) {
          if (p == np) {
            continue;
          }
          chmax(dp[i + 1][np], dp[i][p] + (np == q ? S[q] : 0LL));
        }
      }
    }
    ll max = -inf_v<ll>;
    for (int p = 0; p < 3; p++) {
      chmax(max, dp[N][p]);
    }
    ans += max;
  }
  outln(ans);
  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
// created [2019/12/29] 20:04:22
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using uint = unsigned int;
using usize = std::size_t;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <typename T, usize n> using arr = T (&)[n];
template <typename T, usize n> using c_arr = const T (&)[n];
template <typename T> constexpr T popcount(const T u) {
  return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u)))
           : static_cast<T>(0);
}
template <typename T> constexpr T log2p1(const T u) {
  return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u)))
           : static_cast<T>(0);
}
template <typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template <typename T> constexpr T lsbp1(const T u) {
  return __builtin_ffsll(u);
}
template <typename T> constexpr T clog(const T u) {
  return u ? log2p1(u - 1) : static_cast<T>(u);
}
template <typename T> constexpr bool ispow2(const T u) {
  return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0;
}
template <typename T> constexpr T ceil2(const T u) {
  return static_cast<T>(1) << clog(u);
}
template <typename T> constexpr T floor2(const T u) {
  return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1);
}
template <typename T> constexpr bool btest(const T mask, const usize ind) {
  return static_cast<bool>((static_cast<u64>(mask) >> ind) &
                           static_cast<u64>(1));
}
template <typename T> void bset(T &mask, const usize ind) {
  mask |= (static_cast<T>(1) << ind);
}
template <typename T> void breset(T &mask, const usize ind) {
  mask &= ~(static_cast<T>(1) << ind);
}
template <typename T> void bflip(T &mask, const usize ind) {
  mask ^= (static_cast<T>(1) << ind);
}
template <typename T> void bset(T &mask, const usize ind, const bool b) {
  (b ? bset(mask, ind) : breset(mask, ind));
}
template <typename T> constexpr T bcut(const T mask, const usize ind) {
  return ind == 0 ? static_cast<T>(0)
                  : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >>
                                   (64 - ind));
}
template <typename T> bool chmin(T &a, const T &b) {
  return (a > b ? a = b, true : false);
}
template <typename T> bool chmax(T &a, const T &b) {
  return (a < b ? a = b, true : false);
}
constexpr unsigned int mod = 1000000007;
template <typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4;
template <typename Real>
constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
auto mfp = [](auto &&f) {
  return [=](auto &&...args) {
    return f(f, std::forward<decltype(args)>(args)...);
  };
};

template <typename T> T in() {
  T v;
  return std::cin >> v, v;
}
template <typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) {
  return in<T>();
}
template <typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type &szs) {
  const usize s = (usize)szs[i];
  std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
  for (usize j = 0; j < s; j++) {
    ans[j] = in_v<T, Uint, n, i + 1>(szs);
  }
  return ans;
}
template <typename T, typename Uint, usize n> auto in_v(c_arr<Uint, n> szs) {
  return in_v<T, Uint, n, 0>(szs);
}
template <typename... Types> auto in_t() {
  return std::tuple<std::decay_t<Types>...>{in<Types>()...};
}
struct io_init {
  io_init() {
    std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(20);
  }
  void clear() { std::cin.tie(), std::ios::sync_with_stdio(true); }
} io_setting;

template <typename T> int out(const T &v) { return std::cout << v, 0; }
template <typename T> int out(const std::vector<T> &v) {
  for (usize i = 0; i < v.size(); i++) {
    if (i > 0) {
      std::cout << ' ';
    }
    out(v[i]);
  }
  return std::cout << "\n", 0;
}
template <typename T1, typename T2> int out(const std::pair<T1, T2> &v) {
  return out(v.first), std::cout << ' ', out(v.second), 0;
}
template <typename T, typename... Args>
int out(const T &v, const Args... args) {
  return out(v), std::cout << ' ', out(args...), 0;
}
template <typename... Args> int outln(const Args... args) {
  return out(args...), std::cout << '\n', 0;
}
template <typename... Args> void outel(const Args... args) {
  return out(args...), std::cout << std::endl, 0;
}
#define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }

template <typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type,
            const T &v = T{}) {
  return v;
}
template <typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs,
            const T &v = T{}) {
  const usize s = (usize)szs[i];
  return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(
      s, make_v<T, Uint, n, i + 1>(szs, v));
}
template <typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T &t = T{}) {
  return make_v<T, Uint, n, 0>(szs, t);
}
int main() {
  const int N = in<int>();
  const int K = in<int>();
  const auto S = in_v<ll>({3});
  const auto T = in<std::string>();
  std::vector<std::string> Q(K);
  for (int i = 0; i < K; i++) {
    for (int j = i; j < N; j += K) {
      Q[i].push_back(T[j] == 's' ? 0 : T[j] == 'p' ? 1 : 2);
    }
  }
  ll ans = 0;
  for (int i = 0; i < K; i++) {
    const int N = Q[i].size();
    auto dp = make_v({N + 1, 4}, -inf_v<ll>);
    dp[0][3] = 0;
    for (int j = 0; j < N; j++) {
      const int q = Q[i][j];
      for (int p = 0; p <= 3; p++) {
        for (int np = 0; np < 3; np++) {
          if (p == np) {
            continue;
          }
          chmax(dp[j + 1][np], dp[j][p] + (np == q ? S[q] : 0LL));
        }
      }
    }
    ll max = -inf_v<ll>;
    for (int p = 0; p < 3; p++) {
      chmax(max, dp[N][p]);
    }
    ans += max;
  }
  outln(ans);
  return 0;
}