HDOJ 1054 Strategic Game
来源:互联网 发布:mac的输入法快捷键 编辑:程序博客网 时间:2024/06/06 21:04
二分图匹配:
最大匹配数=最大独立集=最小点覆盖
最小路径覆盖=点数-最大匹配数
Strategic Game
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4739 Accepted Submission(s): 2147
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:
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
40:(1) 11:(2) 2 32:(0)3:(0)53:(3) 1 4 21:(1) 02:(0)0:(0)4:(0)
Sample Output
12
Source
Southeastern Europe 2000
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=2000;struct Edge{ int to,next;}edge[maxn*maxn];int Adj[maxn],Size;void init(){ Size=0; memset(Adj,-1,sizeof(Adj));}void Add_Edge(int u,int v){ edge[Size].next=Adj[u]; edge[Size].to=v; Adj[u]=Size++;}int n;/**************hungary************/int linker[maxn];bool used[maxn];bool dfs(int u){ for(int i=Adj[u];~i;i=edge[i].next) { int v=edge[i].to; if(!used[v]) { used[v]=true; if(linker[v]==-1||dfs(linker[v])) { linker[v]=u; return true; } } } return false;}int hungary(){ int res=0; memset(linker,-1,sizeof(linker)); for(int u=0;u<n;u++) { memset(used,false,sizeof(used)); if(dfs(u)) res++; } return res;}int main(){ while(scanf("%d",&n)!=EOF) { init(); for(int i=0;i<n;i++) { int u,v,m; scanf("%d:(%d)",&u,&m); for(int j=0;j<m;j++) { scanf("%d",&v); Add_Edge(u,v); Add_Edge(v,u); } } printf("%d\n",hungary()/2); } return 0;}
0 0
- hdoj 1054 Strategic Game
- HDOJ 1054 Strategic Game
- HDOJ 1054 Strategic Game
- hdoj 1054 Strategic Game
- hdu/hdoj 1054 Strategic Game
- ACM HDOJ 1054 (Strategic Game)
- HDOJ 题目1054 Strategic Game(二分图最大匹配)
- hdoj.1054 Strategic Game【二分图匹配】 2015/8/14
- hdu 1054 Strategic Game
- HDU 1054 Strategic Game
- hdu 1054 Strategic Game
- hdu 1054 Strategic Game
- Hdu 1054 Strategic Game
- hdu 1054 Strategic Game
- HDU - 1054 Strategic Game
- hdu 1054 Strategic Game
- hdu-1054-Strategic Game
- HDU 1054 Strategic Game
- x264 - x264_reference_reset
- mysql 字段类型总结---字段类型总表
- SPAIA
- object references an unsaved transient instance - save the transient instance before flushing
- php获取分类下面的所有子类方法
- HDOJ 1054 Strategic Game
- x264 - x264_reference_hierarchy_reset
- Response.Write 调用 JS文件中自定义的函数,jquery、js调用iframe父窗口与子窗口元素的方法
- C#多线程(二)
- 二分查找算法(递归和非递归)
- 黑马程序员java基础String、StringBuffer、StringBuilder笔记
- x264 - x264_reference_build_list
- 带有头结点的循环单链表的相关操作
- tomcat从 http转成https,并且去掉端口号