HDU 1010 Tempter of the Bone
2016-02-02 17:57
351 查看
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
Sample Output
简单dfs
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
简单dfs
#include<string> #include<algorithm> #include<iostream> #include<cstring> #include<cstdio> #include<queue> #include<map> #include<cmath> using namespace std; const int maxn = 10 + 5; typedef long long LL; int T, n, m; char s[maxn][maxn]; bool flag; void dfs(int x, int y, int t) { if (s[x][y] == 'D') { if (t == T) flag = true; return; } if (t >= T || flag) return; s[x][y] = 'X'; if (s[x - 1][y] == '.' || s[x - 1][y] == 'D') dfs(x - 1, y, t + 1); if (s[x][y - 1] == '.' || s[x][y - 1] == 'D') dfs(x, y - 1, t + 1); if (s[x + 1][y] == '.' || s[x + 1][y] == 'D') dfs(x + 1, y, t + 1); if (s[x][y + 1] == '.' || s[x][y + 1] == 'D') dfs(x, y + 1, t + 1); s[x][y] = '.'; } int main() { while (scanf("%d%d%d", &n, &m, &T), n + m + T) { flag = false; memset(s, 0, sizeof(s)); for (int i = 1; i <= n; i++) scanf("%s", s[i] + 1); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (s[i][j] == 'S') dfs(i, j, 0); } } if (flag) printf("YES\n"); else printf("NO\n"); } //while (scanf("%d", &n) != EOF){} return 0; }
相关文章推荐
- HDOJ 2081 手机短号
- ipvsadm命令的用法
- Android的smali动态调试方法
- linux 定时自动异地备份
- eclipse常用快捷键
- ntpd vs. ntpdate
- Android 动画原理(一)
- HTTP接口例子
- React Native-8.React Native TextInput组件详解
- 一位优秀的Leader应该做好的8件事
- 如何处理服务器SSL收到了一个弱临时Diffie-Hellman 密钥?
- Jsp与servlet的区别
- ElasticSearch使用教程四(ElasticSearch查询详解)
- Android 数据恢复 view的id
- 输入两个数,求最大公约数和最小公倍数
- internal c# 关键字的理解
- django url调度
- windos下dos常用操作
- 魔兽世界私服Trinity-core分析
- Ionic学习笔记七 Cordova 文件下载插件的使用