ZOJ-1002 Fire Net 火力网题解

最新推荐文章于 2019-04-26 13:42:16 发布

creativewang

最新推荐文章于 2019-04-26 13:42:16 发布

阅读量2.3k

点赞数 2

文章标签： each distance input output integer ini

本文链接：https://blog.csdn.net/creativewang/article/details/6170765

版权

这是一道关于在正方形城市地图上放置炮塔的问题，目标是在不互相射击的情况下放置尽可能多的炮塔。地图由n行n列构成，包含空地（.）和墙（X）。每行炮塔不能在同一水平或垂直线上，除非之间有墙隔开。输入包含多个地图描述，每个地图由n（最大4）行组成，用'.'和'X'表示空地和墙。输出每个地图上最大合法炮塔数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

ZOJ Problem Set - 1002

Fire Net
Time Limit: 1 Second Memory Limit: 32768 KB

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 ca