목록2026/03/09 (1)

chyam

[백준] 2206번, python - 벽 부수고 이동하기

from collections import dequen, m = map(int,input().split())li = []direct = [[0,1],[0,-1],[1,0],[-1,0]]res = float('inf')for i in range(n): li.append(list(map(int,input()))) def bfs(): cnt = 1 queue = deque([(0,0,0,cnt)]) visited = [[[False]*2 for _ in range(m)]for _ in range(n)] visited[0][0][0] = True while queue: x, y,broken, cnt = queue.popleft() # 좌표, 깼는가, 몇번 이동?..
백준 2026. 3. 9. 14:13
이전 Prev 1 Next 다음