from collections import deque def main(maze): directions = [[1, 0], [-1, 0], [0, -1], [0, 1]] length = len(maze) width = len(maze[0]) visited = [[0 for _ in range(width)] for _ in range(length)] step = [[(-1, -1) for _ in range(width)] for _ in range(length)] queue = deque([(0, 0)]) visited[0][0] = ...
