結果
問題 | No.1391 ±1 Abs Sum |
ユーザー | ansain |
提出日時 | 2021-02-13 00:09:03 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,088 bytes |
コンパイル時間 | 162 ms |
コンパイル使用メモリ | 11,032 KB |
実行使用メモリ | 31,412 KB |
最終ジャッジ日時 | 2023-09-27 07:57:56 |
合計ジャッジ時間 | 10,617 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 20 ms
8,716 KB |
testcase_01 | AC | 19 ms
8,756 KB |
testcase_02 | AC | 19 ms
8,788 KB |
testcase_03 | AC | 21 ms
8,700 KB |
testcase_04 | AC | 20 ms
8,740 KB |
testcase_05 | AC | 19 ms
8,748 KB |
testcase_06 | AC | 19 ms
8,828 KB |
testcase_07 | AC | 19 ms
8,780 KB |
testcase_08 | AC | 20 ms
8,792 KB |
testcase_09 | AC | 19 ms
8,720 KB |
testcase_10 | AC | 19 ms
8,668 KB |
testcase_11 | AC | 446 ms
30,600 KB |
testcase_12 | AC | 330 ms
25,596 KB |
testcase_13 | AC | 403 ms
29,168 KB |
testcase_14 | AC | 299 ms
21,152 KB |
testcase_15 | AC | 311 ms
21,552 KB |
testcase_16 | AC | 384 ms
25,088 KB |
testcase_17 | AC | 347 ms
23,120 KB |
testcase_18 | AC | 448 ms
28,756 KB |
testcase_19 | AC | 277 ms
22,984 KB |
testcase_20 | AC | 439 ms
30,236 KB |
testcase_21 | AC | 306 ms
26,948 KB |
testcase_22 | AC | 313 ms
26,876 KB |
testcase_23 | AC | 360 ms
30,148 KB |
testcase_24 | AC | 332 ms
27,280 KB |
testcase_25 | AC | 337 ms
30,056 KB |
testcase_26 | AC | 353 ms
29,976 KB |
testcase_27 | AC | 240 ms
22,932 KB |
testcase_28 | AC | 246 ms
22,368 KB |
testcase_29 | AC | 327 ms
27,968 KB |
testcase_30 | AC | 281 ms
25,228 KB |
testcase_31 | AC | 463 ms
31,064 KB |
testcase_32 | AC | 263 ms
20,128 KB |
testcase_33 | AC | 299 ms
21,760 KB |
testcase_34 | AC | 355 ms
29,548 KB |
testcase_35 | RE | - |
testcase_36 | AC | 362 ms
31,412 KB |
ソースコード
import sys from collections import defaultdict, Counter, deque from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate import operator from math import sqrt, gcd, factorial # from math import isqrt, prod,comb # python3.8用(notpypy) from bisect import bisect_left, bisect_right #from functools import lru_cache,reduce #from heapq import heappush,heappop,heapify,heappushpop,heapreplace #import numpy as np #import networkx as nx #from networkx.utils import UnionFind #from numba import njit, b1, i1, i4, i8, f8 #from scipy.sparse import csr_matrix #from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError # numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1 def input(): return sys.stdin.readline().rstrip() def divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no) def main(): mod = 10**9+7 mod2 = 998244353 n, k = map(int, input().split()) A = list(map(int, input().split())) + [10**16] accA = [0]+list(accumulate(A)) ans = 10**20 l = 0 r = k for i in range(n): Ai = A[i] while max(abs(Ai-A[l]), abs(Ai-A[r-1])) >= max(abs(Ai-A[l+1]), abs(Ai-A[r])): l += 1 r += 1 """ ng, ok = -1, 2*10**9+10 # abs(ok)以下でk個揃えられるか? while (abs(ok - ng) > 1): mid = (ok + ng) // 2 r = bisect_right(A, Ai+mid) l = bisect_left(A, Ai-mid) if r-l >= k: ok = mid else: ng = mid r = bisect_right(A, Ai+ok) l = bisect_left(A, Ai-ok) """ plusone = accA[r]-accA[i]-Ai * \ (r-i)-accA[i]+accA[l]+Ai*(i-l) # -ok*(k-(r-l)) minusone = accA[n]-accA[r]-Ai*(n-r)-accA[l]+Ai*l # +ok*(k-(r-l)) ans = min(ans, plusone-minusone) # print(ans,l,r,ok,mid) print(ans) if __name__ == '__main__': main()