hdu 4686 Arc of Dream 矩阵快速幂

题意：

a0=A0，b0=B0

ai=ai-1*AX+AY

bi=bi-1*BX+BY

求

分析 

ai*bi=(ai-1*AX+AY)*(bi-1*BX+BY)=ai-1*bi-1*AX*BX+ai-1*AXBY+bi-1*AYBX+AYBY

这样就有递推公式使用可以构造一个矩阵

ACcode:

#include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
struct Matrix{
    ll mat[5][5];
};
Matrix mul(Matrix a,Matrix b){
    Matrix ret;
    for(int i=0;i<5;++i)
        for(int j=0;j<5;++j){
            ret.mat[i][j]=0;
            for(int k=0;k<5;++k)
                ret.mat[i][j]=(ret.mat[i][j]+a.mat[i][k]*b.mat[k][j]%mod+mod)%mod;
        }
    return ret;
}
Matrix pow(Matrix a,ll n){
    Matrix ret;
    memset(ret.mat,0,sizeof(ret.mat));
    for(int i=0;i<5;++i)ret.mat[i][i]=1;
    while(n){
        if(n&1)ret=mul(ret,a);
        a=mul(a,a);
        n>>=1;
    }
    return ret;
}
int main(){
    ll n,a0,ax,ay,b0,bx,by;
    while(scanf("%I64d",&n)!=EOF){
        scanf("%I64d%I64d%I64d",&a0,&ax,&ay);
        scanf("%I64d%I64d%I64d",&b0,&bx,&by);
        if(n==0){
            puts("0");
            continue;
        }
        Matrix tmp;
        memset(tmp.mat,0,sizeof(tmp.mat));
        tmp.mat[0][0]=tmp.mat[0][4]=ax*bx%mod;
        tmp.mat[1][0]=tmp.mat[1][4]=ax*by%mod;
        tmp.mat[2][0]=tmp.mat[2][4]=ay*bx%mod;
        tmp.mat[3][0]=tmp.mat[3][4]=ay*by%mod;
        tmp.mat[1][1]=ax%mod;tmp.mat[2][2]=bx%mod;
        tmp.mat[3][1]=ay%mod;tmp.mat[3][2]=by%mod;
        tmp.mat[3][3]=tmp.mat[4][4]=1;
        tmp=pow(tmp,n-1);
        ll ans;
        ll t=a0*b0%mod;
        ans=(t*tmp.mat[0][4]%mod+a0*tmp.mat[1][4]%mod+b0*tmp.mat[2][4]%mod+tmp.mat[3][4]+t)%mod;
        printf("%I64d\n",ans);
    }
    return 0;
}