博客介绍了Kilani与朋友玩的一款基于网格的游戏，玩家按顺序扩张自己的领地。游戏结束时，Kilani想知道每位玩家控制的格子数。题目要求根据网格大小、玩家数量及扩张速度，计算每个玩家在游戏结束后的领地数量。这是一个多源BFS问题，难点在于处理不同扩张速度的玩家，并确保每次从相同速度的玩家中选择源点进行BFS。
Kilani is playing a game with his friends. This game can be represented as a grid of size n×m, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).
The game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player i can expand from a cell with his castle to the empty cell if it’s possible to reach it in at most si (where si is player’s expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player’s castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that.
The game ends when no player can make a move. You are
最低0.47元/天 解锁文章
扫一扫
144
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
