HDU5950 - 变形斐波拉契+矩阵快速幂-2016ICPC亚洲赛沈阳

/**
    题意:给你 n a b 满足 f[1] = a,f[2] = b; 求 f[n];
    f[n] = f[n-1] + 2*f[n-2] + n^4;  且 a b n都在int范围内
    于是就会特别大

    考虑用 矩阵快速幂的方法

    矩阵快速幂的关键是怎么构建这个矩阵;



*/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 110;
const ll mod = 2147493647; ///mod 要用 long long;
struct Matrix
{
    ll maze[maxn][maxn];
    int len;
    Matrix(){
        memset(maze,0,sizeof(maze));
        len = 0;
    }
    Matrix(int lens):len(lens){
        memset(maze,0,sizeof(maze));
    }
    void Creat(int lens)
    {
        len = lens;
        if(len > maxn) exit(1);
        for(int i=0;i<len;i++)
            for(int j=0;j<len;j++)
            scanf("%lld",&maze[i][j]);
    }
    void output()
    {
        for(int i=0;i<len;i++)
        {
            for(int j=0;j<len-1;j++)
                printf("%lld ",maze[i][j]);
            printf("%lld\n",maze[i][len-1]);
        }
    }
    Matrix operator * (const Matrix &a){
        Matrix ans(len);
        for(int k=0;k<len;k++)
        {
            for(int i=0;i<len;i++) if(maze[i][k])
            {
                ll temp;
                for(int j=0;j<len;j++) if(a.maze[k][j])
                {
                    temp = (maze[i][k]*a.maze[k][j]) % mod;
                    ans.maze[i][j] = (ans.maze[i][j] + temp) % mod;
                }
            }
        }
        return ans;
    }
    void operator = (const Matrix &a){
        len = a.len;
        for(int i=0;i<len;i++)
            for(int j=0;j<len;j++)
            maze[i][j] = a.maze[i][j];
    }
};
Matrix M_power(Matrix a,ll b)
{
    int lens = a.len;
    Matrix ans(lens);
    for(int i=0;i<lens;i++) ans.maze[i][i] = 1;
    while(b)
    {
        if(b&1) ans = ans*a;
        a = a*a;
        b>>=1;
    }
    return ans;
}
int main()
{
    Matrix a(7);
    a.maze[0][1] = 1;
    a.maze[1][1] = a.maze[1][2] = a.maze[1][6] = 1;
    a.maze[2][2] = a.maze[2][6] = 1;
    a.maze[1][0] = 2; a.maze[1][3] = a.maze[1][5] = a.maze[2][3] = a.maze[2][5] = 4;
    a.maze[1][4] = a.maze[2][4] = 6;
    a.maze[3][3] = a.maze[4][4] = a.maze[5][5] = a.maze[6][6] = 1;
    a.maze[3][6] = a.maze[4][6] = a.maze[5][6] = 1;
    a.maze[3][4] = a.maze[3][5] = 3;
    a.maze[4][5] = 2;
    int caset;
    scanf("%d",&caset);
    ll n,aa,bb;
    while(caset--)
    {
        scanf("%lld%lld%lld",&n,&aa,&bb);
        if(n == 1) printf("%lld\n",aa);
        else if(n == 2) printf("%lld\n",bb);
        else
        {
            Matrix ans = M_power(a,n-2);
            ll ansnum = 0;
            ansnum = (ansnum+ans.maze[1][0]*aa)%mod;
            ansnum = (ansnum+ans.maze[1][1]*bb)%mod;
            ansnum = (ansnum+ans.maze[1][2]*16)%mod;
            ansnum = (ansnum+ans.maze[1][3]*8)%mod;
            ansnum = (ansnum+ans.maze[1][4]*4)%mod;
            ansnum = (ansnum+ans.maze[1][5]*2)%mod;
            ansnum = (ansnum+ans.maze[1][6]*1)%mod;
            printf("%lld\n",ansnum);
        }
    }
    return 0;
}