hdoj1010Tempter of the Bone
来源:互联网 发布:对社区网络式管理创新 编辑:程序博客网 时间:2024/06/06 19:30
Tempter of the Bone
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 88773 Accepted Submission(s): 24158
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.
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.
'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 5S.X...X...XD....3 4 5S.X...X....D0 0 0
Sample Output
NOYES
这个题目关键就在于剪枝问题,这个剪枝是奇偶剪枝,http://www.cnblogs.com/zibuyu/archive/2012/08/17/2644396.html 这个网址讲解比较详细
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <stack>#define MAX 1000000using namespace std;char maze[10][10];int m, n, t, flag, vis[10][10], ex, ey;int di[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};void dfs(int x, int y, int step) {if(step > t) {return ;}if(flag == 1) {return ;}int tmp = t - abs(x - ex) - abs(y - ey) - step;if(tmp <0 || tmp % 2 == 1) {return ;}if(maze[x][y] == 'D') {if(step == t) {flag = 1;}return ;}int nx, ny, i;for(i = 0; i < 4; i++) {nx = di[i][0] + x;ny = di[i][1] + y;if(nx >= 0 && nx < m && ny >= 0 && ny < n && !vis[nx][ny] && maze[nx][ny] != 'X') {vis[nx][ny] = 1;dfs(nx, ny, step + 1);vis[nx][ny] = 0;}}}int main() { while(~scanf("%d%d%d", &m, &n, &t) && (m + n + t) != 0) { int i, j, sx, sy; for(i = 0; i < m; i++) { for(j = 0; j < n; j++) { cin >> maze[i][j]; if(maze[i][j] == 'S') { sx = i; sy = j; } if(maze[i][j] == 'D') { ex = i; ey = j; } } } vis[sx][sy] = 1; dfs(sx, sy, 0); if(flag == 1) { printf("YES\n"); } else { printf("NO\n"); } memset(vis, 0, sizeof(vis)); flag = 0; }return 0;}
0 0
- hdoj1010Tempter of the Bone
- hdoj1010Tempter of the Bone(DFS+剪枝)
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- zoj2110Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- hdu1010Tempter of the Bone
- Tempter of the Bone
- Tempter of the bone
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- hdu1010Tempter of the Bone
- Tempter of the Bone
- 黑马程序员---iOS基础----OC中的点语法、构造方法
- ViewPager+Fragment问题
- CodeForces 407B DP
- SSH和EXTJS 之旅开始
- 九度OJ 题目1013:开门人和关门人
- hdoj1010Tempter of the Bone
- zoj-2112-Dynamic Rankings主席树模板
- 我多希望我学编程时,有人教我这些事!
- 调用startActivityForResult后onActivityResult立刻响应,返回当前页onActivityResult不响应的问题
- linux 删除和移动的常用快捷键
- Shell 学习15 - Shell if else 语句
- kiki's game
- 虚幻3引擎-多线程渲染机制
- HDU OJ Dividing 题目1059