poj 3041

      一道针对二分图最大匹配算法的基本应用。

      简单来说，这道题就是运用一个定理：在二分图G=(X,Y;E)中，若K为一个最小顶点覆盖，M为最大匹配，则有|K|=|M|（参考：《ACM-ICPC程序设计系列 图论及应用》 哈尔滨工业大学出版社 P230）。这说明了最小顶点覆盖问题与二分图最大匹配问题的等价性。接下来用最大匹配算法就可以解决此问题。

      顺便补充一下，图的最小顶点覆盖问题是一个NP问题，只有在特殊的图上才有高效的解法，比如这里的二分图。此外树的最小顶点覆盖问题也有高效解法（参考：poj 1463 ）。

代码（C++）：

#include <cstdlib>
#include <iostream>
#include <vector>

#define MAX 509
using namespace std;

//#define LOCAL

vector<int> G[MAX];
int ans,cx[MAX],cy[MAX];
bool t[MAX];

void add_edge(int a,int b)
{
     G[a].push_back(b);
}

bool dfs(int u)
{
    int i,v; 
    for(i=0;i<G[u].size();i++) 
    {
        v=G[u][i];      
        if(!t[v])
        {
            t[v]=true;
            if(cy[v]==0||dfs(cy[v]))
            {
                cx[u]=v;
                cy[v]=u;
                return true;                      
            }     
        }                 
    }
    return false;
}

void Hungary(int n)
{
    int i;
    memset(cx,0,sizeof(cx));
    memset(cy,0,sizeof(cy));
    for(i=1;i<=n;i++)
    {
        memset(t,false,sizeof(t));             
        if(dfs(i)) ans++;             
    } 
}

int main(int argc, char *argv[])
{
#ifdef LOCAL
   freopen("in.txt","r",stdin);
   freopen("out.txt","w",stdout);
#endif
    int n,k,r,c,i;
    while(scanf("%d %d",&n,&k)!=EOF)
    {
        for(i=0;i<k;i++)
        {
            scanf("%d %d",&r,&c); 
            add_edge(r,c);           
        } 
        ans=0;
        Hungary(n);
        printf("%d\n",ans); 
        for(i=1;i<=n;i++) G[i].clear();          
    } 
    system("PAUSE");
    return EXIT_SUCCESS;
}

题目（ http://poj.org/problem?id=3041）：

Asteroids

Time Limit: 1000MS		Memory Limit: 65536K

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).