2 shunfurh shunfurh 于 2017.09.01 20:01 提问

Air Raid

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

1个回答

caozhy
caozhy   Ds   Rxr 2017.09.16 23:52
已采纳
Csdn user default icon
上传中...
上传图片
插入图片
准确详细的回答,更有利于被提问者采纳,从而获得C币。复制、灌水、广告等回答会被删除,是时候展现真正的技术了!
其他相关推荐
hdu 1151 Air Raid最小路径覆盖
题目的意思就是: 一个=城镇中有n个路口和m条单项的路径,图是无环图,现在要派一些伞兵去这些成寿寺,要到达所有的路口; 有一些或者没有伞兵可以不去那些路口,只要其他人能完成这么任务; 每个在一个路口着陆了的伞兵可以沿着街去到其他路口; 我们的任务就是求出去执行任务的伞兵最少可以使几个;   这个问题是二分图的最小路径覆盖问题; 而路径覆盖的定义就是: 在有向图中找一些路径,使之覆盖
Air Raid
Air Raid Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 6636   Accepted: 3953 Description Consider a town where all the streets are one-way and each stree
hdu1151——Air Raid
Air Raid Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3433    Accepted Submission(s): 2265 Problem Description Consider a town where
8.15 E - Air Raid
E - Air Raid  Consider a town where all the streets areone-way and each street leads from one intersection to another. It is alsoknown that starting from an intersection and walking through town's
hdu1151 Air Raid
http://acm.hdu.edu.cn/showproblem.php?pid=1151 增广路的变种2:DAG图的最小路径覆盖=定点数-最大匹配数 1 #include 2 #include 3 #includestring.h> 4 #include 5 #include 6 using namespace std; 7 const int N=510;
POJ 1422 Air Raid
#include #include #include using namespace std; #define MAX 200 int g[MAX][MAX],vis[MAX],link[MAX]; int k,n,m,xx; int dfs(int x){ for(int i = 1;i <= xx;i++){ if(g[x][i] == 1 && vis[i] =
hdu1151 Air Raid --- 最小路径覆盖
给一个DAG图,一个人可以走一条路,或者就在一个点(路径长度为0),问至少需要多少人可以覆盖所有点。 根据二分图的性质: DAG的最小路径覆盖,将每个点拆点后求最大匹配数m,结果为n-m,求具体路径的时候顺着匹配边走就可以,匹配边i→j',j→k',k→l'....构成一条有向路径。 #include #include #include #include #include #
POJ1422 Air Raid
POJ1422 最小路径覆盖
poj 1422 Air Raid
最小路径覆盖裸题。最小路径覆盖就是一个最小的路径的集合,这些路径经过了图中所有的点各一次。做法是把点复制一份,成为X部和Y部,边永远从X连向Y。然后跑一遍匈牙利算法,结果就是原顶点数-最大匹配。 #include #include #include using namespace std; const int maxn=125; int tote; int head[m
Hdu1151 Air Raid
求最小路径覆盖Orz code: #include #include #include using namespace std; int n,m,link[125]; bool map[125][125],vis[125]; bool find(int x) { int y; for(y=1;y<=n;y++) { if(map[x][y] && !