結果

問題 No.2665 Minimize Inversions of Deque
ユーザー なえしら
提出日時 2024-07-19 00:23:04
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 539 ms / 2,000 ms
コード長 4,721 bytes
コンパイル時間 381 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 112,072 KB
最終ジャッジ日時 2024-07-19 00:23:22
合計ジャッジ時間 17,305 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

diff # 

# 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, List, Tuple, TypeVar, Optional
T = TypeVar('T')

class SortedSet(Generic[T]):
  BUCKET_RATIO = 16
  SPLIT_RATIO = 24
  
  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)
    n = self.size = len(a)
    if any(a[i] > a[i + 1] for i in range(n - 1)):
      a.sort()
    if any(a[i] >= a[i + 1] for i in range(n - 1)):
      a, b = [], a
      for x in b:
        if not a or a[-1] != x:
          a.append(x)
    bucket_size = int(math.ceil(math.sqrt(n / self.BUCKET_RATIO)))
    self.a = [a[n * i // bucket_size : n * (i + 1) // bucket_size] for i in range(bucket_size)]
  
  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 "SortedSet" + 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, int]:
    "return the bucket, index of the bucket and position in which x should be. self must not be empty."
    for i, a in enumerate(self.a):
      if x <= a[-1]: break
    return (a, i, 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 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, b, i = self._position(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.SPLIT_RATIO:
      mid = len(a) >> 1
      self.a[b:b+1] = [a[:mid], a[mid:]]
    return True
  
  def _pop(self, a: List[T], b: int, i: int) -> T:
    ans = a.pop(i)
    self.size -= 1
    if not a: del self.a[b]
    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, b, i = self._position(x)
    if i == len(a) or a[i] != x: return False
    self._pop(a, b, 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 b, a in enumerate(reversed(self.a)):
        i += len(a)
        if i >= 0: return self._pop(a, ~b, i)
    else:
      for b, a in enumerate(self.a):
        if i < len(a): return self._pop(a, b, 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()))

  x = 0
  A = deque()
  S = SortedSet()

  for k, p in enumerate(P):
    S.add(p)
    i = S.index(p)
    x += min(i, k - i)
    if 2*i < k or 2*i == k and A and p < A[0]:
      A.appendleft(p)
    else:
      A.append(p)
  
  print(x)
  print(*A)
0