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
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
using namespace std;
struct PairHash {
inline std::size_t operator()(const std::pair<int, int> &v) const { return v.first * 31 + v.second; }
};
#define Code ios_base::sync_with_stdio(false);
#define By ios::sync_with_stdio(0);
#define Sumfi cout.tie(NULL);
using ll = long long;
using ld = long double;
const ld PI = 3.14159265358979323846;
const ll INF = 1e18;
const ld EPS = 1e-9;
const ll MAX_N = 101010;
const ll mod = 1e9+7;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef array<ll,3> all3;
typedef array<ll,5> all5;
typedef vector<all3> vall3;
typedef vector<all5> vall5;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef unordered_set<ll> usll;
typedef unordered_set<pll, PairHash> uspll;
typedef unordered_map<ll, ll> umll;
#define rep(i,n) for(ll i=0;i<n;i++)
#define rrep(i,m,n) for(ll i=n;i>=m;i--)
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
ll __gcd(ll x, ll y) { return !y ? x : __gcd(y, x % y); }
ll __lcm(ll x, ll y) { return x * y / __gcd(x,y); }
using namespace std;
ll dp[MAX_N];
ll helper(vvll& seq, ll p, ll k, ll pp = -1) {
if(seq.size() == k + 1) return end(seq[k]) - lower_bound(all(seq[k]),p);
if(pp != -1 and pp >= seq[k].size()) return 0;
if(pp == -1) {
if(seq[k].back() < p) return 0;
pp = lower_bound(all(seq[k]), p) - begin(seq[k]);
p = seq[k][pp];
}
if(dp[p] != -1) return dp[p];
ll& res = dp[p] = helper(seq, p, k + 1);
if(pp + 1 < seq[k].size())
res = (res + helper(seq, seq[k][pp + 1], k, pp + 1)) % mod;
return res;
}
ll solve(string s) {
memset(dp, -1, sizeof dp);
unordered_map<char, ll> mp{{'c',0},{'h',1},{'o',2},{'k',3},{'u',4},{'d',5},{'a',6},{'i',7}};
vvll seq(8);
rep(i, s.length()) {
if(!mp.count(s[i])) continue;
seq[mp[s[i]]].push_back(i);
}
rep(i,8) if(seq[i].empty()) return 0;
return helper(seq, 0, 0);
}
int main() {
Code By Sumfi
ll tc = 1;
for (ll i = 1; i <= tc; i++) {
string s;
cin>>s;
cout<<solve(s)<<endl;
}
return 0;
}
|
