POJ - 3233 Matrix Power Series（二分+矩阵快速幂）

最新推荐文章于 2021-07-19 10:50:52 发布

Happig丶

最新推荐文章于 2021-07-19 10:50:52 发布

阅读量122

点赞数

分类专栏： # 递推

本文链接：https://blog.csdn.net/qq_44691917/article/details/108069614

版权

递推专栏收录该内容

8 篇文章 0 订阅

订阅专栏

传送门

设 $S=a+a^2+a^3+...+a^n$

若 $n$ 为偶数那么有：

$S_n=a+a^2+...+a^{\frac{n}{2}}+a^{\frac{n}{2}+1}+...+a^{\frac{n}{2}+\frac{n}{2}} \\~~~~ =(1+a^{\frac{n}{2}})(a+a^2+...+a^{\frac{n}{2}}) \\~~~~=(1+a^{\frac{n}{2}})S_{\frac{n}{2}}$

若 $n$ 为奇数，可以利用 $S_n=S_{n-1}+a_n$ ，也可以同样推导出：

$S_n=a+a^2+...+a^{\frac{n-1}{2}}+a^{\frac{n-1}{2}+1}+...+a^{\frac{n-1}{2}+\frac{n-1}{2}+1} \\~~~~ =(1+a^{\frac{n-1}{2}+1})(a+a^2+...+a^{\frac{n-1}{2}})+a^{\frac{n-1}{2}+1} \\~~~~=(1+a^{\frac{n-1}{2}})S_{\frac{n-1}{2}}+a^{\frac{n-1}{2}+1}$

本题要求的其实是矩阵形式的运算，但是没有大问题，矩阵快速幂即可解决。在看AC代码时看到不少跑的很快的，发现是通过中间变量保存了每次乘的结果，时间复杂度少了一个 $l o g$ ，减少了大量重复运算，有时间可以学一手

一开始矩阵开的 $l o n g l o n g$ ，wa到哭，改了 $i n t$ 就过了，无语

//
// Created by Happig on 2020/8/17
//
#include <cstdio>
#include <math.h>
#include "cstring"
#include <iostream>

using namespace std;
#define fi first
#define se second
#define pb push_back
#define ins insert
#define Vector Point
#define lowbit(x) (x&(-x))
#define mkp(x, y) make_pair(x,y)
#define mem(a, x) memset(a,x,sizeof a);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const double dinf = 1e300;
const ll INF = 1e18;
const int maxn = 2e5 + 10;

struct Matrix {
    int matrix[55][55];
};

int n, Mod;

Matrix add(Matrix a, Matrix b) {
    Matrix ans;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            ans.matrix[i][j] = (a.matrix[i][j] + b.matrix[i][j]) % Mod;
    return ans;
}

Matrix mul(Matrix a, Matrix b) {
    Matrix ans;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++){
            ans.matrix[i][j]=0;
            for (int k = 1; k <= n; k++) {
                ans.matrix[i][j] += a.matrix[i][k] * b.matrix[k][j] % Mod;
                ans.matrix[i][j] %= Mod;
            }
        }
    return ans;
}

Matrix qkp(Matrix mx, ll x) {
    Matrix ans;
    memset(ans.matrix, 0, sizeof ans.matrix);
    for (int i = 1; i <= n; i++) ans.matrix[i][i] = 1;
    while (x) {
        if (x & 1) ans = mul(ans, mx);
        mx = mul(mx, mx);
        x >>= 1;
    }
    return ans;
}

Matrix solve(Matrix mx,int k){
    if(k==0){
        Matrix z;
        memset(z.matrix,0,sizeof z.matrix);
        return z;
    }
    if(k==1) return mx;
    if(k&1){
        Matrix ans=qkp(mx,k);
        ans=add(ans,solve(mx,k-1));
        return ans;
    }else{
        Matrix sum=solve(mx,k/2);
        Matrix ans=qkp(mx,k/2);
        ans=mul(ans,sum);
        ans=add(ans,sum);
        return ans;
    }
}

/*Matrix solve(Matrix mx, int k) {
    if (k == 1) return mx;
    Matrix sum = solve(mx, k / 2);
    if (k & 1) {
        Matrix res = qkp(mx, k / 2 + 1);
        Matrix ans = add(sum, mul(res, sum));
        ans = add(ans, res);
        return ans;
    } else {
        Matrix res = qkp(mx, k / 2);
        Matrix ans = add(sum, mul(res, sum));
        return ans;
    }
}*/

int main() {
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    //ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int k;
    while (scanf("%d%d%d", &n, &k, &Mod) != EOF) {
        Matrix mx;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++) {
                scanf("%d", &mx.matrix[i][j]);
                mx.matrix[i][j] %= Mod;
            }
        Matrix ans;
        memset(ans.matrix,0,sizeof ans.matrix);
        if(k&1){
            ans=add(ans,qkp(mx,k));
            ans=add(ans,solve(mx,k-1));
        }else ans=add(ans,solve(mx,k));
        //Matrix ans = solve(mx, k);
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                printf("%d%c", ans.matrix[i][j], j == n ? '\n' : ' ');
    }
    return 0;
}