Submission #7575206

---

Source Code Expand

mport sys
sys.setrecursionlimit(10000)

h, w = map(int, input().split())
town = [ list(sys.stdin.readline().rstrip()) for _ in range(h) ]
visited = [[False for _ in range(w)] for _ in range(h)]

# def dfs(x, y):
#     if town[x][y] == '#': return
#     if visited[x][y]: return
#     visited[x][y] = True
#     if x < h-1: dfs(x+1, y)
#     if y < w-1: dfs(x, y+1)
#     if x > 0: dfs(x-1, y)
#     if y > 0: dfs(x, y-1)

for i in range(h):
    for j in range(w):
        if town[i][j] == 's':
            sx, sy = i, j
        if town[i][j] == 'g': gx, gy = i, j

stack = [[sx, sy]]
while stack:
    x, y = stack.pop()
    if town[x][y] == '#' or visited[x][y]: continue
    visited[x][y] = True
    for ni, nj in [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]:
        if (ni >= 0) and (ni <= h-1) and (nj >= 0) and (nj <= w-1):
            stack.append([ni, nj])

# dfs(sx, sy)
print(visited)
if visited[gx][gy]:
    print('Yes')
else: print('No')

Submission Info

Judge Result