Submission #2709491

---

Source Code Expand

import sys
sys.setrecursionlimit(1000000000)

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

def dfs(h, w):
	if not 0 <= h <= H-1 or not 0 <= w <= W-1 or c[h][w] == "#" or visited[h][w] == 1:
		return
	else:
		visited[h][w] = 1
		dfs(h-1, w)
		dfs(h+1, w)
		dfs(h, w-1)
		dfs(h, w+1)

for h in range(H):
	for w in range(W):
		if c[h][w] == "s":
			dfs(h, w)

for h in range(H):
	for w in range(W):
		if c[h][w] == "g":
			if visited[h][w] == 1:
				print("Yes")
			else:
				print("No")

Submission Info

Judge Result