POJ2594 Treasure Exploration(二分图最小路径覆盖，传递闭包)

Description

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

思路

一个有向图中， 有若干条连接的路线， 问最少放多少个机器人，可以将整个图上的点都走过。 最小路径覆盖问题。
这时最小路径覆盖问题， 最小路径覆盖 = |V| - 最大匹配数。
这道题还有一个坑！！ 如果有向图的边有相交的情况，那么就不能简单的对原图求二分匹配了
请参考这里：最小路径覆盖问题值得注意的地方

代码

#include<cstdio>
#include<cstring>
#include<string>
#include<set>
#include<iostream>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#define mem(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
#define mod 10000007
#define debug() puts("what the fuck!!!")
#define ll long long
using namespace std;
const int N=1000+20;
int vis[N],match[N],e[N][N],n,m;
int dfs(int u)
{
    for(int i=1; i<=n; i++)
    {
        if(e[u][i]&&!vis[i])
        {
            vis[i]=1;
            if(!match[i]||dfs(match[i]))
            {
                match[i]=u;
                return 1;
            }
        }
    }
    return 0;
}
int query()
{
    mem(match,0);
    int sum=0;
    for(int i=1; i<=n; i++)
    {
        mem(vis,0);
        if(dfs(i))sum++;
    }
    return sum;
}
void folyd()
{
    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            if(e[i][k])
                for(int j=1; j<=n; j++)
                    if(e[k][j])
                        e[i][j]=1;
}
int main()
{
    int a,b;
    while(~scanf("%d%d",&n,&m)&&(n||m))
    {
        mem(e,0);
        if(m==0)
        {
            printf("%d\n",n);
            continue;
        }
        while(m--)
        {
            scanf("%d%d",&a,&b);
            e[a][b]=1;
        }
        folyd();
        printf("%d\n",n-query());
    }
    return 0;
}