题目大意:
很简洁,直接放题面吧.
题目思路:
很容易看出要使用二项式定理。但是需要一点推公式的能力。
回顾一下二项式定理: ( a + b ) x = ∑ i = 0 x C x i ∗ a i ∗ b x − i (a+b)^x=\sum_{i=0}^{x}C_x^i*a^i*b^{x-i} (a+b)x=∑i=0xCxi∗ai∗bx−i
先将式子调整一下:
原式=
1
2
[
∑
i
=
1
N
∑
j
=
1
N
(
A
i
+
A
j
)
x
−
∑
i
=
1
N
(
2
A
i
)
x
]
\frac{1}{2}[\sum_{i=1}^{N}\sum_{j=1}^{N}(A_i+A_j)^x-\sum_{i=1}^{N}(2A_i)^x]
21[∑i=1N∑j=1N(Ai+Aj)x−∑i=1N(2Ai)x]
后面部分可以O(n)直接算。
关注前半部分: 原式 = ∑ i = 1 N ∑ j = 1 N ∑ k = 0 x C x k ∗ ( A i ) k ∗ ( A j ) x − k \sum_{i=1}^{N}\sum_{j=1}^{N}\sum_{k=0}^{x}C_x^k*(A_i)^k*(A_j)^{x-k} ∑i=1N∑j=1N∑k=0xCxk∗(Ai)k∗(Aj)x−k
= ∑ k = 0 x C x k [ ∑ i = 1 N ( A i ) k ] [ ∑ j = 1 N ( A j ) x − k ] =\sum_{k=0}^{x}C_x^k[\sum_{i=1}^{N}(A_i)^k][\sum_{j=1}^{N}(A_j)^{x-k}] =∑k=0xCxk[∑i=1N(Ai)k][∑j=1N(Aj)x−k]
显然,上述式子可以独立算了。
所以 O ( n k ) O(nk) O(nk)预处理 v a l [ j ] = ∑ i = 1 N ( A i ) j val[j]=\sum_{i=1}^{N}(A_i)^j val[j]=∑i=1N(Ai)j,再 O ( k 2 ) O(k^2) O(k2)预处理组合数.
然后枚举 k k k, O ( k ) O(k) O(k)的计算 ∑ k = 0 x C x k \sum_{k=0}^{x}C_x^k ∑k=0xCxk.然后三者相乘即可.最后记得乘2的逆元.
总时间复杂度: O ( n k ) O(nk) O(nk)
AC代码:
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
const int maxn = 2e5 + 5;
const int mod = 998244353;
ll a[maxn] , b[maxn] , val[305];
ll c[305][305];
ll ksm (ll a , ll b)
{
ll ans = 1 , base = a;
while (b){
if (b & 1) ans = ans * base % mod;
b >>= 1;
base = base * base % mod;
}
return ans;
}
int main()
{
ios::sync_with_stdio(false);
for (int i = 1 ; i <= 300 ; i++){
c[i][0] = c[i][i] = 1;
for (int j = 1 ; j < i ; j++)
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
ll n , k; cin >> n >> k;
for (int i = 1 ; i <= n ; i++)
cin >> a[i] , b[i] = 1;
val[0] = n;
for (int j = 1 ; j <= k ; j++){
for (int i = 1 ; i <= n ; i++){
b[i] = (b[i] * a[i]) % mod;
val[j] = (val[j] + b[i]) % mod;
}
}
ll base = 1 , inv = ksm(2 , mod - 2);
for (int i = 1 ; i <= k ; i++){
ll res = 0;
for (int j = 0 ; j <= i ; j++)
res = (res + c[i][j] * val[j] % mod * val[i - j] % mod) % mod;
base = base * 2 % mod;
res = (res - base * val[i] % mod + mod) % mod;
res = res * inv % mod;
cout << res << endl;
}
return 0;
}