結果

問題 No.738 平らな農地
ユーザー maspy
提出日時 2020-03-27 08:57:24
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 384 ms / 2,000 ms
コード長 2,163 bytes
コンパイル時間 367 ms
コンパイル使用メモリ 82,100 KB
実行使用メモリ 127,144 KB
最終ジャッジ日時 2025-01-02 08:17:08
合計ジャッジ時間 21,146 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 5
other AC * 87
権限があれば一括ダウンロードができます

ソースコード

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

#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
class BinaryIndexedTree():
def __init__(self, seq):
self.size = len(seq)
self.depth = self.size.bit_length()
self.build(seq)
def build(self, seq):
data = seq
size = self.size
for i, x in enumerate(data):
j = i + (i & (-i))
if j < size:
data[j] += data[i]
self.data = data
def __repr__(self):
return self.data.__repr__()
def get_sum(self, i):
data = self.data
s = 0
while i:
s += data[i]
i -= i & -i
return s
def add(self, i, x):
data = self.data
size = self.size
while i < size:
data[i] += x
i += i & -i
def find_kth_element(self, k):
data = self.data
size = self.size
x, sx = 0, 0
dx = 1 << (self.depth)
for i in range(self.depth - 1, -1, -1):
dx = (1 << i)
if x + dx >= size:
continue
y = x + dx
sy = sx + data[y]
if sy < k:
x, sx = y, sy
return x + 1
N, K, *A = map(int, read().split())
sortedA = sorted(set(A))
elem_rank = {x: i for i, x in enumerate(sortedA, 1)}
bit_num = BinaryIndexedTree([0] * (N + 10))
bit_sum = BinaryIndexedTree([0] * (N + 10))
total = 0
for x in A[:K - 1]:
r = elem_rank[x]
bit_num.add(r, 1)
bit_sum.add(r, x)
total += x
answer = 10 ** 15
for add_x, rm_x in zip(A[K - 1:], A):
add_r = elem_rank[add_x]
rm_r = elem_rank[rm_x]
bit_num.add(add_r, 1)
bit_sum.add(add_r, add_x)
total += add_x
n = (K + 1) // 2
median_r = bit_num.find_kth_element(n)
median = sortedA[median_r - 1]
nl = bit_num.get_sum(median_r)
nr = K - nl
sl = bit_sum.get_sum(median_r)
sr = total - sl
cost = (nl * median - sl) + (sr - nr * median)
if answer > cost:
answer = cost
bit_num.add(rm_r, -1)
bit_sum.add(rm_r, -rm_x)
total -= rm_x
print(answer)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0