6075: Fire Net
题目描述
Suppose that we have a square city with straight streets. A map of a city is a squar
e 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.
Powerful as the bullet is,however,it can only run across two 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.
样例输入 复制
2
XX
.X
3
.X.
X.X
.X.
3
...
.XX
.XX
0
样例输出 复制
1
5
2