[백준 / Python] 벽 부수고 이동하기_2206
정답 코드 from _collections import deque dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1] n, m = map(int, input().split()) data = [list(map(int, input())) for _ in range(n)] visited = [[[-1, -1] for _ in range(m)] for _ in range(n)] def bfs(): q = deque() q.append((0, 0, 0)) visited[0][0][0] = 1 while q: pop_x, pop_y, flag = q.popleft() for i in range(4): nx, ny = pop_x + dx[i], pop_y + dy[i] if 0
[백준 / Python] 연구소_14502
틀렸던 내 풀이 from _collections import deque from copy import deepcopy n, m = map(int, input().split()) data = [list(map(int, input().split())) for _ in range(n)] dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1] result = [] # 바이러스 퍼뜨리기 def bfs(deep_copy): map = deepcopy(deep_copy) q = deque() virus = find_virus(map) visited = [[False for _ in range(m)] for _ in range(n)] for i in virus: x, y = i q.append((x, y)..