POJ - 3342 Party at Hali-Bula 树形dp入门

原题链接：http://poj.org/problem?id=3342

题意

和没有上司的舞会题意基本一致，多了一个判断答案是否唯一

分析

$$设两个状态$$

$$dp[x][1/0]表示取或不取当前节点获得的最大值$$

$$f[x][1/0]表示取或不取当前节点答案是否唯一$$

$$状态转移方程$$

$$dp[x][1]+=dp[v][0]$$

$$dp[x][0]+=max(dp[v][0],dp[v][1])$$

$$f[x][1]=f[x][1]\&f[v][0]$$

$$f[x][1]=0[dp[v][0]=dp[v][1]\Vert (dp[v][0]>dp[v][1]\&!f[v][0]\Vert (dp[v][0]<dp[v][1]\&!f[v][1])]$$

code

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
#include <bitset>
#include <map>
#include <set>
#include <stack>
//#include <unordered_map>
using namespace std;
#define fi first
#define se second
#define re register
typedef long long ll;
typedef pair<ll, ll> PII;
typedef unsigned long long ull;
const int N = 1e5 + 10, M = 1e6 + 5, INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
vector<int> g[N];
map<string, int> mp;
int cnt;
int dp[N][2], f[N][2];
void init() {
    for (int i = 0; i < N; i++) g[i].clear();
    memset(dp, 0, sizeof dp);
    memset(f, 1, sizeof f);
    cnt = 0; mp.clear();
}
void dfs(int x, int fa) {
    dp[x][1] = 1;
    for (int i = 0; i < g[x].size(); i++) {
        int v = g[x][i];
        if (v == fa) continue;
        dfs(v, x);
        dp[x][1] += dp[v][0];
        dp[x][0] += max(dp[v][1], dp[v][0]);

        f[x][1] = f[x][1] & f[v][0];
        if (dp[v][1] == dp[v][0]) f[x][0] = 0;
        if (dp[v][1] > dp[v][0] && !f[v][1]) f[x][0] = 0;
        if (dp[v][1] < dp[v][0] && !f[v][0]) f[x][0] = 0;
    }
}
void solve() {
    int n; while (cin >> n && n) {
        init();
        string s; cin >> s;
        mp[s] = ++cnt;
        for (int i = 1; i <= n-1; i++) {
            string s1, s2; cin >> s1 >> s2;
            if (!mp[s1]) mp[s1] = ++cnt;
            if (!mp[s2]) mp[s2] = ++cnt;
            g[mp[s1]].push_back(mp[s2]);
            g[mp[s2]].push_back(mp[s1]);
        }
        dfs(1, 0);
        cout << max(dp[1][0], dp[1][1]) << " ";
        if (dp[1][0] == dp[1][1]) {
            cout << "No" << endl;
        } else if (dp[1][0] > dp[1][1]) {
            cout << (f[1][0] ? "Yes" : "No") << endl;
        } else {
            cout << (f[1][1] ? "Yes" : "No") << endl;
        }
    }
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
#endif
    solve();
    return 0;
}