hdu 1151 Air Raid
2016-02-27 11:07
537 查看
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.
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
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 long using namespace std; /************************************************ Desiner:hl time:2016/02/27 Exe.Time:0MS Exe.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; }
相关文章推荐
- 初学图论-Kahn拓扑排序算法(Kahn's Topological Sort Algorithm)
- 初学图论-Bellman-Ford单源最短路径算法
- 初学图论-DAG单源最短路径算法
- 初学图论-Dijkstra单源最短路径算法
- 初学图论-Dijkstra单源最短路径算法基于优先级队列(Priority Queue)的实现
- 封装好的Folyd建图,C++源码
- LCA模板
- 图论学习笔记之一——Floyd算法
- 【LCA】SPOJ QTREE2
- poj 3249 Test for Job 最长路
- HDU 2544
- Timus 1557 Network Attack DFS+各种各种...
- HDU1289 Tarjan-模板题
- Poj2638 网络流+最短路+二分答案
- Aizu1311 分层图最短路 (...大概)
- HDU 3631 Shortest Path
- 二分图匹配模板
- 最短路径 -- spfa
- POJ2377 Bad Cowtractors
- Six Degrees of Cowvin Bacon(最短路径floyd算法)