树形DP UVA 1292 Strategic game

题目传送门

 /*
     题解：选择一个点，它相邻的点都当做被选择，问最少选择多少点将所有点都被选择
     树形DP：dp[i][0/1]表示当前点选或不选，如果选，相邻的点可选可不选，取最小值
 */
 /************************************************
  * Author        :Running_Time
  * Created Time  :2015-8-12 10:54:05
  * File Name     :UVA_1292.cpp
  ************************************************/
 #include <cstdio>
 #include <algorithm>
 #include <iostream>
 #include <sstream>
 #include <cstring>
 #include <cmath>
 #include <string>
 #include <vector>
 #include <queue>
 #include <deque>
 #include <stack>
 #include <list>
 #include <map>
 #include <set>
 #include <bitset>
 #include <cstdlib>
 #include <ctime>
 using namespace std;
 #define lson l, mid, rt << 1
 #define rson mid + 1, r, rt << 1 | 1
 typedef long long ll;
 const int MAXN =  + ;
 const int INF = 0x3f3f3f3f;
 const int MOD = 1e9 + ;
 vector<int> G[MAXN];
 bool vis[MAXN];
 int dp[MAXN][];
 int n;
 void DFS(int u) {
     vis[u] = true;
     for (int i=; i<G[u].size (); ++i)  {
         int v = G[u][i];
         if (vis[v]) continue;
         DFS (v);
         dp[u][] += min (dp[v][], dp[v][]);
         dp[u][] += dp[v][];
     }
 }
 int main(void)    {     //UVA 1292 Strategic game
     while (scanf ("%d", &n) == )   {
         for (int i=; i<n; ++i) G[i].clear ();
         memset (dp, , sizeof (dp));
         for (int i=; i<n; ++i) dp[i][] = ;
         memset (vis, false, sizeof (vis));
         for (int i=; i<=n; ++i)    {
             int u, v, num;   scanf ("%d:(%d)", &u, &num);
             for (int j=; j<=num; ++j)  {
                 scanf ("%d", &v);
                 G[u].push_back (v); G[v].push_back (u);
             }
         }
         DFS ();
         printf ("%d\n", min (dp[][], dp[][]));
     }
     return ;
 }