POJ 3233 Matrix Power Series （矩阵的幂）

最新推荐文章于 2020-07-24 10:38:56 发布

Anthony_azy

最新推荐文章于 2020-07-24 10:38:56 发布

阅读量488

点赞数

分类专栏： OJ 挑战程序设计竞赛（第二版）

本文链接：https://blog.csdn.net/a2459956664/article/details/51372806

版权

OJ 同时被 2 个专栏收录

317 篇文章 1 订阅

订阅专栏

挑战程序设计竞赛（第二版）

69 篇文章 25 订阅

订阅专栏

Matrix Power Series

Time Limit: 3000MS		Memory Limit: 131072K
Total Submissions: 19480		Accepted: 8214

Description

Given a n × n matrix A and a positive integer k, find the sum S = A + A² + A³ + … + A^k.

Input

The input contains exactly one test case. The first line of input contains three positive integers n (n ≤ 30), k (k ≤ 10⁹) and m (m < 10⁴). Then follow n lines each containing n nonnegative integers below 32,768, giving A’s elements in row-major order.

Output

Output the elements of S modulo m in the same way as A is given.

Sample Input

2 2 4
0 1
1 1

Sample Output

1 2
2 3

题意：

给定n * n的矩阵A和正整数k和m。求矩阵A的幂的和。

S = A + A2 + … + Ak

输出S的各元素对M取余后的答案

分析：

n*n的矩阵的k次幂可以通过快速幂在O(n3logk)的时间内求出。但是，本题求的不是k次幂，而是累乘和。如果按顺序逐个加起来，复杂度就变成了O(n3k)。要计算幂的和，只需要按照下面的方法计算就可以了。(I是n*n的单位矩阵)。

因此，通过计算这个矩阵的k次幂就可以求出A的累乘和。时间复杂度为O(n3logk).

#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
typedef vector<int> vec;
typedef vector<vec> mat;

int n, k, m;

//计算A*B
mat mul(mat &A, mat &B)
{
    mat C(A.size(), vec(B[0].size()));
    for (int i = 0; i < A.size(); i++){
        for (int k = 0; k < B.size(); k++){
            for (int j = 0; j < B[0].size(); j++){
                C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % m;
            }
        }
    }
    return C;
}

//计算A ^ n
mat pow(mat A, int n)
{
    mat B(A.size(), vec(A.size()));
    for (int i = 0; i < A.size(); i++){
        B[i][i] = 1;
    }
    while (n > 0){
        if (n & 1)
            B = mul(B, A);
        A = mul(A, A);
        n >>= 1;
    }
    return B;
}

void solve(mat A)
{
    mat B(n * 2, vec(n * 2));
    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            B[i][j] = A[i][j];
        }
        B[n + i][i] = B[n + i][n + i] = 1;
    }
    B = pow(B, k + 1);   //I + A + A ^ 2 + ... + A ^ k
    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            int a = B[n + i][j] % m;
            //减去I
            if (i == j)
                a = (a + m - 1) % m;
            printf("%d%c", a, j + 1 == n ? '\n' : ' ');
        }
    }
}

int main()
{
    while (scanf("%d%d%d", &n, &k, &m) != EOF){
        mat A(n, vec(n));
        for (int i = 0; i < n; i++){
            for (int j = 0; j < n; j++){
                scanf("%d", &A[i][j]);
            }
        }
        solve(A);
        return 0;
    }
}