結果

問題 No.1792 科学の甲子園
ユーザー titiatitia
提出日時 2021-12-22 02:03:34
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
AC  
実行時間 382 ms / 4,000 ms
コード長 5,066 bytes
コンパイル時間 534 ms
コンパイル使用メモリ 12,164 KB
実行使用メモリ 9,888 KB
最終ジャッジ日時 2023-08-17 18:42:00
合計ジャッジ時間 5,008 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 24 ms
9,428 KB
testcase_01 AC 25 ms
9,420 KB
testcase_02 AC 22 ms
9,436 KB
testcase_03 AC 24 ms
9,468 KB
testcase_04 AC 25 ms
9,420 KB
testcase_05 AC 23 ms
9,428 KB
testcase_06 AC 23 ms
9,524 KB
testcase_07 AC 23 ms
9,384 KB
testcase_08 AC 33 ms
9,420 KB
testcase_09 AC 47 ms
9,428 KB
testcase_10 AC 26 ms
9,340 KB
testcase_11 AC 274 ms
9,516 KB
testcase_12 AC 200 ms
9,400 KB
testcase_13 AC 265 ms
9,372 KB
testcase_14 AC 382 ms
9,876 KB
testcase_15 AC 209 ms
9,416 KB
testcase_16 AC 23 ms
9,400 KB
testcase_17 AC 25 ms
9,388 KB
testcase_18 AC 25 ms
9,460 KB
testcase_19 AC 205 ms
9,420 KB
testcase_20 AC 371 ms
9,840 KB
testcase_21 AC 184 ms
9,352 KB
testcase_22 AC 273 ms
9,448 KB
testcase_23 AC 214 ms
9,380 KB
testcase_24 AC 23 ms
9,544 KB
testcase_25 AC 24 ms
9,528 KB
testcase_26 AC 23 ms
9,448 KB
testcase_27 AC 272 ms
9,380 KB
testcase_28 AC 360 ms
9,888 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# 解説を見たら当たり前に見えた。こういう問題は解かないと……。

N=int(input())
A=[list(map(int,input().split())) for i in range(N)]

ANS=set()
def dfs(A):
    #print(A)
    if len(A)==4:
        ANS.add(tuple(sorted(A)))
        return

    B=[]
    for to in A:
        for z in to:
            B.append(z)

    for i in range(1,1<<6):
        X=[]
        for j in range(6):
            if i & (1<<j) != 0 and not(j in B):
                X.append(j)
        X.sort()

        if len(X)>0:
            dfs(A+(tuple(X),))

#dfs(tuple())

