【题目链接】
【思路要点】
- 令\(f_i\)为当\(N=i\)时,原问题的答案。
- 显然有\(f_1=1\)。
- 当\(i>1\),考虑用\(i\)个点的简单无向图的个数减去\(i\)个点的简单无向图中不连通的个数。
- 考虑经典思路:枚举1号节点所在连通块的大小\(j\),则有\(f_i=2^{\binom{i}{2}}-\sum_{j=1}^{i-1}f_j*\binom{i-1}{j-1}*2^{\binom{i-j}{2}}\)。
- 展开组合数,整理得\(f_i=2^{\binom{i}{2}}-(i-1)!*\sum_{j=1}^{i-1}\frac{f_j}{(j-1)!}*\frac{2^{\binom{i-j}{2}}}{(i-j)!}\)。
- 直接使用分治NTT求解,时间复杂度\(O(NLog^2N)\),常数较好的实现可以通过本题。
- 观察上式,若将\(f_i\)移项,则有:\(2^{\binom{i}{2}}-(i-1)!*\sum_{j=1}^{i}\frac{f_j}{(j-1)!}*\frac{2^{\binom{i-j}{2}}}{(i-j)!}=0\)。
- 也即\(\frac{2^{\binom{i}{2}}}{(i-1)!}=\sum_{j=1}^{i}\frac{f_j}{(j-1)!}*\frac{2^{\binom{i-j}{2}}}{(i-j)!}\)。
- 令\(C_i=\frac{2^{\binom{i}{2}}}{(i-1)!}\),\(A_i=\frac{f_i}{(i-1)!}\),\(B_i=\frac{2^{\binom{i}{2}}}{i!}\),则上式等价于\(C=A*B\)。
- 其中\(C\)和\(B\)均为已知多项式,通过对\(B\)求逆倒推用\(A=C*B^{-1}\)求得\(A\)即可。
- 时间复杂度\(O(NLogN)\),可以通过本题。
【代码】
/*Inverse of Polynomial O(NLogN)*/ #include<bits/stdc++.h> using namespace std; const int MAXN = 524288; const int P = 1004535809; 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 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 powerll(int x, long long y) { if (y == 0) return 1; int tmp = powerll(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); } void timesabb(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] = 0; for (int i = limit / 2; i <= N; 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 * b[i] % P; NTT(c, -1); } void inverse(int *a, int *b, int limit) { b[0] = power(a[0], P - 2); for (int now = 1; now < limit; now <<= 1) { static int c[MAXN], d[MAXN]; for (int i = 0; i < now * 2; i++) c[i] = a[i], d[i] = b[i]; timesabb(c, d, d, now * 2); for (int i = 0; i < now * 2; i++) b[i] = (2ll * b[i] - d[i] + P) % P; } } } int n, fac[MAXN], inv[MAXN], two[MAXN]; int invb[MAXN], b[MAXN], c[MAXN], a[MAXN]; int main() { read(n); fac[0] = 1; for (int i = 1; i <= n; i++) fac[i] = 1ll * fac[i - 1] * i % P; inv[n] = NTT::power(fac[n], P - 2); for (int i = n - 1; i >= 0; i--) inv[i] = 1ll * inv[i + 1] * (i + 1) % P; for (int i = 1; i <= n; i++) two[i] = NTT::powerll(2, i * (i - 1ll) / 2); b[0] = 1; c[0] = 0; for (int i = 1; i <= n; i++) { b[i] = 1ll * two[i] * inv[i] % P; c[i] = 1ll * two[i] * inv[i - 1] % P; } NTT::inverse(b, invb, n + 1); NTT::times(invb, c, a, n + 1); writeln(1ll * a[n] * fac[n - 1] % P); return 0; } /*DivideAndConquer + NTT O(NLog^2N)*/ #include<bits/stdc++.h> using namespace std; const int MAXN = 262144; const int P = 1004535809; 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 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 powerll(int x, long long y) { if (y == 0) return 1; int tmp = powerll(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, f[MAXN], fac[MAXN], inv[MAXN], two[MAXN]; void work(int l, int r) { if (l == r) return; int mid = (l + r) / 2; work(l, mid); int limit = r - l + 1; static int a[MAXN], b[MAXN], c[MAXN]; for (int i = l; i <= mid; i++) a[i - l] = 1ll * f[i] * inv[i - 1] % P; for (int i = mid + 1; i <= r; i++) a[i - l] = 0; b[0] = 0; for (int i = 1; i < limit; i++) b[i] = 1ll * two[i] * inv[i] % P; NTT::times(a, b, c, limit); for (int i = mid + 1; i <= r; i++) f[i] = (f[i] - 1ll * fac[i - 1] * c[i - l] % P + P) % P; work(mid + 1, r); } int main() { read(n); fac[0] = 1; for (int i = 1; i <= n; i++) fac[i] = 1ll * fac[i - 1] * i % P; inv[n] = NTT::power(fac[n], P - 2); for (int i = n - 1; i >= 0; i--) inv[i] = 1ll * inv[i + 1] * (i + 1) % P; for (int i = 1; i <= n; i++) f[i] = two[i] = NTT::powerll(2, i * (i - 1ll) / 2); work(1, n); writeln(f[n]); return 0; }