Tempter of the Bone
来源:互联网 发布:正则化 约束优化 编辑:程序博客网 时间:2024/05/14 09:34
Tempter of the Bone
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 33445 Accepted Submission(s): 9015
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.
'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.
#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
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the bone
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- Tempter of the Bone
- UVa 10020 - Minimal coverage(区间覆盖)
- 模幂运算 a^b%c
- js获得当前项目的根路径
- 1元钱,可化为多少个1分,2分,5分(每种至少有1个)
- 需要阅读的书籍
- Tempter of the Bone
- System、Runtime、Math、Date、Calendar
- 多线程等待唤醒机制
- oracle游标学习一:
- 662 - Fast Food
- 记录下旧博客地址
- java写文件时,输出不完整的原因以及解决方法close()或flush()
- linux新手接触linux时的基本疑问解析
- Android界面布局中使用GIF动画