HDU 1054 Hungary
来源:互联网 发布:超级基因优化液女主角 编辑:程序博客网 时间:2024/06/02 11:44
Strategic Game
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
一定要注意 不能把first数组或者fa数组初值设成零,因为这里有0这个点。。因为这个查了好久的错。。。。
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int n,tot=0,first[1505],nxt[1500*1505*2],v[1500*1500*2],fa[1505],ans=0;bool vis[1505];inline void add(int xx,int yy){ v[tot]=yy; nxt[tot]=first[xx]; first[xx]=tot++;}bool dfs(int x){ for(int i=first[x];~i;i=nxt[i]) if(!vis[v[i]]){ vis[v[i]]=1; if(fa[v[i]]==-1||dfs(fa[v[i]])){ fa[v[i]]=x;return true; } } return false;}int main(){ while(scanf("%d",&n)!=EOF) { memset(first,-1,sizeof(first)); memset(fa,-1,sizeof(fa)); tot=ans=0; for(int i=0;i<n;i++){ register int xx,yy,zz; scanf("%d:(%d)",&xx,&yy); for(int j=1;j<=yy;j++){ scanf("%d",&zz),add(zz,xx),add(xx,zz); } } for(int i=0;i<n;i++){ memset(vis,0,sizeof(vis)); if(dfs(i)==1)ans++; } printf("%d\n",ans/2); }}
- HDU 1054 Hungary
- [HDU 1054] Stragetic Game Hungary算法求最小点覆盖
- HDU 2063 过山车(二分匹配-hungary)
- HDU 5727 Necklace (二分图匹配hungary)
- HDU 5727 Necklace(二分匹配-hungary)
- hdu 3605 Escape 多重匹配模板 (Hungary ) | 最大流
- hdu 2063 过山车(纯裸hungary算法)
- Hungary 算法
- HDU 1068 Girls and Boys(最大点独立集-hungary)
- POJ 1422 && HDU 1151 Air Raid(最小路径覆盖-hungary)
- [Algorithm]Hungary Match
- poj2536 hungary+坐标
- hdu498二分图(Hungary)
- POJ 3020 Hungary
- poj 2446 Chessboard (Hungary Algorithm)
- poj 2226 hungary(铺木板)
- Hungary模板(DFS版本)
- 二分图匹配Hungary算法
- sublime的安装
- spring+springmc+mybatis整合遇见的问题
- C++ 语法知识 3
- 4月27号全国高校云计算大赛晋级
- Equidivisions
- HDU 1054 Hungary
- hdu-4544-湫湫系列故事——消灭兔子-贪心+stl
- 看过的一些iOS书籍及源代码下载地址
- windows下安装xgboost numpy scipy scikit-learn matplotlib
- Android 中Theme的使用随笔
- Smali反编译Java文件
- MFC框架的一种理解方法
- JavaWeb之Servlet day01
- c++第四次作业