hdu1010Tempter of the Bone 搜索
来源:互联网 发布:淘宝免费开店步骤 编辑:程序博客网 时间:2024/06/07 22:59
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
搜索 加 奇偶剪枝
如果走偶数步要求的步数是奇数,或者走奇数步要求的步数是偶数,都明显不可行
奇数-偶数 = 奇数,偶数-奇数 = 奇数;
奇数-奇数= 偶数,偶数-偶数=偶数;
因此所剩步数减去最小步数必须是偶数;
此外,最小步数大于所剩步数也是不可以的
#include<stdio.h>#include<string.h>#include<math.h>int n,m,s;int a1,a2,b1,b2;int t[4][2]= {{0,1},{0,-1},{1,0},{-1,0}};char a[10][10];int v[10][10];int flag;void dfs(int x,int y,int step){ if((int)fabs(x-b1)+(int)fabs(y-b2)>s-step||(s-step-(int)fabs(x-b1)-(int)fabs(y-b2))%2!=0) //剪枝 { return; } if(flag==1) return ; if(step==s) { if(x==b1&&y==b2) { flag=1; return ; } } for(int i=0; i<4; i++) { int tx=x+t[i][0]; int ty=y+t[i][1]; if(tx>=0&&tx<n&&ty>=0&&ty<m&&a[tx][ty]!='X'&&v[tx][ty]==0) { v[tx][ty]=1; dfs(tx,ty,step+1); v[tx][ty]=0; } }}int main(){ while(~scanf("%d%d%d",&n,&m,&s)) { if(n==0&&m==0&&s==0) break; flag=0; int sum=0; memset(a,0,sizeof(a)); memset(v,0,sizeof(v)); for(int i=0; i<n; i++) { scanf("%s",a[i]); for(int j=0; j<m; j++) { if(a[i][j]=='S') { a1=i; a2=j; } if(a[i][j]=='D') { b1=i; b2=j; } if(a[i][j]=='X') sum++; } } if(n*m-sum<=s) //所能走的地方小于要走的步数· { printf("NO\n"); continue; } v[a1][a2]=1; dfs(a1,a2,0); if(flag==1) printf("YES\n"); else printf("NO\n"); } return 0;}
0 0
- hdu1010Tempter of the Bone 搜索
- hdu1010Tempter of the Bone
- hdu1010Tempter of the Bone
- hdu1010Tempter of the Bone
- HDU1010Tempter of the Bone
- hdu1010Tempter of the Bone
- HDU1010Tempter of the Bone
- hdu1010Tempter of the Bone(DFS)
- hdu1010Tempter of the Bone dfs+奇偶剪枝
- HDU1010Tempter of the Bone(dfs+奇偶剪枝)
- hdu1010Tempter of the Bone深搜剪枝
- hdu1010Tempter of the Bone(dfs+奇偶剪枝)
- hdu1010Tempter of the Bone(dfs+奇偶剪枝)
- 搜索之Tempter of the Bone
- HDU 1010 Tempter of the Bone (搜索)
- hdu 1010 Tempter of the Bone 搜索
- Tempter of the Bone(路径搜索)
- zoj2110 Tempter of the Bone 搜索dfs
- thinking in java test5.5练习(10)(11)(12)finalize()方法
- Kubernetes入门(三) - 网络
- spring的管理bean和依赖注入的原理剖析
- 计算机视觉和图像处理框架
- fragment中判断网络
- hdu1010Tempter of the Bone 搜索
- web前端总结一DOM性能优化
- 异或应用小总结
- iOS --判断设备是否为越狱设备,防止越狱设备进行iap内购
- java设计模式进阶_property
- Flume官方文档翻译之(三)
- 【用Cocos Creator给暗恋的女生写一个游戏(11)】——(Jump Game) 镜头跟随
- 【如何快速的开发一个简单的iOS直播app】(代码篇)
- 关于移动视频直播技术,关键干货都在这里了(三)编码和封装