在Biridian Forest中，你需要离开森林并尽可能减少与其他 mikemon 养殖者战斗的次数。你的每一步行动都会被其他养殖者预知，他们会尝试与你战斗。你的任务是找到使战斗次数最小的移动序列。给出森林地图，你需要确定最小的战斗数量。例如，通过特定的路径规划，可以确保与最少的养殖者战斗并离开森林。
题目链接：http://codeforces.com/problemset/problem/330/D点击打开链接
You're a mikemon breeder currently in the middle of your journey to become a mikemon master. Your current obstacle is go through the infamous Biridian Forest.
The forest
The Biridian Forest is a two-dimensional grid consisting of r rows and c columns. Each cell in Biridian Forest may contain a tree, or may be vacant. A vacant cell may be occupied by zero or more mikemon breeders (there may also be breeders other than you in the forest). Mikemon breeders (including you) cannot enter cells with trees. One of the cells is designated as the exit cell.
The initial grid, including your initial position, the exit cell, and the initial positions of all other breeders, will be given to you. Here's an example of such grid (from the first example):
Moves
Breeders (including you) may move in the forest. In a single move, breeders may perform one of the following actions:
- Do nothing.
- Move from the current cell to one of the four adjacent cells (two cells are adjacent if they share a
最低0.47元/天 解锁文章
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
