Air Raid
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 8489 | Accepted: 5081 |
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
2
4
3
3 4
1 3
2 3
3
3
1 3
1 2
2 3
Sample Output
2 1题目大意:有n个点和m条有向边,现在要在点上放一些伞兵,然后伞兵沿着图走,直到不能走为止 每条边只能是一个伞兵走过,问最少放多少个伞兵
解题思路:这是一个很明显的最小路径覆盖,用二分图来做 对于这样的一个有向图做最小路径覆盖,首先建图 先拆点,将每个点分为两个点,左边是1到n个点,右边是1-n个点 然后每一条有向边对应左边的点指向右边的点 这样建好图之后求最大匹配数 因为最小路径覆盖=点数-最大匹配数
///AC代码#include <algorithm> #include <cmath> #include <cstdio> #include <cstring> #include <ctime> #include <iostream> #include <map> #include <queue> #include <set> #include <stack> #include <string> #include <vector> #define eps 1e-8 #define INF 0x7fffffff #define maxn 100005 #define PI acos(-1.0) using namespace std; typedef long long LL; const int N = 302; /*变种1:二分图的最小顶点覆盖: 假如选了一个点就相当于覆盖了以它为端点的所有边, 你需要选择最少的点来覆盖所有的边 二分图的最小顶点覆盖数 = 二分图的最大匹配数 变种2:DAG图(无回路有向图)的最小路径覆盖 路径覆盖就是在图中找一些路经,使之覆盖了图中的所有顶点, 且任何一个顶点有且只有一条路径与之关联, 如果把这些路径中的每条路径从它的起始点走到它的终点, 那么恰好可以经过图中的每个顶点一次且仅一次 DAG图的最小路径覆盖数 = 节点数(n)- 最大匹配数(m) 变种3: 二分图的最大独立集:在图中选取最多的点,使任意所选两点均不相连 二分图的最大独立集数 = 节点数(n)- 最大匹配数(m) */ /*=*************************************************** 二分图匹配(匈牙利算法的DFS实现) INIT:g[][]两边定点划分的情况 CALL:res=hungary();输出最大匹配数 优点:适于稠密图,DFS找增广路快,实现简洁易于理解 时间复杂度:O(VE); ***************************************************=*/ const int MAXN = 1000; int uN, vN; //u,v数目 int g[MAXN][MAXN];//编号是0~n-1的 int linker[MAXN]; bool used[MAXN]; bool dfs(int u) { int v; for (v = 1; v <= vN; v++) if (g[u][v] && !used[v]) { used[v] = true; if (linker[v] == -1 || dfs(linker[v])) { linker[v] = u; return true; } } return false; } int hungary() { int res = 0; int u; memset(linker, -1, sizeof(linker)); for (u = 1; u <= uN; u++) { memset(used, 0, sizeof(used)); if (dfs(u)) { res++; } } return res; } int main() { int t; scanf("%d", &t); while (t--) { memset(g, 0, sizeof(g)); int point, street; scanf("%d%d", &point, &street); uN = point; vN = point; int x, y; while (street--) { scanf("%d%d", &x, &y); g[x][y] = 1; } int ans = hungary(); cout << point - ans << endl; } return 0; }