내 인생 이대로 ㅈ될 수 없다

https://www.acmicpc.net/problem/7569

내 풀이

import sys
from collections import deque as dq

input = sys.stdin.readline

def solution():
    M,N,H = map(int,input().split())

    maps = [[list(map(int,input().split())) for _ in range(N)] for _ in range(H)]

    dx = [1,-1,0,0,0,0]
    dy = [0,0,1,-1,0,0]
    dz = [0,0,0,0,1,-1]
    q = dq()
    def bfs():
        
        while q:
            z,x,y= q.popleft()
            for i in range(6):
                nx = x + dx[i]
                ny = y + dy[i]
                nz = z + dz[i]
                if 0<=nx <N and 0<=ny <M and 0<=nz <H:
                    if maps[nz][nx][ny] == 0 :
                        maps[nz][nx][ny] = maps[z][x][y] + 1
                        q.append((nz,nx,ny))

    for i in range(H):
        for j in range(N):
            for k in range(M):
                if maps[i][j][k] == 1:
                    q.append((i,j,k))

    bfs()
    check = 0
    days = -2
    for i in range(H):
        for j in range(N):
            for k in range(M):
                if maps[i][j][k] == 0:
                    check =1

                days = max(days,maps[i][j][k])

    if check ==1:
        print(-1) 
    elif days ==-1:
        print(0)
    else:
        print(days-1)



solution()

7576 번의 확장버전이다. 처음으로 z축이 붙은 문제를 풀어봤는데, 접근 자체는 같게 하면됐다. 

다른사람의 풀이

https://www.acmicpc.net/problem/7576

내 풀이

import sys
from collections import deque
input = sys.stdin.readline

def solution():
    m,n = map(int,input().split())
    graph = [list(map(int,input().split())) for _ in range(n) ]

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

    def bfs():
        q = deque()
        for i in range(n):
            for j in range(m):
                if graph[i][j]==1:
                    q.append([i,j])
        while q:
            x,y = q.popleft()
            for i in range(4):
                nx = x + dx[i]
                ny = y+ dy[i]

                if 0<=nx<n and 0<=ny <m:
                    if graph[nx][ny] == 0:
                        q.append((nx,ny))
                        graph[nx][ny] = graph[x][y] + 1
    bfs()
    left_over = False
    max_days = -1
    for i in range(n):
        for j in range(m):
            if graph[i][j]==0:
                left_over = True
            max_days = max(max_days,graph[i][j])
    if left_over:
        print(-1)
    else:
        print(max_days-1)        

solution()

많이들 그랬을꺼같은데 N,M 가(로세로) 생각을 잘 해야한다. 아무생각없이 하면 틀린다.

다른사람의 풀이