BFS (2) 썸네일형 리스트형 백준 9019번: DSLR 파이썬 코드(BFS) import sys from collections import deque t = int(sys.stdin.readline()) def bfs(a1,b1): queue = deque([]) queue.append([a1, ""]) visited = [0 for _ in range(10000)] while queue: now, string = queue.popleft() if now == b1: return string #D--------------------------------- temp2 = now now = now * 2 if now > 9999: now = now % 10000 if visited[now] == 0: queue.append([now, string + "D"]) visited[now].. 백준 13549번: 숨바꼭질 3 파이썬 코드(bfs) import sys from collections import deque n,k = map(int,sys.stdin.readline().split()) x = [-1, 1, 2] ll = [] def bfs(now,target): queue = deque([]) visited = [0 for _ in range(300009)] queue.append([now,0]) while queue: q,c = queue.popleft() visited[q] = 1 if q == target: count = c ll.append(count) for i in range(3): if i == 2: a = q * 2 if visited[a] == 0 and 0 이전 1 다음
