[HEOI2016/TJOI2016]求和 NTT

题目链接

HEOI2016/TJOI2016求和

题目大意

求
$$f(n)=\sum _{i=0}^n\sum _{j=0}^{n}S(i,j)2^j(j!)$$

推式子

$$\begin{array}{rl}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)\\ & =\sum _{j=0}^n{2}^j(j!)\sum _{i=0}^n\sum _{k=0}^j(-1{)}^k\frac{1}{k!(j-k)!}(j-k{)}^i\\ & =\sum _{j=0}^n{2}^j(j!)\sum _{k=0}^j(-1{)}^k\frac{1}{k!(j-k)!}\sum _{i=0}^n(j-k{)}^i\\ & =\sum _{j=0}^n{2}^j(j!)\sum _{k=0}^j\frac{(-1{)}^k}{k!}\frac{{\sum }_{i=0}^n(j-k{)}^i}{(j-k)!}\end{array}$$

令 $g(n)={\sum }_{k=0}^j\frac{(-1{)}^k}{k!}\frac{{\sum }_{i=0}^n(j-k{)}^i}{(j-k)!}$，发现这个式子可以卷积。

令 $a_i=\frac{(-1{)}^i}{i!},b_i=\frac{{\sum }_{k=0}^n{i}^k}{i!}=\frac{i^{n+1}-1}{(i-1)i!}$，那么 $g(n)={\sum }_{i=0}^n{a}_i{b}_{n-i}$。所以 $f(n)={\sum }_{i=0}^n{2}^i(i!)g(i)。$

时间复杂度 $\text{O(nlogn)}$。

代码

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 4e5 + 5, mod = 998244353, G = 3, Gi = 332748118;
int n, lim = 1, L, r[N]; ll ans, fac[N], inv[N], a[N], b[N], g[N];
inline ll qpow(ll a, ll b) { ll ans = 1; for (; b ; b >>= 1, a = a * a % mod) if (b & 1) ans = ans * a % mod; return ans; }
inline void get(int n = N - 1) {
	fac[0] = 1; for (int i = 1; i <= n; ++ i) fac[i] = fac[i - 1] * i % mod;
	inv[n] = qpow(fac[n], mod - 2); for (int i = n - 1; i >= 0; -- i) inv[i] = (i + 1) * inv[i + 1] % mod;
}
inline void NTT(ll *A, int type) {
	for (int i = 0; i < lim; ++ i) if (i < r[i]) swap(A[i], A[r[i]]);
	for (int mid = 1; mid < lim; mid <<= 1) {
		ll Wn = qpow(type == 1 ? G : Gi, (mod - 1) / (mid << 1));
		for (int j = 0; j < lim; j += (mid << 1)) {
			ll w = 1;
			for (int k = 0; k < mid; ++ k, w = w * Wn % mod) {
				int x = A[j + k], y = w * A[j + k + mid] % mod;
				A[j + k] = (x + y) % mod, A[j + k + mid] = (x - y + mod) % mod;
			}
		}
	}
}
int main() {
	scanf("%d", &n), get(n);
	for (int i = 0; i <= n; ++ i) a[i] = qpow(mod - 1, i) * qpow(fac[i], mod - 2) % mod;
	b[0] = 1, b[1] = n + 1; for (int i = 2; i <= n; ++ i) b[i] = (qpow(i, n + 1) - 1 + mod) % mod * qpow(i - 1, mod - 2) % mod * qpow(fac[i], mod - 2) % mod;
	while (lim <= n + n) lim <<= 1, ++ L;
	for (int i = 0; i < lim; ++ i) r[i] = (r[i >> 1] >> 1) | ((i & 1) << (L - 1));
	NTT(a, 1), NTT(b, 1);
	for (int i = 0; i < lim; ++ i) a[i] = a[i] * b[i] % mod;
	NTT(a, -1);
	ll inv = qpow(lim, mod - 2), x = 1;
	for (int i = 0; i <= n; ++ i) g[i] = a[i] * inv % mod;
	for (int i = 0; i <= n; ++ i, x = (x << 1) % mod) (ans += x * fac[i] % mod * g[i] % mod) %= mod; 
	return printf("%lld\n", ans), 0;
}