hdu1054Strategic Game

131人阅读 评论(0)

Strategic Game
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7770 Accepted Submission(s): 3709

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

#include <cstdio>
#include <vector>//用STL容器来建立邻接表
#include <cstring>
#include <algorithm>
#define N 1510
using namespace std;
int VN;
vector<int>mp[N];
bool dfs(int u)
{
for(int i=0; i<mp[u].size(); i++)
{
if(!vist[mp[u][i]])
{
vist[mp[u][i]]=1;
{
return true;
}
}
}
return false;
}
int hungary()
{
int cnt=0;
for(int i=0; i<VN; i++)
{
memset(vist,0,sizeof(vist));
if(dfs(i))
cnt++;
}
return cnt;
}
int main()
{
int u,k,v,n;
while(~scanf("%d",&n))
{
for(int i=0; i<N; i++)
mp[i].clear();
for(int i=0;i<n;i++)//while在这不能使用
{
scanf("%d:(%d)",&u,&k);
while(k--)
{
scanf("%d",&v);
mp[u].push_back(v);
mp[v].push_back(u);
}
}
VN=n;
printf("%d\n",hungary()/2);
}
return 0;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：34288次
• 积分：3531
• 等级：
• 排名：第9711名
• 原创：330篇
• 转载：26篇
• 译文：2篇
• 评论：5条
评论排行
最新评论