nyoj 587 houseblocks

描述

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. 

输入

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.

输出

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

样例输入

4 

.X.. 

.... 

XX.. 

.... 

2 

XX 

.X 

3 

.X. 

X.X 

.X.

 3 

... 

.XX 

.XX 

4 

.... 

.... 

.... 

.... 

0

样例输出

5 

1 

5 

2 

4

 

#include

#include

int   ans, n;

char a[5][5];

int check(int x, int y)           //该函数是为了测试一下这个点能不能放炮台。

{

    int i,j, locate = 1;

    for(i = y - 1; i >= 0; i--)     //往左找。

    {

        if(a[x][i] == 'X')         //如果前边有墙，那不用问，肯定可以放了～直接跳出循环。

            break ;

        if(a[x][i] == 'b')         //如果有炮台了，那就不能放了，跳出循环。

        {

            locate = 0;

            break ;

        }

    }

    for(j = x - 1; j >= 0; j--)

    {

        if(a[j][y] == 'X')

            break ;

        if(a[j][y] == 'b')

        {

            locate = 0;

            break ;

        }

    }

    return locate ;

}

void dfs(int pos, int sum)

{

    int r, l;

    if(pos == n*n)                     //当某种情况的所有位置搜索完了，就返回上一层。而且在上一层下边要紧接着回溯。因为要找最大值。

    {

        if(ans < sum)

            ans = sum;

        return;

    }

        r = pos/n;                     //所有坐标是1.2.3...依次排列的。所以用pos表示行列坐标。这样搜寻下一位置的时候就不用判断这一行结束了没啊～是不是要移到下一行判断啊～什么的了。

        l = pos%n;

        if(a[r][l] == '.')              

        {

            if(check(r,l)==1)           //如果是. ， 那也不一定能放，因为它行列上可能有别的炮台了。所以进行check～

            {

                a[r][l] = 'b';         //将其标记为有炮台。

                dfs(pos+1, sum+1);     //进行下一位置的搜索，此时sum数+1.

                a[r][l] = '.';         //传说中的回溯。

            }

        }

        dfs(pos+1, sum);               //这个一定要放在if外边。因为如果某个位置不是.，那更要进行下一位置的搜索啊～

}

int main()

{

    int i, j;

    scanf("%d", &n);

    while(n!= 0)

    {

        ans = 0;

        for(i = 0 ; i < n ; i++)

        {

            getchar();

            for(j = 0 ; j < n ; j++)

            scanf("%c", &a[i][j]);

        }

        dfs(0, 0);                           //从第0.0点开始放炮台。

        printf("%d\n", ans);

        scanf("%d", &n);

    }

    return 0;

}