Submission #7102382

---

Source Code Expand

def solve():
    c = read()
    result = think(c)
    write(result)


def read():
    h, w = read_int(2)
    c = []
    for y in range(h):
        buf = read_line(w)
        c.append(list(buf))
    return c


def read_int(n):
    return list(map(int, read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(c):
    w, h = get_area(c)

    wall = '#'
    start = 's'
    goal = 'g'

    sx, sy = find(c, start)
    gx, gy = find(c, goal)

    visited_area = [[0 for x in range(w)] for y in range(h)]

    search(c, sx, sy, w, h, visited_area)

    if visited_area[gy][gx] == 0:
        return 'No'
    else:
        return 'Yes'


def search(c, x, y, w, h, visited_area):
    if not can_exist_at(c, x, y, w, h, visited_area):
        return
    if visited_area[y][x] == 1:
        return
    visited_area[y][x] = 1
    search(c, x + 1, y, w, h, visited_area)
    search(c, x - 1, y, w, h, visited_area)
    search(c, x, y + 1, w, h, visited_area)
    search(c, x, y - 1, w, h, visited_area)


def get_area(c):
    h = len(c)
    w = len(c[0])
    return w, h


def find(c, mark):
    w, h = get_area(c)
    for y in range(h):
        for x in range(w):
            if c[y][x] == mark:
                return x, y


def can_exist_at(c, x, y, w, h, visited_area):
    return 0 <= x < w and 0 <= y < h and c[y][x] != '#' and visited_area[y][x] == 0


def write(result):
    print(result)


if __name__ == '__main__':
    import sys
    sys.setrecursionlimit(300000)
    solve()

Submission Info

Judge Result