提出 #24497062

---

ソースコード 拡げる

// {{{
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using vi = vector<int>;
using pii = pair<int, int>;
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define clr(a, b) memset(a, b, sizeof(a))
#define debug(x...)
#define debug_arr(x...)
#ifdef LOCAL
#include "prettyprint.hpp"
#endif
// }}}

const int mod = 1e9 + 7;
const int N = 1e5 + 10;

int f(char ch)
{
    if (ch == 'c') return 1;
    if (ch == 'h') return 2;
    if (ch == 'o') return 3;
    if (ch == 'k') return 4;
    if (ch == 'u') return 5;
    if (ch == 'd') return 6;
    if (ch == 'a') return 7;
    if (ch == 'i') return 8;
    return 0;
}

char s[N];
LL dp[N][9];

int main()
{
#ifdef LOCAL
    freopen("in", "r", stdin);
    // freopen("out", "w", stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0);

    clr(dp, 0);
    dp[0][0] = 1;

    while (~scanf("%s", s + 1))
    {
        int n = strlen(s + 1);
        for (int i = 0; i < n; i++)
        {
            int ch = f(s[i + 1]);

            for (int j = 0; j <= 8; j++)
            {
                if (dp[i][j] == 0) continue;

                dp[i + 1][j] += dp[i][j];
                dp[i + 1][j] %= mod;
            }

            if (ch >= 1)
            {
                dp[i + 1][ch] += dp[i][ch - 1];
                dp[i + 1][ch] %= mod;
            }
        }

        LL ans = dp[n][8];
        cout << ans << endl;
    }

    return 0;
}

提出情報

ジャッジ結果