[알고리즘/백준] 16173번 : 점프왕 쩰리dfs(python)

이번에는 dfs로 풀었다.

def solution(N, m):
    visit = [[0] * N for _ in range(N)]
    dx = [1, 0]
    dy = [0, 1]
    q = list()
    q.append((0,0))
    while q:
        x, y = q.pop()
        if m[x][y] == -1:
            print('HaruHaru')
            exit(0)

        for i in range(2):
            nx = x + dx[i] * m[x][y]
            ny = y + dy[i] * m[x][y]
            if 0<= nx < N and 0<= ny < N and visit[nx][ny] == 0:
                q.append((nx, ny))
                visit[nx][ny] = 1


if __name__ == "__main__":
    N = int(input())
    m = [list(map(int, input().split())) for _ in range(N)]
    solution(N, m)
    print('Hing')