复试训练——搜索——深度优先遍历(DFS)
2017-02-10 00:00
113 查看
题目1461:Tempter of the bone
时间限制:1 秒
内存限制:128 兆
特殊判题:否
提交:2230
解决:779
题目描述:
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 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.
输出:
For each test case, print in one line "YES" if the doggie can survive, or "NO" otherwise.
样例输入:
样例输出:
提示:
用scanf读取输入。
代码:
时间限制:1 秒
内存限制:128 兆
特殊判题:否
提交:2230
解决:779
题目描述:
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 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.
输出:
For each test case, print in one line "YES" if the doggie can survive, or "NO" otherwise.
样例输入:
4 4 5 S.X. ..X. ..XD .... 3 4 5 S.X. ..X. ...D 0 0 0
样例输出:
NO YES
提示:
用scanf读取输入。
代码:
#include <stdio.h> char maze[8][8]; int n,m,t; bool success; int go[][2]={ 1,0, -1,0, 0,1, 0,-1 }; void DFS(int x,int y,int time){ int i; for(i=0;i<4;i++){ int nx=go[i][0]+x; int ny=go[i][1]+y; if(nx<1||nx>n||ny<1||ny>m) continue; if(maze[nx][ny]=='X')continue; if(maze[nx][ny]=='D'){ if(time+1==t){ success=true; return; } else continue; } maze[nx][ny]='X'; DFS(nx,ny,time+1); maze[nx][ny]='.'; if(success) return; } } int main(){ while(scanf("%d%d%d",&n,&m,&t)!=EOF){ if(n==0&&m==0&&t==0) break; int i; for(i=1;i<=n;i++){ scanf("%s",maze[i]+1); } success=false; int sx,sy; for(i=1;i<=n;i++){ int j; for(j=1;j<=m;j++){ if(maze[i][j]=='D'){ sx=i; sy=j; } } } for(i=1;i<=n;i++){ int j; for(j=1;j<=m;j++){ if(maze[i][j]=='S'&&(i+j)%2==((sx+sy)%2+t%2)%2){ maze[i][j]='X'; DFS(i,j,0); } } } puts(success==true ? "YES":"NO"); } return 0; }
相关文章推荐
- 复试训练——搜索——递归的应用
- 复试训练——搜索——递归
- DFS-BFS搜索专题【经典训练题】【有时间一个个做下来】
- 复试训练——搜索——广度优先搜索(BFS)
- 复试训练——搜索——枚举
- 深度优先遍历(搜索)(DFS)
- 蓝桥杯 算法训练 单词接龙 _DFS_搜索 字符串比较
- DFS-BFS搜索专题【经典训练题】【有时间一个个做下来】
- 复试训练——动态规划——背包
- DFS深度优先搜索结合剪枝的应用
- HDU 1312(搜索题,DFS)
- hdu1372 dfs搜索之国际象棋的马
- UVA225 Golygons 【搜索, dfs】
- USACO 4.2 cowcycle 搜索 DFS
- poj2531--Network Saboteur(搜索练习7-dfs或随机算法)
- 2016春季训练——搜索和优先队列
- (搜索DFS,剪枝)Additive equations
- 杭电4499 Cannon DFS 搜索
- 暑假训练1-搜索专题
- HDOJ-1501 字符排列问题[字符搜索DFS()]