JZOJ 6275.小L的数列【矩阵乘法】【卡常】

---

题目：

传送门

---

题意：

有式子$f_i=f_{i-1}^{b_1}\ast f_{i-2}^{b_2}\ast \dots \ast f_{i-k}^{b_k}$
现在给出$b、k$和$f_1—f_k$，求$f_n$的值

---

分析：

对于$f_1—f_k$的指数变化，我们可以用矩阵来表示
如此一来时间复杂度就是$O(k^{4}log(n))$
但$k^4$还是过大，我们再动一下脑筋，发现$f$的变化是可以预处理出来的，这样我们就少了一个$k$了

---

代码：

#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define LL long long 
#define LZX 998244353
using namespace std;
inline LL read() {
    LL d=0,f=1;char s=getchar();
    while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
    while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
    return d*f;
}
int n,k;
struct node{
	LL a[205][205];
}o;
LL f[205],b[205];
node mul(const node &x,const node &y)
{
	node ans;
	for(register int i=1;i<=k;i++)
	   for(register int j=1;j<=k;j++)
	     ans.a[i][j]=0;
	for(register int i=1;i<=k;i++)
	  for(register int j=1;j<=k;j++)
	    for(register int ij=1;ij<=k;ij++)
	      (ans.a[i][j]+=x.a[i][ij]*y.a[ij][j]%(LZX-1))%=LZX-1;
	return ans;
}
node nodeksm(node a,LL king)
{
	king--;
	node s=a;
	while(king)
	{
		if(king&1) s=mul(s,a);
		a=mul(a,a);king>>=1;
	}
	return s;
}
LL ksm(LL x,int y)
{
	if(!y) return 1;
	if(!x) return 0;
	LL s=1;
	while(y)
	{
		if(y&1) (s*=x)%=LZX;
		(x*=x)%=LZX;y>>=1;
	}
	return s;
}
int main()
{/*
	freopen("seq.in","r",stdin);
	freopen("seq.out","w",stdout);*/
	n=read();k=read();
	for(register int i=2;i<=k;i++) o.a[i][i-1]=1;
	for(register int i=k;i;i--) o.a[i][k]=read();
	for(register int i=1;i<=k;i++) f[i]=read();
	if(n<=k) return !printf("%lld",f[n]);
	n-=k;
	o=nodeksm(o,n);
	LL ans=1;
	for(register int i=1;i<=k;i++) (ans*=ksm(f[i],o.a[i][k]))%=LZX;
	printf("%lld",ans);
	return 0;
}