ANS={((0, 2), (1, 5), (3,), (4,)), ((0, 4), (1, 2), (3,), (5,)), ((0, 1), (2, 3), (4,), (5,)), ((0,), (1, 5), (2,), (3, 4)), ((0, 3), (1,), (2,), (4, 5)), ((0, 1), (2,), (3,), (5,)), ((0,), (2,), (3,), (4,)), ((0, 2), (1,), (3,), (4,)), ((0, 5), (1,), (2, 3), (4,)), ((0,), (1, 2), (3, 5), (4,)), ((0,), (2,), (3,), (4, 5)), ((0, 2), (1,), (3,), (4, 5)), ((0, 5), (1,), (2,), (3,)), ((0, 1), (2, 5), (3,), (4,)), ((0, 5), (1, 4), (2,), (3,)), ((0,), (1,), (2, 5), (3, 4)), ((1,), (2, 3), (4,), (5,)), ((0, 4), (1, 5), (2,), (3,)), ((0,), (1, 3), (2, 5), (4,)), ((0, 4, 5), (1,), (2,), (3,)), ((0, 1), (2,), (4,), (5,)), ((0,), (1,), (2,), (3,)), ((2,), (3,), (4,), (5,)), ((0,), (1,), (2, 3, 4), (5,)), ((0,), (1,), (2, 4), (3,)), ((0,), (1, 5), (2, 4), (3,)), ((0, 1, 4), (2,), (3,), (5,)), ((0,), (1,), (2,), (4, 5)), ((0,), (3,), (4,), (5,)), ((0,), (1, 4), (2,), (3, 5)), ((0,), (1, 2), (3,), (5,)), ((0, 2), (1,), (4,), (5,)), ((0, 3), (1,), (2,), (4,)), ((1,), (2,), (3,), (4,)), ((0, 3), (1, 5), (2,), (4,)), ((0, 2, 5), (1,), (3,), (4,)), ((0, 1, 3), (2,), (4,), (5,)), ((0, 4), (1,), (3,), (5,)), ((1,), (2,), (3,), (4, 5)), ((0,), (2,), (3, 4), (5,)), ((0, 3, 5), (1,), (2,), (4,)), ((0, 2), (1,), (3, 4), (5,)), ((0,), (1, 2, 5), (3,), (4,)), ((0,), (1,), (2,), (3, 5)), ((0, 4), (2,), (3,), (5,)), ((0, 3), (1, 4), (2,), (5,)), ((1, 4), (2,), (3,), (5,)), ((0,), (1,), (2, 3), (4,)), ((0, 3), (1,), (2,), (5,)), ((0,), (1, 3), (4,), (5,)), ((0,), (1, 2), (3, 4), (5,)), ((0,), (1, 2), (4,), (5,)), ((0, 5), (1,), (2,), (4,)), ((0,), (1,), (2, 3), (4, 5)), ((0, 3), (1,), (2, 5), (4,)), ((0, 4), (1,), (2, 5), (3,)), ((0, 2), (1, 3), (4,), (5,)), ((0, 5), (1, 2), (3,), (4,)), ((0,), (1, 5), (2,), (3,)), ((0,), (2,), (3,), (5,)), ((0, 2), (1,), (3,), (5,)), ((0, 3), (1,), (2, 4), (5,)), ((0,), (1, 4), (2, 3), (5,)), ((0, 5), (1,), (3,), (4,)), ((0, 4), (1,), (2,), (5,)), ((0,), (1,), (2,), (4,)), ((0, 5), (2,), (3,), (4,)), ((0,), (2,), (3, 5), (4,)), ((0,), (1, 4), (2,), (5,)), ((0,), (1,), (3,), (4, 5)), ((0,), (1, 3, 4), (2,), (5,)), ((1,), (2, 5), (3,), (4,)), ((0,), (1,), (2, 5), (3,)), ((0,), (2,), (4,), (5,)), ((0,), (1,), (2, 5), (4,)), ((0, 2), (3,), (4,), (5,)), ((0,), (1,), (2,), (5,)), ((0,), (1, 4, 5), (2,), (3,)), ((0,), (1, 3), (2,), (4, 5)), ((0,), (1, 5), (2, 3), (4,)), ((1,), (2, 4), (3,), (5,)), ((0, 4), (1,), (2,), (3,)), ((0,), (1, 2, 3), (4,), (5,)), ((0, 2, 4), (1,), (3,), (5,)), ((0,), (1,), (2, 4), (3, 5)), ((0, 1, 5), (2,), (3,), (4,)), ((0, 3, 4), (1,), (2,), (5,)), ((1,), (2,), (3,), (5,)), ((0,), (1,), (2,), (3, 4, 5)), ((0, 1), (2,), (3,), (4,)), ((0, 3), (1, 2), (4,), (5,)), ((0,), (1, 5), (2,), (4,)), ((0,), (1,), (2, 4, 5), (3,)), ((0, 1), (2,), (3,), (4, 5)), ((1,), (2,), (3, 5), (4,)), ((0,), (1,), (2, 3), (5,)), ((0, 5), (1,), (2,), (3, 4)), ((0, 1, 2), (3,), (4,), (5,)), ((0,), (1,), (3,), (4,)), ((0,), (1,), (3, 4), (5,)), ((0, 4), (1,), (2,), (3, 5)), ((1,), (2,), (3, 4), (5,)), ((1, 5), (2,), (3,), (4,)), ((0,), (2, 3), (4,), (5,)), ((1,), (2,), (4,), (5,)), ((0,), (1, 2, 4), (3,), (5,)), ((0, 1), (2, 4), (3,), (5,)), ((0,), (1,), (2,), (3, 4)), ((0, 2, 3), (1,), (4,), (5,)), ((0, 3), (1,), (4,), (5,)), ((0,), (1, 3), (2,), (4,)), ((0,), (1, 4), (3,), (5,)), ((0,), (1, 3, 5), (2,), (4,)), ((0,), (1,), (3,), (5,)), ((0, 3), (2,), (4,), (5,)), ((0, 5), (1, 3), (2,), (4,)), ((0,), (1,), (2, 4), (5,)), ((0, 2), (1, 4), (3,), (5,)), ((0,), (1, 4), (2,), (3,)), ((0, 1), (2,), (3, 5), (4,)), ((1, 2), (3,), (4,), (5,)), ((0, 1), (3,), (4,), (5,)), ((0,), (1, 2), (3,), (4,)), ((0,), (1,), (2, 3, 5), (4,)), ((1,), (3,), (4,), (5,)), ((0,), (1, 4), (2, 5), (3,)), ((0, 5), (1,), (2, 4), (3,)), ((0,), (1,), (3, 5), (4,)), ((0,), (1, 3), (2,), (5,)), ((0, 4), (1, 3), (2,), (5,)), ((0, 4), (1,), (2, 3), (5,)), ((0,), (1, 2), (3,), (4, 5)), ((0, 2), (1,), (3, 5), (4,)), ((0, 1), (2,), (3, 4), (5,)), ((0,), (2, 4), (3,), (5,)), ((1, 3), (2,), (4,), (5,)), ((0,), (1,), (4,), (5,)), ((0,), (1, 5), (3,), (4,)), ((0,), (2, 5), (3,), (4,)), ((0,), (1, 3), (2, 4), (5,))}


LANS=0
for x,y,z,w in ANS:
    AX=1
    BX=1
    CX=1
    DX=1
    
    for i in range(N):
        C=1
        for to in x:
            C*=A[i][to]
        AX=max(AX,C)

        D=1
        for to in y:
            D*=A[i][to]
        BX=max(BX,D)

        E=1
        for to in z:
            E*=A[i][to]
        CX=max(CX,E)

        F=1
        for to in w:
            F*=A[i][to]
        DX=max(DX,F)

    LANS=max(LANS,AX*BX*CX*DX)

print(LANS)
0