Submission #7571767

---

Source Code Expand

from collections import deque
h,w = map(int,input().split())
way = []
for i in range(h):
    c = input()
    way.append(c)
x = 0
y = 0
for i in range(h):
    for j in range(w):
        if way[i][j] == "s":
            x = j
            y = i
            break
def dfs(X,Y):
    if way[Y][X] == "g":
        return True
    m = [0]*w
    memo = []
    for i in range(h):
        memo.append(m.copy())
    dx = [0,1,0,-1]
    dy = [1,0,-1,0]
    for i in range(4):
        nx = X + dx[i]   
        ny = Y + dy[i]
        if 0 <= nx < w and 0 <= ny < h and memo[ny][nx] == 0:
            if way[ny][nx] == "g":
                return True
            elif way[ny][nx] == ".":
                dfs(nx,ny)
if dfs(x,y):
    print("Yes")
else:
    print("No")

Submission Info

Judge Result