HDU-1010 Tempter of the Bone (DFS)

原题链接 http://acm.hdu.edu.cn/showproblem.php?pid=1010

Tempter of the Bone

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
  
  

Source Code

/*
DFS:
每个block只能走一次
要求恰好某个给定的时间到达出口

剪枝一：如果可走的block的总数小于时间，不可到达

剪枝二：奇偶性剪枝
可以把map看成这样： 
0 1 0 1 0 1 
1 0 1 0 1 0 
0 1 0 1 0 1 
1 0 1 0 1 0 
0 1 0 1 0 1 
从为 0 的格子走一步，必然走向为 1 的格子 
从为 1 的格子走一步，必然走向为 0 的格子 
即： 
0 ->1 或1->0 必然是奇数步 
0 ->0 走1->1 必然是偶数步 

  所以当遇到从 0 走向 0 但是要求时间是奇数的，或者， 从 1 走向 0 但是要求时间是偶数的 都可以直接判断不可达！

*/

#include <iostream>
using namespace std;

#define Max 10

int N, M, T;
int startx, starty, endx, endy;
char map[Max][Max];
bool arrived[Max][Max];
int dir[4][2] = {1,0, -1,0, 0,1, 0,-1};

bool canBeArrived(int x, int y) {
	if (x < 1 || y < 1 || x > N || y > M || map[x][y] == 'X' || arrived[x][y]) {
		return false;
	}
	return true;
}

bool DFS(int x, int y, int costTime) {

	int i;

	if (x == endx && y == endy && costTime == T) {
		return true;
	}

	//剪枝二
	int leftTime = T - costTime - abs(endx - x) - abs(endy - y);
    if( leftTime < 0 || leftTime & 1)  {
		return false;
	}

	int newx, newy;
	for (i = 0; i < 4; i++) {
		newx = x + dir[i][0];
		newy = y + dir[i][1];
		if (canBeArrived(newx, newy)) {
			arrived[newx][newy] = 1;
			if (DFS(newx, newy, costTime + 1)){
				return true;
			}
			arrived[newx][newy] = 0;
		}
	}
	return false;
}

int main() {
    int i, j, wall;
	while (scanf("%d %d %d", &N, &M, &T) != EOF) {

		if (N == 0 && M == 0 && T == 0) {
			break;
		}

		wall = 0;
		getchar();
		for (i = 1; i <= N; i++) {	
			for (j = 1; j <= M; j++) {
				scanf("%c", &map[i][j]);
				if (map[i][j] == 'S') {
					startx = i;
					starty = j;
				} else if (map[i][j] == 'D') {
					endx = i;
					endy = j;
				} else if (map[i][j] == 'X') {
					wall ++;
				}
			}	
			getchar();
		}

		//剪枝一
		if(N * M - wall <= T){
			printf("NO\n");
			continue;
		}


		memset(arrived, 0, sizeof(arrived));

		arrived[startx][starty] = 1;
		if (DFS(startx, starty, 0)) {
			printf("YES\n");
		} else {
			printf("NO\n");
		}
	}
}