POJ 3041 Asteroids //简单二分图

左手的ㄟ右手 2022-08-10 14:38 200阅读 0赞

Asteroids

<table> 
 <tbody> 
  <tr> 
   <td><strong>Time Limit:</strong>&nbsp;1000MS</td> 
   <td>&nbsp;</td> 
   <td><strong>Memory Limit:</strong>&nbsp;65536K</td> 
  </tr> 
  <tr> 
   <td><strong>Total Submissions:</strong>&nbsp;14770</td> 
   <td>&nbsp;</td> 
   <td><strong>Accepted:</strong>&nbsp;8050</td> 
  </tr> 
 </tbody> 
</table>

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

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

Source

[USACO 2005 November Gold][]

#include <stdio.h>
    #include <string.h>
    
    bool tu[505][505];
    bool visit[505];
    int jilu[505];
    
    bool dfs(int n, int y);
    
    int main()
    {
    	int n, k;
    	int x, y, ans;
    	int i;
    
    	scanf("%d%d", &n, &k);
    
    	memset(tu, false, sizeof(tu));
    	for(i=1; i<=n; i++)
    		jilu[i] = -1;
    
    	for(i=1; i<=k; i++)
    	{
    		scanf("%d%d", &x, &y);
    		tu[x][y] = true;
    	}
    	
    	ans = 0;
    	for(i=1; i<=n; i++)
    	{
    		memset(visit, false, sizeof(visit));
    		if( dfs(i, n) )
    			ans++;
    	}
    	printf("%d\n", ans);
    
    	return 0;
    }
    bool dfs(int n, int y)
    {
    	int i;
    	for(i=1; i<=y; i++)
    	{
    		if(tu[n][i] && !visit[i])
    		{
    			visit[i] = true;
    			if(jilu[i]==-1 || dfs(jilu[i], y))
    			{
    				jilu[i] = n;
    				return true;
    			}
    		}
    	}
    	return false;
    }

[USACO 2005 November Gold]: http://poj.org/searchproblem?field=source&key=USACO+2005+November+Gold