Submission #11226389

---

Source Code Expand

import sys #追加
sys.setrecursionlimit(500*500) #追加

h,w=map(int,input().split())
field=[]
for i in range(h):
    field.append(list(input()))
    
def dfs(y,x):
    """
    print(x,y,field[x][y])
    if field[x][y]=="g":
        print("Yes")
        exit()
    else:
    """
    field[y][x]="x"
    for dx,dy in ([0,1],[0,-1],[1,0],[-1,0]):
        nx=x+dx
        ny=y+dy
        if nx>=0 and ny>=0 and nx<=w-1 and ny<=h-1:
            if field[ny][nx]==".":
                dfs(ny,nx)
            if field[ny][nx]=="g":
                print("Yes")
                exit()
def solve():
    for i in range(h):
        for j in range(w):
            if field[i][j]=="s":
                dfs(i,j)
    print("No")

solve()

Submission Info

Judge Result