Submission #10074323

---

Source Code Expand

def main():
  import sys
  h,w=map(int, input().split())
  wall=["#" for _ in range(w+2)]
  maze=[]+[wall]
  for s in sys.stdin:
    maze.append(["#"]+list(s[:-1])+["#"])
  maze+=[wall]
  s=[[i,j.index("s")] for i,j in enumerate(maze) if "s" in j][0]
  x,y=s[0],s[1]
  isSolved = dfs(maze,x,y)
  print("Yes" if isSolved==True else "No")
  

def dfs(maze,x,y):
  w,h=len(maze),len(maze[0])
  if maze[x][y]=="#":
    return 
  if maze[x][y]=="g":
    print("Yes")
    exit()
  else:
    maze[x][y]="#"
    for i,j in [(1,0),(0,1),(-1,0),(0,-1)]:
      dfs(maze,x+i,y+j)

if __name__=="__main__":
  main()

Submission Info

Judge Result