Matrix Power Series
Time Limit: 3000MS | Memory Limit: 131072K | |
Total Submissions: 31411 | Accepted: 12658 |
Description
Given a n × n matrix A and a positive integer k, find the sum S = A + A2 + A3 + … + Ak.
Input
The input contains exactly one test case. The first line of input contains three positive integers n (n ≤ 30), k (k ≤ 109) and m (m < 104). 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
思路:
题意还是很好理解的,就是算矩阵快速幂,唯一的难点就是k很大(1e9),所以这里用了二分与dfs相结合的方法。
1.n为偶数
2.n为奇数
以n为偶数为例,eg.求,可用dfs回溯的方法
dfs(10):=
求出ans=dfs(5)
则=ans+ans*=ans+ans*(ksm(a,5))
代码如下:
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cstring>
#include<set>
#include<map>
#include<queue>
#include<vector>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ll long long
using namespace std;
const int N=35;
const int INF=0x3f3f3f3f;
struct mat{
ll m[N][N];
}a;
int n,mod;
mat mul(mat a,mat b){
mat c;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
c.m[i][j]=0;
for(int k=0;k<n;k++){
c.m[i][j]=(c.m[i][j]+a.m[i][k]*b.m[k][j])%mod;
}
}
}
return c;
}
mat ksm(mat c,int k){
mat res;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
res.m[i][j]=(i==j?1:0);
}
}
while(k){
if(k&1)res=mul(res,c);
c=mul(c,c);
k>>=1;
}
return res;
}
mat add(mat a,mat b){
mat c;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
c.m[i][j]=(a.m[i][j]+b.m[i][j])%mod;
}
}
return c;
}
mat dfs(int k){//求解:A + A2 + A3 + … + Ak.
if(k==1){
return a;
}
mat ans=dfs(k/2);
if(k&1){
mat tmp=ksm(a,k/2+1);
ans=add(ans,mul(tmp,ans));
ans=add(ans,tmp);
}
else{
mat tmp=ksm(a,k/2);
ans=add(ans,mul(ans,tmp));
}
return ans;
}
int main(){
int k;
scanf("%d%d%d",&n,&k,&mod);
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
scanf("%lld",&a.m[i][j]);
}
}
mat ans=dfs(k);
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
printf("%lld ",ans.m[i][j]%mod);
}
printf("\n");
}
}