1) 题目

Tempter of the Bone

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 47967 Accepted Submission(s): 12905

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

2) 题意

在一个n行m列的迷宫中,每一步只能向上、下、左、右中任意方向走一格，迷宫中有围墙的地方是无法到达的。从起点s开始，能否刚好走t步，到达e。

3) 数据范围

迷宫大小最大为6*6，测试数据组数最大为50组。感觉上数据量很小，可实际上，如果在6*6的迷宫中，枚举所有可能路径的话，时间复杂度是指数级的，所以剪枝是关键。

4) 算法

先用BFS判断s到e是否有路径，以及这条最短路径长度是否小于等于t，然后再进行回溯法+奇偶剪枝。

迷宫中回溯法的剪枝——奇偶剪枝

5) 代码

[cpp] view plaincopyprint?

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
#define MAXSIZE 10
int dir[4][2] = {-1, 0, 0, 1, 1, 0, 0, -1};
char maze[MAXSIZE][MAXSIZE];
bool vis[MAXSIZE][MAXSIZE];
int dx, dy;
bool finished;
void InitMaze(int m, int n)
{
int i;
for (i = 0; i < m+2; i++)
{
maze[i][0] = maze[i][n+1] = 'X';
}
for (i = 0; i < n+2; i++)
{
maze[0][i] = maze[m+1][i] = 'X';
}
}
void Backtrack(int x, int y, int rt)
{
vis[x][y] = true;
if (x == dx && y == dy)
{
if (rt == 0)
{
finished = true;
}
}
else
{
int i;
for (i = 0; i < 4; i++)
{
int nextx = x + dir[i][0];
int nexty = y + dir[i][1];
if (!vis[nextx][nexty] && maze[nextx][nexty] != 'X')
{
Backtrack(nextx, nexty, rt-1);
if (finished)
{
return;
}
}
}
}
vis[x][y] = false;
}
struct Position
{
int x, y;
int nsteps;
};
int BFS(int x, int y)
{
queue<Position> next;
Position currPos = {x, y, 0};
next.push(currPos);
vis[x][y] = true;
while (!next.empty())
{
currPos = next.front();
next.pop();
if (currPos.x == dx && currPos.y == dy)
{
return currPos.nsteps;
}
int i;
for (i = 0; i < 4; i++)
{
Position nextPos = currPos;
nextPos.x += dir[i][0];
nextPos.y += dir[i][1];
if (!vis[nextPos.x][nextPos.y] && maze[nextPos.x][nextPos.y] != 'X')
{
nextPos.nsteps++;
next.push(nextPos);
vis[nextPos.x][nextPos.y] = true;
}
}
}
return -1;
}
int Dist(int x, int y)
{
return abs(dx-x)+abs(dy-y);
}
int main(void)
{
int m, n, t;
while (scanf("%d%d%d", &m, &n, &t) != EOF)
{
getchar();
if (m == 0 && n == 0 && t == 0)
{
break;
}
InitMaze(m, n);
int sx, sy;
int i, j;
for (i = 1; i <= m; i++)
{
for (j = 1; j <= n; j++)
{
maze[i][j] = getchar();
if (maze[i][j] == 'S')
{
sx = i;
sy = j;
}
if (maze[i][j] == 'D')
{
dx = i;
dy = j;
}
}
getchar();
}
finished = false;
if (Dist(sx, sy) % 2 == t % 2) //奇偶剪枝
{
memset(vis, false, sizeof(vis));
int minNSteps = BFS(sx, sy);
if (minNSteps != -1 && minNSteps <= t)
{
memset(vis, false, sizeof(vis));
Backtrack(sx, sy, t);
}
}
if (finished)
{
puts("YES");
}
else
{
puts("NO");
}
}
return 0;
}

6) 测试数据

4 4 5

S.X.

..X.

..XD

....

3 4 5

S.X.

..X.

...D

5 5 9

...D.

X.XX.

.XX..

SX...

....X

7) 提交结果

回溯法+奇偶剪枝——Hdu 1010 Tempter of the Bone相关推荐

HDU.1010 Tempter of the Bone
文章目录一.题目解读 1.原题 2.分类 3.题意 4.输入输出格式 5.数据范围二.题解参考 1.总体思路 2.思路① (1).分析 (2).AC代码三.评价与后话 1.评价 2.奇偶剪枝0- ...
HDU 1010 Tempter of the Bone heuristic 剪枝法
本题就是考剪枝法了. 应该说是比较高级的应用了.因为要使用heuristic(经验)剪枝法.要总结出这个经验规律来,不容易.我说这是高级的应用也因为网上太多解题报告都没有分析好这题,给出的程序也很慢, ...
HDOJ 1010 HDU 1010 Tempter of the Bone ACM 1010 IN HDU
MiYu原创, 转帖请注明 : 转载自 ______________白白の屋题目地址: http://acm.hdu.edu.cn/showproblem.php?pid=1010 题目描述: 代码 ...
HDU 1010 Tempter of the Bone heuristic 修剪
的问题是,在测试修剪. 应该说是更先进的应用. 由于使用的heuristic(经验)修剪.总结这方面的经验法则,别easy.我说,这也是由于先进的在线报告中的应用程序没有分析太多太好的解决这个问题,计 ...
HDU 1010 Tempter of the Bone DFS（奇偶剪枝优化）
需要剪枝否则会超时,然后就是基本的深搜了 #include<cstdio> #include<stdio.h> #include<cstdlib> #include ...
输入空格hdu - 1010 - Tempter of the Bone
时间紧张,先记一笔,后续优化与完善. 题意:一个N*M的地图,走过的点不能再走,X为墙弗成走,能否从点S到点D恰好用时T.(1 < N, M < 7; 0 < T < 50) ...
(step4.3.1) hdu 1010(Tempter of the Bone——DFS)
题目大意:输入三个整数N,M,T.在接下来的N行.M列会有一系列的字符.其中S表示起点,D表示终点. .表示路 . X表示墙...问狗能有在T秒时到达D.如果能输出YES, 否则输出NO 解题思路:D ...
DFS 如何避免重复母题 Leetcode 077组合（人为规定选取顺序：本题为只能从前往后选，好马不吃回头草）（类似题：Leetcode047全排列(可能含重复元素)-回溯法加剪枝）
类似题 Leetcode047全排列(可能含重复元素)-----------回溯法加剪枝 https://blog.csdn.net/qq_52934831/article/details/11957 ...
【算法学习笔记】16.暴力求解法04 回溯法03 剪枝法带宽
在之前的 N 皇后和困难的串问题中,回溯法都是在解决可行性约束.换一句话说,对于回溯点的判断是用来验证此点是否合法. 但是在一些优化问题的求解过程中,每一个点都是合法的,所以我们要进行剪枝. 1.先得 ...

回溯法+奇偶剪枝——Hdu 1010 Tempter of the Bone

Tempter of the Bone

回溯法+奇偶剪枝——Hdu 1010 Tempter of the Bone相关推荐

最新文章

热门文章