Baekjoon #16174

Baekjoon #16174

1개의 풀이 · Python

문제 원문 보기 ↗

SOLUTION INFO

Python · main.py

main.py
import sys
from collections import deque

def input():
    return sys.stdin.readline().rstrip()

dirx = (0, 1)
diry = (1, 0)
N = int(input())
maps = [list(map(int, input().split())) for _ in range(N)]
inf = float('inf')

q = deque()
q.append((0, 0))
while q:
    x, y = q.popleft()
    if x == N - 1 and y == N - 1:
        print('HaruHaru')
        exit(0)

    for dx, dy in zip(dirx, diry):
        nx, ny = x + dx * maps[x][y], y + dy * maps[x][y]
        if 0 <= nx < N and 0 <= ny < N:
            q.append((nx, ny))
    maps[x][y] = inf

print('Hing')

SOLUTION DESCRIPTION

풀이 설명

등록된 풀이 설명이 없습니다.