백준 16173번 - 점프왕 쩰리 (Small)

import sys
sys.setrecursionlimit(10**6)

n = int(input())
maps = []
for i in range(n):
  lines = map(int,input().split())
  maps.append(list(lines))

visited = [[False] * n for _ in range(n)]

def dfs(x,y):
  if not 0<=x<n or not 0<=y<n:
    return
  l = maps[y][x]
  if l == -1:
    print("HaruHaru")
    exit(0)
  if not visited[y][x]:
    visited[y][x] = True
    dfs(x+l,y)
    dfs(x,y+l)
  return

dfs(0,0)
print("Hing")

import sys
from collections import deque


def solution(N, graph):
    visited = [[False] * N for _ in range(N)]

    dx = [1, 0]
    dy = [0, 1]

    def dfs(x, y, visited):
        queue = deque()
        queue.append((x, y))

        while queue:
            x, y = queue.popleft()
            if graph[x][y] == -1:
                return 'HaruHaru'

            jump = graph[x][y]  # 점프 값
            for i in range(2):
                nx = x + dx[i] * jump
                ny = y + dy[i] * jump

                if nx >= N or ny >= N:
                    continue
                if visited[nx][ny]:
                    continue
                else:
                    visited[nx][ny] = True
                    queue.append((nx, ny))
        return 'Hing'

    print(dfs(0, 0, visited))


if __name__ == "__main__":
    N = int(sys.stdin.readline())
    graph = [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
    solution(N, graph)