HDU 1010 Tempter of the Bone dfs 奇偶剪枝
2016-04-05 15:28
197 查看
Tempter of the Bone
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 100396 Accepted Submission(s): 27198
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each test case, print in one line "YES" if the doggie can survive, or "NO" otherwise.
[align=left]Sample Input[/align]
4 4 5
S.X.
..X.
..XD
....
3 4 5
S.X.
..X.
...D
0 0 0
[align=left]Sample Output[/align]
NO
YES
[align=left]Author[/align]
ZHANG, Zheng
[align=left]Source[/align]
ZJCPC2004
ACcode:
#include <cstdio> #include <cstring> #include <cmath> #include <iostream> #define maxn 100 using namespace std; char dp[maxn][maxn]; int n,m,t,sx,sy,dx,dy; bool flag; int to[4][2]={0,1,0,-1,1,0,-1,0}; void dfs(int x,int y,int z){ if(x>n||y>m||x<=0||y<=0)return ; if(flag)return; if(x==dx&&y==dy&&z==t){ flag=1; return; } int tmp=(t-z)-abs(x-dx)-abs(y-dy); if(tmp<0||tmp&1)return; for(int i=0;i<4;++i){ int xx=x+to[i][0]; int yy=y+to[i][1]; if(dp[xx][yy]!='X'){ dp[xx][yy]='X'; dfs(xx,yy,z+1); dp[xx][yy]='.'; } } } int main(){ while(~scanf("%d%d%d",&n,&m,&t)&&(n+m+t)){ for(int i=1;i<=n;++i){ for(int j=1;j<=m;++j){ cin>>dp[i][j]; if(dp[i][j]=='S'){ sx=i; sy=j; } if(dp[i][j]=='D'){ dx=i; dy=j; } } } flag=false; dp[sx][sy]='X'; dfs(sx,sy,0); printf(flag?"YES\n":"NO\n"); } return 0; }
相关文章推荐
- wifidog 源码初分析(二)
- 虚拟机深入学习
- SAP Basis系统管理中重置用户缓冲哪些需要注意
- oracle11g单机静默安装
- 团队开发成员以及题目
- 如何修改Android Studio中默认生成的注释信息
- 如何在Windows7(IIS7)环境下安装 PHP-OK
- Java多线程技术之CyclicBarrier
- 虚拟机调用函数是栈堆之间的变化
- Python-MySQL
- git 强制覆盖本地
- 策略模式
- 一文搞懂Matlab画图那些事(上篇)
- ORMLite完全解析(二)官方文档第二章、如何使用ORMLite
- 编写轻量ajax组件第三篇实现
- SIP transactions and dialogs
- leetcode 114. Flatten Binary Tree to Linked List
- Spring AOP 问与答
- IllegalThreadStateException: Thread already started解决
- CCF 窗口