【NTT】 ZOJ 3874 Permutation Graph

推出公式以后分治ntt优化即可。。。

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

const int maxn = 100005;
const int maxm = 300005;
const int mod = 786433;

LL a[maxm],  b[maxm],  c[maxm];
LL f[maxn], dp[maxn];
int data[maxn];

LL powmod(LL a, LL b, LL p)
{
	LL res = 1, base = a;
	while(b) {
		if(b % 2) res = res * base % mod;
		base = base * base % mod;
		b /= 2;
	}
	return res;
}
namespace NTT {
	const int r = 10, gl = 25;
	LL p, rp[50], irp[50];
	void setMod(LL _p = 786433) {
		p = _p;
		for(int i = 0; i < gl; i++) rp[i] = powmod(r, (p-1)/(1<<i), p);
	}
	void FFT(LL a[], int n, LL wt[] = rp)
	{
		for(int i = 0, j = 0; i < n; i++) {
			if(j > i) swap(a[i], a[j]);
			int k = n;
			while(j & (k >>= 1)) j &= ~k;
			j |= k;
		}
		for(int m = 1, b = 1; m < n; m<<=1, b++)
		for(int k = 0, w = 1; k < m; ++k) {
			for(int i = k; i < n; i += m<<1) {
				int v = a[i+m] * w % p;
				if((a[i+m] = a[i] - v) < 0) a[i+m] += p;
				if((a[i] += v) >= p) a[i] -= p;
			}
			w = w * wt[b] % p;
		}
	}
	void IFFT(LL a[], int n) {
		for(int i = 0; i < gl; i++) irp[i] = powmod(rp[i], n-1, p);
		FFT(a, n, irp);
		LL inv = powmod(n, p-2, p);
		for(int i = 0; i < n; i++) a[i] = a[i] * inv % p;
	}
	void Mul(LL a[], LL b[], LL n, LL c[]) {
		FFT(a, n);FFT(b, n);
		for(int i = 0; i < n; i++) c[i] = a[i] * b[i] % p;
		IFFT(c, n);
	}
}
LL f1(int x)
{
	return dp[x];
}
LL f2(int x)
{
	return ((mod - f[x]) % mod + mod) % mod;
}
void cdq(int L, int R)
{
	if(L == R) {
		dp[L] = (dp[L] + f[L]) % mod;
		return;
	}
	int mid = (L + R) >> 1;
	cdq(L, mid);
	int N = R - L + 1, n = 1;
	while(2 * N >= n) n *= 2;
	for(int i = 0; i <= n; i++) a[i] = b[i] = c[i] = 0;
	for(int i = 0; i < mid-L+1; i++) a[i] = f1(i + L);
	for(int i = 1; i <= N; i++) b[i] = f2(i);
	NTT::Mul(a, b, n, c);
	for(int i = mid+1; i <= R; i++) dp[i] = (dp[i] + c[i-L]) % mod;
	cdq(mid+1, R);
}

void init()
{
	int N = 100000;
	
	f[0] = 1;
	for(int i = 1; i <= N; i++) f[i] = f[i-1] * i % mod;

	NTT::setMod();
	cdq(1, N);
}

void work()
{
	LL ans = 1;
	int n, m, t;
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= m; i++) {
		scanf("%d", &t);
		for(int j = 0; j < t; j++) scanf("%d", &data[j]);
		sort(data, data+t);
		for(int j = 1; j < t; j++) if(data[j] != data[j-1] + 1) ans = 0;
		ans = ans * dp[t] % mod;
	}
	printf("%lld\n", ans);
}

int main()
{
	init();
	int _;
	scanf("%d", &_);
	while(_--) work();

	return 0;
}