Submission #11224923

---

Source Code Expand

from collections import deque 

H,W = map(int,input().split())
c = [input() for i in range(H)]

for i,h in enumerate(c):
    for j,w in enumerate(h):
        if w == 's':
            s_h = i
            s_w = j

todo = deque([[s_h,s_w]])
seen = [[0]*W for i in range(H)]
seen[s_h][s_w]=1

def dfs(c,seen,todo):
    while len(todo) > 0:
        h,w = todo.pop()
        if c[h][w] == 'g':
            return ('Yes')
        for i,j in ([1,0],[-1,0],[0,1],[0,-1]):
            next_h = h+i
            next_w = w+j
            if next_h < 0 or next_h >=H or next_w < 0 or next_w >= W:
                continue
            elif c[next_h][next_w] != '#' and seen[next_h][next_w] == 0: 
                seen[next_h][next_w] = 1
                todo.append([next_h,next_w])
    
    return 'No'

print(dfs(c,seen,todo))

Submission Info

Judge Result