#958545 (PyPy3) No.2665 Minimize Inversions of Deque

提出ソース

結果

問題	No.2665 Minimize Inversions of Deque
ユーザー	nikoro256
提出日時	2024-03-08 21:55:25
言語	PyPy3 (7.3.15)
結果	AC
実行時間	509 ms / 2,000 ms
コード長	5,536 bytes
コンパイル時間	281 ms
コンパイル使用メモリ	82,516 KB
実行使用メモリ	130,024 KB
最終ジャッジ日時	2024-09-29 19:34:54
合計ジャッジ時間	14,645 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	56 ms 69,288 KB
testcase_01	AC	309 ms 80,596 KB
testcase_02	AC	370 ms 82,428 KB
testcase_03	AC	260 ms 80,460 KB
testcase_04	AC	271 ms 81,120 KB
testcase_05	AC	276 ms 80,476 KB
testcase_06	AC	264 ms 80,336 KB
testcase_07	AC	277 ms 80,652 KB
testcase_08	AC	254 ms 80,628 KB
testcase_09	AC	275 ms 80,732 KB
testcase_10	AC	262 ms 79,648 KB
testcase_11	AC	259 ms 80,788 KB
testcase_12	AC	257 ms 80,520 KB
testcase_13	AC	262 ms 80,920 KB
testcase_14	AC	258 ms 80,512 KB
testcase_15	AC	269 ms 80,232 KB
testcase_16	AC	264 ms 79,884 KB
testcase_17	AC	261 ms 80,268 KB
testcase_18	AC	246 ms 79,624 KB
testcase_19	AC	152 ms 79,868 KB
testcase_20	AC	137 ms 80,680 KB
testcase_21	AC	145 ms 80,280 KB
testcase_22	AC	125 ms 79,844 KB
testcase_23	AC	116 ms 79,816 KB
testcase_24	AC	136 ms 80,200 KB
testcase_25	AC	121 ms 79,644 KB
testcase_26	AC	136 ms 80,196 KB
testcase_27	AC	136 ms 80,172 KB
testcase_28	AC	119 ms 79,740 KB
testcase_29	AC	126 ms 79,788 KB
testcase_30	AC	470 ms 109,532 KB
testcase_31	AC	403 ms 96,440 KB
testcase_32	AC	425 ms 105,416 KB
testcase_33	AC	444 ms 108,328 KB
testcase_34	AC	394 ms 96,532 KB
testcase_35	AC	509 ms 130,024 KB
testcase_36	AC	505 ms 129,384 KB
testcase_37	AC	422 ms 101,308 KB
testcase_38	AC	449 ms 108,532 KB
testcase_39	AC	478 ms 118,072 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

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

    def _build(self, a: Optional[List[T]] = None) -> None:
        "Evenly divide `a` into buckets."
        if a is None: a = list(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)
        self.size = len(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 __eq__(self, other) -> bool:
        return list(self) == list(other)
    
    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 _position(self, x: T) -> Tuple[List[T], int]:
        "Find the bucket and position which x should be inserted. self must not be empty."
        for a in self.a:
            if x <= a[-1]: break
        return (a, bisect_left(a, x))

    def __contains__(self, x: T) -> bool:
        if self.size == 0: return False
        a, i = self._position(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, i = self._position(x)
        a.insert(i, x)
        self.size += 1
        if len(a) > len(self.a) * self.REBUILD_RATIO:
            self._build()
    
    def _pop(self, a: List[T], i: int) -> T:
        ans = a.pop(i)
        self.size -= 1
        if not a: self._build()
        return ans

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

    def lt(self, x: T) -> Optional[T]:
        "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) -> Optional[T]:
        "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) -> Optional[T]:
        "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) -> Optional[T]:
        "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, i: int) -> T:
        "Return the i-th element."
        if i < 0:
            for a in reversed(self.a):
                i += len(a)
                if i >= 0: return a[i]
        else:
            for a in self.a:
                if i < len(a): return a[i]
                i -= len(a)
        raise IndexError
    
    def pop(self, i: int = -1) -> T:
        "Pop and return the i-th element."
        if i < 0:
            for a in reversed(self.a):
                i += len(a)
                if i >= 0: return self._pop(a, i)
        else:
            for a in self.a:
                if i < len(a): return self._pop(a, i)
                i -= 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

from collections import deque
T=int(input())
for _ in range(T):
    N=int(input())
    P=list(map(int,input().split()))
    smt=SortedMultiset()
    dq=deque()
    ans=0
    for i in range(N):
        if len(dq)==0:
            dq.append(P[i])
            smt.add(P[i])
            continue
        small=smt.index(P[i])
        big=len(smt)-small
        if big>small:
            ans+=small
            dq.appendleft(P[i])
        elif big==small:
            ans+=big
            if dq[0]<P[i]:
                dq.append(P[i])
            else:
                dq.appendleft(P[i])
        else:
            ans+=big
            dq.append(P[i])
        smt.add(P[i])
    print(ans)
    print(' '.join([str(x) for x in dq]))

yukicoder

結果

テストケース

ソースコード