当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3828:Zombies VS Plants

题目描述
Facer was addicted to a popular game called "Plants VS Zombies". After Facer had completed all missions, he started to play the zombies' role to destroy plants and called the new game "Zombies VS Plants".

In the game "Zombies VS Plants", there are 3 kinds of zombies: Little Zombie, Adult Zombie and Football player. Different zombies have different price and different "attacking value" indicating the capability to attack, as shown in the table below:

Zombie nameAttacking valuePrice for one (in dollars)
Little Zombie4050
Adult Zombie7075
Football player200100


Spiders also can destroy the plants. Every spider costs 125 dollars.

There are 4 kinds of plants: Sunflower, Bean, Magnet and Lettuce. Every plant has a "defending value" indicating it's capability of defense.

Facer's mission is to destroy ALL the plants in the field. In order to destroy plants, Facer needs to buy zombies or spiders and put them into the field. The plants field can be considered as a 5 x 5 grid (of course 25 cells), as shown in the figure below:

(1,1)(1,2)(1,3)(1,4)(1,5)
(2,1)(2,2)(2,3)(2,4)(2,5)
(3,1)(3,2)(3,3)(3,4)(3,5)
(4,1)(4,2)(4,3)(4,4)(4,5)
(5,1)(5,2)(5,3)(5,4)(5,5)

Plants field


There is a plant in every cell. Facer can destroy plants only by two ways:

  1. If Facer puts one or more zombies together into a row of the field, and the sum of those zombies' attacking values is larger than the sum of defending values of the plants in the same row, all plants in that row will be destroyed.

  2. Putting a spider in a cell will destroy the plant in it. But there are some exceptions as shown in the description of plant ``Lettuce" in a table below.



Once a zombie is put into the plants field, it dies immediately after destroying the plants. So does a spider. In other words, Facer can use a zombie or a spider only once.

This is a table describing the features of different kinds of plants:

Plant nameDefending valueSpecial features
Sunflower0None
Bean100None
Magnet0A magnet can make the attacking value of the football players in the same row and the adjacent rows become 50. For example, if there is a magnet in row 3, the attacking value of all football players Facer put into row 2, 3 and 4 will become 50.
Lettuce0Spiders can't destroy a lettuce and the plants in the eight cells around the lettuce. For example, if there is a lettuce at cell (3,3), spiders can't destroy the lettuce and the plants in (2,2), (2,3), (2,4), (3,2), (3,4), (4,2), (4,3) and (4,4).


Facer can earn P1 dollars after destroying a row of plants, and destroying a sunflower will earn extra P2 dollars for him. Facer has P3 dollars but no zombies and no spiders at the begging. Of course Facer can use the money he earned to buy zombies and spiders. Your job is helping Facer to accomplish his mission and keep money as much as possible after the mission.
输入解释
There are multiple test cases.

The first line in the input is a integer T indicating the number of test cases. (1 < T <= 400)


For each test case:

First line contains three integers P1, P2 and P3 (0 <= P1, P2, P3 <= 10000), meaning that Facer earns P1 dollars after destroying a row of plants and earns P2 dollars after destroying a sunflower, and Facer has P3 dollars at the beginning.

Following are 5 lines describing the plants field by top to bottom order. Each line contains 5 integers, telling what's in the cells of a row, by left to right order. For those 5 integers:


"1" represents a sunflower.

"2" represents a bean.

"3" represents a magnet.

"4" represents a lettuce.
输出解释
For each test case, output one line containing an integer indicating the maximum amount of dollars Facer can keep after he accomplishes the mission. If Facer can't destroy all the plants, print '-1' instead.
输入样例
2
100 100 10000
2 2 2 2 2
2 3 2 2 2
3 3 4 3 2
2 3 2 2 2
2 2 2 2 2
0 0 0
2 2 2 2 2
2 2 2 2 2
2 2 2 2 2
2 2 2 2 2
2 2 2 2 2
输出样例
9025
-1

该题目是Virtual Judge题目,来自 北京大学POJ

题目来源 Ningbo 2009

源链接: POJ-3828

最后修改于 2020-10-29T07:13:07+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 65536