11 人解决，27 人已尝试。
14 份提交通过，共有 60 份提交。
7.0 EMB 奖励。
2289. Antenna Placement
单点时限: 2.0 sec
内存限制: 256 MB
The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most striking reason why they got the job, is their discovery of a new, highly noise resistant, antenna. It is called 4DAir, and comes in four types. Each type can only transmit and receive signals in a direction aligned with a (slightly skewed) latitudinal and longitudinal grid, because of the interacting electromagnetic field of the earth. The four types correspond to antennas operating in the directions north, west, south, and east, respectively. Below is an example picture of places of interest, depicted by twelve small rings, and nine 4DAir antennas depicted by ellipses covering them.
Obviously, it is desirable to use as few antennas as possible, but still provide coverage for each place of interest. We model the problem as follows: Let
输入格式
On the first row of input is a single positive integer *,o]. A *-character symbolises a point of interest, whereas a o-character represents open space.
输出格式
For each scenario, output the minimum number of antennas necessary to cover all *-entries in the scenario’s matrix, on a row of its own.
样例
Input
2 7 9 ooo**oooo **oo*ooo* o*oo**o** ooooooooo *******oo o*o*oo*oo *******oo 10 1 * * * o * * * * * *
Output
17 5
创建: 16 年，8 月前.
修改: 7 年，6 月前.
最后提交: 1 年，9 月前.
来源: Svenskt Mästerskap i Programmering/Norgesmesterskapet 2001
题目标签