結果

問題 No.1564 Sum of Products of Pairs
ユーザー titan23titan23
提出日時 2022-06-29 02:26:38
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 336 ms / 2,000 ms
コード長 4,105 bytes
コンパイル時間 374 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 119,720 KB
最終ジャッジ日時 2024-05-01 16:25:53
合計ジャッジ時間 8,020 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 62 ms
67,940 KB
testcase_01 AC 66 ms
67,072 KB
testcase_02 AC 62 ms
67,840 KB
testcase_03 AC 186 ms
93,856 KB
testcase_04 AC 97 ms
78,592 KB
testcase_05 AC 234 ms
99,456 KB
testcase_06 AC 182 ms
92,388 KB
testcase_07 AC 138 ms
85,616 KB
testcase_08 AC 113 ms
81,260 KB
testcase_09 AC 142 ms
86,912 KB
testcase_10 AC 234 ms
100,608 KB
testcase_11 AC 255 ms
104,112 KB
testcase_12 AC 186 ms
93,568 KB
testcase_13 AC 60 ms
67,328 KB
testcase_14 AC 60 ms
67,712 KB
testcase_15 AC 60 ms
67,584 KB
testcase_16 AC 60 ms
67,968 KB
testcase_17 AC 61 ms
67,456 KB
testcase_18 AC 329 ms
118,748 KB
testcase_19 AC 313 ms
114,412 KB
testcase_20 AC 328 ms
119,132 KB
testcase_21 AC 335 ms
118,964 KB
testcase_22 AC 312 ms
114,044 KB
testcase_23 AC 331 ms
119,568 KB
testcase_24 AC 333 ms
119,200 KB
testcase_25 AC 336 ms
119,052 KB
testcase_26 AC 332 ms
119,720 KB
testcase_27 AC 333 ms
119,308 KB
testcase_28 AC 62 ms
67,584 KB
testcase_29 AC 61 ms
67,328 KB
testcase_30 AC 60 ms
67,200 KB
testcase_31 AC 61 ms
67,328 KB
testcase_32 AC 62 ms
67,456 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = lambda: sys.stdin.readline().rstrip()
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right, insort
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
T = TypeVar('T')

class SortedMultiset(Generic[T]):
  BUCKET_RATIO = 50
  REBUILD_RATIO = 170

  def _build(self, a=None) -> None:
    "Evenly divide `a` into buckets."
    if a is None: a = list(self)
    size = self.size = len(a)
    bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
    self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
    
  def __init__(self, a: Iterable[T] = []) -> None:
    "Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
    a = list(a)
    if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
      a = sorted(a)
    self._build(a)

  def __iter__(self) -> Iterator[T]:
    for i in self.a:
      for j in i: yield j

  def __reversed__(self) -> Iterator[T]:
    for i in reversed(self.a):
      for j in reversed(i): yield j
    
  def __len__(self) -> int:
    return self.size
    
  def __repr__(self) -> str:
    return "SortedMultiset" + str(self.a)
    
  def __str__(self) -> str:
    s = str(list(self))
    return "{" + s[1 : len(s) - 1] + "}"

  def __bool__(self) -> int: # bool
    return self._size

  def _find_bucket(self, x: T) -> List[T]:
    "Find the bucket which should contain x. self must not be empty."
    for a in self.a:
      if x <= a[-1]: return a
    return a

  def __contains__(self, x: T) -> bool:
    if self.size == 0: return False
    a = self._find_bucket(x)
    i = bisect_left(a, x)
    return i != len(a) and a[i] == x

  def count(self, x: T) -> int:
    "Count the number of x."
    return self.index_right(x) - self.index(x)

  def add(self, x: T) -> None:
    "Add an element. / O(√N)"
    if self.size == 0:
      self.a = [[x]]
      self.size = 1
      return
    a = self._find_bucket(x)
    insort(a, x)
    self.size += 1
    if len(a) > len(self.a) * self.REBUILD_RATIO:
      self._build()

  def discard(self, x: T) -> bool:
    "Remove an element and return True if removed. / O(√N)"
    if self.size == 0: return False
    a = self._find_bucket(x)
    i = bisect_left(a, x)
    if i == len(a) or a[i] != x: return False
    a.pop(i)
    self.size -= 1
    if len(a) == 0: self._build()
    return True

  def lt(self, x: T) -> Union[T, None]:
    "Find the largest element < x, or None if it doesn't exist."
    for a in reversed(self.a):
      if a[0] < x:
        return a[bisect_left(a, x) - 1]

  def le(self, x: T) -> Union[T, None]:
    "Find the largest element <= x, or None if it doesn't exist."
    for a in reversed(self.a):
      if a[0] <= x:
        return a[bisect_right(a, x) - 1]

  def gt(self, x: T) -> Union[T, None]:
    "Find the smallest element > x, or None if it doesn't exist."
    for a in self.a:
      if a[-1] > x:
        return a[bisect_right(a, x)]

  def ge(self, x: T) -> Union[T, None]:
    "Find the smallest element >= x, or None if it doesn't exist."
    for a in self.a:
      if a[-1] >= x:
        return a[bisect_left(a, x)]
    
  def __getitem__(self, x: int) -> T:
    "Return the x-th element, or IndexError if it doesn't exist."
    if x < 0: x += self.size
    if x < 0: raise IndexError
    for a in self.a:
      if x < len(a): return a[x]
      x -= len(a)
    raise IndexError

  def index(self, x: T) -> int:
    "Count the number of elements < x."
    ans = 0
    for a in self.a:
      if a[-1] >= x:
        return ans + bisect_left(a, x)
      ans += len(a)
    return ans

  def index_right(self, x: T) -> int:
    "Count the number of elements <= x."
    ans = 0
    for a in self.a:
      if a[-1] > x:
        return ans + bisect_right(a, x)
      ans += len(a)
    return ans

#  -----------------------  #

n = int(input())
A = list(map(int, input().split()))
ss = SortedMultiset(A)

ans = 0
for _ in range(n):
  v1, v2 = ss[0], ss[1]
  ans += v1 * v2
  ss.discard(v1)
  ss.discard(v2)
print(ans)
0