結果

問題 No.1045 直方体大学
ユーザー tcltktcltk
提出日時 2021-05-19 04:34:27
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 3,004 bytes
コンパイル時間 175 ms
コンパイル使用メモリ 82,296 KB
実行使用メモリ 228,744 KB
最終ジャッジ日時 2024-10-09 06:11:18
合計ジャッジ時間 5,868 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 6 TLE * 1 -- * 10
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#region Header
#!/usr/bin/env python3
# from typing import *
import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq
def input():
return sys.stdin.readline()[:-1]
# sys.setrecursionlimit(1000000)
#endregion
# _INPUT = """5
# 94 61 65
# 36 14 63
# 54 96 47
# 78 69 73
# 32 82 99
# """
# sys.stdin = io.StringIO(_INPUT)
def is_loadable(lower, upper):
return lower[0] >= upper[0] and lower[1] >= upper[1]
def main():
N = int(input())
Box = []
Edge = []
for i in range(N):
a, b, c = map(int, input().split())
Box.append((a, b, c))
Edge.append([(max(b, c), min(b, c)), (max(c, a), min(c, a)), (max(a, b), min(a, b))])
dp = [[[0] * 3 for _ in range(N)] for _ in range(1<<N)]
for i in range(N):
dp[1<<i][i][0] = Box[i][0]
dp[1<<i][i][1] = Box[i][1]
dp[1<<i][i][2] = Box[i][2]
for s in range(1, 1<<N):
for next_box in range(N):
if s & (1<<next_box):
continue
s1 = s | (1<<next_box)
for last_box in range(N):
if not(s & (1<<last_box)):
continue
dp[s1][last_box][0] = max(dp[s1][last_box][0], dp[s][last_box][0])
dp[s1][last_box][1] = max(dp[s1][last_box][1], dp[s][last_box][1])
dp[s1][last_box][2] = max(dp[s1][last_box][2], dp[s][last_box][2])
if is_loadable(Edge[last_box][2], Edge[next_box][0]): dp[s1][next_box][0] = max(dp[s1][next_box][0], dp[s][last_box][2] +
                    Box[next_box][0])
if is_loadable(Edge[last_box][0], Edge[next_box][0]): dp[s1][next_box][0] = max(dp[s1][next_box][0], dp[s][last_box][0] +
                    Box[next_box][0])
if is_loadable(Edge[last_box][1], Edge[next_box][0]): dp[s1][next_box][0] = max(dp[s1][next_box][0], dp[s][last_box][1] +
                    Box[next_box][0])
if is_loadable(Edge[last_box][2], Edge[next_box][1]): dp[s1][next_box][1] = max(dp[s1][next_box][1], dp[s][last_box][2] +
                    Box[next_box][1])
if is_loadable(Edge[last_box][0], Edge[next_box][1]): dp[s1][next_box][1] = max(dp[s1][next_box][1], dp[s][last_box][0] +
                    Box[next_box][1])
if is_loadable(Edge[last_box][1], Edge[next_box][1]): dp[s1][next_box][1] = max(dp[s1][next_box][1], dp[s][last_box][1] +
                    Box[next_box][1])
if is_loadable(Edge[last_box][2], Edge[next_box][2]): dp[s1][next_box][2] = max(dp[s1][next_box][2], dp[s][last_box][2] +
                    Box[next_box][2])
if is_loadable(Edge[last_box][0], Edge[next_box][2]): dp[s1][next_box][2] = max(dp[s1][next_box][2], dp[s][last_box][0] +
                    Box[next_box][2])
if is_loadable(Edge[last_box][1], Edge[next_box][2]): dp[s1][next_box][2] = max(dp[s1][next_box][2], dp[s][last_box][1] +
                    Box[next_box][2])
ans = max(max(dp[(1<<N)-1][i][k] for k in range(3)) for i in range(N))
print(ans)
if __name__ == '__main__':
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0