알고리즘: 백준 13549번 숨바꼭질 (feat. python)

 

13549번: 숨바꼭질 3

 

 

import sys
from collections import deque
read = sys.stdin.readline
N, K = map(int, read().split())
MAX = 100000
visit = [False for _ in range(MAX + 1)]
def bfs():
    queue = deque()
    queue.append(N)
    count = deque()
    count.append(0)
    min = MAX
    while queue:
        node = queue.popleft()
        cnt = count.popleft()
        if node == K:
            if min > cnt:
                min = cnt
        if cnt >= min:
            continue
        if not visit[node]:
            visit[node] = True
            if 0 <= node*2 <= MAX:
                queue.appendleft(node*2)
                count.appendleft(cnt)
            if 0 <= node+1 <= MAX:
                queue.append(node+1)
                count.append(cnt + 1)
            if 0 <= node-1 <= MAX:
                queue.append(node-1)
                count.append(cnt + 1)
    return min

print(bfs())