dlutoj 1326 矩阵快速幂

链接：http://acm.dlut.edu.cn/problem.php?id=1326

题意：略

思路：较简单，我是令dp[i]表示最后一个放在i的种类，推出dp[i] = dp[i-2] + dp[i-3]，求解ans[i]就是dp[i]，dp[i-1]，dp[i-2]，的和。用快速幂递推

单手撸的代码，然后坑大半个晚上，留下纪念=。=

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
const int N = 3;
const int mod = 1e9+7;
#define ll long long
struct Matrix{
    ll a[N][N];
    Matrix(){
        memset(a,0,sizeof(a));
    }
    void fill1(){
        for(int i = 0;i < N;i ++) a[i][i] = 1;
    }
};
ll mmod(ll a){
    return a > mod?a % mod:a;
}
Matrix multiply(Matrix a,Matrix b){
    Matrix ans;
    for(int i = 0;i < N;i ++){
        for(int j = 0;j < N;j ++){
            for(int k = 0;k < N;k ++){
                ans.a[i][j] = mmod(ans.a[i][j] + mmod(a.a[i][k] * b.a[k][j]));
            }
        }
    }
    return ans;
}
Matrix fast_mod(Matrix A,ll k){
    Matrix ans;
    ans.fill1();
    while(k){
        if(k&1)ans = multiply(ans,A);
        A = multiply(A,A);
        k = k>>1;
    }
    return ans;
}
int main(){
    ll num;
    Matrix mm,tmp;
    for(int i = 0;i < N-1;i ++)mm.a[i][i+1] = 1;
    mm.a[2][0] = 1;mm.a[2][1] = 1;mm.a[2][2] = 0;

    while(~scanf("%lld",&num)){
        if(num <= 6){
            int ans[15] = {0,2,3,4,5,7,9};
            printf("%lld\n",ans[num]);
            continue;
        }
        tmp = fast_mod(mm,num - 5);
        ll ans = 0;
        ans += tmp.a[2][0] + tmp.a[2][1] + tmp.a[2][2]*2;
        ans = mmod(ans);
        tmp = multiply(tmp,mm);
        ans += tmp.a[2][0] + tmp.a[2][1] + tmp.a[2][2]*2;
        ans = mmod(ans);
        tmp = multiply(tmp,mm);
        ans += tmp.a[2][0] + tmp.a[2][1] + tmp.a[2][2]*2;
        ans = mmod(ans);
        printf("%lld\n",ans);
    }
    return 0;
}