ZOJ 1134 Strategic Game（非二分图最小顶点覆盖）

Strategic Game

---

Time Limit: 10 Seconds       Memory Limit: 32768 KB

---

Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He must defend a medieval city, the roads of which form a tree. He has to put the minimum number of soldiers on the nodes so that they can observe all the edges. Can you help him?

Your program should find the minimum number of soldiers that Bob has to put for a given tree.

The input file contains several data sets in text format. Each data set represents a tree with the following description:

the number of nodes
the description of each node in the following format
node_identifier:(number_of_roads) node_identifier1 node_identifier2 ... node_identifier
or
node_identifier:(0)

The node identifiers are integer numbers between 0 and n-1, for n nodes (0 < n <= 1500). Every edge appears only once in the input data.

For example for the tree:

the solution is one soldier ( at the node 1).

The output should be printed on the standard output. For each given input data set, print one integer number in a single line that gives the result (the minimum number of soldiers). An example is given in the following table:

Input

4
0:(1) 1
1:(2) 2 3
2:(0)
3:(0)
5
3:(3) 1 4 2
1:(1) 0
2:(0)
0:(0)
4:(0)

Output

1
2

---

Source:  Southeastern Europe 2000

思路：解决非二分图的最小顶点覆盖问题，有两种解决办法，贪心和动态规划（树形动态规划），下面采用动态规划算法解决问题。

状态：dp[u][0]表示结点u不在最小覆盖集的情况下，以u为根的子树的最小覆盖集中元素的个数；

            dp[u][1]表示结点u在最小覆盖集的情况下，以u为根的子树的最小覆盖集中元素的个数；

状态转移方程：dp[u][1]=∑min(dp[v][1],dp[v][0])+1；   dp[u][0]=∑dp[v][1];     （求和为u的全部子结点v）

代码：

#include <bits/stdc++.h>
using namespace std;

#define maxV 1501
vector<int> node[maxV];
int visit[maxV];
int dp[maxV][2]; 

void dfs(int u)
{
    visit[u]=1;
    int len=node[u].size();
    for(int i=0;i<len;i++)
    {
        int v=node[u][i];
        if(!visit[v])
        {
           dfs(v);
           dp[u][0]+=dp[v][1];
           dp[u][1]+=min(dp[v][0],dp[v][1]);
        }
    }
    dp[u][1]+=1;
}

int main()
{
	int u, v, num;
	int V;
	while( scanf("%d", &V )!=EOF )
	{
		memset(dp,0,sizeof(dp));
		memset(visit,0,sizeof(visit));
		for(int i=0; i<V; i++)
		    node[i].clear();
		for(int i=0; i<V; i++ )
		{
			scanf("%d:(%d)", &u, &num );
			for(int j=0; j<num; j++ )
			{
				scanf("%d", &v );
				node[u].push_back(v);
                node[v].push_back(u);
            }
		}
		dfs(1);
		printf("%d\n",min(dp[1][0],dp[1][1]));
	}
	return 0;
}