結果

問題 No.2665 Minimize Inversions of Deque
ユーザー nikoro256nikoro256
提出日時 2024-03-08 21:55:25
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 601 ms / 2,000 ms
コード長 5,536 bytes
コンパイル時間 246 ms
コンパイル使用メモリ 81,828 KB
実行使用メモリ 128,840 KB
最終ジャッジ日時 2024-03-08 21:55:42
合計ジャッジ時間 16,278 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
67,856 KB
testcase_01 AC 365 ms
80,120 KB
testcase_02 AC 439 ms
81,904 KB
testcase_03 AC 322 ms
79,700 KB
testcase_04 AC 327 ms
79,868 KB
testcase_05 AC 335 ms
79,600 KB
testcase_06 AC 320 ms
79,768 KB
testcase_07 AC 340 ms
80,008 KB
testcase_08 AC 327 ms
79,468 KB
testcase_09 AC 328 ms
79,708 KB
testcase_10 AC 318 ms
78,984 KB
testcase_11 AC 326 ms
79,524 KB
testcase_12 AC 313 ms
79,568 KB
testcase_13 AC 324 ms
80,208 KB
testcase_14 AC 321 ms
79,464 KB
testcase_15 AC 337 ms
79,648 KB
testcase_16 AC 313 ms
79,112 KB
testcase_17 AC 317 ms
79,952 KB
testcase_18 AC 303 ms
78,844 KB
testcase_19 AC 179 ms
79,108 KB
testcase_20 AC 160 ms
79,548 KB
testcase_21 AC 162 ms
79,488 KB
testcase_22 AC 139 ms
78,928 KB
testcase_23 AC 133 ms
79,052 KB
testcase_24 AC 161 ms
79,420 KB
testcase_25 AC 138 ms
79,056 KB
testcase_26 AC 156 ms
79,184 KB
testcase_27 AC 157 ms
79,184 KB
testcase_28 AC 138 ms
78,928 KB
testcase_29 AC 138 ms
78,924 KB
testcase_30 AC 528 ms
108,436 KB
testcase_31 AC 467 ms
93,456 KB
testcase_32 AC 494 ms
100,520 KB
testcase_33 AC 518 ms
107,420 KB
testcase_34 AC 458 ms
95,624 KB
testcase_35 AC 586 ms
128,840 KB
testcase_36 AC 601 ms
127,328 KB
testcase_37 AC 493 ms
100,844 KB
testcase_38 AC 524 ms
108,248 KB
testcase_39 AC 588 ms
117,280 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# 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]))
0