Air Raid(最小路径覆盖数=节点数-最大匹配数)
2014-11-12 21:04
615 查看
Link:http://acm.hdu.edu.cn/showproblem.php?pid=1151
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3438 Accepted Submission(s): 2270
Problem Description
Consider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town's streets you can never reach the same intersection i.e. the town's streets
form no cycles.
With these assumptions your task is to write a program that finds the minimum number of paratroopers that can descend on the town and visit all the intersections of this town in such a way that more than one paratrooper visits no intersection. Each paratrooper
lands at an intersection and can visit other intersections following the town streets. There are no restrictions about the starting intersection for each paratrooper.
Input
Your program should read sets of data. The first line of the input file contains the number of the data sets. Each data set specifies the structure of a town and has the format:
no_of_intersections
no_of_streets
S1 E1
S2 E2
......
Sno_of_streets Eno_of_streets
The first line of each data set contains a positive integer no_of_intersections (greater than 0 and less or equal to 120), which is the number of intersections in the town. The second line contains a positive integer no_of_streets, which is the number of streets
in the town. The next no_of_streets lines, one for each street in the town, are randomly ordered and represent the town's streets. The line corresponding to street k (k <= no_of_streets) consists of two positive integers, separated by one blank: Sk (1 <= Sk
<= no_of_intersections) - the number of the intersection that is the start of the street, and Ek (1 <= Ek <= no_of_intersections) - the number of the intersection that is the end of the street. Intersections are represented by integers from 1 to no_of_intersections.
There are no blank lines between consecutive sets of data. Input data are correct.
Output
The result of the program is on standard output. For each input data set the program prints on a single line, starting from the beginning of the line, one integer: the minimum number of paratroopers required to visit all the intersections in the town.
Sample Input
Sample Output
Source
Asia 2002, Dhaka (Bengal)
注意一点:路径是单向的,即构成DAG图,求二分匹配。因此,用尽量少的不相交简单路径覆盖有向无环图(DAG)G的所有顶点,也就是DAG图的最小路径覆盖问题。
Air Raid
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3438 Accepted Submission(s): 2270
Problem Description
Consider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town's streets you can never reach the same intersection i.e. the town's streets
form no cycles.
With these assumptions your task is to write a program that finds the minimum number of paratroopers that can descend on the town and visit all the intersections of this town in such a way that more than one paratrooper visits no intersection. Each paratrooper
lands at an intersection and can visit other intersections following the town streets. There are no restrictions about the starting intersection for each paratrooper.
Input
Your program should read sets of data. The first line of the input file contains the number of the data sets. Each data set specifies the structure of a town and has the format:
no_of_intersections
no_of_streets
S1 E1
S2 E2
......
Sno_of_streets Eno_of_streets
The first line of each data set contains a positive integer no_of_intersections (greater than 0 and less or equal to 120), which is the number of intersections in the town. The second line contains a positive integer no_of_streets, which is the number of streets
in the town. The next no_of_streets lines, one for each street in the town, are randomly ordered and represent the town's streets. The line corresponding to street k (k <= no_of_streets) consists of two positive integers, separated by one blank: Sk (1 <= Sk
<= no_of_intersections) - the number of the intersection that is the start of the street, and Ek (1 <= Ek <= no_of_intersections) - the number of the intersection that is the end of the street. Intersections are represented by integers from 1 to no_of_intersections.
There are no blank lines between consecutive sets of data. Input data are correct.
Output
The result of the program is on standard output. For each input data set the program prints on a single line, starting from the beginning of the line, one integer: the minimum number of paratroopers required to visit all the intersections in the town.
Sample Input
2 4 3 3 4 1 3 2 3 3 3 1 3 1 2 2 3
Sample Output
2 1
Source
Asia 2002, Dhaka (Bengal)
注意一点:路径是单向的,即构成DAG图,求二分匹配。因此,用尽量少的不相交简单路径覆盖有向无环图(DAG)G的所有顶点,也就是DAG图的最小路径覆盖问题。
#include<iostream> #include<algorithm> #include<cstring> #include<cstdio> #include<vector> using namespace std; const int maxn=111; vector<int>map[maxn]; int match[maxn],n,m,k,ans; bool vis[maxn]; bool dfs(int u) { for(int i=0;i<map[u].size();i++) { if(!vis[map[u][i]]) { vis[map[u][i]]=true; if(match[map[u][i]]==-1||dfs(match[map[u][i]])) { match[map[u][i]]=u; return true; } } } return false; } void hangry() { memset(match,-1,sizeof(match)); ans=0; for(int i=1;i<=m;i++) { memset(vis,false,sizeof(vis)); if(dfs(i)) { ans++; } } } int main() { int u,v; while(scanf("%d",&n)==1) { while(n--) { scanf("%d%d",&m,&k); for(int i=0;i<maxn;i++) map[i].clear(); while(k--) { scanf("%d%d",&u,&v); map[u].push_back(v); } hangry(); printf("%d\n",m-ans); } } return 0; }
相关文章推荐
- 洛谷 P2764(最小路径覆盖=节点数-最大匹配)
- 最小路径覆盖-二分图最大匹配 poj 1422
- HDU 1151Air Raid 最小路径覆盖=n-最大匹配量 (第二道二分匹配)
- HDU 4160 Dolls (最小路径覆盖=顶点数-最大匹配数)
- HDU 4160 Dolls (最小路径覆盖=顶点数-最大匹配数)
- poj2060 Taxi Cab Scheme 最小路径覆盖=顶点数-最大匹配数
- 二分图——最大匹配数(最小覆盖数)、最大独立数、最小路径覆盖、带权最优匹配
- joj 2672 Hanoi Tower Once More 有向无环图的最小路径覆盖=N-最大匹配
- poj2594 Treasure Exploration 最小路径覆盖=顶点数-最大匹配数
- uva 1201 最小路径覆盖 最大匹配
- POJ 3020 最小路径覆盖 = 顶点数-最大匹配数 二分匹配
- 浅显易懂二分图-最大匹配,最小路径覆盖,最小点覆盖
- [最小路径覆盖、二分图最大匹配]Pku3020--Antenna Placement
- 二分图大讲堂——彻底搞定最大匹配数(最小覆盖数)、最大独立数、最小路径覆盖、带权最优匹配
- poj1422 Air Raid 最小路径覆盖=顶点数-最大匹配数
- 最小路径覆盖(二分图最大匹配):Air Raid
- 二分图的最大匹配(最小路径覆盖,最小点覆盖)
- DAG的最小路径覆盖和二分图的最大匹配
- poj 2594 Treasure Exploration 有向无环图最小路径覆盖变形(每个点能走多次)+FLOYD = N-最大匹配
- HDU 4160 最小路径覆盖 = 顶点数 - 最大匹配数 二分匹配