ACM-ICPC 2018 焦作赛区网络预赛 L：Poor God Water(矩阵快速幂）

God Water likes to eat meat, fish and chocolate very much, but unfortunately, the doctor tells him that some sequence of eating will make them poisonous.

Every hour, God Water will eat one kind of food among meat, fish and chocolate. If there are 3 continuous hours when he eats only one kind of food, he will be unhappy. Besides, if there are 3 continuous hours when he eats all kinds of those, with chocolate at the middle hour, it will be dangerous. Moreover, if there are 3 continuous hours when he eats meat or fish at the middle hour, with chocolate at other two hours, it will also be dangerous.

Now, you are the doctor. Can you find out how many different kinds of diet that can make God Water happy and safe during NNN hours? Two kinds of diet are considered the same if they share the same kind of food at the same hour. The answer may be very large, so you only need to give out the answer module 1000000007.
Input

The fist line puts an integer T that shows the number of test cases. (T≤1000)

Each of the next T lines contains an integer N that shows the number of hours. (1≤N≤1010)
Output

For each test case, output a single line containing the answer.
样例输入

3
3
4
15

样例输出

20
46
435170

首先考虑2位 有1:mc  2:mf  3:cf 4:cm 5:fc 6:fm 7:cc 8:mm 9:ff;

所以第三位必须满足题意 则mc后面只能m和c 则生成的新的2位是 4：cm和7：cc

即1生成4,7,；2生成5,6,9；.........；9生成5,6；

所以可以写出以下打表代码

ll a[][];
int main(){
    int op=;
    for(int i=;i<=;i++)
        a[op][i]=;
    for(int i=;i<=;i++){
        op^=;
        for(int j=;j<=;j++)
            a[op][j]=;
        a[op][]=(a[op^][]+a[op^][])%MOD;
        a[op][]=(a[op^][]+a[op^][]+a[op^][])%MOD;
        a[op][]=(a[op^][]+a[op^][])%MOD;
        a[op][]=(a[op^][]+a[op^][])%MOD;
        a[op][]=(a[op^][]+a[op^][])%MOD;
        a[op][]=(a[op^][]+a[op^][]+a[op^][])%MOD;
        a[op][]=(a[op^][]+a[op^][])%MOD;
        a[op][]=(a[op^][]+a[op^][])%MOD;
        a[op][]=(a[op^][]+a[op^][])%MOD;
        ll ans=;
        for(int j=;j<=;j++){
            printf("%lld ",a[op][j]);
            ans=(ans+a[op][j])%MOD;
        }
        printf("%lld\n",ans);
    }
    return ;
}

所以由以上公式构建9维矩阵，矩阵快速幂求解

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <cassert>
#include <ctime>
#include <map>
#include <set>
using namespace std;
#pragma comment(linker, "/stck:1024000000,1024000000")
#define lowbit(x) (x&(-x))
#define max(x,y) (x>=y?x:y)
#define min(x,y) (x<=y?x:y)
#define MAX 100000000000000000
#define MOD 1000000007
#define pi acos(-1.0)
#define ei exp(1)
#define PI 3.1415926535897932384626433832
#define ios() ios::sync_with_stdio(true)
#define INF 0x3f3f3f3f
#define mem(a) ((a,0,sizeof(a)))
typedef long long ll;
ll A,B,n;
struct matrix
{
    ll a[][];
};
matrix mutiply(matrix u,matrix v)
{
    matrix res;
    memset(res.a,,sizeof(res.a));
    for(int i=;i<;i++)
        for(int j=;j<;j++)
            for(int k=;k<;k++)
                res.a[i][j]=(res.a[i][j]+u.a[i][k]*v.a[k][j])%MOD;
    return res;
}
matrix quick_pow(ll n)
{
    matrix ans,res;
    memset(res.a,,sizeof(res.a));
    memset(ans.a,,sizeof(ans.a));
    for(int i=;i<;i++)
        res.a[i][i]=;
    ans.a[][]=ans.a[][]=;
    ans.a[][]=ans.a[][]=ans.a[][]=;
    ans.a[][]=ans.a[][]=;
    ans.a[][]=ans.a[][]=;
    ans.a[][]=ans.a[][]=;
    ans.a[][]=ans.a[][]=ans.a[][]=;
    ans.a[][]=ans.a[][]=;
    ans.a[][]=ans.a[][]=;
    ans.a[][]=ans.a[][]=;
    while(n)
    {
        if(n&) res=mutiply(res,ans);
        n>>=;
        ans=mutiply(ans,ans);
    }
    return res;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--){
        ll n;
        scanf("%lld",&n);
        if(n==) printf("3\n");
        else{
            ll pos=;
            matrix ans=quick_pow(n-);
            for(int i=;i<;i++)
                for(int j=;j<;j++)
                    pos=(pos+ans.a[i][j])%MOD;
            printf("%lld\n",pos);
        }
    }
    return ;
}