結果

問題 No.1391 ±1 Abs Sum
ユーザー ansain
提出日時 2021-02-12 23:17:15
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 1,885 bytes
コンパイル時間 212 ms
コンパイル使用メモリ 82,068 KB
実行使用メモリ 123,636 KB
最終ジャッジ日時 2024-07-20 00:51:55
合計ジャッジ時間 5,002 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 25 TLE * 9
権限があれば一括ダウンロードができます

ソースコード

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

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) i4i8 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()))
accA = [0]+list(accumulate(A))
ans = 10**20
for i in range(n):
ng, ok = -1, 2*10**9+10 # abs(ok)k
while (abs(ok - ng) > 1):
mid = (ok + ng) // 2
r = bisect_right(A, A[i]+mid)
l = bisect_left(A, A[i]-mid)
if r-l >= k:
ok = mid
else:
ng = mid
r = bisect_right(A, A[i]+ok)
l = bisect_left(A, A[i]-ok)
plusone = accA[r]-accA[i]-A[i] * (r-i)-accA[i]+accA[l]+A[i]*(i-l)-ok*(k-(r-l))
minusone = accA[n]-accA[r]-A[i]*(n-r)-accA[l]+A[i]*l+ok*(k-(r-l))
ans = min(ans, plusone-minusone)
# print(ans,l,r,ok,mid)
print(ans)
if __name__ == '__main__':
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0