백준 4883. 삼각 그래프

https://www.acmicpc.net/problem/4883

4883번: 삼각 그래프

import sys
input = sys.stdin.readline

K = 1
while True:
    N = int(input())
    if N == 0:
        break
    dp = []
    for i in range(N):
        dp.append(list(map(int, input().split())))
    ans = 0

    dp[1][0] += dp[0][1]
    dp[1][1] += min(dp[0][1], dp[0][1] + dp[0][2], dp[1][0])
    dp[1][2] += min(dp[0][1], dp[0][1] + dp[0][2], dp[1][1])

    for i in range(2, N):
        dp[i][0] += min(dp[i - 1][0], dp[i - 1][1])
        dp[i][1] += min(dp[i - 1][0], dp[i - 1][1], dp[i - 1][2], dp[i][0])
        dp[i][2] += min(dp[i - 1][1], dp[i - 1][2], dp[i][1])

    print(f"{K}. {dp[N - 1][1]}")

    K += 1