POJ 3041 Asteroids（最小点覆盖集）

                                                                  Asteroids

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 20748		Accepted: 11278

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

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <queue>
#include <vector>
#define inf 0x7fffffff
#define met(a,b) memset(a,b,sizeof a)
typedef long long ll;
using namespace std;
const int N = ;
const int M = ;
int read() {
    int x=,f=;
    char c=getchar();
    while(c<''||c>'') {
        if(c=='-')f=-;
        c=getchar();
    }
    while(c>=''&&c<='') {
        x=x*+c-'';
        c=getchar();
    }
    return x*f;
}
int n1,n2,k;
int mp[N][N],vis[N],link[N];
int dfs(int x) {
    for(int i=; i<=n2; i++) {
        if(mp[x][i]&&!vis[i]) {
            vis[i]=;
            if(link[i]==-||dfs(link[i])) {
                link[i]=x;
                return ;
            }
        }
    }
    return ;
}

int main()
{
    int cas ;
        int s=;
        scanf("%d%d",&n1,&k);
        met(mp,);n2=n1;
       int xx,yy;
        for(int i=; i<k; i++) {
            scanf("%d%d",&xx,&yy);
            mp[xx][yy]=;
        }
        memset(link,-,sizeof(link));
        for(int i=; i<=n1; i++) {
            memset(vis,,sizeof(vis));
            if(dfs(i)) s++;
        }
        printf("%d\n",s);
    return ;
}