Fire Net
2015-11-29 18:07
274 查看
Description
Input
Output
SampleInput
SampleOutput
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.
SampleInput
4 .X.. .... XX.. .... 2 XX .X 3 .X. X.X .X. 3 ... .XX .XX 4 .... .... .... .... 0
SampleOutput
5 1 5 2 4
相关文章推荐
- ZOJ 3329 One Person Game [概率DP]
- leetcode Remove Duplicates from Sorted Array python
- android自定义View绘制天气温度曲线
- 控件与布局
- Android系统init.rc分析
- ORA-01012 not log on
- hdu 5586 Sum(dp+技巧)
- 2015/11/29 软件测试学习第一天 准备工作
- 黑马程序员——Java基础---访问修饰符
- 黑马程序员——Java基础---有关static(静态)的知识
- 黑马程序员——Java基础---递归
- 黑马程序员——Java基础---单例
- 黑马程序员——Java基础---面向对象之抽象
- Studio
- 1083. List Grades (25)
- Linux 命令神器 man与info
- setTimeout()和setInterval()看js的异步执行方法
- Intent在Activity之间传递值
- 《大象-Think In UML》读书笔记3
- rabbitmq-BasicQos