P1939 【模板】矩阵加速（数列）

https://www.luogu.com.cn/problem/P1939

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int N=105;
const int M=5;
const int mod=1e9+7;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
struct matrix{
    LL x,y;
    LL v[M][M];
    matrix() { memset(v,0,sizeof(v)); }
    inline friend matrix operator *( const matrix & a,const matrix & b) {
        matrix cur;
        memset(cur.v,0,sizeof(cur));
        for(int i=1 ; i <= 3 ;i++)
        {
            for( int k=1; k <= 3 ; k++)
            {
                LL t= a.v[i][k];
                for(int j=1; j <= 3 ; j++)
                {

                    cur.v[i][j] = ( t*b.v[k][j]%mod  +cur.v[i][j])%mod;
                }
            }
        }
        return cur;
    }
};
inline void init(matrix& A)
{
    A.x=A.y=3;
    memset(A.v,0,sizeof(A.v));
    A.v[1][1]=A.v[1][3]=A.v[2][1]=A.v[3][2]=1;
}
inline matrix mksm(LL k)
{
       matrix A,I;
       init(A);
       for(int i=1;i<=3;i++) I.v[i][i]=1;
       if(k<=3) return I;
       k-=1;
       while(k)
       {
           if(k&1) I=A*I;
           A=A*A;
           k>>=1;
       }
       return I;
}
int main(void){
    LL T;T=read();
    while(T--)
    {
        LL k;k=read();
        matrix result=mksm(k);
        printf("%lld\n",result.v[1][1]);
    }
   	return 0;
}