HDU 1010 Tempter of the Bone 搜索 奇偶剪枝
来源:互联网 发布:异度空间知乎 编辑:程序博客网 时间:2024/06/05 02:58
Tempter of the Bone
Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u
Submit
Status
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
奇偶剪枝介绍:http://baike.baidu.com/link?url=rK5EDG5BHBHhB2OUPGhBW42wuWa9TQzFY_hOR8XN00hPZrxooywdnekKYdUb-RaoCkX_cq5fGeA4n0GM_Vwxwq
现在还处于只有看别人题解才能写出来的阶段..太弱了
#include<iostream>#include<stdio.h>#include<cstring>#include<vector>#include<math.h>#include<sstream>#include<algorithm>using namespace std;const int MAX=10;const int dR[4]= {-1,0,0,1};const int dC[4]= {0,1,-1,0};int n,m,t,end_i,end_j;bool visited[MAX][MAX],flag,ans;char pic[MAX][MAX];int abs(int a,int b){ if(a<b) return b-a; else return a-b;}void DFS(int i,int j,int c){ if(flag) return ; if(c>t) return ; if(i<0||i>=n||j<0||j>=m) { return ; } if(pic[i][j]=='D'&&c==t) { flag=ans=true; return ; } int temp=abs(i-end_i)+abs(j-end_j); temp=t-temp-c; if(temp&1) return ;//奇偶剪枝 for (int a=0; a<4; a++) if(!visited[i+dR[a]][j+dC[a]]&&pic[i+dR[a]][j+dC[a]]!='X') { visited[i+dR[a]][j+dC[a]]=true; DFS(i+dR[a],j+dC[a],c+1); visited[i+dR[a]][j+dC[a]]=false; }}int main(){ int i,j,x,y,k; while(cin>>m>>n>>t&&(m||n||t)) { memset(visited,false,sizeof(visited)); k=0; for(i=0; i<n; i++) { for(j=0; j<m; j++) { cin>>pic[i][j]; if(pic[i][j]=='S') { x=i; y=j; visited[i][j]=true; } else if(pic[i][j]=='D') { end_i=i; end_j=j; } else if(pic[i][j]=='X')k++; } } ans=flag=false; if(n*m-k-1>=t) DFS(x,y,0); if(ans) cout<<"YES"<<endl; else cout<<"NO"<<endl; } return 0;}
- hdu 1010 Tempter of the Bone(搜索+奇偶剪枝)
- hdu 1010 Tempter of the Bone(搜索+奇偶剪枝)
- HDU 1010 Tempter of the Bone (搜索 + 奇偶剪枝)
- HDU-1010-Tempter of the Bone(搜索奇偶剪枝)
- HDU 1010 Tempter of the Bone 搜索 奇偶剪枝
- 1010 Tempter of the Bone 深度搜索 奇偶剪枝
- HDOJ 1010 Tempter of the Bone(搜索,奇偶剪枝)
- hdoj--1010--Tempter of the Bone(搜索+奇偶剪枝)
- hdu 1010Tempter of the Bone(经典奇偶剪枝)
- hdu 1010 Tempter of the Bone 奇偶剪枝
- HDU 1010 Tempter of the Bone(奇偶剪枝)
- HDU 1010 Tempter of the Bone - (DFS) 奇偶剪枝
- HDU 1010 Tempter of the Bone(DFS+奇偶剪枝)
- hdu 1010 Tempter of the Bone(dfs+奇偶剪枝)
- hdu 1010 Tempter of the Bone(dfs+奇偶剪枝)
- HDU--1010 -- Tempter of the Bone [DFS+经典奇偶剪枝]
- HDU 1010Tempter of the Bone(奇偶剪枝回溯dfs)
- Hdu 1010 Tempter of the Bone (DFS 经典奇偶剪枝)
- [Asp.Net]登录协同工作平台安全解决方案(优化版)
- cocoapods插件不能使用的解决方法
- 【嵌入式学习日记】2016年7月22日
- cocos实现按钮多种状态监听
- 百鸡问题
- HDU 1010 Tempter of the Bone 搜索 奇偶剪枝
- LaTeX双线页眉
- FFT:快速傅里叶变换与高精度乘法
- iOS 应用程序开发官方中文手册
- 为什么要内存对齐
- Linux文件处理命令
- Notification,PendingIntent和Intent区别,Phone联系人数据表,存放地址
- 构造方法
- poj2484A Funny Game+对称博弈