zoj 2110 Tempter of the Bone

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

#include <cstdlib>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

char map[8][8];
bool escape;
int di, dj, m, n, t;
int dir[4][2] = {{0, -1}, {0, 1}, {1,0},{-1,0}};

void dfs(int si, int sj, int cnt)
{
    int i, temp;
    if (si > n || sj > m || si <= 0 || sj <= 0) return;
    if (si == di && sj == dj && cnt == t){escape = 1; return;}
    temp = (t-cnt) - (fabs(si-di) + fabs(sj-dj));
    if (temp<0 || temp%2) return;
    for (i = 0; i < 4; ++i)
    {
        if (map[si+dir[i][0]][sj+dir[i][1]] != 'X')
        {
            map[si+dir[i][0]][sj+dir[i][1]] = 'X';
            dfs(si+dir[i][0], sj+dir[i][1], cnt+1);
            if (escape) return;
            map[si+dir[i][0]][sj+dir[i][1]] = '.';
        }
    }
    return;
}

int main(void)
{
    int i, j, si, sj;
#ifndef ONLINE_JUDGE
    freopen("in", "r", stdin);
#endif
    while (~scanf("%d%d%d", &n, &m, &t))
    {
        if (!n && !m && !t) break;
        int wall = 0;
        getchar();
        for (i = 1; i < n + 1; ++i)
        {
            for (j = 1; j < m + 1; ++j)
            {
                scanf("%c", &map[i][j]);
                if (map[i][j] == 'S') si=i,sj=j;
                else if (map[i][j] == 'D') di=i,dj=j;
                else if (map[i][j]=='X') wall++;
            }
            getchar();
        }
        if (n*m - wall <= t){printf("NO\n"); continue;}
        escape = 0;
        map[si][sj] = 'X';
        dfs(si, sj, 0);
        if (escape) printf("YES\n");
        else printf("NO\n");
    }

    return 0;
}

入门做的第一道搜索题，注意两个地方的剪枝。其实上面的代码是抄的书上的，还好，看懂了，以后自己写。 还得谢谢xrl，dfs,bfs刚开始看各种不懂，，后来xrl跟我说了这本书，又给我讲了一下，我才知道代码怎么写。