这篇博客介绍了一个关于如何在受限条件下最大化种植仙人掌的问题。问题背景是一个长n宽m的矩形网格花园，其中有些格子不适合种植。每个格子最多只能种一株仙人掌，并且相邻的格子不能同时种植。程序通过特殊判断和最优化算法，计算出了最大能种植的仙人掌数量以及符合约束条件的种植布局方案。
Problem G : Garden
时间限制：C/C++ 10秒，其他语言20秒
空间限制：C/C++ 1048576K，其他语言2097152K
Special Judge, 64bit IO Format: %lld
题目描述
There is a rectangle garden in front of Gina’s house. The garden can be seen as an n-by-m rectangular grid. All grid cells are identical squares, and two grid cells are considered adjacent if they share an common edge.
Gina loves cacti and wants to plant as many cacti as possible in the garden. However, there are some constraints on planting cacti.
• The soil can be too wet in some of the cells and therefore is not suitable for cacti. Gina cannot plant cacti in those cells.
• Since the soil in each cell is not fertile enough to grow two or more cacti, Gina may plant at most one cactus in a cell.
• At most one cactus can be planted in any pair of adjacent cells. O
最低0.47元/天 解锁文章
扫一扫
669
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
