https://www.acmicpc.net/problem/12904 - 시간 초과 (BFS 정순)import sysfrom collections import dequeinput = sys.stdin.readlinedef checkStr(xx): dq = deque() dq.append(xx) check = 0 while dq: now = dq.popleft() # 단어가 같으면 1 리턴 if now == T: return 1 # 길이가 더 길어지면 now 건너뛰기 elif len(now) > max_in: continue # 두가지 경우 모두 해서 dq에 ..
https://www.acmicpc.net/problem/9205 import sysfrom collections import dequeinput = sys.stdin.readlinedef bfs(house_x, house_y): dq = deque() dq.append((house_x, house_y)) while dq: x, y = dq.popleft() # 20병으로 페스티벌에 갈수 있으면 bfs 종료 if abs(x-festival[0]) + abs(y-festival[1])
https://www.acmicpc.net/problem/2589 from collections import dequeimport sysinput = sys.stdin.readlineN, M = map(int, input().split(" "))main_map = []for _ in range(N): main_map.append(list(input()))def bfs(i, j): dx = [1, -1, 0, 0] dy = [0, 0, 1, -1] dq = deque() # deque에 x, y, 시간 저장 dq.append((i, j, 0)) visited = [[0]*M for _ in range(N)] visited[i][j] = 1 cnt = 0 ..
https://www.acmicpc.net/problem/7576 - 오답 코드 (시간 초과)import sysfrom collections import dequeinput = sys.stdin.readlinedef bfs(tomato_map): dq = deque() for i in range(N): for j in range(M): if tomato_map[i][j] == 1: dq.append((i, j)) cursor = [(-1,0), (1,0), (0,-1), (0,1)] change = False while dq: x, y = dq.popleft() for dx, dy in ..
