-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path25427.cpp
51 lines (43 loc) · 970 Bytes
/
25427.cpp
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
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
int xxxx[]={-1,0,1,0,-1,1,1,-1};
int yyyy[]={0,1,0,-1,-1,1,-1,1};
void solve(){
int N; cin >> N;
string str; cin >> str;
ll d=0,k=0,s=0,h=0;
ll result = 0;
for (int i = N-1; i >= 0; i--) {
switch(str[i]) {
case 'D':
result += k;
break;
case 'K':
k += s;
break;
case 'S':
s += h;
break;
case 'H':
h++;
break;
}
}
cout << result;
}
int main()
{
cin.tie(0)->sync_with_stdio(false);
int T=1;
// cin >>T;
while (T--) {
solve();
cout << '\n';
}
return 0;
}