2021中国大学生程序设计竞赛（CCPC）- 网络选拔赛（重赛）Nun Heh Heh Aaaaaaaaaaa

Nun Heh Heh Aaaaaaaaaaa

题目链接

代码

#include<bits/stdc++.h>

#define int long long
using namespace std;
const int N = 1e5 + 5;
int mod = 998244353;
int dp[20][N];  // dp[i][j] -> s1取i长度，s2取j长度，包含以 s2[j - 1] 结尾的，长度为 i 的 s1 子串的个数
int num[N];     // num[i] 表示该位置之后 a 的数目
unordered_map<int, int> letter;

int quick_power(int base, int pow) {
    int a = base % mod;
    int res = 1;
    while (pow) {
        if (pow & 1)
            res = (res * a) % mod;
        pow = pow >> 1;
        a = a * a % mod;
    }
    return res % mod - 1;
}

signed main() {
    int t;
    cin >> t;
    string s1 = "nunhehheh";
    while (t--) {
        string s2;
        cin >> s2;
        int n = s1.size();
        int m = s2.size();
        memset(dp, 0, sizeof dp);
        memset(num, 0, sizeof num);
        if(n >= m) {
            cout << "0\n";
            continue;
        }
        for (int i = 0; i <= m; i++)
            dp[0][i] = 1;
        for (int i = m - 2; i >= 0; i--) {
            if (s2[i + 1] == 'a')
                num[i] = num[i + 1] + 1;
            else
                num[i] = num[i + 1];
        }
        dp[0][0] = 1;
        for (int i = 1; i <= n; i++) {
            letter.clear();
            for (int j = 1; j <= m; j++) {
                if (s1[i - 1] == s2[j - 1]) {
                    if (i == 1) {
                        dp[i][j] = 1;
                        continue;
                    } else {
                        dp[i][j] += letter[s1[i - 2] - 'a'];
                        dp[i][j] %= mod;
                    }
                }
                letter[s2[j - 1] - 'a'] = (letter[s2[j - 1] - 'a'] + dp[i - 1][j]) % mod;
            }
        }

        int ans = 0;
        for (int j = n; j <= m; j++) {
            if (dp[n][j] && s1[n - 1] == s2[j - 1]) {
                ans += (dp[n][j] % mod) * quick_power(2, num[j - 1]);
                ans %= mod;
            }
        }
        cout << ans << "\n";
    }
    return 0;
}