dfs+剪枝 hdu1010

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.

ample Input
4 4 5
S.X.
..X.
..XD
....
3 4 5
S.X.
..X.
...D
0 0 0
 

Sample Output
NO
YES

 题意：
给你一个N*M的迷宫和一个时间T,迷宫中为X的格子是不能走的,现在给你起点和终点.问你能不能在正好T秒的时候从起点到达终点,且不能走回头路.

 代码：
 

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=10;
int dr[]={-1,1,0,0};//上下左右
int dc[]={0,0,-1,1};
char map[maxn][maxn];
int R,C,T;
int sr,sc,er,ec;
bool dfs(int r,int c,int t)//t表示当前剩余时间
{
    if(t==0)
    {
        if(r==er&&c==ec) return true;
        return false;
    }
    if( t<(abs(er-r)+abs(ec-c)) || (t-abs(er-r)-abs(ec-c) )%2==1) return false; //代价剪枝
    for(int d=0;d<4;d++)
    {
        int nr=r+dr[d], nc=c+dc[d];
        if(nr<0||nr>=R||nc<0||nc>=C||map[nr][nc]=='X') continue;
/*其中第一个剪枝很容易想到,由于我们每秒只能向任意方向走1步.所以如果终点距离当前位置的坐标差>我们当前剩余时间,我们明显是不可能按时到达的.

第二个剪枝是:剩余时间t-(终点与当前位置的绝对距离和) == 偶数.因为如果是奇数的话,你是无论如何也不可能准时到达终点的*/
        map[nr][nc]='X';
        if(dfs(nr,nc,t-1)) return true;
        map[nr][nc]='.';//回溯
    }
    return false;
}
int main()
{
    while(scanf("%d%d%d",&R,&C,&T)==3 && R)
    {
        for(int i=0;i<R;i++)
        for(int j=0;j<C;j++)
        {
            scanf(" %c",&map[i][j]);
            if(map[i][j]=='S')
            {
                sr=i, sc=j;
                map[i][j]='.';
            }
            if(map[i][j]=='D')
            {
                er=i, ec=j;
                map[i][j]='.';
            }
        }
        map[sr][sc]='X';    //错误1,少了这句就是WA
        if(dfs(sr,sc,T)) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}