acm--dfs--Maximum bunker number--hdoj 1045--fire Net

Hdoj Title Address: Portal

Fire NetTime limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others) Total Submission (s): 9556 Accepted Submission (s): 5567

Problem Descriptionsuppose that we had a square city with straight streets. A map of a city are a square board with n rows and n columns, each representing a street or a piece of wall.

A blockhouse is a small castle it has four openings through which to shoot. The four openings is facing north, East, south, and West, respectively. There'll be a machine gun shooting through each opening.

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

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

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 PI Ctures Show illegal configurations. For this board, the maximum number of blockhouses in a legal configuration is 5; The second picture shows one-to-do it, but there is 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.

Inputthe 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 an integer n that's the size of the city; N would be is at most 4. The next n lines each describe one row of the map, with a '. ' indicating an open space and a uppercase ' X ' indicating a W All. There is no spaces in the input file.

Outputfor each test case, output one line containing the maximum number of blockhouses so can be placed in the city in a Legal configuration.

Sample Input

4.X ... Xx...... 2XX. X3. X.x.x.x.3 .... Xx. XX4 .......... 0

Sample Output

51524

Test instructions: Ask how many bunkers can be placed, the bunker cannot be in the same row or column, unless there is a wall separated, that is, two bunkers on the same row or column conditions must be separated by a wall

#include <stdio.h> #include <string.h> #include <algorithm>using namespace Std;char map[5][5];int Res int n;/** Determines if */bool judge (int x,int y) {if (map[x][y]!= ') is established. return false;        X.s can not put a for (int i=x-1;i>=0;i--) {//Judgment point above if (map[i][y]== ' X ') break;    if (map[i][y]== ' O ') return false;        } for (int i=y-1;i>=0;i--) {//Judgment point left if (map[x][i]== ' X ') break;    if (map[x][i]== ' O ') return false; } return true;        /** dfs*/void DFS (int x,int y,int tot) {if (x==n&&y==0) {//has searched n rows for maximum Res=max (Res,tot);    Return        if (y==n) {//This line has been completed, restart DFS (X+1,0,tot) from the first column on the next line;    Return            } for (int i=y;i<n;i++) {if (judge (X,i)) {map[x][i]= ' O ';            DFS (x,i+1,tot+1);        Map[x][i]= '. ';        }} DFS (X+1,0,tot);//The last line of search ends, starting from the next line}int main () {while (scanf ("%d", &n), n) {res=0;        for (int i=0;i<n;i++) scanf ("%s", Map[i]);        DFS (0,0,0); printf ("%d\ n ", res); } return 0; }

acm--dfs--Maximum bunker number--hdoj 1045--fire Net