HDU 1010

【搜素题】

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

NO YES

 

第一道搜索题

题意：n*m 矩阵，从S出发，到D停止，X为墙不能通过，不能停留，走过的不能走，T时间刚好到

 

#include<cstdio>
using namespace std;
int n,m,flag,dx,dy,ex,ey;
char str[10],map[10][10];
int d[4][2]={0,1,1,0,0,-1,-1,0};  //搜索上下左右用
int abs(int a)
{
    if(a<0)
    return -a;
}
void dfs(int x,int y,int t)
{
    if(flag==1)  return;  //这句不能省略 
    if(t<abs(ex-x)+abs(ey-y)||(abs(ex-x)+abs(ey-y)-t)%2) return;  //剪枝 不剪枝会超时
    if(t==0)
    {
        if(ex==x&&ey==y) {flag=1;return;}   //当t==0，且坐标一样 才算yes
        return;
    }
    for(int i=0;i<4;i++)
    {
        int nx=x+d[i][0],ny=y+d[i][1];
        if(nx>0&&ny>0&&nx<=n&&ny<=m&&(map[nx][ny]=='D'||map[nx][ny]=='.'))  //判断下一步是否能走
        {
            map[nx][ny]='X'; //走过的不能重复走
            dfs(nx,ny,t-1);  //递归调用
            map[nx][ny]='.';
        }
    }
    return;
}
int main()
{
    int t;
    while(scanf("%d%d%d",&n,&m,&t)!=EOF)
    {
        if(!n&&!m&&!t) return 0;
        for(int i=1;i<=n;i++)
        {
            scanf("%s",str);
            for(int j=1;j<=m;j++)
            {
                map[i][j]=str[j-1];
                if(map[i][j]=='S') dx=i,dy=j;
                if(map[i][j]=='D') ex=i,ey=j;
            }
        }
        flag=0;
        dfs(dx,dy,t);
        if(flag) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}