hdoj1010 Tempter of the Bone(深度优先搜索)
来源:互联网 发布:mysql 修改复合主键 编辑:程序博客网 时间:2024/05/18 00:57
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
- hdoj1010 Tempter of the Bone(深度优先搜索)
- HDOJ1010.Tempter of the Bone
- HDOJ1010 Tempter of the Bone
- hdoj1010-【Tempter of the Bone】
- HDOJ1010 Tempter of the Bone
- HDU 1010 Tempter of the Bone 深度优先搜索(DFS)
- Hdu1010 - Tempter of the Bone - 深度优先搜索
- HDU-1010-Tempter of the Bone( DFS + 深度优先搜索 )
- Q1010 Tempter of the Bone C++ (深度优先搜索)
- HDOJ1010 Tempter of the Bone(DFS)
- HDOJ1010 Tempter of the Bone(DFS)
- Tempter of the Bone(深度搜索)
- HDU 1010 Tempter of the Bone ( DFS(深度优先搜索)+ 奇偶剪枝 )
- hud 1010 (Tempter of the Bone)——dfs(深度优先搜索算法)
- HDU1010 Tempter of the Bone(深度优先搜索DFS+奇偶性剪枝)
- Tempter of the Bone-深度优先中的奇偶剪枝问题
- 题目1461:Tempter of the bone(深度优先)
- HDOJ1010 Tempter of the Bone(DFS,奇偶剪枝)
- jsp页面equal symbol expected错误
- 中断使能、禁止程序——之oem.c程序分析
- arcgis 中引入bingmap
- 区分Activity的四种加载模式
- 交通灯管理系统
- hdoj1010 Tempter of the Bone(深度优先搜索)
- 生活
- C语言文件操作函数大串讲
- jstl和EL表达式不起作用的问题
- 请问Eclipse中源码的中文部分都显示成乱码如何解决
- 银行业务调度系统
- Android 使用Handler实现Thread间通信
- 深入了解Linux设备模型
- hdoj1015Safecracker(深度优先搜索)