题目描述
题解
推一下式子,发现答案为 ∏ i = 1 n ∑ j = 1 p i + 1 j k \prod_{i=1}^n\sum_{j=1}^{p_i+1}j^k i=1∏nj=1∑pi+1jk
考虑到当 p i ≤ 1 0 5 p_i \le 10^5 pi≤105 时,可以直接暴力算出答案,效率: O ( m a x × l o g P + n ) O(max \times logP+n) O(max×logP+n)
当
p
i
p_i
pi 很大的时候,发现
n
n
n 和
k
k
k 都很小,考虑化式子
∏
i
=
1
n
∑
j
=
1
p
i
+
1
∑
x
=
1
k
S
(
k
,
x
)
(
x
j
)
x
!
\prod_{i=1}^n\sum_{j=1}^{p_i+1}\sum_{x=1}^kS(k,x)(_x^j)x!
i=1∏nj=1∑pi+1x=1∑kS(k,x)(xj)x!
把
j
j
j 放后面,得
∏
i
=
1
n
∑
x
=
1
k
S
(
k
,
x
)
x
!
∑
j
=
1
p
i
+
1
(
x
j
)
\prod_{i=1}^n\sum_{x=1}^kS(k,x)x!\sum_{j=1}^{p_i+1}(_x^j)
i=1∏nx=1∑kS(k,x)x!j=1∑pi+1(xj)
后面那一项用组合数的几何意义即可,效率:
O
(
n
k
2
)
O(nk^2)
O(nk2)
(我是不是写了不属于我的专题,它原来标签是拉格朗日插值来着qwq)
代码
#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int P=1e9+7,N=1e5+2;
int n,f[N],s[15][15],k;
LL p[N],m;
int X(int x){return x>=P?x-P:x;}
int K(int x,int y){
int z=1;
for (;y;y>>=1,x=1ll*x*x%P)
if (y&1) z=1ll*z*x%P;
return z;
}
void W1(){
for (int i=1;i<=m+1;i++)
f[i]=X(f[i-1]+K(i,k));
int v=1;
for (int i=1;i<=n;i++)
v=1ll*v*f[p[i]+1]%P;
printf("%d\n",v);
}
int C(int x,int y){
int u=1,v=1;
for (int i=1;i<=y;i++)
u=1ll*u*X(x-i+1+P)%P,
v=1ll*i*v%P;
return 1ll*u*K(v,P-2)%P;
}
void W2(){
s[0][0]=1;
for (int i=1;i<=k;i++)
for (int j=1;j<=i;j++)
s[i][j]=X(s[i-1][j-1]+1ll*s[i-1][j]*j%P);
int v=1;
for (int i=1;i<=n;i++){
int x=0,y=1;
for (int j=1;j<=k;j++){
if (p[i]<j-1) break;y=1ll*j*y%P;
x=X(x+1ll*s[k][j]*y%P*C(X(p[i]%P+2),j+1)%P);
}
v=1ll*v*x%P;
}
printf("%d\n",v);
}
int main(){
cin>>n>>k;
for (int i=1;i<=n;i++)
scanf("%lld",&p[i]),m=max(m,p[i]);
if (m+1<N) return W1(),0;
return W2(),0;
}