Submission #9263426


Source Code Expand

Copy
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
            ∧_∧
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     @hamayanhamayan0
    /   \     | |
    /   / ̄ ̄ ̄ ̄/  |
  __(__ニつ/     _/ .| .|____
     \/____/ (u ⊃
---------------------------------------------------------------------------------------------------*/














int N, K, R, S, P; string T;
string grp[101010];
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> N >> K >> R >> S >> P >> T;
	rep(i, 0, N) grp[i % K] += T[i];

	int ans = 0;
	rep(k, 0, K) {
		int r = 0, s = 0, p = 0;
		if (grp[k][0] == 'r') p = P;
		if (grp[k][0] == 's') r = R;
		if (grp[k][0] == 'p') s = S;

		int n = grp[k].size();
		rep(i, 1, n) {
			int rr = max(s, p);
			int ss = max(r, p);
			int pp = max(r, s);

			if (grp[k][i] == 'r') pp += P;
			if (grp[k][i] == 's') rr += R;
			if (grp[k][i] == 'p') ss += S;

			r = rr;
			s = ss;
			p = pp;
		}

		ans += max({ r, s, p });
	}
	cout << ans << endl;
}





Submission Info

Submission Time
Task D - Prediction and Restriction
User hamayanhamayan
Language C++14 (GCC 5.4.1)
Score 400
Code Size 2015 Byte
Status AC
Exec Time 10 ms
Memory 5328 KB

Judge Result

Set Name Sample All after_contest
Score / Max Score 0 / 0 400 / 400 0 / 0
Status
AC × 3
AC × 58
AC
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 101.txt, 102.txt, 103.txt, 104.txt, 105.txt, 106.txt, 107.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, s1.txt, s2.txt, s3.txt
after_contest
Case Name Status Exec Time Memory
01.txt AC 2 ms 1024 KB
02.txt AC 2 ms 1024 KB
03.txt AC 2 ms 1024 KB
04.txt AC 2 ms 1024 KB
05.txt AC 2 ms 1024 KB
06.txt AC 2 ms 1024 KB
07.txt AC 2 ms 1024 KB
08.txt AC 2 ms 1024 KB
09.txt AC 6 ms 2688 KB
10.txt AC 2 ms 1152 KB
101.txt AC 9 ms 4432 KB
102.txt AC 3 ms 1280 KB
103.txt AC 9 ms 4432 KB
104.txt AC 3 ms 1360 KB
105.txt AC 2 ms 1024 KB
106.txt AC 2 ms 1024 KB
107.txt AC 3 ms 1360 KB
11.txt AC 5 ms 1920 KB
12.txt AC 3 ms 1280 KB
13.txt AC 8 ms 4352 KB
14.txt AC 2 ms 1024 KB
15.txt AC 4 ms 2176 KB
16.txt AC 2 ms 1152 KB
17.txt AC 5 ms 1664 KB
18.txt AC 3 ms 1280 KB
19.txt AC 9 ms 4096 KB
20.txt AC 3 ms 1280 KB
21.txt AC 9 ms 3712 KB
22.txt AC 3 ms 1408 KB
23.txt AC 10 ms 5328 KB
24.txt AC 3 ms 1280 KB
25.txt AC 8 ms 2512 KB
26.txt AC 3 ms 1360 KB
27.txt AC 9 ms 3456 KB
28.txt AC 3 ms 1360 KB
29.txt AC 8 ms 3328 KB
30.txt AC 3 ms 1360 KB
31.txt AC 10 ms 4736 KB
32.txt AC 3 ms 1280 KB
33.txt AC 9 ms 3584 KB
34.txt AC 3 ms 1360 KB
35.txt AC 10 ms 4864 KB
36.txt AC 3 ms 1280 KB
37.txt AC 7 ms 2384 KB
38.txt AC 3 ms 1280 KB
39.txt AC 9 ms 3456 KB
40.txt AC 7 ms 1360 KB
41.txt AC 3 ms 1408 KB
42.txt AC 3 ms 1408 KB
43.txt AC 2 ms 1280 KB
44.txt AC 3 ms 1280 KB
45.txt AC 3 ms 1408 KB
46.txt AC 3 ms 1408 KB
47.txt AC 3 ms 1280 KB
48.txt AC 3 ms 1280 KB
s1.txt AC 2 ms 1024 KB
s2.txt AC 2 ms 1024 KB
s3.txt AC 2 ms 1024 KB