ZOJ 1525(最小路径覆盖)
来源:互联网 发布:2016全国车祸死亡数据 编辑:程序博客网 时间:2024/06/06 10:43
Air Raid
Time Limit: 1 Second Memory Limit: 32768 KB
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
算法思想:最小路径覆盖 = |V| - 最大匹配数
- ZOJ 1525(最小路径覆盖)
- POJ 1422 && ZOJ 1525 Air Raid(最小路径覆盖)
- ZOJ 1525 Air Raid(最小路径覆盖)
- ZOJ 1525 Air Raid (有向图最小路径覆盖 + 理解)
- 最小路径覆盖问题(最小路径覆盖)
- 最小路径覆盖(转载)
- 最小路径覆盖(转)
- hdoj4160_Dolls(最小路径覆盖)
- poj1548(最小路径覆盖)
- hdu1151(最小路径覆盖)
- zoj 1525 Air Raid 有向无环图的最小路径覆盖(匹配)
- POJ 1422 && ZOJ 1525 --Air Raid【二分图 && 最小路径覆盖】
- ZOJ 2521 —— LED Display(二分匹配,最小路径覆盖)
- 【最小路径覆盖】最小路径覆盖
- 最小路径覆盖(最小边覆盖&&最小点覆盖)hdu1150
- zju 1525 Air Raid(最小路径覆盖)
- HDU 1350(最小路径覆盖)
- PKU 3216(最小路径覆盖 + floyd)
- EABI和OABI的区别
- Android多媒体框架图
- how to read compressed zip file with managed C++
- java 读取网络图片
- c# 图片转换
- ZOJ 1525(最小路径覆盖)
- 通过VBS访问WMI,获取当前所有进程信息
- 与一线Linux嵌入式开发工程师的对话
- 真的该努力了
- [CKEditor那点事儿]使用java开发ckeditor的浏览服务器文件功能
- 今天开博
- 关于restful webservice
- Hibernate 多对一外键单向关联
- 一致性Hash算法(KetamaHash)的c#实现