思路
三维广搜,就是把偏移量改一下,还有每一个点的各个数值,其实很水。。。
代码
#include <iostream>
#include <queue>
using namespace std;
const int N = 20;
int dx[] = {0,0,0,0,1,-1},dy[] = {1,-1,0,0,0,0},dz[] = {0,0,1,-1,0,0};
int n,m,k;
char g[N][N][N];
int x,y;
bool vis[N][N][N];
struct point {
int x,y,z;
point () {}
point (int a,int b,int c) {
x = a,y = b,z = c;
}
};
queue <point> q;
int main () {
cin >> n >> m >> k;
for (int i = 1;i <= n;i++) {
for (int j = 1;j <= m;j++) {
for (int l = 1;l <= k;l++) cin >> g[i][j][l];
}
}
cin >> x >> y;
queue <point> q;
q.push (point (1,x,y));
int ans = 0;
vis[1][x][y] = true;
while (q.size ()) {
point t = q.front ();
q.pop ();
ans++;
for (int i = 0;i < 6;i++) {
int a = t.x + dx[i],b = t.y + dy[i],c = t.z + dz[i];
if (a < 1 || a > n || b < 1 || b > m || c < 1 || c > k || g[a][b][c] == '#' || vis[a][b][c]) continue;
q.push (point (a,b,c));
vis[a][b][c] = true;
}
}
cout << ans << endl;
return 0;
}
个人还是喜欢
dfs
hhhhhhh
水题倒也不用写那么大的字体哈哈哈哈哈哈哈
az