【BZOJ4784】【ZJOI2017】【UOJ290】仙人掌（DP）

Description

http://uoj.ac/problem/290

---

Solution

首先判断是不是一个仙人掌/树，如果不是，直接输出0.
然后将返祖边所覆盖的边删掉，形成了一个森林，我们就只要算在这个森林中连边的方案。
设$g[i]$表示一个点有$i$个儿子，可以将儿子两两配对（允许不配对）的方案，那么显然有：
$$g[i]=g[i-1]+g[i-2]\ast (i-1)$$
（即新加入一个点时考虑是不连边还是选一个点与自己连边）

然后答案就是${\prod }_{u}g[deg[u]]$

---

Code

/************************************************
 * Au: Hany01
 * Date: Sep 12th, 2018
 * Prob: BZOJ4784 ZJOI2017 仙人掌
 * Email: hany01dxx@gmail.com & hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define SZ(a) ((int)(a).size())
#define ALL(a) a.begin(), a.end()
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline char getChar(){
    static char buf[100000], *p1=buf, *p2=buf;
    return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1 ++;
}
inline int read(){
    register char ch=getChar(); register int sum=0;
    while (!(ch >= '0' && ch <= '9')) ch = getChar();
    while(ch >= '0' && ch <= '9') sum = sum * 10 + ch - 48, ch = getChar();
    return sum;
}

const int maxn = 5e5 + 5, maxm = 1e6 + 5, MOD = 998244353;

int n, m, beg[maxn], cnt[maxn], vis[maxn], err, tot, e, g[maxn], ans, fa[maxn], pa[maxn], fe[maxn], nex[maxn << 1], v[maxn << 1], dep[maxn];
PII E[maxm];

inline void add(int uu, int vv) { v[++ e] = vv, nex[e] = beg[uu], beg[uu] = e; }

void preDFS(int u, int pa) {
	dep[u] = dep[pa] + 1;
	for (register int i = beg[u]; i; i = nex[i])
		if (v[i] != pa) fa[v[i]] = u, fe[v[i]] = i >> 1, preDFS(v[i], u);
}

int find(int x) { return x == pa[x] ? x : pa[x] = find(pa[x]); }

inline bool mark(int u, int v) {
	if (dep[u] < dep[v]) swap(u, v);
	for (; dep[u] > dep[v]; u = fa[u]) if (++ cnt[fe[u]] == 2) return 0;
	for (; u != v; u = fa[u], v = fa[v]) if (++ cnt[fe[u]] == 2 || ++ cnt[fe[v]] == 2) return 0;
	return 1;
}

void DFS(int u, int pa, int dg = 1) {
	vis[u] = 1;
	for (register int i = beg[u]; i; i = nex[i])
		if (!cnt[i >> 1] && v[i] != pa) ++ dg, DFS(v[i], u);
	ans = (LL)ans * g[dg] % MOD;
}

int main()
{
#ifdef hany01
	freopen("bzoj4784.in", "r", stdin);
	freopen("bzoj4784.out", "w", stdout);
#endif

	g[0] = g[1] = 1;
	For(i, 2, 5e5) g[i] = ((LL)g[i - 2] * (i - 1) + g[i - 1]) % MOD;

	for (static int T = read(), uu, vv, fu, fv; T --; ) {
		n = read(), m = read(), Set(beg, 0), Set(cnt, 0), Set(vis, 0), e = 1, tot = err = 0;
		For(i, 1, n) pa[i] = i;
		while (m --) {
			uu = read(), vv = read();
			if ((fu = find(uu)) == (fv = find(vv))) E[++ tot] = mp(uu, vv);
			else add(uu, vv), add(vv, uu), pa[fv] = fu;
		}
		preDFS(1, 0);
		For(i, 1, tot) if (!mark(E[i].x, E[i].y)) { err = 1; break; }
		if (err) { puts("0"); continue; }
		ans = 1;
		For(i, 1, n) if (!vis[i]) DFS(i, 0, 0);
		printf("%d\n", ans);
	}

	return 0;
}