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
Sample Output
2
1
题意:
题意就是说有当城镇,城镇之间有路相连,图是无环图,求伞兵在最小的情况下能把所有地方都访问完。
解题思路:
最小路径覆盖问题,求出最大匹配数,用总数减去最大匹配数,就是伞兵最少人数。
代码:
#include<stdio.h>
#include<string.h>
int a[130][130];
int g[245],b[245];
int m,n;
int fun(int x)
{
for(int i=1;i<=m;i++)
{
if(a[x][i]!=0&&b[i]==0)
{
b[i]=1;
if(g[i]==0||fun(g[i])!=0)
{
g[i]=x;
return 1;
}
}
}
return 0;
}
int main()
{
int i,j,k,t;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&m,&n);
memset(a,0,sizeof(a));
memset(g,0,sizeof(g));
for(i=1;i<=n;i++)
{
scanf("%d%d",&j,&k);
a[j][k]=1;
}
j=0;
for(i=1;i<=m;i++)
{
memset(b,0,sizeof(b));
if(fun(i))
j++;
}
printf("%d\n",m-j);
}
return 0;
}