【BZOJ5093】【Lydsy1711月赛】图的价值

【题目链接】

• 点击打开链接
  

【思路要点】

• 显然每个点对于答案的贡献可以分开考虑，枚举点的度数\(i\)，可知\(Ans=N*\sum_{i=0}^{N-1}\binom{N-1}{i}*i^k*2^{\binom{N-1}{2}}\)。
• 因此，我们本质上需要解决的问题是求解\(Ans'=\sum_{i=0}^{N}\binom{N}{i}*i^k\)。
• 展开\(i^k\)，有\(Ans'=\sum_{i=0}^{N}\frac{N!}{i!(N-i)!}\sum_{j=0}^{k}S(k,j)*\frac{i!}{(i-j)!}\)。
• 即\(Ans'=N!\sum_{i=0}^{N}\frac{1}{(N-i)!}\sum_{j=0}^{k}S(k,j)*\frac{1}{(i-j)!}\)。
• 交换求和顺序，有\(Ans'=N!\sum_{j=0}^{k}S(k,j)\sum_{i=0}^{N}\frac{1}{(N-i)!(i-j)!}\)。
• 即\(Ans'=N!\sum_{j=0}^{k}S(k,j)\sum_{i=0}^{N}\binom{N-j}{N-i}*\frac{1}{(N-j)!}\)。
• 即\(Ans'=\sum_{j=0}^{k}S(k,j)*2^{N-j}*\frac{N!}{(N-j)!}\)。
• 剩下的问题就是如何求解\(S(k,j)\)。
• 由容斥原理，\(S(k,j)=j!\sum_{i=0}^{j}(-1)^i*\binom{j}{i}*(j-i)^k=\sum_{i=0}^{j}\frac{(-1)^i}{i!}*\frac{(k-i)^N}{(k-i)!}\)。
• NTT卷积即可，时间复杂度\(O(KLogK)\)。

【代码】

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