1.19题目翻译

题目链接：Tempter of the Bone | JXNUOJ

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 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.

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

小狗在一个十分吸引他的古代迷宫中发现了一根骨头。然而，当他想要捡起来这跟骨头的时候，迷宫开始震动，小狗可以感到地面在震动。他意识到骨头是一个陷阱，他尝试着出去这个迷宫。

迷宫是一个N*M的矩阵，有一个门。一开始，这个门是关着的，只有在第T秒（小于1秒）这一个很短的时间时才会打开。所以他必须精准的到达第T秒。每秒钟，他都可以向上或者下或者左或者右移动一个相邻的单元格。当他进入一个单元格，这个地区的单元格就要开始下沉然后在下一秒消失。他不能在一个单元格待着超过一秒，可以移到相邻的单元格。这个小菜狗可以存活吗？请帮助他。

输入由多组测试数据组成，每组测试数据的第一行包括三个标志着迷宫大小和开门时间的整数N，M，和T(1 < N, M < 7; 0 < T < 50)。下一个每行包括M个元素的N行能够出去迷宫，A字符是下面中的其中一个：

X：小狗不能进入的地区的墙

S：小狗开始的时刻

D：门

.：一个空的单元格

输入在三个0秒终止，测试数据不能被计算。

每组测试数据，打印一行YES表示小狗能存活，或者一个NO表示不能存活。

输出：

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