#918626 (PyPy3) No.2495 Three Sets

• 問題: No.2495 Three Sets
• ユーザー: mkawa2
• 提出日時: 2023-10-06 22:35:17
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 210 ms / 3,000 ms
• コード長: 2,017 bytes
• コンパイル時間: 285 ms
• コンパイル使用メモリ: 82,856 KB
• 実行使用メモリ: 115,004 KB
• 最終ジャッジ日時: 2024-07-26 16:40:25
• 合計ジャッジ時間: 3,004 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 18

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
import sys
# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
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)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 63)
# md = 10**9+7
md = 998244353
def cumsum(aa):
    cs = [0]
    for a in aa: cs.append(cs[-1]+a)
    return cs
def f(i, j, k):
    return sa[i]*j+sb[j]*k+sc[k]*i
na, nb, nc = LI()
aa = LI()
bb = LI()
cc = LI()
aa.sort(reverse=True)
bb.sort(reverse=True)
cc.sort(reverse=True)
sa = cumsum(aa)
sb = cumsum(bb)
sc = cumsum(cc)
def score(i,j):
    l,r=0,nc
    while 1:
        if l+1==r:
            return max(f(i,j,l),f(i,j,r))
        if l+2==r:
            m=(l+r)//2
            return max(f(i,j,l),f(i,j,m),f(i,j,r))
        m1=(l*2+r)//3
        m2=(l+r*2)//3
        if f(i,j,m1)>f(i,j,m2):
            r=m2
        else:
            l=m1
def search(i):
    l,r=0,nb
    while 1:
        if l+1==r:
            return max(score(i,l),score(i,r))
        if l+2==r:
            m=(l+r)//2
            return max(score(i,l),score(i,m),score(i,r))
        m1=(l*2+r)//3
        m2=(l+r*2)//3
        if score(i,m1)>score(i,m2):
            r=m2
        else:
            l=m1
l,r=0,na
ans=0
while 1:
    if l+1==r:
        ans=max(search(l),search(r))
        break
    if l+2==r:
        m=(l+r)//2
        ans=max(search(l),search(m),search(r))
        break
    m1=(l*2+r)//3
    m2=(l+r*2)//3
    if search(m1)>search(m2):
        r=m2
    else:
        l=m1
print(ans)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX