Fire Net 搜索 贪心
来源:互联网 发布:2016年网络诈骗事例 编辑:程序博客网 时间:2024/05/16 04:59
Fire Net
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1453 Accepted Submission(s): 811
Problem Description
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.
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.
Sample Input
4.X......XX......2XX.X3.X.X.X.X.3....XX.XX4................0
Sample Output
51524
- Fire Net 搜索 贪心
- HDU 1045 Fire Net(搜索/贪心/二分图最大匹配)
- Hdu1045 - Fire Net - 贪心算法
- HDU 1045 Fire Net 贪心
- HDU Fire Net (贪心)
- 贪心算法-HDU1045-Fire Net
- ZOJ 1002 Fire Net(搜索)
- hdu-1045-Fire Net(搜索)
- Fire net之贪心解题报告
- hdu 1045 Fire Net(贪心)
- HDU 1045 Fire Net(贪心)
- HDU1045 Fire Net 暴力搜索DFS
- ZOJ 1002 Fire Net (搜索 || 二分图)
- hdu 1045 Fire Net(回溯搜索)
- zoj1002 FIRE NET(搜索算法DFS)
- HDU ACM 1045 Fire Net 暴力搜索
- HDU 1045 Fire Net (搜索+回溯)
- HDU 1045 Fire Net 深度搜索
- 有关security cookie在栈保护上的研究
- 每款浏览器都是一个女人
- Fifteenth Demo of OGRE
- simple build.xml
- 耶鲁大学开放课程:《心理学导论》1
- Fire Net 搜索 贪心
- 变色龙扑克牌游戏V1.9.0.253正式版基本秘籍(Basic Cheats)
- 让大二如此开始
- POJ 1080 Human Gene Functions
- 爱
- 跳脱程序员思维 从开发到管理的蜕变
- 底层开发建议
- 辞职信(范例)
- 正则表达式快速参考