POJ3041——Asteroids（匈牙利算法）

Asteroids Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 20303   Accepted: 11012 Description Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conveniently located at the lattice points of the grid.  Fortunately, Bessie has a powerful weapon that can vaporize all the asteroids in any given row or column of the grid with a single shot.This weapon is quite expensive, so she wishes to use it sparingly.Given the location of all the asteroids in the field, find the minimum number of shots Bessie needs to fire to eliminate all of the asteroids. Input * Line 1: Two integers N and K, separated by a single space.  * Lines 2..K+1: Each line contains two space-separated integers R and C (1 <= R, C <= N) denoting the row and column coordinates of an asteroid, respectively. Output * Line 1: The integer representing the minimum number of times Bessie must shoot. Sample Input 3 4 1 1 1 3 2 2 3 2 Sample Output 2 Hint INPUT DETAILS:  The following diagram represents the data, where "X" is an asteroid and "." is empty space:  X.X  .X.  .X.  OUTPUT DETAILS:  Bessie may fire across row 1 to destroy the asteroids at (1,1) and (1,3), and then she may fire down column 2 to destroy the asteroids at (2,2) and (3,2). Source USACO 2005 November Gold

题目大意：

矩阵上有一些小行星，占据了一些格子，我们每次操作可以清理一列中的所有小行星，也可以清理一行中的所有小行星，问最少进行多少次操作可以清理掉所有的小行星。

把每一列当成一个点，每一行当成一个点，若行节点和列节点之间有边，则表明该行列该列有一个障碍物。

主要是构图：将每一行当成一个点，构成集合1， 每一列也当成一个点，构成集合2；每一个障碍物的位置坐标将集合1与集合2中的点连接起来，也就是将每一个障碍物作为连接节点的边。这样可以轻易的得出本题是一个最小点覆盖的问题，假设1个行节点覆盖了5个列节点，即这个行节点与这5个列节点间有5条边（即五个障碍物），由于这5条边都被那个行节点覆盖，即表明这5个障碍物都在同一列上，于是可以一颗炸弹全部清除，而本题也就转化成求最小点覆盖数的问题。

又有一个定理是：最小点覆盖数 = 最大匹配数， 所以此题转化成求最大匹配数。

代码如下：

（匈牙利算法）

#include <iostream>
#include <cstring>

using namespace std;

const int N = 510;
int mp[N][N], vis[N], match[N];
int n, m;

int dfs(int x)
{
    for( int i = 1;i <= n;i++ )
    {
        if( vis[i]==0&&mp[x][i]==1 )                 
        {
            vis[i] = 1;
            if( match[i]==0 ||dfs(match[i]))      //不属于上一个匹配，以及该点能有增广路
            {
                match[i] = x;
                return 1;
            }
        }
    }
    return 0;
}

int main()
{
    cin>>n>>m;
    memset(mp,0,sizeof(mp));

    for( int i = 1;i <= m;i++ )
    {
        int x, y;
        cin>>x>>y;
        mp[x][y] = 1;
    }

    memset(match,0,sizeof(match));

    int sum = 0;
    for( int i = 1;i <= n;i++ )
    {
        memset(vis,0,sizeof(vis));
        if( dfs(i) )
            sum++;
    }
    cout<<sum<<endl;

    return 0;
}