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.
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.
* 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).
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).
分析:本题看似与二分图没有关系,但可以将其转化为二分图,将x,y看成两个集合,每个点(x,y)变成x到y的边,然后求最小点覆盖,最小点覆盖就是最大匹配数
AC代码:
#include<iostream>
#include<cstring>
using namespace std;
int k,m;
int fr[505][505];
int f[505];
bool vis[505];
bool find(int x)
{
for(int i=1;i<=m;i++)
{
if(fr[x][i]&&!vis[i])
{
vis[i]=true;
if(f[i]==-1)
{
f[i]=x;
return true;
}
else
if(find(f[i]))
{
f[i]=x;
return true;
}
}
}
return false;
}
int main()
{
while(cin>>m>>k)
{
memset(fr,0,sizeof(fr));
memset(f,-1,sizeof(f));
for(int i=0;i<k;i++)
{
int x,y;
cin>>x>>y;
fr[x][y]=1;
}
int ans=0;
for(int i=1;i<=m;i++)
{
memset(vis,false,sizeof(vis));
if(find(i))
ans++;
}
cout<<ans<<endl;
}
return 0;
}