結果
問題 | No.738 平らな農地 |
ユーザー | maspy |
提出日時 | 2020-03-27 08:57:24 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 412 ms / 2,000 ms |
コード長 | 2,163 bytes |
コンパイル時間 | 393 ms |
コンパイル使用メモリ | 87,156 KB |
実行使用メモリ | 127,608 KB |
最終ジャッジ日時 | 2023-08-30 16:11:37 |
合計ジャッジ時間 | 25,509 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 78 ms
71,072 KB |
testcase_01 | AC | 77 ms
71,080 KB |
testcase_02 | AC | 74 ms
71,328 KB |
testcase_03 | AC | 77 ms
71,076 KB |
testcase_04 | AC | 75 ms
70,964 KB |
testcase_05 | AC | 114 ms
78,060 KB |
testcase_06 | AC | 114 ms
77,852 KB |
testcase_07 | AC | 117 ms
77,736 KB |
testcase_08 | AC | 97 ms
76,228 KB |
testcase_09 | AC | 93 ms
75,764 KB |
testcase_10 | AC | 83 ms
75,616 KB |
testcase_11 | AC | 99 ms
76,168 KB |
testcase_12 | AC | 94 ms
75,788 KB |
testcase_13 | AC | 112 ms
77,880 KB |
testcase_14 | AC | 95 ms
76,084 KB |
testcase_15 | AC | 301 ms
110,000 KB |
testcase_16 | AC | 310 ms
113,604 KB |
testcase_17 | AC | 348 ms
113,328 KB |
testcase_18 | AC | 320 ms
109,848 KB |
testcase_19 | AC | 371 ms
114,716 KB |
testcase_20 | AC | 326 ms
113,548 KB |
testcase_21 | AC | 380 ms
113,784 KB |
testcase_22 | AC | 336 ms
113,460 KB |
testcase_23 | AC | 368 ms
113,876 KB |
testcase_24 | AC | 365 ms
113,256 KB |
testcase_25 | AC | 93 ms
76,344 KB |
testcase_26 | AC | 93 ms
75,836 KB |
testcase_27 | AC | 97 ms
76,008 KB |
testcase_28 | AC | 95 ms
75,892 KB |
testcase_29 | AC | 96 ms
75,736 KB |
testcase_30 | AC | 98 ms
76,072 KB |
testcase_31 | AC | 96 ms
76,040 KB |
testcase_32 | AC | 95 ms
75,884 KB |
testcase_33 | AC | 97 ms
75,808 KB |
testcase_34 | AC | 93 ms
75,748 KB |
testcase_35 | AC | 94 ms
76,088 KB |
testcase_36 | AC | 95 ms
75,880 KB |
testcase_37 | AC | 95 ms
75,916 KB |
testcase_38 | AC | 91 ms
76,080 KB |
testcase_39 | AC | 91 ms
75,784 KB |
testcase_40 | AC | 93 ms
75,752 KB |
testcase_41 | AC | 95 ms
75,796 KB |
testcase_42 | AC | 93 ms
75,784 KB |
testcase_43 | AC | 97 ms
75,884 KB |
testcase_44 | AC | 92 ms
75,808 KB |
testcase_45 | AC | 333 ms
117,312 KB |
testcase_46 | AC | 322 ms
112,504 KB |
testcase_47 | AC | 326 ms
116,588 KB |
testcase_48 | AC | 291 ms
116,052 KB |
testcase_49 | AC | 303 ms
114,252 KB |
testcase_50 | AC | 310 ms
116,524 KB |
testcase_51 | AC | 312 ms
116,548 KB |
testcase_52 | AC | 326 ms
114,240 KB |
testcase_53 | AC | 310 ms
116,192 KB |
testcase_54 | AC | 335 ms
116,368 KB |
testcase_55 | AC | 316 ms
116,800 KB |
testcase_56 | AC | 331 ms
116,220 KB |
testcase_57 | AC | 305 ms
112,132 KB |
testcase_58 | AC | 325 ms
116,068 KB |
testcase_59 | AC | 312 ms
116,916 KB |
testcase_60 | AC | 326 ms
117,088 KB |
testcase_61 | AC | 321 ms
117,224 KB |
testcase_62 | AC | 295 ms
112,488 KB |
testcase_63 | AC | 324 ms
116,996 KB |
testcase_64 | AC | 317 ms
117,184 KB |
testcase_65 | AC | 340 ms
114,176 KB |
testcase_66 | AC | 347 ms
114,324 KB |
testcase_67 | AC | 307 ms
120,932 KB |
testcase_68 | AC | 298 ms
126,344 KB |
testcase_69 | AC | 358 ms
125,980 KB |
testcase_70 | AC | 334 ms
126,456 KB |
testcase_71 | AC | 219 ms
93,284 KB |
testcase_72 | AC | 206 ms
92,724 KB |
testcase_73 | AC | 196 ms
94,736 KB |
testcase_74 | AC | 219 ms
94,592 KB |
testcase_75 | AC | 327 ms
121,044 KB |
testcase_76 | AC | 308 ms
126,280 KB |
testcase_77 | AC | 330 ms
121,248 KB |
testcase_78 | AC | 351 ms
126,968 KB |
testcase_79 | AC | 353 ms
127,032 KB |
testcase_80 | AC | 318 ms
126,336 KB |
testcase_81 | AC | 334 ms
125,588 KB |
testcase_82 | AC | 326 ms
126,192 KB |
testcase_83 | AC | 275 ms
94,716 KB |
testcase_84 | AC | 220 ms
94,428 KB |
testcase_85 | AC | 412 ms
127,608 KB |
testcase_86 | AC | 385 ms
121,744 KB |
testcase_87 | AC | 242 ms
126,820 KB |
testcase_88 | AC | 233 ms
121,752 KB |
testcase_89 | AC | 74 ms
70,984 KB |
testcase_90 | AC | 78 ms
71,072 KB |
testcase_91 | AC | 76 ms
71,068 KB |
ソースコード
#!/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)