Submission #4584521

---

Source Code Expand

import sys
sys.setrecursionlimit(10**9+7)

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

dx = [1,0,-1,0]
dy = [0,1,0,-1]

def dfs(y,x):

    if S[y][x] == 'g':
        print("Yes")
        exit()

    S[y][x] = '#'

    for i in range(4):
        ny = y + dy[i]
        nx = x + dx[i]
        if 0<=ny<h and 0<=nx<w and S[ny][nx] != '#':
            dfs(ny,nx)

for s in range(h):
    for t in range(w):
        if S[s][t] == 's':
            dfs(s,t)

print("No")

Submission Info

Judge Result