## 复试训练——搜索——深度优先遍历（DFS） 原

wudangt

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.

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

```NO
YES```

用scanf读取输入。

``````#include <stdio.h>
char maze[8][8];
int n,m,t;
bool success;
int go[][2]={
1,0,
-1,0,
0,1,
0,-1
};
void DFS(int x,int y,int time){
int i;
for(i=0;i<4;i++){
int nx=go[i][0]+x;
int ny=go[i][1]+y;
if(nx<1||nx>n||ny<1||ny>m) continue;
if(maze[nx][ny]=='X')continue;
if(maze[nx][ny]=='D'){
if(time+1==t){
success=true;
return;
}
else continue;
}
maze[nx][ny]='X';
DFS(nx,ny,time+1);
maze[nx][ny]='.';
if(success) return;
}
}
int main(){
while(scanf("%d%d%d",&n,&m,&t)!=EOF){
if(n==0&&m==0&&t==0) break;
int i;
for(i=1;i<=n;i++){
scanf("%s",maze[i]+1);

}
success=false;
int sx,sy;
for(i=1;i<=n;i++){
int j;
for(j=1;j<=m;j++){
if(maze[i][j]=='D'){
sx=i;
sy=j;
}
}
}
for(i=1;i<=n;i++){
int j;
for(j=1;j<=m;j++){
if(maze[i][j]=='S'&&(i+j)%2==((sx+sy)%2+t%2)%2){
maze[i][j]='X';
DFS(i,j,0);
}
}
}
puts(success==true ? "YES":"NO");
}
return 0;
}``````

### wudangt

cassiepython
2017/03/01
0
0
python实现二叉树的遍历以及基本操作

pandaWaKaKa
06/25
0
0

2018/07/13
0
0

03/25
0
0

sunhaiyu
2017/11/11
0
0

java通过ServerSocket与Socket实现通信

Blueeeeeee

6
0

5
0

16
0

（手机横屏看源码更方便） 注：java源码分析部分如无特殊说明均基于 java8 版本。 简介 大家都知道线程是有生命周期，但是彤哥可以认真负责地告诉你网上几乎没有一篇文章讲得是完全正确的。 ...

18
0
jquery--DOM操作基础

7
0