首页 > 专题系列 > Java解POJ > POJ 3041 Asteroids [解题报告] Java
2013
11-12

POJ 3041 Asteroids [解题报告] Java

Asteroids

问题描述 :

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.

输入:

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

输出:

* Line 1: The integer representing the minimum number of times Bessie must shoot.

样例输入:

3 4
1 1
1 3
2 2
3 2

样例输出:

2

温馨提示:

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

解题代码:

//* @author: [email protected]
import java.util.Scanner;
public class Main
{
 static int a,b;
 static int[][] map;
 static int[] used;
 static int[] match;
 public static void main(String[] args)
 {
  Scanner in=new Scanner(System.in);
  a=in.nextInt();
  b=in.nextInt();
  map=new int[a+1][a+1];
  for(int i=0;i< b;i++)
	map[in.nextInt()][in.nextInt()]=1;
  match=new int[a+1];
  used=new int[a+1];
  int count=0;
  for(int i=1;i<=a;i++)
  {
   for(int j=0;j<=a;j++)
	used[j]=0;
	if(find(i))count++;
  }
  System.out.print(count);
}

public static boolean find(int k)
{
 for(int i=1;i<=a;i++)
  if(map[k][i]==1&&used[i]==0)
  {
	used[i]=1;
	if(match[i]==0||find(match[i]))
	{
         match[i]=k;
	  return true;
	}
   }
  return false;
 }
}