Arc of Dream HDU - 4686 (构造矩阵+矩阵快速幂)

传送门

题解：构造矩阵+矩阵快速幂

附上代码：

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

typedef long long ll;
const ll mod=1000000007;

struct node{
    ll x[6][6];
};
node shu,ans,mp;

node matrix(node x,node y)
{
    for(int i=1;i<=5;i++){
        for(int j=1;j<=5;j++){
            mp.x[i][j]=0;
            for(int p=1;p<=5;p++){
                mp.x[i][j]=(mp.x[i][j]+x.x[i][p]*y.x[p][j]+mod)%mod;
            }
        }
    }
    return mp;
}

void work(ll k)
{
    for(int i=1;i<=5;i++){
        for(int j=1;j<=5;j++){
            ans.x[i][j]=0;
        }
    }
    for(int i=1;i<=5;i++){
        ans.x[i][i]=1;
    }
    node t=shu;
    while(k){
        if(k&1){
            ans=matrix(ans,t);
        }
        k>>=1;
        t=matrix(t,t);
    }
}

int main()
{
    ll n,a0,ax,ay,b0,bx,by;
    while(scanf("%lld",&n)!=EOF){
        scanf("%lld%lld%lld",&a0,&ax,&ay);
        scanf("%lld%lld%lld",&b0,&bx,&by);
        if(n==0){
            printf("0\n");
        }else if(n==1){
            printf("%lld\n",(a0*b0)%mod);
        }else{
            shu.x[1][1]=1;shu.x[1][2]=(ax*bx)%mod;shu.x[1][3]=(ax*by)%mod;shu.x[1][4]=(bx*ay)%mod;shu.x[1][5]=(ay*by)%mod;
            shu.x[2][2]=(ax*bx)%mod;shu.x[2][3]=(ax*by)%mod;shu.x[2][4]=(bx*ay)%mod;shu.x[2][5]=(ay*by)%mod;
            shu.x[3][3]=ax%mod;shu.x[3][5]=ay%mod;
            shu.x[4][4]=bx%mod;shu.x[4][5]=by%mod;
            shu.x[5][5]=1;
            node B;
            memset(B.x,0,sizeof(B.x));
            B.x[1][1]=(a0*b0)%mod;B.x[2][1]=(a0*b0)%mod;B.x[3][1]=a0%mod;B.x[4][1]=b0%mod;B.x[5][1]=1;
            work(n-1);
            B=matrix(ans,B);
            printf("%lld\n",B.x[1][1]%mod);
        }
    }
    return 0;
}