【BZOJ4161】Shlw loves matrixI（常系数其次线性递推）

传送门

---

没有题解。

直接常系数其次线性递推暴力搞就行了。

---

代码：

#include<bits/stdc++.h>
#define ll long long
#define re register
#define cs const

using std::cerr;
using std::cout;

cs int mod=1e9+7;
inline int add(int a,int b){return (a+=b)>=mod?a-mod:a;}
inline int dec(int a,int b){return (a-=b)<0?a+mod:a;}
inline int mul(int a,int b){static ll r;r=(ll)a*b;return r>=mod?r%mod:r;}
inline int power(int a,int b,int res=1){
	for(;b;b>>=1,a=mul(a,a))(b&1)&&(res=mul(res,a));
	return res;
}
inline void Inc(int &a,int b){(a+=b)>=mod&&(a-=mod);}
inline void Dec(int &a,int b){(a-=b)<0&&(a+=mod);}
inline void Mul(int &a,int b){a=mul(a,b);}

typedef std::vector<int> Poly;

Poly Mod;

inline Poly operator*(cs Poly &a,cs Poly &b){
	int n=a.size(),m=b.size();
	Poly c(n+m-1,0);
	for(int re i=0;i<n;++i)
	for(int re j=0;j<m;++j)Inc(c[i+j],mul(a[i],b[j]));
	return c;
}

inline void poly_mod(Poly &a){
	int d=Mod.size()-1;
	for(int re i=a.size()-1;i>=d;--i)
	for(int re j=1;j<=d;++j)Inc(a[i-j],mul(a[i],Mod[j]));
	a.resize(d);
}

cs int N=2e3+7;

int n,k;
int a[N];
Poly f,g;

signed main(){
#ifdef zxyoi
	freopen("matrix.in","r",stdin);
#endif
	scanf("%d%d",&n,&k);
	Mod.resize(k+1);
	for(int re i=1;i<=k;++i){scanf("%d",&Mod[i]);Dec(Mod[i],0);}
	for(int re i=1;i<=k;++i){scanf("%d",a+i);Dec(a[i],0);}
	g.resize(2),g[1]=1;
	f.resize(1),f[0]=1;
	for(;n;n>>=1,g=g*g,poly_mod(g))
	if(n&1)f=f*g,poly_mod(f);
	int ans=0;
	for(int re i=0;i<f.size();++i)Inc(ans,mul(a[i+1],f[i]));
	cout<<ans<<"\n";
	return 0;
}