532 3Ddfs- Dungeon Master
来源:互联网 发布:淘宝蛋刀必出bug 编辑:程序博客网 时间:2024/04/30 14:14
#include <iostream>
#include <cstdio>
#include <cstring>
#define MAX 35
using namespace std;
int q[MAX][MAX][MAX];
int visit[MAX][MAX][MAX];
int sx,sy,sz,ex,ey,ez;
int Q[100000];
int L,R,C;
void input(int x,int y,int z)
{
for(int i = 1;i <= x;i++)
for(int j = 1;j <= y;j++)
{
char s[31];
cin>>s;
for(int k = 1;k <= z;k++)
{
if(s[k-1] != '#'){
q[i][j][k] = 1;
if(s[k-1] == 'S'){
sx = i;sy = j;sz = k;
}
else if(s[k-1] == 'E'){
ex = i;ey = j;ez = k;
}
}
}
}
}
int bfs()
{
//printf("%d %d %d %d %d %d\n",sx,sy,sz,ex,ey,ez);
int dist[MAX][MAX][MAX];
int dx[6] = {-1,1,0,0,0,0};
int dy[6] = {0,0,-1,1,0,0};
int dz[6] = {0,0,0,0,-1,1};
int x,y,z;
int front,rear,d,u;
dist[sx][sy][sz] = 0;
front = rear = 0;
u = sx*10000 + sy*100 + sz;
visit[sx][sy][sz] = 1;
Q[rear++] = u;
while(front < rear)
{
u = Q[front++];
x = u / 10000;
u = u - u/10000*10000;
y = u / 100;
z = u % 100;
// cout<<"++++++++++++++++\n";
// cout<<x<<" "<<y<<" "<<z<<endl;
if(x == ex && y ==ey && z == ez){
// cout<<"in"<<endl;
return dist[x][y][z];
}
//cout<<" _____________________________________\n";
for(d = 0;d < 6;d++)
{
int nx = x + dx[d],ny = y + dy[d],nz = z + dz[d];
//cout<<nx<<" "<<ny<<" "<<nz<<endl;
if(nx >=1 && nx <=L && ny >=1 && ny <= R &&
nz >=1 && nz <=C && !visit[nx][ny][nz] &&
q[nx][ny][nz]){
int v = nx*10000 + ny*100 + nz;
Q[rear++] = v;
visit[nx][ny][nz] = 1;
dist[nx][ny][nz] = dist[x][y][z]+1;
}
}
}
return 0;
}
int main()
{
while(cin>>L>>R>>C)
{
if(!L && !R && !C)
break;
memset(q,0,sizeof(q));
memset(visit,0,sizeof(visit));
input(L,R,C);
int temp = bfs();
if(temp)
printf("Escaped in %d minute(s).\n",temp);
else
cout<<"Trapped!"<<endl;
}
return 0;
}
#include <cstdio>
#include <cstring>
#define MAX 35
using namespace std;
int q[MAX][MAX][MAX];
int visit[MAX][MAX][MAX];
int sx,sy,sz,ex,ey,ez;
int Q[100000];
int L,R,C;
void input(int x,int y,int z)
{
for(int i = 1;i <= x;i++)
for(int j = 1;j <= y;j++)
{
char s[31];
cin>>s;
for(int k = 1;k <= z;k++)
{
if(s[k-1] != '#'){
q[i][j][k] = 1;
if(s[k-1] == 'S'){
sx = i;sy = j;sz = k;
}
else if(s[k-1] == 'E'){
ex = i;ey = j;ez = k;
}
}
}
}
}
int bfs()
{
//printf("%d %d %d %d %d %d\n",sx,sy,sz,ex,ey,ez);
int dist[MAX][MAX][MAX];
int dx[6] = {-1,1,0,0,0,0};
int dy[6] = {0,0,-1,1,0,0};
int dz[6] = {0,0,0,0,-1,1};
int x,y,z;
int front,rear,d,u;
dist[sx][sy][sz] = 0;
front = rear = 0;
u = sx*10000 + sy*100 + sz;
visit[sx][sy][sz] = 1;
Q[rear++] = u;
while(front < rear)
{
u = Q[front++];
x = u / 10000;
u = u - u/10000*10000;
y = u / 100;
z = u % 100;
// cout<<"++++++++++++++++\n";
// cout<<x<<" "<<y<<" "<<z<<endl;
if(x == ex && y ==ey && z == ez){
// cout<<"in"<<endl;
return dist[x][y][z];
}
//cout<<" _____________________________________\n";
for(d = 0;d < 6;d++)
{
int nx = x + dx[d],ny = y + dy[d],nz = z + dz[d];
//cout<<nx<<" "<<ny<<" "<<nz<<endl;
if(nx >=1 && nx <=L && ny >=1 && ny <= R &&
nz >=1 && nz <=C && !visit[nx][ny][nz] &&
q[nx][ny][nz]){
int v = nx*10000 + ny*100 + nz;
Q[rear++] = v;
visit[nx][ny][nz] = 1;
dist[nx][ny][nz] = dist[x][y][z]+1;
}
}
}
return 0;
}
int main()
{
while(cin>>L>>R>>C)
{
if(!L && !R && !C)
break;
memset(q,0,sizeof(q));
memset(visit,0,sizeof(visit));
input(L,R,C);
int temp = bfs();
if(temp)
printf("Escaped in %d minute(s).\n",temp);
else
cout<<"Trapped!"<<endl;
}
return 0;
}
- 532 3Ddfs- Dungeon Master
- 532 3Ddfs- Dungeon Master
- uva 532 - Dungeon Master
- 532 - Dungeon Master(***)
- uva 532 - Dungeon Master
- UVaOJ 532 - Dungeon Master
- uva 532 - Dungeon Master
- uva 532 - Dungeon Master
- uva-532 - Dungeon Master
- UVa 532 - Dungeon Master
- 532 - Dungeon Master
- UVa 532 - Dungeon Master
- UVA 532 - Dungeon Master
- UVA 532 - Dungeon Master
- 532 - Dungeon Master//bfs
- UVA 532 - Dungeon Master
- UVa 532Dungeon Master
- uva 532 - Dungeon Master
- 532 3Ddfs- Dungeon Master
- Sql Server2005卸载重装
- android中The connection to adb is down,问题和解决
- linux ns2安装--libotcl安装错误(转)
- 黑马程序员Java基础加强41-48学习日记
- 532 3Ddfs- Dungeon Master
- 温州高铁事故再一次用N条生命有力地证明了中国高铁具有自主的知识产权。绝对不存在剽窃其它国家的先进的技术成果。
- C语言:格式控制符
- 如何使用VS2008打开VS2010的解决方案
- Java继承,创建对象初始化顺序
- javascript解析XML生成树形结构
- 关于编程,大学没有传授的10件事
- 黑马程序员Java基础加强49-56学习日记
- 社交网络成美国雇主应聘者背景调查渠道