NOIP提高组【JOZJ4798】天使的分裂

Description

Data Constraint

Solution

这一看就知道是一道矩阵乘法的题。显然$F_n=\sum^n_{i=0}{f_i*f_{n-i}}=\sum^n_{i=0}{f_i*(f_{n-i-1}+f_{n-i-2})}=\sum^n_{i=0}{f_i*f_{n-i-1}}+\sum^n_{i=0}{f_i*f_{n-i-2}}=F_{n-1}+F_{n-2}+f_n*f_0=F_{n-1}+F_{n-2}+f_n$这样，我们就可以推出矩阵啦，先设个初始状态数组$a={F_i，F_i-1,f_i+1,f_i,sum}$sum表示$\sum_{j=0}^{i-1}{F_j}$，根据这个推一下矩阵，用矩阵快速幂O($logN*5^3$)解决。

代码

#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define ll long long
using namespace std;
const ll maxn=998244353;
//const ll p[5][5].a={{1,1,0,0,1},{1,0,0,0,1},{1,0,1,1,0},{0,0,1,0,0},{0,0,0,0,1}};
struct code{
    ll a[5][5];
}p,b,z;
ll f[5],g[5],n,i,j,t,k,l;
code c(code x,code y){
    memset(z.a,0,sizeof(z.a));
    for (i=0;i<5;i++)
        for (j=0;j<5;j++)
            for (k=0;k<5;k++)
                z.a[i][j]=(z.a[i][j]+x.a[i][k]*y.a[k][j]%maxn)%maxn;
    return z;
}
code mi(ll x){
    if (x==1) return p;
    code t=mi(x/2);
    if (x%2) return c(c(t,t),p);return c(t,t);
}
int main(){
    scanf("%lld",&n);
    f[0]=2;f[1]=1;f[2]=2;f[3]=1;f[4]=1;
    p.a[0][0]=p.a[0][1]=p.a[0][4]=p.a[1][0]=p.a[2][0]=p.a[2][2]=p.a[2][3]=p.a[3][2]=p.a[4][4]=1;
    //p.a={{1,1,0,0,1},{1,0,0,0,1},{1,0,1,1,0},{0,0,1,0,0},{0,0,0,0,1}};
    if (!n) printf("1\n");
    else{
        b=mi(n);
        for (j=0;j<5;j++)
            for (k=0;k<5;k++)
                g[j]=(g[j]+f[k]*b.a[k][j]%maxn)%maxn;
        printf("%lld\n",g[4]);
    }
}