[백준] 1697 파이썬(python)

문제

https://www.acmicpc.net/problem/1697

1697번: 숨바꼭질

 

문제 풀이

import sys
from collections import deque

n, k = map(int, sys.stdin.readline().split())
MAX = (10 ** 5)

def bfs(root, find):
    distance = [0] * (MAX+1)
    queue = deque([root])

    while queue:
        x = queue.popleft()
        if x == find:
            return distance[x]

        for nx in [x - 1, x + 1, x * 2]:
            if 0 <= nx <= MAX and not distance[nx]:
                distance[nx] = distance[x] + 1
                queue.append(nx)

result = bfs(n, k)
print(result)