結果
問題 | No.2495 Three Sets |
ユーザー | prin_kemkem |
提出日時 | 2023-10-06 23:00:42 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,006 bytes |
コンパイル時間 | 390 ms |
コンパイル使用メモリ | 87,180 KB |
実行使用メモリ | 98,984 KB |
最終ジャッジ日時 | 2023-10-06 23:00:51 |
合計ジャッジ時間 | 9,006 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 178 ms
81,480 KB |
testcase_01 | AC | 178 ms
81,176 KB |
testcase_02 | AC | 208 ms
82,052 KB |
testcase_03 | AC | 179 ms
81,384 KB |
testcase_04 | AC | 175 ms
81,444 KB |
testcase_05 | AC | 178 ms
81,324 KB |
testcase_06 | AC | 177 ms
81,164 KB |
testcase_07 | AC | 178 ms
81,164 KB |
testcase_08 | AC | 207 ms
81,544 KB |
testcase_09 | AC | 257 ms
83,988 KB |
testcase_10 | AC | 363 ms
84,280 KB |
testcase_11 | AC | 409 ms
84,496 KB |
testcase_12 | AC | 601 ms
84,172 KB |
testcase_13 | TLE | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
ソースコード
from collections import defaultdict, deque, Counter import copy from itertools import combinations, permutations, product, accumulate, groupby, chain from heapq import heapify, heappop, heappush import math import bisect from pprint import pprint from random import randint import sys # sys.setrecursionlimit(700000) input = lambda: sys.stdin.readline().rstrip('\n') inf = float('inf') mod1 = 10**9+7 mod2 = 998244353 def ceil_div(x, y): return -(-x//y) ################################################# class f(object): def __init__(self, x): sc = SC[x] self.val = sa*j + sb*x + sc*i def __eq__(self, other): if not isinstance(other, f): return NotImplemented return self.val == other.val def __lt__(self, other): if not isinstance(other, f): return NotImplemented return self.val < other.val def __ne__(self, other): return not self.__eq__(other) def __le__(self, other): return self.__lt__(other) or self.__eq__(other) def __gt__(self, other): return not self.__le__(other) def __ge__(self, other): return not self.__lt__(other) def findMin(f, l, r): while r-l >= 3: c1 = l+(r-l)//3 c2 = r-(r-l)//3 if f(c1) < f(c2): r = c2 else: l = c1 return min(range(l, r+1), key=lambda k: f(k)) def findMax(f, l, r): while r-l >= 3: c1 = l+(r-l)//3 c2 = r-(r-l)//3 if f(c1) > f(c2): r = c2 else: l = c1 return max(range(l, r+1), key=lambda k: f(k)) NA, NB, NC = map(int, input().split()) A = list(map(int, input().split())) B = list(map(int, input().split())) C = list(map(int, input().split())) A.sort(reverse=True) B.sort(reverse=True) C.sort(reverse=True) SA = [0]+list(accumulate(A)) SB = [0]+list(accumulate(B)) SC = [0]+list(accumulate(C)) ans = 0 for i in range(NA+1): sa = SA[i] for j in range(NB+1): sb = SB[j] ans = max(ans, f(findMax(f, 0, NC)).val) print(ans)