POJ 3041 Asteroids（二分图的最大匹配）

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.

输入描述:

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

输出描述:

• Line 1: The integer representing the minimum number of times Bessie must shoot.
  示例1
  输入
  3 4
  1 1
  1 3
  2 2
  3 2
  输出
  2

备注:

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

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
const int maxn = 5e4 + 7,N = 555,INF = 0x3f3f3f3f;
typedef long long ll;
int head[maxn], vis[N], match[N], cnt;
struct edge
{
    int to, next;
}e[maxn];
void add(int u, int v)
{
    e[++cnt].next = head[u];
    e[cnt].to = v;
    head[u] = cnt;
}
bool dfs(int x)
{
    for(int i = head[x]; i; i = e[i].next)
    {
        int v = e[i].to;
        if(!vis[v])
        {
            vis[v] = 1; //这里就置为1，而不是在if里再置，因为if若成功进入，表示可以将x和v匹配，所以必须要求在整个递归过程中v都不再被选择
            if(!match[v] || dfs(match[v]))
            {
                match[v] = x;
                return 1;
            }
        }
    }
    return 0;
}
int main()
{
    int n, k, r, c, ans = 0;
    scanf("%d %d", &n, &k);
    for(int i = 1; i <= k; ++i)
    {
        scanf("%d %d", &r, &c);
        add(r, c);
    }
    for(int i = 1; i <= n; ++i)
    {
        memset(vis, 0, sizeof(vis));
        ans += dfs(i);
    }
    cout << ans << endl;
    return 0;
}