hdu---(1054)Strategic Game(最小覆盖边)

Strategic Game

Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5034    Accepted Submission(s): 2297

Problem Description

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:

Sample 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)

Sample Output

1 2

Source

Southeastern Europe 2000

Recommend

代码：  这里是最少覆盖边，开始一直搞最小覆盖点，然后各种不得劲，.....后面看了以下提示，然后就明白了。但是改了之后有开始tie,没办法，只能最后用起了邻接表（我用 的是vector来替代的）  最小覆盖点 =顶点数- 最大匹配数  、  最小覆盖边= 等于（无向图）最大匹配/2;

代码：

 1 #include<cstring>
 2 #include<cstdio>
 3 #include<vector>
 4 #include<iostream>
 5 using namespace std;
 6 const int maxn=1550;
 7 vector<vector<int> >grid(maxn);
 8 bool vis[maxn];
 9 int savx[maxn];
10 int n;
11 int km(int x){
12     vector<int>::iterator it;
13   for(it=grid[x].begin();it<grid[x].end();it++){
14       if(!vis[*it]){
15            vis[*it]=1;
16       if(savx[*it]==-1||km(savx[*it])){
17         savx[*it]=x;
18         return 1;
19       }
20       }
21   }
22  return 0;
23 }
24 
25 int main(){
26     int ans=0;
27     int a,b,c;
28     int km(int );
29     while(scanf("%d",&n)!=EOF){
30         ans=0;
31        memset(savx,-1,sizeof(savx));
32        for(int i=0;i<n;i++)
33           grid[i].clear();
34       for(int i=0;i<n;i++){
35            scanf("%d:(%d)",&a,&b);
36           for(int j=0;j<b;j++){
37          scanf("%d",&c);
38          grid[a].push_back(c);
39          grid[c].push_back(a);
40           }
41       }
42      for(int i=0;i<n;i++){
43        memset(vis,0,sizeof(vis));
44        ans+=km(i);
45      }
46     printf("%d\n",ans/2);
47     }
48  return 0;
49 }