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
题目大意为一只小狗要在T秒的时候到达门的位置逃离。开始看错了题目,以为是T秒内,所以用了BFS。如果直接深搜会TLE(超时),所以要剪枝。奇偶剪枝是一个小技巧,如果起点和终点路径偏量为x,则到达终点所花的步数一定是x加上一个偶数。细节看下面的AC代码:
import java.util.Scanner;
public class Main {
static char[][] a;
static int[][] dn= {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};//方向数组
static int X, Y, E, F, N, M, T, offset;
static boolean escape;
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
while(true) {
N=input.nextInt();
M=input.nextInt();
T=input.nextInt();
if(N==0&&M==0&&T==0) break;
a = new char[N][M];
for(byte i=0; i<N; i++) {
a[i]=input.next().toCharArray();
}
int count=1;
for(byte i=0; i<N; i++) {
for(byte j=0; j<M; j++) {
if(a[i][j]=='S') {
X=i;
Y=j;
}
else if(a[i][j]=='D') {
E=i;
F=j;
}
else if (a[i][j]=='.') {
count++;
}
}
}
if(count<T) System.out.println("NO");
else {
escape=false;
a[X][Y]='X';
DFS(0, X, Y);
if(escape) System.out.println("YES");
else System.out.println("NO");
}
}
input.close();
}
public static void DFS(int deep, int x, int y) {
if(deep==T&&x==E&&y==F) {
escape=true;
return;
}
offset=T-deep-Math.abs(x-E)-Math.abs(y-F);//后面两项为路径偏量
if(offset<0||offset%2!=0) {
return;
}
int m, n;
for(byte i=0; i<4; i++) {
m=x+dn[i][0];
n=y+dn[i][1];
if(m>=0&&m<N&&n>=0&&n<M&&a[m][n]!='X') {
a[m][n]='X';
DFS(deep+1, m, n);
a[m][n]='.';
}
if(escape) break;
}
}
}