【LOJ3120】「CTS2019」珍珠

【题目链接】

• 点击打开链接

【思路要点】

• 记 L i m = M i n { D , N − 2 M } Lim=Min\{D,N-2M\} Lim=Min{D,N−2M} 。
• 答案即为
  $$N!\sum _{i=0}^{Lim}(\frac{e^x+e^{-x}}{2}+y\frac{e^x-e^{-x}}{2}{)}^D[x^N][y^i]$$
  $$\frac{N!}{2^D}\sum _{i=0}^{Lim}(e^x(1+y)+e^{-x}(1-y){)}^D[x^N][y^i]$$
  $$\frac{N!}{2^D}\sum _{i=0}^{Lim}\sum _{j=0}^D\left(\genfrac{}{}{0ex}{}{D}{j}\right)(e^x(1+y){)}^j(e^{-x}(1-y){)}^{D-j}[x^N][y^i]$$
  $$\frac{N!}{2^D}\sum _{j=0}^D\left(\genfrac{}{}{0ex}{}{D}{j}\right)e^{(2j-D)x}[x^N]\sum _{i=0}^{Lim}(1+y{)}^j(1-y{)}^{D-j}[y^i]$$
  $$\frac{1}{2^D}\sum _{j=0}^D\left(\genfrac{}{}{0ex}{}{D}{j}\right)(2j-D{)}^N\sum _{i=0}^{Lim}(1+y{)}^j(1-y{)}^{D-j}[y^i]$$
• 记 $F(D,j)={\sum }_{i=0}^{Lim}(1+y{)}^j(1-y{)}^{D-j}[y^i]$
• 对于 $j\ge 1$ ，有
  $$F(D,j)=\sum _{i=0}^{Lim}(1+y{)}^j(1-y{)}^{D-j}[y^i]$$
  $$=\sum _{i=0}^{Lim}(1+y{)}^{j-1}(2-(1-y))(1-y{)}^{D-j}[y^i]$$
  $$=2F(D-1,j-1)-F(D,j-1)$$
• 对于 $j=0$ ，有
  $$F(D,0)=\sum _{i=0}^{Lim}(1-y{)}^D[y^i]$$
  $$=\sum _{i=0}^{Lim}\left(\genfrac{}{}{0ex}{}{D}{i}\right)(-1{)}^i$$
  $$=\sum _{i=0}^{Lim}((\genfrac{}{}{0ex}{}{D-1}{i})+(\genfrac{}{}{0ex}{}{D-1}{i-1}))(-1{)}^i$$
  $$=\sum _{i=0}^{Lim}(-1{)}^i(\genfrac{}{}{0ex}{}{D-1}{i})-\sum _{i=0}^{Lim-1}(-1{)}^i\left(\genfrac{}{}{0ex}{}{D-1}{i-1}\right)$$
  $$=(-1{)}^{Lim}(\genfrac{}{}{0ex}{}{D-1}{Lim})$$
• 我们需要求出所有 $F(D,\ast )$ 。
• 上述转移斜向一步 $\times 2$ ，正向一步 $\times -1$ 。
• 可以用 $NTT$ 优化。
• 时间复杂度 $O(DLogD+DLogN)$ 。

【代码】

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 262144;
const int P = 998244353;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); } 
template <typename T> void read(T &x) {
	x = 0; int f = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	x *= f;
}
template <typename T> void write(T x) {
	if (x < 0) x = -x, putchar('-');
	if (x > 9) write(x / 10);
	putchar(x % 10 + '0');
}
template <typename T> void writeln(T x) {
	write(x);
	puts("");
}
namespace NTT {
	const int MAXN = 262144;
	const int P = 998244353;
	const int G = 3;
	int power(int x, int y) {
		if (y == 0) return 1;
		int tmp = power(x, y / 2);
		if (y % 2 == 0) return 1ll * tmp * tmp % P;
		else return 1ll * tmp * tmp % P * x % P;
	}
	int N, Log, home[MAXN];
	void NTTinit() {
		for (int i = 0; i < N; i++) {
			int ans = 0, tmp = i;
			for (int j = 1; j <= Log; j++) {
				ans <<= 1;
				ans += tmp & 1;
				tmp >>= 1;
			}
			home[i] = ans;
		}
	}
	void NTT(int *a, int mode) {
		for (int i = 0; i < N; i++)
			if (home[i] < i) swap(a[i], a[home[i]]);
		for (int len = 2; len <= N; len <<= 1) {
			int delta;
			if (mode == 1) delta = power(G, (P - 1) / len);
			else delta = power(G, P - 1 - (P - 1) / len);
			for (int i = 0; i < N; i += len) {
				int now = 1;
				for (int j = i, k = i + len / 2; k < i + len; j++, k++) {
					int tmp = a[j];
					int tnp = 1ll * a[k] * now % P;
					a[j] = (tmp + tnp) % P;
					a[k] = (tmp - tnp + P) % P;
					now = 1ll * now * delta % P;
				}
			}
		}
		if (mode == -1) {
			int inv = power(N, P - 2);
			for (int i = 0; i < N; i++)
				a[i] = 1ll * a[i] * inv % P;
		}
	}
	void times(int *a, int *b, int *c, int limit) {
		N = 1, Log = 0;
		while (N < 2 * limit) {
			N <<= 1;
			Log++;
		}
		for (int i = limit; i < N; i++)
			a[i] = b[i] = 0;
		NTTinit();
		NTT(a, 1);
		NTT(b, 1);
		for (int i = 0; i < N; i++)
			c[i] = 1ll * a[i] * b[i] % P;
		NTT(c, -1);
	}
}
int fac[MAXN], inv[MAXN];
int power(int x, int y) {
	if (y == 0) return 1;
	int tmp = power(x, y / 2);
	if (y % 2 == 0) return 1ll * tmp * tmp % P;
	else return 1ll * tmp * tmp % P * x % P;
}
int binom(int x, int y) {
	if (y > x) return 0;
	else return 1ll * fac[x] * inv[y] % P * inv[x - y] % P;
}
void init(int n) {
	fac[0] = 1;
	for (int i = 1; i <= n; i++)
		fac[i] = 1ll * fac[i - 1] * i % P;
	inv[n] = power(fac[n], P - 2);
	for (int i = n - 1; i >= 0; i--)
		inv[i] = inv[i + 1] * (i + 1ll) % P;
}
int d, n, m, lim;
int a[MAXN], b[MAXN], res[MAXN];
void update(int &x, int y) {
	x += y;
	if (x >= P) x -= P;
}
int main() {
	read(d), read(n), read(m);
	init(d), lim = min(d, n - 2 * m);
	a[d] = 1ll * power(2, d) * inv[d] % P, b[0] = 1;
	for (int i = 1; i <= d; i++) {
		if (i & 1) b[i] = P - inv[i];
		else b[i] = inv[i];
		if (lim & 1) a[d - i] = 1ll * (P - binom(i - 1, lim)) * inv[d - i] % P * power(2, d - i) % P;
		else a[d - i] = 1ll * binom(i - 1, lim) * inv[d - i] % P * power(2, d - i) % P;
	}
	NTT :: times(a, b, res, d + 1);
	for (int i = 0; i <= d; i++)
		res[i] = 1ll * res[i] * fac[i] % P;
	int ans = 0;
	for (int i = 0; i <= d; i++)
		update(ans, 1ll * power((2 * i - d + P) % P, n) * binom(d, i) % P * res[i] % P);
	ans = 1ll * ans * power(2, P - 1 - d) % P;
	writeln(ans);
	return 0;
}