zoj 1002

//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 l*/egal configuration.

#include <iostream>
#include<vector>
#include<string>
#include<sstream>
#include<fstream>
using namespace std;
int counter, max;
vector<vector<int>>va(4, vector<int>(4));

// judging the ordinate wether correspond require
//采用的方法是由当前的坐标向四周扩散，来判断它先遇到‘.’还是'X'
int judge(int i, int j, int n,vector<vector<int>>&va)
{
    bool flag = true;
    for (int m = j - 1; m >= 0; m--)
    {
        if (va[i][m] == 0)
        {
            continue;
        }
        if (va[i][m] == 1)
        {
            break;
        }
        if (va[i][m] == 2)
        {
            return 0;
        }
    }
    for (int m = j + 1; m < n; m++)
    {
        if (va[i][m] == 0)
        {
            continue;
        }
        if (va[i][m] == 1)
        {
            break;
        }
        if (va[i][m] == 2)
        {
            return 0;
        }
    }


    for (int m = i - 1; m >= 0; m--)
    {
        if (va[m][j] == 0)
        {
            continue;
        }
        if (va[m][j] == 1)
        {
            break;
        }
        if (va[m][j] == 2)
        {
            return 0;
        }
    }
    for (int m = i + 1; m < n; m++)
    {
        if (va[m][j] == 0)
        {
            continue;
        }
        if (va[m][j] == 1)
        {
            break;
        }
        if (va[m][j] == 2)
        {
            return 0;
        }
    }
    return 1;
}

//用循环依次以每个坐标作为起点，分别来统计能够设立的炮楼个数，选出其中炮楼个数最多的个数。
void recursion(int n)
{
    if (counter > max)
    {
        max = counter;
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if (judge(i, j, n, va) && !va[i][j])
            {
                va[i][j] = 2;
                counter++;
                
                recursion(n);
                va[i][j] = 0;
                counter--;

            }
        }
    }

}


//涉及到文件的提取
int main()
{
    ifstream ifile;
    ifile.open("D:\\c++\\fire_net\\fire_net.txt");
    if (!ifile)
    {
        cout << "don't open the file" << endl;
        return 0;
    }
    while (true)
    {
        int n;
        string str;
        getline(ifile, str);
        counter = 0, max = 0;
        istringstream sin(str);
        sin>> n;

        if (n > 4||n==0)
        {
            return 0;
        }

        //alter the imformation ,make the '.' as 0 , make the 'X' as 1;
        for (int i = 0; i < n; i++)
        {
            string s;
            getline(ifile, s);
            for (int j = 0; j < s.size(); j++)
            {


                if (s[j] == '.')
                {
                    va[i][j] = 0;
                }
                if (s[j] == 'X')
                {
                    va[i][j] = 1;
                }
            }
        }

        recursion(n);
        cout << max << endl;

    }

    ifile.close();
}