Submission #420842

---

Source Code Expand

def search(route, x, y):
	if ((x < 0) | (w <= x) | (y < 0) | (h <= y)):
		return

	nextPoint = c[y][x]
	if nextPoint == "g":
		print "Yes"
		exit()
	elif ((nextPoint == ".") | (nextPoint == "s")):
		route += 1
		if(route < step[y][x]):
			step[y][x] = route
			search(route, x - 1, y)
			search(route, x + 1, y)
			search(route, x, y - 1)
			search(route, x, y + 1)
	return

global h
global w
global c
global step

h, w = map(int, raw_input().split())
c = []
step = [[30000 for _ in xrange(0,w)] for __ in range(0,h)]
for i in xrange(0, h):
	c.append(list(raw_input()))

for i, math in enumerate(c):
	if("s" in math):
		search(-1, math.index("s"), i)

print "No"

Submission Info

Judge Result