[백준 7569] 토마토 (C++/Python)

C++)

#include <iostream>
#include <algorithm>
#include <queue>
#define MAX_NUM 102
using namespace std;

int dz[6] = { 1,-1,0,0,0,0 };
int dx[6] = { 0,0,1,0,-1,0 };
int dy[6] = { 0,0,0,1,0,-1 };

struct data {
	int z;
	int x;
	int y;
};

int arr[MAX_NUM][MAX_NUM][MAX_NUM];
int visited[MAX_NUM][MAX_NUM][MAX_NUM];
queue<struct data> q;

void bfs(int h, int n, int m) {
	while (!q.empty()) {
		int z = q.front().z;
		int x = q.front().x;
		int y = q.front().y;
		q.pop();

		for (int k = 0; k < 6; k++) {
			int nz = z + dz[k];
			int nx = x + dx[k];
			int ny = y + dy[k];

			if (nz < 0 || nz >= h || nx < 0 || nx >= n || ny < 0 || ny >= m) continue;

			if (arr[nz][nx][ny] == 0 && visited[nz][nx][ny] == 0) {
				visited[nz][nx][ny] = visited[z][x][y] + 1;
				q.push({ nz,nx,ny });
			}
		}
	}
}

int main(void) {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int m, n, h;
	cin >> m >> n >> h;

	for (int k = 0; k < h; k++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				cin >> arr[k][i][j];

				if (arr[k][i][j] == 1) 
					q.push({ k,i,j });
			}
		}
	}

	bfs(h, n, m);

	int ans = -1;
	bool flag = false;
	for (int k = 0; k < h; k++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				if (arr[k][i][j] == 0 && visited[k][i][j] == 0) {
					flag = true;
					break;
				}

				ans = max(ans, visited[k][i][j]);
			}
		}
	}

	(flag) ? cout << "-1" : cout << ans;

	return 0;
}

 

 

 

Python)

# 7569
import sys
from collections import deque

read = sys.stdin.readline

dz = [1,-1,0,0,0,0]
dx = [0,0,1,0,-1,0]
dy = [0,0,0,1,0,-1]

m, n, h = map(int, read().rstrip().split())

arr = []
visited = []
for _ in range(h):
    arr.append(list([0] * m for _ in range(n)))
    visited.append(list([-1] * m for _ in range(n)))

q = deque()
for k in range(h):
    for i in range(n):
        arr[k][i] = list(map(int, read().rstrip().split()))

        for j in range(m):
            if arr[k][i][j] == 1:
                q.append((k,i,j))
                visited[k][i][j] = 0

while q:
    z, x, y = q.popleft()

    for k in range(6):
        nz = z + dz[k]
        nx = x + dx[k]
        ny = y + dy[k]

        if nz < 0 or nz >= h or nx < 0 or nx >= n or ny < 0 or ny >= m:
            continue

        if arr[nz][nx][ny] == 0 and visited[nz][nx][ny] == -1:
            visited[nz][nx][ny] = visited[z][x][y] + 1
            q.append((nz,nx,ny))

flag = False
ans = -1
for k in range(h):
    for i in range(n):
        for j in range(m):
            if arr[k][i][j] == 0 and visited[k][i][j] == -1:
                flag = True
                break

            ans = max(ans, visited[k][i][j])

print(-1 if flag else ans)