【codeforces 111C】 Petya and Spiders

最新推荐文章于 2024-06-10 22:50:21 发布

ALPS233

最新推荐文章于 2024-06-10 22:50:21 发布

阅读量856

点赞数 1

分类专栏：状压DP 位运算文章标签： c语言 codeforces

本文链接：https://blog.csdn.net/ALPS233/article/details/50520460

版权

Petya在n×m的棋盘上训练蜘蛛，每格都有蜘蛛。在一秒钟内，他给每个蜘蛛发出指令，包括留在原地或向四个相邻格子移动。Petya的目标是找出最多能有多少个格子没有蜘蛛。题目要求计算最大可能的无蜘蛛格子数。输入包含棋盘的尺寸n和m，输出为无蜘蛛的格子的最大数量。

摘要由CSDN通过智能技术生成

H - Petya and Spiders
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit

Status
Description
Little Petya loves training spiders. Petya has a board n × m in size. Each cell of the board initially has a spider sitting on it. After one second Petya chooses a certain action for each spider, and all of them humbly perform its commands. There are 5 possible commands: to stay idle or to move from current cell to some of the four side-neighboring cells (that is, one command for each of the four possible directions). Petya gives the commands so that no spider leaves the field. It is allowed for spiders to pass through each other when they crawl towards each other in opposite directions. All spiders crawl simultaneously and several spiders may end up in one cell. Petya wants to know the maximum possible number of spider-free cells after one second.

Input
The first line contains two space-separated integers n and