結果

問題 No.1045 直方体大学
ユーザー mkawa2mkawa2
提出日時 2021-05-12 00:36:45
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 1,749 bytes
コンパイル時間 824 ms
コンパイル使用メモリ 82,372 KB
実行使用メモリ 257,888 KB
最終ジャッジ日時 2024-09-22 07:09:44
合計ジャッジ時間 6,832 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 16 TLE * 1
権限があれば一括ダウンロードができます

ソースコード

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

import sys
sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
dij = [(0, 1), (1, 0), (1, 1), (1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7
from functools import lru_cache
def tohwt(i, j):
a, b, c = abc[i]
if j == 0: return a, b, c
if j == 1: return a, c, b
return b, c, a
n = II()
abc = []
for _ in range(n):
aa = LI()
aa.sort()
abc.append(aa)
# print(abc)
to = [[] for _ in range(3*n+2)]
for i in range(n):
for ni in range(n):
if ni == i: continue
for j in range(3):
H, W, T = tohwt(i, j)
u = i*3+j
for nj in range(3):
h, w, t = tohwt(ni, nj)
if h > H or w > W: continue
v = ni*3+nj
to[u].append((v, t))
for i in range(n):
for j in range(3):
u = i*3+j
h, w, t = tohwt(i, j)
to[n*3].append((u, t))
# to[u].append((n*3+1, 0))
@lru_cache(None)
def dfs(u,s):
# if u == n*3+1: return 0
res = 0
for v, c in to[u]:
i=v//3
if s>>i&1:continue
cur = dfs(v,s|1<<i)+c
if cur>res:res=cur
return res
print(dfs(n*3,0))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0