HDOJ 题目1054 Strategic Game(二分图最大匹配)
来源:互联网 发布:zabbix windows 编辑:程序博客网 时间:2024/06/05 17:37
Strategic Game
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5218 Accepted Submission(s): 2400
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
Recommend
JGShining | We have carefully selected several similar problems for you: 1053 1281 1142 1050 1507
ac代码
#include<stdio.h>#include<string.h>#include<vector>#include<string>#include<iostream>using namespace std;vector<int>q[1505];int link[1505],v[1505];int dfs(int x){ int i; for(i=0;i<q[x].size();i++) { int c=q[x][i]; if(v[c]) continue; v[c]=1; if(link[c]==-1||dfs(link[c])) { link[c]=x; return 1; } } return 0;}int main(){ int n; while(scanf("%d",&n)!=EOF) { int i,a,b,m,ans=0; for(i=0;i<n;i++) q[i].clear(); for(i=0;i<n;i++) { scanf("%d:(%d)",&a,&m); while(m--) { scanf("%d",&b); q[a].push_back(b); q[b].push_back(a); } } memset(link,-1,sizeof(link)); for(i=0;i<n;i++) { memset(v,0,sizeof(v)); if(dfs(i)) ans++; } printf("%d\n",ans/2); }}
0 0
- HDOJ 题目1054 Strategic Game(二分图最大匹配)
- hdoj.1054 Strategic Game【二分图匹配】 2015/8/14
- hdu 1054 Strategic Game (二分匹配)
- Strategic Game(二分匹配)
- hdu 1054 Strategic Game 最小顶点覆盖(二分图最大匹配)
- hdu 1054 Strategic Game 最少点覆盖 二分图最大匹配
- hdu 1054 Strategic Game 最小顶点覆盖(二分图最大匹配)
- hdu 1054 Strategic Game(模板) 最大二分匹配,最小点覆盖 匈牙利算法
- HDOJ 1528 Card Game Cheater(二分图最大匹配)
- HDOJ题目2063过山车(二分图最大匹配)
- HDU 1054 Strategic Game 树形DP/二分图匹配
- UVALive2038-Strategic game(树形dp or 二分图匹配)
- hdu1054 Strategic Game---二分图匹配
- 【二分图匹配(最小顶点覆盖)】hdu 1150 Machine Schedule(外:hdu 1054 Strategic Game)
- HDU1054 Strategic Game 二分匹配
- 二分匹配HDU1054 Strategic Game
- HDU1054 Strategic Game(二分匹配)
- hdu1054 Strategic Game —— 二分图最大匹配 or 树形dp
- 一个网络从业者眼中的网站用户体验
- shell命令中通配符学习
- Checkstyle配置文件eclipse_checkstyle.xml文件
- javascript 变量提升,及变量作用域
- 2014-12-11 hdoj2033
- HDOJ 题目1054 Strategic Game(二分图最大匹配)
- ceilometer的map_reduce机制
- android 点击关闭软键盘
- [转载]UITextField 与 键盘
- iOS中NSUserDefaults的用法(轻量级本地数据存储)
- python:格式化操作
- nutch1.9和solr4.5集成 输出信息
- Auto Layout 用法
- Android activity 着重点