传送门
题解:
其实这道题还挺简单的。。。
首先考虑如何表示 m m m次幂的 k k k次项,显然是若干项的乘积之和。
考虑枚举拆分方案,设 i i i次项出现了 b i b_i bi次,则 ∑ i = 0 n i b i = k , ∑ i = 0 n b i = m \sum\limits_{i=0}^nib_i=k,\sum\limits_{i=0}^nb_i=m i=0∑nibi=k,i=0∑nbi=m,并且这个拆分对应的排列数量为 ∏ i = 0 n ( m − ∑ j = 0 i − 1 b j b i ) \prod\limits_{i=0}^n{m-\sum\limits_{j=0}^{i-1}b_j\choose b_i} i=0∏n(bim−j=0∑i−1bj)
设已知多项式为 A ( x ) A(x) A(x),我们要求的是 [ x k ] A ( x ) m [x^k]A(x)^m [xk]A(x)m。当 p ∣ m p\mid m p∣m,由Lucas定理,上面对应的排列数量非 0 0 0当且仅当所有 p ∣ b i p\mid b_i p∣bi成立,则 p ∣ k p\mid k p∣k。
那么在 p ∣ m p\mid m p∣m的情况下我们有:
[ x k ] A ( x ) m = { [ x k / p ] A ( x ) m / p p ∣ k 0 p ∤ k [x^k]A(x)^m=\left\{ \begin{aligned}& [x^{k/p}]A(x)^{m/p}&&&p\mid k\\ &0&&& p\nmid k \end{aligned} \right. [xk]A(x)m={[xk/p]A(x)m/p0p∣kp∤k
更一般的,设 m = a p + b , 0 ≤ b ≤ p − 1 m=ap+b,0\leq b\leq p-1 m=ap+b,0≤b≤p−1,我们有如下转移式子:
[ x k ] A ( x ) a p + b = ∑ i ≡ k ( m o d p ) [ x k − i p ] A ( x ) a ⋅ [ x i ] A ( x ) b [x^k]A(x)^{ap+b}=\sum_{i\equiv k\pmod p}[x^{\frac{k-i}{p}}]A(x)^a\cdot [x^i]A(x)^b [xk]A(x)ap+b=i≡k(modp)∑[xpk−i]A(x)a⋅[xi]A(x)b
预处理 A ( x ) A(x) A(x)的 0 0 0到 p − 1 p-1 p−1次幂,然后记忆化搜索即可。
复杂度 O ( n 2 p 2 + T n 2 log p m ) O(n^2p^2+Tn^2\log_p m) O(n2p2+Tn2logpm)
代码:
#include<bits/stdc++.h>
#define ll long long
#define re register
#define cs const
int n,m,p;
int a[55],b[55][3005],len[55];
cs int M=19260817;
std::unordered_map<ll,int> ma;
int F(ll m,ll k){
if(!m)return !k;
ll id=m*M+k;if(ma.count(id))return ma[id];
int ans=0,a=m%p;ll c=m/p,d=k/p;
for(int re i=k%p;i<len[a]&&i<=k;i+=p,--d)
if(b[a][i])ans+=F(c,d)*b[a][i];
return ma[id]=ans%p;
}
signed main(){
#ifdef zxyoi
freopen("calc.in","r",stdin);
#endif
scanf("%d%d",&n,&p);
for(int re i=0;i<=n;++i)scanf("%d",a+i);
b[0][0]=len[0]=1;
for(int re i=1;i<p;++i){len[i]=len[i-1]+n;
for(int re j=0;j<len[i];++j){ll val=0;
for(int re k=0;k<=std::min(n,j);++k)val+=a[k]*b[i-1][j-k];
b[i][j]=val%p;
}
}
int T;scanf("%d",&T);
while(T--){
ll m,k;scanf("%lld%lld",&m,&k);
std::cout<<F(m,k)<<"\n";
}
return 0;
}