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
题意概括 :
给你一个n*m的迷宫,‘S’老鼠的位置,‘D’是出口位置,‘X’代表墙。‘.’代表路,每个‘.’只能走一次,出口在第k秒是打开的,如果第k秒能到达则输出YES否则输出NO.
解题思路 :
深搜,从起点开始搜索,判断规定时间内是否能够到达出口.
通过判断起点与终点的距离与要求的时间k的奇偶性来判断是否超时.
#include<stdio.h>
#include<string.h>
#include<math.h>
int n,m,k;
char a[9][9];
bool book[9][9];
int next[4][2]={0,1,1,0,0,-1,-1,0};
int x2,y2;
int flag;
int p;
void DFS(int x,int y,int step)
{
if(x == x2 && y ==y2 && step == k)
{
flag = 1;
return ;
}
if(flag == 1)
{
return ;
}
for(int i=0;i<4;i++)
{
int tx = x + next[i][0];
int ty = y + next[i][1];
int ans = abs(x2 - tx) + abs(y2 - ty);
if((1+step+ans<=k) && (1+step+ans)%2 == p && tx>=0 && tx<n && ty>=0 && ty<m && a[tx][ty]!='X' && book[tx][ty] == 0)
{
book[tx][ty] = 1;
DFS(tx,ty,step+1);
book[tx][ty] = 0;
}
}
}
int main()
{
while(scanf("%d%d%d",&n,&m,&k)!=EOF)
{
memset(book,0,sizeof(book));
if(n == 0 && m == 0 && k == 0)
{
break;
}
p = k%2;
flag = 0;
int x1,y1;
for(int i=0;i<n;i++)
{
getchar();
for(int j=0;j<m;j++)
{
scanf("%c",&a[i][j]);
if(a[i][j] == 'S')
{
x1 = i;
y1 = j;
}
else if(a[i][j] == 'D')
{
x2 = i;
y2 = j;
}
}
}
getchar();
int pans = abs(y2 - y1) + abs(x2 - x1);
if(pans>k || pans%2!=p)
{
printf("NO\n");
continue;
}
book[x1][y1] = 1;
DFS(x1,y1,0);
if(flag == 1)
{
printf("YES\n");
}
else
{
printf("NO\n");
}
}
return 0;
}