Submission #9500682

---

Source Code Expand

import numpy as np
from collections import deque
h,w=map(int,input().split())
CW=[list('#' + input() +'#') for i in range(h)]
h+=2
w+=2
C0=list('#'*w)
C00=list('#'*w)
CW.insert(0,C0)
CW.append(C00)
for i in range(h):
    for j in range(w):
        if CW[i][j]=='s':
            start=(j,i)
            break
def dfs(start):
    ans='No'
    flag=[[-1]*w for i in range(h)]
    x,y=start
    flag[y][x]=0
    stack=[(x,y)]
    while stack:
        x,y=stack.pop()
        dx=[1,0,-1,0]
        dy=[0,1,0,-1]
        for i in range(4):
            nx=x+dx[i]
            ny=y+dy[i]
            if flag[ny][nx]==-1:
                if CW[ny][nx]=='.':
                    stack.append((nx,ny))
                    flag[ny][nx]=0
                if CW[ny][nx]=='g':
                    ans='Yes'
    return ans
print(dfs(start))

Submission Info

Judge Result