Tempter of the Bone
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 30012 Accepted Submission(s): 8167
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.
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
//HDOJ_1010.cpp : Tempter of the Bone
//迷宫问题 深度优先搜索
#include "StdAfx.h"
#include
#include
using namespace std;
bool result;
char s[7][7];
int f[10][10];
int mx[]={1,0,-1,0};
int my[]={0,1,0,-1};
struct pos{
int x;
int y;
};
bool search(int x,int y,int dx,int dy,int t){
if( t==0 ){
if ( x==dx && y==dy ) return 1;
else return 0;
}
if( abs(x-dx)+abs(y-dy) > t )
return 0;
f[x][y]=0; //标0表示已经走过该点
for( int i=0; i<4; i++ )
if (result==0 && f[x+mx[i]][y+my[i]]==1)
result=search(x+mx[i],y+my[i],dx,dy,t-1);
f[x][y]=1; //标1表示放弃走该点 恢复原状
return result;
}
void process(int n,int m,int t){
int i, j, sx, sy, dx, dy, count=0;
memset(f,0,sizeof(f));
result = 0; //每轮初始化为假 清空上次可能的成功记录
for( i=1; i<=n; i++ ){ //处理地图数据
for ( j=1; j<=m; j++ ){
if( s[i][j]!='X' ){
f[i][j]=1; //1表示可通行
count++;}
if( s[i][j]=='S' ){
sx=i; sy=j;}
if( s[i][j]=='D' ){
dx=i; dy=j;}
}
}
if( (dx+dy-sx-sy+t)%2!=0 || dotNum> n >> m >> t && n!=0 )
{
for( i=1; i<=n; i++ ) //n为行数
for( j=1; j<=m; j++ )
cin >> s[i][j];
process(n,m,t);
}
system("pause");
return 0;
}