Конин Георгий/escape-a-large-maze — различия между версиями

class Solution:
    def isEscapePossible(self, blocked: List[List[int]], source: List[int], target: List[int]) -> bool:
 
        blocked = {tuple(p) for p in blocked}
 
        def bfs(source,target):
            queue =  [source]
            visited = {tuple(source)}
 
            for x0,y0 in queue:
                for (i,j) in [(1,0),(-1,0),(0,-1),(0,1)]:
                    x = x0+i
                    y = y0+j 
                    if 0 <= x < 10**6 and 0 <= y < 10**6 and (x,y) not in visited and (x,y) not in blocked:
                        if [x,y] == target: 
                            return True 
                        queue.append([x,y])
                        visited.add((x,y))
 
                if len(queue) == 30000:
                    return True 
 
            return False 
 
        return bfs(source,target) and bfs(target,source)