# Fire Net

Fire Net

Time limit: 1 Seconds   Memory limit: 32768K
Total Submit: 5171   Accepted Submit: 1689

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.

Sample input:

4.X......XX......2XX.X3.X.X.X.X.3....XX.XX4................0

Sample output:

51524

My Solution

#include <iostream>

using namespace std;

int fillBlackHouse(int squareBoard[4][4], int size) {
int min = size * 2;
int minX, minY;
int count = 0;

// find min square
for (int i = 0; i < size; ++i) {
for (int j = 0; j < size; ++j) {
if (squareBoard[i][j] == 0 || squareBoard[i][j] == -1) {
continue;
}
if (squareBoard[i][j] == 1) {
squareBoard[i][j] = 0;
++count;
continue;
}
if (squareBoard[i][j] > 0 && squareBoard[i][j] < min) {
min = squareBoard[i][j];
minX = i;
minY = j;
}
}
}

// fill min square and adjust the impacted squares
if (min < size * 2) {
squareBoard[minX][minY] = 0;
++count;
for (int x = minX - 1; x >= 0 && squareBoard[x][minY] != -1; --x) {
squareBoard[x][minY] = 0;
}
for (int x = minX + 1; x < size && squareBoard[x][minY] != -1; ++x) {
squareBoard[x][minY] = 0;
}
for (int y = minY - 1; y >= 0 && squareBoard[minX][y] != -1; --y) {
squareBoard[minX][y] = 0;
}
for (int y = minY + 1; y < size && squareBoard[minX][y] != -1; ++y) {
squareBoard[minX][y] = 0;
}

return count + fillBlackHouse(squareBoard, size);
}

return count;
}

int main() {
int squareBoard[4][4];
int size;
char ch;
while(cin >> size) {
for (int i = 0; i < size; ++i) {
for (int j = 0; j < size; ++j) {
cin >> ch;
if (ch == 'X') {
squareBoard[i][j] = -1;
} else {
squareBoard[i][j] = 1;
for (int x = i - 1; x >= 0 && squareBoard[x][j] != -1; --x) {
++squareBoard[x][j];
++squareBoard[i][j];
}
for (int y = j - 1; y >= 0 && squareBoard[i][y] != -1; --y) {
++squareBoard[i][y];
++squareBoard[i][j];
}
}
}
}
if (size > 0) {
cout << fillBlackHouse(squareBoard, size) << endl;
}
}

}

==========================
Problem Source: Zhejiang University Local Contest 2001.
• 本文已收录于以下专栏：

## zoj1002-Fire Net

• acm_JL
• 2016年03月14日 19:27
• 946

## ACM-搜索之FireNet——hdu1045

ACM 回溯搜索 FireNet hdu1045
• lx417147512
• 2014年03月24日 20:45
• 1665

## ACM入门之杭电1045：Fire Net C++解法

Fire Net 地址：http://acm.hdu.edu.cn/showproblem.php?pid=1045 Time Limit: 2000/1000 MS (Java/Others) ...
• Cannel_2020
• 2012年03月31日 01:31
• 4504

## zoj 1002 Fire Net（DFS~ 哈哈哈哈，终于过了！！！）

1002 从一开始做ACM就郁闷的一道题，在1001下面它应该觉得压力很大啊！！哈哈。。 做完八皇后，党说这个能做了。。。 嘿嘿。这题是找放置最多数目的blockhouses（碉堡。。）使之不能同行同...
• zxy_snow
• 2010年10月19日 23:15
• 8696

## HDU-1045 Fire Net(DFS+回溯)

HDU-1045 Fire Net(DFS+回溯) 求放n*n的图中最多可放点的个数，'.'是可摆的，'#'是墙不可摆的同时起到可隔开两点的作用（点和点不能摆在同列同行）。...
• no_alternantive
• 2016年07月13日 11:52
• 353

## HDU1045 Fire Net 【DFS】

Fire Net Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) T...
• u012846486
• 2014年08月04日 17:10
• 772

## hdu 1045 Fire Net(DFS+回溯)

• u013365671
• 2014年07月30日 08:57
• 380

## 杭电ACM1045——Fire Net~~深度优先搜索

• qq_25425023
• 2015年07月17日 14:36
• 1124

## Fire net 之DFS解题报告

Fire Net Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total...
• caizi1991
• 2013年05月30日 18:04
• 843

## HDU 1045 Fire Net（贪心）

Description 给定一个最大4*4的方形地图，里面有墙(X)和空地(.)。在每个空地上可以放大炮，但两个大炮如果在同一行或同一列并且之间没有墙阻隔的话，会互相攻击，所以不能同时存在，问最多能...
• V5ZSQ
• 2015年09月05日 23:09
• 434

举报原因： 您举报文章：Fire Net 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)