[Python] 프로그래머스 게임 맵 최단거리 & 백준 16953

#프로그래머스 게임 맵 최단거리

from collections import deque

def solution(maps):
    n, m = 0, 0
    for _ in range(len(maps)):
        n += 1
    for _ in maps[0]:
        m += 1
    d_row = [0, -1, 0, 1]
    d_col = [1, 0, -1, 0]
    queue = deque()
    queue.append([0,0])
    maps[0][0] = 1
    while queue:
        x, y = queue.popleft()
        if x == n-1 and y == m-1:
            return maps[n-1][m-1]
        for d in range(4):
            nx = x + d_row[d]
            ny = y + d_col[d]
            if 0<= nx < n and 0<=ny<m:
                if maps[nx][ny] == 1:
                    queue.append([nx,ny])
                    maps[nx][ny] = maps[x][y] + 1

    return -1

#백준 16953

n, m = map(int, input().split())
from collections import deque
def bfs(n, m):
    queue = deque()
    queue.append([n, 1])
    visited = [n]
    while queue:
        x, cnt = queue.popleft()
        if x == m:
            return cnt
        for nx in (x*2, int("".join([str(x), str(1)]))):
            if 0<nx <= m and nx not in visited:
                queue.append([nx, cnt+1]) #cnt도 queue에 같이 넣어주는게 중요하다!!!
                visited.append(nx)

    return -1

print(bfs(n,m))

백준 16953번은 PyPy3로 해야 시간초과가 나지 않는다ㅠ_ㅠ