Fire Net

原创 2006年06月04日 20:44:00
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..
....
2
XX
.X
3
.X.
X.X
.X.
3
...
.XX
.XX
4
....
....
....
....
0

Sample output:

5
1
5
2
4

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.

相关文章推荐

HDU1045 Fire Net 【DFS】

Fire Net Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) T...

HDU1045-Fire Net(回溯)

Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total S...
  • algzjh
  • algzjh
  • 2017年05月31日 15:15
  • 99

ZOJ Problem Set - 1002 Fire Net

Fire Net Time Limit: 2 Seconds Memory Limit: 65536 KB Suppose that we have a square city with st...
  • Kexiii
  • Kexiii
  • 2016年04月17日 17:43
  • 252

文章标题Fire Net

Fire Net Suppose that we have a square city with straight streets. A map of a city is a square board...

ZOJ——1002 Fire Net

Fire Net Time Limit: 2 Seconds      Memory Limit: 65536 KB Suppose that we have a square ci...

【二分匹配】hdu1045 Fire Net

Fire Net http://acm.hdu.edu.cn/showproblem.php?pid=1045 Problem Description Suppose that we...
  • ACM_Ted
  • ACM_Ted
  • 2012年07月27日 17:12
  • 385

ZOJ 1002 Fire Net

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=2 一道搜索的题目,数据量不是很大用深搜。判定一个点是不是能否放置碉堡,搜索其上...

ZOJ 1002 fire net DFS

Fire Net Time Limit: 2 Seconds      Memory Limit: 65536 KB Suppose that we have a square city wi...

hdoj1045 Fire Net(dfs)

看题目的时候,联想到八皇后的问题,就稍微了解了一下有关八皇后的解法:http://blog.csdn.net/bone_ace/article/details/41419695 但这道题与八皇后问题...
  • CqZtw
  • CqZtw
  • 2017年06月01日 15:58
  • 112

【图论】【二分图匹配】[ZOJ 1002]Fire Net

这道题目就是对不同的方向的同一行或者列的连通块进行标号,然后对方向不同且相交的连通快连边,最后做一次二分图最大匹配就好了。#include #include #include //#includ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Fire Net
举报原因:
原因补充:

(最多只允许输入30个字)