POJ Air Raid 【DAG的最小不相交路径覆盖】

传送门：http://poj.org/problem?id=1422

Air Raid

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 9303		Accepted: 5570

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

Dhaka 2002

题意概括：

N个路口 M 条单向路，安排若干个士兵，这些士兵只会沿着当前所在结点路径走，问最少安排多少个士兵就可以把所有路口巡逻完毕。

解题思路：

拆点：

把原图的每个点V拆成VxVx和VyVy两个点，如果有一条有向边A->B，那么就加边Ax−>By。这样就得到了一个二分图。

最小路径覆盖=原图的结点数-新图的最大匹配数。

一开始每个点都是独立的为一条路径，总共有n条不相交路径。我们每次在二分图里找一条匹配边就相当于把两条路径合成了一条路径，也就相当于路径数减少了1。所以找到了几条匹配边，路径数就减少了多少。所以有最小路径覆盖=原图的结点数-新图的最大匹配数。

AC code（静态邻接表）：

 #include <cstdio>
 #include <iostream>
 #include <algorithm>
 #include <cstring>
 #define INF 0x3f3f3f3f
 using namespace std;
 const int MAXN = ;
 struct Edge
 {
     int v, nxt;
 }edge[MAXN];

 int head[MAXN*MAXN], cnt;
 int linker[MAXN];
 bool used[MAXN];
 int N, M;

 void init()
 {
     memset(head, -, sizeof(head));
     memset(linker, -, sizeof(linker));
     cnt = ;
 }

 void add(int from, int to)
 {
     edge[cnt].v = to;
     edge[cnt].nxt = head[from];
     head[from] = cnt++;
 }

 bool Find(int x)
 {
     int v;
     for(int i = head[x]; i != -; i = edge[i].nxt){
         v = edge[i].v;
         if(used[v]) continue;
         used[v] = true;
         if(linker[v] == - || Find(linker[v])){
             linker[v] = x;
             return true;
         }
     }
     return false;
 }

 int main()
 {
     int T_case, u, v, ans;
     scanf("%d", &T_case);
     while(T_case--){
         init();
         scanf("%d %d", &N, &M);
         while(M--){
             scanf("%d%d", &u, &v);
             add(u, v);
         }
         ans = ;
         for(int i = ; i <= N; i++){
             memset(used, , sizeof(used));
             if(Find(i)) ans++;
         }
         printf("%d\n", N-ans);
     }
     return ;
 }