Submission #420567

---

Source Code Expand

H, W = map(int, input().split())

m = []
sx = 0
sy = 0
gx = 0
gy = 0

for h in range(H):
    i = list(input())
    m.append(i)
    if "s" in i:
        sx = i.index("s")
        sy = h
    if "g" in i:
        gx = i.index("g")
        gy = h


def dfs(sx, sy):
    if m[sy][sx] == "g":
        return True
    m[sy][sx] = "#"
    if 0 < sx and m[sy][sx - 1] != "#":
        return dfs(sx - 1, sy)
    if sx < W - 1 and m[sy][sx + 1] != "#":
        return dfs(sx + 1, sy)

    if 0 < sy and m[sy - 1][sx] != "#":
        return dfs(sx, sy - 1)
    if sy < H - 1 and m[sy + 1][sx] != "#":
        return dfs(sx, sy + 1)

    return False

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

Submission Info

Judge Result