hdu 1010 Tempter of the Bone

Tempter of the Bone

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 102587    Accepted Submission(s): 27804

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

 

Author

ZHANG, Zheng

 

Source

ZJCPC2004

 

 

#include<iostream>
#include<stdio.h>
#include<queue>
#include<math.h>
using namespace std;
struct Node
{
    int x,y;
} xsta,xend;
char g[8][8];
bool visit[8][8];
int nt[4][2]= {{0,1},{1,0},{0,-1},{-1,0}};
int n,m,t;
int flag=0;
int cnt=0;
void dfs(Node a,int cnt)
{
    if(a.x==xend.x&&a.y==xend.y)
    {
        if(cnt==t){
        flag=1;
        return;}
    }
    if(cnt>=t) return;
    Node tmp;
    for(int i=0; i<4; i++)
    {
        if(flag) return;
        tmp.x=a.x+nt[i][0];
        tmp.y=a.y+nt[i][1];
        if(tmp.x>-1&&tmp.x<n&&tmp.y>-1&&tmp.y<m&&g[tmp.x][tmp.y]!='X'&&!visit[tmp.x][tmp.y])
        {
            //cout<<tmp.x<<"***"<<tmp.y<<endl;
            visit[tmp.x][tmp.y]=true;
            dfs(tmp,cnt+1);
            visit[tmp.x][tmp.y]=false;

        }
    }
}
int main()
{
    /*for(int i=0;i<4;i++)
        cout<<next[i][0]<<"***"<<next[i][1]<<endl;*/

    while(scanf("%d%d%d",&n,&m,&t)&&(n!=0&&m!=0&&t!=0))
    {
        getchar();
        //cout<<n<<endl<<m<<endl;
        for(int i=0; i<n; i++)
          {

            for(int j=0; j<m; j++)
            {
                scanf("%c",&g[i][j]);
                if(g[i][j]=='S')
                {
                    xsta.x=i;
                    xsta.y=j;
                }
                if(g[i][j]=='D')
                {
                    xend.x=i;
                    xend.y=j;
                }
            }
            getchar();
          }

        if(abs(xsta.x-xend.x)+abs(xsta.y-xend.y)>t||(xsta.x+xsta.y+xend.x+xend.y+t)%2==1)
        {//cout<<xsta.x<<"*"<<xend.y<<"*"<<xend.x<<"*"<<xend.y<<"*"<<t<<endl;
            printf("NO
");
            continue;
        }
        for(int i=0; i<n; i++)
            for(int j=0; j<m; j++)
                visit[i][j]=false;
        visit[xsta.x][xsta.y]=true;
        flag=0;
        cnt=0;
        dfs(xsta,0);
        printf("%s
",(flag==1)?"YES":"NO");

    }

return 0;
}

dfs搜素一下，重要的是剪枝，剪枝的地方有两处，一个是起点和终点的距离大于步数，一个是起点、终点、步数的奇偶性不一致。