hdu--1010(走迷宫,指定时间内到达目的)(DFS+剪枝)
来源:互联网 发布:淘宝店铺交易风险保障 编辑:程序博客网 时间:2024/06/01 22:48
Problem Description
The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone was a trap, and he tried desperately to get out of this maze.
The maze was a rectangle with sizes N by M. There was a door in the maze. At the beginning, the door was closed and it would open at the T-th second for a short period of time (less than 1 second). Therefore the doggie had to arrive at the door on exactly the T-th second. In every second, he could move one block to one of the upper, lower, left and right neighboring blocks. Once he entered a block, the ground of this block would start to sink and disappear in the next second. He could not stay at one block for more than one second, nor could he move into a visited block. Can the poor doggie survive? Please help him.
The maze was a rectangle with sizes N by M. There was a door in the maze. At the beginning, the door was closed and it would open at the T-th second for a short period of time (less than 1 second). Therefore the doggie had to arrive at the door on exactly the T-th second. In every second, he could move one block to one of the upper, lower, left and right neighboring blocks. Once he entered a block, the ground of this block would start to sink and disappear in the next second. He could not stay at one block for more than one second, nor could he move into a visited block. Can the poor doggie survive? Please help him.
Input
The input consists of multiple test cases. The first line of each test case contains three integers N, M, and T (1 < N, M < 7; 0 < T < 50), which denote the sizes of the maze and the time at which the door will open, respectively. The next N lines give the maze layout, with each line containing M characters. A character is one of the following:
'X': a block of wall, which the doggie cannot enter;
'S': the start point of the doggie;
'D': the Door; or
'.': an empty block.
The input is terminated with three 0's. This test case is not to be processed.
'X': a block of wall, which the doggie cannot enter;
'S': the start point of the doggie;
'D': the Door; or
'.': an empty block.
The input is terminated with three 0's. This test case is not to be processed.
Output
For each test case, print in one line "YES" if the doggie can survive, or "NO" otherwise.
Sample Input
4 4 5S.X...X...XD....3 4 5S.X...X....D0 0 0
Sample Output
NOYES
- hdu--1010(走迷宫,指定时间内到达目的)(DFS+剪枝)
- HDU-Tempter of the Bone-小狗走迷宫(DFS&&剪枝||奇偶剪枝)
- 走迷宫(Dfs)
- HDU 1728 逃离迷宫(dfs或bfs+剪枝)
- 搜索专题(DFS&&BFS&&剪枝)HDU 1728-逃离迷宫
- hdu 1010 (DFS+剪枝)
- SDUT 走迷宫(DFS)
- 自动走迷宫(DFS)
- HDOJ_1010 DFS 迷宫 (奇偶剪枝)
- HDU 1010(搜索题,DFS+剪枝)
- HDU 1010( DFS+奇偶剪枝)
- HDU 1010 Dfs的精华(剪枝)
- hdu 1010 搜索(dfs+剪枝)
- HDU-1010(DFS+奇偶剪枝)
- 栈实验走迷宫(DFS)
- NYOJ 306 走迷宫(DFS+二分法)
- DFS走迷宫问题(非最短路径)
- [SDUT](2449)走迷宫 ---DFS(图)
- Mysql学习笔记:Mysql服务器体系结构(二)
- Spring.NET学习笔记1——控制反转(基础篇)
- 百灵鸟和小鸟
- java7新功能
- JAVA中实现多线程的两种方式
- hdu--1010(走迷宫,指定时间内到达目的)(DFS+剪枝)
- 无事,说说
- 关于敏捷开发的26个心得
- UG和CAM编程
- jquery之管理包装元素集合(find()方法与contains()方法,is()方法的使用)
- Access中实现GroupConcat效果
- android布局属性预览一
- Spring.NET学习笔记2——环境搭建(基础篇)
- 车牌号地域识别