hdu 1151 Air Raid
来源:互联网 发布:lte系统网络架构 编辑:程序博客网 时间:2024/06/15 22:14
Air Raid
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4382 Accepted Submission(s): 2924
Problem 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.
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.
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
2433 41 32 3331 31 22 3
Sample Output
21
Source
Asia 2002, Dhaka (Bengal)
#include <iostream>#include <cstdio>#include <climits>#include <cstring>#include <cstdlib>#include <cmath>#include <vector>#include <queue>#include <algorithm>#define esp 1e-6#define inf 0x0f0f0f0f#define LL long longusing namespace std;/************************************************Desiner:hltime:2016/02/27Exe.Time:0MSExe.Memory:1628K题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1151题意:有很多伞兵降落在城镇上,城镇和城镇之间有一些路联通,伞兵降落后还能通过这些路去其他的城镇,问要去到所有城镇至少需要多少个伞兵题解:最小路径覆盖************************************************/int map[121][121];int link[121];int vis[121];int n, m;int find(int k) { for (int i = 1; i <= n; i++) if (!vis[i] && map[k][i]) { vis[i] = 1; if (link[i] == -1 || find(link[i])) { link[i] = k; return 1; } } return 0;}int hug() {//最大匹配数 int ans = 0; memset(vis, 0, sizeof(vis)); memset(link, -1, sizeof(link)); for (int i = 1; i <= n; i++) { if (find(i)) ans++; } return ans;}int main() { int t, i, k; scanf("%d", &t); while (t--) { memset(map, 0, sizeof(map)); scanf("%d%d", &n, &m); for (i = 0; i < m; i++) { int t1, t2; scanf("%d%d", &t1, &t2); map[t1][t2] = 1; } int ans = n - hug(); printf("%d\n", ans); } return 0;}
0 0
- hdu 1151 Air Raid
- hdu 1151 Air Raid
- HDU 1151 Air Raid
- HDU 1151Air Raid
- Hdu 1151 - Air Raid
- hdu 1151 Air Raid
- hdu 1151 Air Raid
- hdu 1151 Air Raid
- hdu 1151 Air Raid
- HDU 1151 Air Raid
- HDU 1151 Air Raid
- hdu 1151 Air Raid
- hdu 1151 Air Raid
- hdu/hdoj 1151 Air Raid
- hdu 1151 Air Raid 匹配
- hdu acm 1151 Air Raid
- POJ 1422/ HDU 1151 Air Raid
- hdu 1151 Air Raid (二分匹配)
- 数据结构之线性表(定长线性表和不定长线性表)
- 在github上维护开源项目的流程
- C 标准库(二)
- 如何解决内存溢出
- java中变量值为NULL的意义
- hdu 1151 Air Raid
- 学习新知识
- 线程并发
- vijos 1197 费解的开关 反向bfs+位运算
- 浅析string 与char* char[]之间的转换
- 用Peterson算法实现临界区的控制
- win7生成生成Detours.lib以及简单使用实例
- TypedArray使用方法
- 使用TabLayout代替ViewPagerIndicator