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.
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.
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.
2 4 3 3 4 1 3 2 3 3 3 1 3 1 2 2 3
2 1
题意:
有n座城市,在城市间有m条无环路,要在城市里投放一些空降兵巡查,
要求所有城市都能巡查到,问最少需要投放多少空降兵?
解题思路:这个题目就转换成求解有向无环图的最小路径覆盖问题了。
一个结论:有向无环图的最小路径覆盖=该图的顶点数-该图的最大匹配。
代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int N = 150;
int n,m;
int e[N][N];
int used[N],match[N];
int Find(int x){
for(int i=1;i<=n;i++){
if(e[x][i]&&!used[i]){
used[i]=1;
if(!match[i]||Find(match[i])){
match[i]=x;
return 1;
}
}
}
return 0;
}
int hungary(){
memset(match,0,sizeof(match));
int ans=0;
for(int i=1;i<=n;i++){
memset(used,0,sizeof(used));
ans+=Find(i);
}
return n-ans;
}
int main(){
int T;
scanf("%d",&T);
while(T--){
memset(e,0,sizeof(e));
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
int a,b;
scanf("%d%d",&a,&b);
e[a][b]=1;
}
printf("%d\n",hungary());
}
return 0;
}