input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
ls = list(map(int, input().split()))
ls2 = ls.copy()
ls2.sort()
m = ls2[n // 2]
for i in range(n):
if ls[i] < m:
print(m)
else:
print((ls2[n // 2 - 1])) | n = int(eval(input()))
ls = list(map(int, input().split()))
ls2 = sorted(ls)
m0 = ls2[n // 2 - 1]
m1 = ls2[n // 2]
for x in ls:
if x < m1:
print(m1)
else:
print(m0) | p03379 |
# https://atcoder.jp/contests/abc094/tasks/arc095_a
# C - Many Medians
import copy
n = int(input().split()[0])
x_list = list(map(int, input().split()))
sorted_x_list = sorted(x_list)
mean_index = int((n + 1)/ 2) - 1
mean_list = []
a = str(sorted_x_list[mean_index])
b = str(sorted_x_list[mean_index + 1])
mean_list = [b if sorted_x_list.index(x) < n / 2 else a for x in x_list]
ans = '\n'.join(mean_list)
print(ans) | # https://atcoder.jp/contests/abc094/tasks/arc095_a
# C - Many Medians
import copy
n = int(input().split()[0])
x_list = list(map(int, input().split()))
sorted_x_list = sorted(x_list)
mean_index = int((n + 1)/ 2) - 1
mean_list = []
a = sorted_x_list[mean_index]
b = sorted_x_list[mean_index + 1]
for x in x_list:
if x <= a:
mean_list.append(str(b))
else:
mean_list.append(str(a))
ans = '\n'.join(mean_list)
print(ans) | p03379 |
import copy
n = int(eval(input()))
x = [int(num) for num in input().split()]
xx = sorted(x)
for i in range(n):
x_ =copy.copy(xx)
x_.remove(x[i])
b = x_[n//2 - 1]
print(b) | n = int(eval(input()))
x = [int(num) for num in input().split()]
xx = sorted(x)
mid_l = xx[n//2 -1]
mid_r = xx[n//2]
for _ in x:
if _ <= mid_l:
print(mid_r)
else:
print(mid_l)
| p03379 |
import statistics
import copy
N=int(eval(input()))
X=list(map(int,input().split()))
for i in range(len(X)):
A = copy.deepcopy(X)
del A[i]
print((statistics.median(A)))
| import statistics as sta
N=int(eval(input()))
X=list(map(int,input().split()))
sort_X = sorted(X)
a = sta.median_low(sort_X)
b = sta.median_high(sort_X)
for i in range(N):
if X[i] <= a:
print(b)
else:
print(a) | p03379 |
import copy
N = int(eval(input()))
lst = list(map(int, input().split()))
for i in range(N):
c_lst = copy.copy(lst)
c_lst.pop(i)
idx = len(c_lst) // 2
sorted_lst = sorted(c_lst)
print((sorted_lst[idx])) | import copy
N = int(eval(input()))
lst = list(map(int, input().split()))
sorted_lst = sorted(lst)
idx = (N-1) // 2
low = sorted_lst[idx]
high = sorted_lst[idx+1]
for i in range(N):
if lst[i] <= low:
print(high)
else:
print(low)
| p03379 |
import copy
n=int(eval(input()))
box=list(map(int,input().split()))
box_sort=sorted(box)
for i in box:
ano_box=copy.copy(box_sort)
ano_box.remove(i)
print((ano_box[n//2-1])) | n=int(eval(input()))
x=list(map(int,input().split()))
y=sorted(x)
xr,xl=y[n//2],y[n//2-1]
for i in x:
print((xr if i<=xl else xl)) | p03379 |
n=int(eval(input()))
x=list(map(int,input().split()))
y = sorted(x)
N = int(n/2)
x1, x2 = y[N-1], y[N]
for i in range(n):
if x[i]<=x1:
print(x2)
else:
print(x1)
| n=int(eval(input()))
x=list(map(int,input().split()))
y = sorted(x)
x1, x2 = y[n//2-1], y[n//2]
for i in range(n):
if x[i]<=x1:
print(x2)
else:
print(x1)
| p03379 |
import copy
n = int(eval(input()))
x = list(map(int,input().split()))
for i in range(n):
xi = copy.deepcopy(x)
xi.pop(i)
xi = sorted(xi,reverse=True)
print((xi[(n-2)//2])) | n = int(eval(input()))
x = list(map(int,input().split()))
x_sort = sorted(x)
med_l = x_sort[n//2-1]
med_r = x_sort[n//2]
for i in range(n):
x[i]
if x[i] <= med_l:
print(med_r)
else:
print(med_l) | p03379 |
from statistics import mean, median,variance,stdev
n=int(eval(input()))
nn=n//2
x=[int(i) for i in input().split()]
y=x[:]
x.sort()
low_median=median(x[:n-1])
high_median=median(x[1:])
for i in range(n):
if y[i]<high_median:
print(high_median)
else:
print(low_median) | n=int(eval(input()))
nn=n//2
x=[int(i) for i in input().split()]
y=x[:]
x.sort()
low_median=x[nn-1]
high_median=x[nn]
for i in range(n):
if y[i]<high_median:
print(high_median)
else:
print(low_median)
| p03379 |
import copy
n=int(eval(input()))
m=0
x=list(map(int,input().split()))
for i in range(n):
y=copy.deepcopy(x)
y.pop(i)
if n%2==0:
m=n//2
y.sort()
print((y[m-1]))
else:
m=n//2
y.sort()
print(((y[m]-y[m-1])/2)) | N = int(eval(input()))
arr = []
for x in list(map(int,input().split())):
arr.append(x)
sort_arr = sorted(arr)
mid1 = sort_arr[N//2-1]
mid2 = sort_arr[N//2]
for x in arr:
if x <= mid1:
print(mid2)
else:
print(mid1)
| p03379 |
import copy
if __name__ == '__main__':
N = int(eval(input()))
X_list = list(map(int, input().split()))
answer = -1
for i in range(0, N):
tmp_X_list = copy.deepcopy(X_list)
del(tmp_X_list[i])
tmp_X_list = sorted(tmp_X_list)
answer = tmp_X_list[N//2-1]
print(answer)
| import copy
if __name__ == '__main__':
N = int(eval(input()))
X_list = list(map(int, input().split()))
tmp_X_list = copy.deepcopy(X_list)
tmp_X_list = sorted(tmp_X_list)
med_minus1 = tmp_X_list[N//2-1]
med_plus1 = tmp_X_list[N//2]
answer = -1
for i in range(0, N):
if X_list[i] <= med_minus1:
answer = med_plus1
elif X_list[i] >= med_plus1:
answer = med_minus1
print(answer)
| p03379 |
# 2019/08/08
from bisect import bisect_left,bisect_right
n=int(eval(input()))
x=list(map(int,input().split()))
xx=sorted(x)
mid=n//2
for i in range(n):
if bisect_left(xx,x[i])<mid:
print((xx[mid]))
else:
print((xx[mid-1])) | # 2019/08/08
from bisect import bisect_left,bisect_right
n=int(input())
x=list(map(int,input().split()))
xx=sorted(x)
mid=n//2
ans=[]
for i in range(n):
if bisect_left(xx,x[i])<mid:
ans.append(xx[mid])
else:
ans.append(xx[mid-1])
print(*ans,sep='\n')
| p03379 |
N = int(input())
X = list(map(int, input().split()))
Y = list(enumerate(X))
Y.sort(key=lambda x:x[1])
mid = [Y[N//2-1][1], Y[N//2][1]]
ans = [-1] * N
for i, y in Y:
if y <= mid[0]:
ans[i] = mid[1]
else:
ans[i] = mid[0]
print(*ans, sep='\n')
| N = int(eval(input()))
X = list(map(int, input().split()))
Y = sorted(X)
m1, m2 = Y[N//2-1], Y[N//2]
for x in X:
if x <= m1:
print(m2)
else:
print(m1) | p03379 |
from operator import itemgetter
N = int(eval(input()))
X = [(int(x),ind) for ind,x in enumerate(input().split())]
X.sort(key=itemgetter(0))
B = [0]*N
for i in range(N):
B[X[i][1]] = (X[:i]+X[i+1:])[(N-2)//2]
for i in B:
print((i[0]))
| N = int(eval(input()))
X = [int(x) for x in input().split()]
B = sorted(X)
for i in X:
if(i<B[N//2]):
print((B[N//2]))
else:
print((B[N//2-1]))
| p03379 |
n = int(eval(input()))
list_x = list(map(int, input().split()))
med = int(n / 2) - 1
for i in range(n):
temp = list_x[:i] + list_x[i+1:]
temp.sort()
print((temp[med])) | n = int(eval(input()))
list_x = list(map(int, input().split()))
sub_list = sorted(list_x)
a = sub_list[n // 2]
b = sub_list[n // 2 - 1]
for one_x in list_x:
if one_x <= b:
print(a)
else:
print(b) | p03379 |
N = int(eval(input()))
X = list(map(int,input().split()))
for i in range(N):
Xi = X[i]
X.pop(i)
Xs = sorted(X)
print((Xs[(N-1)//2]))
X.insert(i,Xi) | N = int(eval(input()))
X = list(map(int,input().split()))
XL = sorted(X)
for i in range(N):
if X[i] <= XL[N//2-1]:
print((XL[(N+1)//2]))
else:
print((XL[(N-1)//2])) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
x1 = []
for i, xi in enumerate(x):
x1.append([i, xi])
x_sort = sorted(x1, key=lambda x: x[1])
t = int(n / 2)
lxt = []
for i in range(n):
if i < t:
lxt.append(x_sort[i][0])
else:
break
for i in range(n):
if i in lxt:
print((x_sort[t][1]))
else:
print((x_sort[t - 1][1]))
| n = int(eval(input()))
x = list(map(int, input().split()))
x1 = []
for i, xi in enumerate(x):
x1.append([i, xi])
x_sort = sorted(x1, key=lambda x: x[1])
t = int(n / 2)
lxt = []
for i in range(n):
if i < t:
x[x_sort[i][0]] = x_sort[t][1]
else:
x[x_sort[i][0]] = x_sort[t - 1][1]
for i in range(n):
print((x[i]))
| p03379 |
import copy
N = int(eval(input()))
L = list(map(int,input().split()))
A = copy.deepcopy(L)
A.sort()
for i in range(N):
if (L[i] <= A[(N//2)-1]):
print((A[N//2]))
else:
print((A[(N//2)-1])) | import copy
N = int(eval(input()))
L = list(map(int,input().split()))
C = copy.deepcopy(L)
C.sort()
P,Q = C[N//2-1],C[N//2]
for i in range(N):
if L[i] <= P:
print(Q)
else:
print(P) | p03379 |
n = int(eval(input()))
x = [int(i) for i in input().split()]
x_sorted = sorted(x)
x_1 = x_sorted[n // 2 - 1]
x_2 = x_sorted[n // 2]
for i in x:
if x_sorted.index(i) < n // 2:
print(x_2)
else:
print(x_1) | n = int(eval(input()))
x = [int(i) for i in input().split()]
x_sorted = sorted(x)
x_1 = x_sorted[n // 2 - 1]
x_2 = x_sorted[n // 2]
for x_ in x:
if x_ <= x_1:
print(x_2)
else:
print(x_1) | p03379 |
n = eval(input())
xn = list(map(int, input().split()))
for i in range(len(xn)):
tmp = xn.copy()
tmp.pop(i)
tmp.sort()
print((tmp[int((int(n) - 1) / 2)])) | n = int(eval(input()))
xn = list(map(int, input().split()))
xn_s = sorted(xn)
m1 = xn_s[n//2 - 1]
m2 = xn_s[n//2]
for x in xn:
if x <= m1:
print(m2)
else:
print(m1) | p03379 |
import copy
n = int(eval(input()))
x_tmp = input().split()
x = []
for _ in x_tmp:
x.append(int(_))
num = n//2
for i in range(n):
tmp_x = copy.copy(x) # listを普通に代入すると、ディープコピーになる
tmp_x.pop(i) # pop(index)の出力は、削除した要素の値
# その上で、popするとリスト自体も改変される
# print(tmp_x)
tmp_x = sorted(tmp_x, reverse=True)
# print(tmp_x)
print((tmp_x[num-1]))
| n = int(eval(input()))
x_tmp = input().split()
x = [[0 for j in range(3)] for i in range(n)]
for i in range(n):
x[i][0] = int(x_tmp[i])
x[i][1] = i
x = sorted(x, key=lambda y: y[0])
mid = n//2
for i in range(n):
if i <= mid-1:
x[i][2] = x[mid][0]
else:
x[i][2] = x[mid-1][0]
x = sorted(x, key=lambda y: y[1])
for i in range(n):
print((x[i][2]))
| p03379 |
N=int(eval(input()))
X=list(map(int,input().split()))
sortedX=sorted(X)
a=sortedX[N//2-1]
b=sortedX[N//2]
for i in range(len(X)):
if X[i]<b:
print(b)
else:
print(a) | import sys
readline = sys.stdin.readline
N = int(readline())
X = list(map(int,readline().split()))
S = sorted(X)
mM = S[N // 2 - 1]
lM = S[N // 2]
for i in range(N):
if X[i] <= mM:
print(lM)
else:
print(mM)
| p03379 |
import math
import copy
#import sys
#import bisect
#input = sys.stdin.readline
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a%b)
def lcm(a, b):
return((a*b)//gcd(a,b))
def main():
#x,y = map(int,input().split()) x=1,y=2
#a = input().split() a=['1','2','3',...,'n']
#a = list(map(int,input().split())) a=[1,2,3,4,5,...,n]
#li = input().split('T') FFFTFTTFF => li=['FFF', 'F', '', 'FF']
n=int(eval(input()))
a = list(map(int,input().split()))
b=copy.copy(a)
for i in range(n):
x=b[i]
a.sort()
if x<=a[(n//2)-1]:
print((a[(n//2)]))
else:
print((a[(n//2)-1]))
main() | import math
import copy
#import sys
#import bisect
#input = sys.stdin.readline
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a%b)
def lcm(a, b):
return((a*b)//gcd(a,b))
def main():
#x,y = map(int,input().split()) x=1,y=2
#a = input().split() a=['1','2','3',...,'n']
#a = list(map(int,input().split())) a=[1,2,3,4,5,...,n]
#li = input().split('T') FFFTFTTFF => li=['FFF', 'F', '', 'FF']
n=int(eval(input()))
a = list(map(int,input().split()))
b=copy.copy(a)
a.sort()
for i in range(n):
x=b[i]
if x<=a[(n//2)-1]:
print((a[(n//2)]))
else:
print((a[(n//2)-1]))
main() | p03379 |
n = int(eval(input()))
x_str = input().split()
xs = [int(c) for c in x_str]
center = (len(xs) - 1)//2
c_xs = xs[:]
c_xs.sort()
if c_xs[center] == c_xs[center+1]:
for x in xs:
print((c_xs[center]))
else:
for x in xs:
if x <= c_xs[center]:
print((c_xs[center+1]))
else:
print((c_xs[center]))
| n = int(input())
x_str = input().split()
xs = [int(c) for c in x_str]
xs_len = len(xs)
center = (xs_len - 1)//2
c_xs = xs[:]
c_xs.sort()
[print(c_xs[center+1] if x <= c_xs[center] else c_xs[center]) for x in xs]
| p03379 |
n = int(eval(input()))
x_str = input().split()
xs = [int(c) for c in x_str]
xs_len = len(xs)
center = (xs_len - 1)//2
c_xs = xs[:]
c_xs.sort()
for x in xs:
print((c_xs[center+1] if x <= c_xs[center] else c_xs[center]))
| n = int(input())
x_str = input().split()
xs = [int(c) for c in x_str]
xs_len = len(xs)
center = (xs_len - 1)//2
c_xs = xs[:]
c_xs.sort()
[print(c_xs[center+1] if x <= c_xs[center] else c_xs[center]) for x in xs]
| p03379 |
n = int(input())
X = list(map(int, input().split()))
xs = sorted(X)
x0, x1 = xs[n // 2 - 1:n // 2 + 1]
[print(x1) if xs.index(x) <= n // 2 - 1 else print(x0) for x in X]
| n = int(input())
X = list(map(int, input().split()))
x0, x1 = sorted(X)[n // 2 - 1:n // 2 + 1]
[print(x1) if x <= x0 else print(x0) for x in X]
| p03379 |
n=int(eval(input()))
x=[int(i) for i in input().split()]
y=sorted(x)
for i in x:
if y.index(i)+1>n/2:
print((y[n//2-1]))
else:
print((y[n//2])) | n=int(eval(input()))
x=[int(i) for i in input().split()]
y=sorted(x)
for i in x:
if i>y[n//2-1]:
print((y[n//2-1]))
else:
print((y[n//2])) | p03379 |
import copy
n = int(eval(input()))
nums = list(map(int,input().split()))
for i in range(n):
tmp = copy.deepcopy(nums)
tmp.pop(i)
tmp.sort()
print((tmp[(n-1)//2])) | import copy
n = int(eval(input()))
nums = list(map(int,input().split()))
tmp = copy.deepcopy(nums)
tmp.sort()
cand1 = tmp[n//2]
cand2 = tmp[(n//2)-1]
for i in range(n):
if nums[i] < cand1:
print(cand1)
else:
print(cand2)
| p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
for i in range(N):
temp=X[:i]+X[i+1:]
temp.sort()
print((temp[N//2-1])) | N = int(eval(input()))
X = list(map(int, input().split()))
temp = sorted(X)
med = (temp[N//2]+temp[N//2-1])/2
for i in range(N):
if X[i] < med:
print((temp[N//2]))
else:
print((temp[N//2-1]))
| p03379 |
import sys
readline = sys.stdin.readline
N = int(readline())
X = [int(x) for x in readline().split()]
sX = sorted(X)
h = {}
for i in range(len(sX)):
h[sX[i]] = i
for i in range(N):
p = h[X[i]]
lr = sX[:p] + sX[p+1:]
print((lr[len(lr) // 2])) | # O(N * log(Xn))
from bisect import bisect_left
import sys
readline = sys.stdin.readline
N = int(readline())
X = [int(x) for x in readline().split()]
# X = [i for i in range(2*10**5)]
# N = len(X)
sX = sorted(X)
m = (N - 1) // 2
for i in range(N):
p = bisect_left(sX, X[i])
if p <= m:
print((sX[m + 1]))
else:
print((sX[m])) | p03379 |
import collections
N=int(eval(input()))
X=list(map(int,input().split()))
B_dict=collections.Counter(X)
B=sorted(B_dict.items())
cnt=0
for i in range(len(B)):
cnt+=B[i][1]
if cnt==N//2:
ans1=B[i][0]
ans2=B[i+1][0]
break
elif cnt>=N//2+1:
ans1=B[i][0]
ans2=B[i][0]
break
for i in range(N):
if X[i]<=ans1:
print(ans2)
else:
print(ans1)
| N=int(eval(input()))
X=list(map(int,input().split()))
Xsorted=sorted(X)
ans1=Xsorted[(N-1)//2]
ans2=Xsorted[(N-1)//2+1]
for i in range(N):
if X[i]<=ans1:
print(ans2)
else:
print(ans1)
| p03379 |
def c_many_medians(N, X):
x = [[0, 0] for _ in range(N)]
for i, e in enumerate(X):
x[i] = [i, e]
x.sort(key=lambda k: k[1])
mid = N // 2 - 1
a, b = [0] * N, [0] * N
for i, (k, v) in enumerate(x):
p=x.index([k,v])
a[k] = p
b[i] = v
ans = ['' for _ in range(N)]
for i in a:
if b[mid]>=b[a[i]]:
ans[i]='{}'.format(b[mid+1])
else:
ans[i]='{}'.format(b[mid])
return '\n'.join(ans)
N = int(eval(input()))
X = [int(i) for i in input().split()]
print((c_many_medians(N, X))) | def c_many_medians(N, X):
# 解説どおり
Y = sorted(X)
ans = ['' for _ in range(N)]
pos = N // 2
for k, xi in enumerate(X):
if xi < Y[pos]:
ans[k] = str(Y[pos])
else:
ans[k] = str(Y[pos - 1])
return '\n'.join(ans)
N = int(eval(input()))
X = [int(i) for i in input().split()]
print((c_many_medians(N, X))) | p03379 |
def C(m):
if xsort[m] > x[i]:
return True
return False
n = int(eval(input()))
x = list(map(int, input().split()))
xsort = sorted(x)
for i in range(n):
mb = 0
lb = n
m = (mb+lb) // 2
for j in range(100):
if C(m):
lb = m
else:
mb = m
if mb < n//2:
print((xsort[n//2]))
else:
print((xsort[n//2-1])) | N = int(eval(input()))
X = list(map(int, input().split()))
Y = sorted(X)
m1 = Y[N//2]
m2 = Y[N//2-1]
for i in range(N):
if m1 > X[i]:
print(m1) # left
else:
print(m2) # right | p03379 |
N = int(eval(input()))
X_list = list(map(int, input().split()))
for i in range(N):
tmp = X_list.copy()
tmp.pop(i)
tmp.sort()
print((tmp[int(N/2)-1])) | N = int(eval(input()))
X_list = list(map(int, input().split()))
tmp = X_list.copy()
tmp.sort()
a = tmp[int(N/2)-1]
b = tmp[int(N/2)]
for i in range(N):
if(X_list[i] <= a):
print(b)
else:
print(a) | p03379 |
#!/usr/bin/env python3
def main():
n = int(input())
x = list(map(int, input().split()))
ans = [0] * n
for i in range(n):
fix = x[0:i] + x[i + 1:n]
fix.sort()
ans[i] = fix[n // 2 - 1]
print(*ans, sep='\n')
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
def main():
n = int(input())
x = list(map(int, input().split()))
ans = [0] * n
x_sort = sorted(x)
a = x_sort[1:n]
a_med = a[n // 2 - 1]
b = x_sort[0:n - 1]
b_med = b[n // 2 - 1]
for i in range(n):
if x[i] < a_med:
ans[i] = a_med
else:
ans[i] = b_med
print(*ans, sep='\n')
if __name__ == "__main__":
main()
| p03379 |
N=int(eval(input()))
R=[0]*N
K=(N//2)-1
S=K+1
L=list(map(int,input().split()))
for i in range(N):
R[i]=[L[i],i]
R=sorted(R)
for i in range(N):
if R.index([L[i],i])<S:
print((R[S][0]))
else:
print((R[K][0])) | N=int(eval(input()))
L=list(map(int,input().split()))
n=N//2
R=sorted(L)
for i in L:
if i>R[n-1]:
print((R[n-1]))
else:
print((R[n])) | p03379 |
# ABC094 C - Many Medians
n = int(eval(input()))
x = list(map(int,input().split()))
for i in range(n):
y = x[:]
y[i] = 0
y.sort()
print((y[int((n/2))]))
| # ABC094 C - Many Medians
n = int(eval(input()))
x = list(map(int,input().split()))
y = sorted(x)
l = y[n//2 - 1]
r = y[n//2]
for x in x:
print((l if x >= r else r)) | p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
for i in range(N):
C = sorted([x for index, x in enumerate(X) if index != i])
print((C[len(C)//2]))
| N = int(eval(input()))
X = list(map(int, input().split()))
Y = sorted(X)
CL = Y[N//2-1]
CR = Y[N//2]
for x in X:
if x < CR:
print(CR)
else:
print(CL)
| p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
y = sorted(x)
for i in range(n):
z = y.copy()
z.remove(x[i])
print((z[n//2 -1])) | n = int(eval(input()))
x = list(map(int, input().split()))
y = sorted(x)
a = y[n//2 - 1]
b = y[n//2]
for i in range(n):
if x[i] >= b:
print(a)
else:
print(b) | p03379 |
n = int(eval(input()))
A = list(map(int, input().split()))
for i in range(n):
A2 = A.copy()
A2.pop(i)
A2.sort()
print((A2[(n // 2) - 1])) | n = int(eval(input()))
A = list(map(int, input().split()))
sortA = sorted(A)
for i in range(n):
if A[i] <= sortA[(n // 2) - 1]:
print((sortA[n // 2]))
else:
print((sortA[(n // 2) - 1])) | p03379 |
n = int(eval(input()))
A = list(map(int, input().split()))
sortA = sorted(A)
for i in range(n):
if A[i] <= sortA[(n // 2) - 1]:
print((sortA[n // 2]))
else:
print((sortA[(n // 2) - 1])) | n = int(eval(input()))
A = [int(i) for i in input().split()]
sortA = sorted(A)
mid = sortA[n//2 - 1]
midnext = sortA[n//2]
for i in range(n):
if A[i] <= mid:
print(midnext)
else:
print(mid) | p03379 |
n = int(eval(input()))
A = [int(i) for i in input().split()]
sortA = sorted(A)
mid = sortA[n//2 - 1]
midnext = sortA[n//2]
for i in range(n):
if A[i] <= mid:
print(midnext)
else:
print(mid) | n = int(eval(input()))
X = [int(i) for i in input().split()]
sortX = sorted(X, reverse=True)
m1 = sortX[n // 2 - 1]
m2 = sortX[n // 2]
for i in range(n):
if X[i] < m1:
print(m1)
else:
print(m2) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
sx = sorted(x)
m = n//2
l = sx[m - 1: m + 1]
for i in range(n):
if x[i] < l[1]:
print((l[1]))
else:
print((l[0])) | n = int(eval(input()))
x = list(map(int, input().split()))
sx = sorted(x)
m = n//2
l = sx[m - 1: m + 1]
for i in x:
if i < l[1]:
print((l[1]))
else:
print((l[0])) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
num = (n // 2) - 1
for i in range(n):
l = x[:]
l.pop(i)
l.sort()
print((l[num])) | n = int(eval(input()))
x = list(map(int, input().split()))
y = sorted(x[:])
for i in range(n):
if x[i] < y[n//2]:
print((y[n//2]))
else:
print((y[n//2 - 1])) | p03379 |
import collections as cl
def get_median(arr) :
idx = len(arr) + 1
idx = int(idx / 2) - 1
return arr[idx]
N = int(eval(input()))
X = [int(i) for i in input().split()]
X2 = X[:]
X2.sort(reverse=True)
dic = {}
for i in range(len(X)) :
l = X2[:]
key = l.pop(i)
if (key not in dic) :
dic[key] = get_median(l)
for i in X :
print((dic[i])) | N = int(eval(input()))
X = [int(i) for i in input().split()]
X2 = sorted(X)
mapper = {}
for i in range(N//2) :
if (X2[i] in mapper) :
continue
mapper[X2[i]] = X2[len(X2)//2]
for i in range(N//2,N) :
if (X2[i] in mapper) :
continue
mapper[X2[i]] = X2[(len(X2)//2) - 1]
for x in X :
print((mapper[x])) | p03379 |
N = int(eval(input()))
array = list(map(int, input().split()))
for i in range(0, N):
konichiwa = list(array)
konichiwa.pop(i)
konichiwa.sort()
print((konichiwa[int(N / 2) - 1]))
| N = int(eval(input()))
array = list(map(int, input().split()))
test = list(array)
test.sort()
wow = test[int(N / 2) - 1: int(N / 2) + 1]
for i in range(0, N):
if array[i] > wow[0]:
print((wow[0]))
else:
print((wow[1]))
| p03379 |
#!/usr/bin/env python
import sys
import copy
input = sys.stdin.readline
n = int(eval(input()))
x = list(map(int, input().split()))
for i in range(n):
xx = copy.deepcopy(x)
xx.pop(i)
xx = sorted(xx)
print((xx[(n-1)//2]))
| #!/usr/bin/env python
import sys
import copy
input = sys.stdin.readline
n = int(eval(input()))
x = list(map(int, input().split()))
xx = sorted(x)
l = xx[(n-1)//2]
r = xx[n//2]
mid = (l+r)/2
for i in range(n):
if x[i] >= mid:
print(l)
else:
print(r)
| p03379 |
N = int(eval(input()))
Alist = list(map(int, input().split()))
Alist = [Alist[i] - (i+1) for i in range(N)]
Alist.sort()
if N == 1:
print((0))
else:
sumlist = []
for i in range(N-1):
if i < N // 2:
sumlist.append(- sum(Alist[:i+1]) + sum(Alist[i+1:]) - Alist[i+1] * (N - 2 * (i + 1)))
else:
sumlist.append(- sum(Alist[:i+1]) + sum(Alist[i+1:]) + Alist[i] * (N - 2 * (N - i - 1)))
print((min(sumlist)))
| N = int(eval(input()))
Alist = list(map(int, input().split()))
Alist = [Alist[i] - (i+1) for i in range(N)]
Alist.sort()
b = Alist[N//2]
ans = 0
for i in range(N):
ans += abs(Alist[i] - b)
print(ans) | p03309 |
N = int(eval(input()))
A = list(map(int, input().split()))
def f(b):
r = 0
for i, ai in enumerate(A):
r += abs(ai - (b + i + 1))
return r
mx = (10 ** 9) + 1
mn = (-10 ** 9) - 1
# print(f(0))
while mx - mn > 10:
m = (mx + mn) // 2
x = f(m)
y = f(m+1)
if x < y:
mx = m + 1
else:
mn = m
ans = []
for i in range(mn, mx+1):
ans.append(f(i))
print((min(ans))) | N = int(eval(input()))
A = list(map(int, input().split()))
def f(b):
r = 0
for i, ai in enumerate(A):
r += abs(ai - (b + i + 1))
return r
A2 = []
for i, ai in enumerate(A):
A2.append(ai - (i+1))
SA2 = sorted(A2)
ans = f(SA2[((N+1)//2) - 1])
print(ans) | p03309 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=[0]
c=[0]
d=[0]
e=[0]
count=0
count2=0
count3=0
count4=0
for i in range(n):
a[i]-=i
a.sort()
for i in range(n-1):
count+=a[i+1]-a[i]
count3+=a[n-i-1]-a[n-i-2]
b.append(count)
d.append(count3)
for i in range(n-1):
count2+=b[i+1]
count4+=d[i+1]
c.append(count2)
e.append(count4)
ans=10**18
for i in range(n):
ans=min(ans,c[-1]-c[i]-b[i]*(n-i-1)+e[-1]-e[n-i-1]-d[n-i-1]*i)
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
for i in range(n):
a[i]-=i
a.sort()
x=a[n//2]
ans=0
for i in range(n):
ans+=abs(a[i]-x)
print(ans) | p03309 |
n=int(eval(input()))
a=list(map(int,input().split()))
for i in range(n):
a[i]-=i
a.sort()
x=a[n//2]
ans=0
for i in range(n):
ans+=abs(a[i]-x)
print(ans) | n=int(eval(input()))
a=[int(i) for i in input().split()]
a=[a[i]-(i+1) for i in range(n)]
a.sort()
if n%2==0:
print((sum(a[n//2:])-sum(a[0:n//2])))
else:
print((sum(a[n//2+1:])-sum(a[0:n//2]))) | p03309 |
import math
N = int(eval(input()))
A = list(map(int, input().split()))
# print(N, A)
_A = []
for i in range(len(A)):
_A.append(A[i] - (i + 1))
_A.sort()
median = _A[math.floor(len(A) / 2)]
sadness = 0
for i in range(len(A)):
sadness += abs(A[i] - (i + 1 + median))
print(sadness)
| import math
N = int(eval(input()))
A = list(map(int, input().split()))
# print(N, A)
_A = [A[i] - (i + 1) for i in range(len(A))]
_A.sort()
median = _A[math.floor(len(A) / 2)]
sadness = 0
for i in range(len(A)):
sadness += abs(A[i] - (i + 1 + median))
print(sadness)
| p03309 |
n = int(eval(input()))
a = list(map(int, input().split()))
a = [a[i] - (i+1) for i in range(len(a))]
import statistics
b = int(statistics.median(a))
ans = sum([abs(i-b) for i in a])
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
a = [a[i] - (i+1) for i in range(len(a))]
b = sorted(a)[int(n/2)]
print((sum([abs(i-b) for i in a]))) | p03309 |
import math
import statistics
n = int(eval(input()))
a = list(map(int,input().split()))
a = [aa-i-1 for i, aa in enumerate(a)]
answer = n*10**20
median_low = statistics.median_low(a)
median_high = statistics.median_high(a)
for m in (median_low,median_high):
ans=0
for aa in a:
ans += abs(aa-m)
answer = min(ans,answer)
print(answer)
| #!/usr/bin/env python3
import sys
def solve(N: int, A: "List[int]"):
difA = [0]*N
for i in range(N):
difA[i] = A[i]-(i+1)
difA.sort()
if N%2 == 0:
g1 = difA[N//2]
g2 = difA[N//2-1]
a1 = 0
a2 = 0
for i in range(N):
a1 += abs(difA[i]-g1)
a2 += abs(difA[i]-g2)
print((min(a1,a2)))
else:
g = difA[N//2]
a = 0
for i in range(N):
a += abs(difA[i]-g)
print(a)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, A)
if __name__ == '__main__':
main()
| p03309 |
import sys
import math
mod=10**9+7
inf=float("inf")
from math import sqrt
from collections import deque
from collections import Counter
input=lambda: sys.stdin.readline().strip()
sys.setrecursionlimit(11451419)
from functools import lru_cache
#メモ化再帰defの冒頭に毎回 @lru_cache(maxsize=10**10)
#引数にlistはだめ
#######ここまでテンプレ#######
#######ここから天ぷら########
n=int(eval(input()))
A=list(map(int,input().split()))
SA=[0 for i in range(n)]
for i in range(n):
SA[i]=A[i]-i-1
SA.sort()
if n%2==0:
geta=(SA[n//2]+SA[n//2-1])//2
else:
geta=SA[n//2]
ans=0
for i in range(n):
ans+= abs(A[i]-(geta+i+1))
print(ans)
| n=int(eval(input()))
A=list(map(int,input().split()))
if n==1:print((0));exit()
A=[A[i]-i-1 for i in range(n)]
B=sorted(A)
#print(B)
if n%2==1:
d=B[n//2]
print((sum([abs(A[i]-d) for i in range(n)])))
exit()
ans=0
d=(B[n//2-1]+B[n//2])//2
print((sum([abs(A[i]-d) for i in range(n)])))
| p03309 |
n = int(eval(input()))
nums = list(map(int, input().split()))
for i in range(n):
nums[i] -= (i + 1)
if i == 0:
x = y = nums[i]
else:
if nums[i] < x:
x = nums[i]
elif y < nums[i]:
y = nums[i]
d = 0
for i in range(x, y):
c = 0
for j in range(n):
c += abs(nums[j] - i)
else:
if d != 0 and d < c:
print(d)
break
elif d == 0 and c == 0:
print(d)
break
else:
d = c
else:
print(d)
| n = int(eval(input()))
nums = list(map(int, input().split()))
for i in range(n):
nums[i] -= (i + 1)
nums.sort()
if (n-1) % 2 != 0:
m = n//2 - 1
else:
m = (n-1)//2
a = sum(nums[m+1:]) - (n-m-1)*nums[m]
b = - sum(nums[0:m+1]) + (m+1)*nums[m]
print((a+b)) | p03309 |
N = int(eval(input()))
A = list(map(int, input().split()))
A_sunuke = [a - (i+1) for (i,a) in enumerate(A)]
sunuke_cnts = set(A_sunuke)
idx, cnt = 0, 0
for i in sunuke_cnts:
a_cnt = A_sunuke.count(i)
if cnt < a_cnt:
cnt = a_cnt
idx = i
rtn = sum([abs(a - idx) for a in A_sunuke])
print(rtn) | N = int(eval(input()))
A = list(map(int, input().split()))
A_sunuke = sorted(a - (i+1) for (i,a) in enumerate(A))
center = A_sunuke[len(A) // 2]
rtn = sum([abs(a - center) for a in A_sunuke])
print(rtn) | p03309 |
n = int(eval(input()))
ary = list(map(int,input().split()))
a = []
ans = 0
for i in range(n):
a += [ary[i] - (i+1)]
a.sort()
if n % 2 == 1:
b = a[-(-n // 2)-1]
for i in range(n):
ans += abs(a[i] - b)
else:
b = (a[n//2-1]+a[n//2])//2
for i in range(n):
ans += abs(a[i] - b)
print(ans) | n = int(eval(input()))
ary = sorted([j-(i+1) for i,j in enumerate(map(int,input().split()))])
if len(ary) % 2 == 0:
a = (ary[len(ary)//2]+ary[len(ary)//2-1])//2
ans = 0
for i in ary:
ans += abs(i - a)
else:
a = ary[len(ary)//2]
ans = 0
for i in ary:
ans += abs(i - a)
print(ans) | p03309 |
N = int(eval(input()))
A = list(map(int, input().split()))
max = max(A)
list = []
x = 0
for b in range(-max,max):
for i in range(N):
x = x + abs(A[i]-(b+i))
list.append(x)
x = 0
print((min(list))) | N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(N):
A[i] = A[i] - i - 1
A = sorted(A)
medN = N//2
x = 0
for i in range(N):
x = x + abs(A[i] - A[medN])
print(x) | p03309 |
N = int(eval(input()))
alist = list(map(int, input().split()))
blist = []
for i in range(N):
blist.append(alist[i]-i-1)
blist.sort()
mid = blist[len(blist)//2]
ans = 0
for i in range(N):
ans += abs(blist[i]-mid)
print(ans)
| N = int(eval(input()))
alist = list(map(int, input().split()))
blist = []
for i in range(N):
blist.append(alist[i]-i-1)
blist.sort()
mid = blist[N//2]
print((sum([abs(b-mid) for b in blist])))
| p03309 |
N=int(eval(input()))
a=list (map(int,input().split()))
abs_list=[]
for b in range(-max(a),max(a)):
c=0
for i in range(N):
c=abs(a[i]-(b+i+1))+c
abs_list.append(c)
print((min(abs_list))) | N=int(eval(input()))
a=list (map(int,input().split()))
abs_list=[]
c=0
for i in range(N):
c=(a[i]-(i+1))
abs_list.append(c)
abs_list.sort()
b=abs_list[int(N/2)]
d=0
for i in range(N):
d=abs(abs_list[i]-b)+d
print(d) | p03309 |
# ABC102C - Linear Approximation (ARC100C)
from statistics import median_high, median_low
def main():
n = int(eval(input()))
A = tuple(map(int, input().rstrip().split()))
A = tuple(j - i for i, j in enumerate(A, start=1))
ans = float("inf")
for b in range(median_low(A), median_high(A) + 1):
ans = min(ans, sum(abs(a - b) for a in A))
print(ans)
if __name__ == "__main__":
main() | # ABC102C - Linear Approximation (ARC100C)
from statistics import median
def main():
n = int(eval(input()))
A = tuple(map(int, input().rstrip().split()))
A = tuple(j - i for i, j in enumerate(A, start=1))
b = median(A)
ans = sum(abs(a - b) for a in A)
print((int(ans)))
if __name__ == "__main__":
main() | p03309 |
# ABC102C - Linear Approximation (ARC100C)
from statistics import median
def main():
n = int(eval(input()))
A = tuple(map(int, input().rstrip().split()))
A = tuple(j - i for i, j in enumerate(A, start=1))
b = median(A)
ans = sum(abs(a - b) for a in A)
print((int(ans)))
if __name__ == "__main__":
main() | # ABC102C - Linear Approximation (ARC100C)
def main():
n = int(eval(input()))
A = tuple(map(int, input().rstrip().split()))
A = sorted(j - i for i, j in enumerate(A, start=1))
b = A[n // 2]
ans = sum(abs(a - b) for a in A)
print(ans)
if __name__ == "__main__":
main() | p03309 |
# ABC102 C - Linear Approximation
N = int(eval(input()))
A = list(map(int, input().split()))
bl = []
for i in range(N):
bl.append(A[i] - (i+1))
bl.sort()
b = bl[N//2]
ans = 0
for i in range(N):
ans += abs(A[i] - (b + (i+1)))
print(ans) | # ABC102 C - Linear Approximation
N = int(eval(input()))
A = list(map(int, input().split()))
bl = []
for i in range(N):
bl.append(A[i] - (i+1))
bl.sort()
if N % 2 == 0:
b = (bl[N//2-1] + bl[N//2]) // 2
else:
b = bl[N//2]
ans = 0
for i in range(N):
ans += abs(A[i] - (b + (i+1)))
print(ans) | p03309 |
from collections import Counter
N=int(eval(input()))
A=list(map(int,input().split()))
l=[]
n=1
for i in A:
l.append(i-n)
n+=1
c=Counter(l)
c=c.most_common(N)
ans_l=[]
for i in range(len(c)):
b=c[i][0]
ans=0
for j in l:
ans+=abs(j-b)
ans_l.append(ans)
print((min(ans_l))) | #from collections import Counter
import math
N=int(eval(input()))
A=list(map(int,input().split()))
l=[]
n=1
for i in A:
l.append(i-n)
n+=1
l.sort()
#中央値
#切り捨て
c=int(math.floor(N/2))
ans_l=[]
ans=0
for j in l:
ans+=abs(j-l[c])
print(ans) | p03309 |
#!/usr/bin/env python3
import math
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A = [A[i] - i - 1 for i in range(N)]
A.sort()
diff = A[(N-1)//2]
print((sum([abs(a-diff) for a in A])))
if __name__ == "__main__":
main()
| N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(N):
A[i] -= i+1
A.sort()
b = A[(N-1)//2]
ans = 0
for i in range(N):
ans += abs(A[i]-b)
print(ans) | p03309 |
import sys
N = int(eval(input()))
A_list = list(map(int, input().split()))
for i in range(N):
A_list[i] = A_list[i] - i - 1
min_A = min(A_list)
max_A = max(A_list)
sadness = sys.maxsize
for b in range(min_A, max_A + 1):
tmp_sadness = 0
for A in A_list:
tmp_sadness += abs(A - b)
if(sadness > tmp_sadness):
sadness = tmp_sadness
print(sadness) | N = int(eval(input()))
A_list = list(map(int, input().split()))
for i in range(N):
A_list[i] = A_list[i] - i - 1
A_list = sorted(A_list)
if(N % 2 == 0):
key = N // 2
else:
key = (N - 1) // 2
b = A_list[key]
sadness = 0
for A in A_list:
sadness += abs(A - b)
print(sadness) | p03309 |
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
ans = -1
for i in range(n):
a[i] = a[i] - i - 1
count = Counter(a)
for b in list(count.keys()):
tmp = 0
for i in range(n):
tmp += abs(a[i] - b)
if ans == -1 or tmp < ans:
ans = tmp
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(n):
a[i] = a[i] - i - 1
a.sort()
b = a[n // 2]
for i in range(n):
ans += abs(a[i] - b)
print(ans)
| p03309 |
import statistics
N = int(eval(input()))
A = list(map(int,input().rstrip().split()))
i = 0
kari =[]
for j in A:
i +=1
B = j-i
kari.append(B)
sum = 0
for i in kari:
sum+=abs(i-statistics.median(kari))
print((int(sum))) | import statistics
N = int(eval(input()))
A = input().rstrip().split()
i = 0
kari =[]
for j in A:
i +=1
B = int(j)-i
kari.append(B)
b= statistics.median(kari)
sum = 0
for i in kari:
sum+=abs(i-b)
print((int(sum))) | p03309 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans = sum(A)
imin = min(A)-N
imax = max(A)+N
def calcAns(b):
global A
return sum([abs(A[i]-(b+i+1)) for i in range(N)])
while True:
if imin == imax:
break
else:
imid = imin + (imax - imin)//2
tmp = calcAns(imid)
if calcAns(imid+1)<tmp:
imin = imid+1
elif calcAns(imid-1)<tmp:
imax = imid-1
else:
imin = imid
imax = imid
print((calcAns(imin))) | N = int(eval(input()))
A = list(map(int,input().split()))
B = [A[i]-i-1 for i in range(N)]
B.sort()
if N%2:
b = B[(N-1)//2]
else:
b = (B[N//2]+B[N//2 - 1])//2
print((sum([abs(A[i]-b-i-1) for i in range(N)]))) | p03309 |
n=int(eval(input()))
a=[int(i)-p-1 for p,i in enumerate(input().split())]
a.sort()
ans=0
for i in range(n):
ans+=abs(a[i]-a[n//2])
print(ans) | n=int(eval(input()))
a=[int(i)-p for p,i in enumerate(input().split())]
a.sort()
ans=0
for i in a:
ans+=abs(i-a[n//2])
print(ans) | p03309 |
def main():
from statistics import median
n, *a, = list(map(int, open(0).read().split()))
a = [x - i for i, x in enumerate(a, 1)]
a.sort()
m = int(median(a))
ans = sum([abs(x - m) for x in a])
print(ans)
if __name__ == '__main__':
main()
| def main():
n, *a, = list(map(int, open(0).read().split()))
a = [x - i for i, x in enumerate(a, 1)]
a.sort()
if n % 2 == 0:
ans = sum(a[n // 2:]) - sum(a[:n // 2])
else:
ans = sum(a[n // 2 + 1:]) - sum(a[:n // 2])
print(ans)
if __name__ == '__main__':
main()
| p03309 |
n = int(eval(input()))
l = list(map(int,input().split()))
l = list(l[i]-i for i in range(n))
import statistics as st
m = int(st.median(l))
print((sum(abs(m-i) for i in l))) | n=int(eval(input()))
l=list(map(int,input().split()))
l=sorted(l[i]-i for i in range(n))
print((sum(abs(i-l[n//2]) for i in l))) | p03309 |
N = int(eval(input()))
A = [int(i) for i in input().split()]
nums = []
total = 0
for i in range(N):
A[i] = A[i] - (i+1)
if A[i] not in nums:
nums.append(A[i])
total = total + A[i]
avg = (total/N)
'''
up = 0
down = 0
for i in range(N):
if avg >= A[i]:
down = down + 1
else:
up = up + 1
if down > up:
if avg < 0:
avg = int(avg) - 1
else:
avg = int(avg)
else:
avg = round(avg)
sad = 0
for i in range(N):
sad = sad + abs(A[i]-avg)
'''
l = [int(avg)-1,int(avg),int(avg) + 1]
sad = []
for i in range(3):
tmp = 0
for j in range(N):
tmp = tmp + abs(A[j]-l[i])
sad.append(tmp)
for i in range(len(nums)):
tmp = 0
for j in range(N):
tmp = tmp + abs(A[j]-nums[i])
sad.append(tmp)
print((min(sad))) | N = int(eval(input()))
A = [int(i) for i in input().split()]
for i in range(N):
A[i] = A[i] - (i+1)
A.sort()
medium = A[int(N/2)]
s = 0
for i in range(N):
s = s + abs(A[i]-medium)
print(s) | p03309 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=[0]*n
for i in range(n):
b[i]=a[i]-(i+1)
b.sort()
min_b=b[n//2]
ans=0
for i in range(n):
ans+=abs(a[i]-(min_b+(i+1)))
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
temp=[]
for i in range(n):
temp.append(a[i]-i)
temp.sort()
b=temp[n//2]
ans=0
for i in range(n):
ans+=abs(a[i]-i-b)
print(ans)
| p03309 |
N = int(eval(input()))
A = list(map(int, input().split()))
alta = []
for i in range(N):
alta.append(A[i] - (i + 1))
plus = min(alta)
for i in range(N):
alta[i] -= plus
def f(x):
sum = 0
for i in alta:
sum += abs(x - i)
return sum
left, right = 0, max(alta)
while abs(right - left) > 3:
mid1 = (right * 2 + left) // 3 + 1
mid2 = (right + left * 2) // 3
if f(mid1) >= f(mid2):
# 上限を下げる（最小値をとるxはもうちょい下めの数だな）
right = mid1
else:
# 下限を上げる（最小値をとるxはもうちょい上めの数だな）
left = mid2
ans = float('inf')
for i in range(left, right + 1):
ans = min(ans, f(i))
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
alta = []
for i in range(N):
alta.append(A[i] - (i + 1))
# 最小値を0に揃えないとバグる
plus = min(alta)
for i in range(N):
alta[i] -= plus
def f(x):
sum = 0
for i in alta:
sum += abs(x - i)
return sum
# 極値があるので三分探索使う
left, right = 0, max(alta)
# 答えが整数になる問題の場合このrightとleftの幅を3未満にするとバグる
while abs(right - left) > 3:
mid1 = (right * 2 + left) // 3 + 1
mid2 = (right + left * 2) // 3
if f(mid1) >= f(mid2):
# 上限を下げる（最小値をとるxはもうちょい下めの数だな）
right = mid1
else:
# 下限を上げる（最小値をとるxはもうちょい上めの数だな）
left = mid2
ans = float('inf')
for i in range(left, right + 1):
ans = min(ans, f(i))
print(ans) | p03309 |
N = int(eval(input()))
A = list(map(int, input().split()))
#y seppen wo motomeru
I=[A[i]-i-1 for i in range(N)]
m=min(I)
M=max(I)
opp=10**100
for i in range(m, M+1):
#print(i)
temp=sum([abs(val-i) for val in I])
if temp<opp:
opp=temp
print(opp) | N = int(eval(input()))
A = list(map(int, input().split()))
def func(b):
return sum([abs(val - b) for val in I])
#y seppen wo motomeru
I=[A[i]-i-1 for i in range(N)]
I.sort()
if N % 2 ==1:
print((func(I[N//2])))
else:
print((func(I[N//2])))
| p03309 |
def calc(A, b):
retval = 0
for a in A:
retval += abs(a - b)
return retval
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(N):
A[i] -= (i + 1)
left = min(A)
right = max(A)
while left < right:
c1 = (left + left + right) // 3 # floor
c2 = -(-(left + right + right) // 3) # ceil
if calc(A, c1) <= calc(A, c2):
right = c2 - 1
else:
left = c1 + 1
print((calc(A, left)))
if __name__ == "__main__":
main()
|
def calc(A, b):
retval = 0
for a in A:
retval += abs(a - b)
return retval
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(N):
A[i] -= (i + 1)
print((calc(A, sorted(A)[(N)//2])))
# left = min(A)
# right = max(A)
#
# while left < right:
# c1 = (left + left + right) // 3 # floor
# c2 = -(-(left + right + right) // 3) # ceil
# if calc(A, c1) <= calc(A, c2):
# right = c2 - 1
# else:
# left = c1 + 1
# print(calc(A, left))
if __name__ == "__main__":
main()
| p03309 |
N=int(input().strip())
A=list(map(int, input().strip().split()))
A_posi=[]
A_nega=[]
for i in range(N):
A[i]=A[i]-(i+1)
if A[i]<0:
A_nega.append(A[i]*(-1))
elif A[i]>0:
A_posi.append(A[i])
sm=sum(abs(i) for i in A)
A_tgt=A_nega if len(A_nega)>len(A_posi) else A_posi
A_tgt=sorted(A_tgt)
b=0
max_diff=0
if len(A_tgt):
while b<A_tgt[-1]:
b+=1
diff=0
for i,a in enumerate(A_tgt):
if a>=b:
diff+=(len(A_tgt)-i)*b
break
else:
diff+=2*a-b
diff-=(N-len(A_tgt))*b
if diff >max_diff:
max_diff=diff
else:
break
print((sm-max_diff)) | N=int(input().strip())
A=list(map(int, input().strip().split()))
A_posi=[]
A_nega=[]
for i in range(N):
A[i]=A[i]-(i+1)
if A[i]<0:
A_nega.append(A[i]*(-1))
elif A[i]>0:
A_posi.append(A[i])
sm=sum(abs(i) for i in A)
A_tgt=A_nega if len(A_nega)>len(A_posi) else A_posi
A_tgt=sorted(A_tgt)
diff=0
old=0
mindiff=0
for i,a in enumerate(A_tgt):
if old<a:
diffdiff=(-i+(len(A_tgt)-i))*(a-old)
else:
continue
if diffdiff<0:
break
old=a
diff = diff+diffdiff
total_diff=-diff+a*(N-len(A_tgt))
if total_diff<mindiff:
mindiff=total_diff
print((sm+mindiff)) | p03309 |
import statistics
from decimal import Decimal,ROUND_HALF_UP
n = int(eval(input()))
a = list(map(int,input().split()))
for i in range(n):
a[i] -= i+1
a.sort()
med = Decimal(str(statistics.median(a))).quantize(Decimal('0'), rounding=ROUND_HALF_UP)
print((sum([abs(i-med) for i in a]))) | n = int(eval(input()))
a = list(map(int,input().split()))
for i in range(n):
a[i] -= i+1
a.sort()
ans = 0
for i in range(n):
ans += abs(a[i] - a[n//2])
print(ans) | p03309 |
from statistics import median
N = int(eval(input()))
A = list(map(int, input().split()))
A_star = [a - (i + 1) for i, a in enumerate(A)]
def calc_score(b):
score = 0
for a in A_star:
score += abs(a - b)
return score
def decide_direction(b):
score0 = calc_score(b)
score1 = calc_score(b + 1)
if score0 > score1:
return 1
else:
return -1
b = int(median(A_star))
direction = decide_direction(b)
pre_score = calc_score(b)
while True:
b += direction
score = calc_score(b)
if score >= pre_score:
print(pre_score)
break
else:
pre_score = score
| from statistics import median
N = int(eval(input()))
A = list(map(int, input().split()))
A_star = [a - (i + 1) for i, a in enumerate(A)]
def calc_score(b):
score = 0
for a in A_star:
score += abs(a - b)
return score
print((calc_score(int(median(A_star))))) | p03309 |
import sys
from collections import deque
from collections import Counter
import statistics
import math
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()
n = ni()
a_li = na()
for i in range(n):
a_li[i] = a_li[i] - (i + 1)
m1 = statistics.median_low(a_li)
m2 = statistics.median_high(a_li)
ans1 = 0
ans2 = 0
for i in range(n):
ans1 += abs(a_li[i] - m1)
ans2 += abs(a_li[i] - m2)
print((min(ans1, ans2)))
| import sys
from collections import deque
from collections import Counter
import statistics
import math
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()
n = ni()
a_li = na()
for i in range(n):
a_li[i] = a_li[i] - (i + 1)
m1 = statistics.median_low(a_li)
#m2 = statistics.median_high(a_li)
ans1 = 0
#ans2 = 0
for i in range(n):
ans1 += abs(a_li[i] - m1)
#ans2 += abs(a_li[i] - m2)
print(ans1)
| p03309 |
import sys
from collections import deque
from collections import Counter
import statistics
import math
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()
n = ni()
a_li = na()
for i in range(n):
a_li[i] = a_li[i] - (i + 1)
m1 = statistics.median_low(a_li)
#m2 = statistics.median_high(a_li)
ans1 = 0
#ans2 = 0
for i in range(n):
ans1 += abs(a_li[i] - m1)
#ans2 += abs(a_li[i] - m2)
print(ans1)
| import sys
from collections import deque
from collections import Counter
import statistics
import math
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()
n = ni()
a_li = na()
for i in range(n):
a_li[i] = a_li[i] - (i + 1)
m1 = statistics.median_high(a_li)
#m2 = statistics.median_high(a_li)
ans1 = 0
#ans2 = 0
for i in range(n):
ans1 += abs(a_li[i] - m1)
#ans2 += abs(a_li[i] - m2)
print(ans1)
| p03309 |
N = int(eval(input()))
A = [int(x) for x in input().split()]
B = sorted([A[i]-i for i in range(N)])
# return -A[0]-...-A[k-1]+A[k]+...+A[N-1]
def partial_sum(k):
return -sum(B[:k]) + sum(B[k:])
l = [partial_sum(i) -(N-2*i)*B[i] for i in range(N)]
print((min(l)))
| N = int(eval(input()))
A = [int(x) for x in input().split()]
B = sorted([A[i]-i for i in range(N)])
b = B[(N-1)//2] if N % 2 != 0 else (B[N//2-1]+B[N//2])//2
print((sum(abs(B[i]-b) for i in range(N))))
| p03309 |
# https://atcoder.jp/contests/abc102/tasks/arc100_a
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
class cumsum1d:
def __init__(self, ls: list):
'''
1次元リストを受け取る
'''
from itertools import accumulate
self.ls_accum = [0] + list(accumulate(ls))
def total(self, i, j):
# もとの配列lsにおける[i,j)の中合計
return self.ls_accum[j] - self.ls_accum[i]
N = read_a_int()
A = read_ints()
if N == 1:
print((0))
exit()
B = [a - i for a, i in zip(A, list(range(1, N + 1)))]
B.sort()
# 絶対値を区切る境目はどこがよいか？
B_cum = cumsum1d(B)
ans = 10**15
for k in range(1, N):
tmp_sum = -B_cum.total(0, k) + B_cum.total(k, N)
add = min((2 * k - N) * B[k - 1], (2 * k - N) * B[k])
ans = min(ans, tmp_sum + add)
print(ans)
# 式ごちゃごちゃやったけど絶対楽な方法がある。
# 明日復習
| # https://atcoder.jp/contests/abc102/tasks/arc100_a
# Aの数列を前処理で加工し、順番に依存しない数列Bに加工する
# abs(Bi-x)の和を最小化するxはBの中央値である。(立式しxで微分したのちKについて増減表を書いてみよ)
# それを答えとすれば良い
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
N = read_a_int()
A = read_ints()
B = [a - i for a, i in zip(A, list(range(1, N + 1)))]
B.sort()
x = B[N // 2]
ans = 0
for b in B:
ans += abs(x - b)
print(ans)
| p03309 |
from statistics import mean
import math
N = int(eval(input()))
*A, = list(map(int, input().split()))
B = [A[i]-i for i in range(N)]
b = mean(B)
bm = math.floor(b)
K = [x - bm for x in B]
KZ = [abs(x) for x in K]
Z = sum(KZ)
for i in range(2000):
C = [abs(x-i+1000) for x in K]
Z = min([sum(C),Z])
print((int(Z))) | from statistics import median
import math
N = int(eval(input()))
*A, = list(map(int, input().split()))
B = [A[i]-i for i in range(N)]
b = median(B)
bm = math.floor(b)
K = [x - bm for x in B]
KZ = [abs(x) for x in K]
Z = sum(KZ)
for i in range(20):
C = [abs(x-i+10) for x in K]
Z = min([sum(C),Z])
print((int(Z))) | p03309 |
from statistics import median
import math
N = int(eval(input()))
*A, = list(map(int, input().split()))
B = [A[i]-i for i in range(N)]
b = median(B)
bm = math.floor(b)
K = [x - bm for x in B]
KZ = [abs(x) for x in K]
Z = sum(KZ)
for i in range(20):
C = [abs(x-i+10) for x in K]
Z = min([sum(C),Z])
print((int(Z))) | from statistics import median
import math
N = int(eval(input()))
*A, = list(map(int, input().split()))
B = [A[i]-i for i in range(N)]
b = median(B)
bm = math.floor(b)
bM = math.ceil(b)
Bm = [abs(x - bm) for x in B]
BM = [abs(x - bM) for x in B]
m = sum(Bm)
M = sum(BM)
print((int(min([m,M])))) | p03309 |
n=int(eval(input()))
X=list(map(int,input().split()))
Y=[]
for i in range(n):
Y.append(X[i]-(i+1))
Z=list(set(Y))
res=10000000000000000
for i in range(len(Z)):
cnt=0
for j in range(n):
cnt+=abs(Y[j]-Z[i])
if cnt<res:
res=cnt
print(res) | n=int(eval(input()))
X=list(map(int,input().split()))
Y=[]
for i in range(n):
Y.append(X[i]-(i+1))
Y.sort()
res_1=0
if n%2==1:
m=Y[int((n-1)/2)]
for j in range(n):
res_1+=abs(Y[j]-m)
else:
m=(Y[int(n/2)-1]+Y[int(n/2)])//2
for j in range(n):
res_1+=abs(Y[j]-m)
print(res_1)
| p03309 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 10 ** 9
for i in range(n):
b = a[i] - (i+1)
f = 0
for j in range(n):
f += abs(a[j] - (b + j + 1))
ans = min(f,ans)
print(ans)
| n = int(eval(input()))
A = list(map(int, input().split()))
B = [A[i] - (i+1) for i in range(n)]
B.sort()
b = B[n//2]
f = 0
for i in range(n):
f += abs(B[i] - b)
print(f)
| p03309 |
# -*- coding: utf-8 -*-
# AtCoder Beginner Contest
if __name__ == '__main__':
from statistics import median
n = int(eval(input()))
a = list(map(int, input().split()))
total = 0
# See:
# https://www.youtube.com/watch?v=UX4AuiCVtN4
# https://beta.atcoder.jp/contests/abc102/submissions/2768315
mod_a = sorted([ai - i for i, ai in enumerate(a, 1)])
b = median(mod_a)
for i in range(n):
total += abs(mod_a[i] - b)
print((int(total)))
| # -*- coding: utf-8 -*-
def main():
from statistics import median
n = int(eval(input()))
a = list(map(int, input().split()))
mod_a = list()
ans = 0
for index, ai in enumerate(a, 1):
mod_a.append(ai - index)
b = int(median(mod_a))
for mod_ai in mod_a:
ans += abs(mod_ai - b)
print(ans)
if __name__ == '__main__':
main()
| p03309 |
from math import ceil, floor
N = int(eval(input()))
A = [int(t) for t in input().split()]
if len(A) != N: raise
p = [A[i-1] - i for i in range(1, N+1)]
q = []
for b in p:
q.append(sum(abs(x - b) for x in p))
print((min(q))) | from math import ceil, floor
N = int(eval(input()))
A = [int(t) for t in input().split()]
if len(A) != N: raise
p = [A[i-1] - i for i in range(1, N+1)]
p.sort()
q = []
for b in p[N//2 - 1 : N//2 + 2]:
q.append(sum(abs(x - b) for x in p))
print((min(q)))
| p03309 |
from math import ceil, floor
N = int(eval(input()))
A = [int(t) for t in input().split()]
if len(A) != N: raise
p = [A[i-1] - i for i in range(1, N+1)]
p.sort()
q = []
for b in p[N//2 - 1 : N//2 + 2]:
q.append(sum(abs(x - b) for x in p))
print((min(q)))
| N = int(eval(input()))
A = [int(t) for t in input().split()]
if len(A) != N: raise
p = [A[i-1] - i for i in range(1, N+1)]
p.sort()
b = p[N // 2]
print((sum(abs(x - b) for x in p)))
| p03309 |
from statistics import median as m
n=int(eval(input()))
A=list(map(int,input().split()))
B=sorted([A[i]-i-1 for i in range(n)])
print((int(sum([abs(b-m(B)) for b in B])))) | from statistics import median as m
n=int(eval(input()))
A=list(map(int,input().split()))
B=sorted([A[i]-i-1 for i in range(n)])
mb=m(B)
print((int(sum([abs(b-mb) for b in B])))) | p03309 |
n=int(eval(input()))
a=list(map(int,input().split()))
b_low=-1*(10**20)
b_high=10**20
b_low_d=sum([abs(a[i]-(b_low+2+i)) for i in range(n)])-sum([abs(a[i]-(b_low+1+i)) for i in range(n)])
b_high_d=sum([abs(a[i]-(b_high+2+i)) for i in range(n)])-sum([abs(a[i]-(b_high+1+i)) for i in range(n)])
while b_high-b_low>10:
b_tmp=(b_low+b_high)//2
b_tmp_d=sum([abs(a[i]-(b_tmp+2+i)) for i in range(n)])-sum([abs(a[i]-(b_tmp+1+i)) for i in range(n)])
if b_tmp_d>0:
b_high=b_tmp
else:
b_low=b_tmp
ans=10**20
for j in range(b_low,b_high):
ans=min(ans,sum([abs(a[i]-(j+2+i)) for i in range(n)]))
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
b_low=-1*(10**12)
b_high=10**12
b_low_d=sum([abs(a[i]-(b_low+2+i)) for i in range(n)])-sum([abs(a[i]-(b_low+1+i)) for i in range(n)])
b_high_d=sum([abs(a[i]-(b_high+2+i)) for i in range(n)])-sum([abs(a[i]-(b_high+1+i)) for i in range(n)])
while b_high-b_low>10:
b_tmp=(b_low+b_high)//2
b_tmp_d=sum([abs(a[i]-(b_tmp+2+i)) for i in range(n)])-sum([abs(a[i]-(b_tmp+1+i)) for i in range(n)])
if b_tmp_d>0:
b_high=b_tmp
else:
b_low=b_tmp
ans=10**20
for j in range(b_low,b_high):
ans=min(ans,sum([abs(a[i]-(j+2+i)) for i in range(n)]))
print(ans) | p03309 |
n=int(eval(input()))
a=list(map(int,input().split()))
b_low=-1*(10**10)
b_high=10**10
b_low_d=sum([abs(a[i]-(b_low+2+i)) for i in range(n)])-sum([abs(a[i]-(b_low+1+i)) for i in range(n)])
b_high_d=sum([abs(a[i]-(b_high+2+i)) for i in range(n)])-sum([abs(a[i]-(b_high+1+i)) for i in range(n)])
while b_high-b_low>10:
b_tmp=(b_low+b_high)//2
b_tmp_d=sum([abs(a[i]-(b_tmp+2+i)) for i in range(n)])-sum([abs(a[i]-(b_tmp+1+i)) for i in range(n)])
if b_tmp_d>0:
b_high=b_tmp
else:
b_low=b_tmp
ans=10**20
for j in range(b_low,b_high):
ans=min(ans,sum([abs(a[i]-(j+2+i)) for i in range(n)]))
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
arr=sorted([a[i]-i-1 for i in range(n)])
if len(arr)%2==0:
tmp=[arr[len(arr)//2-1],arr[len(arr)//2]]
else:
tmp=[arr[len(arr)//2]]
ans=10**20
for b in tmp:
ans=min(ans,sum([abs(a[i]-b-i-1) for i in range(n)]))
print(ans) | p03309 |
# author: kagemeka
# created: 2019-11-08 14:51:29(JST)
## internal modules
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
import statistics
# import functools
# import operator
## external modules
# import scipy.special # if use comb function on AtCoder,
# import scipy.misc # select scipy.misc.comb (old version)
def main():
n, *a = (int(x) for x in sys.stdin.read().split())
for i in range(n):
a[i] -= (i + 1)
if n % 2 != 0:
b = statistics.median(a)
else:
if a.count(statistics.median_high(a)) >= a.count(statistics.median_low(a)):
b = statistics.median_high(a)
else:
b = statistics.median_low(a)
ans = sum([abs(a[i] - b) for i in range(n)])
print(ans)
if __name__ == "__main__":
# execute only if run as a script
main()
| import sys
n, *a = list(map(int, sys.stdin.read().split()))
def main():
for i in range(n):
a[i] -= (i + 1)
a.sort()
b = a[n // 2]
res = 0
for i in range(n):
res += abs(a[i] - b)
return res
if __name__ == '__main__':
ans = main()
print(ans) | p03309 |
n = int(eval(input()))
a = list(map(int, input().split()))
c = []
for i in range(n):
c.append(a[i] - (i + 1))
c.sort()
ave = c[n//2]
ans = 10**9*n
for b in range(ave-100, ave+100):
t = 0
for i in range(n):
t += abs(c[i]-b)
ans = min(ans, t)
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(n):
a[i] = a[i] - (i + 1)
a.sort()
if n % 2 == 1:
median = a[n // 2]
else:
median = (a[n//2 - 1] + a[n//2]) // 2
ans = 0
for i in range(n):
ans += abs(a[i] - median)
print(ans) | p03309 |
n = int(eval(input()))
a = list(map(int, input().split()))
max = max(a)
min = max * -1
ans = 10000000
prev = 10000000
t = len(a)
flag = 0
for b in range(min,max):
sum = 0
for i in range(t):
sum += abs(a[i] - (b+i+1))
if ans > sum:
ans = sum
if prev < sum:
flag += 1
if flag == 2:
break
prev = sum
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
b = []
for i in range(n):
b.append(a[i]-(i+1))
# print(b)
b.sort()
# print(b)
min_b=b[n//2]
# print(min_b)
ans = 0
for i in range(n):
ans+=abs(a[i]-(min_b+(i+1)))
# print(ans)
print(ans) | p03309 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = [0]*N
for i in range(N):
B[i] = A[i] - i
B.sort()
res = 0
x = B[N//2]
for i in range(N):
res += max(x - B[i], -x + B[i])
print(res) | N = int(eval(input()))
A = list(map(int, input().split()))
B = [0]*N
for i in range(N):
B[i] = A[i] - i
B.sort()
res = 0
x = B[N//2]
for i in range(N):
res += abs(x - B[i])
print(res) | p03309 |
N = int(eval(input()))
AS = input().split()
for i in AS:
i = int(i)
result = 0
result_f = 0
result_rf = 0
for j in range (1, N+1):
result += abs(int(AS[j-1]) - 0 - j)
for j in range (1, N+1):
result_f += abs(int(AS[j-1]) - 1 - j)
for j in range (1, N+1):
result_rf += abs(int(AS[j-1]) - ( - 1) - j)
if result < result_f and result < result_rf:
print(result)
else:
old_list= [0]
b = 1
while(not b in old_list):
counter = 0
for j in range (1,N+1):
counter += abs(int(AS[j-1]) - b - j)
if counter <= result:
old_list.append(b)
b += 1
result = counter
else:
old_list.append(b)
continue
result_1 = result
b = -1
while(not b in old_list):
counter = 0
for j in range (1,N+1):
counter += abs(int(AS[j-1]) - b - j)
if counter <= result:
old_list.append(b)
b -= 1
result = counter
else:
old_list.append(b)
continue
result_2 = result
print((min(result_1,result_2))) | N = int(eval(input()))
AS = input().split()
AS = [int(i) for i in AS]
BS = [int(AS[j-1] - j) for j in range(1,N+1)]
BS_s = BS.sort()
b = BS[N//2]
result_a = 0
result_b = 0
result_c = 0
for j in range (1, N+1):
result_a += abs(int(AS[j-1]) - b - j)
for j in range (1, N+1):
result_b += abs(int(AS[j-1]) - b - 1 - j)
for j in range (1, N+1):
result_c += abs(int(AS[j-1]) - b + 1 - j)
print((int(min(result_a,result_b,result_c)))) | p03309 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.