该博客介绍了一种解决火网问题的方法，即在一个由空地和墙组成的正方形城市中，如何合法地放置最多数量的火炮，使得它们不会互相攻击。火炮可以直线穿越任何距离，但不能穿过墙。对于每个测试用例，输入包含城市地图，输出为最大可放置火炮数量。博主提出了使用DFS策略检查每个位置是否可以放置火炮，并提供了解题思路和代码示例。
Fire Net
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
最低0.47元/天 解锁文章
238
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
