Submission #423136

---

Source Code Expand

# -*- coding: utf-8 -*-
import math
import sys

R, C = list(map(int,input().strip('¥n').split(' ')))

def mapper(x):
    if 's' == x:
        return 1
    elif 'g' == x:
        return 2
    elif '#' == x:
        return -1
    else:
        return 0

start = 1
goal = 2
space = 0

pos = []
for x in range(R):
    pos.append( list(map(mapper,input().strip('¥n'))) )

for i in range(R):
    for j in range(C):
        if start == pos[i][j]:
            start_vec = (i,j)
        elif goal == pos[i][j]:
            goal_vec = (i,j)

pos[start_vec[0]][start_vec[1]] = 3

def go_walk(x):
    if 0==x or 1==x or 2==x:
        return True
    else:
        return False

def valid(i,j):
    global R
    global C
    if 0 <= i and i < R and 0 <= j and j < C:
        return True
    else:
        return False

def fill(pos,i,j,depth=0):
    #print(i,j)
    #print(pos)
    #if 5==depth:
    #exit()
    if 0 == pos[i][j] or 2 == pos[i][j]:
        pos[i][j] = 3
    
    ways = [[1,0],[-1,0],[0,1],[0,-1]]

    for way in ways:
        if valid(i+way[0],j+way[1]):
            if go_walk(pos[i+way[0]][j+way[1]]):
                fill(pos,i+way[0],j+way[1],depth=depth+1)

fill(pos,start_vec[0],start_vec[1])

if 3 == pos[goal_vec[0]][goal_vec[1]]:
    print('Yes')
else:
    print('No')

Submission Info

Judge Result