【CSP】202006-4 1246 (digits) DP (64‘) 矩阵快速幂 (96‘)

DP (64’)

#include <iostream>
#include <cstdio>
#include <map>
#include <cstring>

#define mm(a) memset(a, 0, sizeof(a))
using namespace std;
typedef long long ll;
const int state = 14;
const int mod = 998244353;
ll dp[500005][state+1];

// S=1和S=2编号
map<string, int> mp;
void init_mp(){
    mp["1"] = 1; mp["2"] = 2; mp["4"] = 3; mp["6"] = 4;
    mp["16"] = 5; mp["26"] = 6; mp["41"] = 7; mp["44"] = 8;
    mp["46"] = 9; mp["61"] = 10; mp["62"] = 11; mp["64"] = 12;
    mp["66"] = 13; mp["42"] = 14;
}

int main(){
    init_mp();
    int n;
    string s;
    cin >> n >> s;
    // 初始1由1自身推出
    dp[0][1] = 1;
    // n次推导, dp[i][j]表示推导第i次的编号为j的个数
    // 如dp[i][9] += dp[i-1][6] + dp[i-1][13]
    // 表示推导第i次的编号9 (即"46")
    // 由第i-1次 (即上次)的编号6 (即"26"->"<46>4")和编号13 (即"66"->"6<46>4")得出
    for(int i = 1; i <= n; i++){
        dp[i][1] += dp[i-1][3];
        dp[i][2] += dp[i-1][1];
        dp[i][3] += dp[i-1][2] + dp[i-1][4];
        dp[i][4] += dp[i-1][3] + dp[i-1][4];
        dp[i][5] += dp[i-1][3];
        dp[i][6] += dp[i-1][5];
        dp[i][7] += dp[i-1][12];
        dp[i][8] += dp[i-1][11];
        dp[i][9] += dp[i-1][6] + dp[i-1][13];
        dp[i][10] += dp[i-1][8];
        dp[i][11] += dp[i-1][7];
        dp[i][12] += dp[i-1][4] + dp[i-1][14];
        dp[i][13] += dp[i-1][9];
        dp[i][14] += dp[i-1][10];
        for(int j = 1; j <= 14; j++) dp[i][j] %= mod;
    }
    int idx = mp[s];
    cout << dp[n][idx] << endl;
    return 0;
}

矩阵快速幂 (96’)

#include <iostream>
#include <cstdio>
#include <map>
#include <cstring>

#define mm(a) memset(a, 0, sizeof(a))
using namespace std;
typedef long long ll;
const int state = 14;
const int mod = 998244353;

//矩阵快速幂
struct mat{
    ll m[state+1][state+1];
}unit, a;
void init(){
    mm(unit.m);
    for (int i = 1; i < state; i++) unit.m[i][i] = 1;
}
mat matmul(mat a, mat b){
    mat c;
    for (int i = 1; i <= state; i++){
        for (int j = 1; j <= state; j++){
            ll tmp = 0;
            for (int k = 1; k <= state; k++) {
                tmp = (tmp+a.m[i][k]*b.m[k][j]%mod)%mod;
            }
            c.m[i][j] = tmp;
        }
    }
    return c;
}
mat quickpow(mat a, ll n){
    init();
    mat ans = unit;
    while (n){
        if (n&1) ans = matmul(ans, a);
        a = matmul(a, a);
        n >>= 1;
    }
    return ans;
}
// S=1和S=2编号
map<string, int> mp;
void init_mp(){
    mp["1"] = 1; mp["2"] = 2; mp["4"] = 3; mp["6"] = 4;
    mp["16"] = 5; mp["26"] = 6; mp["41"] = 7; mp["44"] = 8;
    mp["46"] = 9; mp["61"] = 10; mp["62"] = 11; mp["64"] = 12;
    mp["66"] = 13; mp["42"] = 14;
}
int main(){
	// 根据DP解法的状态转移矩阵获得
    mat a = {{
        {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, //0
        {0,0,0,1,0,0,0,0,0,0,0,0,0,0,0}, //1
        {0,1,0,0,0,0,0,0,0,0,0,0,0,0,0}, //2
        {0,0,1,0,1,0,0,0,0,0,0,0,0,0,0}, //3
        {0,0,0,1,1,0,0,0,0,0,0,0,0,0,0}, //4
        {0,0,0,1,0,0,0,0,0,0,0,0,0,0,0}, //5
        {0,0,0,0,0,1,0,0,0,0,0,0,0,0,0}, //6
        {0,0,0,0,0,0,0,0,0,0,0,0,1,0,0}, //7
        {0,0,0,0,0,0,0,0,0,0,0,1,0,0,0}, //8
        {0,0,0,0,0,0,1,0,0,0,0,0,0,1,0}, //9
        {0,0,0,0,0,0,0,0,1,0,0,0,0,0,0}, //10
        {0,0,0,0,0,0,0,1,0,0,0,0,0,0,0}, //11
        {0,0,0,0,1,0,0,0,0,0,0,0,0,0,1}, //12
        {0,0,0,0,0,0,0,0,0,1,0,0,0,0,0}, //13
        {0,0,0,0,0,0,0,0,0,0,1,0,0,0,0}  //14
    }};
    init_mp();
    int n;
    string s;
    cin >> n >> s;
    mat ans = quickpow(a, n);
    int t = mp[s];
    ll cnt = ans.m[t][1]%mod;
    cout << cnt;
    return 0;
}

参考一
参考二