hdu1151Air Raid (二分匹配,最小路径覆盖)
2014-07-28 15:54
423 查看
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
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题意:给出有n 个十字路口,给出m个边,每条边都是单向的,要求用最少的人去从一个十字路口一直走向另一个十字路,有路就可以再走向下一个,要把所有的十字路口都要走过。解题:跟据题意,就是求最小路径覆盖。最小路径覆盖=点数n-最大匹配数。#include<stdio.h> #include<string.h> int n,map[125][125],vist[125],match[125]; int find(int i) { for(int j=1;j<=n;j++) if(vist[j]==0&&map[i][j]) { vist[j]=1; if(match[j]==0||find(match[j])) { match[j]=i; return 1; } } return 0; } int main() { int m,t,a,b,ans; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); memset(map,0,sizeof(map)); while(m--) { scanf("%d%d",&a,&b); map[a][b]=1; } ans=0; memset(match,0,sizeof(match)); for(int i=1;i<=n;i++) { memset(vist,0,sizeof(vist)); ans+=find(i); } printf("%d\n",n-ans); } }
相关文章推荐
- hdu 1151 Air Raid (二分匹配,最小路径覆盖)
- poj1422 Air Raid 二分匹配之最小路径覆盖
- 最小路径覆盖(二分图最大匹配):Air Raid
- HDU1151_Air Raid(二分图/最小路径覆盖=n-最大匹配)
- 【二分匹配】 [网络流24题] 最小路径覆盖问题
- HDU-1151(求最小覆盖路径数_二分匹配)
- poj3216 Repairing Company 二分匹配之最小路径覆盖+最短路
- poj2594 Treasure Exploration 二分匹配之最小路径覆盖+传递闭包
- ZOJ 2521 —— LED Display(二分匹配,最小路径覆盖)
- POJ 2594 最大二分匹配 最小路径覆盖
- UVa live3126Taxi Cab Scheme(二分最大匹配之最小路径覆盖)
- POJ-3020-Antenna Placement [二分匹配][最小路径覆盖]
- Poj 1548 Robots【最小路径覆盖---二分匹配】
- HDOJ---1151 Air Raid[匈牙利算法:最小路径覆盖数=原图顶点数–二分图最大匹配数]
- poj3020 Antenna Placement 二分匹配 最小路径覆盖
- poj 2594 Treasure Exploration(最小路径覆盖/二分最大匹配)
- poj3020 Antenna Placement 二分匹配之最小路径覆盖
- POJ 1422Air Raid(二分图最大匹配之最小路径覆盖)
- POJ1325二分匹配或者DINIC(最小路径覆盖)
- POJ 2594 最小路径覆盖 二分匹配