Tempter of the Bone
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 137883 Accepted Submission(s): 36910
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.
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.
'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
NOYES
输入n,m,t;代表n行m列,t为时间,每走一步浪费一时间,从S走到D花费的时间能不能刚好为t, 为障碍物X,0 ,0, 0时程序停止
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int n,m,t,flag;
int a,b,c,d;
char mat[8][8];
int vis[8][8];
int f[4][2]={0,1,1,0,-1,0,0,-1};
void dfs(int x,int y,int cum){//cum代表已走步数
if(flag==1) return;
if(x==c&&y==d&&cum==t)//t为规定步数
{
flag=1;
return;
}
int minn=abs(x-c)+abs(y-d);//当前坐标距离终点的最小距离
if(minn>t-cum||(t-cum-minn)%2!=0)//当最小步数minn>剩余步数时,明显不能
return; //(奇偶剪枝)剩余的步数减去当前最小步数为多走的步数,必为偶数
for(int i=0;i<4;i++)
{
int xx=x+f[i][0];
int yy=y+f[i][1];
if(!vis[xx][yy]&&xx>=0&&xx<n&&yy>=0&&yy<m&&mat[xx][yy]!='X'){
vis[xx][yy]=1;
dfs(xx,yy,cum+1);
vis[xx][yy]=0;
}
}
return;
}
int main()
{
while(~scanf("%d%d%d",&n,&m,&t)){
flag=0;
if(n==0&&m==0&&t==0){
break;
}
memset(vis,0,sizeof(vis));
for(int i=0;i<n;i++)
scanf("%s",mat[i]);
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(mat[i][j]=='S')//起点坐标
{
a=i;
b=j;
}
if(mat[i][j]=='D')//终点坐标
{
c=i;
d=j;
}
}
}
if(n*m<t)
{
printf("NO\n");
continue;
}
vis[a][b]=1;//没有这句A不了
dfs(a,b,0);
if(flag==1) printf("YES\n");
else printf("NO\n");
}
return 0;
}