結果

問題 No.2603 Tone Correction
ユーザー 👑 timitimi
提出日時 2024-01-12 22:34:37
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 809 ms / 2,000 ms
コード長 4,719 bytes
コンパイル時間 166 ms
コンパイル使用メモリ 81,700 KB
実行使用メモリ 172,896 KB
最終ジャッジ日時 2024-01-12 22:35:18
合計ジャッジ時間 19,770 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
67,868 KB
testcase_01 AC 68 ms
67,868 KB
testcase_02 AC 63 ms
67,868 KB
testcase_03 AC 161 ms
79,212 KB
testcase_04 AC 168 ms
79,216 KB
testcase_05 AC 162 ms
79,188 KB
testcase_06 AC 162 ms
79,224 KB
testcase_07 AC 161 ms
79,204 KB
testcase_08 AC 155 ms
79,240 KB
testcase_09 AC 175 ms
79,224 KB
testcase_10 AC 171 ms
79,272 KB
testcase_11 AC 160 ms
79,188 KB
testcase_12 AC 164 ms
79,180 KB
testcase_13 AC 809 ms
172,896 KB
testcase_14 AC 788 ms
172,892 KB
testcase_15 AC 802 ms
172,768 KB
testcase_16 AC 775 ms
172,892 KB
testcase_17 AC 797 ms
172,892 KB
testcase_18 AC 796 ms
172,892 KB
testcase_19 AC 762 ms
172,888 KB
testcase_20 AC 785 ms
172,888 KB
testcase_21 AC 781 ms
172,768 KB
testcase_22 AC 800 ms
172,892 KB
testcase_23 AC 782 ms
152,888 KB
testcase_24 AC 753 ms
152,884 KB
testcase_25 AC 772 ms
152,884 KB
testcase_26 AC 747 ms
152,884 KB
testcase_27 AC 789 ms
152,884 KB
testcase_28 AC 748 ms
152,884 KB
testcase_29 AC 782 ms
152,884 KB
testcase_30 AC 741 ms
152,884 KB
testcase_31 AC 769 ms
152,888 KB
testcase_32 AC 726 ms
152,884 KB
testcase_33 AC 75 ms
67,868 KB
testcase_34 AC 197 ms
172,512 KB
testcase_35 AC 201 ms
172,512 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

N,M=map(int, input().split())
A=list(map(int, input().split()))
B=list(map(int, input().split()))
A.append(0);B.append(0)
C=[];p=0
for a in A:
  C.append(a-p)
  p=a
D=[];p=0
for a in B:
  D.append(a-p)
  p=a

E=[]
for i in range(N+1):
  E.append((C[i]-D[i])%M)

import sys
input = sys.stdin.readline
# 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 _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

st = SortedMultiset()
ans=0
for e in E:
  if e!=0:
    st.add(e)

ans=0
while len(st):
  if len(st)>1:
    p,q=st[0],st[-1]
    st.discard(p)
    st.discard(q)
    ans+=min(p,M-q)
    r=(p+q)%M
    if r!=0:
      st.add(r)
print(ans)
0