input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
ans = 10**18
for l in range(N - K + 1):
D = X[l + K - 1] - X[l]
if X[l] <= 0 <= X[l + K - 1]:
D += min(-X[l], X[l + K - 1])
elif X[l + K - 1] <= 0:
D += -X[l + K - 1]
elif X[l] >= 0:
D += X[l]
... | N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
ans = 10**18
for l, r in zip(X, X[K - 1:]):
if r <= 0:
ans = min(ans, abs(l))
if l >= 0:
ans = min(ans, abs(r))
if l < 0 < r:
ans = min(ans, r - l + min(abs(r), abs(l)))
print(ans)
| p03274 |
n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans=4*10**8
# zip関数は多い元は無視する.
for a, b in zip(x, x[k-1:]):
cand = b-a + min(abs(a), abs(b))
ans = min(cand, ans)
print(ans) | n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans=[0]*(n-k+1)
# zip関数は多い元は無視する.
for i, a, b in zip(list(range(n)), x, x[k-1:]):
ans[i] = b-a + min(abs(a), abs(b))
print((min(ans))) | p03274 |
x,y = list(map(int,input().split()))
t = list(map(int,input().split()))
ans = 1000000000000000000000000000000
for i in range(x-y+1):
hani = t[i:i+y]
if hani[0] <= 0 and 0 <= hani[-1]:
ans = min(ans, abs(hani[-1]*2)+abs(hani[0]), abs(hani[-1])+abs(hani[0]*2))
elif hani[-1] <= 0:
ans =... | N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
ans = float("inf")
for left in range(0, N-K+1):
right = left+K
minus = 0
plus = 0
if X[left] < 0:
minus = min(minus, X[left])
if X[right-1] > 0:
plus = max(plus, X[right-1])
ans = min(ans, 2*abs... | p03274 |
N, K = list(map(int, input().split()))
X = [int(x) for x in input().split()]
import bisect
zero = bisect.bisect_left(X, 0)
left = max(zero - K, 0)
ans = float('inf')
while 1:
right = left+K-1
if left > zero + 1 or len(X) <= right: break
lv, rv = X[left], X[right]
if lv * rv > 0:
a... | N, K = list(map(int, input().split()))
X = [int(x) for x in input().split()]
ans = float('inf')
for left in range(N - K + 1):
lv, rv = X[left], X[left+K-1]
if lv * rv > 0:
ans = min(ans, max(abs(rv), abs(lv)))
else:
ans = min(ans, min(rv*2 - lv, rv - lv*2))
print(ans) | p03274 |
N, K = list(map(int, input().split()))
x = list(map(int, input().split()))
if 0 in x:
K -= 1
x.remove(0)
Min = -1
for i in x:
goal = i
if goal > 0:
path = [j for j in x if j < goal]
if len(path) < K-1:
pass
else:
path = path[-K+1:]
... | N, K = list(map(int, input().split()))
x = list(map(int, input().split()))
Min = 10**9
for i in range(N-K+1):
x_l = x[i]
x_r = x[i+K-1]
ans_1 = abs(x_l-0) + abs(x_l-x_r)
ans_2 = abs(x_r-0) + abs(x_l-x_r)
Min = min(Min, ans_1, ans_2)
print(Min)
| p03274 |
import itertools as ito
N,K=list(map(int,input().split(" ")))
X=list(map(int,input().split(" ")))
Ex=list(ito.permutations(X,K))
ans=0
for i in range(len(Ex)):
tans=0
tx=0
for j in range(len(Ex[i])):
tans+=abs(tx-Ex[i][j])
tx=Ex[i][j]
if tans<ans or i==0:
... | N,K=list(map(int,input().split(" ")))
X=sorted(list(map(int,input().split(" "))))
ans=0
for i in range(N-K+1):
tans=abs(X[i]-X[i+K-1])+abs(X[i])
if i==0 or ans>tans:
ans=tans
for i in range(N-K+1):
tans=abs(X[i]-X[i+K-1])+abs(X[i+K-1])
if ans>tans:
ans=tans
print(ans... | p03274 |
import bisect
import sys
n,k = list(map(int,input().split()))
x = list(map(int,input().split()))
index = bisect.bisect_left(x,0)
if x[0] >= 0 :
print((x[k-1]))
sys.exit()
if x[-1] <= 0 :
print((x[n-k]*(-1)))
sys.exit()
ans = 10**9
if min(index+k,n) == index+k :
ans = x[index+k-1]
i... | n,k = list(map(int,input().split()))
x = list(map(int,input().split()))
ans = 10**9
for i in range(n-k+1) :
xs = abs(x[i+k-1]-x[i])
ans = min(ans,xs+abs(x[i]),xs+abs(x[i+k-1]))
print(ans) | p03274 |
N,K = list(map(int,input().split()))
X = [int(i) for i in input().split()]
X_sub = [[] for i in range(N-K+1)]
for i in range(N-K+1):
X_sub[i] = X[i:i+K]
min_cost = float('inf')
for i in X_sub:
tmp_l = abs(i[0]) + abs(i[-1]-i[0])
tmp_r = abs(i[-1]) + abs(i[0]-i[-1])
tmp = min(tmp_l,tmp_r... | N,K = list(map(int,input().split()))
X = [int(i) for i in input().split()]
min_cost = float('inf')
for i in range(N-K+1):
sub_x = X[i:i+K]
tmp_l = abs(sub_x[0]) + abs(sub_x[-1]-sub_x[0])
tmp_r = abs(sub_x[-1]) + abs(sub_x[0]-sub_x[-1])
tmp = min(tmp_l,tmp_r)
if min_cost > tmp:
... | p03274 |
n,k=list(map(int,input().split()))
x=list(map(int,input().split()))
ans=10**9
for i in range(n-k+1):
if x[i+k-1]<0:
ans=min(ans,-x[i])
elif x[i]>0:
ans=min(ans,x[i+k-1])
else:
ans=min(ans,2*x[i+k-1]-x[i],2*(-x[i])+x[i+k-1])
print(ans) | import sys
input = sys.stdin.buffer.readline
input = sys.stdin.readline
# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
#import numpy as np
def main():
n,k=list(map(int,input().split()))
x=list(map(int,input().split()))
ans=10**18
for i in range(n):
try:
l=x[i]
r=... | p03274 |
import sys
input = sys.stdin.buffer.readline
input = sys.stdin.readline
# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
#import numpy as np
def main():
n,k=list(map(int,input().split()))
x=list(map(int,input().split()))
ans=10**18
for i in range(n):
try:
l=x[i]
r=... | import sys
input = sys.stdin.buffer.readline
#input = sys.stdin.readline
# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
#import numpy as np
def main():
n,k=list(map(int,input().split()))
x=list(map(int,input().split()))
ans=10**18
for i in range(n):
try:
l=x[i]
r... | p03274 |
n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
if x[0] >= 0:
print((x[k - 1]))
exit()
elif x[n - 1] < 0:
print((abs(x[n - k])))
exit()
else:
for i in range(n):
if x[i] >= 0:
ori = i
break
f_inf = float("inf")
res = f_inf
... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, k = list(map(int, input().split()))
X = list(map(int, input().split()))
if X[0] >= 0:
print((X[k - 1]))
exit()
elif X[-1] < 0:
print((... | p03274 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, k = list(map(int, input().split()))
X = list(map(int, input().split()))
if X[0] >= 0:
print((X[k - 1]))
exit()
elif X[-1] < 0:
print((... | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, k = list(map(int, input().split()))
X = list(map(int, input().split()))
for i in range(n):
if X[i] >= 0:
ori = i
X.insert(ori, 0)
break
else:... | p03274 |
N,K = list(map(int, input().split()))
X = [int(x) for x in input().split()]
ref = []
for i in range(N-K+1):
ref.append(X[i:i+K])
List = []
for j in range(N-K+1):
if X[j]<=0 and X[j+K-1]>=0:
List.append(X[j+K-1]-X[j]+min(abs(X[j]),X[j+K-1]))
else:
List.append(max(abs(X[j]),abs(X... | N,K = list(map(int, input().split()))
X = [int(x) for x in input().split()]
List = []
for j in range(N-K+1):
if X[j]<=0 and X[j+K-1]>=0:
List.append(X[j+K-1]-X[j]+min(abs(X[j]),X[j+K-1]))
else:
List.append(max(abs(X[j]),abs(X[j+K-1])))
print((min(List))) | p03274 |
N, K = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = 3*10**8
for i in range(N-K+1):
ans1 = abs(x[i])+abs(x[i]-x[i+K-1])
ans2 = abs(x[i+K-1])+abs(x[i]-x[i+K-1])
ans = min(ans, ans1, ans2)
print(ans) | N, K = list(map(int, input().split()))
x = [int(i) for i in input().split()]
ans = x[K - 1] - x[0] + min(abs(x[0]), abs(x[K - 1]))
for i in range(N - K + 1):
ans = min(ans, x[K + i -1] - x[i] + min(abs(x[K + i -1]), abs(x[i])) )
print(ans) | p03274 |
n,k=list(map(int,input().split()))
x=list(map(int,input().split()))
import bisect
c=bisect.bisect_left(x,0)
mt=2*10**8
for i in range(n-k+1):
if i+k<c:continue
mt=min(mt,2*abs(x[i])+abs(x[i+k-1]),abs(x[i])+2*abs(x[i+k-1]))
if i+k-1 ==c-1:mt=min(mt,abs(x[i]))
if i==c:mt=min(mt,x[i+k-1])
if n==k:
... | n,k=list(map(int,input().split()))
x=list(map(int,input().split()))
mt=5*10**8
for i in range(n-k+1):
mt=min(mt,2*abs(x[i])+abs(x[i+k-1]),abs(x[i])+2*abs(x[i+k-1]))
if x[0]>0:mt=min(mt,x[k-1])
elif x[-1]<0:mt=min(mt,abs(x[-1-k+1]))
print(mt)
| p03274 |
import bisect
n,k = list(map(int, input().split()))
x = list(map(int, input().split()))
z = bisect.bisect_left(x,0)
ans=10**12
s=z-k+1
if s < 0:
s=0
if z == 0:
z+=1
for i in range(s,z):
t=x[i:i+k]
xl=min(t)
xr=max(t)
ans=min(ans,abs(xr)+abs(xr-xl),abs(xl)+abs(xr-xl))
print(ans) | import bisect
n,k = list(map(int, input().split()))
x = list(map(int, input().split()))
z = bisect.bisect_left(x,0)
ans=10**12
s=z-k
if s < 0:
s=0
g=z+1
if g+k >= n:
g=n-k+1
for i in range(s,g):
xl=x[i]
xr=x[i+k-1]
ans=min(ans,abs(xr)+abs(xr-xl),abs(xl)+abs(xr-xl))
print(ans) | p03274 |
# coding: utf-8
# Your code here!
import bisect
from collections import defaultdict
import sys
sys.setrecursionlimit(int(1e6))
N, K = list(map(int, input().rstrip().split(' ')))
X = sorted(list(map(int, input().rstrip().split(' '))))
i = bisect.bisect_left(X, 0)
X.insert(i, 0)
memo = defaultdict(l... | # coding: utf-8
# Your code here!
N, K = list(map(int, input().rstrip().split(' ')))
X = list(map(int, input().rstrip().split(' ')))
min_cost = int(1e10)
for i in range(K, N+1):
min_cost = min(min_cost, X[i-1] - X[i-K] + min(abs(X[i-1]), abs(X[i-K])))
print(min_cost)
| p03274 |
from bisect import bisect_left
n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
if 0 in x:
x.remove(0)
k -= 1
n -= 1
if n == 0:
print((0))
else:
si = bisect_left(x, 0)
ans = (x[-1] - x[0]) * 2
if si + k - 1 < len(x):
ans = min(ans, x[si + ... | from bisect import bisect_left
n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
si = bisect_left(x, 0)
ans = (x[-1] - x[0]) * 2
if si + k - 1 < len(x):
ans = min(ans, x[si + k - 1])
if si - k >= 0:
ans = min(ans, abs(x[si - k]))
for i in range(n):
tmp_ans = 0
... | p03274 |
from bisect import bisect_left
n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
si = bisect_left(x, 0)
ans = (x[-1] - x[0]) * 2
if si + k - 1 < len(x):
ans = min(ans, x[si + k - 1])
if si - k >= 0:
ans = min(ans, abs(x[si - k]))
for i in range(n):
tmp_ans = 0
... | n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = 10**9
for i in range(n - k + 1):
cand = x[i + k - 1] - x[i] + min(abs(x[i + k - 1]), abs(x[i]))
ans = min(ans, cand)
print(ans)
| p03274 |
n,k = list(map(int,input().split()))
x = list(map(int,input().split()))
ans = 10**9
for i in range(n-k+1):
x2 = x[i:i+k]
if x2[0]*x2[-1] < 0:
left = 2*abs(x2[0])+abs(x2[-1])
right = 2*abs(x2[-1])+abs(x2[0])
ans= min(ans,min(left,right))
else:
ans = min(ans,max(abs(x... | n,k = list(map(int,input().split()))
x = list(map(int,input().split()))
ans = 10**9
for i in range(n-k+1):
if x[i]*x[i+k-1] < 0:
left = 2*abs(x[i])+abs(x[i+k-1])
right = 2*abs(x[i+k-1])+abs(x[i])
ans= min(ans,min(left,right))
else:
ans = min(ans,max(abs(x[i]),abs(x[i+k-1... | p03274 |
n, k = list(map(int, input().split()))
xlis = list(map(int, input().split()))
ret = 10 ** 100
for i in range(n-k+1):
cand = xlis[i:k+i]
min_val = cand[0]
max_val = cand[-1]
if min_val * max_val >= 0:
tmp = max(abs(min_val), abs(max_val))
ret = min(ret, tmp)
else:
f... | n, k = list(map(int, input().split()))
xlis = list(map(int, input().split()))
ret = 10 ** 100
for i in range(n-k+1):
min_val = xlis[i]
max_val = xlis[k+i-1]
if min_val * max_val >= 0:
tmp = max(abs(min_val), abs(max_val))
ret = min(ret, tmp)
else:
fst = min(abs(min_val)... | p03274 |
import sys
input = sys.stdin.readline
def main():
_, K = list(map(int, input().split()))
X = [int(c) for c in input().split()]
def fullsearch():
for l, r in zip(X, X[K-1:]):
distance = abs(r - l)
yield distance + abs(r)
yield distance + abs(l)
... | import sys
input = sys.stdin.readline
def main():
_, K = list(map(int, input().split()))
X = list(map(int, input().split()))
def fullsearch():
for l, r in zip(X, X[K-1:]):
distance = abs(r - l)
yield distance + abs(r)
yield distance + abs(l)
... | p03274 |
import sys
input = sys.stdin.readline
def main():
_, K = list(map(int, input().split()))
X = list(map(int, input().split()))
def fullsearch():
for l, r in zip(X, X[K-1:]):
distance = abs(r - l)
yield distance + abs(r)
yield distance + abs(l)
... | import sys
input = sys.stdin.readline
def fullsearch(x, k):
for l, r in zip(x, x[k-1:]):
distance = abs(r - l)
yield distance + abs(r)
yield distance + abs(l)
def main():
_, K = list(map(int, input().split()))
X = list(map(int, input().split()))
print((min(ful... | p03274 |
# sys.stdin.readline()
import sys
input = sys.stdin.readline
n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
x_p = [0] + [p for p in x if p > 0]#正
x_z = x.count(0)#0
x_n = [(-1) * ng for ng in x if ng < 0]#負
x_n = [0] + sorted(x_n)#0から始まる絶対値
myK = k - x_z#左右に移動して点火するろうそく数
if... | n , k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = float('inf')
for i in range(n - k + 1):
ans = min(
ans,
abs(x[i]) + abs(x[i + k - 1] - x[i]),
abs(x[i + k - 1]) + abs(x[i + k - 1] - x[i])
)
print(ans) | p03274 |
inf = float('inf')
N, K = list(map(int, input().split()))
x = tuple(map(int, input().split()))
m, p = [], []
for xx in x:
if xx > 0:
p.append(xx)
elif xx < 0:
m.append(-xx)
else:
K -= 1
if K == 0:
print((0))
exit()
m.sort()
lp = len(... | def main():
N, K = list(map(int, input().split()))
*x, = list(map(int, input().split()))
ans = 3 * 10 ** 8
for left, right in zip(x, x[K - 1:]):
if left * right < 0:
ans = min(ans, right - left + min(-left, right))
else:
ans = min(ans, -left if left < 0 ... | p03274 |
N,K=list(map(int,input().split()))
X=list(map(int,input().split()))+[0]
ans=10**20
for i in range(N-K+1):
x=X[i:i+K]
l,r=x[0],x[-1]
if l<=0 and r<=0:
ans=min(ans,-l)
elif l>=0 and r>=0:
ans=min(ans,r)
else:
res=min(abs(l),abs(r))*2+max(abs(l),abs(r))
ans... | N,K=list(map(int,input().split()))
X=list(map(int,input().split()))
ans=float('inf')
for l in range(N-K+1):
r=l+K-1
ans=min(ans,min(abs(X[l]),abs(X[r]))+X[r]-X[l])
print(ans) | p03274 |
n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
d = [0 for _ in range(n)]
S = [0 for _ in range(n)]
for i in range(1, n):
d[i] = x[i] - x[i - 1]
S[i] = S[i - 1] + d[i]
tmp = [0 for _ in range(n - k + 1)]
for i in range(n - k + 1):
tmp[i] = S[i + k - 1] - S[i] + min(abs(x[... | n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = abs(x[-1] - x[0]) * 2
for i in range(n - k + 1):
l = x[i]
r = x[i + k - 1]
if r < 0:
ans = min(ans, -l)
elif l > 0:
ans = min(ans, r)
else:
ans = min(ans, r - l + min(-l, r))
print(an... | p03274 |
N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
right, left = [], []
for i in range(N):
if X[i] >= 0:
right.append(X[i])
else:
left.insert(0, -X[i])
right.append(0)
left.append(0)
ans = float("inf")
for i in range(K + 1):
if len(right) < K - i + 1 or len(left) < ... | N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
ans = float("inf")
for i in range(0, N - K + 1):
ans = min(ans, min(abs(X[i]) + abs(X[i] - X[i + K - 1]), abs(X[i + K - 1]) + abs(X[i] - X[i + K - 1])))
print(ans) | p03274 |
"""
0からLまで行き、LからRまで行く = abs(L) + (R-L)
0からRまで行き、RからLまで行く = abs(R) + (R-L)
"""
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = 1<<60
for i in range(0, N-K+1):
left = A[i]
right = A[i+K-1]
ans = min(ans, min(abs(left), abs(right)) + right - left)
print(ans) |
def resolve():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = 1 << 60
for i in range(N - K + 1):
l = A[i]
r = A[i + K - 1]
l_to_r = abs(l) + abs(l - r)
r_to_l = abs(r) + abs(r - l)
res = min(l_to_r, r_to_l)
a... | p03274 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p03274 |
N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
answer = 10 ** 9
for i in range(N-K+1):
b, c = X[i], X[i+K-1]
if b * c >= 0:
answer = min(answer, max(abs(b), abs(c)))
else:
d, e = min(abs(b), abs(c)), max(abs(b), abs(c))
answer = min(answer, d*2+... | N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
answer = []
for i in range(N-K+1):
a, b = X[i], X[i+K-1]
answer.append(min(abs(a-b) + abs(b), abs(b-a) + abs(a)))
print((min(answer)))
| p03274 |
# coding: utf-8
import sys
from bisect import bisect_left, bisect_right
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, K = lr()
X = lr()
if 0 in X:
K -= 1
i = bisect_left(X, 0)
ne = X[:i]
i = bisect_right(X, 0)
po = X[i:]
INF = 10 *... | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, K = lr()
X = lr()
answer = []
for i in range(N-K+1):
l = X[i]; r = X[i+K-1]
a = abs(l) + abs(r-l)
b = abs(r) + abs(l-r)
answer.append(min(a, b))
pr... | p03274 |
N, K = [int(i) for i in input().split()]
X = [int(i) for i in input().split()]
mi = 1e10
for l in range(N - K + 1):
r = l + K - 1
mi = min(mi, abs(X[l]) + abs(X[r] - X[l]), abs(X[r]) + abs(X[r] - X[l]))
print(mi) | N, K = [int(i) for i in input().split()]
X = [int(i) for i in input().split()]
print((min(r - l + min(abs(l), abs(r)) for l, r in zip(X, X[K - 1:]))))
| p03274 |
n,k = list(map(int,input().split()))
x = list(map(int,input().split()))
flag = True
for i in range(n+1):
if i == n or x[i] > 0:
x.insert(i,0)
zahyou = i
break
ans = 10**18
for i in range(k+1):
mainasu = 0
purasu = 0
flag = True
for j in range(k):
a = zah... | n,k = list(map(int,input().split()))
x = list(map(int,input().split()))
flag = True
for i in range(n+1):
if i == n or x[i] > 0:
x.insert(i,0)
zahyou = i
break
ans = 10**18
for i in range(k+1):
flag = True
if zahyou + i < n+1 and zahyou -k+i >= 0:
mainasu = x[zahyo... | p03274 |
N,K = list(map(int,input().split()))
x = list(map(int,input().split()))
cand = []
for i in range(N-K+1):
cand.append(x[i:i+K])
ans = float('inf')
for i in range(len(cand)):
l = cand[i][0]
r = cand[i][-1]
temp = min(abs(l)+abs(r-l),abs(r)+abs(l-r))
ans = min(temp,ans)
print(ans) | N,K = list(map(int,input().split()))
x = list(map(int,input().split()))
ans = float('inf')
for i in range(N-K+1):
l = x[i]
r = x[i+K-1]
temp = min(abs(l)+abs(r-l),abs(r)+abs(l-r))
ans = min(temp,ans)
print(ans) | p03274 |
import bisect
N, K = list(map(int,input().split()))
X = list(map(int,input().split()))
s = bisect.bisect_left(X,0)
if 0 in X:
K -= 1
else:
bisect.insort_left(X,0)
N += 1
MIN = 2 * 10**9
for i in range(K+1):
if s - K + i >= 0 and s + i <N:
f = X[s -K+i]
l = X[s+i]
... | def main():
n,k = list(map(int,input().split()))
X = list(map(int,input().split()))
ans = 10**9
for i in range(n-k+1):
t1 = abs(X[i]) + abs(X[i] - X[i+k-1])
t2 = abs(X[i+k-1]) + abs(X[i] - X[i+k-1])
t = min(t1,t2)
ans = min(ans,t)
print(ans)
ma... | p03274 |
import bisect
N, K = list(map(int,input().split()))
x = list(map(int,input().split()))
ans = 10**9
zero = bisect.bisect_left(x, 0)
if zero == 0:
print((x[K-1]))
exit(0)
if zero+K <= N:
ans = min(ans, x[zero+K-1])
if zero >= K:
ans = min(ans, -x[zero-K])
if zero != N:
for k in rang... | import bisect
N, K = list(map(int,input().split()))
x = list(map(int,input().split()))
ans = float("inf")
if x[0]*x[-1] >= 0:
if x[0] >= 0:
ans = x[K-1]
else:
ans = -x[-K]
print(ans)
else:
M = []
P = []
for e in x:
if e > 0:
P.append(e)
... | p03274 |
import sys
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return ... | n, k, *x = list(map(int, open(0).read().split()))
print((min([min(abs(x[i]), abs(x[i+k-1])) + (x[i+k-1] - x[i]) for i in range(n-k+1)]))) | p03274 |
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque
# import fractions
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstr... | import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque
# import fractions
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstr... | p03274 |
#!/usr/bin/env python3
import sys
def solve(N: int, K: int, x: "List[int]"):
def search_naive(cur, k, x):
if k == K:
return 0
costs = []
for i in range(len(x)):
xi = x[i]
dist = abs(xi-cur)
costs.append(dist + search_naive(xi, k+1... | #!/usr/bin/env python3
import sys
def solve(N: int, K: int, x: "List[int]"):
def search_naive(cur, k, x):
if k == K:
return 0
costs = []
for i in range(len(x)):
xi = x[i]
dist = abs(xi-cur)
costs.append(dist + search_naive(xi, k+1... | p03274 |
#!/usr/bin/env python3
import sys
def solve(N: int, K: int, x: "List[int]"):
def search_naive(cur, k, x):
if k == K:
return 0
costs = []
for i in range(len(x)):
xi = x[i]
dist = abs(xi-cur)
costs.append(dist + search_naive(xi, k+1... | #!/usr/bin/env python3
import sys
def solve(N: int, K: int, x: "List[int]"):
def search(N, window_size, x):
costs = []
for i in range(N-window_size+1):
right_end = x[i+window_size-1]
left_end = x[i]
dist = abs(right_end-left_end)
costs.app... | p03274 |
N,K=list(map(int,input().split()))
x=[int(i) for i in input().split()]
cost=[]
for i in range(N-K+1):
length=0
for j in range(K-1):
length+=abs(x[i+j+1]-x[i+j])
cost.append(length+abs(x[i]))
cost.append(length+abs(x[i+K-1]))
print((min(cost))) | N,K=list(map(int,input().split()))
x=[int(i) for i in input().split()]
cost=[]
for i in range(N-K+1):
length=abs(x[i]-x[i+K-1])
cost.append(length+abs(x[i]))
cost.append(length+abs(x[i+K-1]))
print((min(cost))) | p03274 |
n,k = list(map(int,input().split()))
x = list(map(int,input().split()))
res = 10**10
for i in range(n-k+1):
kx = x[i:i+k]
l=kx[0]
r = kx[-1]
lrsmall = min(abs(l),abs(r))
res = min(r-l+lrsmall,res)
print(res) | n,k = list(map(int,input().split()))
x = list(map(int,input().split()))
kx = x[0:k]
l=kx[0]
r = kx[-1]
lrsmall = min(abs(l),abs(r))
res = r-l+lrsmall
for i in range(1,n-k+1):
del kx[0]
kx.append(x[i+k-1])
l=kx[0]
r = kx[-1]
lrsmall = min(abs(l),abs(r))
res = min(r-l+lrsmall,res)
pr... | p03274 |
n,k = list(map(int,input().split()))
x = list(map(int,input().split()))
kx = x[0:k]
l=kx[0]
r = kx[-1]
lrsmall = min(abs(l),abs(r))
res = r-l+lrsmall
for i in range(1,n-k+1):
del kx[0]
kx.append(x[i+k-1])
l=kx[0]
r = kx[-1]
lrsmall = min(abs(l),abs(r))
res = min(r-l+lrsmall,res)
pr... | n,k = list(map(int,input().split()))
x = list(map(int,input().split()))
res = 10**10
for i in range(0,n-k+1):
l = x[i]
r = x[i+k-1]
lrsmall = min(abs(l),abs(r))
res = min(r-l+lrsmall,res)
print(res) | p03274 |
n,k = list(map(int,input().split()))
lst = [int(i) for i in input().split()]
for i in range(n-k+1):
l = lst[i]
r = lst[i+k-1]
way1 = abs(l) + abs(r-l)
way2 = abs(r) + abs(l-r)
m = min(way1,way2)
if i==0:
ans = m
elif m < ans:
ans = m
print(ans) | n,k = list(map(int,input().split()))
x = list(map(int,input().split()))
ans = float('inf')
for i in range(n-k+1):
l = x[i]
r = x[i+k-1]
w1 = abs(l)+abs(r-l)
w2 = abs(r)+abs(l-r)
ans = min(ans, min(w1,w2))
print(ans) | p03274 |
from itertools import combinations
N,K=list(map(int,input().split()))
X = list(map(int, input().split()))
print((min([min(abs(cmb[0]) + abs(cmb[-1]-cmb[0]), abs(cmb[-1]) + abs(cmb[0]-cmb[-1])) for cmb in combinations(X,K)]))) | N,K=list(map(int,input().split()))
X = list(map(int, input().split()))
print((min([min(abs(X[i]) + abs(X[i+K-1]-X[i]), abs(X[i+K-1]) + abs(X[i]-X[i+K-1])) for i in range(N-K+1)]))) | p03274 |
N,K=list(map(int,input().split()))
X = list(map(int, input().split()))
print((min([min(abs(X[i]) + abs(X[i+K-1]-X[i]), abs(X[i+K-1]) + abs(X[i]-X[i+K-1])) for i in range(N-K+1)]))) | N, K = list(map(int, input().split()))
posX = []
negX = []
for x in map(int, input().split()):
if 0 <= x:
posX.append(x)
else:
negX.append(-x)
negX.sort()
len_posX = len(posX)
len_negX = len(negX)
ans = float('inf')
for pos_k in range(len_posX + 1):
neg_k = K - pos_k
... | p03274 |
# -*- coding:utf-8 -*-
import copy
INF = 2*(10**8)+1
memo = INF # メモ化用変数
def solve():
N, K = list(map(int, input().split(" ")))
X = [0]
X.extend(list(map(int, input().split(" "))))
X.sort()
# 幅優先探索すればいいんじゃね？
def dfs(depth, cost, i, Xs):
global memo
if depth =... | # -*- coding:utf-8 -*-
"""解説
https://www.youtube.com/watch?v=5O4k1n5Ejzw
区間を考える問題
-30 -10 0 10 20 50
・K = 3のとき、
0座標を必ず含める、ある連続するK個のロウソクについて考える
・-30 -10 0 10
・-10 0 10 20
・0 10 20 50
左端と右端に到達する最小値を求めていけばよくて、間のロウソクは無視してよい（必ず移動中に火をつけるので）
すべての場合について求めて、その中の最小値が答え
"""
def solve():
N, K = li... | p03274 |
n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
neg_num = n
for i in range(n):
if x[i] > 0:
neg_num = i
break
pos_num = n - neg_num
l = min(k, neg_num)
res = 10 ** 13
for i in range(l, -1, -1):
r = k - i
if r <= pos_num:
l_val = min(0, x[ne... | n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
neg_to_pos = n
for i in range(n):
if x[i] > 0:
neg_to_pos = i
break
res = 10 ** 14
for i in range(n - k + 1):
l = min(x[i], 0)
r = max(0, x[i + k - 1])
if i <= neg_to_pos and neg_to_pos - 1 <= i + k... | p03274 |
import bisect
N, K = list(map(int, input().split()))
x = list(map(int, input().split()))
t = 2 * (x[-1] - x[0])
i = bisect.bisect_right(x, 0)
for j in range(0, N):
if N <= j + K -1 :
break
if (j - (i - 0.1)) * (j + K- 1 - (i - 0.1)) >= 0:
t = min(t, max(abs(x[j]), abs(x[j+K-1])))
e... | N, K = list(map(int, input().split()))
x = list(map(int, input().split()))
dist = 2 * (x[-1] - x[0])
for i in range(N):
if i + K -1 >= N:
break
dist = min(dist, abs(x[i]) + abs(x[i + K - 1] - x[i]),abs(x[i + K -1]) + abs(x[i + K - 1] - x[i]))
print(dist) | p03274 |
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect, string, copy
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
mod = 10**9+7
ans = inf
count = 0; pro = 1
n, k = list(map(int, input().split()))
A=[]; B=[]
x=li... | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,k = list(map(int,input().split()))
X = list(map(int,input().split()))
for i in range(n-k+1):
... | p03274 |
N, K = list(map(int, input().split()))
x = list(map(int,input().split()))
candidate = []
for i in range(N - K + 1):
tmp = []
for j in range(i, i + K):
tmp.append(x[j])
candidate.append(tmp)
ans = 1000000000
for i in candidate:
tmp = 0
#最初の要素がマイナスだとマイナスとプラスの混合の可能性がある
if i[... | N, K = list(map(int, input().split()))
x = list(map(int,input().split()))
ans = 100000000000
#最初と最後だけ調べればOK
for i in range(N - K + 1):
tmp_min = x[i]
tmp_max = x[i + K - 1]
tmp = 0
if tmp_min < 0:
#混合の場合
if tmp_max > 0:
#+に先に行く場合
if abs(tmp_min) > tm... | p03274 |
N, K = list(map(int, input().split()))
x = list(map(int,input().split()))
ans = 100000000000
#最初と最後だけ調べればOK
for i in range(N - K + 1):
tmp_min = x[i]
tmp_max = x[i + K - 1]
tmp = abs(tmp_min) + abs(tmp_min - tmp_max)
tmp2 = abs(tmp_max) + abs(tmp_min - tmp_max)
ans = min(ans, min(tmp, tmp... | N, K = list(map(int, input().split()))
x = list(map(int,input().split()))
ans = 100000000000
#最初と最後だけ調べればOK
for i in range(N - K + 1):
tmp_min = x[i]
tmp_max = x[i + K - 1]
ans = min(ans, min(abs(tmp_min), abs(tmp_max)) + abs(tmp_min - tmp_max))
print(ans)
| p03274 |
#-*-coding:utf-8-*-
def main():
n, k = list(map(int, input().split()))
x_list = list(map(int, input().split()))
ans = float('inf')
for i in range(n - k + 1):
arry = x_list[i:i+k]
if arry[0] >= 0 and arry[-1] >= 0:
ans = min(ans, arry[-1])
elif arry[0] < 0... | #-*-coding:utf-8-*-
def main():
n, k = list(map(int, input().split()))
x_list = list(map(int, input().split()))
ans = float('inf')
for i in range(n - k + 1):
if x_list[i] >= 0 and x_list[i+k-1] >= 0:
ans = min(ans, x_list[i+k-1])
elif x_list[i] <= 0 and x_list[i+k... | p03274 |
import bisect
n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
for distance in range(100000000):
a = bisect.bisect_left(x, -distance)
b = bisect.bisect_right(x, distance)
near_k = b- a
if near_k == k:
break
elif near_k > k:
if x[a]+1 in x:
... | n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
num = 1000000000
def cal_num(a, b):
if x[a] * x[b] < 0:
return min(abs(x[a]), abs(x[b])) * 2 + max(abs(x[a]), abs(x[b]))
else:
return max(abs(x[a]), abs(x[b]))
for i in range(n-k+1):
c = cal_num(i, i+k-... | p03274 |
n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = 10 ** 9
for i in range(n-k+1):
temp = x[i:i+k]
dif = temp[-1] - temp[0]
from_s = min(abs(temp[-1]), abs(temp[0]))
ans = min(dif + from_s, ans)
print(ans) | n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = 10 ** 9
for i in range(n-k+1):
l = abs(x[i]) + abs(x[i+k-1] - x[i])
r = abs(x[i+k-1]) + abs(x[i+k-1] - x[i])
if l < r:
ans = min(ans, l)
else:
ans = min(ans, r)
print(ans) | p03274 |
# vim: set fileencoding=utf-8:
import bisect
def main():
N, K = list(map(int, input().split()))
x = [int(ele) for ele in input().split()]
o = bisect.bisect_right(x, 0)
top = min(o + K, N)
bottom = max(o - K, 0)
x = x[bottom:top]
best = 999999999999
u = len(x)
for i i... | # vim: set fileencoding=utf-8:
import bisect
def main():
N, K = list(map(int, input().split()))
x = [int(ele) for ele in input().split()]
o = bisect.bisect_right(x, 0)
top = min(o + K, N)
bottom = max(o - K, 0)
best = 999999999999
for i in range(K):
if top < bottom + i ... | p03274 |
MAX = 300000001
N, K = list(map(int, input().split()))
xn = [int(i) for i in input().split()]
def main():
if 0 <= xn[0]:
print((xn[K - 1]))
return
if xn[N - 1] < 0:
print((abs(xn[N - K])))
return
ans = MAX
for i in range(N):
if N - 1 < i + ... | MAX = 300000001
N, K = list(map(int, input().split()))
xn = [int(i) for i in input().split()]
def main():
if 0 <= xn[0]:
print((xn[K - 1]))
return
if xn[N - 1] < 0:
print((abs(xn[N - K])))
return
ans = MAX
for i in range(N - K + 1):
if xn[i... | p03274 |
MAX = 300000001
N, K = list(map(int, input().split()))
xn = [int(i) for i in input().split()]
def main():
if 0 <= xn[0]:
print((xn[K - 1]))
return
if xn[N - 1] < 0:
print((abs(xn[N - K])))
return
ans = MAX
for i in range(N - K + 1):
if xn[i... | MAX = 300000001
N, K = list(map(int, input().split()))
xn = [int(i) for i in input().split()]
def main():
if 0 <= xn[0]:
print((xn[K - 1]))
return
if xn[N - 1] < 0:
print((abs(xn[N - K])))
return
ans = MAX
for i in range(N - K + 1):
ans = m... | p03274 |
MAX = 300000001
N, K = list(map(int, input().split()))
xn = [int(i) for i in input().split()]
def main():
if 0 <= xn[0]:
print((xn[K - 1]))
return
if xn[N - 1] < 0:
print((abs(xn[N - K])))
return
ans = MAX
for i in range(N - K + 1):
ans = m... | MAX = 300000001
N, K = list(map(int, input().split()))
xn = [int(i) for i in input().split()]
def main():
if 0 < xn[0]:
print((xn[K - 1]))
return
if xn[N - 1] < 0:
print((abs(xn[N - K])))
return
ans = MAX
for i in range(N - K + 1):
ans = mi... | p03274 |
MAX = 300000001
N, K = list(map(int, input().split()))
xn = [int(i) for i in input().split()]
def main():
if 0 < xn[0]:
print((xn[K - 1]))
return
if xn[N - 1] < 0:
print((abs(xn[N - K])))
return
ans = MAX
for i in range(N - K + 1):
if xn[i ... | MAX_D = 300000001
def main():
N, K, *xn = list(map(int, open(0).read().split()))
if 0 < xn[0]:
print((xn[K - 1]))
return
if xn[N - 1] < 0:
print((abs(xn[N - K])))
return
ans = MAX_D
for i in range(N - K + 1):
if xn[i + K - 1] < 0 and i + K <= N ... | p03274 |
# coding: utf-8
# Your code here!
import bisect
N,K=list(map(int,input().split()))
X=list(map(int,input().split()))
zero=bisect.bisect_left(X,0)
ans=10**18
start=max(0,zero-K)
for i in range(start,start+N-K+1):
temp=X[i:i+K]
m=min(0,min(temp))
M=max(0,max(temp))
ans=min((abs(m)+abs(M)*... | # coding: utf-8
# Your code here!
import bisect
N,K=list(map(int,input().split()))
X=list(map(int,input().split()))
zero=bisect.bisect_left(X,0)
ans=10**18
start=max(0,zero-K)
for i in range(start,start+N-K+1):
#print(i)
m=min(0,X[i])
M=max(0,X[i+K-1])
ans=min((abs(m)+abs(M)*2),(abs(m)... | p03274 |
n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = 10 ** 10
for i in range(n - k + 1):
temp = x[i:i + k]
left = temp[0]
right = temp[-1]
ans = min(ans, abs(left) + abs(right - left), abs(right) + abs(right - left))
print(ans)
| n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = 10 ** 10
for i in range(n - k + 1):
left = x[i]
right = x[i + k - 1]
ans = min(ans, abs(left) + abs(right - left), abs(right) + abs(right - left))
print(ans)
| p03274 |
N, K = list(map(int,input().split()))
A = list(map(int,input().split()))
P = [0] + [abs(i) for i in A if i> 0 ]
M = [abs(i) for i in A if i< 0 ] +[0]
M = sorted(M,reverse =False)
cnt = 10000000000
if len(P) == len(M) == 1:
cnt = 0
elif len(P) == 1:
cnt = M[K]
elif len(M) == 1:
cnt = P[K]
e... | N,K = list(map(int,input().split()))
X = list(map(int,input().split()))
ans = 10**10
for i in range(N-K+1):
#S = X[i:i+K]
#print(S,S[0],S[-1])
mi = X[i]
ma = X[i+K-1]
#print(mi,ma)
if ma<=0:
ans = min(ans ,abs(mi))
elif mi>0:
ans = min(ans ,ma)
elif mi<0 ... | p03274 |
n, k = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = float('Inf')
for i in range(n-k+1):
temp = c[i:i+k]
l, r = abs(temp[0]), abs(temp[-1])
if temp[0] < 0 and temp[-1] > 0:
ans = min(ans, min(l, r) * 2 + max(l, r))
else:
ans = min(ans, max(list(map(abs, temp))))
pri... | n, k = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = float('Inf')
for i in range(n-k+1):
l, r = c[i], c[i+k-1]
ans = min(abs(l) + abs(r-l), abs(r) + abs(r-l), ans)
print(ans) | p03274 |
import sys
import math # noqa
import bisect # noqa
import queue # noqa
def input():
return sys.stdin.readline().rstrip()
def solve(X, K):
N = len(X)
cumsum = [0 for _ in range(N)]
for i in range(1, N):
cumsum[i] = abs(X[i] - X[i - 1]) + cumsum[i - 1]
idx_zero = bise... | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
minus = []
plus = []
ans = 10**100
for x in a:
if x <0:minus.append(-x)
else:plus.append(x)
minus = minus[::-1]
for i in range(min(k+1,len(minus)+1)):#負のものをi個通る
if k-i > len(plus):continue
res = 0
if i-1 >=0:res += m... | p03274 |
import itertools
n,k = list(map(int,input().split()))
x = list(map(int,input().split()))
pos = [0]
neg = []
for i in x:
if i<0:
neg.append(-i)
else:
pos.append(i)
neg = [0] + neg[::-1]
# negを往復する場合
neg_twice = []
for i in range(min(len(neg),k)):
neg_twice.append(neg[i]*2)... | n,k = list(map(int,input().split()))
x = list(map(int,input().split()))
pos = []
neg = []
for i in x:
if i < 0:
neg.append(-i)
else:
pos.append(i)
neg = neg[::-1]
pos = [0] + pos
neg = [0] + neg
#print(pos)
#print(neg)
# posにいってからneg
res = float('inf')
for i in range(min(le... | p03274 |
n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
min_t = 10 ** 9
import bisect
snuke = bisect.bisect_left(x, 0)
if snuke < n and x[snuke] == 0:
k -= 1
n -= 1
del x[snuke]
for i in range(k+1):
if i == 0:
left = 0
elif snuke - i >= 0:
left... | n,k=list(map(int,input().split()))
x=sorted(list(map(int,input().split())))
a=[]
for i in range(n-k+1):
l=x[i]
r=x[i+k-1]
a.append(min(abs(l)+abs(r-l),abs(r)+abs(l-r)))
print((min(a))) | p03274 |
N, K = list(map(int, input().split()))
candles = list(map(int, input().split()))
abs_c = [abs(c) for c in candles]
result = []
for n in range(N-K+1):
route = candles[n:n+K]
r1 = abs(route[0]) + abs(route[-1]-route[0])
r2 = abs(route[-1]) + abs(route[0]-route[-1])
result.append(min(r1, r2))
pr... | N, K = list(map(int, input().split()))
candles = list(map(int, input().split()))
abs_c = [abs(c) for c in candles]
result = []
for n in range(N-K+1):
r1 = abs(candles[n]) + abs(candles[n+K-1]-candles[n])
r2 = abs(candles[n+K-1]) + abs(candles[n]-candles[n+K-1])
result.append(min(r1, r2))
print((mi... | p03274 |
N, K = list(map(int, input().split()))
x = list(map(int, input().split()))
left = []
right = []
cnt = 0
for i in range(N):
if x[i] < 0:
left += [-x[i]]
elif x[i] > 0:
right += [x[i]]
else:
cnt += 1
rest = K - cnt
left = left[::-1]
if rest != 0:
ans = float('inf')
... | N, K = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = float('inf')
for i in range(N-K+1):
ans = min(ans, abs(x[i]) + abs(x[i]-x[i+K-1]))
ans = min(ans, abs(x[i+K-1]) + abs(x[i]-x[i+K-1]))
print(ans) | p03274 |
R=[]
N,K=[int(i) for i in input().split()]
x=[int(i) for i in input().split()]
for i in range(N-K+1):
a=abs(x[i])+abs(x[i+K-1]-x[i])
b=abs(x[i+K-1])+abs(x[i+K-1]-x[i])
c=min(a,b)
R.append(c)
print((min(R))) | ANS=[]
N,K=[int(i) for i in input().split()]
x=[int(i) for i in input().split()]
for i in range(N-K+1):
a=x[i]
b=x[i+K-1]
A=abs(a)+abs(a-b)
B=abs(b)+abs(b-a)
c=min(A,B)
ANS.append(c)
print((min(ANS))) | p03274 |
n,k = list(map(int,input().split()))
x = list(map(int,input().split()))
ans = 100000000000000000000
for i in range(n-k+1):
a = x[i:i+k]
b = 0
if a[-1] <= 0:
b = -a[0]
elif a[0] >= 0:
b = a[-1]
else:
b = min(abs(a[0])*2+a[-1],a[-1]*2-a[0])
ans = min(ans,b)
print(ans) | n,k = list(map(int,input().split()))
x = list(map(int,input().split()))
ans = 100000000000000
a = 0
while a != n:
if x[a] >= 0:
break
a += 1
for i in range(max(0,a-k),n-k+1):
if x[i+k-1] <= 0:
ans = min(ans,-x[i])
elif x[i] >= 0:
ans = min(x[i+k-1],ans)
else:
ans = min(x[i+k-1]-x[i]+min(-... | p03274 |
n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = []
for i in range(n - k + 1):
left = x[i]
right = x[i + k - 1]
ans.append(min(abs(left) + abs(right - left),
abs(right) + abs(left - right)))
print((min(ans))) | n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = []
for i in range(n - k + 1):
left = x[i]
right = x[i + k - 1]
if abs(left) > abs(right):
ans.append(abs(right) + abs(left - right))
else:
ans.append(abs(left) + abs(right - left))
print((min(a... | p03274 |
N,K = list(map(int,input().split()))
X = list(map(int,input().split()))
ANS = []
for i in range(N-K+1) :
L = X[i:K+i]
l1 = abs(min(L))+abs(max(L)-min(L))
l2 = abs(max(L))+abs(max(L)-min(L))
ANS.append(min(l1,l2))
print((min(ANS)))
| N,K = list(map(int,input().split()))
L = list(map(int,input().split()))
ANS = []
for i in range(len(L)-K+1) :
p = L[i]
q = L[i+K-1]
if p*q == 0 :
r = abs(p-q)
elif p*q < 0 :
r = 2*min(abs(p),q) + max(abs(p),q)
else :
if p > 0 :
r = q
else :
... | p03274 |
N, K = list(map(int,input().split()))
X = list(map(int,input().split()))
result = []
for l, r in zip(X,X[K-1:]):
result.append((r - l + min(abs(l), abs(r))))
print((min(result))) | N, K = list(map(int,input().split()))
X = list(map(int,input().split()))
result = []
for l, r in zip(X,X[K-1:]):
result.append(r - l + min(abs(l), abs(r)))
print((min(result))) | p03274 |
N, K = list(map(int,input().split()))
X = list(map(int,input().split()))
result = []
for l, r in zip(X,X[K-1:]):
result.append(r - l + min(abs(l), abs(r)))
print((min(result))) | N, K = list(map(int,input().split()))
X = list(map(int,input().split()))
tmp = []
for l, r in zip(X,X[K-1:]):
tmp.append(r - l + min(abs(l), abs(r)))
print((min(tmp))) | p03274 |
N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
ans = float("inf")
for i in range(N - K + 1):
left, right = X[i], X[i + K - 1]
if left * right <= 0:
ans = min(ans, abs(left) + right + min(abs(left), right))
elif left > 0:
ans = min(ans, right)
else:
... | N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
ans = float("inf")
for i in range(N - K + 1):
left, right = X[i], X[i + K - 1]
dist = right - left
ans = min(ans, abs(left) + dist, abs(right) + dist)
print(ans)
| p03274 |
n, k = list(map(int, input().split()))
ns = list(map(int, input().split()))
min_num = float('inf')
for i in range(n - k+1):
l = ns[i:i + k]
if l[-1] < 0:
min_num = min(min_num, abs(l[0]))
elif l[0] < 0 and l[-1] >= 0:
min_num = min(min_num, abs(l[0]) * 2 + l[-1])
min_num = m... | n, k = list(map(int, input().split()))
ns = list(map(int, input().split()))
min_num = float('inf')
for i in range(n - k+1):
l = ns[i]
r = ns[i+k-1]
min_num = min(min_num, abs(l) + abs(r-l), abs(r) + abs(l-r))
print(min_num) | p03274 |
# https://atcoder.jp/contests/abc107/tasks/arc101_a
# C - Candles
n, k = list(map(int, input().split()))
x_list = list(map(int, input().split()))
x_list = sorted(x_list)
min_l = float('inf')
minus_list = [x for x in x_list if x < 0]
plus_index = len(minus_list)
# print('plus_index: {}'.format(plus_index))
... | # https://atcoder.jp/contests/abc107/tasks/arc101_a
# C - Candles
n, k = list(map(int, input().split()))
x_list = list(map(int, input().split()))
x_list = sorted(x_list)
min_l = float('inf')
minus_list = [x for x in x_list if x < 0]
plus_index = len(minus_list)
for i, x in enumerate(x_list):
left, ri... | p03274 |
n,k=list(map(int,input().split()))
x=list(map(int,input().split()))
if (0 in x):
k-=1
else:
x.append(0)
x.sort()
time=[]
def measureTime(i,regX,nowTime,nowPlace,direct,turnFlg):
if i<k:
if len(regX)>1:
newRegX=regX[:]
newRegX.pop(nowPlace)
if (n... | n,k=list(map(int,input().split()))
x=list(map(int,input().split()))
if (0 in x):
k-=1
else:
x.append(0)
x.sort()
zeroPos=x.index(0)
leftLen=zeroPos
rightLen=len(x)-zeroPos-1
# print(leftLen,zeroPos,rightLen)
# print(x)
left=[]
right=[]
for turn in range(leftLen+1):
if(turn>k):
... | p03274 |
n,k=list(map(int,input().split()))
add=list(map(int,input().split()))
ans=float("inf")
for l in range(n-k+1):
r=l+k-1
ans=min(ans,
abs(add[l])+abs(add[r]-add[l]),
abs(add[r])+abs(add[r]-add[l])
)
print(ans) | n,k=list(map(int,input().split()))
add=list(map(int,input().split()))
ans=float("inf")
for l in range(n-k+1):
r=l+k-1
ans=min(ans,
abs(add[l])+abs(add[l]-add[r]),
abs(add[r])+abs(add[r]-add[l])
)
#探索する量が少ないので全探索により答えを求めることができる
print(ans) | p03274 |
n,k=list(map(int,input().split()))
line=list(map(int,input().split()))
ans=float("inf")
for i in range(n-k+1):
left,right=i,i+k-1
ans=min(ans,
abs(line[left])+abs(line[left]-line[right]),
abs(line[right])+abs(line[right]-line[left])
)
print(ans) | n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
ans=float("inf")
for i in range(n-k+1):
l,r=i,i+k-1
ans=min(ans,abs(A[r]-A[l])+abs(A[r]),abs(A[l])+abs(A[l]-A[r]))
print(ans) | p03274 |
n,k=list(map(int,input().split()))
xs=list(map(int,input().split()))
a=float('inf')
for i in range(n-k+1):
x=xs[i:i+k]
l=abs(x[0])+abs(x[0]-x[-1])
r=abs(x[-1])+abs(x[0]-x[-1])
m=min(l,r)
a=min(a,m)
print(a) | n,k=list(map(int,input().split()))
xs=list(map(int,input().split()))
m=float('inf')
for l,r in zip(xs,xs[k-1:]):
d=min(abs(l),abs(r))+abs(r-l)
m=min(m,d)
print(m)
| p03274 |
n,k=list(map(int,input().split()))
lst=list(map(int,input().split()))
ans=float("inf")
for i in range(n-k+1):
tmp=lst[i:i+k]
left=tmp[0]
right=tmp[-1]
if left==0 and right==0:
print((0))
exit()
if left<0 and right<=0:
ans=min(ans,abs(left))
elif left<0 and rig... | n,k=list(map(int,input().split()))
lst=list(map(int,input().split()))
ans=float("inf")
for i in range(n-k+1):
left=lst[i]
right=lst[i+k-1]
if left==0 and right==0:
print((0))
exit()
if left<0 and right<=0:
ans=min(ans,abs(left))
elif left<0 and right>0:
if... | p03274 |
N,K=list(map(int,input().split()))
X=list(map(int,input().split()))
def culclen(l,r):
if X[l]*X[r]>=0:
return max(abs(X[l]),abs(X[r]))
else:
ldis=abs(X[l])
rdis=abs(X[r])
return min(ldis,rdis)*2+max(ldis,rdis)
ans=10**9
for x in range(len(X)-K+1):
ans=min(ans,culclen(x,x+K-1))
prin... | N,K=list(map(int,input().split()))
X=list(map(int,input().split()))
def culclen(l,r):
return abs(X[r]-X[l])+min(abs(X[l]),abs(X[r]))
ans=10**9
for x in range(len(X)-K+1):
ans=min(ans,culclen(x,x+K-1))
print(ans)
| p03274 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def II(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n,k... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n,k=... | p03274 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n,k=... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n,k=... | p03274 |
def c_candles(N, K, X):
from bisect import bisect_left
negative_pos = X[:bisect_left(X, 0)][::-1]
positive_pos = X[bisect_left(X, 0):]
negative_pos_rel = negative_pos[:]
positive_pos_rel = positive_pos[:]
for k in range(1, len(negative_pos)):
negative_pos_rel[k] -= negative_pos[k ... | def c_candles(N, K, X):
ans = float('inf')
# [left, right] が指す連続したK本のろうそくに火をつけるといい
for left in range(N):
right = left + K - 1
if right >= N: # 右端がろうそくを指していない
break
# left→rightへ付けていく場合とright→leftへ付けていく場合
ans = min(ans, abs(X[left]) + abs(X[right] - X[left... | p03274 |
import sys
readline = sys.stdin.readline
def main():
N, K = list(map(int, readline().rstrip().split()))
X = list(map(int, readline().rstrip().split()))
len_m = len([x for x in X if x < 0])
len_p = len([x for x in X if x > 0])
ans = 10**10
idx = max(0, len_m-K)
s = [0] + X[idx:idx+... | import sys
readline = sys.stdin.readline
def main():
N, K = list(map(int, readline().rstrip().split()))
X = list(map(int, readline().rstrip().split()))
len_m = len([x for x in X if x < 0])
len_p = len([x for x in X if x > 0])
ans = 10**10
idx = max(0, len_m-K)
s = [0] + X[idx:idx+... | p03274 |
import sys
readline = sys.stdin.readline
def main():
N, K = list(map(int, readline().rstrip().split()))
X = list(map(int, readline().rstrip().split()))
len_m = len([x for x in X if x < 0])
len_p = len([x for x in X if x > 0])
ans = 10**10
idx = max(0, len_m-K)
s = [0] + X[idx:idx+... | import sys
readline = sys.stdin.readline
def main():
N, K = list(map(int, readline().rstrip().split()))
X = list(map(int, readline().rstrip().split()))
len_m = len([x for x in X if x < 0])
len_p = len([x for x in X if x > 0])
ans = 10**10
idx = max(0, len_m-K)
s = [0] + X[idx:idx+... | p03274 |
import sys
readline = sys.stdin.readline
def main():
N, K = list(map(int, readline().rstrip().split()))
X = list(map(int, readline().rstrip().split()))
len_m = len([x for x in X if x < 0])
len_p = len([x for x in X if x > 0])
ans = 10**10
for i in range(max(0, len_m-K), min(len_m+K, N-... | import sys
readline = sys.stdin.readline
def main():
N, K = list(map(int, readline().rstrip().split()))
X = list(map(int, readline().rstrip().split()))
len_m = len([x for x in X if x < 0])
ans = 10**10
for i in range(max(0, len_m-K), min(len_m+K, N-K+1)):
l = X[i]
r = X[i+... | p03274 |
n, k = list(map(int, input().split()))
X = list(map(int, input().split()))
T = []
for i in range(n - k + 1):
l = X[i]
r = X[i + k - 1]
route1 = abs(l) - l + r
route2 = abs(r) - l + r
temp = min(route1, route2)
T.append(temp)
print((min(T))) | n, k = list(map(int, input().split()))
C = list(map(int, input().split()))
D = []
for i in range(n - k + 1):
l = C[i]
r = C[i + k -1]
route1 = abs(l) - l + r
route2 = abs(r) - l + r
dist = min(route1, route2)
D.append(dist)
print((min(D))) | p03274 |
N , K = list(map(int,input().split()))
x = list(map(int,input().split()))
ans = float("inf")
for i in range(N - K + 1):
search_candles = x[i : i + K]
if search_candles[-1] <= 0:
tmp_min = abs(search_candles[0])
elif 0 <= search_candles[0]:
tmp_min = abs(search_candles[-1])
else:... | N , K = list(map(int,input().split()))
x = list(map(int,input().split()))
ans = float("inf")
for i in range(N - K + 1):
#x = x[i : i + K]
if x[i + K - 1] <= 0:
tmp_min = abs(x[i])
elif 0 <= x[i]:
tmp_min = abs(x[i + K - 1])
else:
PassTwice = min(abs(x[i + K - 1]) ,abs... | p03274 |
n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = 10**9
for i in range(n - k + 1):
if x[i] < 0:
if x[i + k - 1] < 0:
ref = -x[i]
else:
ref = min(x[i]*-2 + x[i + k - 1], -x[i] + x[i + k - 1]*2)
else:
ref = x[i + k - 1]
... | n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
k -= 1
ans = 10**9
for i in range(n - k):
l = x[i]
r = x[i + k]
if l < 0:
if r < 0:
ref = -l
else:
ref = min(l*-2 + r, -l + r*2)
else:
ref = r
ans = min(ans, ref... | p03274 |
n, k = list(map(int, input().split()))
x = sorted(list(map(int, input().split())) + [0])
ans = 10**9 + 10
for i in range(n-k+1):
left = i
right = i+k
to_right = abs(x[left]) + abs(x[right]-x[left])
to_left = abs(x[right]) + abs(x[right]-x[left])
if min(to_right, to_left) < ans:
an... | n, k = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = 10**9 + 10
for i in range(n-k+1):
left = i
right = i+k-1
to_right = abs(x[left]) + abs(x[right]-x[left])
to_left = abs(x[right]) + abs(x[right]-x[left])
if min(to_right, to_left) < ans:
ans = min(to_r... | p03274 |
bitcount = [bin(i).count('1') for i in range(0x10000)]
def solve(a, b):
global bitcount
b = [65535 ^ bi for bi in b]
pdp = {a[0]:0}
ndp = {}
for ai in a[1:] + [0]:
for k, v in list(pdp.items()):
v += bitcount[k]
for bi in b:
bi &= k
... | bitcount = [bin(i).count('1') for i in range(0x10000)]
def solve(a, b):
global bitcount
b = [65535 ^ bi for bi in b]
pdp = {a[0]:0}
ndp = {}
for ai in a[1:] + [0]:
for k, v in list(pdp.items()):
v += bitcount[k]
for bi in b:
bi &= k
... | p00258 |
a = int ( eval(input ( )) )
h = a // 3600
m = ( a // 60 ) % 60
d = a % 60
print(( "%s:%s:%s" % ( h, m, d ) )) | S = int(eval(input()))
h = S // 3600
m = (S // 60) % 60
s = S % 60
print(("%d:%d:%d" % (h, m, s)))
| p02390 |
S = int(eval(input()))
h = S // 3600
m = S // 60 % 60
s = S % 60
#print(str(h) + ':' + str(m) + ':' + str(s))
print(('{0}:{1}:{2}'.format(h,m,s))) | S = int(input())
h = S // 3600
m = S % 3600 // 60
s = S % 60
print(h,m,s, sep=':')
| p02390 |
S = int(input())
h = int(S / 3600)
m = int(S % 3600 / 60)
s = S % 60
print(h, m, s, sep=':')
| S = int(eval(input()))
s = S % 60
m = S // 60 % 60
h = S // 60 // 60
print(("{0}:{1}:{2}".format(h,m,s))) | p02390 |
s=int(eval(input()))
print(f'{s//3600}:{s//60%60}:{s%60}') | s=int(input())
print(s//3600,s//60%60,s%60,sep=':')
| p02390 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.