HDU 4965 (矩阵快速幂)

题目链接：点击这里

题意：给出一个$n\times k$的矩阵$A$和$k\times n$的矩阵$B$，设$C=A\times B$，$M=C^{n\times n}$，然后M中所有元素模6求和。

因为$A\times B$的size很大， 做一次乘法复杂度就爆炸了。所以用一下矩阵乘法的结合律。 $$C=(A\times B)^{n\times n}=A\times [(B \times A)^{n\times n-1}]\times B$$

之后矩阵快速幂，在加上两次矩阵乘法就好了。

#include <bits/stdc++.h>
using namespace std;
#define maxn 1005
#define mod 6
#define INF 1111111

int scan () {
    char ch=' ';
    while(ch<'0'||ch>'9')ch=getchar();
    int x=0;
    while(ch<='9'&&ch>='0')x=x*10+ch-'0',ch=getchar();
    return x;
}

int n, k;

struct m {
    int x, y;
    int a[6][6];
    m operator * (m gg) {
        m ans;
        memset (ans.a, 0, sizeof ans.a);
        ans.x = x, ans.y = gg.y;
        for (int i = 0; i < k; i++) {
            for (int j = 0; j < k; j++) {
                for (int l = 0; l < k; l++) {
                    ans.a[i][j] += a[i][l]*gg.a[l][j];
                    ans.a[i][j] %= mod;
                }
            }
        }
        return ans;
    }
    void show () {
        for (int i = 0; i < k; i++) {
            for (int j = 0; j < k; j++)
                cout << a[i][j] << " ";
            cout << endl;
        }
    }
};

m qpow (m a, long long kk) { 
    m ans;
    int i, j;
    for(i = 0; i < k; ++i)
        for(j = 0; j < k; ++j)
            ans.a[i][j] = (i == j ? 1 : 0);
    for(; kk; kk >>= 1) {
        if(kk&1) ans = ans*a;
        a = a*a;
    }
    return ans;
}

int a[maxn][maxn], b[maxn][maxn];

int main () {
    //freopen ("1.txt", "r", stdin);
    while (scanf ("%d%d", &n, &k) == 2 && n+k) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < k; j++) a[i][j] = scan ();
        }
        for (int i = 0; i < k; i++) {
            for (int j = 0; j < n; j++) b[i][j] = scan ();
        }
        m ans;
        memset (ans.a, 0, sizeof ans.a);
        for (int i = 0; i < k; i++) {
            for (int j = 0; j < n; j++) {
                for (int l = 0; l < k; l++) {
                    ans.a[i][l] += b[i][j]*a[j][l];
                    ans.a[i][l] %= 6;
                }
            }
        }

        ans = qpow (ans, n*n-1);
        int ans1[maxn][maxn]; memset (ans1, 0, sizeof ans1);
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < k; j++) {
                for (int l = 0; l < k; l++) {
                    ans1[i][l] += a[i][j]*ans.a[j][l];
                    ans1[i][l] %= 6;
                }
            }
        }

        int ans2[maxn][maxn];
        memset (ans2, 0, sizeof ans2);
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < k; j++) {
                for (int l = 0; l < n; l++) {
                    ans2[i][l] += ans1[i][j]*b[j][l];
                    ans2[i][l] %= 6;
                }
            }
        }
        int res = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) res += ans2[i][j];
        }
        printf ("%d\n", res);
    }
    return 0;
}