Poj 2251 Dungeon Master

最新推荐文章于 2020-12-28 22:29:39 发布

诺诺罗亚.

最新推荐文章于 2020-12-28 22:29:39 发布

阅读量257

点赞数 1

分类专栏：搜索算法

本文链接：https://blog.csdn.net/RoronoaDZoro/article/details/92803883

版权

算法同时被 2 个专栏收录

13 篇文章 0 订阅

订阅专栏

搜索

3 篇文章 0 订阅

订阅专栏

简单的三维BFS
因为mark数组定义成了char型 wa了好多次（一定要细心）
附AC代码

#include<iostream>
#include<queue>
using namespace std;
char Map[100][100][100];
int Mark[100][100][100];
int n, m, l;
int Dir[6][3] = { { 1,0,0 },{ -1,0,0 },{ 0,1,0 },{ 0,-1,0 },{ 0,0,1 },{ 0,0,-1 } };
struct Pos2251
{
	int x, y, z, step;
};
bool IsTruePos(int x, int y, int z)
{
	if (x < 0 || y < 0 || z < 0 || x >= n || y >= m || z >= l || Map[x][y][z] == '#')
	{
		return false;
	}
	return true;
}
int main()
{

	while (cin >> n >> m >> l)
	{
		if (n == 0 && m == 0 && l == 0)
		{
			break;
		}
		int nStartX, nStartY, nStartZ;
		int nEndX, nEndY, nEndZ;
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < m; j++)
			{
				for (int k = 0; k < l; k++)
				{
					cin >> Map[i][j][k];
					if (Map[i][j][k] == 'S')
					{
						nStartX = i;
						nStartY = j;
						nStartZ = k;
					}
					if (Map[i][j][k] == 'E')
					{
						nEndX = i;
						nEndY = j;
						nEndZ = k;
					}
				}
				getchar();
			}
			getchar();
		}
		memset(Mark, -1, sizeof(Mark));
		Pos2251 vFirst;
		vFirst.x = nStartX;
		vFirst.y = nStartY;
		vFirst.z = nStartZ;
		vFirst.step = 0;
		queue<Pos2251> vQue;
		vQue.push(vFirst);
		while (vQue.size() != 0)
		{
			Pos2251 vCurPos = vQue.front();
			vQue.pop();
			Pos2251 vNextPos;
			for (int i = 0; i < 6; i++)
			{
				vNextPos.x = vCurPos.x + Dir[i][0];
				vNextPos.y = vCurPos.y + Dir[i][1];
				vNextPos.z = vCurPos.z + Dir[i][2];
				vNextPos.step = vCurPos.step + 1;
				if (!IsTruePos(vNextPos.x, vNextPos.y, vNextPos.z))
				{
					continue;
				}
				if (vNextPos.step < Mark[vNextPos.x][vNextPos.y][vNextPos.z] || Mark[vNextPos.x][vNextPos.y][vNextPos.z] == -1)
				{
					Mark[vNextPos.x][vNextPos.y][vNextPos.z] = vNextPos.step;
					vQue.push(vNextPos);
				}
			}

		}
		if (Mark[nEndX][nEndY][nEndZ] == -1)
		{
			printf("Trapped!\n");
		}
		else
		{
			printf("Escaped in %d minute(s).\n", Mark[nEndX][nEndY][nEndZ]);
		}
	}
	return 0;
}