Submission #3124909

---

Source Code Expand

import sys
sys.setrecursionlimit(1000000)

h,w = list(map(int,input().split()))
M = [list(input()) for _ in range(h)]

for i,j in enumerate(M):
    if "s" in j:
        sr,sc = i,j.index("s")

def dfs(r,c):
    M[r][c] = "#"
    for i,j in ([-1,0],[1,0],[0,-1],[0,1]):
        if not (0 <= r+i < h and 0 <= c+j < w) or M[r+i][c+j]=="#":
            continue
        if M[r+i][c+j] == "g":
            print("Yes")
            sys.exit()
        dfs(r+i,c+j)

dfs(sr,sc)
print("No")

Submission Info

Judge Result