HDU 5896 (CDQ分治 NTT)

题目链接：点击这里

题意：求n个点的有环图。

作为出题人已经被全国acmer翔都喷出来了T.T 题面显示的版本是初始版本，大概时限需要开到10s左右，HDU的管理员表示服务器要受不了让我们改数据，于是把2e5->2e4，然后也就不需要至多一组大于1000这样的话了。结果中间过程出现了某种不可描述的错误导致题面还是古老版本的题面，于是出现了喜闻乐见的二分判数据，各种黑科技压时间的情况。表示抱歉~~~~

相当于求n个点的森林，然后拿图的总数一减就行了。假设$g(n)$表示n个点的森林个数，$h(n)$表示n个点的树个数，显然$h(n)=n^{n-2}$。n个点的森林必然是1这个点和别的某些点连成一个树，然后剩下的点构成一个森林，这样就得到一个递推式：

g(n)=h(n)+∑i=1n−1Ci−1n−1h(i)g(n−i)

$$g(n)=h(n)+\sum_{i=1}^{n-1}C_{n-1}^{i-1}h(i)g(n-i)$$
然后再整理一下就是一个卷积了： $$g(n)=h(n)+(n-1)!\sum_{i=1}^{n-1}\frac{h(i)}{(i-1)!} \times \frac{g(n-i)}{(n-i)!}$$
用FFT加速即可。模数比较大，用NTT来避免精度误差，暴力一下原根等于3.

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
using namespace std;
#define mod 1004535809LL
#define G 3LL
#define maxn 45555

long long x1[maxn], x2[maxn];
long long qpow (long long a, long long b) {
    long long ret=1;
    while (b) {
        if (b&1) ret = (ret*a)%mod;
        a = (a*a)%mod;
        b >>= 1;
    }
    return ret;
}

void change (long long *y, int len) {
    int i, j, k;
    for(i = 1, j = len / 2; i < len - 1; i++) {
        if (i < j) swap(y[i], y[j]);
        k = len / 2;
        while (j >= k) {
            j -= k;
            k /= 2;
        }
        if (j < k) j += k;
    }
}

void ntt (long long *y, int len, int on) {
    change (y, len);
    int id = 0;
    for(int h = 2; h <= len; h <<= 1) {
        id++;
        long long wn = qpow (G, (mod - 1) / (1<<id));
        for(int j = 0; j < len; j += h) {
            long long w = 1;
            for(int k = j; k < j + h / 2; k++) {
                long long u = y[k] % mod;
                long long t = w * (y[k + h / 2] % mod) % mod;
                y[k] = (u + t) % mod;
                y[k + h / 2] = ((u - t) % mod + mod) % mod;
                w = w * wn % mod;
            }
        }
    }
    if (on == -1) {
        for (int i = 1; i < len / 2; i++)
            swap (y[i], y[len - i]);
        long long inv = qpow(len, mod - 2);
        for(int i = 0; i < len; i++)
            y[i] = y[i] % mod * inv % mod;
    }
}

long long n, m;
long long f[maxn], g[maxn], h[maxn];
//n个点的森林 n个点的图 n个点的树
long long fac[maxn], rev[maxn];

void solve (int l, int r) { //cout << l << " " << r << endl;
    if (l == r) {
        f[l] += h[l];
        f[l] %= mod;
        return;
    }
    int mid = (l+r) >> 1;
    solve (l, mid);
    int len = 1;
    while (len <= r-l+1) {len <<= 1;}
    for (int i = 0; i < len; i++) {
        x1[i] = x2[i] = 0;
    }
    for (int i = l; i <= mid; i++) {
        x1[i-l] = f[i]*rev[i]%mod;
    }
    for (int i = 1; i <= r-l; i++) {
        x2[i-1] = h[i]*rev[i-1]%mod;
    }
    ntt (x1, len, 1), ntt (x2, len, 1);
    for (int i = 0; i < len; i++) x1[i] = x1[i] * x2[i] % mod;
    ntt (x1, len, -1);
    for (int i = mid+1; i <= r; i++) {
        f[i] += x1[i-l-1]*fac[i-1] %mod;
        f[i] %= mod;
    }
    //cout << l << " " << r << endl;
    //for (int i = 1; i <= 4; i++) cout << f[i] << " "; cout << endl;
    solve (mid+1, r);
}

int main () {
    //freopen ("in", "r", stdin);
    //freopen ("out", "w", stdout);
    //int t1 = clock ();
    g[1] = h[1] = 1;
    for (int i = 2; i <= 20000; i++) {
        h[i] = qpow (i, i-2);
        g[i] = qpow (2, 1LL*i*(i-1)/2);
    }
    fac[0] = 1;
    for (int i = 1; i <= 20000; i++) fac[i] = fac[i-1] * i % mod;
    rev[20000] = qpow (fac[20000], mod - 2);
    for (int i = 20000-1; i >= 0; i--) rev[i] = rev[i+1] * (i+1) % mod;
    int t;
    scanf ("%d", &t);
    while (t--) {
        scanf ("%lld", &n);
        memset (f, 0, sizeof f);
        solve (1, n);
        long long ans = g[n]-f[n];
        (ans %= mod) += mod; ans %= mod;
        printf ("%lld\n", ans);
    }
    //int t2 = clock ();
    //cout << t2-t1 << endl;
    return 0;
}