ZOJ - 2110 Tempter of the Bone
来源:互联网 发布:新网域名客服 编辑:程序博客网 时间:2024/06/07 23:41
Tempter of the Bone
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 97076 Accepted Submission(s): 26342
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
Author
ZHANG, Zheng
Source
ZJCPC2004
Recommend
JGShining
#include<string>#include<algorithm>#include<iostream>#include<cstring>#include<cstdio>#include <vector>#include <queue>#include <set>#include <map>#include <math.h>#include <stdlib.h>#include <time.h>#include<iomanip>using namespace std;char maze[9][9];int si,sj,ei,ej,t,n,m;int flag;int direction[4][2]= {{0,1},{0,-1},{1,0},{-1,0}};void D(int px,int py,int time){ int i; if(flag==1)return; if(maze[px][py]=='X')return; if(px==ei&&py==ej&&time==t) { flag=1; return; } if(px<1||px>n||py<1||py>m)return; if(time>t)return; for(i=0; i<4; i++) { maze[px][py]='X'; D(px+direction[i][0],py+direction[i][1],time+1); maze[px][py]='.'; if(flag==1)return; }}int main(){ int i,j,block; char temp; while(cin>>n>>m>>t) { block=0; flag=0; if(n==0&&m==0&&t==0)break; for(i=1; i<=n; i++) { for(j=1; j<=m; j++) { cin>>maze[i][j]; if(maze[i][j]=='S') { si=i; sj=j; continue; } if(maze[i][j]=='X') { block++; continue; } if(maze[i][j]=='D') { ei=i; ej=j; } } } if(t>=(n*m-block)) { cout<<"NO"<<endl; continue; } if((ei-si-sj+ej+t)%2==1) { cout<<"NO"<<endl; continue; } D(si,sj,0); if(flag==1)cout<<"YES"<<endl; else cout<<"NO"<<endl; } return 0;}
0 0
- zoj 2110 Tempter of the Bone
- ZOJ 2110 Tempter of the Bone
- Zoj 2110 Tempter of the Bone
- ZOJ 2110 Tempter of the Bone
- ZOJ:2110 Tempter of the Bone
- ZOJ 2110 Tempter of the Bone
- ZOJ - 2110 Tempter of the Bone
- ZOJ 2110 Tempter of the Bone
- ZOJ 2110 Tempter of the Bone
- ZOJ 2110 Tempter of the Bone
- ZOJ Tempter of the Bone
- ZOJ-2110 Tempter of the Bone( 搜索,奇偶性剪枝)
- zoj 2110(hdu 1010)Tempter of the Bone(深搜)
- zoj 2110 || hdoj 1010 Tempter of the Bone(DFS)
- ZOJ 2110 Tempter of the Bone DFS搜索+奇偶剪枝
- ZOJ 2110 Tempter of the Bone 搜索 DFS 解法
- ZOJ 2110 Tempter of the Bone (DFS+减枝)
- ZOJ Problem Set - 2110 Tempter of the Bone
- 循环冗余检验CRC(Cyclic Redundancy Check)
- 判断字符串是否为格式正确的数字的方法
- nyoj242
- Blog Start
- 推荐5个非常酷的医疗健康APP
- ZOJ - 2110 Tempter of the Bone
- 草泥马的FreeBSD
- JavaScript_Math
- hdoj 5615 Jam's math problem 【求根式】
- 如何查看Spark集群运行结束的日志
- SGI STL源码下载地址
- Wunder Fund Round 2016 (Div. 1 + Div. 2 combined) B Guess the Permutation (两种做法,水题的一点点思考)
- 关于getScrollX的理解
- Codevs_P1250 Fibonacci数列(矩阵快速幂)