[백준] 1149. RGB거리 | 파이썬

백준 1149. RGB거리 - 실버I

문제 설명

---

---

파이썬 코드

import sys
input = sys.stdin.readline

n = int(input())
house = [0] * n

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

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

print(min(house[n-1][0], house[n-1][1], house[n-1][2]))