[Python] BOJ 7569 - 토마토(BFS)

www.acmicpc.net/problem/7569

7569번: 토마토

 

 

import sys
from collections import deque
input = sys.stdin.readline
q = deque()
M, N, H = map(int,input().split())
dx, dy, dz = [1,-1,0,0,0,0], [0,0,-1,1,0,0], [0,0,0,0,-1,1]
m = [[list(map(int,input().split())) for _ in range(N)] for _ in range(H)]
visited = [[[0 for _ in range(M)] for _ in range(N)] for _ in range(H)]
def bfs():
	while q:
		z, x, y = q.popleft()
		visited[z][x][y] = 1
		for i in range(6):
			nx, ny, nz = x + dx[i], y + dy[i], z + dz[i]
			if 0 <= nx < N and 0 <= ny < M and 0 <= nz < H and m[nz][nx][ny] == 0 and not visited[nz][nx][ny]:
				m[nz][nx][ny] = m[z][x][y] + 1
				visited[nz][nx][ny] = 1
				q.append([nz,nx,ny])
				
for i in range(N):
	for j in range(M):
		for k in range(H):
			if m[k][i][j] == 1:
				q.append([k,i,j])
bfs()
time = 0
tf = False
for i in range(N):
	for j in range(M):
		for k in range(H):
			if m[k][i][j] == 0:
				tf = True
			time = max(time, m[k][i][j])
if tf:
	print(-1)
else:
	print(time-1)