hdu 1045 Fire Net (DFS java)

Fire Net

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11535    Accepted Submission(s): 6918

Problem Description

Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.

A blockhouse is a small castle that has four openings through which to shoot. The four openings are facing North, East, South, and West, respectively. There will be one machine gun shooting through each opening.

Here we assume that a bullet is so powerful that it can run across any distance and destroy a blockhouse on its way. On the other hand, a wall is so strongly built that can stop the bullets.

The goal is to place as many blockhouses in a city as possible so that no two can destroy each other. A configuration of blockhouses is legal provided that no two blockhouses are on the same horizontal row or vertical column in a map unless there is at least one wall separating them. In this problem we will consider small square cities (at most 4x4) that contain walls through which bullets cannot run through.

The following image shows five pictures of the same board. The first picture is the empty board, the second and third pictures show legal configurations, and the fourth and fifth pictures show illegal configurations. For this board, the maximum number of blockhouses in a legal configuration is 5; the second picture shows one way to do it, but there are several other ways.



Your task is to write a program that, given a description of a map, calculates the maximum number of blockhouses that can be placed in the city in a legal configuration.

 

Input

The input file contains one or more map descriptions, followed by a line containing the number 0 that signals the end of the file. Each map description begins with a line containing a positive integer n that is the size of the city; n will be at most 4. The next n lines each describe one row of the map, with a '.' indicating an open space and an uppercase 'X' indicating a wall. There are no spaces in the input file.

 

Output

For each test case, output one line containing the maximum number of blockhouses that can be placed in the city in a legal configuration.

 

Sample Input

  
  

   
   4
.X..
....
XX..
....
2
XX
.X
3
.X.
X.X
.X.
3
...
.XX
.XX
4
....
....
....
....
0
  
  

 

Sample Output

  
  

   
   5
1
5
2
4
  
  

 

Source

Zhejiang University Local Contest 2001

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1045

题目大意：给定一个n*n的矩阵，空白位置用'.'表示，障碍物用'X'表示，空白位置可以摆放碉堡。规则是碉堡之间相互“不可见”，也就是同一行或同一列的两个碉堡之间必须有障碍物，否则同一行或同一列不能同时放置两个以上碉堡。

解题思路：这题n最大为4，直接DFS暴力遍历，每次判断当前位置是否可以放置碉堡，如果可以，有两个选择：放或不放，然后进入下一个点。碉堡次数作为参数传递到DFS的每一层。

代码如下：

import java.util.*;

public class Main {
	
	public static char[] c[] = new char[10][10];
	public static int ans;
	public static int n;
	public static void main(String[] args){
		Scanner sc = new Scanner (System.in);
		while(sc.hasNext()){
			n = sc.nextInt();
			if(n==0){
				return;
			}
			ans=0;
			String str = new String();
			for(int i=0;i<n;i++){
				str = sc.next();
				for(int j=0;j<n;j++){
					c[i][j] = str.charAt(j);
				}
			}
			DFS(0,0,0);
			System.out.println(ans);
		}
	}
	
	public static void DFS(int x,int y,int cnt){
		if(x==n){
			if(cnt>ans){
				ans = cnt;
			}
			return;
		}
		boolean flog = true;  //flog来标记当前位置是否可以放置碉堡
		if(c[x][y]=='X'){
			flog = false;
		}
		
		for(int i=x-1;i>=0;i--){
			if(c[i][y]=='X'){
				break;
			}
			if(c[i][y]=='#'){
				flog = false;
				break;
			}
		}
		if(flog){
			for(int i=x+1;i<n;i++){
				if(c[i][y]=='X'){
					break;
				}
				if(c[i][y]=='#'){
					flog = false;
					break;
				}
			}
		}
		if(flog){
			for(int i=y-1;i>=0;i--){
				if(c[x][i]=='X'){
					break;
				}
				if(c[x][i]=='#'){
					flog = false;
					break;
				}
			}
		}
		if(flog){
			for(int i=y+1;i<n;i++){
				if(c[x][i]=='X'){
					break;
				}
				if(c[x][i]=='#'){
					flog = false;
					break;
				}
			}
		}
		if(flog){      //如果可以放置，把当前点标记为'#'，进入下一个点时个数要加1 
			c[x][y] = '#'; 
			if(y<3){
				DFS(x,y+1,cnt+1);
			}else{
				DFS(x+1,0,cnt+1);
			}
			c[x][y] = '.';    
		}
		if(y<n-1){
			DFS(x,y+1,cnt);
		}else{
			DFS(x+1,0,cnt);
		}
	}
}