結果

問題 No.2665 Minimize Inversions of Deque
ユーザー tassei903tassei903
提出日時 2024-03-08 22:19:42
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 221 ms / 2,000 ms
コード長 1,871 bytes
コンパイル時間 223 ms
コンパイル使用メモリ 82,440 KB
実行使用メモリ 110,960 KB
最終ジャッジ日時 2024-09-29 19:50:02
合計ジャッジ時間 8,160 ms
ジャッジサーバーID
(参考情報)
judge4 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes")
no = lambda :print("no");No = lambda :print("No")
#######################################################################
# Binary Indexed Tree (Fenwick Tree)
# 0-indexed
class BIT:
def __init__(self, n):
self.n = n
self.data = [0]*(n+1)
self.el = [0]*(n+1)
def sum(self, i):
s = 0
while i > 0:
s += self.data[i]
i -= i & -i
return s
def add(self, i, x):
assert 0 <= i < self.n
i = i+1
self.el[i] += x
while i <= self.n:
self.data[i] += x
i += i & -i
def set(self, i, x):
assert 0 <= i <= self.n
self.add(i,x-self.get(i))
def get(self, i, j=None):# j=Nonei, [i, j)
if j is None:
return self.el[i+1]
return self.sum(j) - self.sum(i)
def lower_bound(self, k):# a[0],…,a[i]>ki
x = 0
r = 1
while r <= n:r <<= 1
size = r
while size:
if x + size <= n and self.data[x+size] <= k:
k-=self.data[x+size]
x += size
size >>= 1
return x
def debug(self):
res = []
n = self.n
for i in range(n):
res.append(self.get(i))
print(*res)
for _ in range(ni()):
n = ni()
p = [x-1 for x in na()]
ansl = []
ansr = []
bit = BIT(n)
f = 0
for i in range(n):
x = bit.get(0, p[i])
if x*2 < i:
f += x
ansl.append(p[i]+1)
else:
f += i - x
ansr.append(p[i]+1)
bit.add(p[i], 1)
print(f)
print(*(ansl[::-1] + ansr))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0