Submission #1518464

---

Source Code Expand

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
gosa = 1.0 / 10**10
mod = 10**9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()


def main():
    h,w = LI()
    c = [[0]*(w+2)]
    s = g = None
    for i in range(h):
        t = S()
        r = [0]
        for ti in range(w):
            d = t[ti]
            if d == '.':
                r.append(1)
            elif d == '#':
                r.append(0)
            elif d == 's':
                s = (i+1,ti+1)
                r.append(2)
            else:
                g = (i+1,ti+1)
                r.append(3)
        r.append(0)
        c.append(r)
    c.append([0]*(w+2))

    v = [[False]*(w+2) for _ in range(h+2)]
    q = [s]
    qi = qe = 0
    dd = [(1,0),(-1,0),(0,1),(0,-1)]
    while qi <= qe:
        i,j = q[qi]
        qi += 1
        for di,dj in dd:
            ni = i+di
            nj = j+dj
            if c[ni][nj] > 0 and not v[ni][nj]:
                q.append((ni,nj))
                v[ni][nj] = True
                if c[ni][nj] == 3:
                    return 'Yes'
                qe += 1
    return 'No'


print(main())

Submission Info

Judge Result