HDU1010 Tempter of the Bone DFS
2016-03-20 10:48
453 查看
Tempter of the Bone
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 99555 Accepted Submission(s): 26979
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
题意:给定一个迷宫,X为不可路过点,S为起始点,D为重点,“.”为一般点,每移动一次需要1秒,经过的点不能再经过,问能否恰好在t秒的时候到出口。
解:深搜即可。
代码:
//************************************************************************// //*Author : Handsome How *// //************************************************************************// //#pragma comment(linker, "/STA CK:1024000000,1024000000") #pragma warning(disable:4996) #include <vector> #include <list> #include <map> #include <set> #include <deque> #include <queue> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <complex> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cstring> #include <ctime> #include <cassert> using namespace std; typedef long long LL; char maze[10][10]; int vis[9][9]; int m, n, t; int dx[] = { -1,0,1,0 }; int dy[] = { 0,-1,0,1 }; int doorx, doory; bool check(int x, int y) { return (x >= 0 && x < m&&y >= 0 && y < n); } bool dfs(int x, int y,int now) { if (x == doorx&&y == doory&&now == t) return true; for (int i = 0; i < 4; i++) { if (check(x + dx[i], y + dy[i])) if(vis[x + dx[i]][y + dy[i]]==0) { vis[x + dx[i]][y + dy[i]] = 1; if (dfs(x + dx[i], y + dy[i], now + 1)) return true; vis[x + dx[i]][y + dy[i]] = 0; } } return false; } int main() { while (scanf("%d%d%d", &m,&n,&t) != EOF) { if (m == 0 && n == 0 && t == 0)break; getchar(); memset(vis, 0, sizeof(vis)); doorx = -1; int sx = -1, sy = -1; for (int i = 0; i < m; i++) { scanf("%s", maze[i]); getchar(); } if (t >= m*n) { printf("NO\n"); continue; } for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) { if (maze[i][j] == 'S') { sx = i, sy = j; vis[sx][sy] = 1;} if (maze[i][j] == 'D') { doorx = i, doory = j; } if (maze[i][j] == 'X') { vis[i][j] = 1; } } if ((abs(sx - doorx) + abs(sy - doory) - t) & 1) printf("NO\n"); else if (dfs(sx, sy,0))printf("YES\n"); else printf("NO\n"); } return 0; }
相关文章推荐
- 模拟退火算法的C++实现
- CSS编码规范 - (摘自百度FEX-team)
- vim配置设置参考
- 策略模式
- 第39讲项目3——反序数(2)
- Netty 对通讯协议结构设计的启发和总结
- OSPF多区域配置里的查看路由表时里的O E1 OE2 IA是什么意思
- NBUT1647(基础)
- 编码规范整理
- canvas结合js画字_1
- 第三次上机实践项目-项目3-猜数字游戏
- JDK JRE JVM的区别
- 如何在Windows的命令行下进行程序编译和gdb调试
- 20145304 Java第三周学习报告
- 按照Right-BICEP要求设计四则运算3程序的单元测试用例
- NetBeans中正则表达式替换实例
- YMS Round #1 Div. 2 A Promotion Counting
- 第四周项目1.1-求最大公约数
- 1408: [Noi2002]Robot|快速幂|欧拉函数
- Cocos2d-x 粒子系统之ParticleFire