Submission #6899261

---

Source Code Expand

H, W = map(int,input().split())
point = [list(input()) for _ in range(H)]

def search_target(arg):
  for i in range(H):
    if arg in point[i]:
      return i, point[i].index(arg)

sh,sw = search_target('s')
gh,gw = search_target('g')
judge = 'No'


visited = []
rest = [[sh,sw]]

while len(rest):
  h,w = rest.pop()
  visited.append([h,w])
  for dx,dy in [[1,0],[-1,0],[0,-1],[0,1]]:
    if (0 <= h+dx< H)&(0 <= w+dy< W):
      if ([h+dx,w+dy] not in visited):
      	if(point[h+dx][w+dy] == '.') or (point[h+dx][w+dy] == 'g'):
        	point[h+dx][w+dy] = '?'
        	rest.append([h+dx, w+dy])

  if [gh,gw] in visited:
    judge = 'Yes'
    break

print(judge)

Submission Info

Judge Result