Submission #7473281

---

Source Code Expand

from collections import Counter,defaultdict
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

def dfs(sh,sw):
    seen[sh][sw] = True
    for dir in range(4):
        nh = sh + dy[dir]
        nw = sw + dx[dir]
        #場外のため進めない場合
        if nh < 0 or nh > h-1 or nw < 0 or nw > w-1:
            continue
        #壁のため進めない場合
        if field[nh][nw] == '#':
            continue
        #既に探索済みの場合
        if seen[nh][nw]:
            continue
        dfs(nh,nw)

# sからtまで辿りけるか(ATC001-A)

h,w = inpl()
#4方向への移動ベクトル
dx = [1,0,-1,0]
dy = [0,1,0,-1]
field = []
#訪問済みかどうか
seen = [[False for i in range(w)] for i in range(h)]
print(seen)
for i in range(h):
    field.append(input())
for i in range(h):
    for j in range(w):
        if field[i][j] == 's':
            sh = i
            sw = j
        if field[i][j] == 'g':
            gh = i
            gw = j 
dfs(sh,sw)

if seen[gh][gw]:
    print('Yes')
else:
    print('No')

Submission Info

Judge Result