很喜欢出自游戏王的一句话:你的生命已如风中残烛。
再过几天也就退役了, 这可能是关于算法的最后几篇博客了。
题目大致是给你一些红板和白板, 要求是利用一块红板和若干白板拼成一个山峰状的栅栏,最高点是红板,且要严格递增递减。
题目所给
k
k
k 极小, 肯定是考虑每一块红板去跟所有的白板组合,并不是一个排列问题。
对于每个长度的白板,我们只能选择一块或者两块。
那么这个问题可以转化成:从
n
n
n 块白板中取出
m
m
m 块来组成栅栏,对于取一块白板来说, 一块白板可以放在左右两个位置,
m
m
m 块就是
2
m
C
n
m
2^m C_n^m
2mCnm,对于两块来说,无论放左放右都是一种等价情况,所以是
C
n
m
C_n^m
Cnm,注意两个
n
n
n 并不是相等的,分别是这种长度只有一块的数量和这种长度大于等于两块的数量。考虑转化成卷积的式子,我们假设:前一种取
i
i
i 个, 那么后一种肯定是
n
−
i
n- i
n−i 个,对于每一个
k
k
k ,分别做一次卷积,答案即是系数之和。
代码如下:
#include <cstdio>
const int N = 2e6 + 5;
const int M = 3e5 + 5;
const int P = 998244353;
const int G = 3;
template <class T>
void swap(T &x, T &y)
{
T tmp = x;
x = y;
y = tmp;
}
long long A[N], B[N], rev[N];
long long ksm(long long a, long long b)
{
long long res = 1;
while (b)
{
if (b & 1)
res = res * a % P;
a = a * a % P;
b >>= 1;
}
return res;
}
void NTT(int N, long long *a, int op)
{
for (int i = 0; i < N; ++i)
if (i < rev[i])
swap(a[i], a[rev[i]]);
for (int M = 1; M < N; M <<= 1)
{
long long tmp = ksm(G, (P - 1) / (M << 1));
if (op == -1)
tmp = ksm(tmp, P - 2);
for (int i = 0; i < N; i += (M << 1))
{
long long W = 1;
for (int j = 0; j < M; ++j, W = W * tmp % P)
{
long long x = a[i + j], y = W * a[i + j + M] % P;
a[i + j] = (x + y) % P, a[i + j + M] = (x - y + P) % P;
}
}
}
}
int cnt[M], a[10], q[M], m;
long long ans[M], fac[M];
void solve(int M)
{
int s1 = 0, s2 = 0;
for (int i = 0; i < M; ++i)
{
if (cnt[i] == 1)
s1++;
else if (cnt[i] >= 2)
s2++;
}
s2 <<= 1;
long long pw = 1;
for (int i = 0; i <= s1; ++i)
{
A[i] = 1ll * pw * fac[s1] % P * ksm(fac[i], P - 2) % P * ksm(fac[s1 - i], P - 2) % P;
pw = pw * 2 % P;
}
for (int i = 0; i <= s2; ++i)
{
B[i] = 1ll * fac[s2] * ksm(fac[i], P - 2) % P * ksm(fac[s2 - i], P - 2) % P;
}
int N = 1, Bit = 0;
while (N <= s1 + s2)
N <<= 1, Bit++;
for (int i = 0; i < N; ++i)
rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (Bit - 1));
NTT(N, A, 1);
NTT(N, B, 1);
for (int i = 0; i < N; ++i)
A[i] = A[i] * B[i] % P;
NTT(N, A, -1);
long long Inv = ksm(N, P - 2);
for (int i = 0; i < N; ++i)
A[i] = A[i] * Inv % P;
for (int i = 0; i < m; ++i)
{
if (q[i] >= M)
ans[i] = (ans[i] + A[q[i] - M]) % P;
}
for (int i = 0; i < N; ++i)
A[i] = B[i] = 0;
}
int main()
{
fac[0] = 1;
for (int i = 1; i <= (int)3e5; ++i)
fac[i] = 1ll * fac[i - 1] * i % P;
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i)
{
int x;
scanf("%d", &x);
cnt[x]++;
}
for (int i = 0; i < k; ++i)
scanf("%d", &a[i]);
scanf("%d", &m);
for (int i = 0; i < m; ++i)
scanf("%d", &q[i]), q[i] = (q[i] >> 1) - 1;
for (int i = 0; i < k; ++i)
solve(a[i]);
for (int i = 0; i < m; ++i)
printf("%lld\n", ans[i]);
return 0;
}