HDU 2364 Escape（bfs+三维标记）

最新推荐文章于 2022-12-14 12:53:12 发布

BBHHTT

最新推荐文章于 2022-12-14 12:53:12 发布

阅读量252

点赞数

分类专栏：搜索（bfs&&dfs）

本文链接：https://blog.csdn.net/BBHHTT/article/details/80113136

版权

这道Escape题目理解后思路清晰，使用bfs解决，但实现时遇到困难。错误理解了不能反向走的规则，实际每个点有四个状态。采用三维标记法修正后成功通过，代码虽长但每步清晰。

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

Escape

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1228 Accepted Submission(s): 521

Problem Description

You find yourself trapped in a large rectangular room, made up of large square tiles; some are accessible, others are blocked by obstacles or walls. With a single step, you can move from one tile to another tile if it is horizontally or vertically adjacent (i.e. you cannot move diagonally).
To shake off any people following you, you do not want to move in a straight line. In fact, you want to take a turn at every opportunity, never moving in any single direction longer than strictly necessary. This means that if, for example, you enter a tile from the south, you will turn either left or right, leaving to the west or the east. Only if both directions are blocked, will you move on straight ahead. You never turn around and go back!
Given a map of the room and your starting location, figure out how long it will take you to escape (that is: reach the edge of the room).