Submission #420564

---

Source Code Expand

n, m = map(int, input().split())

fld = [[[] for _ in range(m)] for _ in range(n)]

def dfs(nx, ny):
    if fld[gy][gx] == 1:
        return True
    for dx, dy in zip([0, 1, 0, -1], [-1, 0, 1, 0]):
        if 0 <= ny+dy < n and 0 <= nx+dx < m:
            if fld[ny+dy][nx+dx] == 0:
                fld[ny+dy][nx+dx] = 1
                if dfs(nx + dx, ny + dy):
                    return True
    return False



for y in range(n):
    line = input()
    for x in range(m):
        fld[y][x] = 0
        if line[x] == 's':
            sx, sy = x, y
            fld[sy][sx] = 1
        elif line[x] == 'g':
            gx, gy = x, y
        elif line[x] == '#':
            fld[y][x] = -1

print("Yes" if dfs(sx, sy) else "No")

Submission Info

Judge Result