POJ 3041 Asteroids(二分图匹配)

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

题意：N*M的图，有个N个地方是X，每次操作可以让一行或一列的所有X变成.，问最少操作多少次，让所有X变成.

思路：建立二分图，左边点1-N表示行数，右边点1-N表示列数，有X的地方连线，答案就是二分图最大匹配数。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <map>

using namespace std;

const int MAX_N = 500 + 10;
const int N = 500;
const int MAX_M = N * N + 10;

struct EDGE
{
    int to;
    int go;
    EDGE() {}
    EDGE(int a, int b)
    {
        to = a;
        go = b;
    }
};

EDGE edge[MAX_M];
int head[MAX_N];
int edge_cnt;

void reset_edge()
{
    edge_cnt = 0;
    memset(head, -1, sizeof(head));
}

void add_edge(int u, int v)
{
    edge[edge_cnt] = EDGE(v, head[u]);
    head[u] = edge_cnt++;
}

int linker[MAX_N];
bool used[MAX_N];

bool dfs(int u)
{
    for (int i = head[u]; i != -1; i = edge[i].go) {
        int v = edge[i].to;
        if (used[v]) {
            continue;
        }
        used[v] = true;
        if (linker[v] == -1 || dfs(linker[v])) {
            linker[v] = u;
            return true;
        }
    }
    return false;
}

int hungray(int nleft)
{
    int ret = 0;
    memset(linker, -1, sizeof(linker));
    for (int i = 1; i <= nleft; ++i) {
        memset(used, 0, sizeof(used));
        ret += dfs(i);
    }
    return ret;
}

int main()
{
    int n, k;
    while(scanf("%d %d", &n, &k) != EOF)
    {
        reset_edge();
        for(int i = 1; i <= k; i++)
        {
            int x, y;
            scanf("%d %d", &x, &y);
            add_edge(x, y);
        }
        printf("%d\n",hungray(n));
    }
    return 0;
}