2 shunfurh shunfurh 于 2017.01.04 15:57 提问

Tempter of the Bone

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.

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.

Output

For each test case, print in one line "YES" if the doggie can survive, or "NO" otherwise.

Sample Input

4 4 5
S.X.
..X.
..XD
....
3 4 5
S.X.
..X.
...D
0 0 0

Sample Output

NO
YES

1个回答

caozhy
caozhy   Ds   Rxr 2017.01.12 00:47
已采纳
Csdn user default icon
上传中...
上传图片
插入图片
准确详细的回答,更有利于被提问者采纳,从而获得C币。复制、灌水、广告等回答会被删除,是时候展现真正的技术了!
其他相关推荐
HDU 1010 Tempter of the Bone(深搜)
Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 86037    Accepted Submission(s): 23462 Problem Description The
Tempter of the Bone (深搜+剪枝)
第一次遇到剪枝这一概念,主要是用来减少步骤的吧,WA了十四次  尴尬 H - Tempter of the Bone Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Description The doggie fo
杭电1010-Tempter of the Bone(BFS)
Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 91716    Accepted Submission(s): 24937 Problem Description
HDU(1010)bfs+剪枝 Tempter of the Bone
New~ 欢迎参加2016多校联合训练的同学们~                                         Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submis
HDU 1010 Tempter of the Bone【经典DPS】
Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 90627    Accepted Submission(s): 24657 Problem Description The dogg
HDU-2128-Tempter of the Bone II(BFS)
Problem Description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze was changed and the way he came in was lost.He realized that the bo
Tempter of the Bone -- BFS 回溯 剪枝
题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1010此题必须剪枝,不然就不能ac。写过bfs,dfs,都不行,原因是没有剪枝,参考学习下面的代码,不是自己写的 就要敲的变成自己的。// http://acm.hdu.edu.cn/showproblem.php?pid=1010//AC代码 可以敲上10遍了 #include <stdio.h> #
4.3.1--Tempter of the Bone--深搜(优化剪枝)
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
【搜索】 HDU 2128 Tempter of the Bone II BFS 状压
将每次移动用vis数组储存下拉
hdoj-1010-Tempter of the Bone【深搜+剪枝】
Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 90097 Accepted Submission(s): 24482 Problem Description The doggie fou