Fast Matrix Calculation HDU-4965 矩阵快速幂

Fast Matrix Calculation

SOLUTION

$已知A_{n\ast k}，B_{k\ast n}，n<1000，k<6，要求(AB{)}^{n^2}有,$

$(AB{)}^{n^2}=A\ast (BA{)}^{n^2-1}\ast B，其中(BA{)}_{k\ast k}$

CODE

/*SiberianSquirrel*/
/*CuteKiloFish*/
#include<bits/stdc++.h>
using namespace std;

const int MOD = 6;

int n, k;
int A[1001][1001], B[1001][1001];
int temp[1001][1001], ans[1001][1001];

struct Matrix {
    static const int M = 6;
    int mx[M][M];
    Matrix(){
        memset(mx, 0, sizeof mx);
    }
    void Out() {
        for(auto & i : mx) {
            for(auto j : i)
                cout << j << ' ';
            cout << endl;
        }
    }
    void Tranfer_E() {
        memset(mx, 0, sizeof mx);
        for(int i = 0; i < M; ++ i) mx[i][i] = 1;
    }
    Matrix operator * (const struct Matrix a)const {
        Matrix x;
        memset(x.mx, 0, sizeof x.mx);
        for(int i = 0; i < M; ++i)
            for(int j = 0; j < M; ++j)
                for(int k = 0; k < M; ++k)
                    x.mx[i][j] = (x.mx[i][j] + 1ll * mx[i][k] * a.mx[k][j] % MOD) % MOD;
        return x;
    }
}C;

Matrix mat_pow(Matrix mx, long long p) {
    Matrix res;
    res.Tranfer_E();
    for(; p; p >>= 1, mx = mx * mx)
        if(p & 1) res = res * mx;
    return res;
}

void solve(long long res = 0) {
    C = mat_pow(C, n * n - 1);
    memset(temp, 0, sizeof temp);
    for(int i = 0; i < n; ++ i) {
        for(int _k = 0; _k < k; ++ _k) {
            for(int j = 0; j < k; ++ j) {
                temp[i][j] = (temp[i][j] + A[i][_k] * C.mx[_k][j] % MOD) % MOD;
            }
        }
    }
    memset(ans, 0, sizeof ans);
    for(int i = 0; i < n; ++ i) {
        for(int _k = 0; _k < k; ++ _k) {
            for(int j = 0; j < n; ++ j) {
                ans[i][j] = (ans[i][j] + temp[i][_k] * B[_k][j] % MOD) % MOD;
            }
        }
    }

    for(int i = 0; i < n; ++ i)
        for(int j = 0; j < n; ++ j)
            res += ans[i][j];
    cout << res << endl;
}

int main() {
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(nullptr);
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
#endif
    while(cin >> n >> k) {
        memset(C.mx, 0, sizeof C.mx);
        for(int i = 0; i < n; ++ i) {
            for(int j = 0; j < k; ++ j) {
                cin >> A[i][j];
                A[i][j] %= 6;
            }
        }
        for (int i = 0; i < k; ++i) {
            for(int j = 0; j < n; ++ j) {
                cin >> B[i][j];
                B[i][j] %= 6;
            }
        }
        for (int i = 0; i < k; ++i)
            for (int _k = 0; _k < n; ++_k)
                for (int j = 0; j < k; ++j)
                    C.mx[i][j] = (C.mx[i][j] + B[i][_k] * A[_k][j] % MOD) % MOD;
        if(n + k) solve();
        else break;
    }
    return 0;
}