Description
“简单无向图”是指无重边、无自环的无向图(不一定连通)。
一个带标号的图的价值定义为每个点度数的 k k 次方的和。
给定和 k k ,请计算所有个点的带标号的简单无向图的价值之和。
因为答案很大,请对 998244353 998244353 取模输出。
Solution
对于每个点分别考虑贡献:
考虑第二类斯特林数有这样一个性质
所以原式化为
枚举 j j
考虑 ∑n−1i=0C(i,j)C(n−1,i)=C(n−1,j)∑n−1i=jC(n−1,i−j)=2n−1−jC(n−1,j) ∑ i = 0 n − 1 C ( i , j ) C ( n − 1 , i ) = C ( n − 1 , j ) ∑ i = j n − 1 C ( n − 1 , i − j ) = 2 n − 1 − j C ( n − 1 , j )
所以原式化为
当 j j 很大时,为 0 0 ,所以只需要枚举到即可。
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
const int mod = 998244353;
const int G = 3, Phi = mod - 1;
const int maxn = 530005;
int n, m, k;
int fac[maxn], ifac[maxn];
int L, R[maxn], A[maxn], B[maxn];
int Pow(int x, lint k)
{
int res = 1;
while (k) {
if (k & 1) res = (lint)res * x % mod;
x = (lint)x * x % mod; k >>= 1;
}
return res;
}
void NTT(int *a, int f)
{
for (int i = 0; i < m; ++i)
if (i < R[i]) swap(a[i], a[R[i]]);
for (int i = 1; i < m; i <<= 1) {
int wn = Pow(G, Phi / (i << 1)), t;
if (f == -1) wn = Pow(wn, mod - 2);
for (int j = 0; j < m; j += (i << 1)) {
int w = 1;
for (int k = 0; k < i; ++k, w = (lint)w * wn % mod) {
t = (lint)a[j + i + k] * w % mod;
a[j + i + k] = a[j + k] - t;
if (a[j + i + k] < 0) a[j + i + k] += mod;
a[j + k] = a[j + k] + t;
if (a[j + k] >= mod) a[j + k] -= mod;
}
}
}
}
void NTT(int *A, int *B)
{
int i;
for (i = m << 1, m = 1; m <= i; m <<= 1) ++L;
for (int i = 0; i < m; ++i) R[i] = (R[i >> 1] >> 1) | ((i & 1) << (L - 1));
NTT(A, 1); NTT(B, 1);
for (int i = 0; i < m; ++i) A[i] = (lint) A[i] * B[i] % mod;
NTT(A, -1);
int inv = Pow(m, mod - 2);
m = i >> 1;
for (int i = 0; i <= m; ++i) A[i] = (lint)A[i] * inv % mod;
}
int main()
{
freopen("graph.in", "r", stdin);
freopen("graph.out", "w", stdout);
scanf("%d%d", &n, &k); m = min(n - 1, k);
fac[0] = 1;
for (int i = 1; i <= m; ++i) fac[i] = (lint)fac[i - 1] * i % mod;
ifac[m] = Pow(fac[m], mod - 2);
for (int i = m - 1; i >= 0; --i) ifac[i] = (lint)ifac[i + 1] * (i + 1) % mod;
for (int i = 0; i <= m; ++i) {
A[i] = i & 1 ? mod - ifac[i] : ifac[i];
B[i] = (lint)Pow(i, k) * ifac[i] % mod;
}
NTT(A, B);
int ans = 0, Inv = (mod + 1) / 2;
for (int i = 0, sum = Pow(2, n - 1); i <= m; ++i) {
ans += (lint)sum * A[i] % mod;
if (ans >= mod) ans -= mod;
sum = (lint)sum * Inv % mod * (n - 1 - i) % mod;
}
printf("%d\n", (lint)ans * n % mod * Pow(2, (lint)n * (n - 1) / 2 - n + 1) % mod);
return 0;
}