Submission #2700016

---

Source Code Expand

h, w = map(int, input().split())
maze = {(i,j):c for i in range(h) for j, c in enumerate(input())}
dirs = ((-1, 0), (1, 0), (0, 1), (0, -1))

def bfs01(start, maze=maze, dirs=dirs):
    q = [[start], [], []]
    while q:
        i, j = q[0].pop()
        maze[i, j] = 'X'
        for di, dj in dirs:
            next_ = maze.get((i+di, j+dj), 'X')
            if next_ == 'g':
                return True
            if next_ == 'X' or (next_ == '#' and len(q) == 1):
                continue
            q[next_ == '#'].append((i+di, j+dj))
        while q and not q[0]:
            q = q[1:]
    return False

start = next(coord for coord, c in maze.items() if c == 's')
print('YES' if bfs01(start) else 'NO')

Submission Info

Judge Result