백준 7562번 : 나이트의 이동(python)

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

7562번: 나이트의 이동

from collections import deque
t = int(input())
dx = [-1,-2,-2,-1,1,2,2,1]
dy = [-2,-1,1,2,2,1,-1,-2]

def bfs(x,y,target_x,target_y):
    if x==target_x and y==target_y:
        return 0
    q = deque()
    q.append((x,y,0))
    while q:
        x, y, count = q.popleft()
        for i in range(8):
            nx, ny = x + dx[i], y + dy[i]
            if 0 <= nx < l and 0 <= ny < l and data[nx][ny] == 0:
                data[nx][ny] = 1
                if nx == target_x and ny == target_y:
                    return count+1
                else:
                    q.append((nx, ny, count+1))

for _ in range(t):
    l = int(input())
    data = [[0]*l for _ in range(l)]
    a,b = map(int,input().split())
    data[a][b] = 1
    target_x,target_y = map(int,input().split())
    print(bfs(a,b,target_x,target_y))