Gym 101061B RGB plants (矩阵快速幂)

题目链接:http://codeforces.com/gym/101061/problem/B

题目大意

给定三种颜色,
红色一天能变成1红2绿3蓝,
...刚开始有红绿蓝三个颜色,
问n天后总共有多少个.

题目分析 

矩阵快速幂.
转移矩阵:
1 2 3
4 5 6
7 8 9
直接套然后求和即可.

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e2+5;
const int ub=1e6;
const int INF=1e9;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
/*
题目大意:
给定三种颜色,
红色一天能变成1红2绿3蓝,
...刚开始有红绿蓝三个颜色,
问n天后总共有多少个.

题目分析:
矩阵快速幂.
转移矩阵:
1 2 3
4 5 6
7 8 9
直接套然后求和即可.
*/
int n;
struct mat{
    ll a[10][10];
    mat(){
        mst(a,0);
    }
    mat operator*(const mat& y) const{
        mat ret;
        rep(i,0,3) rep(j,0,3) rep(k,0,3){
            ret.a[i][j]=(ret.a[i][j]+a[i][k]*y.a[k][j]%mod)%mod;
        }
        return ret;
    }
};
mat powmat(mat x,ll y){
    mat ret;rep(i,0,3) ret.a[i][i]=1;
    for(;y;y>>=1,x=x*x) if(y&1)
        ret=x*ret;
    return ret;
}
int main(){
    int t;scanf("%d",&t);
    mat x;
    rep(i,0,3) rep(j,0,3) x.a[i][j]=(i*3+j+1);
    while(t--){
        scanf("%d",&n);
        mat ret=powmat(x,n-1);
        ll ans=0;rep(i,0,3) rep(j,0,3) ans=(ans+ret.a[i][j])%mod;
        printf("%lld\n",ans);
    }
    return 0;
}