UESTC - 方伯伯的儿童节

DP

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#define MOD 10007
#define eps 1e-10
#define maxn 100010
#define INF (int)(1e5+7)
using namespace std;
typedef long long ll;
struct node {
    int to, w, next;
};
node edge[maxn << 2];
int head[maxn];
int dp[maxn][2];
ll num[maxn][2];
int vis[maxn];
int dfs(int cur, int col) {
    if (dp[cur][col] != -1) return dp[cur][col];
    vis[cur] = 1;
    int res = col;
    ll sum = 1;
    for (int k = head[cur]; k != -1; k = edge[k].next) if (!vis[edge[k].to]) {
        if (col == 1) {
            res += min(dfs(edge[k].to,1), dfs(edge[k].to,0));
            if (dfs(edge[k].to,1) == dfs(edge[k].to,0)) {
                sum *= (num[edge[k].to][0] + num[edge[k].to][1]);
            } else if (dfs(edge[k].to,1) < dfs(edge[k].to,0)) {
                sum *= num[edge[k].to][1];
            } else {
                sum *= num[edge[k].to][0];
            }
        }
        else {
            res += dfs(edge[k].to, 1);
            sum *= num[edge[k].to][1];
        }
        sum %= MOD;
    }
    vis[cur] = 0;
    num[cur][col] = sum;
    return dp[cur][col] = res;
}
int main() {
    int t;
    scanf("%d", &t);
    while (t --) {
        int n;
        scanf("%d", &n);
        int p = 0;
        memset(dp, -1, sizeof(dp));
        memset(vis, 0, sizeof(vis));
        memset(num, 0, sizeof(num));
        memset(head, -1, sizeof(head));
        for (int i = 0; i < n-1; ++ i) {
            int u, v;
            scanf("%d%d", &u, &v);
            edge[p].to = v;
            edge[p].next = head[u];
            head[u] = p;
            ++ p;
            edge[p].to = u;
            edge[p].next = head[v];
            head[v] = p;
            ++ p;
        }
        int res = min(dfs(1,1), dfs(1,0));
        ll sum = 0;
        if (dfs(1,1) == dfs(1,0)) {
            sum = num[1][1] + num[1][0];
        }
        else if (dfs(1,1) <= dfs(1,0)) {
            sum = num[1][1];
        }
        else {
            sum = num[1][0];
        }
        sum %= MOD;
        printf("%d %lld\n", res, sum);

    }
}