[백준 문제풀이] 얼렁뚱땅 2116 주사위 쌓기 풀이

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

2116번: 주사위 쌓기

from copy import deepcopy
n = int(input())
arr = [list(map(int,input().split())) for _ in range(n)]

#return bottom, top
# i == bottom
def bottom_top(i) :
    if i == 0 :
        return 0, 5
    elif i == 1 :
        return 1, 3
    elif i == 2 :
        return 2, 4
    elif i == 3 :
        return 3, 1
    elif i == 4 :
        return 4, 2
    else :
        return 5, 0

answer = -1
for i in range(6) :
    temp_sum = 0
    bottom_idx, top_idx = bottom_top(i)
    bottom, top = arr[0][bottom_idx], arr[0][top_idx]
    copy_list = deepcopy(arr[0])
    copy_list[bottom_idx] = 0
    copy_list[top_idx] = 0
    temp_sum += max(copy_list)

    for j in range(1,n) :
        bottom_idx = arr[j].index(top)
        bottom_idx, top_idx = bottom_top(bottom_idx)
        bottom, top = arr[j][bottom_idx], arr[j][top_idx]
        copy_list = deepcopy(arr[j])
        copy_list[bottom_idx] = 0
        copy_list[top_idx] = 0
        temp_sum += max(copy_list)

    answer = max(answer,temp_sum)

print(answer)