# POJ 1422 Air Raid 最小覆盖点

Air Raid
 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7521 Accepted: 4478

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

ACcode：
#pragma warning(disable:4786)//使命名长度不受限制
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#define rd(x) scanf("%d",&x)
#define rd2(x,y) scanf("%d%d",&x,&y)
#define rds(x) scanf("%s",x)
#define rdc(x) scanf("%c",&x)
#define ll long long int
#define maxn 205
#define mod 1000000007
#define INF 0x3f3f3f3f //int 最大值
#define FOR(i,f_start,f_end) for(int i=f_start;i<=f_end;++i)
#define MT(x,i) memset(x,i,sizeof(x))
#define PI  acos(-1.0)
#define E  exp(1)
using namespace std;
bool bmap[maxn][maxn];
int pre[maxn];
int loop,n,m,x,y;
void init(){
MT(bmap,0);
MT(pre,-1);
}
int findpath(int u){
FOR(i,1,n)
if(pre[i]==-1||findpath(pre[i])){
pre[i]=u;
return 1 ;
}
}
return 0;
}
int Maxmatch(){
int res(0);
FOR(i,1,n){
res+=findpath(i);
}
return res;
}
int main(){
rd (loop);
while(loop--){
rd(n);rd(m);init();
FOR(i,1,m){
rd2(x,y);
bmap[x][y]=1;
}
printf("%d\n",n-Maxmatch());
}
return 0;
}
/*
2
4
3
3 4
1 3
2 3
3
3
1 3
1 2
2 3
*/


[Submit]   [Go Back]   [Status]   [Discuss]

08-06 1492

05-12 209

08-02 334

04-28 384

02-05 569

09-02 109

06-09 754

10-07 681

11-18 2810

04-16 276