Asteroids

点击打开链接

C - Asteroids

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

Submit  Status

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

ps: 此题求最小射击次数其实和用匈牙利算法求最大配对数是一个过程的，先对第一行的元素进行标记，直到本行最后一个返回true，然后到第二行是遇到的元素如果在前一行有同列的，进行返回运算。重复运算上述过程，用ans记录射击数。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int p[505];    
bool a[505][505];
bool vis[505];   
int n,m,k;

bool find(int x)
{
	for(int i=1; i<=n; i++) 
	{
	  if( a[x][i] && !vis[i])	
	   { 
	      vis[i]=true;
		  	
	   	  if(p[i] == -1 )
	   	  {
	   	  	  
	   	  	p[i] = x;
	   	  	return true; 			   			   		
		  }	
		  else if(find(p[i]))   
		  {
		  	p[i] = x;
		  	return true;
		  }	  
	   }		
	}
		
return false;	
}

int main()
{	
	 while(scanf("%d %d",&n,&m) != EOF)
	 {
	 	
	 	memset(a,false,sizeof(a));
	 	memset(p,-1,sizeof(p));
	 	for(int i=1; i<=m; i++)		  
		 {
		 	int x,y;
		 	scanf("%d %d",&x,&y);
		 	a[x][y]=true;
		 }
		 
		 int ans = 0;
	 	 for(int i=1; i<=n; i++)
	 	 {
	 	   memset(vis,false,sizeof(vis));
		   if( find(i) )
		   ans++;		  	
		 }
		 printf("%d\n",ans)	; 		 	 	
	 }			
return 0;		
}