Tempter of the Bone(深搜,回溯)
来源:互联网 发布:淘宝客优惠券软件下载 编辑:程序博客网 时间:2024/04/29 00:46
Tempter of the Bone
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<iostream>
#include<cstring>
#define N 10
using namespace std;
int n,m,t,end_i,end_j;
bool visited[N][N],flag,ans;
char map[N][N];
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(map[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 ;//奇偶剪枝
if(!visited[i-1][j]&&map[i-1][j]!='X')
{
visited[i-1][j]=true;
DFS(i-1,j,c+1);
visited[i-1][j]=false;
}
if(!visited[i+1][j]&&map[i+1][j]!='X')
{
visited[i+1][j]=true;
DFS(i+1,j,c+1);
visited[i+1][j]=false;
}
if(!visited[i][j-1]&&map[i][j-1]!='X')
{
visited[i][j-1]=true;
DFS(i,j-1,c+1);
visited[i][j-1]=false;
}
if(!visited[i][j+1]&&map[i][j+1]!='X')
{
visited[i][j+1]=true;
DFS(i,j+1,c+1);
visited[i][j+1]=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>>map[i][j];
if(map[i][j]=='S')
{
x=i;y=j;
visited[i][j]=true;
}
if(map[i][j]=='D')
{
end_i=i;end_j=j;
}
if(map[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;
}
- Tempter of the Bone(深搜,回溯)
- HDOJ 1010 Tempter of the Bone(深搜+回溯+剪枝)
- Tempter of the Bone解析(回溯算法)hdu1010 zoj2110
- hdu1010 Tempter of the Bone(DFS,剪枝,递归,回溯)
- hdu 1010 Tempter of the Bone 回溯
- Tempter of the Bone -- BFS 回溯 剪枝
- HDU1010(Tempter of the Bone)深搜
- Tempter of the Bone(HDU 深搜)
- hdu1010 Tempter of the Bone (深搜)
- Tempter of the Bone (深搜+剪枝)
- Tempter of the Bone 回溯法 hdu1010 zoj2110
- HDU 1010Tempter of the Bone(奇偶剪枝回溯dfs)
- HDU 1010 Tempter of the Bone(DFS回溯+剪枝)
- hdu 1010 Tempter of the Bone(dfs剪枝+回溯)
- Tempter of the Bone 回溯法 还有奇偶剪枝
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- 状态机的实现
- ora-00257错误,以及oracle字符集
- 【python】Python 关于 name main的使用
- 为你的Android应用定制属于你的BaseActivity
- ssh 核心jar包
- Tempter of the Bone(深搜,回溯)
- hdu 1492
- mongodb replica set
- Java开发中的23种设计模式详解
- jQuery中的 return false, e.preventDefault(), e.stopPropagation()的区别
- 【PB】子数据窗的应用
- excel导入错误:外部表不是预期格式
- n个数进栈,随机出栈,不同顺序数 catalan number
- C++ 如何改写其他进程指定地址的内存