結果

問題 No.2046 Ans Mod? Mod Ans!
ユーザー ShirotsumeShirotsume
提出日時 2022-05-17 22:06:19
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 3,310 ms / 4,000 ms
コード長 5,196 bytes
コンパイル時間 271 ms
コンパイル使用メモリ 87,068 KB
実行使用メモリ 153,468 KB
最終ジャッジ日時 2023-08-22 11:38:55
合計ジャッジ時間 17,782 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 176 ms
80,452 KB
testcase_01 AC 170 ms
80,308 KB
testcase_02 AC 172 ms
80,544 KB
testcase_03 AC 222 ms
83,424 KB
testcase_04 AC 219 ms
82,788 KB
testcase_05 AC 226 ms
83,548 KB
testcase_06 AC 211 ms
83,016 KB
testcase_07 AC 221 ms
83,324 KB
testcase_08 AC 282 ms
84,084 KB
testcase_09 AC 257 ms
83,916 KB
testcase_10 AC 266 ms
84,492 KB
testcase_11 AC 316 ms
84,664 KB
testcase_12 AC 310 ms
84,492 KB
testcase_13 AC 1,189 ms
108,268 KB
testcase_14 AC 1,016 ms
102,996 KB
testcase_15 AC 1,737 ms
118,900 KB
testcase_16 AC 1,827 ms
119,360 KB
testcase_17 AC 1,465 ms
114,884 KB
testcase_18 AC 1,472 ms
115,144 KB
testcase_19 AC 1,353 ms
115,592 KB
testcase_20 AC 3,310 ms
153,468 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#一般性を失わずに、Aはソート済みとします。
#i < j のとき、 A_i < A_j を満たします。
#|A_i mod A_j - A_j mod A_i| = A_i - A_j mod A_i| となります。
class Cumsum1d():
    n = None
    Suma = []
    def __init__(self, A):
        self.n = len(A)
        self.Suma = [0] * (self.n + 1)
        for i in range(self.n):
            self.Suma[i + 1] += self.Suma[i] + A[i]

    def query(self, l, r):
        if l > r:
            return 0
        #0-indexed
        return self.Suma[r + 1] - self.Suma[l]

    def get(self, i):
        return self.Suma[i + 1] - self.Suma[i]

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

class SortedSet(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 SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
        a = list(a)
        if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):
            a = sorted(set(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 "SortedSet" + str(self.a)
    
    def __str__(self) -> str:
        s = str(list(self))
        return "{" + s[1 : len(s) - 1] + "}"

    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 add(self, x: T) -> bool:
        "Add an element and return True if added. / O(√N)"
        if self.size == 0:
            self.a = [[x]]
            self.size = 1
            return True
        a = self._find_bucket(x)
        i = bisect_left(a, x)
        if i != len(a) and a[i] == x: return False
        a.insert(i, x)
        self.size += 1
        if len(a) > len(self.a) * self.REBUILD_RATIO:
            self._build()
        return True

    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

import bisect
INF = 10 ** 18
n = int(input())
a = list(map(int,input().split()))

a.sort(reverse=True)
S = SortedSet(a)
maxa = max(a) + 1
ans = 0

for i in range(n):
    ans += a[i] * (2 * i - n + 1)

    
for i in range(n - 1, -1, -1):
    S.discard(a[i])
    for j in range(0, maxa, a[i]):
        cnt = S.index(j + a[i]) - S.index(j)
        ans += j * cnt 



print(ans)
0