Submission #7571047

---

Source Code Expand

h,w = map(int,input().split())
way = []
for i in range(h):
    c = input()
    way.append(c)

m = [0]*w
memo = []
for i in range(h):
    memo.append(m.copy())
dx = [0,1,0,-1]
dy = [1,0,-1,0]
def dfs(X,Y):
    for i in range(4):
        a = X + dx[i]   
        b = Y + dy[i]
        if 0 <= a <= w-1 and 0 <= b <= h-1 and way[b][a] != "#" and memo[b][a] == 0:
            if way[b][a] == "g":
                return True
            else:
                memo[b][a] = 1
                return dfs(a,b)
x = 0
y = 0
for i in range(h):
    for j in range(w):
        if way[i][j] == "s":
            x = j
            y = i
            break
if dfs(x,y):
    print("Yes")
else:
    print("No")

Submission Info

Judge Result