hdu 1010 Tempter of the Bone 深搜+剪枝
来源:互联网 发布:淘宝拍卖和个人闲置 编辑:程序博客网 时间:2024/06/06 06:38
Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionThe 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.InputThe 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.OutputFor each test case, print in one line "YES" if the doggie can survive, or "NO" otherwise.Sample Input4 4 5S.X...X...XD....3 4 5S.X...X....D0 0 0 Sample OutputNOYES
Difficulty: DFS+奇偶剪枝
#include<cstdio>#include<cstring>#include<cmath>int vis[1000][1000];char map[1000][1000];int flag,n,m,t,sx,sy,ex,ey;int dx[]={-1,1,0,0};int dy[]={0,0,-1,1};int abs(int p){ return p>=0?p:-p;}bool isover(int x,int y){ if(x>=n||x<0||y>=m||y<0) return 1; return 0;}void dfs(int x,int y,int sum){ if(flag==1) return; if(map[x][y]=='D'&&sum==t)//目标状态:步数为,坐标位置为D; {flag=1; return;} int mindis=abs(x-ex)+abs(y-ey); /*当前点到终点的最短距离*/ if(mindis>t-sum||(mindis+ t-sum )%2!=0) return;//奇偶剪枝 for(int i=0;i<4;i++)//扩展方式:上下左右; {int nx=x+dx[i]; int ny=y+dy[i]; if(!vis[nx][ny]&&!isover(nx,ny)&&map[nx][ny]!='X') {vis[nx][ny]=1; dfs(nx,ny,sum+1); //printf("%d %d\n",nx,ny); vis[nx][ny]=0; }}}int main(){while(~scanf("%d%d%d",&n,&m,&t)){if(n==0&&m==0&&t==0)break;memset(vis,0,sizeof(vis));flag=0;for(int i=0;i<n;i++){scanf("%s",map[i]);for(int j=0;j<m;j++){if(map[i][j]=='S'){ sx=i; sy=j;}if(map[i][j]=='D'){ ex=i; ey=j;}}}vis[sx][sy]=1;dfs(sx,sy,0);//初始状态:S的位置坐标,步数为0;if(flag==1)printf("YES\n");elseprintf("NO\n");}return 0;}
0 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 深搜+奇偶剪枝
- HDU 1010 Tempter of the Bone(深搜+剪枝)
- HDU 1010 Tempter of the Bone 【深搜+奇偶剪枝】
- HDOJ/HDU Tempter of the Bone(深搜+奇偶性剪枝)
- hdu 1010 Tempter of the Bone(搜索+剪枝)
- hdu 1010Tempter of the Bone(经典奇偶剪枝)
- hdu 1010 Tempter of the Bone 奇偶剪枝
- hdu 1010 Tempter of the Bone(DFS+剪枝优化)
- 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+奇偶剪枝)
- IOS 多线程,线程同步的三种方式
- 相互递归绑定让Observer更安全
- ZZH的函数
- .net知识要点
- POJ 3087 Shuffle'm Up
- hdu 1010 Tempter of the Bone 深搜+剪枝
- iOS_(id)sender
- Uboot启动过程详解
- Android UI2
- 全新android Tab控件PagerSlidingTabStrip最简使用方法
- 开始写博客
- 运算符重载
- 对比传统关系型数据库,NoSQL有着非常显著的性能和扩展性优势,然而这些优点却建立在一些关键功能的丢失之上,比如事务、join等。那么在数据体积激增的当下,究竟哪个数据库才会适合你的场景
- 101到200间的素数及其个数