Treasure Exploration POJ

Have you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you ever explored treasure? If you never have such experiences, you would never know what fun treasure exploring brings to you.
Recently, a company named EUC (Exploring the Unknown Company) plan to explore an unknown place on Mars, which is considered full of treasure. For fast development of technology and bad environment for human beings, EUC sends some robots to explore the treasure.
To make it easy, we use a graph, which is formed by N points (these N points are numbered from 1 to N), to represent the places to be explored. And some points are connected by one-way road, which means that, through the road, a robot can only move from one end to the other end, but cannot move back. For some unknown reasons, there is no circle in this graph. The robots can be sent to any point from Earth by rockets. After landing, the robot can visit some points through the roads, and it can choose some points, which are on its roads, to explore. You should notice that the roads of two different robots may contain some same point.
For financial reason, EUC wants to use minimal number of robots to explore all the points on Mars.
As an ICPCer, who has excellent programming skill, can your help EUC?

Input

The input will consist of several test cases. For each test case, two integers N (1 <= N <= 500) and M (0 <= M <= 5000) are given in the first line, indicating the number of points and the number of one-way roads in the graph respectively. Each of the following M lines contains two different integers A and B, indicating there is a one-way from A to B (0 < A, B <= N). The input is terminated by a single line with two zeros.

Output

For each test of the input, print a line containing the least robots needed.

Sample Input

1 0
2 1
1 2
2 0
0 0

Sample Output

1
1
2
题意：在外星上有n个点需要机器人去探险，有m条单向路径。问至少需要几个机器人才能遍历完所有的点，一个点可以被多个机器人经过（这就是和单纯的最小路径覆盖的区别）。
思路：这是个最小路径覆盖问题，但是因为有的点可以重复访问，所以最小路径是可以相交的，我们就用传递闭包建立新图（G’），转化为一般的路径覆盖，然后就是跟 poj1422 一样了。
　　　最小路径覆盖 = 图的顶点数 – 最大匹配数，所以只要用匈牙利算法求出最大匹配数，然后用顶点数一减就出来了。

AC代码：

#include<vector>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
#define maxn 666
int match[maxn];
int vis[maxn];
int e[maxn][maxn];
int n,m;
int dfs(int u){
    for(int i=1;i<=n;i++){
        if(!vis[i]&&e[u][i]){
            vis[i]=1;
            if(match[i]==0||dfs(match[i])){
                match[i]=u;
                return 1;
            }
        }
    }
    return 0;
}
void floyd(){
    for(int k=1;k<=n;k++)    
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(e[i][k]&&e[k][j])
                    e[i][j]=1;
}
int main(){
        while(~scanf("%d%d",&n,&m)&&(n+m)){
            int x,y;
            memset(match,0,sizeof(match));
        
            for(int i=1;i<=m;i++){
                scanf("%d%d",&x,&y);
                e[x][y]=1;
            }
            floyd();
            int ans=0;
            for(int i=1;i<=n;i++){
                memset(vis,0,sizeof(vis));
                if(dfs(i))
                    ans++;
            }
            int res=n-ans;
            printf("%d
",res);
            for(int i=0;i<=maxn;i++)
                for(int j=0;j<=maxn;j++)
                    e[i][j]=0;
        }
    return 0;
}