HDOJ 1010:Tempter of the Bone 迷宫问题 解题报告
来源:互联网 发布:dll不兼容windows 编辑:程序博客网 时间:2024/06/08 05:54
Tempter of the Bone
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30012 Accepted Submission(s): 8167
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
//HDOJ_1010.cpp : Tempter of the Bone//迷宫问题 深度优先搜索#include "StdAfx.h"#include <fstream>#include <iostream>using namespace std;bool result;char s[7][7];int f[10][10];int mx[]={1,0,-1,0};int my[]={0,1,0,-1};struct pos{ int x; int y;};bool search(int x,int y,int dx,int dy,int t){if( t==0 ){if ( x==dx && y==dy ) return 1;else return 0;}if( abs(x-dx)+abs(y-dy) > t )return 0;f[x][y]=0;//标0表示已经走过该点for( int i=0; i<4; i++ )if (result==0 && f[x+mx[i]][y+my[i]]==1) result=search(x+mx[i],y+my[i],dx,dy,t-1);f[x][y]=1;//标1表示放弃走该点 恢复原状return result;}void process(int n,int m,int t){int i, j, sx, sy, dx, dy, count=0;memset(f,0,sizeof(f));result = 0;//每轮初始化为假 清空上次可能的成功记录for( i=1; i<=n; i++ ){//处理地图数据for ( j=1; j<=m; j++ ){if( s[i][j]!='X' ){f[i][j]=1;//1表示可通行count++;}if( s[i][j]=='S' ){sx=i; sy=j;}if( s[i][j]=='D' ){dx=i; dy=j;}}}if( (dx+dy-sx-sy+t)%2!=0 || dotNum<t || search(sx,sy,dx,dy,t)==0 )cout << "NO" << endl;else cout << "YES" << endl;}int main(){int i,j,n,m,t;ifstream cin("1010_input.txt");//调试用while ( cin >> n >> m >> t && n!=0 ){for( i=1; i<=n; i++ )//n为行数for( j=1; j<=m; j++ )cin >> s[i][j];process(n,m,t);}system("pause");return 0;}
- HDOJ 1010:Tempter of the Bone 迷宫问题 解题报告
- HDOJ 1010 Tempter of the Bone解题报告
- 【解题报告】hdu1010 Tempter of the Bone
- HDU 1010 Tempter of the Bone 解题报告
- hdu 1010 解题报告 ----Tempter of the Bone
- hdu 1010 Tempter of the Bone 解题报告
- Tempter of the Bone(HDU 1010)解题报告
- hdu 1010 Tempter of the Bone 解题报告
- FOJ--1046--Tempter of the Bone--解题报告(典型的迷宫搜索)
- 迷宫 hdu 1010 Tempter of the Bone
- hdoj 1010 Tempter of the Bone
- HDOJ 1010 Tempter of the Bone
- HDOJ 1010 Tempter of the Bone
- HDOJ 1010 Tempter of the Bone
- ACM HDOJ 1010 (Tempter of the Bone)
- HDOJ 1010 Tempter of the Bone
- HDOJ 1010 Tempter of the Bone
- HDoj-1010-Tempter of the Bone-DFS
- HDOJ 1239:Calling Extraterrestrial Intelligence Again 解题报告
- 内部类实现机制
- 多线程计数器锁存器---CountDownLatch
- Oracle中TO_DATE格式
- 从地址栏输入到页面显示 -深入探究web运行机制
- HDOJ 1010:Tempter of the Bone 迷宫问题 解题报告
- 简单存储过程示例优化。。。多列取最小值
- linux 数据流重导向
- ASP.NET学习笔记[4] - 无法分析从服务器在通过调用 Response.Write()
- 【Cortex-M0】4 ARM微微控制器的指令集
- 基于Socket的通信机制-有连接通信方式:多线程通信
- Android图形系统分析与移植--六、framebuffer研究
- VS2010与SVN
- Android之短信发送器