【BZOJ4555】【TJOI2016】求和

【题目链接】

• 点击打开链接
  

【思路要点】

• \(f(N)=\sum_{i=0}^{N}\sum_{j=0}^{i}S(i,j)*2^j*j!\)
• \(=\sum_{i=0}^{N}\sum_{j=0}^{N}S(i,j)*2^j*j!\)
  
• \(=\sum_{j=0}^{N}2^j*j!\sum_{i=0}^{N}S(i,j)\)
  
• 考虑\(S(i,j)\)的组合意义，代表\(i\)个物品放入\(j\)个无序的组中的方案数，那么我们考虑容斥原理，枚举有多少集合是空的，有\(S(i,j)=\frac{1}{j!}\sum_{k=0}^{j}(-1)^k*\binom{j}{k}*(j-k)^{i}\)。
• 因此\(f(N)=\sum_{j=0}^{N}2^j*j!\sum_{i=0}^{N}\frac{1}{j!}\sum_{k=0}^{j}(-1)^k*\binom{j}{k}*(j-k)^{i}\)
  
• \(=\sum_{j=0}^{N}2^j*j!\sum_{i=0}^{N}\sum_{k=0}^{j}\frac{(-1)^k*(j-k)^{i}}{k!*(j-k)!}\)
• \(=\sum_{j=0}^{N}2^j*j!\sum_{x+y=j}\frac{(-1)^x}{x!}*\frac{\sum_{i=0}^{N}y^i}{y!}\)
  
• 对\(\frac{(-1)^x}{x!}\)和\(\frac{\sum_{i=0}^{N}y^i}{y!}\)NTT卷积即可。
• 时间复杂度\(O(NLogN)\)。
  

【代码】

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 262144;
const int P = 998244353;
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 n, a[MAXN], b[MAXN], c[MAXN];
int bit[MAXN], fac[MAXN], inv[MAXN];
int main() {
	read(n);
	bit[0] = fac[0] = 1;
	for (int i = 1; i <= n; i++) {
		fac[i] = 1ll * fac[i - 1] * i % P;
		bit[i] = 2ll * bit[i - 1] % P;
	}
	inv[n] = NTT :: power(fac[n], P - 2);
	for (int i = n - 1; i >= 0; i--)
		inv[i] = inv[i + 1] * (i + 1ll) % P;
	for (int i = 0; i <= n; i++)
		if (i & 1) a[i] = P - inv[i];
		else a[i] = inv[i];
	b[0] = 1, b[1] = n + 1;
	for (int i = 2; i <= n; i++)
		b[i] = (NTT :: power(i, n + 1) - 1ll) * NTT :: power(i - 1, P - 2) % P * inv[i] % P;
	NTT :: times(a, b, c, n + 1);
	int ans = 0;
	for (int i = 0; i <= n; i++)
		ans = (ans + 1ll * bit[i] * fac[i] % P * c[i]) % P;
	writeln(ans);
	return 0;
}