HDU1010——Tempter of the Bone(深度搜索,奇偶剪枝)

来源:互联网 发布:coloros升级软件 编辑:程序博客网 时间:2024/04/28 14:26

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 5S.X...X...XD....3 4 5S.X...X....D0 0 0

Sample Output

NOYES

首先它和我以前见到的迷宫问题不同,之前的是求出一共可以踩的方块数,但本题是求出到达终点的最短路径,其中还用到了奇偶剪枝,具体参阅奇偶剪枝百度百科


#include<stdio.h>#include<math.h>#include<algorithm>using namespace std;char map[9][9];int n,m,t,x,dx,y,dy,ok;int a[4][2]= {{0,1},{0,-1},{1,0},{-1,0}};void dfs(int x,int y,int time){    int i,ans;    if(x==dx&&y==dy&&time==t)        ok=1;    if(ok)        return;    if(x<1||y<1||x>n||y>m)        return;    ans=t-time-abs(dx-x)-abs(dy-y);//奇偶剪枝,好高大上的样子。。。    if(ans<0||ans&1)        return;    for(i=0; i<4; i++)    {        if(map[x+a[i][0]][y+a[i][1]]!='X')        {            map[x+a[i][0]][y+a[i][1]]='X';            dfs(x+a[i][0],y+a[i][1],time+1);            map[x+a[i][0]][y+a[i][1]]='.';        }    }}int main(){    int i,j,k;    while(scanf("%d%d%d",&n,&m,&t)!=EOF)    {        getchar();        if(n==0&&m==0&&t==0)            break;        for(i=1,k=0; i<=n; i++)        {            for(j=1; j<=m; j++)            {                scanf("%c",&map[i][j]);                if(map[i][j]=='S')                {                    x=i;                    y=j;                }                if(map[i][j]=='D')                {                    dx=i;                    dy=j;                }                if(map[i][j]=='X')                    k++;            }            getchar();        }        if(n*m-k<t)            printf("NO\n");        else        {            ok=0;            map[x][y]='X';            dfs(x,y,0);            if(ok==1)                printf("YES\n");            else                printf("NO\n");        }    }    return 0;}




0 0
原创粉丝点击