UVA - 10047 The Monocycle（BFS + vis数组的理解）

HelloWorld10086

于 2014-08-03 16:31:47 发布

阅读量1.2k

点赞数

CC 4.0 BY-SA版权

分类专栏： dfs or bfs 文章标签： Uva The Monocycle

本文链接：https://blog.youkuaiyun.com/helloworld10086/article/details/38358791

该博客介绍了一个特殊的单轮自行车问题，其中骑手在网格上移动，每次移动都会使车轮旋转72度。骑手需要从起点（标记为S）到达目标点（标记为T），避开障碍（标记为#）。使用BFS算法来寻找从起点到目标的最短路径。输入包含多个测试用例，输出是最短时间，若无法到达则显示"destination not reachable"。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem A: The Monocycle

A monocycle is a cycle that runs on one wheel and the one we will be considering is a bit more special. It has a solid wheel colored with five different colors as shown in the figure:

The colored segments make equal angles (72^o) at the center. A monocyclist rides this cycle on an $M \times N$ grid of square tiles. The tiles have such size that moving forward from the center of one tile to that of the next one makes the wheel rotate exactly 72^o around its own center. The effect is shown in the above figure. When the wheel is at the center of square 1, the midpoint of the periphery of its blue segment is in touch with the ground. But when the wheel moves forward to the center of the next square (square 2) the midpoint of its white segment touches the ground.