HDU 1429

最新推荐文章于 2019-03-18 20:48:45 发布

还是太年轻

最新推荐文章于 2019-03-18 20:48:45 发布

阅读量186

点赞数

分类专栏：搜索

本文链接：https://blog.csdn.net/albertluf/article/details/78690869

版权

搜索专栏收录该内容

46 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<queue>
#include<string.h>
int a, b, c, r;
bool e, f[51][51][51];
using namespace std;
queue<int> P, Q, T;
int main()
{
void dfs(int, int, int, int);
int n; cin >> n;
for (int o = 1; o <= n; o++)
{
cin >> a >> b >> c >> r;
if (a == 1 && b == 1 && c == 1)
{
int u; cin >> u;
if (u == 1)
cout << "-1" << endl;
else cout << '0' << endl;
continue;
}
int ss = P.size();
for (int i = 1; i <= ss; i++)
{
P.pop(); Q.pop(); T.pop();
}
memset(f, true, sizeof(f));
e = false;
for (int i = 0; i < a; i++)
for (int j = 0; j < b; j++)
for (int k = 0; k < c; k++)
{
int y;
scanf_s("%d", &y);
if (y == 1) f[i][j][k] = false;
}
if (f[a - 1][b - 1][c - 1] == false)
{
cout << "-1" << endl; continue;
}
f[0][0][0] = false;
P.push(0); Q.push(0); T.push(0);
for (int i = 1; i <= r; i++)
{
int length = P.size();
for (int j = 1; j <= length; j++)
{
int x1 = P.front(), y1 = Q.front(), z1 = T.front();
dfs(x1 + 1, y1, z1, i); if (e == true) break;
dfs(x1 - 1, y1, z1, i); if (e == true) break;
dfs(x1, y1 - 1, z1, i); if (e == true) break;
dfs(x1, y1 + 1, z1, i); if (e == true) break;
dfs(x1, y1, z1 - 1, i); if (e == true) break;
dfs(x1, y1, z1 + 1, i); if (e == true) break;
P.pop(); Q.pop(); T.pop();
}
if (e == true) break;
}
if (e == false)
cout << "-1";
cout << endl;
}
return 0;
}
void dfs(int i, int j, int k, int l)
{
if (i == a - 1 && j == b - 1 && k == c - 1)
{
cout << l; e = true; return;
}
if (i < 0 || i >= a || j < 0 || j >= b || k < 0 || k >= c) return;
if (f[i][j][k] == false) return;
f[i][j][k] = false;
P.push(i); Q.push(j); T.push(k);
}