P3193 [HNOI2008]GT考试

题意：

（题目来源：洛谷）

解题思路：

• 看数据规模这道题用数位dp就显然不行 （然后我就看了题解
• 设dp[i][j]代表长串匹配到第i位，短串匹配到第j位的答案
• 设a[i][j]代表模式串的第$i位到第j位有多少种添加数的方案
• $dp[i][j]={\sum }_{k=0}^{m-1}dp[i-1][k]\ast a[i][j]$
  
  （借用大佬博客的内容）

AC代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 40;
string s;
int nxt[maxn];
ll n, m, mod;
struct Matrix {
    ll mat[maxn][maxn];
    Matrix(int x) {
        memset(mat, 0, sizeof(mat));
        for (int i = 0; i < maxn; i++) mat[i][i] = x;
    }
    friend Matrix operator * (const Matrix A, const Matrix B) {
        Matrix C(0);
        for (int i = 0; i < m; i++)
            for (int j = 0; j < m; j++)
                for (int k = 0; k < m; k++)
                    C.mat[i][j] = (C.mat[i][j] + A.mat[i][k] * B.mat[k][j]) % mod;
        return C;
    }
};
Matrix a(0);
Matrix qpow(Matrix a, int b) {
    Matrix res(1);
    while (b) {
        if (b & 1) res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}
void getnxt() {
    int l = s.size(), i = 0, j = -1;
    nxt[i] = j;
    while (i < l) {
        if (j == -1 || s[i] == s[j]) i++, j++, nxt[i] = j;
        else j = nxt[j];
    }
}
//a[i][j]代表模式串的第i位到第j位有多少种添加数的方案
//dp[i][j] = dp[i][k] * a[k][j] (k从0到m-1的总和)
void geta() {
    for (int i = 0; i < m; i++)
        for (char j = '0'; j <= '9'; j++) {
            int x = i;
            while (x && s[x] != j) x = nxt[x];
            if (s[x] == j) x++;
            if (x != m) a.mat[i][x]++;
        }
}
int main() {
    cin >> n >> m >> mod >> s;
    getnxt();
    geta();
    a = qpow(a, n);
    ll ans = 0;
    for (int i = 0; i < m; i++) ans = (ans + a.mat[0][i]) % mod;
    cout << ans << endl;
}