# POJ 3401 Asteroids 二分图最大匹配 最小点覆盖

A - Asteroids

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

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

X . X
. X .

. X .

2

#include <iostream>
#include<cstdio>
#include<string.h>
using namespace std;
/*

-------------------------------

-------------------------------

*/
#define maxn 1001
bool find(int v)
{
for(int i=1; i<=n; i++)
{
if(g[v][i] && !vis[i])///如果结点i和v相邻并且未被查找过
{
vis[i] = true;///标记结点i为已查找过
{
return true;///返回查找成功
}
}
}
return false;
}
int main()
{
int ans;
while(scanf("%d%d",&n,&k) != EOF)
{
memset(g,0,sizeof(g));
for(int i = 0; i < k; i++)
{
scanf("%d%d",&r,&c);
g[r][c] = 1;
}
ans = 0;
for(int i=1; i<=n; i++)
{
memset(vis,0,sizeof(vis));//清空上次搜索时的标记
if(find(i))//从节点i尝试扩展
ans++;
}
printf("%d\n",ans);
}
return 0;
}


04-07 1311

07-02 3798

07-21 531

10-29 3965

11-24 2551

07-26 592

10-10 4573

11-18 1062

#### 二部图概述（二分图，匹配，覆盖，KM算法）

2012年05月01日 555KB 下载

11-16 447