C

点击打开链接

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 41 11 32 23 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个独立的点，将纵坐标的值视为另外n个独立的点。
则每一个陨石可以视为一个匹配。
现在要求的就是 最小的点，可以将所有陨石都覆盖到。

#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int n,m;bool l[505][505],vis[505];int b[505];bool find(int x){for(int i=1;i<=n;i++){   if (l[x][i]&&!vis[i]){vis[i] =true;if (!b[i]){b[i]=x;return true;}else if(find(b[i])){b[i]=x;return true;}}}return false;}int main(){int k;while(~scanf("%d %d",&n,&k)){m=n;memset(l,0,sizeof(l));memset(b,0,sizeof(b));for(int i=1;i<=k;i++){int x,y;  scanf("%d %d",&x,&y);  l[x][y]=1;}int ans=0; for(int i=1;i<=m;i++){memset(vis,0,sizeof(vis));if(find(i))  ans++;}printf("%d\n",ans);}}