Language: C++

 #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#include <iomanip>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<ll> > vvll;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define irep(it, stl) for(auto it = stl.begin(); it != stl.end(); it++)
#define drep(i,n) for(int i = (n) - 1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define mp(p,q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
int dx8[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy8[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, 1, 0, -1};
template <class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template <class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){ fill((T*)array, (T*)(array+N), val); }
struct io{io(){ios::sync_with_stdio(false);cin.tie(0);}};
const int INF = INT_MAX;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
int main(void) {
    int N,K,R,S,P;
    string T;

    cin >> N >> K >> R >> S >> P;
    cin >> T;
    int dp[100100][3];
    int value[3] = {R,S,P};
    int t[N];
    //0:R,1;S,2:Pとする
    //勝てる手リストを作る
    rep(i,N){
        if(T[i] == 'r') t[i]=2;
        if(T[i] == 's') t[i]=0;
        if(T[i] == 'p') t[i]=1;
    }
    
    //modKで分割して考える
    rep(i,K){
        //グループのスタート、0から始まる、1から始まる,.....,K-1から始まる
        dp[i][t[i]] = value[t[i]];//グループごとの初期値、分割したので最初は何の制限もないので買っておいて損はない
        for (int j = i+K; j < N; j+=K){
        //ここはグループごと
        //modKで分割したのでK個ごとに更新
            rep(l,3){
                if(t[j] == l){//もしkが勝てる手だったら
                    //K個とびの更新なので注意,ここで(l+1)%3、(l+2)%3としてK個前と同じ手は出さないという制約を守っている
                    dp[j][l] = max(dp[j-K][(l+1)%3],dp[j-K][(l+2)%3])+value[l];
                }else{
                    dp[j][l] = max(dp[j-K][(l+1)%3],dp[j-K][(l+2)%3]);
                }
            }
        }
        
    }
    int ans = 0;
    rrep(i,K){
        ans += max(dp[N-i][0],dp[N-i][1],dp[N-i][2]);
    }
    fin(ans);
}

Compiler output:
In file included from /usr/include/c++/14/string:51,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h: In instantiation of 'constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare) [with _Tp = int; _Compare = int]':
a.cc:96:19:   required from here
   96 |         ans += max(dp[N-i][0],dp[N-i][1],dp[N-i][2]);
      |                ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:306:17: error: '__comp' cannot be used as a function
  306 |       if (__comp(__a, __b))
      |           ~~~~~~^~~~~~~~~~