wiki Freda的道路

动态规划+矩阵快速幂运算

#include<cstdio>
#include<cstring>
#include<iostream>
#include<iomanip>
#include<queue>
#include<cmath>
#include<stack>
#include<map>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
typedef long long  LL;
LL n,p;
void mul (LL a[][4], LL b[][4]){
    LL c[4][4];
    for(int i = 0; i < 4; i++)
        for(int j = 0; j < 4; j++) c[i][j] = 0;
    for(int i = 0; i < 4; i++){
        for(int j = 0; j < 4; j++){
            for(int k = 0; k < 4; k++){
                c[i][j] += a[i][k]*b[k][j];
                c[i][j] = c[i][j] % p;
            }
        }
    }
    for(int i = 0; i < 4; i++){
        for(int j = 0; j < 4; j++) a[i][j] = c[i][j];
    }
}
void mul_mi (LL a[][4], LL k){
    LL result[4][4];
    for(int i = 0; i < 4; i++) {
        for(int j = 0; j < 4; j++) result[i][j] = (i==j ? 1 : 0);
    }
    while(k){
        if(k%2){
            mul(result, a);
        }
        mul(a, a);
        k >>= 1;
    }
    for(int i = 0; i < 4; i++)
        for(int j = 0; j < 4; j++) a[i][j] = result[i][j];
}
int main(int argc, const char * argv[])
{
    cin >> n;
    p = 1000000007;
    LL init[4][4] = {4,1,2,3,0,0,0,0,0,0,0,0,0,0,0,0};
    LL a[4][4] = {1,1,0,0,1,0,0,0,1,0,0,1,1,0,1,1};
    mul_mi(a, n);
    mul(init,a);
    LL t = (init[0][0] - (5*init[0][2])%p + init[0][3])%p;
    if(t < 0) t += p;
    cout << t << endl;
}