Tempter of the Bone(DFS+奇偶剪枝)
来源:互联网 发布:量子密钥分发 知乎 编辑:程序博客网 时间:2024/05/14 11:58
Tempter of the Bone
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
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
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>using namespace std;int n, m, t;int s[2], d[2]; //the position of the start point and the doorchar map[8][8];const int move[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};int CutBranch(int i, int j){ return abs(i - d[0]) + abs(j - d[1]);}bool Judge(int i, int j){ return (map[i][j] != 'X' && i >= 0 && i < n && j >= 0 && j < m);}bool DFS(int i, int j, int cnt){ int a = CutBranch(i, j); if((a & 1) != ((t - cnt) & 1) || a > t - cnt) return 0; if(cnt == t) return map[i][j] == 'D' ? 1 : 0; if(map[i][j] == 'D') return cnt == t ? 1 : 0; map[i][j] = 'X'; for(int k = 0; k < 4; k++) { int ii = i + move[k][0]; int jj = j + move[k][1]; if(Judge(ii, jj)) { char tmp = map[ii][jj]; int res = DFS(ii, jj, cnt + 1); if(res) return 1; map[ii][jj] = tmp; } } return 0;}int main(){ int num_X; while(scanf("%d %d %d", &n, &m, &t) && n) { num_X = 0; for(int i = 0; i < n; i++) scanf("%s", map[i]); for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) { if(map[i][j] == 'X') num_X++; if(map[i][j] == 'S') s[0] = i, s[1] = j; else if(map[i][j] == 'D') d[0] = i, d[1] = j; } if(t > n * m - num_X) puts("NO"); else { bool res = DFS(s[0], s[1], 0); if(res) puts("YES"); else puts("NO"); } } return 0;}
- Tempter of the Bone DFS+奇偶剪枝
- Tempter of the Bone (dfs + 奇偶剪枝)
- Tempter of the Bone-dfs+奇偶剪枝
- Tempter of the Bone(dfs, 奇偶剪枝)
- Tempter of the Bone(DFS + 奇偶剪枝,好题)
- Tempter of the Bone(DFS+奇偶剪枝)
- HDU 1010 Tempter of the Bone(DFS+奇偶剪枝)
- hdu 1010 Tempter of the Bone(dfs+奇偶剪枝)
- hdu 1010 Tempter of the Bone (dfs+奇偶剪枝)
- hdu 1010 Tempter of the Bone(dfs + 奇偶剪枝)
- HDU 1010 Tempter of the Bone ( dfs + 奇偶剪枝 )
- HDU 1010 Tempter of the Bone (DFS+奇偶剪枝)
- HDU 1010-Tempter of the Bone(DFS+奇偶剪枝)
- hdu 1010 Tempter of the Bone (dfs+奇偶剪枝)
- hdu 1010 Tempter of the Bone (dfs+奇偶剪枝)
- HDU 1010 -- Tempter of the Bone(dfs+奇偶剪枝)
- hdu1010 Tempter of the Bone(dfs+奇偶剪枝)
- HDU 1010 Tempter of the Bone(DFS+奇偶剪枝)
- JAVA入门级错误
- 轻松掌握Ajax.net系列教程一:部署AJAX.NET
- 树莓派(raspberry pi)学习16: 安装VNC,远程管理Raspberry Pi
- linux学习笔记1
- DOS命令 学习笔记(一)
- Tempter of the Bone(DFS+奇偶剪枝)
- Delphi 操作 AdvStringGrid一些笔记
- asp.net 页面的进度条
- nginx 之 多进程模型
- AOP面向切面编程(三)
- vanceinfo_oracle培训_笔记1
- 轻松掌握Ajax.net系列教程二:部署Ajax Control Toolkit
- JAVA程序执行过程
- SharePoint 2013 使用嵌入JavaScript方式实现一个垂直滚动列表