2021CCPC东北四省赛 C. Vertex Deletion 树形DP

传送门

分析

树形DP
我们用$f[u][0/1/2]$表示$u$节点的三个状态

• 删除$u$节点
• 不删除$u$节点但是与子节点连接
• 不删除$u$节点也不与子节点连接
  那么，不难写出状态转移方程
  $f[u][0]+=f[v][1]+f[v][0]$
  $f[u][1]+=f[v][1]+f[v][0]+f[v][2],f[u][2]-=f[u][1]$
  $f[u][2]+=f[v][0]$

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 10,M = N * 2;
const ll mod = 998244353;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int h[N],ne[M],e[M],idx;
ll f[N][3];
int n;

void add(int x,int y){
	ne[idx] = h[x],e[idx] = y,h[x] = idx++;
}

void dfs(int u,int fa){
	f[u][0] = f[u][1] = f[u][2] = 1;
	for(int i = h[u];~i;i = ne[i]){
		int j = e[i];
		if(j == fa) continue;
		dfs(j,u);
		f[u][0] = f[u][0] * (f[j][0] + f[j][1]) % mod;
		f[u][1] = f[u][1] * (f[j][0] + f[j][1] + f[j][2]) % mod;
		f[u][2] = f[u][2] * f[j][0] % mod;
	}
	f[u][1] = f[u][1] - f[u][2];
	if(f[u][1] < 0) f[u][1] += mod;
}

int main() {	
	int T;
	read(T);
	while(T--){
		read(n);
		idx = 0;
		for(int i = 1;i <= n;i++) h[i] = -1;
		for(int i = 1;i < n;i++){
			int x,y;
			read(x),read(y);
			add(x,y),add(y,x);
		}
		dfs(1,0);
		dl((f[1][0] + f[1][1]) % mod);
	}
	return 0;
}