HDU 1054 Strategic Game(二分图 最小顶点覆盖)

                             Strategic Game

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

12

题目大概意思：用最少的顶点覆盖所有边。

二分图基础模板题。

二分图一些基础概念：

我们是建的无向图，边增加一倍，最大匹配数/2 即是我们需要求的最小顶点覆盖

代码如下：

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
using namespace std;
const int maxn = 1500+5;
int Next[maxn*200],Lext[maxn],To[maxn*200],dis[maxn];
bool vis[maxn];
int cnt;
void init()
{
    cnt=0;//这里忘了清0 T了几次
    memset(Lext,-1,sizeof(Lext));
    memset(vis,0,sizeof(vis));
    memset(dis,-1,sizeof(dis));
}
void add(int u,int v)
{
    Next[++cnt]=Lext[u];
    Lext[u]=cnt;
    To[cnt]=v;
}
bool dfs(int x)
{
    for(int i=Lext[x]; i!=-1; i=Next[i])
    {
        int y=To[i];
        if(!vis[y])
        {
            vis[y]=1;
            if(dis[y]==-1||dfs(dis[y]))
            {
                dis[y]=x;
                return true;
            }
        }
    }
    return false;
}
int main()
{
    int n,u,m,v;
    while(~scanf("%d",&n))
    {
        init();
        for(int i=0; i<n; i++)
        {
            scanf("%d:(%d)",&u,&m);
            for(int j=0; j<m; j++)
            {
                scanf("%d",&v);
                add(v,u);
                add(u,v);
            }
        }
        int ans=0;
        for(int i=0; i<n; i++)
        {
            memset(vis,0,sizeof(vis));
            if(dfs(i)) ans++;
        }
        printf("%d\n",ans/2);
    }
}