problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
| fixed_code
stringlengths 12
526k
| labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
| fixed_submission_id
int64 2
1.54M
| user_id
stringlengths 10
10
| language
stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02773
|
import collections
n = int(input())
list = []
for x in range(n):
s = input()
list.append(s)
c = collections.Counter(list)
mc = c.most_common()
max = mc[0][1]
anslist = []
for val in mc:
if max == val[1]: anslist.append(val[0])
else: break
anslist.sort
for x in anslist:
print(x)
|
import collections
n = int(input())
list = []
for x in range(n):
s = input()
list.append(s)
c = collections.Counter(list)
mc = c.most_common()
max = mc[0][1]
anslist = []
for val in mc:
if max == val[1]: anslist.append(val[0])
else: break
anslist.sort()
for x in anslist:
print(x)
|
[
"call.add"
] | 571,697
| 571,698
|
u556610039
|
python
|
p02773
|
n = int(input())
s = [input() for _ in range(n)]
s.sort()
count = {}
for s_i in s:
if not s_i in count:
count[s_i] = 0
count[s_i] += 1
res = sorted(zip(count.keys(), count.values()),
key=lambda x: x[1], reverse=True)
num = res[0][1]
res2 = []
for res_i in res:
if res_i[1] != num:
exit(0)
res2.append(res_i[0])
res2.sort()
for res2_i in res2:
print(res2_i)
|
n = int(input())
s = [input() for _ in range(n)]
s.sort()
count = {}
for s_i in s:
if not s_i in count:
count[s_i] = 0
count[s_i] += 1
res = sorted(zip(count.keys(), count.values()),
key=lambda x: x[1], reverse=True)
num = res[0][1]
res2 = []
for res_i in res:
if res_i[1] != num:
break
res2.append(res_i[0])
res2.sort()
for res2_i in res2:
print(res2_i)
|
[
"control_flow.exit.remove",
"control_flow.break.add",
"call.arguments.change"
] | 571,699
| 571,700
|
u706929073
|
python
|
p02773
|
n=int(input())
s=[]
ansl=[]
for i in range(n):
s.append(input())
counter = Counter(s)
max=counter.most_common(1)[0][1]
for w in counter.most_common():
if w[1]==max:
ansl.append(w[0])
ansl.sort()
for i in range(len(ansl)):
print(ansl[i])
|
from collections import Counter
n=int(input())
s=[]
ansl=[]
for i in range(n):
s.append(input())
counter = Counter(s)
max=counter.most_common(1)[0][1]
for w in counter.most_common():
if w[1]==max:
ansl.append(w[0])
ansl.sort()
for i in range(len(ansl)):
print(ansl[i])
|
[] | 571,701
| 571,702
|
u189188797
|
python
|
p02773
|
n = int(input())
s = {}
for i in range(n):
tmp = input()
if not tmp in s.keys():
s[tmp] = 1
else:
s[tmp] += 1
m = 0
l = []
for i in sorted(s.items(), key=lambda x:x[1], reverse=True):
if m < i[1]:
m = i[1]
l.append(i[0])
else:
break
for i in sorted(l):
print(i)
|
n = int(input())
s = {}
for i in range(n):
tmp = input()
if not tmp in s.keys():
s[tmp] = 1
else:
s[tmp] += 1
m = 0
l = []
for i in sorted(s.items(), key=lambda x:x[1], reverse=True):
if m <= i[1]:
m = i[1]
l.append(i[0])
else:
break
for i in sorted(l):
print(i)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 571,707
| 571,708
|
u061539997
|
python
|
p02773
|
N = int(input())
words = []
for _ in range(N):
words.append(input())
count_table = {}
for w in words:
if w in count_table:
count_table[w] += 1
else:
count_table[w] = 0
best_count = 0
for w in count_table:
if best_count < count_table[w]:
best_count = count_table[w]
best_words = [w]
elif best_count == count_table[w]:
best_words.append(w)
for w in sorted(best_words):
print(w)
|
N = int(input())
words = []
for _ in range(N):
words.append(input())
count_table = {}
for w in words:
if w in count_table:
count_table[w] += 1
else:
count_table[w] = 0
best_count = 0
best_words = []
for w in count_table:
if best_count < count_table[w]:
best_count = count_table[w]
best_words = [w]
elif best_count == count_table[w]:
best_words.append(w)
for w in sorted(best_words):
print(w)
|
[
"assignment.add"
] | 571,713
| 571,714
|
u601321817
|
python
|
p02773
|
N = int(input())
d = {}
for _ in range(N):
s = input()
if not s in d:
d[s] = 1
else:
d[s] += 1
x = sorted(list(d.items()), key=lambda x:x[1], reverse=True)
n = 0
l = []
for k, v in x:
if v >= n:
n = v
l.append(v)
for y in sorted(l):
print(y)
|
N = int(input())
d = {}
for _ in range(N):
s = input()
if not s in d:
d[s] = 1
else:
d[s] += 1
x = sorted(list(d.items()), key=lambda x:x[1], reverse=True)
n = 0
l = []
for k, v in x:
if v >= n:
n = v
l.append(k)
for y in sorted(l):
print(y)
|
[
"identifier.change",
"call.arguments.change"
] | 571,715
| 571,716
|
u978178314
|
python
|
p02773
|
n=int(input())
d={}
for i in range(n):
s=input()
try:
if d[s]==1:
d[s]+=1
except:
d[s]=1
l=[]
maxi=-1
for i in d:
if d[i]>maxi:
maxi=d[i]
for i in d:
if d[i]==maxi:
l.append(i)
l.sort()
for i in l:
print(i)
|
n=int(input())
d={}
for i in range(n):
s=input()
try:
if d[s]>0:
d[s]+=1
except:
d[s]=1
l=[]
maxi=-1
for i in d:
if d[i]>maxi:
maxi=d[i]
for i in d:
if d[i]==maxi:
l.append(i)
l.sort()
for i in l:
print(i)
|
[
"control_flow.loop.for.condition.change"
] | 571,729
| 571,730
|
u641441412
|
python
|
p02773
|
def main():
N = int(input())
strings = {}
for _ in range(N):
s = input()
if s in strings.keys():
strings[s] += 1
else:
strings[s] = 1
strings = sorted(strings.items(), key=lambda x: x[0], reverse=True)
maximum = strings[0][1]
answer = []
for s in strings:
if s[1] == maximum:
answer.append(s[0])
answer.sort()
for ans in answer:
print(ans)
if __name__ == '__main__':
main()
|
def main():
N = int(input())
strings = {}
for _ in range(N):
s = input()
if s in strings.keys():
strings[s] += 1
else:
strings[s] = 1
strings = sorted(strings.items(), key=lambda x: x[1], reverse=True)
maximum = strings[0][1]
answer = []
for s in strings:
if s[1] == maximum:
answer.append(s[0])
answer.sort()
for ans in answer:
print(ans)
if __name__ == '__main__':
main()
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 571,731
| 571,732
|
u022979415
|
python
|
p02773
|
from collections import Counter
n = int(input())
S = ['_']*n
for i in range(n):
S[i] = input()
cS = Counter(S).most_common()
mx = cS[0][1]
ans = []
for i in range(n):
if cS[i][1]==mx:
ans.append(cS[i][0])
else:
break
ans = sorted(ans)
for i in range(len(ans)):
print(ans[i])
|
from collections import Counter
n = int(input())
S = ['_']*n
for i in range(n):
S[i] = input()
cS = Counter(S).most_common()
mx = cS[0][1]
ans = []
for i in range(len(cS)):
if cS[i][1]==mx:
ans.append(cS[i][0])
else:
break
ans = sorted(ans)
for i in range(len(ans)):
print(ans[i])
|
[
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 571,737
| 571,738
|
u747703115
|
python
|
p02773
|
N = int(input())
S = [None] * N
m = dict()
for i in range(N):
s = input()
if not s in m.keys():
m[s] = 1
else:
m[s] += 1
max_cnt = max(m.values())
ret = []
for k, v in sorted(m.items(), key=lambda x: x[1], reverse=True):
if v < max_cnt:
break
ret.append(k)
ret.sort()
print(ret)
|
N = int(input())
S = [None] * N
m = dict()
for i in range(N):
s = input()
if not s in m.keys():
m[s] = 1
else:
m[s] += 1
max_cnt = max(m.values())
ret = []
for k, v in sorted(m.items(), key=lambda x: x[1], reverse=True):
if v < max_cnt:
break
ret.append(k)
ret.sort()
for s in ret:
print(s)
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 571,742
| 571,743
|
u512099209
|
python
|
p02773
|
import collections
N = int(input())
S_list = [input() for i in range(N)]
C = collections.Counter(S_list)
L = C.most_common()
max_ = L[0][1]
ans = []
#print("========")
for i in L:
if i[1] == max_:
ans.append(i[0])
else:
exit()
ans.sort()
for i in ans:
print(i)
|
import collections
N = int(input())
S_list = [input() for i in range(N)]
C = collections.Counter(S_list)
L = C.most_common()
max_ = L[0][1]
ans = []
#print("========")
for i in L:
if i[1] == max_:
ans.append(i[0])
else:
break
ans.sort()
for i in ans:
print(i)
|
[
"control_flow.exit.remove",
"control_flow.break.add",
"call.arguments.change"
] | 571,748
| 571,749
|
u267300160
|
python
|
p02773
|
from collections import Counter
n = int(input())
s = [input() for _ in range(n)]
counter = Counter(s)
index = 0
ans = []
for k, v in counter.most_common():
if index == 0:
max_v = v
ans.append(k)
else:
if v == max_v:
ans.append(k)
else:
exit()
index += 1
ans = sorted(ans)
for i in range(len(ans)):
print(ans[i])
|
from collections import Counter
n = int(input())
s = [input() for _ in range(n)]
counter = Counter(s)
index = 0
ans = []
for k, v in counter.most_common():
if index == 0:
max_v = v
ans.append(k)
else:
if v == max_v:
ans.append(k)
else:
break
index += 1
ans = sorted(ans)
for i in range(len(ans)):
print(ans[i])
|
[
"control_flow.exit.remove",
"control_flow.break.add",
"call.arguments.change"
] | 571,761
| 571,762
|
u690781906
|
python
|
p02774
|
import numpy as np
n,k = map(int,input().split())
a = list(map(int,input().split()))
a = np.array(a)
a.sort()
p = a[a>0]
z = a[a==0]
m = a[a<0]
low = -10**18
high = 10**18
while high-low>1:
mid = (high + low) //2
count = 0
if mid >= 0:
count += len(z)*n
count += a.searchsorted(mid//p,side = "right").sum()
count += (n-a.searchsorted(-(-mid//m),side = "left")).sum()
count -= np.count_nonzero(a*a <= mid)
count /= 2
print(count)
if count >= k:
high = mid
if count < k:
low = mid
print(high)
|
import numpy as np
n,k = map(int,input().split())
a = list(map(int,input().split()))
a = np.array(a)
a.sort()
p = a[a>0]
z = a[a==0]
m = a[a<0]
low = -10**18
high = 10**18
while high-low>1:
mid = (high + low) //2
count = 0
if mid >= 0:
count += len(z)*n
count += a.searchsorted(mid//p,side = "right").sum()
count += (n-a.searchsorted(-(-mid//m),side = "left")).sum()
count -= np.count_nonzero(a*a <= mid)
count /= 2
if count >= k:
high = mid
if count < k:
low = mid
print(high)
|
[
"call.remove"
] | 571,774
| 571,775
|
u201928947
|
python
|
p02774
|
#abc_155_d
import numpy as np
n,k = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
a = np.array(a)
a.sort()
plus = a[a>0]
zero = a[a==0]
minus= a[a<0]
left = -10**9
right = 10**9
while left+1 < right:
mid = (left+right)//2
cnt = 0
if mid >=0:
cnt += len(zero) * n
cnt += a.searchsorted(mid//plus, side="right").sum()
cnt += (n - a.searchsorted(-(-mid//minus), side="left")).sum()
cnt -= np.count_nonzero(a*a <= mid)
cnt /= 2
if cnt >= k:
right = mid
if cnt < k:
left=mid
print(right)
|
#abc_155_d
import numpy as np
n,k = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
a = np.array(a)
a.sort()
plus = a[a>0]
zero = a[a==0]
minus= a[a<0]
left = -10**18
right = 10**18
while left+1 < right:
mid = (left+right)//2
cnt = 0
if mid >=0:
cnt += len(zero) * n
cnt += a.searchsorted(mid//plus, side="right").sum()
cnt += (n - a.searchsorted(-(-mid//minus), side="left")).sum()
cnt -= np.count_nonzero(a*a <= mid)
cnt /= 2
if cnt >= k:
right = mid
if cnt < k:
left=mid
print(right)
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 571,791
| 571,792
|
u693716675
|
python
|
p02774
|
import sys
import numpy as np
INF = 10**18+5
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
a = np.sort(a)
ap = a[a > 0]
an = a[a < 0]
zc = n * (n - ap.size - an.size)
l = -INF
r = INF
while(l+1 < r):
x = (l+r)//2
total = (n-np.searchsorted(a, x // an, side='right')).sum()
if x >= 0:
total += zc
total += np.searchsorted(a, x // ap, side='right').sum()
total -= a[a*a <= x].size
total //= 2
if total < k:
l = x
else:
r = x
print(r)
main()
|
import sys
import numpy as np
INF = 10**18+5
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
a = np.sort(a)
ap = a[a > 0]
an = a[a < 0]
zc = n * (n - ap.size - an.size)
l = -INF
r = INF
while(l+1 < r):
x = (l+r)//2
total = (n-np.searchsorted(a, -(-x // an), side='left')).sum()
if x >= 0:
total += zc
total += np.searchsorted(a, x // ap, side='right').sum()
total -= a[a*a <= x].size
total //= 2
if total < k:
l = x
else:
r = x
print(r)
main()
|
[
"call.arguments.change",
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.keyword_argument.change"
] | 571,803
| 571,804
|
u927078824
|
python
|
p02774
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
z = 0
while a[z] < 0:
z += 1
am = a[:z]
ap = a[z:]
if k <= len(am)*len(ap):
ap = ap[::-1]
a = -(10**18)-10
b = 0
while True:
if b-a <= 1:
break
m = (a+b)//2
count = 0
r = 0
while r+1 < len(am) and ap[0]*am[r] <= m:
r += 1
for i in range(len(ap)):
while r > 0 and ap[i]*am[r] > m:
r -= 1
if ap[i]*am[r] <= m:
count += r+1
else:
count += r
if count < k:
a = m
else:
b = m
print(b)
else:
k -= len(am)*len(ap)
am = list(map(lambda x: -x, am[::-1]))
a = 0
b = 10**18+10
while True:
if b-a <= 1:
break
m = (a+b)//2
count = 0
r = len(ap)-1
for i in range(len(ap)):
while r > 0 and ap[i]*ap[r] > m:
r -= 1
if ap[i]*ap[r] <= m:
if i <= r:
count -= 1
count += r+1
else:
if i < r:
count -= 1
count += r
r = len(am)-1
for i in range(len(am)):
while r > 0 and am[i]*am[r] > m:
r -= 1
if am[i]*am[r] <= m:
if i <= r:
count -= 1
count += r+1
else:
if i < r:
count -= 1
count += r
if count//2 < k:
a = m
else:
b = m
print(b)
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
z = 0
while a[z] < 0:
z += 1
am = a[:z]
ap = a[z:]
if k <= len(am)*len(ap):
ap = ap[::-1]
a = -(10**18)-10
b = 1000
while True:
if b-a <= 1:
break
m = (a+b)//2
count = 0
r = 0
while r+1 < len(am) and ap[0]*am[r] <= m:
r += 1
for i in range(len(ap)):
while r > 0 and ap[i]*am[r] > m:
r -= 1
if ap[i]*am[r] <= m:
count += r+1
else:
count += r
if count < k:
a = m
else:
b = m
print(b)
else:
k -= len(am)*len(ap)
am = list(map(lambda x: -x, am[::-1]))
a = -1000
b = 10**18+10
while True:
if b-a <= 1:
break
m = (a+b)//2
count = 0
r = len(ap)-1
for i in range(len(ap)):
while r > 0 and ap[i]*ap[r] > m:
r -= 1
if ap[i]*ap[r] <= m:
if i <= r:
count -= 1
count += r+1
else:
if i < r:
count -= 1
count += r
r = len(am)-1
for i in range(len(am)):
while r > 0 and am[i]*am[r] > m:
r -= 1
if am[i]*am[r] <= m:
if i <= r:
count -= 1
count += r+1
else:
if i < r:
count -= 1
count += r
if count//2 < k:
a = m
else:
b = m
print(b)
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.unary.add"
] | 571,826
| 571,827
|
u808916291
|
python
|
p02774
|
import numpy as np
def partsolve(A, x, positive, zero, negative):
"""
:param A:
:param x:
:return: Aの積のペアの中で、x以下となるペアの個数
"""
count = 0
if x >= 0:
count = len(zero) * len(A)
P = x // positive
Pc = np.searchsorted(A, P, side='right')
count += Pc.sum()
N = (-x-1) // -negative
Nc = np.searchsorted(A, N, side='right')
Nc = len(A) - Nc
count += Nc.sum()
count -= np.count_nonzero(A * A <= x)
return count // 2
def solve(N, K, As):
A = np.array(sorted(As), np.int64)
positive = A[A > 0]
zero = A[A == 0]
negative = A[A < 0]
left = -10 ** 18
right = 10 ** 18
while right - left > 1:
mid = left + (right - left) // 2
c = partsolve(A, mid, positive, zero, negative)
print(mid, c)
if c < K:
left = mid
else:
right = mid
return right
if __name__ == "__main__":
N, K = tuple(map(int, input().split(" ")))
As = list(map(int, input().split(" ")))
print(solve(N, K, As))
|
import numpy as np
def partsolve(A, x, positive, zero, negative):
"""
:param A:
:param x:
:return: Aの積のペアの中で、x以下となるペアの個数
"""
count = 0
if x >= 0:
count = len(zero) * len(A)
P = x // positive
Pc = np.searchsorted(A, P, side='right')
count += Pc.sum()
N = (-x-1) // -negative
Nc = np.searchsorted(A, N, side='right')
Nc = len(A) - Nc
count += Nc.sum()
count -= np.count_nonzero(A * A <= x)
return count // 2
def solve(N, K, As):
A = np.array(sorted(As), np.int64)
positive = A[A > 0]
zero = A[A == 0]
negative = A[A < 0]
left = -10 ** 18
right = 10 ** 18
while right - left > 1:
mid = left + (right - left) // 2
c = partsolve(A, mid, positive, zero, negative)
if c < K:
left = mid
else:
right = mid
return right
if __name__ == "__main__":
N, K = tuple(map(int, input().split(" ")))
As = list(map(int, input().split(" ")))
print(solve(N, K, As))
|
[
"call.remove"
] | 571,844
| 571,845
|
u297109012
|
python
|
p02774
|
import numpy as np
def partsolve(A, x, positive, zero, negative):
"""
:param A:
:param x:
:return: Aの積のペアの中で、x以下となるペアの個数
"""
count = 0
if x >= 0:
count = len(zero) * len(A)
P = x // positive
Pc = np.searchsorted(A, P, side='right')
count += Pc.sum()
N = (-x-1) // -negative
Nc = np.searchsorted(A, N, side='right')
Nc = len(A) - Nc
count += Nc.sum()
count -= np.count_nonzero(A * A <= x)
return count // 2
def solve(N, K, As):
A = np.array(sorted(As), np.int64)
positive = A[A > 0]
zero = A[A == 0]
negative = A[A < 0]
left = -10 ** 18
right = 10 ** 18
while right - left > 1:
mid = left + (right - left) // 2
c = partsolve(A, mid, positive, zero, negative)
print(mid, c)
if c < K:
left = mid
else:
right = mid
return right
if __name__ == "__main__":
N, K = tuple(map(int, input().split(" ")))
As = list(map(int, input().split(" ")))
print(solve(N, K, As))
|
import numpy as np
def partsolve(A, x, positive, zero, negative):
"""
:param A:
:param x:
:return: Aの積のペアの中で、x以下となるペアの個数
"""
count = 0
if x >= 0:
count = len(zero) * len(A)
P = x // positive
Pc = np.searchsorted(A, P, side='right')
count += Pc.sum()
N = (-x-1) // -negative
Nc = np.searchsorted(A, N, side='right')
Nc = len(A) - Nc
count += Nc.sum()
count -= np.count_nonzero(A * A <= x)
return count // 2
def solve(N, K, As):
A = np.array(sorted(As), np.int64)
positive = A[A > 0]
zero = A[A == 0]
negative = A[A < 0]
left = -10 ** 18
right = 10 ** 18
while right - left > 1:
mid = left + (right - left) // 2
c = partsolve(A, mid, positive, zero, negative)
if c < K:
left = mid
else:
right = mid
return right
if __name__ == "__main__":
N, K = tuple(map(int, input().split(" ")))
As = list(map(int, input().split(" ")))
print(solve(N, K, As))
|
[
"call.remove"
] | 571,844
| 571,846
|
u297109012
|
python
|
p02774
|
# coding: utf-8
import numpy as np
def solve(*args: str) -> str:
n, k = map(int, args[0].split())
A = np.array(sorted(map(int, args[1].split())))
N = A[A < 0]
P = A[0 < A]
count = 0
left, right = -10**18, 10**18
while left+1 < right:
x = (left+right)//2
count = 0
if k < len(N)*len(P):
count += (len(P)-np.searchsorted(P, -(-x//N), side='left')).sum()
elif (n*(n-1) - len(N)*(len(N)-1) - len(P)*(len(P)-1))//2 < k:
for D in (-(N[::-1]), P):
count += np.searchsorted(D, x//D, side='right').sum()
count -= len(D[D*D <= x])
count //= 2
count += (n*(n-1) - len(N)*(len(N)-1) - len(P)*(len(P)-1))//2
else:
right = 0
break
if count < k:
left = x
else:
right = x
return str(right)
if __name__ == "__main__":
print(solve(*(open(0).read().splitlines())))
|
# coding: utf-8
import numpy as np
def solve(*args: str) -> str:
n, k = map(int, args[0].split())
A = np.array(sorted(map(int, args[1].split())))
N = A[A < 0]
P = A[0 < A]
count = 0
left, right = -10**18, 10**18
while left+1 < right:
x = (left+right)//2
count = 0
if k <= len(N)*len(P):
count += (len(P)-np.searchsorted(P, -(-x//N), side='left')).sum()
elif (n*(n-1) - len(N)*(len(N)-1) - len(P)*(len(P)-1))//2 < k:
for D in (-(N[::-1]), P):
count += np.searchsorted(D, x//D, side='right').sum()
count -= len(D[D*D <= x])
count //= 2
count += (n*(n-1) - len(N)*(len(N)-1) - len(P)*(len(P)-1))//2
else:
right = 0
break
if count < k:
left = x
else:
right = x
return str(right)
if __name__ == "__main__":
print(solve(*(open(0).read().splitlines())))
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 571,858
| 571,859
|
u164727245
|
python
|
p02774
|
import numpy as np
N, K = map(int, input().split())
L = np.array(list(map(int, input().split())))
L = np.sort(L)
pos = L[0<L]
neg = L[0>L]
zero = len(L[L==0])
def f(x):
tmp = 0
if x>=0:
tmp += zero*N
tmp += np.searchsorted(L, x//pos, side='right').sum()
tmp += (N - np.searchsorted(L, x//neg, side='right')).sum()
tmp -= np.count_nonzero(L*L<=x)
return tmp//2
l, r = -10**18, 10**18
while l<r-1:
m = (l+r)//2
count = f(m)
if count >= K:
r = m
else:
l = m
print(r)
|
import numpy as np
N, K = map(int, input().split())
L = np.array(list(map(int, input().split())))
L = np.sort(L)
pos = L[0<L]
neg = L[0>L]
zero = len(L[L==0])
def f(x):
tmp = 0
if x>=0:
tmp += zero*N
tmp += np.searchsorted(L, x//pos, side='right').sum()
tmp += (N - np.searchsorted(L, -(-x//neg), side='left')).sum()
tmp -= np.count_nonzero(L*L<=x)
return tmp//2
l, r = -10**18, 10**18
while l<r-1:
m = (l+r)//2
count = f(m)
if count >= K:
r = m
else:
l = m
print(r)
|
[
"call.arguments.change",
"literal.string.change",
"expression.operation.binary.change",
"call.arguments.keyword_argument.change"
] | 571,881
| 571,882
|
u054514819
|
python
|
p02774
|
import numpy as np
N, K = map(int, input().split())
L = np.array(list(map(int, input().split())))
L = np.sort(L)
pos = L[0<L]
neg = L[0>L]
zero = len(L[L==0])
def f(x):
tmp = 0
if x>=0:
tmp += zero*N
tmp += np.searchsorted(L, x//pos, side='right').sum()
tmp += (N - np.searchsorted(L, x//neg, side='left')).sum()
tmp -= np.count_nonzero(L*L<=x)
return tmp//2
l, r = -10**18, 10**18
while l<r-1:
m = (l+r)//2
count = f(m)
if count >= K:
r = m
else:
l = m
print(r)
|
import numpy as np
N, K = map(int, input().split())
L = np.array(list(map(int, input().split())))
L = np.sort(L)
pos = L[0<L]
neg = L[0>L]
zero = len(L[L==0])
def f(x):
tmp = 0
if x>=0:
tmp += zero*N
tmp += np.searchsorted(L, x//pos, side='right').sum()
tmp += (N - np.searchsorted(L, -(-x//neg), side='left')).sum()
tmp -= np.count_nonzero(L*L<=x)
return tmp//2
l, r = -10**18, 10**18
while l<r-1:
m = (l+r)//2
count = f(m)
if count >= K:
r = m
else:
l = m
print(r)
|
[
"call.arguments.change"
] | 571,883
| 571,882
|
u054514819
|
python
|
p02774
|
def d_pairs():
# 参考: https://maspypy.com/atcoder-参加感想-2019-02-16abc-155
import numpy as np
N, K = [int(i) for i in input().split()]
A = np.array([int(i) for i in input().split()], np.int64)
A = np.sort(A)
zero = A[A == 0]
positive = A[A > 0]
negative = A[A < 0]
def f(c):
"""数列 A から 2 要素を選んで積を取ったとき、c 以下となるようなペアの選び方"""
count_pair = 0
# a (数列の要素) == 0 かつ c >= 0 なら、a * x <= c となる x は数列の任意の要素
if c >= 0:
count_pair += len(zero) * N
# a > 0 の場合
count_pair += np.searchsorted(A, c // positive, side='right').sum()
# a < 0 の場合 (全体から引くようにすると、見通しがよい)
count_pair += (N - np.searchsorted(A, (-c - 1) // (-negative), side='right')).sum()
# 添字の順序に制約があることを反映する
count_pair -= np.count_nonzero(A * A <= c) # 「添字が同じ要素を 2 度選んだ場合」を引く
return count_pair // 2
# 数列から要素を 2 個選んで積を取ったとき、制約からあり得る値の範囲
lower, upper = -10 ** 18, 10 ** 18
while upper - lower > 1:
x = (lower + upper) // 2
if f(x) >= K:
upper = x
else:
lower = x
return f(x)
print(d_pairs())
|
def d_pairs():
# 参考: https://maspypy.com/atcoder-参加感想-2019-02-16abc-155
import numpy as np
N, K = [int(i) for i in input().split()]
A = np.array([int(i) for i in input().split()], np.int64)
A = np.sort(A)
zero = A[A == 0]
positive = A[A > 0]
negative = A[A < 0]
def f(c):
"""数列 A から 2 要素を選んで積を取ったとき、c 以下となるようなペアの選び方"""
count_pair = 0
# a (数列の要素) == 0 かつ c >= 0 なら、a * x <= c となる x は数列の任意の要素
if c >= 0:
count_pair += len(zero) * N
# a > 0 の場合
count_pair += np.searchsorted(A, c // positive, side='right').sum()
# a < 0 の場合 (全体から引くようにすると、見通しがよい)
count_pair += (N - np.searchsorted(A, (-c - 1) // (-negative), side='right')).sum()
# 添字の順序に制約があることを反映する
count_pair -= np.count_nonzero(A * A <= c) # 「添字が同じ要素を 2 度選んだ場合」を引く
return count_pair // 2
# 数列から要素を 2 個選んで積を取ったとき、制約からあり得る値の範囲
lower, upper = -10 ** 18, 10 ** 18
while upper - lower > 1:
x = (lower + upper) // 2
if f(x) >= K:
upper = x
else:
lower = x
return upper
print(d_pairs())
|
[
"function.return_value.change",
"call.arguments.change"
] | 571,890
| 571,891
|
u057668615
|
python
|
p02774
|
from bisect import bisect_left
def binsearch(l, r, fn):
while r - l > 1:
m = (l + r) // 2
if fn(m):
l = m
else:
r = m
return l
def main():
N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
p = bisect_left(A, 0)
An = A[:p]
Ap = A[p:]
if K <= p * (N - p):
def helper(x):
t = 0
r = 0
for p in Ap:
while t < len(An) and An[t] * p <= x:
t += 1
r += t
return r < K
l = binsearch(Ap[-1] * An[0], 1, helper)
else:
K -= p * (N - p)
An.reverse()
def helper(x):
r = 0
for a in [Ap, An]:
t = len(a) - 1
for i, p in enumerate(a):
if t <= i:
break
while t > i and a[t] * p > x:
t -= 1
r += t - i
return r < K
m = Ap[-1]
if An:
m = max(m, -An[-1])
l = binsearch(0, m * m, helper)
print(l + 1)
main()
|
from bisect import bisect_left
def binsearch(l, r, fn):
while r - l > 1:
m = (l + r) // 2
if fn(m):
l = m
else:
r = m
return l
def main():
N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
p = bisect_left(A, 0)
An = A[:p]
Ap = A[p:]
if K <= p * (N - p):
def helper(x):
t = 0
r = 0
for p in Ap:
while t < len(An) and An[t] * p <= x:
t += 1
r += t
return r < K
l = binsearch(Ap[-1] * An[0] - 1, 1, helper)
else:
K -= p * (N - p)
An.reverse()
def helper(x):
r = 0
for a in [Ap, An]:
t = len(a) - 1
for i, p in enumerate(a):
if t <= i:
break
while t > i and a[t] * p > x:
t -= 1
r += t - i
return r < K
m = Ap[-1]
if An:
m = max(m, -An[-1])
l = binsearch(-1, m * m, helper)
print(l + 1)
main()
|
[
"assignment.value.change",
"call.arguments.change",
"expression.operation.unary.add"
] | 571,915
| 571,914
|
u858742833
|
python
|
p02774
|
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def f(x):
cnt = 0
if x < 0:
j = p-1
for i in range(m)[::-1]:
while j >= 0 and plus[j]*minus[i] <= x:
j -= 1
cnt += m - j - 1
else:
j = 0
for i in range(m)[::-1]:
while j < m and minus[j]*minus[i] > x:
j += 1
cnt += max(0,i-j)
j = p-1
for i in range(p):
while j >= 0 and plus[j]*plus[i] > x:
j -= 1
cnt += max(0,j-i)
cnt += zero*(zero-1)//2 + m*p + zero*(m+p)
return cnt >= k
n,k = LI()
a = LI()
a.sort()
minus = [x for x in a if x < 0]
plus = [x for x in a if x > 0]
m,p = len(minus),len(plus)
zero = bl(a,1) - br(a,-1)
ok,ng = 10**18,-10**18-1
while ok - ng > 1:
mid = (ok+ng)//2
if f(mid):
ok = mid
else:
ng = mid
print(ok)
|
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def f(x):
cnt = 0
if x < 0:
j = p-1
for i in range(m)[::-1]:
while j >= 0 and plus[j]*minus[i] <= x:
j -= 1
cnt += p - j - 1
else:
j = 0
for i in range(m)[::-1]:
while j < m and minus[j]*minus[i] > x:
j += 1
cnt += max(0,i-j)
j = p-1
for i in range(p):
while j >= 0 and plus[j]*plus[i] > x:
j -= 1
cnt += max(0,j-i)
cnt += zero*(zero-1)//2 + m*p + zero*(m+p)
return cnt >= k
n,k = LI()
a = LI()
a.sort()
minus = [x for x in a if x < 0]
plus = [x for x in a if x > 0]
m,p = len(minus),len(plus)
zero = bl(a,1) - br(a,-1)
ok,ng = 10**18,-10**18-1
while ok - ng > 1:
mid = (ok+ng)//2
if f(mid):
ok = mid
else:
ng = mid
print(ok)
|
[
"identifier.change",
"expression.operation.binary.change"
] | 571,945
| 571,946
|
u191874006
|
python
|
p02774
|
def main():
from bisect import bisect
n,k,*a=map(int,open(0).read().split())
a.sort()
i=bisect(a,0)
a,b=a[i:],a[i-1::-1]
n,m=len(a),len(b)
ok=10**18
ng=-ok
while ok-ng>1:
x=(ok+ng)//2
s=0
if x>0:
s+=n*m
t=0
i=n
for y in a:
while i and a[i-1]*y>x:i-=1
t+=i
if y*y<=x:t-=1
s+=t//2
t=0
i=m
for y in b:
while i and b[i-1]*y>x:i-=1
t+=i
if y*y<=x:t-=1
s+=t//2
else:
i=m
for y in a:
while i and b[i-1]*y<=x:i-=1
s+=m-i
if s>=k:ok=x
else:ng=x
print(ok)
main()
|
def main():
from bisect import bisect
n,k,*a=map(int,open(0).read().split())
a.sort()
i=bisect(a,0)
a,b=a[i:],a[i-1::-1]
n,m=len(a),len(b)
ok=10**18
ng=-ok
while ok-ng>1:
x=(ok+ng)//2
s=0
if x>=0:
s+=n*m
t=0
i=n
for y in a:
while i and a[i-1]*y>x:i-=1
t+=i
if y*y<=x:t-=1
s+=t//2
t=0
i=m
for y in b:
while i and b[i-1]*y>x:i-=1
t+=i
if y*y<=x:t-=1
s+=t//2
else:
i=m
for y in a:
while i and b[i-1]*y<=x:i-=1
s+=m-i
if s>=k:ok=x
else:ng=x
print(ok)
main()
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 571,966
| 571,967
|
u729133443
|
python
|
p02774
|
from bisect import*
def solve(x):
s=t=0
i=n
j=0
for y in a:
while i and a[i-1]*y>x:i-=1
while j+1<m and b[j+1]*y<=x:j+=1
s+=j+1
t+=i
if y*y<=x:t-=1
s+=t//2
t=0
i=m
for y in c:
while i and c[i-1]*y>x:i-=1
t+=i
if y*y<=x:t-=1
s+=t//2
return s
n,k,*t=map(int,open(0).read().split())
t.sort()
i=bisect(t,0)
a,b,c=t[i:],t[:i],t[i-1::-1]
n,m=len(a),len(b)
ok=10**18
ng=-ok
while ok-ng>1:
mid=(ok+ng)//2
if solve(mid)>=k:ok=mid
else:ng=mid
print(ok)
|
from bisect import*
def solve(x):
s=t=0
i=n
j=-1
for y in a:
while i and a[i-1]*y>x:i-=1
while j+1<m and b[j+1]*y<=x:j+=1
s+=j+1
t+=i
if y*y<=x:t-=1
s+=t//2
t=0
i=m
for y in c:
while i and c[i-1]*y>x:i-=1
t+=i
if y*y<=x:t-=1
s+=t//2
return s
n,k,*t=map(int,open(0).read().split())
t.sort()
i=bisect(t,0)
a,b,c=t[i:],t[:i],t[i-1::-1]
n,m=len(a),len(b)
ok=10**18
ng=-ok
while ok-ng>1:
mid=(ok+ng)//2
if solve(mid)>=k:ok=mid
else:ng=mid
print(ok)
|
[
"assignment.value.change",
"expression.operation.unary.add"
] | 571,969
| 571,970
|
u729133443
|
python
|
p02774
|
import numpy as np
N,K = [int(i) for i in input().split()]
n = np.array([int(i) for i in input().split()])
n=np.sort(n)
mn = n[np.where(n<0)]
mz = n[np.where(n==0)]
mp = n[np.where(n>0)]
#cn = len(mn)
##cp = len(mp)
#cz = len(mz)
#tcn = cn*cp
#if cn*cp < K <= cn*cp + (N-cz)*cz + cz*(cz-1)//2:
# print(0)
# exit(0)
M = 10**18
m = -1*M-1
pos = 0
while M-m > 1:
a = 0
pos=(M+m)//2
a+=np.searchsorted(n,pos//mp,side="right").sum()
a+=len(mz)*N
a+=N*len(mn) - np.searchsorted(n,-(-pos//mn),side="left").sum()
a-=np.count_nonzero(n*n <= pos)
a=a//2
if a >= K:
M=pos
else:
m=pos
#print(M,m)
print(M)
|
import numpy as np
N,K = [int(i) for i in input().split()]
n = np.array([int(i) for i in input().split()])
n=np.sort(n)
mn = n[np.where(n<0)]
mz = n[np.where(n==0)]
mp = n[np.where(n>0)]
M = 10**18
m = -1*M-1
pos = 0
while M-m > 1:
a = 0
pos=(M+m)//2
a+=np.searchsorted(n,pos//mp,side="right").sum()
if pos >= 0: a+=len(mz)*N
a+=N*len(mn) - np.searchsorted(n,-(-pos//mn),side="left").sum()
a-=np.count_nonzero(n*n <= pos)
a=a//2
if a >= K:
M=pos
else:
m=pos
print(M)
|
[
"control_flow.branch.if.add"
] | 572,007
| 572,008
|
u295294832
|
python
|
p02774
|
import numpy as np
N,K = [int(i) for i in input().split()]
n = np.array([int(i) for i in input().split()])
n=np.sort(n)
mn = n[np.where(n<0)]
mz = n[np.where(n==0)]
mp = n[np.where(n>0)]
#cn = len(mn)
##cp = len(mp)
#cz = len(mz)
#tcn = cn*cp
#if cn*cp < K <= cn*cp + (N-cz)*cz + cz*(cz-1)//2:
# print(0)
# exit(0)
M = 10**18
m = -1*M-1
pos = 0
while M-m > 1:
a = 0
pos=(M+m)//2
a+=np.searchsorted(n,pos//mp,side="right").sum()
a+=len(mz)*N
a+=N*len(mn) - np.searchsorted(n,-(-pos//mn),side="left").sum()
a-=np.count_nonzero(n*n <= pos)
a=a//2
if a >= K:
M=pos
else:
m=pos
#print(M,m)
print(M)
|
import numpy as np
N,K = [int(i) for i in input().split()]
n = np.array([int(i) for i in input().split()])
n=np.sort(n)
mn = n[np.where(n<0)]
mz = n[np.where(n==0)]
mp = n[np.where(n>0)]
#cn = len(mn)
##cp = len(mp)
#cz = len(mz)
#tcn = cn*cp
#if cn*cp < K <= cn*cp + (N-cz)*cz + cz*(cz-1)//2:
# print(0)
# exit(0)
M = 10**18
m = -1*M-1
pos = 0
while M-m > 1:
a = 0
pos=(M+m)//2
a+=np.searchsorted(n,pos//mp,side="right").sum()
if pos >= 0: a+=len(mz)*N
a+=N*len(mn) - np.searchsorted(n,-(-pos//mn),side="left").sum()
a-=np.count_nonzero(n*n <= pos)
a=a//2
if a >= K:
M=pos
else:
m=pos
#print(M,m)
print(M)
|
[
"control_flow.branch.if.add"
] | 572,007
| 572,009
|
u295294832
|
python
|
p02774
|
import sys
from bisect import bisect_left
import numpy as np
def test(a, K):
from itertools import combinations
answer = []
for i, j in combinations(a, 2):
answer.append(i * j)
answer.sort()
print(answer[K - 1])
def main():
read = sys.stdin.read
N, K, *A = map(int, read().split())
if N <= 10:
test(A, K)
exit()
A.sort()
m = bisect_left(A, 0)
z = bisect_left(A, 1) - m
p = N - m - z
M = m * p
Z = z * (N - z) + z * (z - 1) // 2
if m > 0:
negative = np.array(A[:m], np.int64)
else:
negative = np.array([], np.int64)
if p > 0:
positive = np.array(A[-p:], np.int64)
else:
positive = np.array([], np.int64)
negative = -negative[::-1]
# 負の数の操作(pythonの挙動)は頭がこんがらがるので正の数にして考える
if K <= M:
left = 1
right = -A[0] * A[-1] + 1
while left + 1 < right:
mid = (left + right) // 2
cnt = p ** 2 - np.searchsorted(positive, (mid + negative - 1) // negative, side='left').sum()
if cnt < K:
right = mid
else:
left = mid
print(-left)
elif K <= M + Z:
print(0)
else:
K -= M + Z
left = 0
right = max(A[0] * A[1], A[-1] * A[-2])
positive2 = positive ** 2
negative2 = negative ** 2
while left + 1 < right:
mid = (left + right) // 2
a = np.searchsorted(negative, mid // negative, side='right').sum() - (mid >= negative2).sum()
b = np.searchsorted(positive, mid // positive, side='right').sum() - (mid >= positive2).sum()
if (a + b) // 2 < K:
left = mid
else:
right = mid
print(right)
if __name__ == '__main__':
main()
|
import sys
from bisect import bisect_left
import numpy as np
def test(a, K):
from itertools import combinations
answer = []
for i, j in combinations(a, 2):
answer.append(i * j)
answer.sort()
print(answer[K - 1])
def main():
read = sys.stdin.read
N, K, *A = map(int, read().split())
if N <= 10:
test(A, K)
exit()
A.sort()
m = bisect_left(A, 0)
z = bisect_left(A, 1) - m
p = N - m - z
M = m * p
Z = z * (N - z) + z * (z - 1) // 2
if m > 0:
negative = np.array(A[:m], np.int64)
else:
negative = np.array([], np.int64)
if p > 0:
positive = np.array(A[-p:], np.int64)
else:
positive = np.array([], np.int64)
negative = -negative[::-1]
# 負の数の操作(pythonの挙動)は頭がこんがらがるので正の数にして考える
if K <= M:
left = 1
right = -A[0] * A[-1] + 1
while left + 1 < right:
mid = (left + right) // 2
cnt = (p - np.searchsorted(positive, (mid + negative - 1) // negative, side='left')).sum()
if cnt < K:
right = mid
else:
left = mid
print(-left)
elif K <= M + Z:
print(0)
else:
K -= M + Z
left = 0
right = max(A[0] * A[1], A[-1] * A[-2])
positive2 = positive ** 2
negative2 = negative ** 2
while left + 1 < right:
mid = (left + right) // 2
a = np.searchsorted(negative, mid // negative, side='right').sum() - (mid >= negative2).sum()
b = np.searchsorted(positive, mid // positive, side='right').sum() - (mid >= positive2).sum()
if (a + b) // 2 < K:
left = mid
else:
right = mid
print(right)
if __name__ == '__main__':
main()
|
[
"expression.operation.binary.remove"
] | 572,025
| 572,026
|
u945181840
|
python
|
p02774
|
import numpy as np
n, k = map(int, input().split())
num_list = [int(i) for i in input().split()]
num_list = np.array(num_list)
num_list.sort()
neg = num_list[num_list < 0]
pos = num_list[num_list > 0]
zero = num_list[num_list == 0]
def count(x):
ans = 0
if x >= 0:
ans += len(zero) * n
ans += np.searchsorted(num_list, x // pos, side="right").sum()
ans += n * len(neg) - np.searchsorted(num_list, -(-x // neg), side="right").sum()
ans -= np.count_nonzero(num_list * num_list <= x)
return ans // 2
left = -(10 ** 18)
right = 10 ** 18
while left + 1 < right:
mid = (left + right) // 2
if count(mid) >= k:
right = mid
else:
left = mid
print(right)
|
import numpy as np
n, k = map(int, input().split())
num_list = [int(i) for i in input().split()]
num_list = np.array(num_list)
num_list.sort()
neg = num_list[num_list < 0]
pos = num_list[num_list > 0]
zero = num_list[num_list == 0]
def count(x):
ans = 0
if x >= 0:
ans += len(zero) * n
ans += np.searchsorted(num_list, x // pos, side="right").sum()
ans += n * len(neg) - np.searchsorted(num_list, -(-x // neg), side="left").sum()
ans -= np.count_nonzero(num_list * num_list <= x)
return ans // 2
left = -(10 ** 18)
right = 10 ** 18
while left + 1 < right:
mid = (left + right) // 2
if count(mid) >= k:
right = mid
else:
left = mid
print(right)
|
[
"literal.string.change",
"call.arguments.change",
"expression.operation.binary.change",
"call.arguments.keyword_argument.change"
] | 572,107
| 572,108
|
u878239774
|
python
|
p02774
|
import sys
input = sys.stdin.readline
import numpy as np
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
A_m = np.array(sorted([abs(int(x)) for x in A if x < 0]), np.int64)
N_m = len(A_m)
A_p = np.array(sorted([int(x) for x in A if x > 0]), np.int64)
N_p = len(A_p)
M = N_m * N_p
P = (1 / 2) * (N_m) * (N_m - 1) + (1 / 2) * (N_p) * (N_p - 1)
Z = (1 / 2) * N * (N - 1) - (M + P)
if M < K <= M + Z:
print(0)
sys.exit()
def cnt_M(x):
cnt = np.searchsorted(A_m, x / A_p, side="right").sum()
return cnt >= M - K + 1
if K <= M:
left = -1 -10 ** 18
right = 1 + 10 ** 18
while right - left> 1:
mid = (left + right) // 2
if cnt_M(mid):
right = mid
else:
left = mid
print(-right)
sys.exit()
K -= (M + Z)
def cnt_P(x):
cnt = 0
ng = 0
cnt += np.searchsorted(A_m, x / A_m, side="right").sum()
cnt += np.searchsorted(A_p, x / A_p, side="right").sum()
ng = np.count_nonzero(A_m * A_m <= x) + np.count_nonzero(A_p * A_p <= x)
cnt = (cnt - ng) // 2
return cnt >= K
left = -1 - 10 ** 18
right = 1 + 10 ** 18
while right - left > 1:
mid = (left + right) // 2
if cnt_P(mid):
right = mid
else:
left = mid
print(right)
|
import sys
input = sys.stdin.readline
import numpy as np
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
A_m = np.array(sorted([abs(int(x)) for x in A if x < 0]), np.int64)
N_m = len(A_m)
A_p = np.array(sorted([int(x) for x in A if x > 0]), np.int64)
N_p = len(A_p)
M = N_m * N_p
P = (1 / 2) * (N_m) * (N_m - 1) + (1 / 2) * (N_p) * (N_p - 1)
Z = (1 / 2) * N * (N - 1) - (M + P)
if M < K <= M + Z:
print(0)
sys.exit()
def cnt_M(x):
cnt = np.searchsorted(A_m, x // A_p, side="right").sum()
return cnt >= M - K + 1
if K <= M:
left = -1 -10 ** 18
right = 1 + 10 ** 18
while right - left> 1:
mid = (left + right) // 2
if cnt_M(mid):
right = mid
else:
left = mid
print(-right)
sys.exit()
K -= (M + Z)
def cnt_P(x):
cnt = 0
ng = 0
cnt += np.searchsorted(A_m, x // A_m, side="right").sum()
cnt += np.searchsorted(A_p, x // A_p, side="right").sum()
ng = np.count_nonzero(A_m * A_m <= x) + np.count_nonzero(A_p * A_p <= x)
cnt = (cnt - ng) // 2
return cnt >= K
left = -1 - 10 ** 18
right = 1 + 10 ** 18
while right - left > 1:
mid = (left + right) // 2
if cnt_P(mid):
right = mid
else:
left = mid
print(right)
|
[
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 572,248
| 572,249
|
u609061751
|
python
|
p02774
|
import sys
input=sys.stdin.readline
n,k=map(int,input().split())
a=list(map(int,input().split()))
ap,an=[],[]
zeronum=0
for i in range(n):
if a[i]>0:
ap.append(a[i])
elif a[i]<0:
an.append(-a[i])
else:
zeronum+=1
np,nn=len(ap),len(an)
def fminus(x):
j=0
cnt=0
for i in range(np):
cnt+=j
while j<np and an[j]*ap[i]>=x:
j+=1
cnt+=1
return cnt
def fplus(x,length,lis):
r=length-1
cnt=0
for l in range(length):
while lis[r]*lis[l]>x:
if r==l:
break
r-=1
if r==l:
break
elif lis[r]*lis[l]<=x:
cnt+=r-l
return cnt
if np*nn<k<=np*nn+zeronum*(zeronum-1)//2+zeronum*(np+nn):
print(0)
else:
#print(ap)
#print(an)
if k<=np*nn:
an.sort(reverse=True)
ap.sort()
ng=10**18
ok=0
while ng-ok>1:
mid=(ok+ng)//2
if fminus(mid)>=k:
ok=mid
else:
ng=mid
print(-ok)
else:
an.sort()
ap.sort()
k-=np*nn+zeronum*(zeronum-1)//2+zeronum*(np+nn)
#print(k)
ok=10**18
ng=0
#print(ok,ng)
while ok-ng>1:
mid=(ok+ng)//2
if fplus(mid,nn,an)+fplus(mid,np,ap)>=k:
ok=mid
else:
ng=mid
print(ok)
|
import sys
input=sys.stdin.readline
n,k=map(int,input().split())
a=list(map(int,input().split()))
ap,an=[],[]
zeronum=0
for i in range(n):
if a[i]>0:
ap.append(a[i])
elif a[i]<0:
an.append(-a[i])
else:
zeronum+=1
np,nn=len(ap),len(an)
def fminus(x):
j=0
cnt=0
for i in range(np):
cnt+=j
while j<nn and an[j]*ap[i]>=x:
j+=1
cnt+=1
return cnt
def fplus(x,length,lis):
r=length-1
cnt=0
for l in range(length):
while lis[r]*lis[l]>x:
if r==l:
break
r-=1
if r==l:
break
elif lis[r]*lis[l]<=x:
cnt+=r-l
return cnt
if np*nn<k<=np*nn+zeronum*(zeronum-1)//2+zeronum*(np+nn):
print(0)
else:
#print(ap)
#print(an)
if k<=np*nn:
an.sort(reverse=True)
ap.sort()
ng=10**18
ok=0
while ng-ok>1:
mid=(ok+ng)//2
if fminus(mid)>=k:
ok=mid
else:
ng=mid
print(-ok)
else:
an.sort()
ap.sort()
k-=np*nn+zeronum*(zeronum-1)//2+zeronum*(np+nn)
#print(k)
ok=10**18
ng=0
#print(ok,ng)
while ok-ng>1:
mid=(ok+ng)//2
if fplus(mid,nn,an)+fplus(mid,np,ap)>=k:
ok=mid
else:
ng=mid
print(ok)
|
[
"identifier.change",
"control_flow.loop.condition.change"
] | 572,250
| 572,251
|
u169138653
|
python
|
p02774
|
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n,k = map(int, input().split())
a = list(map(int, input().split()))
ma = []
pa = []
zc = 0
for num in a:
if num<0:
ma.append(num)
elif num>0:
pa.append(num)
else:
zc += 1
mn = len(ma)*len(pa)
ma.sort()
pa.sort()
ma =ma[::-1]
def _sub(m, l1):
lp = len(l1)
t = lp-1
ans = 0
for s in range(lp):
if t<=s:
break
while l1[s]*l1[t]>m and t>s+1:
t -= 1
if l1[s]*l1[t]>m:
break
ans += (t-s)
return ans
def sub1(m):
# 0以上m以下の値の個数
ans = 0
ans += _sub(m, pa)
ans += _sub(m, ma)
return ans
def sub2(m):
# 0以下、m以下の値の個数
ans = 0
lp = len(pa)
lm = len(ma)
t = 0
for s in range(lp):
while pa[s]*ma[t]>m and t<lm-1:
t += 1
if pa[s]*ma[t]>m:
break
ans += lm - t
return ans
znum = zc*(len(ma)+len(pa)) + (zc-1)*zc//2
if k>mn:
k -= mn
if znum>=k:
ans = 0
else:
k -= znum
l = 0
r = 10**18+1
while l<r-1:
m = (l+r)//2
v = sub1(m)
if v>=k:
r = m
else:
l = m
ans = l+1
else:
l = -10**18-1
r = 0
while l<r-1:
m = (l+r)//2
v = sub2(m)
if v>=k:
r = m
else:
l = m
ans = l+1
print(ans)
|
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n,k = map(int, input().split())
a = list(map(int, input().split()))
ma = []
pa = []
zc = 0
for num in a:
if num<0:
ma.append(num)
elif num>0:
pa.append(num)
else:
zc += 1
mn = len(ma)*len(pa)
ma.sort()
pa.sort()
ma =ma[::-1]
def _sub(m, l1):
lp = len(l1)
t = lp-1
ans = 0
for s in range(lp):
if t<=s:
break
while l1[s]*l1[t]>m and t>s+1:
t -= 1
if l1[s]*l1[t]>m:
break
ans += (t-s)
return ans
def sub1(m):
# 0以上m以下の値の個数
ans = 0
ans += _sub(m, pa)
ans += _sub(m, ma)
return ans
def sub2(m):
# 0以下、m以下の値の個数
ans = 0
lp = len(pa)
lm = len(ma)
t = 0
for s in reversed(range(lp)):
while pa[s]*ma[t]>m and t<lm-1:
t += 1
if pa[s]*ma[t]>m:
break
ans += lm - t
return ans
znum = zc*(len(ma)+len(pa)) + (zc-1)*zc//2
if k>mn:
k -= mn
if znum>=k:
ans = 0
else:
k -= znum
l = 0
r = 10**18+1
while l<r-1:
m = (l+r)//2
v = sub1(m)
if v>=k:
r = m
else:
l = m
ans = l+1
else:
l = -10**18-1
r = 0
while l<r-1:
m = (l+r)//2
v = sub2(m)
if v>=k:
r = m
else:
l = m
ans = l+1
print(ans)
|
[
"call.add",
"call.arguments.change"
] | 572,255
| 572,256
|
u535803878
|
python
|
p02774
|
from bisect import *
n, k = map(int, input().split())
a = list(map(int, input().split()))
posi = 0
nega = 0
zero = 0
p = []
m = []
for i in range(n):
if a[i] > 0:
p.append(a[i])
posi += 1
elif a[i] < 0:
nega += 1
m.append(-a[i])
else:
zero += 1
p.sort()
m.sort()
if k <= posi*nega:
l = 0
r = 10**18
while r - l > 1:
mid = l+(r-l)//2
count = k
for i in range(len(p)-1, -1, -1):
count -= posi-bisect_left(m, (mid-1)//p[i]+1)
if count <= 0:
break
if count <= 0:
l = mid
else:
r = mid
#print(r, l)
print(-l)
elif k <= posi*nega+zero*(zero-1)//2+zero*(posi+nega):
print(0)
else:
o
k -= posi*nega+zero*(zero-1)//2+zero*(posi+nega)
l = 0
r = 10**18
while r - l > 1:
mid = l+(r-l)//2
count = k
for i in range(len(p)):
count -= max(bisect_right(p, (mid)//p[i])-i-1, 0)
if count < 0:
#continue
break
for i in range(len(m)):
count -= max(bisect_right(m, (mid)//m[i])-i-1, 0)
if count < 0:
#continue
break
if count > 0:
l = mid
else:
r = mid
print(r)
|
from bisect import *
n, k = map(int, input().split())
a = list(map(int, input().split()))
posi = 0
nega = 0
zero = 0
p = []
m = []
for i in range(n):
if a[i] > 0:
p.append(a[i])
posi += 1
elif a[i] < 0:
nega += 1
m.append(-a[i])
else:
zero += 1
p.sort()
m.sort()
if k <= posi*nega:
l = 0
r = 10**18
while r - l > 1:
mid = l+(r-l)//2
count = k
for i in range(len(p)-1, -1, -1):
count -= nega-bisect_left(m, (mid-1)//p[i]+1)
if count <= 0:
break
if count <= 0:
l = mid
else:
r = mid
#print(r, l)
print(-l)
elif k <= posi*nega+zero*(zero-1)//2+zero*(posi+nega):
print(0)
else:
k -= posi*nega+zero*(zero-1)//2+zero*(posi+nega)
l = 0
r = 10**18
while r - l > 1:
mid = l+(r-l)//2
count = k
for i in range(len(p)):
count -= max(bisect_right(p, (mid)//p[i])-i-1, 0)
if count < 0:
#continue
break
for i in range(len(m)):
count -= max(bisect_right(m, (mid)//m[i])-i-1, 0)
if count < 0:
#continue
break
if count > 0:
l = mid
else:
r = mid
print(r)
|
[
"identifier.change",
"expression.operation.binary.change"
] | 572,296
| 572,297
|
u426108351
|
python
|
p02774
|
from bisect import *
n, k = map(int, input().split())
a = list(map(int, input().split()))
posi = 0
nega = 0
zero = 0
p = []
m = []
for i in range(n):
if a[i] > 0:
p.append(a[i])
posi += 1
elif a[i] < 0:
nega += 1
m.append(-a[i])
else:
zero += 1
p.sort()
m.sort()
if k <= posi*nega:
l = 0
r = 10**18
while r - l > 1:
mid = l+(r-l)//2
count = k
for i in range(len(p)-1, -1, -1):
count -= posi-bisect_left(m, (mid-1)//p[i]+1)
if count <= 0:
break
if count <= 0:
l = mid
else:
r = mid
#print(r, l)
print(-l)
elif k <= posi*nega+zero*(zero-1)//2+zero*(posi+nega):
print(0)
else:
k -= posi*nega+zero*(zero-1)//2+zero*(posi+nega)
l = 0
r = 10**18
while r - l > 1:
mid = l+(r-l)//2
count = k
for i in range(len(p)):
count -= max(bisect_right(p, (mid)//p[i])-i-1, 0)
if count < 0:
#continue
break
for i in range(len(m)):
count -= max(bisect_right(m, (mid)//m[i])-i-1, 0)
if count < 0:
#continue
break
if count > 0:
l = mid
else:
r = mid
print(r)
|
from bisect import *
n, k = map(int, input().split())
a = list(map(int, input().split()))
posi = 0
nega = 0
zero = 0
p = []
m = []
for i in range(n):
if a[i] > 0:
p.append(a[i])
posi += 1
elif a[i] < 0:
nega += 1
m.append(-a[i])
else:
zero += 1
p.sort()
m.sort()
if k <= posi*nega:
l = 0
r = 10**18
while r - l > 1:
mid = l+(r-l)//2
count = k
for i in range(len(p)-1, -1, -1):
count -= nega-bisect_left(m, (mid-1)//p[i]+1)
if count <= 0:
break
if count <= 0:
l = mid
else:
r = mid
#print(r, l)
print(-l)
elif k <= posi*nega+zero*(zero-1)//2+zero*(posi+nega):
print(0)
else:
k -= posi*nega+zero*(zero-1)//2+zero*(posi+nega)
l = 0
r = 10**18
while r - l > 1:
mid = l+(r-l)//2
count = k
for i in range(len(p)):
count -= max(bisect_right(p, (mid)//p[i])-i-1, 0)
if count < 0:
#continue
break
for i in range(len(m)):
count -= max(bisect_right(m, (mid)//m[i])-i-1, 0)
if count < 0:
#continue
break
if count > 0:
l = mid
else:
r = mid
print(r)
|
[
"identifier.change",
"expression.operation.binary.change"
] | 572,301
| 572,297
|
u426108351
|
python
|
p02774
|
from bisect import *
n, k = map(int, input().split())
a = list(map(int, input().split()))
posi = 0
nega = 0
zero = 0
p = []
m = []
for i in range(n):
if a[i] > 0:
p.append(a[i])
posi += 1
elif a[i] < 0:
nega += 1
m.append(-a[i])
else:
zero += 1
p.sort()
m.sort()
if k <= posi*nega:
l = 0
r = 10**18
while r - l > 1:
mid = l+(r-l)//2
count = k
for i in range(len(p)-1, -1, -1):
count -= posi-bisect_left(m, (mid-1)//p[i]+1)
if count <= 0:
break
if count <= 0:
l = mid
else:
r = mid
#print(r, l)
print(l)
elif k <= posi*nega+zero*(zero-1)//2+zero*(posi+nega):
print(0)
else:
k -= posi*nega+zero*(zero-1)//2+zero*(posi+nega)
l = 0
r = 10**18
while r - l > 1:
mid = l+(r-l)//2
count = k
for i in range(len(p)):
count -= max(bisect_right(p, (mid)//p[i])-i-1, 0)
if count < 0:
#continue
break
for i in range(len(m)):
count -= max(bisect_right(m, (mid)//m[i])-i-1, 0)
if count < 0:
#continue
break
if count > 0:
l = mid
else:
r = mid
print(r)
|
from bisect import *
n, k = map(int, input().split())
a = list(map(int, input().split()))
posi = 0
nega = 0
zero = 0
p = []
m = []
for i in range(n):
if a[i] > 0:
p.append(a[i])
posi += 1
elif a[i] < 0:
nega += 1
m.append(-a[i])
else:
zero += 1
p.sort()
m.sort()
if k <= posi*nega:
l = 0
r = 10**18
while r - l > 1:
mid = l+(r-l)//2
count = k
for i in range(len(p)-1, -1, -1):
count -= nega-bisect_left(m, (mid-1)//p[i]+1)
if count <= 0:
break
if count <= 0:
l = mid
else:
r = mid
#print(r, l)
print(-l)
elif k <= posi*nega+zero*(zero-1)//2+zero*(posi+nega):
print(0)
else:
k -= posi*nega+zero*(zero-1)//2+zero*(posi+nega)
l = 0
r = 10**18
while r - l > 1:
mid = l+(r-l)//2
count = k
for i in range(len(p)):
count -= max(bisect_right(p, (mid)//p[i])-i-1, 0)
if count < 0:
#continue
break
for i in range(len(m)):
count -= max(bisect_right(m, (mid)//m[i])-i-1, 0)
if count < 0:
#continue
break
if count > 0:
l = mid
else:
r = mid
print(r)
|
[
"identifier.change",
"expression.operation.binary.change",
"expression.operation.unary.add",
"call.arguments.change"
] | 572,303
| 572,297
|
u426108351
|
python
|
p02774
|
def main():
import sys
from bisect import bisect_left
input = sys.stdin.readline
N, K = map(int, input().split())
A = list(map(int, input().split()))
minus = []
plus = []
zero = 0
for a in A:
if a > 0:
plus.append(a)
elif a < 0:
minus.append(-a)
else:
zero += 1
plus.sort()
minus.sort()
plus_num = len(plus)
minus_num = len(minus)
if plus_num * minus_num < K <= (N*(N-1))//2 - (plus_num*(plus_num-1))//2 - (minus_num*(minus_num-1))//2:
print(0)
exit()
if plus_num * minus_num >= K:
ng = 0
ok = -10**18-1
mid = (ng+ok)//2
while ng - ok > 1:
cnt = 0
j = 0
for a in minus:
while True:
if j == plus_num:
break
if a * plus[j] < -mid:
#print(a, plus[j])
j += 1
else:
break
cnt += plus_num - j
if cnt < K:
ok = mid
else:
ng = mid
mid = (ok+ng)//2
print(ng)
else:
K -= (N*(N-1))//2 - (plus_num*(plus_num-1))//2 - (minus_num*(minus_num-1))//2
ng = 10**18+1
ok = 0
mid = (ok+ng)//2
while ng - ok > 1:
cnt = 0
j = plus_num-1
for a in plus:
while True:
if j == -1:
break
if a * plus[j] > mid:
j -= 1
else:
break
cnt += j+1
for a in plus:
if a**2 <= mid:
cnt -= 1
else:
break
j = minus_num-1
for a in minus:
while True:
if j == -1:
break
if a * minus[j] > mid:
j -= 1
else:
break
cnt += j+1
for a in minus:
if a**2 <= mid:
cnt -= 1
else:
break
#print(cnt)
assert cnt%2 == 0
cnt //= 2
if cnt < K:
ok = mid
else:
ng = mid
mid = (ok+ng)//2
print(ng)
if __name__ == '__main__':
main()
|
def main():
import sys
from bisect import bisect_left
input = sys.stdin.readline
N, K = map(int, input().split())
A = list(map(int, input().split()))
minus = []
plus = []
zero = 0
for a in A:
if a > 0:
plus.append(a)
elif a < 0:
minus.append(-a)
else:
zero += 1
plus.sort()
minus.sort()
plus_num = len(plus)
minus_num = len(minus)
if plus_num * minus_num < K <= (N*(N-1))//2 - (plus_num*(plus_num-1))//2 - (minus_num*(minus_num-1))//2:
print(0)
exit()
if plus_num * minus_num >= K:
ng = 0
ok = -10**18-1
mid = (ng+ok)//2
while ng - ok > 1:
cnt = 0
j = 0
for a in reversed(minus):
while True:
if j == plus_num:
break
if a * plus[j] < -mid:
j += 1
else:
break
#print(mid, a, j)
cnt += plus_num - j
#print(mid, cnt)
if cnt < K:
ok = mid
else:
ng = mid
mid = (ok+ng)//2
print(ng)
else:
K -= (N*(N-1))//2 - (plus_num*(plus_num-1))//2 - (minus_num*(minus_num-1))//2
ng = 10**18+1
ok = 0
mid = (ok+ng)//2
while ng - ok > 1:
cnt = 0
j = plus_num-1
for a in plus:
while True:
if j == -1:
break
if a * plus[j] > mid:
j -= 1
else:
break
cnt += j+1
for a in plus:
if a**2 <= mid:
cnt -= 1
else:
break
j = minus_num-1
for a in minus:
while True:
if j == -1:
break
if a * minus[j] > mid:
j -= 1
else:
break
cnt += j+1
for a in minus:
if a**2 <= mid:
cnt -= 1
else:
break
#print(cnt)
assert cnt%2 == 0
cnt //= 2
if cnt < K:
ok = mid
else:
ng = mid
mid = (ok+ng)//2
print(ng)
if __name__ == '__main__':
main()
|
[
"call.add",
"call.arguments.change"
] | 572,306
| 572,307
|
u892251744
|
python
|
p02774
|
#https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155
import numpy as np
N,K=map(int,input().split())
A=np.array(list(map(int,input().split())))
A.sort()
G=A[A>0]
Z=A[A==0]
L=A[A<0]
ok=10**18+1
ng=-10**18-1
#x以下がK個以上であるxの最小値
while ok-ng>1:
mid = (ng+ok)//2
#mid以下のペアの個数を数える
#正のもののうち、mid以下のペアの個数を数える
cg=np.searchsorted(A,mid//G,side="right").sum()
#負のもののうちmid以下のペアの個数を数える
cl=(N-np.searchsorted(A,(-mid-1)//(-L),side="right")).sum()
#同じ数字同士の積がmid以下のものを数える
d = np.count_nonzero(A*A <= mid)
#0がmid以下なら、それもプラスするために必要
if mid<=0:
z=len(Z)*N
c=cg+cl+z-d
#二重になっているので、割る
c //=2
#mid以下のペアの個数がK個以上のとき
if c>=K:
ok=mid
else:
ng=mid
print(ok)
|
#https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155
import numpy as np
N,K=map(int,input().split())
A=np.array(list(map(int,input().split())))
A.sort()
G=A[A>0]
Z=A[A==0]
L=A[A<0]
ok=10**18+1
ng=-10**18-1
#x以下がK個以上であるxの最小値
while ok-ng>1:
mid = (ng+ok)//2
#mid以下のペアの個数を数える
#正のもののうち、mid以下のペアの個数を数える
cg=np.searchsorted(A,mid//G,side="right").sum()
#負のもののうちmid以下のペアの個数を数える
cl=(N-np.searchsorted(A,(-mid-1)//(-L),side="right")).sum()
#同じ数字同士の積がmid以下のものを数える
d = np.count_nonzero(A*A <= mid)
#0がmid以下なら、それもプラスするために必要
z=0
if mid>=0:
z += len(Z)*N
c=cg+cl+z-d
#二重になっているので、割る
c //=2
#mid以下のペアの個数がK個以上のとき
if c>=K:
ok=mid
else:
ng=mid
print(ok)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 572,308
| 572,309
|
u721407235
|
python
|
p02774
|
#https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155
import numpy as np
N,K=map(int,input().split())
A=np.array(list(map(int,input().split())))
A.sort()
G=A[A>0]
Z=A[A==0]
L=A[A<0]
ok=10**18+1
ng=-10**18-1
#x以下がK個以上であるxの最小値
while ok-ng>1:
mid = (ng+ok)//2
#mid以下のペアの個数を数える
#正のもののうち、mid以下のペアの個数を数える
cg=np.searchsorted(A,mid//G,side="right").sum()
#負のもののうちmid以下のペアの個数を数える
cl=(N-np.searchsorted(A,(-mid-1)//(-L),side="right")).sum()
#同じ数字同士の積がmid以下のものを数える
d = np.count_nonzero(A*A <= mid)
#0がmid以下なら、それもプラスするために必要
if mid<=0:
z=len(Z)*N
c=cg+cl+z-d
#二重になっているので、割る
c //=2
#mid以下のペアの個数がK個以上のとき
if c>=K:
ok=mid
else:
ng=mid
print(ok)
|
#https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155
import numpy as np
N,K=map(int,input().split())
A=np.array(list(map(int,input().split())))
A.sort()
G=A[A>0]
Z=A[A==0]
L=A[A<0]
ok=10**18+1
ng=-10**18-1
#x以下がK個以上であるxの最小値
while ok-ng>1:
mid = (ng+ok)//2
#mid以下のペアの個数を数える
#正のもののうち、mid以下のペアの個数を数える
cg=np.searchsorted(A,mid//G,side="right").sum()
#負のもののうちmid以下のペアの個数を数える
cl=(N-np.searchsorted(A,(-mid-1)//(-L),side="right")).sum()
#同じ数字同士の積がmid以下のものを数える
d = np.count_nonzero(A*A <= mid)
#0がmid以下なら、それもプラスするために必要
z=0
if mid>=0:
z += len(Z)*N
c=cg+cl+z-d
#二重になっているので、割る
c //=2
#mid以下のペアの個数がK個以上のとき
if c>=K:
ok=mid
else:
ng=mid
print(ok)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 572,310
| 572,309
|
u721407235
|
python
|
p02774
|
#https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155
import numpy as np
N,K=map(int,input().split())
A=np.array(list(map(int,input().split())))
A.sort()
G=A[A>0]
Z=A[A==0]
L=A[A<0]
ok=10**18+1
ng=-10**18-1
#x以下がK個以上であるxの最小値
while ok-ng>1:
mid = (ng+ok)//2
#mid以下のペアの個数を数える
#正のもののうち、mid以下のペアの個数を数える
cg=np.searchsorted(A,mid//G,side="right").sum()
#負のもののうちmid以下のペアの個数を数える
cl=(N-np.searchsorted(A,(-mid-1)//(-L),side="right")).sum()
#同じ数字同士の積がmid以下のものを数える
d = np.count_nonzero(A*A <= mid)
#0がmid以下なら、それもプラスするために必要
z=0
if mid<=0:
z+=len(Z)*N
c=cg+cl+z-d
#二重になっているので、割る
c //=2
#mid以下のペアの個数がK個以上のとき
if c>=K:
ok=mid
else:
ng=mid
print(ok)
|
#https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155
import numpy as np
N,K=map(int,input().split())
A=np.array(list(map(int,input().split())))
A.sort()
G=A[A>0]
Z=A[A==0]
L=A[A<0]
ok=10**18+1
ng=-10**18-1
#x以下がK個以上であるxの最小値
while ok-ng>1:
mid = (ng+ok)//2
#mid以下のペアの個数を数える
#正のもののうち、mid以下のペアの個数を数える
cg=np.searchsorted(A,mid//G,side="right").sum()
#負のもののうちmid以下のペアの個数を数える
cl=(N-np.searchsorted(A,(-mid-1)//(-L),side="right")).sum()
#同じ数字同士の積がmid以下のものを数える
d = np.count_nonzero(A*A <= mid)
#0がmid以下なら、それもプラスするために必要
z=0
if mid>=0:
z += len(Z)*N
c=cg+cl+z-d
#二重になっているので、割る
c //=2
#mid以下のペアの個数がK個以上のとき
if c>=K:
ok=mid
else:
ng=mid
print(ok)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 572,311
| 572,309
|
u721407235
|
python
|
p02774
|
import bisect
n, k = map(int, input().split())
a = list(map(int, input().split()))
negative_number_cnt = 0
positive_number_cnt = 0
negative_number = []
positive_number = []
zero_cnt = 0
a.sort()
def binary_search(left, right,positive):
if right - left <= 1:
return right
middle = (right + left) // 2
if is_can(middle,positive):
return binary_search(left, middle,positive)
else:
return binary_search(middle, right,positive)
def is_can(x,positive):
#xよりも小さい値がk個あるかどうか？
if positive:
count = than_less_zero
#正＊正
r = len(positive_number)-1
for l in range(len(positive_number)):
while l < r and positive_number[l] * positive_number[r] > x:
r -= 1
count += r - l
if l >= r:
break
#負*負
r = len(negative_number)-1
for l in range(len(negative_number)):
while l < r and r_negative_number[l] * r_negative_number[r] > x:
r -= 1
count += r - l
if l >= r:
break
#print("target:{} count:{}".format(x,count))
if count >= k:
return True
else:
return False
else:
count = 0
l,r = 0,0
for l in range(len(negative_number)):
while r < len(positive_number) and positive_number[r] * negative_number[l] > x:
r += 1
count += len(positive_number) - r
if count >= k:
return True
else:
return False
for i in range(n):
if a[i] > 0:
positive_number_cnt += 1
positive_number.append(a[i])
elif a[i] < 0:
negative_number_cnt += 1
negative_number.append(a[i])
else:
zero_cnt += 1
than_less_zero = ( negative_number_cnt * positive_number_cnt ) + (zero_cnt * (zero_cnt-1)//2) + zero_cnt * (n-zero_cnt)
r_negative_number = [negative_number[i] for i in range(len(negative_number)-1,-1,-1)]
if than_less_zero < k:
#答えが正になる
print(binary_search(0,10**20,True))
elif ( negative_number_cnt * positive_number_cnt ) < k:
#答えが0になる
print(0)
else:
#答えが負になる
print(binary_search((-10)*20,5,False))
|
import bisect
n, k = map(int, input().split())
a = list(map(int, input().split()))
negative_number_cnt = 0
positive_number_cnt = 0
negative_number = []
positive_number = []
zero_cnt = 0
a.sort()
def binary_search(left, right,positive):
if right - left <= 1:
return right
middle = (right + left) // 2
if is_can(middle,positive):
return binary_search(left, middle,positive)
else:
return binary_search(middle, right,positive)
def is_can(x,positive):
#xよりも小さい値がk個あるかどうか？
if positive:
count = than_less_zero
#正＊正
r = len(positive_number)-1
for l in range(len(positive_number)):
while l < r and positive_number[l] * positive_number[r] > x:
r -= 1
count += r - l
if l >= r:
break
#負*負
r = len(negative_number)-1
for l in range(len(negative_number)):
while l < r and r_negative_number[l] * r_negative_number[r] > x:
r -= 1
count += r - l
if l >= r:
break
#print("target:{} count:{}".format(x,count))
if count >= k:
return True
else:
return False
else:
count = 0
l,r = 0,0
for l in range(len(negative_number)):
while r < len(positive_number) and positive_number[r] * negative_number[l] > x:
r += 1
count += len(positive_number) - r
if count >= k:
return True
else:
return False
for i in range(n):
if a[i] > 0:
positive_number_cnt += 1
positive_number.append(a[i])
elif a[i] < 0:
negative_number_cnt += 1
negative_number.append(a[i])
else:
zero_cnt += 1
than_less_zero = ( negative_number_cnt * positive_number_cnt ) + (zero_cnt * (zero_cnt-1)//2) + zero_cnt * (n-zero_cnt)
r_negative_number = [negative_number[i] for i in range(len(negative_number)-1,-1,-1)]
if than_less_zero < k:
#答えが正になる
print(binary_search(0,10**20,True))
elif ( negative_number_cnt * positive_number_cnt ) < k:
#答えが0になる
print(0)
else:
#答えが負になる
print(binary_search(-10**20,5,False))
|
[
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 572,319
| 572,320
|
u691896522
|
python
|
p02774
|
def General_Binary_Increase_Search(L,R,cond,Integer=True,ep=1/(1<<20)):
"""条件式が単調増加であるとき,一般的な二部探索を行う.
L:解の下限
R:解の上限
cond:条件(1変数関数,広義単調減少 or 広義単調減少を満たす)
Integer:解を整数に制限するか?
ep:Integer=Falseのとき,解の許容する誤差
"""
if not(cond(R)):
return False
if Integer:
R+=1
while R-L>1:
C=L+(R-L)//2
if cond(C):
R=C
else:
L=C
return R
else:
while (R-L)>=ep:
C=L+(R-L)/2
if cond(C):
R=C
else:
L=C
return R
def f(R):
I=0
S=0
for a in Pos:
if I<Negative:
while a*Neg[I]<=R:
I+=1
if I==Negative:
break
S+=I
return S
def g(R):
S=0
I=Positive
for a in Pos:
if I>0:
while a*Pos[I-1]>R:
I-=1
if I==0:
break
S+=I
if a*a<=R:
S-=1
J=0
for b in Neg:
if J<Negative:
while b*Neg[-(J+1)]<=R:
J+=1
if J==Negative:
break
S+=J
if b*b<=R:
S-=1
return S>>1
#================================================
N,K=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
Pos=[a for a in A if a>0]
Neg=[a for a in A if a<0]
Positive=Zero=Negative=0
for a in A:
if a>0:
Positive+=1
elif a==0:
Zero+=1
else:
Negative+=1
Pos_Count=(Positive*(Positive-1))//2+(Negative*(Negative-1))//2
Neg_Count=Positive*Negative
Zero_Count=(N*(N-1))//2-(Pos_Count+Neg_Count)
H=max(A,key=lambda a:abs(a))
H=H*H+1
if Neg_Count+1<=K<=Zero: #ゼロ確定
Ans=0
elif K<=Neg_Count: #負確定
Ans=General_Binary_Increase_Search(-H,0,lambda x:f(x)>=K)
else: #正確定
Ans=General_Binary_Increase_Search(0,H,lambda x:g(x)>=K-(Neg_Count+Zero_Count))
print(Ans)
|
def General_Binary_Increase_Search(L,R,cond,Integer=True,ep=1/(1<<20)):
"""条件式が単調増加であるとき,一般的な二部探索を行う.
L:解の下限
R:解の上限
cond:条件(1変数関数,広義単調減少 or 広義単調減少を満たす)
Integer:解を整数に制限するか?
ep:Integer=Falseのとき,解の許容する誤差
"""
if not(cond(R)):
return False
if Integer:
R+=1
while R-L>1:
C=L+(R-L)//2
if cond(C):
R=C
else:
L=C
return R
else:
while (R-L)>=ep:
C=L+(R-L)/2
if cond(C):
R=C
else:
L=C
return R
def f(R):
I=0
S=0
for a in Pos:
if I<Negative:
while a*Neg[I]<=R:
I+=1
if I==Negative:
break
S+=I
return S
def g(R):
S=0
I=Positive
for a in Pos:
if I>0:
while a*Pos[I-1]>R:
I-=1
if I==0:
break
S+=I
if a*a<=R:
S-=1
J=0
for b in Neg:
if J<Negative:
while b*Neg[-(J+1)]<=R:
J+=1
if J==Negative:
break
S+=J
if b*b<=R:
S-=1
return S>>1
#================================================
N,K=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
Pos=[a for a in A if a>0]
Neg=[a for a in A if a<0]
Positive=Zero=Negative=0
for a in A:
if a>0:
Positive+=1
elif a==0:
Zero+=1
else:
Negative+=1
Pos_Count=(Positive*(Positive-1))//2+(Negative*(Negative-1))//2
Neg_Count=Positive*Negative
Zero_Count=(N*(N-1))//2-(Pos_Count+Neg_Count)
H=max(A,key=lambda a:abs(a))
H=H*H+1
if Neg_Count+1<=K<=Neg_Count+Zero_Count: #ゼロ確定
Ans=0
elif K<=Neg_Count: #負確定
Ans=General_Binary_Increase_Search(-H,0,lambda x:f(x)>=K)
else: #正確定
Ans=General_Binary_Increase_Search(0,H,lambda x:g(x)>=K-(Neg_Count+Zero_Count))
print(Ans)
|
[
"control_flow.branch.if.condition.change"
] | 572,465
| 572,466
|
u779805689
|
python
|
p02774
|
from numpy import *
N,K = map(int,input().split())
A = array(sorted(list(map(int,input().split()))))
nega = A[A<0]
zera = A[A==0]
posa = A[0<A]
def cnt(x):
y = 0
if x>=0:
y+=n*len(zera)
y+=searchsorted(A,x//posa,side="right").sum()
y+=N*len(nega)-searchsorted(A,-(-x//nega)).sum()
y-=len(A[A*A<=x])
return y//2
r = 10**18
l = -r-1
while r-l>1:
c=(r+l)//2
if K<=cnt(c):
r=c
else:
l=c
print(r)
|
from numpy import *
N,K = map(int,input().split())
A = array(sorted(list(map(int,input().split()))))
nega = A[A<0]
zera = A[A==0]
posa = A[0<A]
def cnt(x):
y = 0
if x>=0:
y+=N*len(zera)
y+=searchsorted(A,x//posa,side="right").sum()
y+=N*len(nega)-searchsorted(A,-(-x//nega)).sum()
y-=len(A[A*A<=x])
return y//2
r = 10**18
l = -r-1
while r-l>1:
c=(r+l)//2
if K<=cnt(c):
r=c
else:
l=c
print(r)
|
[
"identifier.change",
"expression.operation.binary.change"
] | 572,467
| 572,468
|
u759412327
|
python
|
p02774
|
# https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155#toc3
# https://atcoder.jp/contests/abc155/submissions/10152895
# 写経
# 条件を満たす要素を抽出
# ndarray[条件式]
def binary_search(*, ok, ng, func):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if func(mid):
ok = mid
else:
ng = mid
return ok
def main():
import sys
import numpy as np
inf = 10 ** 18 + 1
input = sys.stdin.readline
N, K = map(int, input().split())
A = np.array(input().split(), dtype=np.int64)
A.sort()
zero = A[A == 0]
pos = A[A > 0]
neg = A[A < 0]
def count(x):
"""
定数cに対して Ai*Aj<=c となる(i,j)の数え上げ
順序制約 i<j -> 順序制約のない(i,j)からi==jの場合の個数を引いて2で割る
iを固定して a=Ai とする
a=0
ax=0(<=c?),解なしまたは任意のx
a>0
ax<=c
<-> x<=c/a
<-> x<=c//a
a<0
ax<=c
<-> (-a)x>=(-c)
否定をとり,aの対候補全体=Nから引く
(-a)x<(-c)
<-> (-a)x<=(-c-1)
<-> x<=(-c-1)//(-a)
"""
cnt = 0
cnt += zero.size * N # (a:=0)*v<=x
cnt += np.searchsorted(a=A, v=x // pos, side='right').sum() # (a:>0)*v<=x
cnt += (N - np.searchsorted(a=A, v=(-x - 1) // (-neg), side='right')).sum() # (a:<0)*v<=x
cnt -= ((A * A) <= x).sum() # i==j
assert cnt % 2 == 0
return cnt // 2
ans = binary_search(
ng=-inf,
ok=inf,
func=lambda x: count(x) >= K
)
print(ans)
if __name__ == '__main__':
main()
|
# https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155#toc3
# https://atcoder.jp/contests/abc155/submissions/10152895
# 写経
# 条件を満たす要素を抽出
# ndarray[条件式]
def binary_search(*, ok, ng, func):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if func(mid):
ok = mid
else:
ng = mid
return ok
def main():
import sys
import numpy as np
inf = 10 ** 18 + 1
input = sys.stdin.readline
N, K = map(int, input().split())
A = np.array(input().split(), dtype=np.int64)
A.sort()
zero = A[A == 0]
pos = A[A > 0]
neg = A[A < 0]
def count(x):
"""
定数cに対して Ai*Aj<=c となる(i,j)の数え上げ
順序制約 i<j -> 順序制約のない(i,j)からi==jの場合の個数を引いて2で割る
iを固定して a=Ai とする
a=0
ax=0(<=c?),解なしまたは任意のx
a>0
ax<=c
<-> x<=c/a
<-> x<=c//a
a<0
ax<=c
<-> (-a)x>=(-c)
否定をとり,aの対候補全体=Nから引く
(-a)x<(-c)
<-> (-a)x<=(-c-1)
<-> x<=(-c-1)//(-a)
"""
cnt = 0
if x >= 0:
cnt += zero.size * N # (a:=0)*v<=x
cnt += np.searchsorted(a=A, v=x // pos, side='right').sum() # (a:>0)*v<=x
cnt += (N - np.searchsorted(a=A, v=(-x - 1) // (-neg), side='right')).sum() # (a:<0)*v<=x
cnt -= ((A * A) <= x).sum() # i==j
assert cnt % 2 == 0
return cnt // 2
ans = binary_search(
ng=-inf,
ok=inf,
func=lambda x: count(x) >= K
)
print(ans)
if __name__ == '__main__':
main()
|
[
"control_flow.branch.if.add"
] | 572,469
| 572,470
|
u562935282
|
python
|
p02774
|
import numpy as np
n, k = map(int, input().split())
a = list(map(int, input().split()))
a = np.array(a)
a.sort()
nega = a[a<0]
zero = a[a==0]
posi = a[a>0]
l = -10**18-1
r = 10**18+1
while r - l > 1:
mid = (r+l)//2
cnt = 0
if mid >= 0:
cnt += len(zero)*n
cnt += a.searchsorted(mid//posi, side='right').sum()
cnt += (n - a.searchsorted(mid//nega, side='left')).sum()
cnt -= np.count_nonzero(a*a <= mid)
cnt //=2
if cnt >= k:
r = mid
else:
l= mid
print(r)
|
import numpy as np
n, k = map(int, input().split())
a = list(map(int, input().split()))
a = np.array(a)
a.sort()
nega = a[a<0]
zero = a[a==0]
posi = a[a>0]
l = -10**18-1
r = 10**18+1
while r - l > 1:
mid = (r+l)//2
cnt = 0
if mid >= 0:
cnt += len(zero)*n
cnt += a.searchsorted(mid//posi, side='right').sum()
cnt += (n - a.searchsorted(-(-mid//nega), side='left')).sum()
cnt -= np.count_nonzero(a*a <= mid)
cnt //=2
if cnt >= k:
r = mid
else:
l= mid
print(r)
|
[
"call.arguments.change"
] | 572,484
| 572,485
|
u113310313
|
python
|
p02774
|
N,K=map(int, input().split())
A=list(map(int, input().split()))
A=sorted(A)
import numpy as np
A=np.array(A,dtype="int64")
Z=A[A==0]
H=A[A<0]
S=A[A>0]
l,r=-10**19,10**19
while r-l>1:
mid=(r+l)//2
cnt=0
cnt+=A.searchsorted(mid//S,side="right").sum()
cnt+=(N-A.searchsorted((-mid)//(-H),side="right")).sum()
cnt-=np.count_nonzero(A*A<=mid)
if mid>=0:
cnt+=len(Z)*N
cnt//=2
if cnt>=K:
r=mid
else:
l=mid
print(r)
|
N,K=map(int, input().split())
A=list(map(int, input().split()))
A=sorted(A)
import numpy as np
A=np.array(A,dtype="int64")
Z=A[A==0]
H=A[A<0]
S=A[A>0]
l,r=-10**19,10**19
while r-l>1:
mid=(r+l)//2
cnt=0
cnt+=A.searchsorted(mid//S,side="right").sum()
cnt+=(N-A.searchsorted((mid+1)//(H),side="right")).sum()
cnt-=np.count_nonzero(A*A<=mid)
if mid>=0:
cnt+=len(Z)*N
cnt//=2
if cnt>=K:
r=mid
else:
l=mid
print(r)
|
[
"expression.operation.unary.arithmetic.remove",
"call.arguments.change"
] | 572,486
| 572,487
|
u113310313
|
python
|
p02774
|
N,K=map(int, input().split())
A=list(map(int, input().split()))
A=sorted(A)
import numpy as np
A=np.array(A,dtype="int64")
Z=A[A==0]
H=A[A<0]
S=A[A>0]
l,r=-10**19,10**19
while r-l>1:
mid=(r+l)//2
cnt=0
cnt+=A.searchsorted(mid//S,side="right").sum()
cnt+=(N-A.searchsorted((-mid)//(-H),side="right")).sum()
cnt-=np.count_nonzero(A*A<=mid)
if mid>=0:
cnt+=len(Z)*N
cnt//=2
if cnt>=K:
r=mid
else:
l=mid
print(r)
|
N,K=map(int, input().split())
A=list(map(int, input().split()))
A=sorted(A)
import numpy as np
A=np.array(A,dtype="int64")
Z=A[A==0]
H=A[A<0]
S=A[A>0]
l,r=-10**19,10**19
while r-l>1:
mid=(r+l)//2
cnt=0
cnt+=A.searchsorted(mid//S,side="right").sum()
cnt+=(N-A.searchsorted((-mid-1)//(-H),side="right")).sum()
cnt-=np.count_nonzero(A*A<=mid)
if mid>=0:
cnt+=len(Z)*N
cnt//=2
if cnt>=K:
r=mid
else:
l=mid
print(r)
|
[
"expression.operation.binary.add"
] | 572,486
| 572,488
|
u113310313
|
python
|
p02774
|
ma = lambda :map(int,input().split())
lma = lambda :list(map(int,input().split()))
tma = lambda :tuple(map(int,input().split()))
ni = lambda:int(input())
yn = lambda fl:print("YES") if fl else print("NO")
import collections
import math
import itertools
import heapq as hq
def isok1(x,ls1,ls2,cnt=0):
##ls1 :minus -1,-2 ls2 :plus 1,2,..
l1,l2=0,0
while l1<len(ls1) and l2<len(ls2):
if ls1[l1]*ls2[l2] <= x:
cnt+=len(ls2) -l2
l1+=1
else:
l2+=1
return cnt<k
def isok2(x,ls1,ls2,cnt=0):
##ls1 :minus -2,-1, ls2 :plus 2,1,..
l,r=0,0
tmp=0
while r<len(ls1) and l<len(ls1):
if ls1[-l-1]*ls1[r] <=x:
tmp+=len(ls1)-r
l+=1
else:
r+=1
for i in range(len(ls1)):
if ls1[i]**2 <=x:tmp-=1
cnt+=tmp//2
l,r=0,0
tmp=0
while r<len(ls2) and l<len(ls2):
#print(ls2[-l-1]*ls2[r],l,r)
if ls2[-l-1]*ls2[r] <=x:
tmp+=len(ls2)-r
#print(tmp,ls2[-l-1]*ls2[r],l,r)
l+=1
else:
r+=1
for i in range(len(ls2)):
if ls2[i]**2 <=x:tmp-=1
cnt+=tmp//2
#print(x,cnt)
return cnt<k
n,k = ma()
A = lma()
pA = [a for a in A if a>0]
mA = [a for a in A if a<0]
pn = len(mA)*(len(mA)-1)//2 +len(pA)*(len(pA)-1)//2
mn = len(pA) *len(mA)
z = n*(n-1)//2 -pn -mn
if k<=mn:
f=True
pA.sort()
mA.sort(reverse=True)
elif k>mn+z:
f=False
pA.sort(reverse=True)
mA.sort()
else:
print(0)
exit()
#print(isok2(6,mA,pA,cnt=mn+z))
ok = -10**18-2
ng = 10**18+2
x = (ok+ng)//2
while ng-ok>1:
if f:
if isok1(x,mA,pA):
ok = x
else:
ng=x
x = (ok+ng)//2
else:
if isok2(x,mA,pA,cnt=mn+z):
ok = x
else:
ng=x
x = (ok+ng)//2
print(ng)
|
ma = lambda :map(int,input().split())
lma = lambda :list(map(int,input().split()))
tma = lambda :tuple(map(int,input().split()))
ni = lambda:int(input())
yn = lambda fl:print("YES") if fl else print("NO")
import collections
import math
import itertools
import heapq as hq
def isok1(x,ls1,ls2,cnt=0):
##ls1 :minus -2,-1 ls2 :plus 1,2,..
l1,l2=0,0
while l1<len(ls1) and l2<len(ls2):
if ls1[l1]*ls2[l2] <= x:
cnt+=len(ls2) -l2
l1+=1
else:
l2+=1
return cnt<k
def isok2(x,ls1,ls2,cnt=0):
##ls1 :minus -2,-1, ls2 :plus 2,1,..
l,r=0,0
tmp=0
while r<len(ls1) and l<len(ls1):
if ls1[-l-1]*ls1[r] <=x:
tmp+=len(ls1)-r
l+=1
else:
r+=1
for i in range(len(ls1)):
if ls1[i]**2 <=x:tmp-=1
cnt+=tmp//2
l,r=0,0
tmp=0
while r<len(ls2) and l<len(ls2):
#print(ls2[-l-1]*ls2[r],l,r)
if ls2[-l-1]*ls2[r] <=x:
tmp+=len(ls2)-r
#print(tmp,ls2[-l-1]*ls2[r],l,r)
l+=1
else:
r+=1
for i in range(len(ls2)):
if ls2[i]**2 <=x:tmp-=1
cnt+=tmp//2
#print(x,cnt)
return cnt<k
n,k = ma()
A = lma()
pA = [a for a in A if a>0]
mA = [a for a in A if a<0]
pn = len(mA)*(len(mA)-1)//2 +len(pA)*(len(pA)-1)//2
mn = len(pA) *len(mA)
z = n*(n-1)//2 -pn -mn
if k<=mn:
f=True
pA.sort()
mA.sort()
elif k>mn+z:
f=False
pA.sort(reverse=True)
mA.sort()
else:
print(0)
exit()
#print(isok2(6,mA,pA,cnt=mn+z))
ok = -10**18-2
ng = 10**18+2
x = (ok+ng)//2
while ng-ok>1:
if f:
if isok1(x,mA,pA):
ok = x
else:
ng=x
x = (ok+ng)//2
else:
if isok2(x,mA,pA,cnt=mn+z):
ok = x
else:
ng=x
x = (ok+ng)//2
print(ng)
|
[] | 572,495
| 572,496
|
u401487574
|
python
|
p02774
|
N, K, *A = map(int, open(0).read().split())
neg = sorted([-a for a in A if a < 0])
pos = sorted([a for a in A if a >= 0])
def _count_pair_neg(x):
x = -x
res = 0
MAX = len(neg)
i = 0
for n in reversed(neg):
while i < MAX and n * pos[i] < x:
i += 1
res += len(pos) - i
return res
def _count_pair_pos(x):
res = 0
# Negative list
i = 0
MAX = len(neg)
for n in reversed(neg):
if n * n <= x:
res -= 1
while i < MAX and neg[i] * n <= x:
i += 1
res += i
# Positive list
i = 0
MAX = len(pos)
for n in reversed(pos):
if n * n <= x:
res -= 1
while i < MAX and pos[i] * n <= x:
i += 1
res += i
# Devide by 2 for counting the same pair twice
res //= 2
res += len(neg) * len(pos)
return res
def count_pair(x):
if x < 0:
return _count_pair_neg(x)
return _count_pair_pos(x)
# Bounds
lb = 0
ub = 2 * 10 ** 18 + 2
while ub - lb > 1:
mid = (ub + lb) // 2
if count_pair(mid - 10 ** 18 - 1) < K:
lb = mid
else:
ub = mid
print(ub - 10 ** 18 - 1)
|
N, K, *A = map(int, open(0).read().split())
neg = sorted([-a for a in A if a < 0])
pos = sorted([a for a in A if a >= 0])
def _count_pair_neg(x):
x = -x
res = 0
MAX = len(pos)
i = 0
for n in reversed(neg):
while i < MAX and n * pos[i] < x:
i += 1
res += MAX - i
return res
def _count_pair_pos(x):
res = 0
# Negative list
i = 0
MAX = len(neg)
for n in reversed(neg):
if n * n <= x:
res -= 1
while i < MAX and neg[i] * n <= x:
i += 1
res += i
# Positive list
i = 0
MAX = len(pos)
for n in reversed(pos):
if n * n <= x:
res -= 1
while i < MAX and pos[i] * n <= x:
i += 1
res += i
# Devide by 2 for counting the same pair twice
res //= 2
res += len(neg) * len(pos)
return res
def count_pair(x):
if x < 0:
return _count_pair_neg(x)
return _count_pair_pos(x)
# Bounds
lb = 0
ub = 2 * 10 ** 18 + 2
while ub - lb > 1:
mid = (ub + lb) // 2
if count_pair(mid - 10 ** 18 - 1) < K:
lb = mid
else:
ub = mid
print(ub - 10 ** 18 - 1)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 572,514
| 572,515
|
u057109575
|
python
|
p02774
|
from bisect import *
def binary_search_int(ok, ng, test):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if test(mid):
ok = mid
else:
ng = mid
return ng
def get_count1(k, A):
""" K番目の要素が正の場合 """
l, r = 0, len(A)-1
res = 0
while l < r:
if A[l]*A[r] > k:
r -= 1
continue
res += r-l
l += 1
return res
def get_count2(k, B, C):
""" K番目の要素が負の場合 """
l, r = 0, len(C)-1
res = 0
while True:
if l > len(B)-1 or r < 0:
break
if B[l]*C[r] < -k:
l += 1
continue
res += len(B)-l
r -= 1
return res
def test1(k):
return get_count1(k, B) + get_count1(k, C) + count_negative < K
def test2(k):
return get_count2(k, B, C) < K
N, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
at_zero = bisect_left(A,0)
B = A[:at_zero]
B = list(map(lambda x: -x, B))
B = list(reversed(B)) # 負の要素
C = A[at_zero:] # 正の要素
count_positive = (len(B)*(len(B)-1)//2 + len(C)*(len(C)-1)//2)
count_negative = N*(N-1)//2 - count_positive
if K > count_negative:
print(binary_search_int(-1, 10**18+1, test1))
else:
print(binary_search_int(-10**2, 1, test2))
|
from bisect import *
def binary_search_int(ok, ng, test):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if test(mid):
ok = mid
else:
ng = mid
return ng
def get_count1(k, A):
""" K番目の要素が正の場合 """
l, r = 0, len(A)-1
res = 0
while l < r:
if A[l]*A[r] > k:
r -= 1
continue
res += r-l
l += 1
return res
def get_count2(k, B, C):
""" K番目の要素が負の場合 """
l, r = 0, len(C)-1
res = 0
while True:
if l > len(B)-1 or r < 0:
break
if B[l]*C[r] < -k:
l += 1
continue
res += len(B)-l
r -= 1
return res
def test1(k):
return get_count1(k, B) + get_count1(k, C) + count_negative < K
def test2(k):
return get_count2(k, B, C) < K
N, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
at_zero = bisect_left(A,0)
B = A[:at_zero]
B = list(map(lambda x: -x, B))
B = list(reversed(B)) # 負の要素
C = A[at_zero:] # 正の要素
count_positive = (len(B)*(len(B)-1)//2 + len(C)*(len(C)-1)//2)
count_negative = N*(N-1)//2 - count_positive
if K > count_negative:
print(binary_search_int(-1, 10**18+1, test1))
else:
print(binary_search_int(-10**18, 1, test2))
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 572,536
| 572,537
|
u367701763
|
python
|
p02774
|
from bisect import *
def binary_search_int(ok, ng, test):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if test(mid):
ok = mid
else:
ng = mid
return ng
def get_count1(k, A):
""" K番目の要素が正の場合 """
l, r = 0, len(A)-1
res = 0
while l < r:
if A[l]*A[r] > k:
r -= 1
continue
res += r-l
l += 1
return res
def get_count2(k, B, C):
""" K番目の要素が負の場合 """
l, r = 0, len(C)-1
res = 0
while True:
if l > len(B)-1 or r < 0:
break
if B[l]*C[r] < -k:
l += 1
continue
res += len(C)-l
r -= 1
return res
def test1(k):
return get_count1(k, B) + get_count1(k, C) + count_negative < K
def test2(k):
return get_count2(k, B, C) < K
N, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
at_zero = bisect_left(A,0)
B = A[:at_zero]
B = list(map(lambda x: -x, B))
B = list(reversed(B)) # 負の要素
C = A[at_zero:] # 正の要素
count_positive = (len(B)*(len(B)-1)//2 + len(C)*(len(C)-1)//2)
count_negative = N*(N-1)//2 - count_positive
if K >= count_negative:
print(binary_search_int(-1, 10**18, test1))
else:
print(binary_search_int(-10**18, 1, test2))
|
from bisect import *
def binary_search_int(ok, ng, test):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if test(mid):
ok = mid
else:
ng = mid
return ng
def get_count1(k, A):
""" K番目の要素が正の場合 """
l, r = 0, len(A)-1
res = 0
while l < r:
if A[l]*A[r] > k:
r -= 1
continue
res += r-l
l += 1
return res
def get_count2(k, B, C):
""" K番目の要素が負の場合 """
l, r = 0, len(C)-1
res = 0
while True:
if l > len(B)-1 or r < 0:
break
if B[l]*C[r] < -k:
l += 1
continue
res += len(B)-l
r -= 1
return res
def test1(k):
return get_count1(k, B) + get_count1(k, C) + count_negative < K
def test2(k):
return get_count2(k, B, C) < K
N, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
at_zero = bisect_left(A,0)
B = A[:at_zero]
B = list(map(lambda x: -x, B))
B = list(reversed(B)) # 負の要素
C = A[at_zero:] # 正の要素
count_positive = (len(B)*(len(B)-1)//2 + len(C)*(len(C)-1)//2)
count_negative = N*(N-1)//2 - count_positive
if K > count_negative:
print(binary_search_int(-1, 10**18+1, test1))
else:
print(binary_search_int(-10**18, 1, test2))
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 572,538
| 572,537
|
u367701763
|
python
|
p02774
|
from bisect import *
def binary_search_int(ok, ng, test):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if test(mid):
ok = mid
else:
ng = mid
return ng
def get_count1(k, A):
""" K番目の要素が正の場合 """
l, r = 0, len(A)-1
res = 0
while l < r:
if A[l]*A[r] > k:
r -= 1
continue
res += r-l
l += 1
return res
def get_count2(k, B, C):
""" K番目の要素が負の場合 """
l, r = 0, len(C)-1
res = 0
while True:
if l > len(B)-1 or r < 0:
break
if B[l]*C[r] < -k:
l += 1
continue
res += len(C)-l
r -= 1
return res
def test1(k):
return get_count1(k, B) + get_count1(k, C) + count_negative < K
def test2(k):
return get_count2(k, B, C) < K
N, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
at_zero = bisect_left(A,0)
B = A[:at_zero]
B = list(map(lambda x: -x, B))
B = list(reversed(B)) # 負の要素
C = A[at_zero:] # 正の要素
count_positive = (len(B)*(len(B)-1)//2 + len(C)*(len(C)-1)//2)
count_negative = N*(N-1)//2 - count_positive
if K > count_negative:
print(binary_search_int(0, 10**18, test1))
else:
print(binary_search_int(-10**18, 0, test2))
|
from bisect import *
def binary_search_int(ok, ng, test):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if test(mid):
ok = mid
else:
ng = mid
return ng
def get_count1(k, A):
""" K番目の要素が正の場合 """
l, r = 0, len(A)-1
res = 0
while l < r:
if A[l]*A[r] > k:
r -= 1
continue
res += r-l
l += 1
return res
def get_count2(k, B, C):
""" K番目の要素が負の場合 """
l, r = 0, len(C)-1
res = 0
while True:
if l > len(B)-1 or r < 0:
break
if B[l]*C[r] < -k:
l += 1
continue
res += len(B)-l
r -= 1
return res
def test1(k):
return get_count1(k, B) + get_count1(k, C) + count_negative < K
def test2(k):
return get_count2(k, B, C) < K
N, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
at_zero = bisect_left(A,0)
B = A[:at_zero]
B = list(map(lambda x: -x, B))
B = list(reversed(B)) # 負の要素
C = A[at_zero:] # 正の要素
count_positive = (len(B)*(len(B)-1)//2 + len(C)*(len(C)-1)//2)
count_negative = N*(N-1)//2 - count_positive
if K > count_negative:
print(binary_search_int(-1, 10**18+1, test1))
else:
print(binary_search_int(-10**18, 1, test2))
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"expression.operation.unary.add",
"literal.number.integer.change"
] | 572,539
| 572,537
|
u367701763
|
python
|
p02775
|
import sys
read = sys.stdin.readline
# 下の桁から貪欲に見ていくと解ける
# 1の位が4以下ならそのまま紙幣で支払うのが得→自身をそのまま答えに採用 (枚数として加算)
# 6以上ならばお釣り狙いのほうが得→自身は0にセットして、上位桁を+1する (枚数として10-自身を加算)
# 5ちょうどのときは、お釣りもそのまま払っても枚数は変わらない。だけど555みたいに、上位桁に+1すると得になる可能性がある。
# 555→15枚, 1000-445→15枚
# つまり5が出たときは更に上位の桁を見て、4以下ならそのまま払うほうが得,5以上なら桁上りのほうが得
# 5ちょうどのときは？ #お釣りもそのまま払っても同じ。だけど上位 お釣り狙いだと上の桁が多くなって支払う金額が増える可能性がある？
# 5ピッタリのときに上位桁に+1すると悪くなる場合が存在する 455 とは 15にってしまう
# 5ピッタリのときはどうするのがよいのか？
N = '0' + read()[:-1]
N = N[::-1]
ans = 0
i = 0
lo = int(N[i])
while i < len(N) - 1:
hi = int(N[i + 1])
if lo == 5: # 5のときは上の桁の大きさによってお釣りが得になるかそのまま払うのが良くなるか変化する
ans += lo
if hi < 5:
pass
else:
hi += 1
elif lo < 5:
# loが5以外のとき (お釣りが良いか、そのまま払うのが良いか考えるだけ)
ans += lo
else:
ans += 10 - lo
hi += 1 # 上の桁が繰り上がる
lo = hi # 桁を一つずらす
i += 1
print(ans)
|
import sys
read = sys.stdin.readline
# 下の桁から貪欲に見ていくと解ける
# 1の位が4以下ならそのまま紙幣で支払うのが得→自身をそのまま答えに採用 (枚数として加算)
# 6以上ならばお釣り狙いのほうが得→自身は0にセットして、上位桁を+1する (枚数として10-自身を加算)
# 5ちょうどのときは、お釣りもそのまま払っても枚数は変わらない。だけど555みたいに、上位桁に+1すると得になる可能性がある。
# 555→15枚, 1000-445→15枚
# つまり5が出たときは更に上位の桁を見て、4以下ならそのまま払うほうが得,5以上なら桁上りのほうが得
# 5ちょうどのときは？ #お釣りもそのまま払っても同じ。だけど上位 お釣り狙いだと上の桁が多くなって支払う金額が増える可能性がある？
# 5ピッタリのときに上位桁に+1すると悪くなる場合が存在する 455 とは 15にってしまう
# 5ピッタリのときはどうするのがよいのか？
N = '00' + read()[:-1]
N = N[::-1]
ans = 0
i = 0
lo = int(N[i])
while i < len(N) - 1:
hi = int(N[i + 1])
if lo == 5: # 5のときは上の桁の大きさによってお釣りが得になるかそのまま払うのが良くなるか変化する
ans += lo
if hi < 5:
pass
else:
hi += 1
elif lo < 5:
# loが5以外のとき (お釣りが良いか、そのまま払うのが良いか考えるだけ)
ans += lo
else:
ans += 10 - lo
hi += 1 # 上の桁が繰り上がる
lo = hi # 桁を一つずらす
i += 1
print(ans)
|
[
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 572,566
| 572,567
|
u179169725
|
python
|
p02775
|
S = input().strip()
dp = [[INFTY for _ in range(2)] for _ in range(len(S))]
for k in range(10):
n = int(S[-1])
if k>= n:
dp[0][0] = min(dp[0][0],2*k-n)
else:
dp[0][1] = min(dp[0][1],2*k-n+10)
for i in range(1,len(S)):
n = int(S[-(1+i)])
for k in range(10):
if k>n:
dp[i][0] = min(dp[i][0],2*k-n+dp[i-1][0],k+(k-1)-n+dp[i-1][1])
elif k==n:
dp[i][0] = min(dp[i][0],2*k-n+dp[i-1][0])
if n==0:
dp[i][1] = min(dp[i][1],k+(k-1)%10-n+dp[i-1][1])
else:
dp[i][1] = min(dp[i][1],k+10-n+k-1+dp[i-1][1])
elif k<n:
dp[i][1] = min(dp[i][1],k+10-n+k+dp[i-1][0],k+10-n+k-1+dp[i-1][1])
print(min(dp[len(S)-1][0],dp[len(S)-1][1]+1))
|
S = input().strip()
INFTY=10**8
dp = [[INFTY for _ in range(2)] for _ in range(len(S))]
for k in range(10):
n = int(S[-1])
if k>= n:
dp[0][0] = min(dp[0][0],2*k-n)
else:
dp[0][1] = min(dp[0][1],2*k-n+10)
for i in range(1,len(S)):
n = int(S[-(1+i)])
for k in range(10):
if k>n:
dp[i][0] = min(dp[i][0],2*k-n+dp[i-1][0],k+(k-1)-n+dp[i-1][1])
elif k==n:
dp[i][0] = min(dp[i][0],2*k-n+dp[i-1][0])
if n==0:
dp[i][1] = min(dp[i][1],k+(k-1)%10-n+dp[i-1][1])
else:
dp[i][1] = min(dp[i][1],k+10-n+k-1+dp[i-1][1])
elif k<n:
dp[i][1] = min(dp[i][1],k+10-n+k+dp[i-1][0],k+10-n+k-1+dp[i-1][1])
print(min(dp[len(S)-1][0],dp[len(S)-1][1]+1))
|
[
"assignment.add"
] | 572,570
| 572,571
|
u644907318
|
python
|
p02775
|
import sys
input = sys.stdin.readline
# 不変
N = [0] + list(map(int, tuple(input().rstrip("\n"))))
# 計算用
Ncopy = N.copy()
ans = 0
# 繰り上げ発生時に変更
flag = False
for i in range(len(N)-1, 0, -1):
if (Ncopy[i] <= 4) or (Ncopy[i] == 5 and N[i-1] <= 4):
ans += Ncopy[i]
flag = False
else:
Ncopy[i-1] += 1
# 最後だけ特殊
if not flag:
ans += 10 - N[i]
else:
ans += 9 - N[i]
Ncopy[i] = 0
flag = True
print(Ncopy)
if Ncopy[0] == 1:
ans += 1
print(ans)
|
import sys
input = sys.stdin.readline
# 不変
N = [0] + list(map(int, tuple(input().rstrip("\n"))))
# 計算用
Ncopy = N.copy()
ans = 0
# 繰り上げ発生時に変更
flag = False
for i in range(len(N)-1, 0, -1):
if (Ncopy[i] <= 4) or (Ncopy[i] == 5 and N[i-1] <= 4):
ans += Ncopy[i]
flag = False
else:
Ncopy[i-1] += 1
# 最後だけ特殊
if not flag:
ans += 10 - N[i]
else:
ans += 9 - N[i]
Ncopy[i] = 0
flag = True
if Ncopy[0] == 1:
ans += 1
print(ans)
|
[
"call.remove"
] | 572,572
| 572,573
|
u561083515
|
python
|
p02775
|
n = list(map(int, list(input())))[::-1] + [0]
sum1 = sum(n)
for i in range(len(n)-1):
if n[i] > 5 or (n[i]==5 and n[i+1]==5):
n[i] = 10-n[i]
n[i+1] += 1
print(min(sum1, sum(n)))
|
n = list(map(int, list(input())))[::-1] + [0]
sum1 = sum(n)
for i in range(len(n)-1):
if n[i] > 5 or (n[i]==5 and n[i+1]>4):
n[i] = 10-n[i]
n[i+1] += 1
print(min(sum1, sum(n)))
|
[
"control_flow.loop.for.condition.change"
] | 572,610
| 572,611
|
u557565572
|
python
|
p02775
|
n = input()
a = 0
b = 0
for s in n:
v = int(s)
a_ = min(a + v, b + v)
b_ = min(a + 10 - v + 1, b + 10 - v + 1 - 2)
a = a_
b = b_
print(min(a, b))
|
n = input()
a = 0
b = 2
for s in n:
v = int(s)
a_ = min(a + v, b + v)
b_ = min(a + 10 - v + 1, b + 10 - v + 1 - 2)
a = a_
b = b_
print(min(a, b))
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 572,637
| 572,638
|
u491100219
|
python
|
p02775
|
import bisect
S=input()
dig=len(S)
ans=0
b=0#繰り上がり
for i in range(dig):
a=int(S[dig-i-1])
if a<=4:
ans+=a
b=0
elif a>=6:
ans+=(10-a)
b=1
else:#a==5
if i==dig-1:
ans+=5
b=0
else:
if int(S[dig-i-2])>=5:
b=1
else:
b=0
ans+=5
if b==1:
ans+=1
print(ans)
|
import bisect
S=input()
dig=len(S)
ans=0
b=0#繰り上がり
for i in range(dig):
a=int(S[dig-i-1])+b
if a<=4:
ans+=a
b=0
elif a>=6:
ans+=(10-a)
b=1
else:#a==5
if i==dig-1:
ans+=5
b=0
else:
if int(S[dig-i-2])>=5:
b=1
else:
b=0
ans+=5
if b==1:
ans+=1
print(ans)
|
[
"assignment.change"
] | 572,647
| 572,648
|
u498487134
|
python
|
p02775
|
s=[int(i) for i in input()]
n=len(s)
ans=0
f=0
for i in range(n-1,-1,-1):
j=s[i]+f
if j<5:
ans+=j
f=0
elif j>5:
ans+=10-j
f=1
elif s[i-1]>=5:
ans+=10-j
f=1
else:
ans+=j
f=0
print(ans+f)
|
s=[int(i) for i in input()]
n=len(s)
ans=0
f=0
for i in range(n-1,-1,-1):
j=s[i]+f
if j<5:
ans+=j
f=0
elif j>5:
ans+=10-j
f=1
elif i and s[i-1]>=5:
ans+=10-j
f=1
else:
ans+=j
f=0
print(ans+f)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 572,660
| 572,661
|
u730769327
|
python
|
p02775
|
S = input()
ans = 0
flag = False #繰り上がりありならTrue
flag2 = False #前が5ならTrue
for k in range(len(S)):
n = int(S[-k-1])
if flag2:
if n < 5:
flag = False
else:
flag = True
if flag:
n += 1
if n == 5:
ans += 5
flag2 = True
elif n < 5:
ans += n
flag2 = False
flag = False
else:
ans += 10-n
flag2 = False
flag = True
if flag:
ans += 1
print(ans)
|
S = input()
ans = 0
flag = False #繰り上がりありならTrue
flag2 = False #前が5ならTrue
for k in range(len(S)):
n = int(S[-k-1])
if flag2:
if n < 5:
flag = False
else:
flag = True
if flag:
n += 1
if n == 5:
ans += 5
flag2 = True
flag = False
elif n < 5:
ans += n
flag2 = False
flag = False
else:
ans += 10-n
flag2 = False
flag = True
if flag:
ans += 1
print(ans)
|
[
"assignment.add"
] | 572,662
| 572,663
|
u627600101
|
python
|
p02775
|
n=[int(x) for x in list(input()[::-1])]+[0]
ans = 0
step = 0
for i in range(len(n)-1):
x = n[i]+step
if x < 5 or (x==5 and n[i+1]<5):
ans += x
step = 0
else:
ans += 10 - x
step = 1
print(ans)
|
n=[int(x) for x in list(input()[::-1])]+[0]
ans = 0
step = 0
for i in range(len(n)-1):
x = n[i]+step
if x < 5 or (x==5 and n[i+1]<5):
ans += x
step = 0
else:
ans += 10 - x
step = 1
print(ans+step)
|
[
"expression.operation.binary.add"
] | 572,668
| 572,669
|
u095094246
|
python
|
p02775
|
n = input()[::-1]
dp = [[0, 0] for i in range(len(n) + 1)]
dp[0][1] = 1
for i in range(len(n)):
dp[i + 1][0] = min(dp[i][0] + int(n[i]), dp[i][1] - int(n[i]) + 10)
dp[i + 1][1] = min(dp[i][0] + int(n[1]) + 1, dp[i][1] - int(n[i]) + 9)
print(dp[len(n)][0])
|
n = input()[::-1]
dp = [[0, 0] for i in range(len(n) + 1)]
dp[0][1] = 1
for i in range(len(n)):
dp[i + 1][0] = min(dp[i][0] + int(n[i]), dp[i][1] - int(n[i]) + 10)
dp[i + 1][1] = min(dp[i][0] + int(n[i]) + 1, dp[i][1] - int(n[i]) + 9)
print(dp[len(n)][0])
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 572,676
| 572,677
|
u923270446
|
python
|
p02775
|
def main():
S = list( map( int, list( input())))
N = len(S)
dp = [[0,0] for _ in range(N+1)]
dp[0][1] = 1
for i in range(N):
s = S[i]
dp[i+1][0] = min(dp[i][0] + s, dp[i][1]+s)
dp[i+1][1] = min(dp[i][0] + 11-s, dp[i][1]+9-s)
# 11-sは、追加で支払うものと、お釣り
# 9-sは、追加はすでに支払われていて、繰り下がりが起こっている
print( min(dp[N][0], dp[N][1]))
if __name__ == '__main__':
main()
|
def main():
S = list( map( int, list( input())))
N = len(S)
dp = [[0,0] for _ in range(N+1)]
dp[0][1] = 2
for i in range(N):
s = S[i]
dp[i+1][0] = min(dp[i][0] + s, dp[i][1]+s)
dp[i+1][1] = min(dp[i][0] + 11-s, dp[i][1]+9-s)
# dp[i+1][2] = min(dp[i][1], dp[i][2])+9-s
# 11-sは、追加で支払うものと、お釣り
# 9-sは、追加はすでに支払われていて、繰り下がりが起こっている
print( min(dp[N][0], dp[N][1]))
if __name__ == '__main__':
main()
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 572,716
| 572,717
|
u201234972
|
python
|
p02775
|
def main():
S = list( map( int, list( input())))
N = len(S)
dp = [[0,0] for _ in range(N+1)]
dp[0][1] = 1
for i in range(N):
s = S[i]
dp[i+1][0] = min(dp[i][0] + s, dp[i][1]+s)
dp[i+1][1] = min(dp[i][0] + 11-s, dp[i][1]+9-s)
# 11-sは、追加で支払うものと、お釣り
# 9-sは、追加はすでに支払われていて、繰り下がりが起こっている
print( min(dp[N][0], dp[N][1]))
if __name__ == '__main__':
main()
|
def main():
S = list( map( int, list( input())))
N = len(S)
dp = [[0,0] for _ in range(N+1)]
dp[0][1] = 2
for i in range(N):
s = S[i]
dp[i+1][0] = min(dp[i][0] + s, dp[i][1]+s)
dp[i+1][1] = min(dp[i][0] + 11-s, dp[i][1]+9-s)
# dp[i+1][2] = min(dp[i][1], dp[i][2])+9-s
# 11-sは、追加で支払うものと、お釣り
# 9-sは、追加はすでに支払われていて、繰り下がりが起こっている
print( min(dp[N][0], dp[N][1]))
if __name__ == '__main__':
main()
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 572,716
| 572,718
|
u201234972
|
python
|
p02775
|
N = list(map(int, input()))
ans = 0
carry = 0 #0 or 1 or 2. when 2, it means that it's optional between 0 and 1.
for i in range(len(N) - 1, -1, -1):
if carry == 2:
if N[i] >= 5:
digit = N[i] + 1
carry = 1
ans += (10 - digit)
else:
digit = N[i]
carry = 0
ans += digit
else:
digit = N[i] + carry
if digit >= 6:
carry = 1
ans += (10 - digit)
elif digit <= 4:
carry = 0
ans += digit
else:
carry = 2
ans += digit
ans += carry
print(ans)
|
N = list(map(int, input()))
ans = 0
carry = 0 #0 or 1 or 2. when 2, it means that it's optional between 0 and 1.
for i in range(len(N) - 1, -1, -1):
if carry == 2:
if N[i] >= 5:
digit = N[i] + 1
carry = 1
ans += (10 - digit)
else:
digit = N[i]
carry = 0
ans += digit
else:
digit = N[i] + carry
if digit >= 6:
carry = 1
ans += (10 - digit)
elif digit <= 4:
carry = 0
ans += digit
else:
carry = 2
ans += digit
if carry == 1:
ans += carry
print(ans)
|
[
"control_flow.branch.if.add"
] | 572,721
| 572,722
|
u034128150
|
python
|
p02775
|
s = input()[::-1]
size = len(s)
s += "9"
ans = 0
bef = 0
for i in range(size):
v1 = int(s[i])
v2 = int(s[i+1])
if v1+bef>=6 or (v1+bef>=5 and v2>=5):
ans += 10-(v1+bef)
bef = 1
else:
ans += (v1+bef)
bef = 0
ans += bef
print(ans)
|
s = input()[::-1]
size = len(s)
s += "4"
ans = 0
bef = 0
for i in range(size):
v1 = int(s[i])
v2 = int(s[i+1])
if v1+bef>=6 or (v1+bef>=5 and v2>=5):
ans += 10-(v1+bef)
bef = 1
else:
ans += (v1+bef)
bef = 0
ans += bef
print(ans)
|
[
"literal.string.change"
] | 572,727
| 572,728
|
u690536347
|
python
|
p02775
|
import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
#文字列を一文字ずつ数字に変換、'5678'を[5,6,7,8]とできる
def LSI(): return list(map(int, list(sys.stdin.readline().rstrip())))
def LSI2(N): return [list(map(int, list(sys.stdin.readline().rstrip()))) for i in range(N)]
#文字列として取得
def ST(): return sys.stdin.readline().rstrip()
def LST(): return sys.stdin.readline().rstrip().split()
def LST2(N): return [sys.stdin.readline().rstrip().split() for i in range(N)]
def FILL(i,h): return [i for j in range(h)]
def FILL2(i,h,w): return [FILL(i,w) for j in range(h)]
def FILL3(i,h,w,d): return [FILL2(i,w,d) for j in range(h)]
def FILL4(i,h,w,d,d2): return [FILL3(i,w,d,d2) for j in range(h)]
def sisha(num,digit): return Decimal(str(num)).quantize(Decimal(digit),rounding=ROUND_HALF_UP)
#'0.01'や'1E1'などで指定、整数に戻すならintをかます
MOD = 1000000007
INF = float("inf")
sys.setrecursionlimit(10**6+10)
N = LSI()
dp = [[INF]*2 for _ in range(len(N)+1)] #dp[i][0]が下からi桁めをぴったり払う最低枚数
dp[0][0] = 0
for i in range(len(N)):
d = N[-(i+1)]
dp[i+1][0] = min(dp[i][0] + d, dp[i][1] + d + 1)
dp[i+1][1] = min(dp[i][0] + (10-d), dp[i][1] + (10-d) - 1)
print(min(dp[-1][0], dp[-1][1]))
|
import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
#文字列を一文字ずつ数字に変換、'5678'を[5,6,7,8]とできる
def LSI(): return list(map(int, list(sys.stdin.readline().rstrip())))
def LSI2(N): return [list(map(int, list(sys.stdin.readline().rstrip()))) for i in range(N)]
#文字列として取得
def ST(): return sys.stdin.readline().rstrip()
def LST(): return sys.stdin.readline().rstrip().split()
def LST2(N): return [sys.stdin.readline().rstrip().split() for i in range(N)]
def FILL(i,h): return [i for j in range(h)]
def FILL2(i,h,w): return [FILL(i,w) for j in range(h)]
def FILL3(i,h,w,d): return [FILL2(i,w,d) for j in range(h)]
def FILL4(i,h,w,d,d2): return [FILL3(i,w,d,d2) for j in range(h)]
def sisha(num,digit): return Decimal(str(num)).quantize(Decimal(digit),rounding=ROUND_HALF_UP)
#'0.01'や'1E1'などで指定、整数に戻すならintをかます
MOD = 1000000007
INF = float("inf")
sys.setrecursionlimit(10**6+10)
N = LSI()
dp = [[INF]*2 for _ in range(len(N)+1)] #dp[i][0]が下からi桁めをぴったり払う最低枚数
dp[0][0] = 0
for i in range(len(N)):
d = N[-(i+1)]
dp[i+1][0] = min(dp[i][0] + d, dp[i][1] + d + 1)
dp[i+1][1] = min(dp[i][0] + (10-d), dp[i][1] + (10-d) - 1)
print(min(dp[-1][0], dp[-1][1]+1))
|
[
"expression.operation.binary.add"
] | 572,734
| 572,735
|
u380995377
|
python
|
p02775
|
N = input()
L=len(N)
DP=[[N]*2 for _ in range(L+1)]
DP[0][0]=0
DP[0][1]=0
for i,n in enumerate(N,1):
DP[i][0]= min(DP[i-1][0]+int(n),DP[i-1][1]+10-int(n))
DP[i][1] = min(DP[i-1][0]+int(n)+1,DP[i-1][1]+9-int(n))
print(DP[L][0])
|
N = input()
L=len(N)
DP=[[N]*2 for _ in range(L+1)]
DP[0][0]=0
DP[0][1]=1
for i,n in enumerate(N,1):
DP[i][0]= min(DP[i-1][0]+int(n),DP[i-1][1]+10-int(n))
DP[i][1] = min(DP[i-1][0]+int(n)+1,DP[i-1][1]+9-int(n))
print(DP[L][0])
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 572,749
| 572,750
|
u375616706
|
python
|
p02775
|
from math import ceil
N = input()
L=len(N)
DP=[[N]*2 for _ in range(L+1)]
DP[0][0]=0
DP[0][1]=0
for i,n in enumerate(N,1):
DP[i][0]= min(DP[i-1][0]+int(n),DP[i-1][1]+10-int(n))
DP[i][1] = min(DP[i-1][1]+int(n)+1,DP[i-1][1]+9-int(n))
print(DP[L][0])
|
N = input()
L=len(N)
DP=[[N]*2 for _ in range(L+1)]
DP[0][0]=0
DP[0][1]=1
for i,n in enumerate(N,1):
DP[i][0]= min(DP[i-1][0]+int(n),DP[i-1][1]+10-int(n))
DP[i][1] = min(DP[i-1][0]+int(n)+1,DP[i-1][1]+9-int(n))
print(DP[L][0])
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 572,751
| 572,750
|
u375616706
|
python
|
p02775
|
N = input()
rN = N[::-1]
res = 0
add = False
for i, n in enumerate(rN):
p = int(n)
if add:
p += 1
if p == 10:
continue
elif p == 5:
if len(N) >= i+1 and int(rN[i+1]) >= 5:
add = True
res += p
else:
add = False
res += p
elif p < 5:
add = False
res += p
else:
add = True
res += 10-p
if add:
res += 1
print(res)
|
N = input()
rN = N[::-1]
res = 0
add = False
for i, n in enumerate(rN):
p = int(n)
if add:
p += 1
if p == 10:
continue
elif p == 5:
if len(N) > i+1 and int(rN[i+1]) >= 5:
add = True
res += p
else:
add = False
res += p
elif p < 5:
add = False
res += p
else:
add = True
res += 10-p
if add:
res += 1
print(res)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 572,754
| 572,755
|
u596368396
|
python
|
p02775
|
#
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from math import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A):
for a in A: print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
S=[int(s) for s in ST()[::-1]]
T=S.copy()
ans = 0
flag = False
for i,s in enumerate(S):
t=S[i]
if t>=10:
try:
S[i+1]+=1
except:
flag = True
t-=10
if t>5:
ans += 10-t
try:
S[i+1]=(S[i+1]+1)
except:
flag = True
elif t!=5:
ans += t
else: #5
ans += t
try:
if S[i+1]>=5:
S[i+1] += 1
except:
pass
print(ans)
print(ans+int(flag))
if __name__ == '__main__':
main()
|
#
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from math import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A):
for a in A: print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
S=[int(s) for s in ST()[::-1]]
T=S.copy()
ans = 0
flag = False
for i,s in enumerate(S):
t=S[i]
if t>=10:
try:
S[i+1]+=1
except:
flag = True
t-=10
if t>5:
ans += 10-t
try:
S[i+1]=(S[i+1]+1)
except:
flag = True
elif t!=5:
ans += t
else: #5
ans += t
try:
if S[i+1]>=5:
S[i+1] += 1
except:
pass
print(ans+int(flag))
if __name__ == '__main__':
main()
|
[
"call.remove"
] | 572,795
| 572,796
|
u788137651
|
python
|
p02775
|
#
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from math import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A):
for a in A: print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
S=[int(s) for s in ST()[::-1]]
T=S.copy()
ans = 0
flag = False
for i,s in enumerate(S):
t=S[i]
if t>=10:
try:
S[i+1]+=1
except:
flag = True
t-=10
if t>5:
ans += 10-t
try:
S[i+1]=(S[i+1]+1)
except:
ans+=1
flag = True
elif t!=5:
ans += t
else: #5
ans += t
try:
if S[i+1]>=5:
S[i+1] += 1
except:
pass
print(ans+int(flag))
if __name__ == '__main__':
main()
|
#
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from math import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A):
for a in A: print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
S=[int(s) for s in ST()[::-1]]
T=S.copy()
ans = 0
flag = False
for i,s in enumerate(S):
t=S[i]
if t>=10:
try:
S[i+1]+=1
except:
flag = True
t-=10
if t>5:
ans += 10-t
try:
S[i+1]=(S[i+1]+1)
except:
flag = True
elif t!=5:
ans += t
else: #5
ans += t
try:
if S[i+1]>=5:
S[i+1] += 1
except:
pass
print(ans+int(flag))
if __name__ == '__main__':
main()
|
[] | 572,797
| 572,796
|
u788137651
|
python
|
p02775
|
# e 数位dp 还可以从右到左
# 参考 https://maspypy.com/atcoder-%e5%8f%82%e5%8a%a0%e6%84%9f%e6%83%b3-2019-02-16abc-155
# https://atcoder.jp/contests/abc155/submissions/10155415
# in your code
import numpy as np
DBG=0
def p(*args, **kargs):
if DBG:print(*args, **kargs)
read = input
rn = lambda :list(map(int, read().split()))
def sol(s):
dp = 0, 1 # n, n + 1
for x in map(int, s):
c, d = dp
# 为什么这里x = 0的时候不受影响 c+0 << d+10，因为abs(c-d) < 1
# 前一位没借位 前一位借位
a = min(c + x, d + 10 - x)# for ...n
# 这里x=9为什么不受影响, c+10 >> d，因为abs(c-d) < 1
b = min(c + x + 1,d + 10 - 1 - x )# for ...(n+1)
# 因为a,b相差小于1。f(n), f(n+1)相差总是小于1，多给1元即可
dp = a,b
p(dp)
return dp[0]
if DBG:
pass
# sol("100")
# assert 8 == sol("36")
# assert sol("91") == 3
# assert 243 == sol("314159265358979323846264338327950288419716939937551058209749445923078164062862089986280348253421170")
sol(read())
|
# e 数位dp 还可以从右到左
# 参考 https://maspypy.com/atcoder-%e5%8f%82%e5%8a%a0%e6%84%9f%e6%83%b3-2019-02-16abc-155
# https://atcoder.jp/contests/abc155/submissions/10155415
# in your code
import numpy as np
DBG=0
def p(*args, **kargs):
if DBG:print(*args, **kargs)
read = input
rn = lambda :list(map(int, read().split()))
def sol(s):
dp = 0, 1 # n, n + 1
for x in map(int, s):
c, d = dp
# 为什么这里x = 0的时候不受影响 c+0 << d+10，因为abs(c-d) < 1
# 前一位没借位 前一位借位
a = min(c + x, d + 10 - x)# for ...n
# 这里x=9为什么不受影响, c+10 >> d，因为abs(c-d) < 1
b = min(c + x + 1,d + 10 - 1 - x )# for ...(n+1)
# 因为a,b相差小于1。f(n), f(n+1)相差总是小于1，多给1元即可
dp = a,b
p(dp)
return dp[0]
if DBG:
pass
# sol("100")
# assert 8 == sol("36")
# assert sol("91") == 3
# assert 243 == sol("314159265358979323846264338327950288419716939937551058209749445923078164062862089986280348253421170")
print(sol(read()))
|
[
"call.add",
"call.arguments.change"
] | 572,816
| 572,817
|
u028217518
|
python
|
p02775
|
n=list(input())
lis=[]
for k in range(len(n)):
lis.append(int(n[len(n)-1-k]))
t=0
print(lis)
for k in range(len(lis)):
if lis[k]==10:
if k==len(lis)-1:
t+=1
break
else:
lis[k]=0
lis[k+1]+=1
if lis[k]<5:
t+=lis[k]
elif lis[k]>5:
t=t+10-lis[k]
if k==len(lis)-1:
t+=1
break
else:
lis[k+1]+=1
elif lis[k]==5:
if k==len(lis)-1:
t+=5
else:
t+=5
if lis[k+1]<5:
pass
else:
lis[k+1]+=1
print(t)
|
n=list(input())
lis=[]
for k in range(len(n)):
lis.append(int(n[len(n)-1-k]))
t=0
for k in range(len(lis)):
if lis[k]==10:
if k==len(lis)-1:
t+=1
break
else:
lis[k]=0
lis[k+1]+=1
if lis[k]<5:
t+=lis[k]
elif lis[k]>5:
t=t+10-lis[k]
if k==len(lis)-1:
t+=1
break
else:
lis[k+1]+=1
elif lis[k]==5:
if k==len(lis)-1:
t+=5
else:
t+=5
if lis[k+1]<5:
pass
else:
lis[k+1]+=1
print(t)
|
[
"call.remove"
] | 572,826
| 572,827
|
u772395065
|
python
|
p02775
|
def main():
N = [int(x) for x in input()]
dp0 = 0
dp1 = 1
for n in N:
# そのまま払う
a = min(dp0 + n, dp1 + 10 - n)
# 1多めに払う
b = min(dp0 + n + 1, dp1 + 10 - (n+1))
dp0, dp1 = a, b
print(min(dp0, dp1))
if __name__ == '__main__':
main()
|
def main():
N = [int(x) for x in input()]
dp0 = 0
dp1 = 1
for n in N:
# そのまま払う
a = min(dp0 + n, dp1 + 10 - n)
# 1多めに払う
b = min(dp0 + n + 1, dp1 + 10 - (n+1))
dp0, dp1 = a, b
print(dp0)
if __name__ == '__main__':
main()
|
[
"call.remove",
"call.arguments.change"
] | 572,828
| 572,829
|
u185034753
|
python
|
p02775
|
def s_in():
return input()
def n_in():
return int(input())
def l_in():
return list(map(int, input().split()))
class Interval():
def __init__(self, li):
self.li = li
self.n = len(li)
self.sum_li = [li[0]]
for i in range(1, self.n):
self.sum_li.append(self.sum_li[i-1] + li[i])
def sum(self, a, b=None):
if b is None:
return self.sum(0, a)
res = self.sum_li[min(self.n-1, b-1)]
if a > 0:
res -= self.sum_li[a-1]
return res
N = s_in()[::-1]
n = len(N)
dp1 = [0 for _ in range(n)]
dp1[0] = int(N[0])
# dp1[i] は i桁目を同じ値だけ使ったとしたときの最小値
dp2 = [0 for _ in range(n)]
dp2[0] = 10 - int(N[0])
# dp2[i] は i桁目を繰り上げたとしたときの最小値
for i, s in enumerate(N[1:]):
i += 1
m = int(s)
dp1[i] = min(dp1[i-1] + m, dp2[i-1] + (m+1))
dp2[i] = min(dp1[i-1] + (10-m), dp2[i-1] + (10-m-1))
print(min(dp1[n-1], dp2[n-1]))
|
def s_in():
return input()
def n_in():
return int(input())
def l_in():
return list(map(int, input().split()))
class Interval():
def __init__(self, li):
self.li = li
self.n = len(li)
self.sum_li = [li[0]]
for i in range(1, self.n):
self.sum_li.append(self.sum_li[i-1] + li[i])
def sum(self, a, b=None):
if b is None:
return self.sum(0, a)
res = self.sum_li[min(self.n-1, b-1)]
if a > 0:
res -= self.sum_li[a-1]
return res
N = s_in()[::-1]
n = len(N)
dp1 = [0 for _ in range(n)]
dp1[0] = int(N[0])
# dp1[i] は i桁目を同じ値だけ使ったとしたときの最小値
dp2 = [0 for _ in range(n)]
dp2[0] = 10 - int(N[0])
# dp2[i] は i桁目を繰り上げたとしたときの最小値
for i, s in enumerate(N[1:]):
i += 1
m = int(s)
dp1[i] = min(dp1[i-1] + m, dp2[i-1] + (m+1))
dp2[i] = min(dp1[i-1] + (10-m), dp2[i-1] + (10-m-1))
# print(dp1)
# print( dp2)
print(min(dp1[n-1], dp2[n-1]+1))
|
[
"expression.operation.binary.add"
] | 572,855
| 572,856
|
u291278680
|
python
|
p02775
|
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
aa = x[0]
su = 1
for i in range(len(x)-1):
if aa != x[i+1]:
a.append([aa,su])
aa = x[i+1]
su = 1
else:
su += 1
a.append([aa,su])
return a
def jo(x): #listをスペースごとに分ける
return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
return max(map(max,x))
def In(x,a): #aがリスト(sorted)
k = bs.bisect_left(a,x)
if k != len(a) and a[k] == x:
return True
else:
return False
"""
def nibu(x,n,r):
ll = 0
rr = r
while True:
mid = (ll+rr)//2
if rr == mid:
return ll
if (ここに評価入れる):
rr = mid
else:
ll = mid+1
"""
n = input().split()[0]
le = len(n)
po = 0
co = 0
for i in range(le-1,-1,-1):
nu = int(n[i])
nu += co
if nu == 5:
if i != 0 and int(n[i-1]) + 1 >= 5:
co = 1
else:
co = 0
po += nu
elif nu > 5:
co = 1
po += 10 - nu
else:
co = 0
po += nu
print(po + co)
|
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
aa = x[0]
su = 1
for i in range(len(x)-1):
if aa != x[i+1]:
a.append([aa,su])
aa = x[i+1]
su = 1
else:
su += 1
a.append([aa,su])
return a
def jo(x): #listをスペースごとに分ける
return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
return max(map(max,x))
def In(x,a): #aがリスト(sorted)
k = bs.bisect_left(a,x)
if k != len(a) and a[k] == x:
return True
else:
return False
"""
def nibu(x,n,r):
ll = 0
rr = r
while True:
mid = (ll+rr)//2
if rr == mid:
return ll
if (ここに評価入れる):
rr = mid
else:
ll = mid+1
"""
n = input().split()[0]
le = len(n)
po = 0
co = 0
for i in range(le-1,-1,-1):
nu = int(n[i])
nu += co
if nu == 5:
if i != 0 and int(n[i-1]) + 1 > 5:
co = 1
else:
co = 0
po += nu
elif nu > 5:
co = 1
po += 10 - nu
else:
co = 0
po += nu
print(po + co)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 572,878
| 572,879
|
u807772568
|
python
|
p02775
|
N = [int(n) for n in input()]
dp = [[0] * 2 for _ in range(len(N) + 1)]
dp[0][1] = 1
for i, n in enumerate(N):
dp[i + 1][0] = min(dp[i][0] + n, dp[i][1] + (10 - n))
dp[i + 1][1] = min(dp[i][0] + (n + 1), dp[i][1] + (10 - (n + 1)))
print(dp)
print(dp[-1][0])
|
N = [int(n) for n in input()]
dp = [[0] * 2 for _ in range(len(N) + 1)]
dp[0][1] = 1
for i, n in enumerate(N):
dp[i + 1][0] = min(dp[i][0] + n, dp[i][1] + (10 - n))
dp[i + 1][1] = min(dp[i][0] + (n + 1), dp[i][1] + (10 - (n + 1)))
print(dp[-1][0])
|
[
"call.remove"
] | 572,880
| 572,881
|
u411203878
|
python
|
p02775
|
s = input(); n = len(s)
dp = [ [0,1>>32] for i in range(n+1) ]
for i in range(n):
d = ord(s[i])-ord('0')
dp[i+1][0] = min(dp[i][0], dp[i][1])+d
dp[i+1][1] = min(dp[i][0], dp[i][1]-2)+11-d
print(min(dp[n][0],dp[n][1]))
|
s = input(); n = len(s)
dp = [ [0,1<<32] for i in range(n+1) ]
for i in range(n):
d = ord(s[i])-ord('0')
dp[i+1][0] = min(dp[i][0], dp[i][1])+d
dp[i+1][1] = min(dp[i][0], dp[i][1]-2)+11-d
print(min(dp[n][0],dp[n][1]))
|
[
"assignment.value.change",
"expression.operation.binary.change"
] | 572,882
| 572,883
|
u128456980
|
python
|
p02775
|
S = input()[::-1]
l = len(S)
dp = [[0]*2 for _ in range(l+1)]
for i in range(l):
dp[i+1][0]=min(dp[i][0]+int(s[i]),dp[i][1]+int(s[i])+1)
if i!=0:
dp[i+1][1]=min(dp[i][0]+10-int(s[i]),dp[i][1]+10-(int(s[i])+1))
else:
dp[i+1][1]=dp[i][0]+10-int(s[i])
print(min(dp[-1][0],dp[-1][1]+1))
|
S = input()[::-1]
l = len(S)
dp = [[0]*2 for _ in range(l+1)]
for i in range(l):
dp[i+1][0]=min(dp[i][0]+int(S[i]),dp[i][1]+int(S[i])+1)
if i!=0:
dp[i+1][1]=min(dp[i][0]+10-int(S[i]),dp[i][1]+10-(int(S[i])+1))
else:
dp[i+1][1]=dp[i][0]+10-int(S[i])
print(min(dp[-1][0],dp[-1][1]+1))
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 572,900
| 572,901
|
u268554510
|
python
|
p02775
|
N = list(input())
N.reverse()
ans = 0
flag = False
L = len(N)
for i,s in enumerate(N):
n = int(s)
if flag:
n += 1
if n<5:
ans += n
flag = False
elif n>5:
ans += 10-n
flag = True
else:
if i==L-1:
ans += n
flag = False
if int(N[i+1])<5:
ans += n
flag = False
else:
ans += 10-n
flag = True
if flag:
ans += 1
print(ans)
|
N = list(input())
N.reverse()
ans = 0
flag = False
L = len(N)
for i,s in enumerate(N):
n = int(s)
if flag:
n += 1
if n<5:
ans += n
flag = False
elif n>5:
ans += 10-n
flag = True
else:
if i==L-1:
ans += n
flag = False
break
if int(N[i+1])<5:
ans += n
flag = False
else:
ans += 10-n
flag = True
if flag:
ans += 1
print(ans)
|
[
"control_flow.break.add"
] | 572,908
| 572,909
|
u698176039
|
python
|
p02775
|
# -*- coding: utf-8 -*-
def solve():
N = input()[::-1]+'0'
res = 0
c = 0
for i in range(len(N)-1):
r = int(N[i])+c
c = r//10
r %= 10
r_ = (int(N[i+1])+c)%10
if r < 5 or (r==5 and r_ < 5):
res += r
else:
res += 10-r
return str(res)
if __name__ == '__main__':
print(solve())
|
# -*- coding: utf-8 -*-
def solve():
N = input()[::-1]+'00'
res = 0
c = 0
for i in range(len(N)-1):
r = int(N[i])+c
c = r//10
r %= 10
r_ = (int(N[i+1])+c)%10
if r < 5 or (r==5 and r_ < 5):
res += r
else:
res += 10-r
c += 1
return str(res)
if __name__ == '__main__':
print(solve())
|
[
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 572,956
| 572,957
|
u667469290
|
python
|
p02775
|
n = input()[::-1]
print(n)
cnt = 0
flag = 0
for i in range(len(n)-1):
if int(n[i])+flag < 5:
cnt += int(n[i])+flag
flag = 0
elif int(n[i])+flag > 5:
cnt += (10-int(n[i])-flag)
flag = 1
else:
if int(n[i+1]) >= 5:
cnt += (10 - int(n[i])-flag)
flag = 1
else:
cnt += (int(n[i]) + flag)
flag = 0
if int(n[-1])+flag > 5:
cnt += (11 - int(n[-1])-flag)
else:
cnt += int(n[-1])+flag
print(cnt)
|
n = input()[::-1]
cnt = 0
flag = 0
for i in range(len(n)-1):
if int(n[i])+flag < 5:
cnt += int(n[i])+flag
flag = 0
elif int(n[i])+flag > 5:
cnt += (10-int(n[i])-flag)
flag = 1
else:
if int(n[i+1]) >= 5:
cnt += (10 - int(n[i])-flag)
flag = 1
else:
cnt += (int(n[i]) + flag)
flag = 0
if int(n[-1])+flag > 5:
cnt += (11 - int(n[-1])-flag)
else:
cnt += int(n[-1])+flag
print(cnt)
|
[
"call.remove"
] | 572,962
| 572,963
|
u912115033
|
python
|
p02775
|
n=input()
keta=[0]
for i in range(len(n)):
keta.append(int(n[i]))
ans=0
for i in range(len(keta)-1):
if keta[-i-2]>=5:
if keta[-i-1]>=5:
ans+=10-keta[-i-1]
keta[-i-2]+=1
else:
ans+=keta[-i-1]
else:
if keta[-i-1]>=6:
ans+=10-keta[-i-1]
keta[-i-2]+=1
else:
ans+=keta[-i-1]
print(ans)
|
n=input()
keta=[0,0]
for i in range(len(n)):
keta.append(int(n[i]))
ans=0
for i in range(len(keta)-1):
if keta[-i-2]>=5:
if keta[-i-1]>=5:
ans+=10-keta[-i-1]
keta[-i-2]+=1
else:
ans+=keta[-i-1]
else:
if keta[-i-1]>=6:
ans+=10-keta[-i-1]
keta[-i-2]+=1
else:
ans+=keta[-i-1]
print(ans)
|
[] | 572,964
| 572,965
|
u296150111
|
python
|
p02775
|
n = list(map(int, input()))
dp = (0, 1)
for i in n:
dp = (min(dp[0] + i, dp[1] + 10 - i), min(dp[0] + i + 1, dp[1] + 9 - i))
print(dp)
print(dp[0])
|
n = list(map(int, input()))
dp = (0, 1)
for i in n:
dp = (min(dp[0] + i, dp[1] + 10 - i), min(dp[0] + i + 1, dp[1] + 9 - i))
print(dp[0])
|
[
"call.remove"
] | 573,002
| 573,003
|
u853819426
|
python
|
p02775
|
#!/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
L=list(map(int,input())); n=len(L)
L.reverse();L.append(0)
for i in range(n):
if L[i] >= 6:
count += 10-L[i]
L[i] = 0; L[i+1] += 1
elif L[i] == 5 and L[i+1] == 5:
count += 10-L[i]
L[i] = 0; L[i+1] += 1
print(count + sum(L))
# print(L)
|
#!/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
L=list(map(int,input())); n=len(L)
L.reverse();L.append(0)
for i in range(n):
if L[i] >= 6:
count += 10-L[i]
L[i] = 0; L[i+1] += 1
elif L[i] == 5 and L[i+1] >= 5:
count += 10-L[i]
L[i] = 0; L[i+1] += 1
print(count + sum(L))
# print(L)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 573,006
| 573,007
|
u716530146
|
python
|
p02775
|
def main():
n = input()[::-1] + "0"
s = 0
cnt = 0
for i, ni in enumerate(n[:-1]):
k = int(ni) + s
if k < 5 or k == 5 and int(n[i + 1]) <= 5:
cnt += k
s = 0
else:
cnt += 10 - k
s = 1
cnt += s
print(cnt)
if __name__ == '__main__':
main()
|
def main():
n = input()[::-1] + "0"
s = 0
cnt = 0
for i, ni in enumerate(n[:-1]):
k = int(ni) + s
if k < 5 or k == 5 and int(n[i + 1]) < 5:
cnt += k
s = 0
else:
cnt += 10 - k
s = 1
cnt += s
print(cnt)
if __name__ == '__main__':
main()
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 573,008
| 573,009
|
u219197917
|
python
|
p02775
|
N = ("00"+input())[::-1]
ans = 0
carry = 0
for i in range(len(N)-1):
n = int(N[i])
nextn = int(N[i+1])
if carry == 1:
carry = 0
n += 1
if n <=4:
ans += n
elif n >= 6:
ans += 10-n
carry = 1
else: # n==5
if nextn <= 6:
ans += n
else:
ans += 10-n
carry = 1
print(ans)
|
N = ("00"+input())[::-1]
ans = 0
carry = 0
for i in range(len(N)-1):
n = int(N[i])
nextn = int(N[i+1])
if carry == 1:
carry = 0
n += 1
if n <=4:
ans += n
elif n >= 6:
ans += 10-n
carry = 1
else: # n==5
if nextn <= 4:
ans += n
else:
ans += 10-n
carry = 1
print(ans)
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 573,013
| 573,014
|
u281303342
|
python
|
p02775
|
N = ("0"+input())[::-1]
ans = 0
carry = 0
for i in range(len(N)-1):
n = int(N[i])
nextn = int(N[i+1])
if carry == 1:
carry = 0
n += 1
if n <=4:
ans += n
elif n >= 6:
ans += 10-n
carry = 1
else: # n==5
if nextn <= 4:
ans += n
else:
ans += 10-n
carry = 1
print(ans)
|
N = ("00"+input())[::-1]
ans = 0
carry = 0
for i in range(len(N)-1):
n = int(N[i])
nextn = int(N[i+1])
if carry == 1:
carry = 0
n += 1
if n <=4:
ans += n
elif n >= 6:
ans += 10-n
carry = 1
else: # n==5
if nextn <= 4:
ans += n
else:
ans += 10-n
carry = 1
print(ans)
|
[
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 573,015
| 573,014
|
u281303342
|
python
|
p02775
|
# -*- 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 range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
S = input()
S = S[::-1]
N = len(S)
dp0 = [INF] * (N+1)
dp1 = [INF] * (N+1)
dp0[0] = 0
for i, s in enumerate(S):
s = int(s)
dp0[i+1] = min(dp0[i+1], dp0[i] + s)
dp1[i+1] = min(dp1[i+1], dp0[i] + 10-s)
dp0[i+1] = min(dp0[i+1], dp1[i] + (s+1)%10)
dp1[i+1] = min(dp1[i+1], dp1[i] + 10-(s+1)%10)
ans = min(dp0[N], dp1[N]+1)
print(ans)
|
# -*- 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 range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
S = input()
S = S[::-1]
N = len(S)
dp0 = [INF] * (N+1)
dp1 = [INF] * (N+1)
dp0[0] = 0
for i, s in enumerate(S):
s = int(s)
dp0[i+1] = min(dp0[i+1], dp0[i] + s)
dp1[i+1] = min(dp1[i+1], dp0[i] + 10-s)
dp0[i+1] = min(dp0[i+1], dp1[i] + (s+1))
dp1[i+1] = min(dp1[i+1], dp1[i] + 10-(s+1))
ans = min(dp0[N], dp1[N]+1)
print(ans)
|
[
"expression.operation.binary.remove"
] | 573,021
| 573,022
|
u588341295
|
python
|
p02775
|
n = list(reversed([0]+list(map(int, input()))))
ans = 0
for i in range(len(n)):
if n[i] < 5 or (n[i]==5 and n[i]<5):
ans += n[i]
else:
ans += 10 - n[i]
n[i+1] += 1
print(ans)
|
n = list(reversed([0]+list(map(int, input()))))
ans = 0
for i in range(len(n)):
if n[i] < 5 or (n[i]==5 and n[i+1]<5):
ans += n[i]
else:
ans += 10 - n[i]
n[i+1] += 1
print(ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 573,029
| 573,030
|
u693378622
|
python
|
p02775
|
s=input()
a=0
b=0
c=len(s)
s='0'+s
s=s[::-1]
d=0
for i in range(c):
if 0<b:
if 4<int(s[i])+1:
if 5==int(s[i])+1 and int(s[i+1])<5:
a+=5
b=0
else:
a+=(9-int(s[i]))
else:
a+=(int(s[i])+1)
b=0
else:
if 4<int(s[i]):
if int(s[i])==5 and int(s[i+1])<5:
a+=5
else:
b+=1
a+=(10-int(s[i]))
else:
a+=int(s[i])
print(a)
|
s=input()
a=0
b=0
c=len(s)
s='0'+s
s=s[::-1]
d=0
for i in range(c+1):
if 0<b:
if 4<int(s[i])+1:
if 5==int(s[i])+1 and int(s[i+1])<5:
a+=5
b=0
else:
a+=(9-int(s[i]))
else:
a+=(int(s[i])+1)
b=0
else:
if 4<int(s[i]):
if int(s[i])==5 and int(s[i+1])<5:
a+=5
else:
b+=1
a+=(10-int(s[i]))
else:
a+=int(s[i])
print(a)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 573,041
| 573,042
|
u917558625
|
python
|
p02775
|
N=list(input())
N.insert(0,0)
ans=0
for i in range(len(N)-1,-1,-1):
n=int(N[i])
if n//10>=1:
N[i-1]=str(int(N[i-1])+1)
continue
if n==5:
if int(N[i-1])>=4:
N[i-1]=str(int(N[i-1])+1)
ans+=5
elif n>=6:
ans+=10-n
N[i-1]=str(int(N[i-1])+1)
else:
ans+=n
print(ans)
|
N=list(input())
N.insert(0,0)
ans=0
for i in range(len(N)-1,-1,-1):
n=int(N[i])
if n//10>=1:
N[i-1]=str(int(N[i-1])+1)
continue
if n==5:
if int(N[i-1])>=5:
N[i-1]=str(int(N[i-1])+1)
ans+=5
elif n>=6:
ans+=10-n
N[i-1]=str(int(N[i-1])+1)
else:
ans+=n
print(ans)
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 573,043
| 573,044
|
u625963200
|
python
|
p02775
|
N=list(input())
N.insert(0,0)
ans=0
for i in range(len(N)-1,-1,-1):
n=int(N[i])
if n//10>=1:
N[i-1]=str(int(N[i-1])+1)
continue
if n==5:
if int(N[i-1])>=4:
N[i-1]=str(int(N[i-1])+1)
ans+=5
elif n>=10-n:
ans+=10-n
N[i-1]=str(int(N[i-1])+1)
else:
ans+=n
print(ans)
|
N=list(input())
N.insert(0,0)
ans=0
for i in range(len(N)-1,-1,-1):
n=int(N[i])
if n//10>=1:
N[i-1]=str(int(N[i-1])+1)
continue
if n==5:
if int(N[i-1])>=5:
N[i-1]=str(int(N[i-1])+1)
ans+=5
elif n>=6:
ans+=10-n
N[i-1]=str(int(N[i-1])+1)
else:
ans+=n
print(ans)
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 573,045
| 573,044
|
u625963200
|
python
|
p02775
|
N = list(input())
ans = 0
temp = [0] + [int(n) for n in N]
for i in reversed(range(1, len(N)+1)):
if temp[i] < 5 or (temp[i] == 5 and temp[i-1] < 4):
ans += temp[i]
else:
temp[i-1] += 1
ans += (10 - temp[i])
temp[i] = 0
ans += temp[0]
print(ans)
|
N = list(input())
ans = 0
temp = [0] + [int(n) for n in N]
for i in reversed(range(1, len(N)+1)):
if temp[i] < 5 or (temp[i] == 5 and temp[i-1] < 5):
ans += temp[i]
else:
temp[i-1] += 1
ans += (10 - temp[i])
temp[i] = 0
ans += temp[0]
print(ans)
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 573,050
| 573,051
|
u497046426
|
python
|
p02775
|
N = list(input())
ans = 0
temp = [0] + [int(n) for n in N]
for i in reversed(range(1, len(N)+1)):
if temp[i] < 5 or (temp[i] == 5 and temp[i+1] < 4):
ans += temp[i]
else:
temp[i+1] += 1
ans += (10 - temp[i])
temp[i] = 0
ans += temp[0]
print(ans)
|
N = list(input())
ans = 0
temp = [0] + [int(n) for n in N]
for i in reversed(range(1, len(N)+1)):
if temp[i] < 5 or (temp[i] == 5 and temp[i-1] < 5):
ans += temp[i]
else:
temp[i-1] += 1
ans += (10 - temp[i])
temp[i] = 0
ans += temp[0]
print(ans)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.number.integer.change",
"expression.operation.binary.change"
] | 573,052
| 573,051
|
u497046426
|
python
|
p02775
|
n = list(map(int, list(input())))
m = len(n)
DP = [[float("inf")]*2 for i in range(m+1)]
DP[0] = [0,1]
for i in range(m):
# tight
tmp = float("inf")
for j in range(10):
if j == 0:
tmp = min(tmp, DP[i][1]+9-n[i])
elif j <= n[i]:
tmp = min(tmp, DP[i][1]+j+10+j-1-n[i])
else:
tmp = min(tmp, DP[i][0]+j+j-1-n[i])
DP[i+1][1] = tmp
# not tight
tmp = float("inf")
for j in range(10):
if j < n[i]:
tmp = min(tmp, DP[i][1]+j+(10+j)-n[i])
else:
tmp = min(tmp, DP[i][0]+j+j-n[i])
DP[i+1][0] = tmp
print(min(DP[-1]))
|
n = list(map(int, list(input())))
m = len(n)
DP = [[float("inf")]*2 for i in range(m+1)]
DP[0] = [0,1]
for i in range(m):
# tight
tmp = float("inf")
for j in range(10):
if j == 0:
tmp = min(tmp, DP[i][1]+9-n[i])
elif j <= n[i]:
tmp = min(tmp, DP[i][1]+j+10+j-1-n[i])
else:
tmp = min(tmp, DP[i][0]+j+j-1-n[i])
DP[i+1][1] = tmp
# not tight
tmp = float("inf")
for j in range(10):
if j < n[i]:
tmp = min(tmp, DP[i][1]+j+(10+j)-n[i])
else:
tmp = min(tmp, DP[i][0]+j+j-n[i])
DP[i+1][0] = tmp
print(DP[-1][0])
|
[
"call.arguments.change",
"io.output.change"
] | 573,067
| 573,068
|
u803848678
|
python
|
p02775
|
N = [int(x) for x in input()]
def solve(N):
# n円の場合、n+1円の場合
# 繰り上げる方がいいのか繰り上げない方がいいのか判断している
dp = 0, 1
print(dp)
for n in N:
# 繰り上げた方が小さいのか繰り上げない方が小さいのか
a = min(dp[0] + n, dp[1] + 10 - n)
# 一個下の位を繰り上げた場合に、今の位までにかかる枚数
b = min(dp[0] + n + 1, dp[1] + 10 - (n + 1))
dp = a, b
return dp[0]
print(solve(N))
|
N = [int(x) for x in input()]
def solve(N):
# n円の場合、n+1円の場合
# 繰り上げる方がいいのか繰り上げない方がいいのか判断している
dp = 0, 1
for n in N:
# 繰り上げた方が小さいのか繰り上げない方が小さいのか
a = min(dp[0] + n, dp[1] + 10 - n)
# 一個下の位を繰り上げた場合に、今の位までにかかる枚数
b = min(dp[0] + n + 1, dp[1] + 10 - (n + 1))
dp = a, b
return dp[0]
print(solve(N))
|
[
"call.remove"
] | 573,073
| 573,074
|
u977193988
|
python
|
p02775
|
n = str(input())[::-1]
n = "0" + n
l = len(n)
ans = 0
flg = 0
check = 0
for i in range(l):
check = int(n[i])
check += flg
if check == 5:
if int(n[i + 1]) >= 5:
ans += 5
flg = 1
else:
ans += 5
flg = 0
elif check > 5:
ans += 10 - check
flg = 1
else:
ans += check
flg = 0
print(ans + flg)
|
n = str(input())[::-1]
n = n + "0"
l = len(n)
ans = 0
flg = 0
check = 0
for i in range(l):
check = int(n[i])
check += flg
if check == 5:
if int(n[i + 1]) >= 5:
ans += 5
flg = 1
else:
ans += 5
flg = 0
elif check > 5:
ans += 10 - check
flg = 1
else:
ans += check
flg = 0
print(ans + flg)
|
[
"expression.operation.binary.remove"
] | 573,075
| 573,076
|
u977193988
|
python
|
p02775
|
n=input()
m=list(n)
l=[int(i) for i in m]
l.reverse()
l.append(0)
k=l
ans=0
for i in range(len(l)):
if k[i]<5:
ans+=k[i]
elif k[i]==5:
if k[i+1]>5:
k[i+1]+=1
ans+=5
else:
ans+=10-k[i]
k[i+1]+=1
print(ans)
|
n=input()
m=list(n)
l=[int(i) for i in m]
l.reverse()
l.append(0)
k=l
ans=0
for i in range(len(l)):
if k[i]<5:
ans+=k[i]
elif k[i]==5:
if k[i+1]>=5:
k[i+1]+=1
ans+=5
else:
ans+=10-k[i]
k[i+1]+=1
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 573,082
| 573,083
|
u672542358
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.