user_id
stringlengths 10
10
| problem_id
stringlengths 6
6
| language
stringclasses 1
value | submission_id_v0
stringlengths 10
10
| submission_id_v1
stringlengths 10
10
| cpu_time_v0
int64 10
38.3k
| cpu_time_v1
int64 0
24.7k
| memory_v0
int64 2.57k
1.02M
| memory_v1
int64 2.57k
869k
| status_v0
stringclasses 1
value | status_v1
stringclasses 1
value | improvement_frac
float64 7.51
100
| input
stringlengths 20
4.55k
| target
stringlengths 17
3.34k
| code_v0_loc
int64 1
148
| code_v1_loc
int64 1
184
| code_v0_num_chars
int64 13
4.55k
| code_v1_num_chars
int64 14
3.34k
| code_v0_no_empty_lines
stringlengths 21
6.88k
| code_v1_no_empty_lines
stringlengths 20
4.93k
| code_same
bool 1
class | relative_loc_diff_percent
float64 0
79.8
| diff
list | diff_only_import_comment
bool 1
class | measured_runtime_v0
float64 0.01
4.45
| measured_runtime_v1
float64 0.01
4.31
| runtime_lift
float64 0
359
| key
list |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u163320134 | p02720 | python | s182643656 | s705498941 | 157 | 108 | 15,108 | 15,144 | Accepted | Accepted | 31.21 | k=int(eval(input()))
cand=[[1,2,3,4,5,6,7,8,9]]
for _ in range(9):
tmp=[]
for val in cand[-1]:
s=str(val)
if s[-1]=='0':
tmp.append(val*10)
tmp.append(val*10+1)
elif s[-1]=='9':
tmp.append(val*10+8)
tmp.append(val*10+9)
else:
tmp.append(val*10+(int(s[-1])-1))
tmp.append(val*10+(int(s[-1])))
tmp.append(val*10+(int(s[-1])+1))
cand.append(tmp)
ans=[]
for i in range(len(cand)):
for val in cand[i]:
ans.append(val)
ans=sorted(ans)
print((ans[k-1])) | k=int(eval(input()))
cand=[[1,2,3,4,5,6,7,8,9]]
for _ in range(9):
tmp=[]
for val in cand[-1]:
if val%10!=0:
tmp.append(val*10+(val%10-1))
tmp.append(val*10+(val%10))
if val%10!=9:
tmp.append(val*10+(val%10+1))
cand.append(tmp)
ans=[]
for i in range(len(cand)):
for val in cand[i]:
ans.append(val)
ans=sorted(ans)
print((ans[k-1])) | 23 | 17 | 600 | 375 | k = int(eval(input()))
cand = [[1, 2, 3, 4, 5, 6, 7, 8, 9]]
for _ in range(9):
tmp = []
for val in cand[-1]:
s = str(val)
if s[-1] == "0":
tmp.append(val * 10)
tmp.append(val * 10 + 1)
elif s[-1] == "9":
tmp.append(val * 10 + 8)
tmp.append(val * 10 + 9)
else:
tmp.append(val * 10 + (int(s[-1]) - 1))
tmp.append(val * 10 + (int(s[-1])))
tmp.append(val * 10 + (int(s[-1]) + 1))
cand.append(tmp)
ans = []
for i in range(len(cand)):
for val in cand[i]:
ans.append(val)
ans = sorted(ans)
print((ans[k - 1]))
| k = int(eval(input()))
cand = [[1, 2, 3, 4, 5, 6, 7, 8, 9]]
for _ in range(9):
tmp = []
for val in cand[-1]:
if val % 10 != 0:
tmp.append(val * 10 + (val % 10 - 1))
tmp.append(val * 10 + (val % 10))
if val % 10 != 9:
tmp.append(val * 10 + (val % 10 + 1))
cand.append(tmp)
ans = []
for i in range(len(cand)):
for val in cand[i]:
ans.append(val)
ans = sorted(ans)
print((ans[k - 1]))
| false | 26.086957 | [
"- s = str(val)",
"- if s[-1] == \"0\":",
"- tmp.append(val * 10)",
"- tmp.append(val * 10 + 1)",
"- elif s[-1] == \"9\":",
"- tmp.append(val * 10 + 8)",
"- tmp.append(val * 10 + 9)",
"- else:",
"- tmp.append(val * 10 + (int(s[-1]) - 1))",
"- tmp.append(val * 10 + (int(s[-1])))",
"- tmp.append(val * 10 + (int(s[-1]) + 1))",
"+ if val % 10 != 0:",
"+ tmp.append(val * 10 + (val % 10 - 1))",
"+ tmp.append(val * 10 + (val % 10))",
"+ if val % 10 != 9:",
"+ tmp.append(val * 10 + (val % 10 + 1))"
] | false | 0.17616 | 0.138456 | 1.272313 | [
"s182643656",
"s705498941"
] |
u358919705 | p00024 | python | s484546571 | s058950876 | 30 | 20 | 7,508 | 7,368 | Accepted | Accepted | 33.33 | import math
while True:
try:
v = float(eval(input()))
except:
break
print((math.floor(v ** 2 / 98 + 2))) | while 1:
try:print((int(float(eval(input()))**2/98+2)))
except:break | 7 | 3 | 130 | 68 | import math
while True:
try:
v = float(eval(input()))
except:
break
print((math.floor(v**2 / 98 + 2)))
| while 1:
try:
print((int(float(eval(input())) ** 2 / 98 + 2)))
except:
break
| false | 57.142857 | [
"-import math",
"-",
"-while True:",
"+while 1:",
"- v = float(eval(input()))",
"+ print((int(float(eval(input())) ** 2 / 98 + 2)))",
"- print((math.floor(v**2 / 98 + 2)))"
] | false | 0.066038 | 0.039173 | 1.685789 | [
"s484546571",
"s058950876"
] |
u268210555 | p03229 | python | s634916540 | s579106346 | 305 | 223 | 10,520 | 7,504 | Accepted | Accepted | 26.89 | from collections import *
a = sorted(int(eval(input())) for _ in range(int(eval(input()))))
q = deque(a)
rq = deque([q.popleft()])
while q:
rq.appendleft(q.pop())
if q:
rq.append(q.pop())
if q:
rq.appendleft(q.popleft())
if q:
rq.append(q.popleft())
r1 = sum(abs(i-j) for i, j in zip(rq, list(rq)[1:]))
q = deque(a[::-1])
rq = deque([q.popleft()])
while q:
rq.appendleft(q.pop())
if q:
rq.append(q.pop())
if q:
rq.appendleft(q.popleft())
if q:
rq.append(q.popleft())
r2 = sum(abs(i-j) for i, j in zip(rq, list(rq)[1:]))
print((max(r1, r2))) | n = int(eval(input()))
a = sorted(int(eval(input())) for _ in range(n))
if n == 2:
print((abs(a[0] - a[1])))
elif n%2 == 1:
r1 = a[n//2] + a[n//2+1] + sum(a[n//2+2:])*2 - sum(a[:n//2])*2
r2 = sum(a[n//2+1:])*2 - sum(a[:n//2-1])*2 - a[n//2-1] - a[n//2]
print((max(r1, r2)))
else:
r1 = sum(a[n//2+1:])*2 + a[n//2] - sum(a[:n//2-1])*2 - a[n//2-1]
print(r1) | 26 | 11 | 636 | 371 | from collections import *
a = sorted(int(eval(input())) for _ in range(int(eval(input()))))
q = deque(a)
rq = deque([q.popleft()])
while q:
rq.appendleft(q.pop())
if q:
rq.append(q.pop())
if q:
rq.appendleft(q.popleft())
if q:
rq.append(q.popleft())
r1 = sum(abs(i - j) for i, j in zip(rq, list(rq)[1:]))
q = deque(a[::-1])
rq = deque([q.popleft()])
while q:
rq.appendleft(q.pop())
if q:
rq.append(q.pop())
if q:
rq.appendleft(q.popleft())
if q:
rq.append(q.popleft())
r2 = sum(abs(i - j) for i, j in zip(rq, list(rq)[1:]))
print((max(r1, r2)))
| n = int(eval(input()))
a = sorted(int(eval(input())) for _ in range(n))
if n == 2:
print((abs(a[0] - a[1])))
elif n % 2 == 1:
r1 = a[n // 2] + a[n // 2 + 1] + sum(a[n // 2 + 2 :]) * 2 - sum(a[: n // 2]) * 2
r2 = sum(a[n // 2 + 1 :]) * 2 - sum(a[: n // 2 - 1]) * 2 - a[n // 2 - 1] - a[n // 2]
print((max(r1, r2)))
else:
r1 = sum(a[n // 2 + 1 :]) * 2 + a[n // 2] - sum(a[: n // 2 - 1]) * 2 - a[n // 2 - 1]
print(r1)
| false | 57.692308 | [
"-from collections import *",
"-",
"-a = sorted(int(eval(input())) for _ in range(int(eval(input()))))",
"-q = deque(a)",
"-rq = deque([q.popleft()])",
"-while q:",
"- rq.appendleft(q.pop())",
"- if q:",
"- rq.append(q.pop())",
"- if q:",
"- rq.appendleft(q.popleft())",
"- if q:",
"- rq.append(q.popleft())",
"-r1 = sum(abs(i - j) for i, j in zip(rq, list(rq)[1:]))",
"-q = deque(a[::-1])",
"-rq = deque([q.popleft()])",
"-while q:",
"- rq.appendleft(q.pop())",
"- if q:",
"- rq.append(q.pop())",
"- if q:",
"- rq.appendleft(q.popleft())",
"- if q:",
"- rq.append(q.popleft())",
"-r2 = sum(abs(i - j) for i, j in zip(rq, list(rq)[1:]))",
"-print((max(r1, r2)))",
"+n = int(eval(input()))",
"+a = sorted(int(eval(input())) for _ in range(n))",
"+if n == 2:",
"+ print((abs(a[0] - a[1])))",
"+elif n % 2 == 1:",
"+ r1 = a[n // 2] + a[n // 2 + 1] + sum(a[n // 2 + 2 :]) * 2 - sum(a[: n // 2]) * 2",
"+ r2 = sum(a[n // 2 + 1 :]) * 2 - sum(a[: n // 2 - 1]) * 2 - a[n // 2 - 1] - a[n // 2]",
"+ print((max(r1, r2)))",
"+else:",
"+ r1 = sum(a[n // 2 + 1 :]) * 2 + a[n // 2] - sum(a[: n // 2 - 1]) * 2 - a[n // 2 - 1]",
"+ print(r1)"
] | false | 0.05768 | 0.233965 | 0.246535 | [
"s634916540",
"s579106346"
] |
u590562943 | p02953 | python | s882803965 | s957670767 | 83 | 61 | 14,224 | 14,396 | Accepted | Accepted | 26.51 | N = int(eval(input()))
H = list(map(int, input().split()))
for i in range(1,N):
diff = H[i] - H[i-1]
if diff > 0:
H[i] -= 1
if diff < 0:
print('No')
exit()
print('Yes') | N = int(eval(input()))
H = list(map(int, input().split()))
pre = None
for i in H[::-1]:
if pre == None:
pre = i
continue
elif i < pre:
pre = i
continue
elif i <= pre+1:
continue
print('No')
exit()
print('Yes') | 10 | 15 | 189 | 247 | N = int(eval(input()))
H = list(map(int, input().split()))
for i in range(1, N):
diff = H[i] - H[i - 1]
if diff > 0:
H[i] -= 1
if diff < 0:
print("No")
exit()
print("Yes")
| N = int(eval(input()))
H = list(map(int, input().split()))
pre = None
for i in H[::-1]:
if pre == None:
pre = i
continue
elif i < pre:
pre = i
continue
elif i <= pre + 1:
continue
print("No")
exit()
print("Yes")
| false | 33.333333 | [
"-for i in range(1, N):",
"- diff = H[i] - H[i - 1]",
"- if diff > 0:",
"- H[i] -= 1",
"- if diff < 0:",
"- print(\"No\")",
"- exit()",
"+pre = None",
"+for i in H[::-1]:",
"+ if pre == None:",
"+ pre = i",
"+ continue",
"+ elif i < pre:",
"+ pre = i",
"+ continue",
"+ elif i <= pre + 1:",
"+ continue",
"+ print(\"No\")",
"+ exit()"
] | false | 0.143193 | 0.089102 | 1.607068 | [
"s882803965",
"s957670767"
] |
u970308980 | p03329 | python | s068968404 | s119103192 | 762 | 640 | 3,864 | 3,864 | Accepted | Accepted | 16.01 | # 配るDP
N = int(eval(input()))
INF = 10 ** 5 + 1
dp = [INF for _ in range(N + 1)]
dp[0] = 0
for n in range(N):
power = 1
while n + power <= N:
dp[n + power] = min(dp[n + power], dp[n] + 1)
power *= 6
power = 1
while n + power <= N:
dp[n + power] = min(dp[n + power], dp[n] + 1)
power *= 9
print((dp[N]))
| # 貰うDP
N = int(eval(input()))
INF = 10 ** 5 + 1
dp = [INF for _ in range(N + 1)]
dp[0] = 0
for n in range(N + 1):
power = 1
while power <= n:
dp[n] = min(dp[n], dp[n - power] + 1)
power *= 6
power = 1
while power <= n:
dp[n] = min(dp[n], dp[n - power] + 1)
power *= 9
print((dp[N]))
| 20 | 20 | 367 | 347 | # 配るDP
N = int(eval(input()))
INF = 10**5 + 1
dp = [INF for _ in range(N + 1)]
dp[0] = 0
for n in range(N):
power = 1
while n + power <= N:
dp[n + power] = min(dp[n + power], dp[n] + 1)
power *= 6
power = 1
while n + power <= N:
dp[n + power] = min(dp[n + power], dp[n] + 1)
power *= 9
print((dp[N]))
| # 貰うDP
N = int(eval(input()))
INF = 10**5 + 1
dp = [INF for _ in range(N + 1)]
dp[0] = 0
for n in range(N + 1):
power = 1
while power <= n:
dp[n] = min(dp[n], dp[n - power] + 1)
power *= 6
power = 1
while power <= n:
dp[n] = min(dp[n], dp[n - power] + 1)
power *= 9
print((dp[N]))
| false | 0 | [
"-# 配るDP",
"+# 貰うDP",
"-for n in range(N):",
"+for n in range(N + 1):",
"- while n + power <= N:",
"- dp[n + power] = min(dp[n + power], dp[n] + 1)",
"+ while power <= n:",
"+ dp[n] = min(dp[n], dp[n - power] + 1)",
"- while n + power <= N:",
"- dp[n + power] = min(dp[n + power], dp[n] + 1)",
"+ while power <= n:",
"+ dp[n] = min(dp[n], dp[n - power] + 1)"
] | false | 0.100171 | 0.388113 | 0.258097 | [
"s068968404",
"s119103192"
] |
u562935282 | p02754 | python | s261265045 | s660371213 | 21 | 17 | 3,316 | 2,940 | Accepted | Accepted | 19.05 | def main():
N, A, B = list(map(int, input().split()))
ret = 0
rep, rest = divmod(N, A + B)
ret += rep * A
ret += min(A, rest)
print(ret)
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
| def main():
N, A, B = list(map(int, input().split()))
AB = A + B
q, r = divmod(N, AB)
print((A * q + min(r, A)))
if __name__ == '__main__':
main()
| 22 | 10 | 352 | 171 | def main():
N, A, B = list(map(int, input().split()))
ret = 0
rep, rest = divmod(N, A + B)
ret += rep * A
ret += min(A, rest)
print(ret)
if __name__ == "__main__":
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
| def main():
N, A, B = list(map(int, input().split()))
AB = A + B
q, r = divmod(N, AB)
print((A * q + min(r, A)))
if __name__ == "__main__":
main()
| false | 54.545455 | [
"- ret = 0",
"- rep, rest = divmod(N, A + B)",
"- ret += rep * A",
"- ret += min(A, rest)",
"- print(ret)",
"+ AB = A + B",
"+ q, r = divmod(N, AB)",
"+ print((A * q + min(r, A)))",
"-# import sys",
"-#",
"-# sys.setrecursionlimit(10 ** 7)",
"-#",
"-# input = sys.stdin.readline",
"-# rstrip()",
"-# int(input())",
"-# map(int, input().split())"
] | false | 0.039712 | 0.039101 | 1.015629 | [
"s261265045",
"s660371213"
] |
u581187895 | p03003 | python | s967495192 | s550158060 | 381 | 266 | 104,540 | 14,536 | Accepted | Accepted | 30.18 | # 両方の数列から同じ部分列がいくつあるか？
MOD = 10**9+7
N, M = list(map(int, input().split()))
S = [0] + list(map(int, input().split()))
T = [0] + list(map(int, input().split()))
# 最後に(n,m)でとる
dp = [[0]*(M+1) for _ in range(N+1)]
# 2次元累積和、(n,m) inclusive.
dp_cum = [[0]*(M+1) for _ in range(N+1)]
# empty
dp[0][0] = 1
dp_cum[0][0] = 1
for n in range(N+1):
dp_cum[n][0] = 1
for m in range(M+1):
dp_cum[0][m] = 1
for n in range(1, N+1):
for m in range(1, M+1):
if S[n] != T[m]:
dp[n][m] = 0
else:
# (n-1, m-1)までで作れてるやつから飛んでくる
dp[n][m] = dp_cum[n-1][m-1]
dp_cum[n][m] = dp_cum[n-1][m] + dp_cum[n][m-1] - dp_cum[n-1][m-1] + dp[n][m]
dp_cum[n][m] %= MOD
answer = dp_cum[N][M]
print(answer)
| # 両方の数列から同じ部分列がいくつあるか？
import numpy as np
MOD = 10**9+7
N, M = list(map(int, input().split()))
S = input().split()
T = np.array(input().split(), dtype=np.int32)
dp = np.ones(M+1, dtype=np.int64)
for s in S:
dp[1:] = ((dp[:-1] * (T == int(s))).cumsum() + dp[1:]) % MOD
print((dp[M]))
| 33 | 14 | 756 | 294 | # 両方の数列から同じ部分列がいくつあるか？
MOD = 10**9 + 7
N, M = list(map(int, input().split()))
S = [0] + list(map(int, input().split()))
T = [0] + list(map(int, input().split()))
# 最後に(n,m)でとる
dp = [[0] * (M + 1) for _ in range(N + 1)]
# 2次元累積和、(n,m) inclusive.
dp_cum = [[0] * (M + 1) for _ in range(N + 1)]
# empty
dp[0][0] = 1
dp_cum[0][0] = 1
for n in range(N + 1):
dp_cum[n][0] = 1
for m in range(M + 1):
dp_cum[0][m] = 1
for n in range(1, N + 1):
for m in range(1, M + 1):
if S[n] != T[m]:
dp[n][m] = 0
else:
# (n-1, m-1)までで作れてるやつから飛んでくる
dp[n][m] = dp_cum[n - 1][m - 1]
dp_cum[n][m] = (
dp_cum[n - 1][m] + dp_cum[n][m - 1] - dp_cum[n - 1][m - 1] + dp[n][m]
)
dp_cum[n][m] %= MOD
answer = dp_cum[N][M]
print(answer)
| # 両方の数列から同じ部分列がいくつあるか？
import numpy as np
MOD = 10**9 + 7
N, M = list(map(int, input().split()))
S = input().split()
T = np.array(input().split(), dtype=np.int32)
dp = np.ones(M + 1, dtype=np.int64)
for s in S:
dp[1:] = ((dp[:-1] * (T == int(s))).cumsum() + dp[1:]) % MOD
print((dp[M]))
| false | 57.575758 | [
"+import numpy as np",
"+",
"-S = [0] + list(map(int, input().split()))",
"-T = [0] + list(map(int, input().split()))",
"-# 最後に(n,m)でとる",
"-dp = [[0] * (M + 1) for _ in range(N + 1)]",
"-# 2次元累積和、(n,m) inclusive.",
"-dp_cum = [[0] * (M + 1) for _ in range(N + 1)]",
"-# empty",
"-dp[0][0] = 1",
"-dp_cum[0][0] = 1",
"-for n in range(N + 1):",
"- dp_cum[n][0] = 1",
"-for m in range(M + 1):",
"- dp_cum[0][m] = 1",
"-for n in range(1, N + 1):",
"- for m in range(1, M + 1):",
"- if S[n] != T[m]:",
"- dp[n][m] = 0",
"- else:",
"- # (n-1, m-1)までで作れてるやつから飛んでくる",
"- dp[n][m] = dp_cum[n - 1][m - 1]",
"- dp_cum[n][m] = (",
"- dp_cum[n - 1][m] + dp_cum[n][m - 1] - dp_cum[n - 1][m - 1] + dp[n][m]",
"- )",
"- dp_cum[n][m] %= MOD",
"-answer = dp_cum[N][M]",
"-print(answer)",
"+S = input().split()",
"+T = np.array(input().split(), dtype=np.int32)",
"+dp = np.ones(M + 1, dtype=np.int64)",
"+for s in S:",
"+ dp[1:] = ((dp[:-1] * (T == int(s))).cumsum() + dp[1:]) % MOD",
"+print((dp[M]))"
] | false | 0.037837 | 0.218563 | 0.173119 | [
"s967495192",
"s550158060"
] |
u332385682 | p03720 | python | s074505010 | s871945836 | 22 | 17 | 3,316 | 3,060 | Accepted | Accepted | 22.73 | import sys
from collections import Counter
sys.setrecursionlimit(10**7)
inf = 1<<100
def solve():
N, M = map(int, input().split())
ans = [0]*N
for i in range(M):
ai, bi = map(int, input().split())
ai -= 1
bi -= 1
ans[ai] += 1
ans[bi] += 1
print(*ans, sep='\n')
if __name__ == '__main__':
solve()
| import sys
def solve():
N, M = map(int, input().split())
deg = [0] * N
for i in range(M):
ai, bi = map(int, input().split())
ai, bi = ai - 1, bi - 1
deg[ai] += 1
deg[bi] += 1
print(*deg, sep='\n')
if __name__ == '__main__':
solve()
| 22 | 17 | 385 | 304 | import sys
from collections import Counter
sys.setrecursionlimit(10**7)
inf = 1 << 100
def solve():
N, M = map(int, input().split())
ans = [0] * N
for i in range(M):
ai, bi = map(int, input().split())
ai -= 1
bi -= 1
ans[ai] += 1
ans[bi] += 1
print(*ans, sep="\n")
if __name__ == "__main__":
solve()
| import sys
def solve():
N, M = map(int, input().split())
deg = [0] * N
for i in range(M):
ai, bi = map(int, input().split())
ai, bi = ai - 1, bi - 1
deg[ai] += 1
deg[bi] += 1
print(*deg, sep="\n")
if __name__ == "__main__":
solve()
| false | 22.727273 | [
"-from collections import Counter",
"-",
"-sys.setrecursionlimit(10**7)",
"-inf = 1 << 100",
"- ans = [0] * N",
"+ deg = [0] * N",
"- ai -= 1",
"- bi -= 1",
"- ans[ai] += 1",
"- ans[bi] += 1",
"- print(*ans, sep=\"\\n\")",
"+ ai, bi = ai - 1, bi - 1",
"+ deg[ai] += 1",
"+ deg[bi] += 1",
"+ print(*deg, sep=\"\\n\")"
] | false | 0.047889 | 0.095013 | 0.504028 | [
"s074505010",
"s871945836"
] |
u214617707 | p03276 | python | s309920789 | s973702469 | 101 | 79 | 14,224 | 14,224 | Accepted | Accepted | 21.78 | N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
num = float("inf")
for i in range(N - K + 1):
p = X[i]
q = X[i + K - 1]
if q < 0:
num = min(num, abs(p))
elif p < 0:
num = min(num, abs(p) + 2 * abs(q))
num = min(num, abs(p) * 2 + abs(q))
else:
num = min(num, q)
print(num)
| N, K = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = float('inf')
for i in range(N - K + 1):
L = x[i]
R = x[i + K - 1]
if R < 0:
ans = min(ans, -L)
elif L < 0 <= R:
ans = min(ans, -2 * L + R, -L + 2 * R)
else:
ans = min(ans, R)
print(ans)
| 17 | 14 | 364 | 319 | N, K = list(map(int, input().split()))
X = list(map(int, input().split()))
num = float("inf")
for i in range(N - K + 1):
p = X[i]
q = X[i + K - 1]
if q < 0:
num = min(num, abs(p))
elif p < 0:
num = min(num, abs(p) + 2 * abs(q))
num = min(num, abs(p) * 2 + abs(q))
else:
num = min(num, q)
print(num)
| N, K = list(map(int, input().split()))
x = list(map(int, input().split()))
ans = float("inf")
for i in range(N - K + 1):
L = x[i]
R = x[i + K - 1]
if R < 0:
ans = min(ans, -L)
elif L < 0 <= R:
ans = min(ans, -2 * L + R, -L + 2 * R)
else:
ans = min(ans, R)
print(ans)
| false | 17.647059 | [
"-X = list(map(int, input().split()))",
"-num = float(\"inf\")",
"+x = list(map(int, input().split()))",
"+ans = float(\"inf\")",
"- p = X[i]",
"- q = X[i + K - 1]",
"- if q < 0:",
"- num = min(num, abs(p))",
"- elif p < 0:",
"- num = min(num, abs(p) + 2 * abs(q))",
"- num = min(num, abs(p) * 2 + abs(q))",
"+ L = x[i]",
"+ R = x[i + K - 1]",
"+ if R < 0:",
"+ ans = min(ans, -L)",
"+ elif L < 0 <= R:",
"+ ans = min(ans, -2 * L + R, -L + 2 * R)",
"- num = min(num, q)",
"-print(num)",
"+ ans = min(ans, R)",
"+print(ans)"
] | false | 0.130908 | 0.080973 | 1.616697 | [
"s309920789",
"s973702469"
] |
u001024152 | p03078 | python | s204995037 | s155378020 | 740 | 239 | 148,204 | 46,064 | Accepted | Accepted | 67.7 | import sys
readline = sys.stdin.readline
X,Y,Z,K = list(map(int, readline().split()))
a = sorted(list(map(int, readline().split())), reverse=True)
b = sorted(list(map(int, readline().split())), reverse=True)
c = sorted(list(map(int, readline().split())), reverse=True)
ab = []
for ai in a:
for bj in b:
ab.append(ai+bj)
ab.sort(reverse=True)
ab = ab[:K]
cond = []
for abi in ab:
for cj in c:
cond.append(abi+cj)
cond = sorted(cond, reverse=True)[:K]
for condi in cond:
print(condi)
| import sys
readline = sys.stdin.readline
X, Y, Z, K = list(map(int, readline().split()))
A = sorted(list(map(int, readline().split())), reverse=True)
B = sorted(list(map(int, readline().split())), reverse=True)
C = sorted(list(map(int, readline().split())), reverse=True)
ABC = []
for a in range(X):
for b in range(Y):
if (a+1)*(b+1) > K:
break
for c in range(Z):
if (a+1)*(b+1)*(c+1) > K:
break
ABC.append(A[a] + B[b] + C[c])
for ai in sorted(ABC, reverse=True)[:K]:
print(ai)
| 20 | 19 | 524 | 580 | import sys
readline = sys.stdin.readline
X, Y, Z, K = list(map(int, readline().split()))
a = sorted(list(map(int, readline().split())), reverse=True)
b = sorted(list(map(int, readline().split())), reverse=True)
c = sorted(list(map(int, readline().split())), reverse=True)
ab = []
for ai in a:
for bj in b:
ab.append(ai + bj)
ab.sort(reverse=True)
ab = ab[:K]
cond = []
for abi in ab:
for cj in c:
cond.append(abi + cj)
cond = sorted(cond, reverse=True)[:K]
for condi in cond:
print(condi)
| import sys
readline = sys.stdin.readline
X, Y, Z, K = list(map(int, readline().split()))
A = sorted(list(map(int, readline().split())), reverse=True)
B = sorted(list(map(int, readline().split())), reverse=True)
C = sorted(list(map(int, readline().split())), reverse=True)
ABC = []
for a in range(X):
for b in range(Y):
if (a + 1) * (b + 1) > K:
break
for c in range(Z):
if (a + 1) * (b + 1) * (c + 1) > K:
break
ABC.append(A[a] + B[b] + C[c])
for ai in sorted(ABC, reverse=True)[:K]:
print(ai)
| false | 5 | [
"-a = sorted(list(map(int, readline().split())), reverse=True)",
"-b = sorted(list(map(int, readline().split())), reverse=True)",
"-c = sorted(list(map(int, readline().split())), reverse=True)",
"-ab = []",
"-for ai in a:",
"- for bj in b:",
"- ab.append(ai + bj)",
"-ab.sort(reverse=True)",
"-ab = ab[:K]",
"-cond = []",
"-for abi in ab:",
"- for cj in c:",
"- cond.append(abi + cj)",
"-cond = sorted(cond, reverse=True)[:K]",
"-for condi in cond:",
"- print(condi)",
"+A = sorted(list(map(int, readline().split())), reverse=True)",
"+B = sorted(list(map(int, readline().split())), reverse=True)",
"+C = sorted(list(map(int, readline().split())), reverse=True)",
"+ABC = []",
"+for a in range(X):",
"+ for b in range(Y):",
"+ if (a + 1) * (b + 1) > K:",
"+ break",
"+ for c in range(Z):",
"+ if (a + 1) * (b + 1) * (c + 1) > K:",
"+ break",
"+ ABC.append(A[a] + B[b] + C[c])",
"+for ai in sorted(ABC, reverse=True)[:K]:",
"+ print(ai)"
] | false | 0.035672 | 0.035566 | 1.002998 | [
"s204995037",
"s155378020"
] |
u561083515 | p03111 | python | s756243985 | s518968443 | 744 | 381 | 3,188 | 26,360 | Accepted | Accepted | 48.79 | # XをN進数に変換
def base_number(X:int, N:int):
res = ""
while True:
q, mod = divmod(X,N)
res += str(mod)
X = q
if q == 0:
break
return res[::-1]
N,*B = list(map(int,input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = float("inf")
for i in range(4 ** N):
state = list(base_number(i,4).rjust(N, "0"))
if not set(["0","1","2"]) <= set(state):
continue
make = [[] for _ in range(3)]
for j,x in enumerate(state):
if x == "3":
continue
make[int(x)].append(L[j])
MP = 0
for j,m in enumerate(make):
if len(m) == 1:
MP += abs(B[j] - m[0]) # 延長or短縮魔法
else:
MP += (len(m) - 1) * 10 # 合成魔法
MP += abs(B[j] - sum(m))
ans = min(ans, MP)
print(ans) | import sys
sys.setrecursionlimit(10 ** 7)
from functools import lru_cache
N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for i in range(N)]
INF = 10 ** 9
@lru_cache(None)
def dfs(cur, a, b, c):
if cur == N:
return abs(a - A) + abs(b - B) + abs(c - C) if min(a, b, c) > 0 else INF
# (10 if _ else 0): 最初の1本目は合成魔法の必要がない
ret0 = dfs(cur + 1, a, b, c)
ret1 = dfs(cur + 1, a + l[cur], b, c) + (10 if a else 0)
ret2 = dfs(cur + 1, a, b + l[cur], c) + (10 if b else 0)
ret3 = dfs(cur + 1, a, b, c + l[cur]) + (10 if c else 0)
return min(ret0, ret1, ret2, ret3)
print((dfs(0, 0, 0, 0))) | 37 | 22 | 856 | 647 | # XをN進数に変換
def base_number(X: int, N: int):
res = ""
while True:
q, mod = divmod(X, N)
res += str(mod)
X = q
if q == 0:
break
return res[::-1]
N, *B = list(map(int, input().split()))
L = [int(eval(input())) for _ in range(N)]
ans = float("inf")
for i in range(4**N):
state = list(base_number(i, 4).rjust(N, "0"))
if not set(["0", "1", "2"]) <= set(state):
continue
make = [[] for _ in range(3)]
for j, x in enumerate(state):
if x == "3":
continue
make[int(x)].append(L[j])
MP = 0
for j, m in enumerate(make):
if len(m) == 1:
MP += abs(B[j] - m[0]) # 延長or短縮魔法
else:
MP += (len(m) - 1) * 10 # 合成魔法
MP += abs(B[j] - sum(m))
ans = min(ans, MP)
print(ans)
| import sys
sys.setrecursionlimit(10**7)
from functools import lru_cache
N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for i in range(N)]
INF = 10**9
@lru_cache(None)
def dfs(cur, a, b, c):
if cur == N:
return abs(a - A) + abs(b - B) + abs(c - C) if min(a, b, c) > 0 else INF
# (10 if _ else 0): 最初の1本目は合成魔法の必要がない
ret0 = dfs(cur + 1, a, b, c)
ret1 = dfs(cur + 1, a + l[cur], b, c) + (10 if a else 0)
ret2 = dfs(cur + 1, a, b + l[cur], c) + (10 if b else 0)
ret3 = dfs(cur + 1, a, b, c + l[cur]) + (10 if c else 0)
return min(ret0, ret1, ret2, ret3)
print((dfs(0, 0, 0, 0)))
| false | 40.540541 | [
"-# XをN進数に変換",
"-def base_number(X: int, N: int):",
"- res = \"\"",
"- while True:",
"- q, mod = divmod(X, N)",
"- res += str(mod)",
"- X = q",
"- if q == 0:",
"- break",
"- return res[::-1]",
"+import sys",
"+",
"+sys.setrecursionlimit(10**7)",
"+from functools import lru_cache",
"+",
"+N, A, B, C = list(map(int, input().split()))",
"+l = [int(eval(input())) for i in range(N)]",
"+INF = 10**9",
"-N, *B = list(map(int, input().split()))",
"-L = [int(eval(input())) for _ in range(N)]",
"-ans = float(\"inf\")",
"-for i in range(4**N):",
"- state = list(base_number(i, 4).rjust(N, \"0\"))",
"- if not set([\"0\", \"1\", \"2\"]) <= set(state):",
"- continue",
"- make = [[] for _ in range(3)]",
"- for j, x in enumerate(state):",
"- if x == \"3\":",
"- continue",
"- make[int(x)].append(L[j])",
"- MP = 0",
"- for j, m in enumerate(make):",
"- if len(m) == 1:",
"- MP += abs(B[j] - m[0]) # 延長or短縮魔法",
"- else:",
"- MP += (len(m) - 1) * 10 # 合成魔法",
"- MP += abs(B[j] - sum(m))",
"- ans = min(ans, MP)",
"-print(ans)",
"+@lru_cache(None)",
"+def dfs(cur, a, b, c):",
"+ if cur == N:",
"+ return abs(a - A) + abs(b - B) + abs(c - C) if min(a, b, c) > 0 else INF",
"+ # (10 if _ else 0): 最初の1本目は合成魔法の必要がない",
"+ ret0 = dfs(cur + 1, a, b, c)",
"+ ret1 = dfs(cur + 1, a + l[cur], b, c) + (10 if a else 0)",
"+ ret2 = dfs(cur + 1, a, b + l[cur], c) + (10 if b else 0)",
"+ ret3 = dfs(cur + 1, a, b, c + l[cur]) + (10 if c else 0)",
"+ return min(ret0, ret1, ret2, ret3)",
"+",
"+",
"+print((dfs(0, 0, 0, 0)))"
] | false | 0.401993 | 0.082297 | 4.88466 | [
"s756243985",
"s518968443"
] |
u150984829 | p00423 | python | s319281277 | s527211452 | 100 | 70 | 5,636 | 5,720 | Accepted | Accepted | 30 | import sys
for e in sys.stdin:
a=b=0;n=int(e)
if n:
for i in[0]*n:
s,t=list(map(int,input().split()))
if s>t:a+=s+t
elif s<t:b+=s+t
else:a+=s;b+=t
print((a,b))
| import sys
e=sys.stdin
while 1:
a=b=0;n=int(e.readline())
if n==0:break
for i in[0]*n:
s,t=list(map(int,e.readline().split()))
if s>t:a+=s+t
elif s<t:b+=s+t
else:a+=s;b+=t
print((a,b))
| 10 | 11 | 179 | 199 | import sys
for e in sys.stdin:
a = b = 0
n = int(e)
if n:
for i in [0] * n:
s, t = list(map(int, input().split()))
if s > t:
a += s + t
elif s < t:
b += s + t
else:
a += s
b += t
print((a, b))
| import sys
e = sys.stdin
while 1:
a = b = 0
n = int(e.readline())
if n == 0:
break
for i in [0] * n:
s, t = list(map(int, e.readline().split()))
if s > t:
a += s + t
elif s < t:
b += s + t
else:
a += s
b += t
print((a, b))
| false | 9.090909 | [
"-for e in sys.stdin:",
"+e = sys.stdin",
"+while 1:",
"- n = int(e)",
"- if n:",
"- for i in [0] * n:",
"- s, t = list(map(int, input().split()))",
"- if s > t:",
"- a += s + t",
"- elif s < t:",
"- b += s + t",
"- else:",
"- a += s",
"- b += t",
"- print((a, b))",
"+ n = int(e.readline())",
"+ if n == 0:",
"+ break",
"+ for i in [0] * n:",
"+ s, t = list(map(int, e.readline().split()))",
"+ if s > t:",
"+ a += s + t",
"+ elif s < t:",
"+ b += s + t",
"+ else:",
"+ a += s",
"+ b += t",
"+ print((a, b))"
] | false | 0.102091 | 0.108777 | 0.93853 | [
"s319281277",
"s527211452"
] |
u477977638 | p03295 | python | s247293218 | s538932329 | 368 | 175 | 57,692 | 28,660 | Accepted | Accepted | 52.45 | import sys
read = sys.stdin.buffer.read
input = sys.stdin.readline
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,input().split()))
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')
#import numpy as np
def main():
n,m=MI()
li=[LI() for _ in range(m)]
#print(li)
li.sort(key=lambda x:x[1])
#print(li)
now=0
ans=0
for a,b in li:
if now<=a:
ans+=1
now=b
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,input().split()))
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode()
#import numpy as np
def main():
n,m=MI()
li=[LI() for _ in range(m)]
li.sort(key=lambda x:x[1])
#print(li)
now=0
ans=0
for a,b in li:
if now<=a:
now=b
ans+=1
print(ans)
if __name__ == "__main__":
main()
| 42 | 60 | 778 | 737 | import sys
read = sys.stdin.buffer.read
input = sys.stdin.readline
input = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**9)
# from functools import lru_cache
def RD():
return sys.stdin.read()
def II():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def MF():
return list(map(float, input().split()))
def LI():
return list(map(int, input().split()))
def LF():
return list(map(float, input().split()))
def TI():
return tuple(map(int, input().split()))
# rstrip().decode('utf-8')
# import numpy as np
def main():
n, m = MI()
li = [LI() for _ in range(m)]
# print(li)
li.sort(key=lambda x: x[1])
# print(li)
now = 0
ans = 0
for a, b in li:
if now <= a:
ans += 1
now = b
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**9)
# from functools import lru_cache
def RD():
return sys.stdin.read()
def II():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def MF():
return list(map(float, input().split()))
def LI():
return list(map(int, input().split()))
def LF():
return list(map(float, input().split()))
def TI():
return tuple(map(int, input().split()))
# rstrip().decode()
# import numpy as np
def main():
n, m = MI()
li = [LI() for _ in range(m)]
li.sort(key=lambda x: x[1])
# print(li)
now = 0
ans = 0
for a, b in li:
if now <= a:
now = b
ans += 1
print(ans)
if __name__ == "__main__":
main()
| false | 30 | [
"-read = sys.stdin.buffer.read",
"-input = sys.stdin.readline",
"-# rstrip().decode('utf-8')",
"+# rstrip().decode()",
"- # print(li)",
"+ now = b",
"- now = b"
] | false | 0.043182 | 0.084011 | 0.513998 | [
"s247293218",
"s538932329"
] |
u350248178 | p03722 | python | s214732282 | s599422266 | 798 | 401 | 3,444 | 3,312 | Accepted | Accepted | 49.75 | n,m=list(map(int,input().split()))
abc=[]
for i in range(m):
abc.append([int(j) for j in input().split()])
b=[float("INF")]*(n+1)
b[1]=0
for i in range(1,n+1):
for s,t,u in abc:
if b[t]>b[s]-u:
b[t]=b[s]-u
if i==n and t==n:
print("inf")
exit()
print((-b[-1])) | n,m=list(map(int,input().split()))
def bellman_ford(v, s, e):
INF = 10**18
# コストをINFで初期化
d = [INF] * v
# 開始頂点は0
d[s] = 0
# 負の閉路が無ければ更新はV-1回までで終わる
for i in range(v):
f = False
for a, b, c in e:
if d[a]==INF:continue
# aまでのコスト+辺abのコストがbまでのコストより小さければ更新
cost = d[a] + c
if cost < d[b]:
d[b] = cost
f = True
if i==v-1 and b==v-1:
return -1
# 更新が無ければbreak
if not f:
break
return d
e=[]
for i in range(m):
a,b,c=[int(j) for j in input().split()]
e.append((a-1,b-1,-c))
ans=bellman_ford(n,0,e)
if ans==-1:
print("inf")
else:
print((-ans[-1]))
| 14 | 39 | 336 | 780 | n, m = list(map(int, input().split()))
abc = []
for i in range(m):
abc.append([int(j) for j in input().split()])
b = [float("INF")] * (n + 1)
b[1] = 0
for i in range(1, n + 1):
for s, t, u in abc:
if b[t] > b[s] - u:
b[t] = b[s] - u
if i == n and t == n:
print("inf")
exit()
print((-b[-1]))
| n, m = list(map(int, input().split()))
def bellman_ford(v, s, e):
INF = 10**18
# コストをINFで初期化
d = [INF] * v
# 開始頂点は0
d[s] = 0
# 負の閉路が無ければ更新はV-1回までで終わる
for i in range(v):
f = False
for a, b, c in e:
if d[a] == INF:
continue
# aまでのコスト+辺abのコストがbまでのコストより小さければ更新
cost = d[a] + c
if cost < d[b]:
d[b] = cost
f = True
if i == v - 1 and b == v - 1:
return -1
# 更新が無ければbreak
if not f:
break
return d
e = []
for i in range(m):
a, b, c = [int(j) for j in input().split()]
e.append((a - 1, b - 1, -c))
ans = bellman_ford(n, 0, e)
if ans == -1:
print("inf")
else:
print((-ans[-1]))
| false | 64.102564 | [
"-abc = []",
"+",
"+",
"+def bellman_ford(v, s, e):",
"+ INF = 10**18",
"+ # コストをINFで初期化",
"+ d = [INF] * v",
"+ # 開始頂点は0",
"+ d[s] = 0",
"+ # 負の閉路が無ければ更新はV-1回までで終わる",
"+ for i in range(v):",
"+ f = False",
"+ for a, b, c in e:",
"+ if d[a] == INF:",
"+ continue",
"+ # aまでのコスト+辺abのコストがbまでのコストより小さければ更新",
"+ cost = d[a] + c",
"+ if cost < d[b]:",
"+ d[b] = cost",
"+ f = True",
"+ if i == v - 1 and b == v - 1:",
"+ return -1",
"+ # 更新が無ければbreak",
"+ if not f:",
"+ break",
"+ return d",
"+",
"+",
"+e = []",
"- abc.append([int(j) for j in input().split()])",
"-b = [float(\"INF\")] * (n + 1)",
"-b[1] = 0",
"-for i in range(1, n + 1):",
"- for s, t, u in abc:",
"- if b[t] > b[s] - u:",
"- b[t] = b[s] - u",
"- if i == n and t == n:",
"- print(\"inf\")",
"- exit()",
"-print((-b[-1]))",
"+ a, b, c = [int(j) for j in input().split()]",
"+ e.append((a - 1, b - 1, -c))",
"+ans = bellman_ford(n, 0, e)",
"+if ans == -1:",
"+ print(\"inf\")",
"+else:",
"+ print((-ans[-1]))"
] | false | 0.040513 | 0.048245 | 0.83973 | [
"s214732282",
"s599422266"
] |
u949315872 | p03220 | python | s580034702 | s906007935 | 200 | 42 | 27,152 | 9,284 | Accepted | Accepted | 79 | import numpy as np
#-------------
N = int(eval(input()))
T,A = list(map(int, input().split()))
H =list(map(int, input().split()))
#-------------
Temp = []
for i in range(N) :
Temp.append(T-0.006*H[i]-A)
Temp = np.abs(Temp)
cnt =1
for i in range(N):
if min(Temp) != Temp[i]:
cnt+=1
else:
print(cnt) | #-------------
N = int(eval(input()))
T,A = list(map(int, input().split()))
H =list(map(int, input().split()))
#-------------
Temp = []
for i in range(N) :
Temp.append(T-0.006*H[i]-A)
Temp_abs=[]
for i in range(N) :
Temp_abs.append(abs(Temp[i]))
cnt =1
for i in range(N):
if min(Temp_abs) != Temp_abs[i]:
cnt+=1
else:
print(cnt) | 18 | 20 | 320 | 354 | import numpy as np
# -------------
N = int(eval(input()))
T, A = list(map(int, input().split()))
H = list(map(int, input().split()))
# -------------
Temp = []
for i in range(N):
Temp.append(T - 0.006 * H[i] - A)
Temp = np.abs(Temp)
cnt = 1
for i in range(N):
if min(Temp) != Temp[i]:
cnt += 1
else:
print(cnt)
| # -------------
N = int(eval(input()))
T, A = list(map(int, input().split()))
H = list(map(int, input().split()))
# -------------
Temp = []
for i in range(N):
Temp.append(T - 0.006 * H[i] - A)
Temp_abs = []
for i in range(N):
Temp_abs.append(abs(Temp[i]))
cnt = 1
for i in range(N):
if min(Temp_abs) != Temp_abs[i]:
cnt += 1
else:
print(cnt)
| false | 10 | [
"-import numpy as np",
"-",
"-Temp = np.abs(Temp)",
"+Temp_abs = []",
"+for i in range(N):",
"+ Temp_abs.append(abs(Temp[i]))",
"- if min(Temp) != Temp[i]:",
"+ if min(Temp_abs) != Temp_abs[i]:"
] | false | 0.007332 | 0.03842 | 0.190845 | [
"s580034702",
"s906007935"
] |
u413021823 | p03281 | python | s829922244 | s284959861 | 173 | 26 | 38,512 | 9,184 | Accepted | Accepted | 84.97 | import sys
from itertools import combinations
import math
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
ans = 0
if N >= 105:
for i in range(105, N+1, 2):
yakusu = 0
for q in range(1, N+1):
if i % q == 0:
yakusu += 1
if yakusu == 8:
ans += 1
print(ans)
| import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
n = I()
ans = 0
if n < 105:
print((0))
exit
else:
for i in range(105, n+1, 2):
cnt = 0
for q in range(1,i+1):
if i % q == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) | 28 | 21 | 548 | 505 | import sys
from itertools import combinations
import math
def I():
return int(sys.stdin.readline().rstrip())
def LI():
return list(map(int, sys.stdin.readline().rstrip().split()))
def S():
return sys.stdin.readline().rstrip()
def LS():
return list(sys.stdin.readline().rstrip().split())
N = I()
ans = 0
if N >= 105:
for i in range(105, N + 1, 2):
yakusu = 0
for q in range(1, N + 1):
if i % q == 0:
yakusu += 1
if yakusu == 8:
ans += 1
print(ans)
| import sys
def I():
return int(sys.stdin.readline().rstrip())
def LI():
return list(map(int, sys.stdin.readline().rstrip().split()))
def S():
return sys.stdin.readline().rstrip()
def LS():
return list(sys.stdin.readline().rstrip().split())
n = I()
ans = 0
if n < 105:
print((0))
exit
else:
for i in range(105, n + 1, 2):
cnt = 0
for q in range(1, i + 1):
if i % q == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans)
| false | 25 | [
"-from itertools import combinations",
"-import math",
"-N = I()",
"+n = I()",
"-if N >= 105:",
"- for i in range(105, N + 1, 2):",
"- yakusu = 0",
"- for q in range(1, N + 1):",
"+if n < 105:",
"+ print((0))",
"+ exit",
"+else:",
"+ for i in range(105, n + 1, 2):",
"+ cnt = 0",
"+ for q in range(1, i + 1):",
"- yakusu += 1",
"- if yakusu == 8:",
"+ cnt += 1",
"+ if cnt == 8:",
"-print(ans)",
"+ print(ans)"
] | false | 0.041689 | 0.037401 | 1.114652 | [
"s829922244",
"s284959861"
] |
u357751375 | p03785 | python | s577748790 | s521500024 | 228 | 184 | 13,068 | 13,308 | Accepted | Accepted | 19.3 | n,c,k = list(map(int,input().split()))
t = list(int(eval(input())) for i in range(n))
t.sort()
ans = 0
i = 0
while i < n:
a = t[i]
j = i + 1
z = 1
for j in range(i+1,min(i+c,n)):
if a+k >= t[j]:
z += 1
else:
break
i += z
ans += 1
print(ans) | n,c,k = list(map(int,input().split()))
t = list(int(eval(input())) for i in range(n))
t.sort()
ans = 0
x = t[0]
y = 1
for i in range(1,n):
if x+k < t[i] or y >= c:
ans += 1
x = t[i]
y = 1
else:
y += 1
print((ans+1)) | 17 | 14 | 308 | 254 | n, c, k = list(map(int, input().split()))
t = list(int(eval(input())) for i in range(n))
t.sort()
ans = 0
i = 0
while i < n:
a = t[i]
j = i + 1
z = 1
for j in range(i + 1, min(i + c, n)):
if a + k >= t[j]:
z += 1
else:
break
i += z
ans += 1
print(ans)
| n, c, k = list(map(int, input().split()))
t = list(int(eval(input())) for i in range(n))
t.sort()
ans = 0
x = t[0]
y = 1
for i in range(1, n):
if x + k < t[i] or y >= c:
ans += 1
x = t[i]
y = 1
else:
y += 1
print((ans + 1))
| false | 17.647059 | [
"-i = 0",
"-while i < n:",
"- a = t[i]",
"- j = i + 1",
"- z = 1",
"- for j in range(i + 1, min(i + c, n)):",
"- if a + k >= t[j]:",
"- z += 1",
"- else:",
"- break",
"- i += z",
"- ans += 1",
"-print(ans)",
"+x = t[0]",
"+y = 1",
"+for i in range(1, n):",
"+ if x + k < t[i] or y >= c:",
"+ ans += 1",
"+ x = t[i]",
"+ y = 1",
"+ else:",
"+ y += 1",
"+print((ans + 1))"
] | false | 0.044549 | 0.043213 | 1.030922 | [
"s577748790",
"s521500024"
] |
u733814820 | p03759 | python | s644285734 | s867649119 | 153 | 17 | 12,476 | 2,940 | Accepted | Accepted | 88.89 | # ABC 58 A
import numpy as np
def resolve():
a, b, c = list(map(int, input().split()))
if b - a == c - b:
print('YES')
else:
print('NO')
if __name__ == "__main__":
resolve()
| def resolve():
a, b, c = list(map(int, input().split()))
if b - a == c - b:
print('YES')
else:
print('NO')
return
if __name__ == "__main__":
resolve()
| 13 | 10 | 215 | 173 | # ABC 58 A
import numpy as np
def resolve():
a, b, c = list(map(int, input().split()))
if b - a == c - b:
print("YES")
else:
print("NO")
if __name__ == "__main__":
resolve()
| def resolve():
a, b, c = list(map(int, input().split()))
if b - a == c - b:
print("YES")
else:
print("NO")
return
if __name__ == "__main__":
resolve()
| false | 23.076923 | [
"-# ABC 58 A",
"-import numpy as np",
"-",
"-",
"+ return"
] | false | 0.037352 | 0.078831 | 0.47383 | [
"s644285734",
"s867649119"
] |
u484052148 | p02694 | python | s793098054 | s297752515 | 65 | 31 | 63,508 | 9,112 | Accepted | Accepted | 52.31 | from math import floor
x = int(eval(input()))
ans = 0
y = 100
while y < x:
y = floor(y*1.01)
ans += 1
print(ans) | def resolve():
X = int(eval(input()))
tmp = 100
ans = 0
while tmp<X:
tmp += tmp//100
ans += 1
print(ans)
resolve() | 8 | 9 | 121 | 125 | from math import floor
x = int(eval(input()))
ans = 0
y = 100
while y < x:
y = floor(y * 1.01)
ans += 1
print(ans)
| def resolve():
X = int(eval(input()))
tmp = 100
ans = 0
while tmp < X:
tmp += tmp // 100
ans += 1
print(ans)
resolve()
| false | 11.111111 | [
"-from math import floor",
"+def resolve():",
"+ X = int(eval(input()))",
"+ tmp = 100",
"+ ans = 0",
"+ while tmp < X:",
"+ tmp += tmp // 100",
"+ ans += 1",
"+ print(ans)",
"-x = int(eval(input()))",
"-ans = 0",
"-y = 100",
"-while y < x:",
"- y = floor(y * 1.01)",
"- ans += 1",
"-print(ans)",
"+",
"+resolve()"
] | false | 0.044786 | 0.042762 | 1.047329 | [
"s793098054",
"s297752515"
] |
u162612857 | p03959 | python | s964475893 | s638661864 | 196 | 166 | 24,548 | 24,480 | Accepted | Accepted | 15.31 | # 最大値と最小値を調べておいて、それを掛け合わせる
n = int(eval(input()))
left_heights = list(map(int, input().split()))
right_heights = list(map(int, input().split()))
minimum = [-1] * n
maximum = [10**10] * n
l_max = 0
for i in range(n):
if left_heights[i] > l_max:
maximum[i] = left_heights[i]
minimum[i] = left_heights[i]
else:
maximum[i] = left_heights[i]
minimum[i] = 1
l_max = left_heights[i]
r_max = 0
for i in reversed(list(range(n))):
if right_heights[i] > r_max:
if minimum[i] <= right_heights[i] <= maximum[i]:
maximum[i] = right_heights[i]
minimum[i] = right_heights[i]
else:
print((0))
exit()
else:
if r_max >= minimum[i]:
maximum[i] = min(right_heights[i], maximum[i])
minimum[i] = max(1, minimum[i]) # 多分この行は不要
else:
print((0))
exit()
r_max = right_heights[i]
mod = 10**9 + 7
ans = 1
for mi, ma in zip(minimum, maximum):
ans *= ma - mi + 1
ans %= mod
print(ans)
| # 最大値と最小値を調べておいて、それを掛け合わせる
n = int(eval(input()))
left_heights = list(map(int, input().split()))
right_heights = list(map(int, input().split()))
minimum = [-1] * n
maximum = [10**10] * n
l_max = 0
for i in range(n):
if left_heights[i] > l_max:
maximum[i] = left_heights[i]
minimum[i] = left_heights[i]
else:
maximum[i] = left_heights[i]
minimum[i] = 1
l_max = left_heights[i]
r_max = 0
for i in reversed(list(range(n))):
if right_heights[i] > r_max:
if minimum[i] <= right_heights[i] <= maximum[i]:
maximum[i] = right_heights[i]
minimum[i] = right_heights[i]
else:
print((0))
exit()
else:
if r_max >= minimum[i]:
maximum[i] = min(right_heights[i], maximum[i])
else:
print((0))
exit()
r_max = right_heights[i]
mod = 10**9 + 7
ans = 1
for mi, ma in zip(minimum, maximum):
ans *= ma - mi + 1
ans %= mod
print(ans)
| 44 | 43 | 1,080 | 1,023 | # 最大値と最小値を調べておいて、それを掛け合わせる
n = int(eval(input()))
left_heights = list(map(int, input().split()))
right_heights = list(map(int, input().split()))
minimum = [-1] * n
maximum = [10**10] * n
l_max = 0
for i in range(n):
if left_heights[i] > l_max:
maximum[i] = left_heights[i]
minimum[i] = left_heights[i]
else:
maximum[i] = left_heights[i]
minimum[i] = 1
l_max = left_heights[i]
r_max = 0
for i in reversed(list(range(n))):
if right_heights[i] > r_max:
if minimum[i] <= right_heights[i] <= maximum[i]:
maximum[i] = right_heights[i]
minimum[i] = right_heights[i]
else:
print((0))
exit()
else:
if r_max >= minimum[i]:
maximum[i] = min(right_heights[i], maximum[i])
minimum[i] = max(1, minimum[i]) # 多分この行は不要
else:
print((0))
exit()
r_max = right_heights[i]
mod = 10**9 + 7
ans = 1
for mi, ma in zip(minimum, maximum):
ans *= ma - mi + 1
ans %= mod
print(ans)
| # 最大値と最小値を調べておいて、それを掛け合わせる
n = int(eval(input()))
left_heights = list(map(int, input().split()))
right_heights = list(map(int, input().split()))
minimum = [-1] * n
maximum = [10**10] * n
l_max = 0
for i in range(n):
if left_heights[i] > l_max:
maximum[i] = left_heights[i]
minimum[i] = left_heights[i]
else:
maximum[i] = left_heights[i]
minimum[i] = 1
l_max = left_heights[i]
r_max = 0
for i in reversed(list(range(n))):
if right_heights[i] > r_max:
if minimum[i] <= right_heights[i] <= maximum[i]:
maximum[i] = right_heights[i]
minimum[i] = right_heights[i]
else:
print((0))
exit()
else:
if r_max >= minimum[i]:
maximum[i] = min(right_heights[i], maximum[i])
else:
print((0))
exit()
r_max = right_heights[i]
mod = 10**9 + 7
ans = 1
for mi, ma in zip(minimum, maximum):
ans *= ma - mi + 1
ans %= mod
print(ans)
| false | 2.272727 | [
"- minimum[i] = max(1, minimum[i]) # 多分この行は不要"
] | false | 0.036091 | 0.034593 | 1.043303 | [
"s964475893",
"s638661864"
] |
u546285759 | p00510 | python | s157424704 | s706630598 | 130 | 110 | 8,028 | 7,560 | Accepted | Accepted | 15.38 | from collections import deque
n, m = int(eval(input())), int(eval(input()))
B, S = 0, m
d = deque([0]*m)
for _ in range(n):
cars = list(map(int, input().split()))
for _ in range(cars[0]): d.append(0)
try:
for _ in range(cars[1]): d.pop()
except IndexError:
B = 1
S = max(S, len(d))
print((0 if B else S)) | n, m = int(eval(input())), int(eval(input()))
B, S = 0, m
d = [0]*m
for _ in range(n):
cars = list(map(int, input().split()))
for _ in range(cars[0]): d.append(0)
try:
for _ in range(cars[1]): d.pop()
except IndexError:
B = 1
S = max(S, len(d))
print((0 if B else S)) | 13 | 12 | 338 | 300 | from collections import deque
n, m = int(eval(input())), int(eval(input()))
B, S = 0, m
d = deque([0] * m)
for _ in range(n):
cars = list(map(int, input().split()))
for _ in range(cars[0]):
d.append(0)
try:
for _ in range(cars[1]):
d.pop()
except IndexError:
B = 1
S = max(S, len(d))
print((0 if B else S))
| n, m = int(eval(input())), int(eval(input()))
B, S = 0, m
d = [0] * m
for _ in range(n):
cars = list(map(int, input().split()))
for _ in range(cars[0]):
d.append(0)
try:
for _ in range(cars[1]):
d.pop()
except IndexError:
B = 1
S = max(S, len(d))
print((0 if B else S))
| false | 7.692308 | [
"-from collections import deque",
"-",
"-d = deque([0] * m)",
"+d = [0] * m"
] | false | 0.031249 | 0.037125 | 0.841711 | [
"s157424704",
"s706630598"
] |
u022407960 | p02290 | python | s410074798 | s311828781 | 40 | 30 | 7,780 | 7,856 | Accepted | Accepted | 25 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
0 0 3 4
1
2 5
output:
3.1200000000 4.1600000000
"""
import sys
def solve(_prj_info):
for point in _prj_info:
xp, yp = list(map(int, point))
p = xp + yp * 1j
hypo = p - p1
prj = p1 + base_vector * project(base_vector, hypo)
print(('{:.10f} {:.10f}'.format(prj.real, prj.imag)))
return _prj_info
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def project(a, b):
return dot(a, b) / dot(a, a)
if __name__ == '__main__':
_input = sys.stdin.readlines()
base_info = _input[0].split()
q_num = int(_input[1])
prj_points = [x.split() for x in _input[2:]]
x1, y1, x2, y2 = list(map(int, base_info))
p1, p2 = x1 + y1 * 1j, x2 + y2 * 1j
base_vector = p2 - p1
res = solve(prj_points) | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
0 0 3 4
1
2 5
output:
3.1200000000 4.1600000000
"""
import sys
def solve(_prj_info):
for point in _prj_info:
xp, yp = list(map(int, point))
p = xp + yp * 1j
hypo = p - p1
prj = p1 + base * project(base, hypo)
print(('{0:.10f} {1:.10f}'.format(prj.real, prj.imag)))
return _prj_info
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def project(a, b):
return dot(a, b) / dot(a, a)
if __name__ == '__main__':
_input = sys.stdin.readlines()
base_info = _input[0].split()
q_num = int(_input[1])
prj_points = [x.split() for x in _input[2:]]
x1, y1, x2, y2 = list(map(int, base_info))
p1, p2 = x1 + y1 * 1j, x2 + y2 * 1j
base = p2 - p1
res = solve(prj_points) | 45 | 45 | 871 | 852 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
0 0 3 4
1
2 5
output:
3.1200000000 4.1600000000
"""
import sys
def solve(_prj_info):
for point in _prj_info:
xp, yp = list(map(int, point))
p = xp + yp * 1j
hypo = p - p1
prj = p1 + base_vector * project(base_vector, hypo)
print(("{:.10f} {:.10f}".format(prj.real, prj.imag)))
return _prj_info
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def project(a, b):
return dot(a, b) / dot(a, a)
if __name__ == "__main__":
_input = sys.stdin.readlines()
base_info = _input[0].split()
q_num = int(_input[1])
prj_points = [x.split() for x in _input[2:]]
x1, y1, x2, y2 = list(map(int, base_info))
p1, p2 = x1 + y1 * 1j, x2 + y2 * 1j
base_vector = p2 - p1
res = solve(prj_points)
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
0 0 3 4
1
2 5
output:
3.1200000000 4.1600000000
"""
import sys
def solve(_prj_info):
for point in _prj_info:
xp, yp = list(map(int, point))
p = xp + yp * 1j
hypo = p - p1
prj = p1 + base * project(base, hypo)
print(("{0:.10f} {1:.10f}".format(prj.real, prj.imag)))
return _prj_info
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def project(a, b):
return dot(a, b) / dot(a, a)
if __name__ == "__main__":
_input = sys.stdin.readlines()
base_info = _input[0].split()
q_num = int(_input[1])
prj_points = [x.split() for x in _input[2:]]
x1, y1, x2, y2 = list(map(int, base_info))
p1, p2 = x1 + y1 * 1j, x2 + y2 * 1j
base = p2 - p1
res = solve(prj_points)
| false | 0 | [
"- prj = p1 + base_vector * project(base_vector, hypo)",
"- print((\"{:.10f} {:.10f}\".format(prj.real, prj.imag)))",
"+ prj = p1 + base * project(base, hypo)",
"+ print((\"{0:.10f} {1:.10f}\".format(prj.real, prj.imag)))",
"- base_vector = p2 - p1",
"+ base = p2 - p1"
] | false | 0.037766 | 0.102279 | 0.369241 | [
"s410074798",
"s311828781"
] |
u373274281 | p03078 | python | s187204031 | s889393992 | 86 | 47 | 5,996 | 5,356 | Accepted | Accepted | 45.35 | from queue import PriorityQueue
X,Y,Z,K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
A.append(-float('inf'))
B.sort(reverse=True)
B.append(-float('inf'))
C.sort(reverse=True)
C.append(-float('inf'))
pq = PriorityQueue()
pq.put((-(A[0]+B[0]+C[0]),0,0,0))
count = 0
queued = set([(0,0,0)])
while True:
d,i,j,k = pq.get()
#print(-d,i,j,k)
print((-d))
count += 1
if count >= K:
break
for l in [i,i+1]:
for m in [j,j+1]:
for n in [k,k+1]:
if (l,m,n) in queued:
continue
else:
pq.put((-(A[l]+B[m]+C[n]),l,m,n))
queued.add((l,m,n)) | from heapq import heappop, heappush
from time import time
X,Y,Z,K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
A.append(-float('inf'))
B.sort(reverse=True)
B.append(-float('inf'))
C.sort(reverse=True)
C.append(-float('inf'))
hq = []
count = 0
queued = set()
heappush(hq,(-(A[0]+B[0]+C[0]),time(),0,0,0))
queued.add((0,0,0))
while True:
d,_,i,j,k = heappop(hq)
#print(-d,i,j,k)
print((-d))
count += 1
if count >= K:
break
for l in [i,i+1]:
for m in [j,j+1]:
for n in [k,k+1]:
if (l,m,n) in queued:
continue
else:
heappush(hq,(-(A[l]+B[m]+C[n]),time(),l,m,n))
queued.add((l,m,n)) | 32 | 35 | 739 | 796 | from queue import PriorityQueue
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
A.append(-float("inf"))
B.sort(reverse=True)
B.append(-float("inf"))
C.sort(reverse=True)
C.append(-float("inf"))
pq = PriorityQueue()
pq.put((-(A[0] + B[0] + C[0]), 0, 0, 0))
count = 0
queued = set([(0, 0, 0)])
while True:
d, i, j, k = pq.get()
# print(-d,i,j,k)
print((-d))
count += 1
if count >= K:
break
for l in [i, i + 1]:
for m in [j, j + 1]:
for n in [k, k + 1]:
if (l, m, n) in queued:
continue
else:
pq.put((-(A[l] + B[m] + C[n]), l, m, n))
queued.add((l, m, n))
| from heapq import heappop, heappush
from time import time
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
A.append(-float("inf"))
B.sort(reverse=True)
B.append(-float("inf"))
C.sort(reverse=True)
C.append(-float("inf"))
hq = []
count = 0
queued = set()
heappush(hq, (-(A[0] + B[0] + C[0]), time(), 0, 0, 0))
queued.add((0, 0, 0))
while True:
d, _, i, j, k = heappop(hq)
# print(-d,i,j,k)
print((-d))
count += 1
if count >= K:
break
for l in [i, i + 1]:
for m in [j, j + 1]:
for n in [k, k + 1]:
if (l, m, n) in queued:
continue
else:
heappush(hq, (-(A[l] + B[m] + C[n]), time(), l, m, n))
queued.add((l, m, n))
| false | 8.571429 | [
"-from queue import PriorityQueue",
"+from heapq import heappop, heappush",
"+from time import time",
"-pq = PriorityQueue()",
"-pq.put((-(A[0] + B[0] + C[0]), 0, 0, 0))",
"+hq = []",
"-queued = set([(0, 0, 0)])",
"+queued = set()",
"+heappush(hq, (-(A[0] + B[0] + C[0]), time(), 0, 0, 0))",
"+queued.add((0, 0, 0))",
"- d, i, j, k = pq.get()",
"+ d, _, i, j, k = heappop(hq)",
"- pq.put((-(A[l] + B[m] + C[n]), l, m, n))",
"+ heappush(hq, (-(A[l] + B[m] + C[n]), time(), l, m, n))"
] | false | 0.037026 | 0.110716 | 0.334421 | [
"s187204031",
"s889393992"
] |
u598720217 | p02972 | python | s986554020 | s707251173 | 727 | 670 | 17,208 | 17,208 | Accepted | Accepted | 7.84 | N = int(eval(input()))
l = list(map(int,input().split(' ')))
mid = N // 2
MAP = [0]*N
ans_l = []
for i in range(N,0,-1):
s = N // i + 1
t = 0
for j in range(1,s):
t += MAP[i*j-1]
if t%2 != l[i-1]:
ans_l.append(str(i))
MAP[i-1] = 1
leng = len(ans_l)
print(leng)
print((" ".join(ans_l))) | N = int(eval(input()))
l = list(map(int,input().split(' ')))
mid = N // 2
MAP = [0]*N
ans_l = []
for i in range(N-1,mid-1,-1):
k = l[i]
MAP[i] = k
if k==1:
ans_l.append(str(i+1))
flag = False
for i in range(mid,0,-1):
s = N // i + 1
t = 0
for j in range(2,s):
t += MAP[i*j-1]
if t%2==0:
if l[i-1]%2==1:
ans_l.append(str(i))
MAP[i-1] += 1
else:
if l[i-1]%2==0:
ans_l.append(str(i))
MAP[i-1] += 1
leng = len(ans_l)
print(leng)
print((" ".join(ans_l))) | 17 | 28 | 334 | 582 | N = int(eval(input()))
l = list(map(int, input().split(" ")))
mid = N // 2
MAP = [0] * N
ans_l = []
for i in range(N, 0, -1):
s = N // i + 1
t = 0
for j in range(1, s):
t += MAP[i * j - 1]
if t % 2 != l[i - 1]:
ans_l.append(str(i))
MAP[i - 1] = 1
leng = len(ans_l)
print(leng)
print((" ".join(ans_l)))
| N = int(eval(input()))
l = list(map(int, input().split(" ")))
mid = N // 2
MAP = [0] * N
ans_l = []
for i in range(N - 1, mid - 1, -1):
k = l[i]
MAP[i] = k
if k == 1:
ans_l.append(str(i + 1))
flag = False
for i in range(mid, 0, -1):
s = N // i + 1
t = 0
for j in range(2, s):
t += MAP[i * j - 1]
if t % 2 == 0:
if l[i - 1] % 2 == 1:
ans_l.append(str(i))
MAP[i - 1] += 1
else:
if l[i - 1] % 2 == 0:
ans_l.append(str(i))
MAP[i - 1] += 1
leng = len(ans_l)
print(leng)
print((" ".join(ans_l)))
| false | 39.285714 | [
"-for i in range(N, 0, -1):",
"+for i in range(N - 1, mid - 1, -1):",
"+ k = l[i]",
"+ MAP[i] = k",
"+ if k == 1:",
"+ ans_l.append(str(i + 1))",
"+flag = False",
"+for i in range(mid, 0, -1):",
"- for j in range(1, s):",
"+ for j in range(2, s):",
"- if t % 2 != l[i - 1]:",
"- ans_l.append(str(i))",
"- MAP[i - 1] = 1",
"+ if t % 2 == 0:",
"+ if l[i - 1] % 2 == 1:",
"+ ans_l.append(str(i))",
"+ MAP[i - 1] += 1",
"+ else:",
"+ if l[i - 1] % 2 == 0:",
"+ ans_l.append(str(i))",
"+ MAP[i - 1] += 1"
] | false | 0.036735 | 0.049098 | 0.748183 | [
"s986554020",
"s707251173"
] |
u620868411 | p03061 | python | s443635074 | s479260333 | 201 | 169 | 14,440 | 20,540 | Accepted | Accepted | 15.92 | # -*- coding: utf-8 -*-
n = int(eval(input()))
al = list(map(int, input().split()))
def gcd(a,b):
while b>0:
a,b = b,a%b
return a
ll = [0]*n
ll[0] = al[0]
for i in range(1,n):
ll[i] = gcd(al[i], ll[i-1])
rl = [0]*n
rl[n-1] = al[n-1]
for i in range(n-2,-1,-1):
rl[i] = gcd(al[i],rl[i+1])
res = -1
for i in range(n):
if i==0:
res = max(res, rl[1])
elif i==n-1:
res = max(res, ll[n-2])
else:
res = max(res, gcd(ll[i-1],rl[i+1]))
print(res)
| n = int(eval(input()))
al = list(map(int, input().split()))
def gcd(a,b):
while b>0:
a,b = b,a%b
return a
accl = [0]*(n+1)
accr = [0]*(n+1)
accl[0] = al[0]
for i in range(n):
accl[i+1] = gcd(accl[i],al[i])
accr[n] = al[n-1]
for i in range(n,0,-1):
accr[i-1] = gcd(accr[i],al[i-1])
res = 0
for i in range(n):
if i==0:
res = max(res, accr[1])
elif i==n-1:
res = max(res, accl[n-1])
else:
res = max(res, gcd(accl[i], accr[i+1]))
print(res) | 30 | 29 | 526 | 524 | # -*- coding: utf-8 -*-
n = int(eval(input()))
al = list(map(int, input().split()))
def gcd(a, b):
while b > 0:
a, b = b, a % b
return a
ll = [0] * n
ll[0] = al[0]
for i in range(1, n):
ll[i] = gcd(al[i], ll[i - 1])
rl = [0] * n
rl[n - 1] = al[n - 1]
for i in range(n - 2, -1, -1):
rl[i] = gcd(al[i], rl[i + 1])
res = -1
for i in range(n):
if i == 0:
res = max(res, rl[1])
elif i == n - 1:
res = max(res, ll[n - 2])
else:
res = max(res, gcd(ll[i - 1], rl[i + 1]))
print(res)
| n = int(eval(input()))
al = list(map(int, input().split()))
def gcd(a, b):
while b > 0:
a, b = b, a % b
return a
accl = [0] * (n + 1)
accr = [0] * (n + 1)
accl[0] = al[0]
for i in range(n):
accl[i + 1] = gcd(accl[i], al[i])
accr[n] = al[n - 1]
for i in range(n, 0, -1):
accr[i - 1] = gcd(accr[i], al[i - 1])
res = 0
for i in range(n):
if i == 0:
res = max(res, accr[1])
elif i == n - 1:
res = max(res, accl[n - 1])
else:
res = max(res, gcd(accl[i], accr[i + 1]))
print(res)
| false | 3.333333 | [
"-# -*- coding: utf-8 -*-",
"-ll = [0] * n",
"-ll[0] = al[0]",
"-for i in range(1, n):",
"- ll[i] = gcd(al[i], ll[i - 1])",
"-rl = [0] * n",
"-rl[n - 1] = al[n - 1]",
"-for i in range(n - 2, -1, -1):",
"- rl[i] = gcd(al[i], rl[i + 1])",
"-res = -1",
"+accl = [0] * (n + 1)",
"+accr = [0] * (n + 1)",
"+accl[0] = al[0]",
"+for i in range(n):",
"+ accl[i + 1] = gcd(accl[i], al[i])",
"+accr[n] = al[n - 1]",
"+for i in range(n, 0, -1):",
"+ accr[i - 1] = gcd(accr[i], al[i - 1])",
"+res = 0",
"- res = max(res, rl[1])",
"+ res = max(res, accr[1])",
"- res = max(res, ll[n - 2])",
"+ res = max(res, accl[n - 1])",
"- res = max(res, gcd(ll[i - 1], rl[i + 1]))",
"+ res = max(res, gcd(accl[i], accr[i + 1]))"
] | false | 0.033116 | 0.031623 | 1.047241 | [
"s443635074",
"s479260333"
] |
u682730715 | p03037 | python | s952248118 | s519946161 | 370 | 235 | 9,300 | 9,300 | Accepted | Accepted | 36.49 | # coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *
n, m = list(map(int, input().split()))
a = [0] * (n + 2)
r = defaultdict(int)
for i in range(m):
x,y = list(map(int,input().split()))
a[x - 1] += 1
a[y] += -1
for i in range(n + 1):
a[i + 1] += a[i]
count = 0
flg = True
for i in range(n):
if a[i] >= m:
count += 1
print(count) | # coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *
readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: list(map(int, sys.stdin.readline().split()))
readms = lambda: list(map(str, sys.stdin.readline().split()))
n, m = readmi()
a = [0] * (n + 2)
r = defaultdict(int)
for i in range(m):
x,y = readmi()
a[x - 1] += 1
a[y] += -1
for i in range(n + 1):
a[i + 1] += a[i]
count = 0
flg = True
for i in range(n):
if a[i] >= m:
count += 1
print(count) | 29 | 35 | 546 | 825 | # coding: UTF-8
import sys
# sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *
n, m = list(map(int, input().split()))
a = [0] * (n + 2)
r = defaultdict(int)
for i in range(m):
x, y = list(map(int, input().split()))
a[x - 1] += 1
a[y] += -1
for i in range(n + 1):
a[i + 1] += a[i]
count = 0
flg = True
for i in range(n):
if a[i] >= m:
count += 1
print(count)
| # coding: UTF-8
import sys
# sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *
readl = lambda: list(map(int, sys.stdin.readline().split()))
readt = lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: list(map(int, sys.stdin.readline().split()))
readms = lambda: list(map(str, sys.stdin.readline().split()))
n, m = readmi()
a = [0] * (n + 2)
r = defaultdict(int)
for i in range(m):
x, y = readmi()
a[x - 1] += 1
a[y] += -1
for i in range(n + 1):
a[i + 1] += a[i]
count = 0
flg = True
for i in range(n):
if a[i] >= m:
count += 1
print(count)
| false | 17.142857 | [
"-n, m = list(map(int, input().split()))",
"+readl = lambda: list(map(int, sys.stdin.readline().split()))",
"+readt = lambda: tuple(map(int, sys.stdin.readline().split()))",
"+read = lambda: sys.stdin.readline().rstrip()",
"+readi = lambda: int(read())",
"+readmi = lambda: list(map(int, sys.stdin.readline().split()))",
"+readms = lambda: list(map(str, sys.stdin.readline().split()))",
"+n, m = readmi()",
"- x, y = list(map(int, input().split()))",
"+ x, y = readmi()"
] | false | 0.044472 | 0.075876 | 0.586119 | [
"s952248118",
"s519946161"
] |
u815878613 | p02725 | python | s772550429 | s933766938 | 1,527 | 223 | 42,444 | 30,860 | Accepted | Accepted | 85.4 | import numpy as np
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A.append(K + A[0])
D = np.diff(A)
print((int(K) - np.max(D)))
| import numpy as np
import sys
readline = sys.stdin.buffer.readline
K, N = list(map(int, readline().split()))
A = list(map(int, readline().split()))
A.append(K + A[0])
D = np.diff(A)
print((int(K) - np.max(D)))
| 9 | 14 | 159 | 221 | import numpy as np
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A.append(K + A[0])
D = np.diff(A)
print((int(K) - np.max(D)))
| import numpy as np
import sys
readline = sys.stdin.buffer.readline
K, N = list(map(int, readline().split()))
A = list(map(int, readline().split()))
A.append(K + A[0])
D = np.diff(A)
print((int(K) - np.max(D)))
| false | 35.714286 | [
"+import sys",
"-K, N = list(map(int, input().split()))",
"-A = list(map(int, input().split()))",
"+readline = sys.stdin.buffer.readline",
"+K, N = list(map(int, readline().split()))",
"+A = list(map(int, readline().split()))"
] | false | 0.272922 | 0.258936 | 1.054012 | [
"s772550429",
"s933766938"
] |
u325227960 | p03240 | python | s751965380 | s153686220 | 720 | 211 | 3,064 | 42,352 | Accepted | Accepted | 70.69 | n=int(eval(input()))
A=[]
for i in range(n):
A.append(list(map(int,input().split())))
A.sort(key=lambda x:x[2],reverse=True)
#print(A)
a1=0
a2=0
a3=0
for i in range(0,101):
for j in range(0,101):
col=0
h=abs(A[0][0]-i)+abs(A[0][1]-j)+A[0][2]
for k in range(1,n):
if max(0,h-abs(A[k][0]-i)-abs(A[k][1]-j))!=A[k][2] :
col=1
if col==0 :
a1=i
a2=j
a3=h
print((str(a1)+" "+str(a2)+" "+str(a3)))
| n = int(eval(input()))
X = [list(map(int, input().split())) for i in range(n)]
start = 0
while X[start][2] == 0:
start += 1
def c():
for i in range(101):
for j in range(101):
ng = 0
h = X[start][2] + abs(i - X[start][0]) + abs(j - X[start][1])
for k in range(n):
if X[k][2] != max(0, h - abs(i - X[k][0]) - abs(j - X[k][1])):
ng = 1
break
if ng == 0:
return i, j, h
ans = c()
print((ans[0], ans[1], ans[2])) | 26 | 22 | 516 | 560 | n = int(eval(input()))
A = []
for i in range(n):
A.append(list(map(int, input().split())))
A.sort(key=lambda x: x[2], reverse=True)
# print(A)
a1 = 0
a2 = 0
a3 = 0
for i in range(0, 101):
for j in range(0, 101):
col = 0
h = abs(A[0][0] - i) + abs(A[0][1] - j) + A[0][2]
for k in range(1, n):
if max(0, h - abs(A[k][0] - i) - abs(A[k][1] - j)) != A[k][2]:
col = 1
if col == 0:
a1 = i
a2 = j
a3 = h
print((str(a1) + " " + str(a2) + " " + str(a3)))
| n = int(eval(input()))
X = [list(map(int, input().split())) for i in range(n)]
start = 0
while X[start][2] == 0:
start += 1
def c():
for i in range(101):
for j in range(101):
ng = 0
h = X[start][2] + abs(i - X[start][0]) + abs(j - X[start][1])
for k in range(n):
if X[k][2] != max(0, h - abs(i - X[k][0]) - abs(j - X[k][1])):
ng = 1
break
if ng == 0:
return i, j, h
ans = c()
print((ans[0], ans[1], ans[2]))
| false | 15.384615 | [
"-A = []",
"-for i in range(n):",
"- A.append(list(map(int, input().split())))",
"-A.sort(key=lambda x: x[2], reverse=True)",
"-# print(A)",
"-a1 = 0",
"-a2 = 0",
"-a3 = 0",
"-for i in range(0, 101):",
"- for j in range(0, 101):",
"- col = 0",
"- h = abs(A[0][0] - i) + abs(A[0][1] - j) + A[0][2]",
"- for k in range(1, n):",
"- if max(0, h - abs(A[k][0] - i) - abs(A[k][1] - j)) != A[k][2]:",
"- col = 1",
"- if col == 0:",
"- a1 = i",
"- a2 = j",
"- a3 = h",
"-print((str(a1) + \" \" + str(a2) + \" \" + str(a3)))",
"+X = [list(map(int, input().split())) for i in range(n)]",
"+start = 0",
"+while X[start][2] == 0:",
"+ start += 1",
"+",
"+",
"+def c():",
"+ for i in range(101):",
"+ for j in range(101):",
"+ ng = 0",
"+ h = X[start][2] + abs(i - X[start][0]) + abs(j - X[start][1])",
"+ for k in range(n):",
"+ if X[k][2] != max(0, h - abs(i - X[k][0]) - abs(j - X[k][1])):",
"+ ng = 1",
"+ break",
"+ if ng == 0:",
"+ return i, j, h",
"+",
"+",
"+ans = c()",
"+print((ans[0], ans[1], ans[2]))"
] | false | 0.074085 | 0.041538 | 1.78353 | [
"s751965380",
"s153686220"
] |
u433375322 | p02583 | python | s199649973 | s375429224 | 157 | 121 | 9,192 | 9,100 | Accepted | Accepted | 22.93 | N=int(eval(input()))
c=0
l=list(map(int,input().split()))
for i in range(0,N):
for j in range(i+1,N):
for k in range(j+1,N):
if l[i]<l[j]+l[k] and l[j]<l[i]+l[k] and l[k]<l[j]+l[i] and l[k]!=l[j] and l[k]!=l[i] and l[i]!=l[j] :
c=c+1
print(c) | n=int(eval(input()))
l=list(map(int,input().split()))
c=0
for i in range(0,n-2):
for j in range(i+1,n-1):
for k in range(j+1,n):
if l[i]!=l[j] and l[k]!=l[j] and l[i]!=l[k] and abs(l[i]-l[j])< l[k] <l[i]+l[j]:
c+=1
print(c)
| 9 | 10 | 265 | 275 | N = int(eval(input()))
c = 0
l = list(map(int, input().split()))
for i in range(0, N):
for j in range(i + 1, N):
for k in range(j + 1, N):
if (
l[i] < l[j] + l[k]
and l[j] < l[i] + l[k]
and l[k] < l[j] + l[i]
and l[k] != l[j]
and l[k] != l[i]
and l[i] != l[j]
):
c = c + 1
print(c)
| n = int(eval(input()))
l = list(map(int, input().split()))
c = 0
for i in range(0, n - 2):
for j in range(i + 1, n - 1):
for k in range(j + 1, n):
if (
l[i] != l[j]
and l[k] != l[j]
and l[i] != l[k]
and abs(l[i] - l[j]) < l[k] < l[i] + l[j]
):
c += 1
print(c)
| false | 10 | [
"-N = int(eval(input()))",
"+n = int(eval(input()))",
"+l = list(map(int, input().split()))",
"-l = list(map(int, input().split()))",
"-for i in range(0, N):",
"- for j in range(i + 1, N):",
"- for k in range(j + 1, N):",
"+for i in range(0, n - 2):",
"+ for j in range(i + 1, n - 1):",
"+ for k in range(j + 1, n):",
"- l[i] < l[j] + l[k]",
"- and l[j] < l[i] + l[k]",
"- and l[k] < l[j] + l[i]",
"+ l[i] != l[j]",
"- and l[k] != l[i]",
"- and l[i] != l[j]",
"+ and l[i] != l[k]",
"+ and abs(l[i] - l[j]) < l[k] < l[i] + l[j]",
"- c = c + 1",
"+ c += 1"
] | false | 0.037054 | 0.042353 | 0.874893 | [
"s199649973",
"s375429224"
] |
u678167152 | p02863 | python | s095954614 | s451451197 | 828 | 408 | 216,112 | 145,260 | Accepted | Accepted | 50.72 | def solve():
ans = 0
N, T = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
A.sort()
dp = [[0]*(T+A[-1][0]) for _ in range(N+1)]
for i in range(1,N+1):
for t in range(1,T+A[-1][0]):
if t<A[i-1][0] or t>=T+A[i-1][0]:
dp[i][t] = max(dp[i-1][t],dp[i][t-1])
else:
dp[i][t] = max([dp[i-1][t],dp[i][t-1],dp[i-1][t-A[i-1][0]]+A[i-1][1]])
ans = max(dp[-1])
return ans
print((solve())) | def solve():
N, T = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
A.sort()
dp = [[0]*(T+1) for _ in range(N+1)]
for i in range(N):
for j in range(0,T+1):
dp[i+1][j] = max(dp[i+1][j],dp[i][j])
if j<T:
t = min(T,j+A[i][0])
dp[i+1][t] = max(dp[i+1][t],dp[i][j]+A[i][1])
ans = dp[-1][-1]
return ans
print((solve())) | 15 | 14 | 470 | 405 | def solve():
ans = 0
N, T = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
A.sort()
dp = [[0] * (T + A[-1][0]) for _ in range(N + 1)]
for i in range(1, N + 1):
for t in range(1, T + A[-1][0]):
if t < A[i - 1][0] or t >= T + A[i - 1][0]:
dp[i][t] = max(dp[i - 1][t], dp[i][t - 1])
else:
dp[i][t] = max(
[
dp[i - 1][t],
dp[i][t - 1],
dp[i - 1][t - A[i - 1][0]] + A[i - 1][1],
]
)
ans = max(dp[-1])
return ans
print((solve()))
| def solve():
N, T = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
A.sort()
dp = [[0] * (T + 1) for _ in range(N + 1)]
for i in range(N):
for j in range(0, T + 1):
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
if j < T:
t = min(T, j + A[i][0])
dp[i + 1][t] = max(dp[i + 1][t], dp[i][j] + A[i][1])
ans = dp[-1][-1]
return ans
print((solve()))
| false | 6.666667 | [
"- ans = 0",
"- dp = [[0] * (T + A[-1][0]) for _ in range(N + 1)]",
"- for i in range(1, N + 1):",
"- for t in range(1, T + A[-1][0]):",
"- if t < A[i - 1][0] or t >= T + A[i - 1][0]:",
"- dp[i][t] = max(dp[i - 1][t], dp[i][t - 1])",
"- else:",
"- dp[i][t] = max(",
"- [",
"- dp[i - 1][t],",
"- dp[i][t - 1],",
"- dp[i - 1][t - A[i - 1][0]] + A[i - 1][1],",
"- ]",
"- )",
"- ans = max(dp[-1])",
"+ dp = [[0] * (T + 1) for _ in range(N + 1)]",
"+ for i in range(N):",
"+ for j in range(0, T + 1):",
"+ dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])",
"+ if j < T:",
"+ t = min(T, j + A[i][0])",
"+ dp[i + 1][t] = max(dp[i + 1][t], dp[i][j] + A[i][1])",
"+ ans = dp[-1][-1]"
] | false | 0.036401 | 0.10127 | 0.359446 | [
"s095954614",
"s451451197"
] |
u729939940 | p02923 | python | s485563125 | s473017916 | 70 | 60 | 11,132 | 11,132 | Accepted | Accepted | 14.29 | N = eval(input())
H = list(map(int, input().split()))
last_h = float('inf')
ans, cnt = 0, -1
for h in H:
if last_h >= h:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
last_h = h
print((max(ans, cnt))) | N = eval(input())
H = list(map(int, input().split()))
last_h = float('inf')
ans, cnt = 0, -1
for h in H:
if last_h >= h:
cnt += 1
else:
if ans < cnt:
ans = cnt
cnt = 0
last_h = h
print((ans if ans > cnt else cnt)) | 12 | 13 | 212 | 235 | N = eval(input())
H = list(map(int, input().split()))
last_h = float("inf")
ans, cnt = 0, -1
for h in H:
if last_h >= h:
cnt += 1
else:
ans = max(ans, cnt)
cnt = 0
last_h = h
print((max(ans, cnt)))
| N = eval(input())
H = list(map(int, input().split()))
last_h = float("inf")
ans, cnt = 0, -1
for h in H:
if last_h >= h:
cnt += 1
else:
if ans < cnt:
ans = cnt
cnt = 0
last_h = h
print((ans if ans > cnt else cnt))
| false | 7.692308 | [
"- ans = max(ans, cnt)",
"+ if ans < cnt:",
"+ ans = cnt",
"-print((max(ans, cnt)))",
"+print((ans if ans > cnt else cnt))"
] | false | 0.044205 | 0.10361 | 0.426645 | [
"s485563125",
"s473017916"
] |
u581403769 | p02675 | python | s438111078 | s482818586 | 26 | 22 | 9,084 | 9,004 | Accepted | Accepted | 15.38 | N = int(eval(input()))
x = N % 10
#xはNを10で割ったあまり
if x == 2 or x == 4 or x == 5 or x == 7 or x == 9:
k = 'hon'
elif x == 0 or x == 1 or x == 6 or x == 8:
k = 'pon'
elif x == 3:
k = 'bon'
print(k)
| N = int(eval(input()))
x = N % 10
#xはNを10で割ったあまり
if x == 2 or x == 4 or x == 5 or x == 7 or x == 9:
k = 'hon'
elif x == 0 or x == 1 or x == 6 or x == 8:
k = 'pon'
else:
k = 'bon'
print(k)
| 12 | 12 | 214 | 207 | N = int(eval(input()))
x = N % 10
# xはNを10で割ったあまり
if x == 2 or x == 4 or x == 5 or x == 7 or x == 9:
k = "hon"
elif x == 0 or x == 1 or x == 6 or x == 8:
k = "pon"
elif x == 3:
k = "bon"
print(k)
| N = int(eval(input()))
x = N % 10
# xはNを10で割ったあまり
if x == 2 or x == 4 or x == 5 or x == 7 or x == 9:
k = "hon"
elif x == 0 or x == 1 or x == 6 or x == 8:
k = "pon"
else:
k = "bon"
print(k)
| false | 0 | [
"-elif x == 3:",
"+else:"
] | false | 0.047106 | 0.044511 | 1.058295 | [
"s438111078",
"s482818586"
] |
u392319141 | p03319 | python | s049038929 | s344699395 | 40 | 18 | 13,880 | 4,280 | Accepted | Accepted | 55 | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = 1
N -= K
if N > 0:
ans += -(-N // (K - 1))
print(ans) | N, K = list(map(int, input().split()))
_ = eval(input())
ans = 1
N -= K
if N > 0:
ans += -(-N // (K - 1))
print(ans)
| 10 | 10 | 144 | 121 | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = 1
N -= K
if N > 0:
ans += -(-N // (K - 1))
print(ans)
| N, K = list(map(int, input().split()))
_ = eval(input())
ans = 1
N -= K
if N > 0:
ans += -(-N // (K - 1))
print(ans)
| false | 0 | [
"-A = list(map(int, input().split()))",
"+_ = eval(input())"
] | false | 0.041921 | 0.040976 | 1.023086 | [
"s049038929",
"s344699395"
] |
u191874006 | p03087 | python | s548384947 | s350194658 | 1,083 | 378 | 51,104 | 58,248 | Accepted | Accepted | 65.1 | #!/usr/bin/env python3
#ABC122 C
n,q = list(map(int,input().split()))
s = eval(input())
t = [0 for _ in range(n+1)]
for i in range(n):
t[i+1] = t[i] + (1 if s[i:i+2] =='AC' else 0)
for _ in range(q):
l,r = list(map(int,input().split()))
print((t[r-1] - t[l-1]))
| #!/usr/bin/env python3
#ABC122 C
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
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()))
n,q = LI()
s = list(eval(input()))
lst = [0]*n
for i in range(n-1):
if s[i] == 'A' and s[i+1] == 'C':
lst[i+1] = 1
lst = list(accumulate(lst))
for _ in range(q):
l,r = LI()
print((lst[r-1] - lst[l-1]))
| 13 | 29 | 269 | 732 | #!/usr/bin/env python3
# ABC122 C
n, q = list(map(int, input().split()))
s = eval(input())
t = [0 for _ in range(n + 1)]
for i in range(n):
t[i + 1] = t[i] + (1 if s[i : i + 2] == "AC" else 0)
for _ in range(q):
l, r = list(map(int, input().split()))
print((t[r - 1] - t[l - 1]))
| #!/usr/bin/env python3
# ABC122 C
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
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()))
n, q = LI()
s = list(eval(input()))
lst = [0] * n
for i in range(n - 1):
if s[i] == "A" and s[i + 1] == "C":
lst[i + 1] = 1
lst = list(accumulate(lst))
for _ in range(q):
l, r = LI()
print((lst[r - 1] - lst[l - 1]))
| false | 55.172414 | [
"-n, q = list(map(int, input().split()))",
"-s = eval(input())",
"-t = [0 for _ in range(n + 1)]",
"-for i in range(n):",
"- t[i + 1] = t[i] + (1 if s[i : i + 2] == \"AC\" else 0)",
"+import sys",
"+import math",
"+import bisect",
"+",
"+sys.setrecursionlimit(1000000000)",
"+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()))",
"+",
"+",
"+n, q = LI()",
"+s = list(eval(input()))",
"+lst = [0] * n",
"+for i in range(n - 1):",
"+ if s[i] == \"A\" and s[i + 1] == \"C\":",
"+ lst[i + 1] = 1",
"+lst = list(accumulate(lst))",
"- l, r = list(map(int, input().split()))",
"- print((t[r - 1] - t[l - 1]))",
"+ l, r = LI()",
"+ print((lst[r - 1] - lst[l - 1]))"
] | false | 0.041176 | 0.041022 | 1.003759 | [
"s548384947",
"s350194658"
] |
u187516587 | p02713 | python | s314425404 | s008126393 | 1,200 | 56 | 9,176 | 61,984 | Accepted | Accepted | 95.33 | from math import gcd
K=int(eval(input()))
a=0
for i in range(1,K+1):
for j in range(1,K+1):
t=gcd(i,j)
for k in range(1,K+1):
a+=gcd(t,k)
print(a)
| K=int(eval(input()))
N=3
pr=10**9+7
a=0
l=[None]*(K+1)
for i in range(K,0,-1):
t=pow(K//i,N,pr)
c=i*2
while c<=K:
t-=l[c]
c+=i
l[i]=t
a=(a+t*i)%pr
print(a) | 9 | 14 | 181 | 198 | from math import gcd
K = int(eval(input()))
a = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
t = gcd(i, j)
for k in range(1, K + 1):
a += gcd(t, k)
print(a)
| K = int(eval(input()))
N = 3
pr = 10**9 + 7
a = 0
l = [None] * (K + 1)
for i in range(K, 0, -1):
t = pow(K // i, N, pr)
c = i * 2
while c <= K:
t -= l[c]
c += i
l[i] = t
a = (a + t * i) % pr
print(a)
| false | 35.714286 | [
"-from math import gcd",
"-",
"+N = 3",
"+pr = 10**9 + 7",
"-for i in range(1, K + 1):",
"- for j in range(1, K + 1):",
"- t = gcd(i, j)",
"- for k in range(1, K + 1):",
"- a += gcd(t, k)",
"+l = [None] * (K + 1)",
"+for i in range(K, 0, -1):",
"+ t = pow(K // i, N, pr)",
"+ c = i * 2",
"+ while c <= K:",
"+ t -= l[c]",
"+ c += i",
"+ l[i] = t",
"+ a = (a + t * i) % pr"
] | false | 0.19547 | 0.035564 | 5.496276 | [
"s314425404",
"s008126393"
] |
u585482323 | p02641 | python | s072454512 | s422023177 | 153 | 60 | 65,576 | 62,024 | Accepted | Accepted | 60.78 | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
x,n = LI()
p = LI()
f = [1]*(200)
for i in p:
f[i] = 0
ans = x
m = 0
for i in range(200):
if f[i]:
d = abs(i-x)
if d < ans:
ans = d
m = i
print(m)
return
#Solve
if __name__ == "__main__":
solve()
| x, n = list(map(int, input(). split()))
m = [0]*200
ans = 0
if n > 0:
p = list(map(int, input(). split()))
else:
print(x)
quit()
for i in range(n):
l = abs(x-p[i])
m[l] += 1
if m[0] == 0:
print(x)
else:
for j in range(1, 200):
if m[j] < 2:
a = x-j
A = x+j
if a not in p:
ans = a
else:
ans = A
break
print(ans)
| 47 | 24 | 1,070 | 393 | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def I():
return int(sys.stdin.readline())
def LS():
return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
x, n = LI()
p = LI()
f = [1] * (200)
for i in p:
f[i] = 0
ans = x
m = 0
for i in range(200):
if f[i]:
d = abs(i - x)
if d < ans:
ans = d
m = i
print(m)
return
# Solve
if __name__ == "__main__":
solve()
| x, n = list(map(int, input().split()))
m = [0] * 200
ans = 0
if n > 0:
p = list(map(int, input().split()))
else:
print(x)
quit()
for i in range(n):
l = abs(x - p[i])
m[l] += 1
if m[0] == 0:
print(x)
else:
for j in range(1, 200):
if m[j] < 2:
a = x - j
A = x + j
if a not in p:
ans = a
else:
ans = A
break
print(ans)
| false | 48.93617 | [
"-#!usr/bin/env python3",
"-from collections import defaultdict, deque",
"-from heapq import heappush, heappop",
"-from itertools import permutations, accumulate",
"-import sys",
"-import math",
"-import bisect",
"-",
"-",
"-def LI():",
"- return [int(x) for x in sys.stdin.readline().split()]",
"-",
"-",
"-def I():",
"- return int(sys.stdin.readline())",
"-",
"-",
"-def LS():",
"- return [list(x) for x in sys.stdin.readline().split()]",
"-",
"-",
"-def S():",
"- res = list(sys.stdin.readline())",
"- if res[-1] == \"\\n\":",
"- return res[:-1]",
"- return res",
"-",
"-",
"-def IR(n):",
"- return [I() for i in range(n)]",
"-",
"-",
"-def LIR(n):",
"- return [LI() for i in range(n)]",
"-",
"-",
"-def SR(n):",
"- return [S() for i in range(n)]",
"-",
"-",
"-def LSR(n):",
"- return [LS() for i in range(n)]",
"-",
"-",
"-sys.setrecursionlimit(1000000)",
"-mod = 1000000007",
"-",
"-",
"-def solve():",
"- x, n = LI()",
"- p = LI()",
"- f = [1] * (200)",
"- for i in p:",
"- f[i] = 0",
"- ans = x",
"- m = 0",
"- for i in range(200):",
"- if f[i]:",
"- d = abs(i - x)",
"- if d < ans:",
"- ans = d",
"- m = i",
"- print(m)",
"- return",
"-",
"-",
"-# Solve",
"-if __name__ == \"__main__\":",
"- solve()",
"+x, n = list(map(int, input().split()))",
"+m = [0] * 200",
"+ans = 0",
"+if n > 0:",
"+ p = list(map(int, input().split()))",
"+else:",
"+ print(x)",
"+ quit()",
"+for i in range(n):",
"+ l = abs(x - p[i])",
"+ m[l] += 1",
"+if m[0] == 0:",
"+ print(x)",
"+else:",
"+ for j in range(1, 200):",
"+ if m[j] < 2:",
"+ a = x - j",
"+ A = x + j",
"+ if a not in p:",
"+ ans = a",
"+ else:",
"+ ans = A",
"+ break",
"+ print(ans)"
] | false | 0.120099 | 0.061464 | 1.953989 | [
"s072454512",
"s422023177"
] |
u408071652 | p02586 | python | s704802968 | s308408888 | 1,183 | 538 | 149,388 | 155,644 | Accepted | Accepted | 54.52 | import sys
def input():
return sys.stdin.readline().rstrip()
def main():
R, C, K = list(map(int, input().split()))
field = [[0 for j in range(C)] for i in range(R)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
field[r - 1][c - 1] += v
dp = [[0] * 4 for j in range(C)]
for i in range(R):
for j in range(C):
ct = field[i][j]
premax = max(dp[j])
if ct == 0:
if j>0:
dp[j][0] = max(dp[j - 1][0], premax)
else:
dp[j][0] = premax
for k in range(1, 4):
if j > 0:
dp[j][k] = dp[j - 1][k]
else:
if j>0:
dp[j][0] = max(dp[j - 1][0], premax)
dp[j][1] = max(ct + max(dp[j - 1][0], premax), dp[j - 1][1])
else:
dp[j][0] = premax
dp[j][1] = premax +ct
for k in range(2, 4):
if j > 0:
dp[j][k] = max(dp[j - 1][k - 1] + ct, dp[j - 1][k])
print((max(dp[C - 1])))
if __name__ == "__main__":
main()
| import sys
def input():
return sys.stdin.readline().rstrip()
def main():
R, C, K = list(map(int, input().split()))
field = [[0 for j in range(C)] for i in range(R)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
field[r - 1][c - 1] += v
# dp = [[0] * 4 for j in range(C)]
dp0 = [0] * C
dp1 = [0] * C
dp2 = [0] * C
dp3 = [0] * C
for i in range(R):
for j in range(C):
ct = field[i][j]
premax = max(dp0[j], dp1[j], dp2[j], dp3[j])
if ct == 0:
if j > 0:
dp0[j] = max(dp0[j - 1], premax)
dp1[j] = dp1[j - 1]
dp2[j] = dp2[j - 1]
dp3[j] = dp3[j - 1]
else:
dp0[j] = premax
# for k in range(1, 4):
# if j > 0:
# dp[j][k] = dp[j - 1][k]
#
# else:
# if j > 0:
# dp[j][0] = max(dp[j - 1][0], premax)
# dp[j][1] = max(ct + max(dp[j - 1][0], premax), dp[j - 1][1])
# else:
# dp[j][0] = premax
# dp[j][1] = premax + ct
# for k in range(2, 4):
# if j > 0:
# dp[j][k] = max(dp[j - 1][k - 1] + ct, dp[j - 1][k])
else:
if j > 0:
dp0[j] = max(dp0[j - 1], premax)
dp1[j] = max(ct + max(dp0[j - 1], premax), dp1[j - 1])
dp2[j] = max(dp1[j - 1] + ct, dp2[j - 1])
dp3[j] = max(dp2[j - 1] + ct, dp3[j - 1])
else:
dp0[j] =premax
dp1[j] = premax+ct
#print(max(dp[C - 1]))
print((max(dp0[C-1], dp1[C-1], dp2[C-1], dp3[C-1])))
if __name__ == "__main__":
main()
| 48 | 69 | 1,250 | 1,987 | import sys
def input():
return sys.stdin.readline().rstrip()
def main():
R, C, K = list(map(int, input().split()))
field = [[0 for j in range(C)] for i in range(R)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
field[r - 1][c - 1] += v
dp = [[0] * 4 for j in range(C)]
for i in range(R):
for j in range(C):
ct = field[i][j]
premax = max(dp[j])
if ct == 0:
if j > 0:
dp[j][0] = max(dp[j - 1][0], premax)
else:
dp[j][0] = premax
for k in range(1, 4):
if j > 0:
dp[j][k] = dp[j - 1][k]
else:
if j > 0:
dp[j][0] = max(dp[j - 1][0], premax)
dp[j][1] = max(ct + max(dp[j - 1][0], premax), dp[j - 1][1])
else:
dp[j][0] = premax
dp[j][1] = premax + ct
for k in range(2, 4):
if j > 0:
dp[j][k] = max(dp[j - 1][k - 1] + ct, dp[j - 1][k])
print((max(dp[C - 1])))
if __name__ == "__main__":
main()
| import sys
def input():
return sys.stdin.readline().rstrip()
def main():
R, C, K = list(map(int, input().split()))
field = [[0 for j in range(C)] for i in range(R)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
field[r - 1][c - 1] += v
# dp = [[0] * 4 for j in range(C)]
dp0 = [0] * C
dp1 = [0] * C
dp2 = [0] * C
dp3 = [0] * C
for i in range(R):
for j in range(C):
ct = field[i][j]
premax = max(dp0[j], dp1[j], dp2[j], dp3[j])
if ct == 0:
if j > 0:
dp0[j] = max(dp0[j - 1], premax)
dp1[j] = dp1[j - 1]
dp2[j] = dp2[j - 1]
dp3[j] = dp3[j - 1]
else:
dp0[j] = premax
# for k in range(1, 4):
# if j > 0:
# dp[j][k] = dp[j - 1][k]
#
# else:
# if j > 0:
# dp[j][0] = max(dp[j - 1][0], premax)
# dp[j][1] = max(ct + max(dp[j - 1][0], premax), dp[j - 1][1])
# else:
# dp[j][0] = premax
# dp[j][1] = premax + ct
# for k in range(2, 4):
# if j > 0:
# dp[j][k] = max(dp[j - 1][k - 1] + ct, dp[j - 1][k])
else:
if j > 0:
dp0[j] = max(dp0[j - 1], premax)
dp1[j] = max(ct + max(dp0[j - 1], premax), dp1[j - 1])
dp2[j] = max(dp1[j - 1] + ct, dp2[j - 1])
dp3[j] = max(dp2[j - 1] + ct, dp3[j - 1])
else:
dp0[j] = premax
dp1[j] = premax + ct
# print(max(dp[C - 1]))
print((max(dp0[C - 1], dp1[C - 1], dp2[C - 1], dp3[C - 1])))
if __name__ == "__main__":
main()
| false | 30.434783 | [
"- dp = [[0] * 4 for j in range(C)]",
"+ # dp = [[0] * 4 for j in range(C)]",
"+ dp0 = [0] * C",
"+ dp1 = [0] * C",
"+ dp2 = [0] * C",
"+ dp3 = [0] * C",
"- premax = max(dp[j])",
"+ premax = max(dp0[j], dp1[j], dp2[j], dp3[j])",
"- dp[j][0] = max(dp[j - 1][0], premax)",
"+ dp0[j] = max(dp0[j - 1], premax)",
"+ dp1[j] = dp1[j - 1]",
"+ dp2[j] = dp2[j - 1]",
"+ dp3[j] = dp3[j - 1]",
"- dp[j][0] = premax",
"- for k in range(1, 4):",
"- if j > 0:",
"- dp[j][k] = dp[j - 1][k]",
"+ dp0[j] = premax",
"+ # for k in range(1, 4):",
"+ # if j > 0:",
"+ # dp[j][k] = dp[j - 1][k]",
"+ #",
"+ # else:",
"+ # if j > 0:",
"+ # dp[j][0] = max(dp[j - 1][0], premax)",
"+ # dp[j][1] = max(ct + max(dp[j - 1][0], premax), dp[j - 1][1])",
"+ # else:",
"+ # dp[j][0] = premax",
"+ # dp[j][1] = premax + ct",
"+ # for k in range(2, 4):",
"+ # if j > 0:",
"+ # dp[j][k] = max(dp[j - 1][k - 1] + ct, dp[j - 1][k])",
"- dp[j][0] = max(dp[j - 1][0], premax)",
"- dp[j][1] = max(ct + max(dp[j - 1][0], premax), dp[j - 1][1])",
"+ dp0[j] = max(dp0[j - 1], premax)",
"+ dp1[j] = max(ct + max(dp0[j - 1], premax), dp1[j - 1])",
"+ dp2[j] = max(dp1[j - 1] + ct, dp2[j - 1])",
"+ dp3[j] = max(dp2[j - 1] + ct, dp3[j - 1])",
"- dp[j][0] = premax",
"- dp[j][1] = premax + ct",
"- for k in range(2, 4):",
"- if j > 0:",
"- dp[j][k] = max(dp[j - 1][k - 1] + ct, dp[j - 1][k])",
"- print((max(dp[C - 1])))",
"+ dp0[j] = premax",
"+ dp1[j] = premax + ct",
"+ # print(max(dp[C - 1]))",
"+ print((max(dp0[C - 1], dp1[C - 1], dp2[C - 1], dp3[C - 1])))"
] | false | 0.039766 | 0.041433 | 0.959782 | [
"s704802968",
"s308408888"
] |
u585482323 | p03682 | python | s986247720 | s515269694 | 1,465 | 1,342 | 125,096 | 61,520 | Accepted | Accepted | 8.4 | #!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = SR()
return l
mod = 1000000007
#A
#B
#C
#D
def root(x):
if x == par[x]:
return x
par[x] = root(par[x])
return par[x]
def same(x,y):
return root(x) == root(y)
def unite(x,y):
x = root(x)
y = root(y)
if rank[x] < rank[y]:
par[x] = y
else:
par[y] = x
if rank[x] == rank[y]:
rank[x] += 1
n = I()
v = LIR(n)
l = defaultdict(int)
for i in range(n):
v[i].append(i)
par = [i for i in range(n)]
rank = [0 for i in range(n)]
v.sort(key = lambda x:x[0])
for i in range(n-1):
l[i] = [v[i][2],v[i+1][2],v[i+1][0]-v[i][0]]
v.sort(key = lambda x:x[1])
for i in range(n-1):
l[i+n-1] = [v[i][2],v[i+1][2],v[i+1][1]-v[i][1]]
l = list(l.values())
l.sort(key = lambda x:x[2])
k = 0
ans = 0
for i in range(2*n-2):
x,y,c = l[i]
if not same(x,y):
k += 1
ans += c
unite(x,y)
if k == n-1:break
print(ans)
#E
#F
#G
#H
#I
#J
#K
#L
#M
#N
#O
#P
#Q
#R
#S
#T
| #!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = SR()
return l
mod = 1000000007
#A
#B
#C
#D
def root(x):
if x == par[x]:
return x
par[x] = root(par[x])
return par[x]
def same(x,y):
return root(x) == root(y)
def unite(x,y):
x = root(x)
y = root(y)
if rank[x] < rank[y]:
par[x] = y
else:
par[y] = x
if rank[x] == rank[y]:
rank[x] += 1
n = I()
v = LIR(n)
l = [None for i in range(2*n-2)]
for i in range(n):
v[i].append(i)
par = [i for i in range(n)]
rank = [0 for i in range(n)]
v.sort(key = lambda x:x[0])
for i in range(n-1):
l[i] = [v[i][2],v[i+1][2],v[i+1][0]-v[i][0]]
v.sort(key = lambda x:x[1])
for i in range(n-1):
l[i+n-1] = [v[i][2],v[i+1][2],v[i+1][1]-v[i][1]]
l.sort(key = lambda x:x[2])
k = 0
ans = 0
for i in range(2*n-2):
x,y,c = l[i]
if not same(x,y):
k += 1
ans += c
unite(x,y)
if k == n-1:break
print(ans)
#E
#F
#G
#H
#I
#J
#K
#L
#M
#N
#O
#P
#Q
#R
#S
#T
| 110 | 109 | 1,791 | 1,781 | #!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI():
return list(map(int, sys.stdin.readline().split()))
def I():
return int(sys.stdin.readline())
def LS():
return list(map(list, sys.stdin.readline().split()))
def S():
return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):
l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):
l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):
l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):
l[i] = SR()
return l
mod = 1000000007
# A
# B
# C
# D
def root(x):
if x == par[x]:
return x
par[x] = root(par[x])
return par[x]
def same(x, y):
return root(x) == root(y)
def unite(x, y):
x = root(x)
y = root(y)
if rank[x] < rank[y]:
par[x] = y
else:
par[y] = x
if rank[x] == rank[y]:
rank[x] += 1
n = I()
v = LIR(n)
l = defaultdict(int)
for i in range(n):
v[i].append(i)
par = [i for i in range(n)]
rank = [0 for i in range(n)]
v.sort(key=lambda x: x[0])
for i in range(n - 1):
l[i] = [v[i][2], v[i + 1][2], v[i + 1][0] - v[i][0]]
v.sort(key=lambda x: x[1])
for i in range(n - 1):
l[i + n - 1] = [v[i][2], v[i + 1][2], v[i + 1][1] - v[i][1]]
l = list(l.values())
l.sort(key=lambda x: x[2])
k = 0
ans = 0
for i in range(2 * n - 2):
x, y, c = l[i]
if not same(x, y):
k += 1
ans += c
unite(x, y)
if k == n - 1:
break
print(ans)
# E
# F
# G
# H
# I
# J
# K
# L
# M
# N
# O
# P
# Q
# R
# S
# T
| #!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI():
return list(map(int, sys.stdin.readline().split()))
def I():
return int(sys.stdin.readline())
def LS():
return list(map(list, sys.stdin.readline().split()))
def S():
return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):
l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):
l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):
l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):
l[i] = SR()
return l
mod = 1000000007
# A
# B
# C
# D
def root(x):
if x == par[x]:
return x
par[x] = root(par[x])
return par[x]
def same(x, y):
return root(x) == root(y)
def unite(x, y):
x = root(x)
y = root(y)
if rank[x] < rank[y]:
par[x] = y
else:
par[y] = x
if rank[x] == rank[y]:
rank[x] += 1
n = I()
v = LIR(n)
l = [None for i in range(2 * n - 2)]
for i in range(n):
v[i].append(i)
par = [i for i in range(n)]
rank = [0 for i in range(n)]
v.sort(key=lambda x: x[0])
for i in range(n - 1):
l[i] = [v[i][2], v[i + 1][2], v[i + 1][0] - v[i][0]]
v.sort(key=lambda x: x[1])
for i in range(n - 1):
l[i + n - 1] = [v[i][2], v[i + 1][2], v[i + 1][1] - v[i][1]]
l.sort(key=lambda x: x[2])
k = 0
ans = 0
for i in range(2 * n - 2):
x, y, c = l[i]
if not same(x, y):
k += 1
ans += c
unite(x, y)
if k == n - 1:
break
print(ans)
# E
# F
# G
# H
# I
# J
# K
# L
# M
# N
# O
# P
# Q
# R
# S
# T
| false | 0.909091 | [
"-l = defaultdict(int)",
"+l = [None for i in range(2 * n - 2)]",
"-l = list(l.values())"
] | false | 0.049516 | 0.088735 | 0.558026 | [
"s986247720",
"s515269694"
] |
u440566786 | p02684 | python | s270938763 | s983392617 | 352 | 92 | 170,356 | 93,016 | Accepted | Accepted | 73.86 | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
n, k = list(map(int, input().split()))
b = list([int(x) - 1 for x in input().split()])
now = 0
while k:
if k & 1: now = b[now]
b = [b[b[i]] for i in range(n)]
k >>= 1
print((now + 1))
resolve() | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
n, k = list(map(int, input().split()))
f = list([int(x) - 1 for x in input().split()])
step = [-1] * n
step[0] = 0
now = 0
while step[f[now]] == -1:
step[f[now]] = step[now] + 1
now = f[now]
if step[now] == k:
print((now + 1))
return
k -= step[now]
loop = step[now] - step[f[now]] + 1
k %= loop
for _ in range(k):
now = f[now]
print((now + 1))
resolve() | 16 | 25 | 398 | 621 | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda: sys.stdin.readline().rstrip()
def resolve():
n, k = list(map(int, input().split()))
b = list([int(x) - 1 for x in input().split()])
now = 0
while k:
if k & 1:
now = b[now]
b = [b[b[i]] for i in range(n)]
k >>= 1
print((now + 1))
resolve()
| import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda: sys.stdin.readline().rstrip()
def resolve():
n, k = list(map(int, input().split()))
f = list([int(x) - 1 for x in input().split()])
step = [-1] * n
step[0] = 0
now = 0
while step[f[now]] == -1:
step[f[now]] = step[now] + 1
now = f[now]
if step[now] == k:
print((now + 1))
return
k -= step[now]
loop = step[now] - step[f[now]] + 1
k %= loop
for _ in range(k):
now = f[now]
print((now + 1))
resolve()
| false | 36 | [
"- b = list([int(x) - 1 for x in input().split()])",
"+ f = list([int(x) - 1 for x in input().split()])",
"+ step = [-1] * n",
"+ step[0] = 0",
"- while k:",
"- if k & 1:",
"- now = b[now]",
"- b = [b[b[i]] for i in range(n)]",
"- k >>= 1",
"+ while step[f[now]] == -1:",
"+ step[f[now]] = step[now] + 1",
"+ now = f[now]",
"+ if step[now] == k:",
"+ print((now + 1))",
"+ return",
"+ k -= step[now]",
"+ loop = step[now] - step[f[now]] + 1",
"+ k %= loop",
"+ for _ in range(k):",
"+ now = f[now]"
] | false | 0.035711 | 0.114307 | 0.312416 | [
"s270938763",
"s983392617"
] |
u919633157 | p03457 | python | s139865281 | s244326677 | 380 | 197 | 3,064 | 3,060 | Accepted | Accepted | 48.16 | n=int(eval(input()))
ans='Yes'
dt=0
cur=0
cur_t=0
dist=0
for i in range(n):
t,x,y=list(map(int,input().split()))
dist=abs(cur-(x+y))
cur=x+y
dt=t-cur_t
cur_t=t
if dist>dt or dt%2!=(dist)%2:
ans='No'
break
print(ans)
| import sys
input=sys.stdin.readline
n=int(eval(input()))
pt=0
pxy=0
for i in range(n):
t,x,y=list(map(int,input().split()))
dt=t-pt
dxy=abs(x+y-pxy)
if dxy>dt or dt%2!=dxy%2:
print('No')
exit()
else:
print('Yes') | 18 | 16 | 234 | 253 | n = int(eval(input()))
ans = "Yes"
dt = 0
cur = 0
cur_t = 0
dist = 0
for i in range(n):
t, x, y = list(map(int, input().split()))
dist = abs(cur - (x + y))
cur = x + y
dt = t - cur_t
cur_t = t
if dist > dt or dt % 2 != (dist) % 2:
ans = "No"
break
print(ans)
| import sys
input = sys.stdin.readline
n = int(eval(input()))
pt = 0
pxy = 0
for i in range(n):
t, x, y = list(map(int, input().split()))
dt = t - pt
dxy = abs(x + y - pxy)
if dxy > dt or dt % 2 != dxy % 2:
print("No")
exit()
else:
print("Yes")
| false | 11.111111 | [
"+import sys",
"+",
"+input = sys.stdin.readline",
"-ans = \"Yes\"",
"-dt = 0",
"-cur = 0",
"-cur_t = 0",
"-dist = 0",
"+pt = 0",
"+pxy = 0",
"- dist = abs(cur - (x + y))",
"- cur = x + y",
"- dt = t - cur_t",
"- cur_t = t",
"- if dist > dt or dt % 2 != (dist) % 2:",
"- ans = \"No\"",
"- break",
"-print(ans)",
"+ dt = t - pt",
"+ dxy = abs(x + y - pxy)",
"+ if dxy > dt or dt % 2 != dxy % 2:",
"+ print(\"No\")",
"+ exit()",
"+else:",
"+ print(\"Yes\")"
] | false | 0.03729 | 0.043656 | 0.85419 | [
"s139865281",
"s244326677"
] |
u797550216 | p03775 | python | s198623330 | s146282380 | 183 | 30 | 12,508 | 3,060 | Accepted | Accepted | 83.61 | import numpy as np
n = int(eval(input()))
sqrt_n = int(round(np.sqrt(n)))
i = 0
while True:
if n % (sqrt_n+i) == 0:
ans = [sqrt_n+i,int(n/(sqrt_n+i))]
break
if n % (sqrt_n-i) == 0:
ans = [sqrt_n-i,int(n/(sqrt_n-i))]
break
i += 1
len_ans = [0,0]
len_ans[0] = len(str(ans[0]))
len_ans[1] = len(str(ans[1]))
print((max(len_ans))) | import math
n = int(eval(input()))
min_n = n
for i in range(1,int(math.sqrt(n))+1):
if n % i == 0:
a = len(str(i))
b = len(str(int(n/i)))
if min_n > max(a,b):
min_n = max(a,b)
print(min_n) | 25 | 15 | 406 | 249 | import numpy as np
n = int(eval(input()))
sqrt_n = int(round(np.sqrt(n)))
i = 0
while True:
if n % (sqrt_n + i) == 0:
ans = [sqrt_n + i, int(n / (sqrt_n + i))]
break
if n % (sqrt_n - i) == 0:
ans = [sqrt_n - i, int(n / (sqrt_n - i))]
break
i += 1
len_ans = [0, 0]
len_ans[0] = len(str(ans[0]))
len_ans[1] = len(str(ans[1]))
print((max(len_ans)))
| import math
n = int(eval(input()))
min_n = n
for i in range(1, int(math.sqrt(n)) + 1):
if n % i == 0:
a = len(str(i))
b = len(str(int(n / i)))
if min_n > max(a, b):
min_n = max(a, b)
print(min_n)
| false | 40 | [
"-import numpy as np",
"+import math",
"-sqrt_n = int(round(np.sqrt(n)))",
"-i = 0",
"-while True:",
"- if n % (sqrt_n + i) == 0:",
"- ans = [sqrt_n + i, int(n / (sqrt_n + i))]",
"- break",
"- if n % (sqrt_n - i) == 0:",
"- ans = [sqrt_n - i, int(n / (sqrt_n - i))]",
"- break",
"- i += 1",
"-len_ans = [0, 0]",
"-len_ans[0] = len(str(ans[0]))",
"-len_ans[1] = len(str(ans[1]))",
"-print((max(len_ans)))",
"+min_n = n",
"+for i in range(1, int(math.sqrt(n)) + 1):",
"+ if n % i == 0:",
"+ a = len(str(i))",
"+ b = len(str(int(n / i)))",
"+ if min_n > max(a, b):",
"+ min_n = max(a, b)",
"+print(min_n)"
] | false | 0.41539 | 0.043049 | 9.649176 | [
"s198623330",
"s146282380"
] |
u450147945 | p03448 | python | s367987714 | s510318846 | 54 | 26 | 9,032 | 9,192 | Accepted | Accepted | 51.85 | A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
ans = 0
for i in range(A+1):
for j in range(B+1):
for k in range(C+1):
if 500*i+100*j+50*k == X:
ans += 1
print(ans) | A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
ans = 0
for i in range(A+1):
for j in range(B+1):
if (X - (500*i+100*j)) % 50 == 0 and X - (500*i+100*j) >= 0 and (X - (500*i+100*j)) // 50 <= C:
ans += 1
print(ans) | 13 | 12 | 238 | 270 | A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
ans = 0
for i in range(A + 1):
for j in range(B + 1):
for k in range(C + 1):
if 500 * i + 100 * j + 50 * k == X:
ans += 1
print(ans)
| A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
X = int(eval(input()))
ans = 0
for i in range(A + 1):
for j in range(B + 1):
if (
(X - (500 * i + 100 * j)) % 50 == 0
and X - (500 * i + 100 * j) >= 0
and (X - (500 * i + 100 * j)) // 50 <= C
):
ans += 1
print(ans)
| false | 7.692308 | [
"- for k in range(C + 1):",
"- if 500 * i + 100 * j + 50 * k == X:",
"- ans += 1",
"+ if (",
"+ (X - (500 * i + 100 * j)) % 50 == 0",
"+ and X - (500 * i + 100 * j) >= 0",
"+ and (X - (500 * i + 100 * j)) // 50 <= C",
"+ ):",
"+ ans += 1"
] | false | 0.076595 | 0.045995 | 1.665307 | [
"s367987714",
"s510318846"
] |
u729939940 | p03290 | python | s561459272 | s883344138 | 21 | 18 | 3,188 | 3,064 | Accepted | Accepted | 14.29 | D, G = list(map(int, input().split()))
PC = [0] + [list(map(int, input().split())) for _ in range(D)]
def dfs(i, g):
if i == 0:
return 1e9
m = min(g // (i * 100), PC[i][0])
s = 100 * i * m
if m == PC[i][0]:
s += PC[i][1]
if s < g:
m += dfs(i - 1, g - s)
return min(m, dfs(i - 1, g))
print((dfs(D, G))) | D, G = list(map(int, input().split()))
PC = [0] + [list(map(int, input().split())) for _ in range(D)]
#print(PC)
def dfs(i, g):
if i == 0:
return 1e9
m = min(g // (i * 100), PC[i][0])
#print("m: " + str(m))
s = 100 * i * m
#print("s: " + str(s))
if m == PC[i][0]:
s += PC[i][1]
if s < g:
m += dfs(i - 1, g - s)
return min(m, dfs(i - 1, g))
print((dfs(D, G))) | 13 | 16 | 353 | 393 | D, G = list(map(int, input().split()))
PC = [0] + [list(map(int, input().split())) for _ in range(D)]
def dfs(i, g):
if i == 0:
return 1e9
m = min(g // (i * 100), PC[i][0])
s = 100 * i * m
if m == PC[i][0]:
s += PC[i][1]
if s < g:
m += dfs(i - 1, g - s)
return min(m, dfs(i - 1, g))
print((dfs(D, G)))
| D, G = list(map(int, input().split()))
PC = [0] + [list(map(int, input().split())) for _ in range(D)]
# print(PC)
def dfs(i, g):
if i == 0:
return 1e9
m = min(g // (i * 100), PC[i][0])
# print("m: " + str(m))
s = 100 * i * m
# print("s: " + str(s))
if m == PC[i][0]:
s += PC[i][1]
if s < g:
m += dfs(i - 1, g - s)
return min(m, dfs(i - 1, g))
print((dfs(D, G)))
| false | 18.75 | [
"-",
"-",
"+# print(PC)",
"+ # print(\"m: \" + str(m))",
"+ # print(\"s: \" + str(s))"
] | false | 0.040769 | 0.154723 | 0.263499 | [
"s561459272",
"s883344138"
] |
u022979415 | p03241 | python | s543528369 | s105887809 | 1,784 | 22 | 2,940 | 3,060 | Accepted | Accepted | 98.77 | def main():
N, M = list(map(int, input().split(" ")))
for i in range(M // N, 0, -1):
if M % i == 0 and i <= M / N:
print(i)
break
if __name__ == '__main__':
main() | def main():
n, m = list(map(int, input().split()))
f = [1, m]
i = 2
while i * i <= m:
if m % i == 0:
f.append(i)
if m != i * i:
f.append(m // i)
i += 1
f.sort()
answer = 0
for ff in f:
if n <= ff:
answer = m // ff
break
print(answer)
if __name__ == '__main__':
main()
| 10 | 22 | 212 | 410 | def main():
N, M = list(map(int, input().split(" ")))
for i in range(M // N, 0, -1):
if M % i == 0 and i <= M / N:
print(i)
break
if __name__ == "__main__":
main()
| def main():
n, m = list(map(int, input().split()))
f = [1, m]
i = 2
while i * i <= m:
if m % i == 0:
f.append(i)
if m != i * i:
f.append(m // i)
i += 1
f.sort()
answer = 0
for ff in f:
if n <= ff:
answer = m // ff
break
print(answer)
if __name__ == "__main__":
main()
| false | 54.545455 | [
"- N, M = list(map(int, input().split(\" \")))",
"- for i in range(M // N, 0, -1):",
"- if M % i == 0 and i <= M / N:",
"- print(i)",
"+ n, m = list(map(int, input().split()))",
"+ f = [1, m]",
"+ i = 2",
"+ while i * i <= m:",
"+ if m % i == 0:",
"+ f.append(i)",
"+ if m != i * i:",
"+ f.append(m // i)",
"+ i += 1",
"+ f.sort()",
"+ answer = 0",
"+ for ff in f:",
"+ if n <= ff:",
"+ answer = m // ff",
"+ print(answer)"
] | false | 0.07003 | 0.050986 | 1.373493 | [
"s543528369",
"s105887809"
] |
u796942881 | p02881 | python | s469355281 | s442593056 | 209 | 120 | 3,560 | 3,560 | Accepted | Accepted | 42.58 | def divisor(n):
# 約数
return [[i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0]
def main():
N = int(eval(input()))
print((divisor(N)[-1][0] + divisor(N)[-1][1] - 2))
return
main()
| def divisor(n):
# 約数
return [[i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0]
def main():
N = int(eval(input()))
rslt = divisor(N)
print((rslt[-1][0] + rslt[-1][1] - 2))
return
main()
| 12 | 13 | 220 | 231 | def divisor(n):
# 約数
return [[i, n // i] for i in range(1, int(n**0.5) + 1) if n % i == 0]
def main():
N = int(eval(input()))
print((divisor(N)[-1][0] + divisor(N)[-1][1] - 2))
return
main()
| def divisor(n):
# 約数
return [[i, n // i] for i in range(1, int(n**0.5) + 1) if n % i == 0]
def main():
N = int(eval(input()))
rslt = divisor(N)
print((rslt[-1][0] + rslt[-1][1] - 2))
return
main()
| false | 7.692308 | [
"- print((divisor(N)[-1][0] + divisor(N)[-1][1] - 2))",
"+ rslt = divisor(N)",
"+ print((rslt[-1][0] + rslt[-1][1] - 2))"
] | false | 0.051375 | 0.047891 | 1.072754 | [
"s469355281",
"s442593056"
] |
u323776907 | p02712 | python | s718530453 | s323393572 | 330 | 142 | 48,512 | 9,076 | Accepted | Accepted | 56.97 | a = int(eval(input()))
sum = 0
list_number = []
for i in range(a):
list_number.append(i + 1)
for i in list_number:
if i % 3 == 0 and i % 5 == 0:
pass
elif i % 3 == 0:
pass
elif i % 5 == 0:
pass
else:
sum = sum + i
print(sum) | n = int(eval(input()))
sum = 0
for i in range(1, n+1):
if i % 3 != 0 and i % 5 != 0:
sum += i
print(sum)
| 15 | 6 | 284 | 116 | a = int(eval(input()))
sum = 0
list_number = []
for i in range(a):
list_number.append(i + 1)
for i in list_number:
if i % 3 == 0 and i % 5 == 0:
pass
elif i % 3 == 0:
pass
elif i % 5 == 0:
pass
else:
sum = sum + i
print(sum)
| n = int(eval(input()))
sum = 0
for i in range(1, n + 1):
if i % 3 != 0 and i % 5 != 0:
sum += i
print(sum)
| false | 60 | [
"-a = int(eval(input()))",
"+n = int(eval(input()))",
"-list_number = []",
"-for i in range(a):",
"- list_number.append(i + 1)",
"-for i in list_number:",
"- if i % 3 == 0 and i % 5 == 0:",
"- pass",
"- elif i % 3 == 0:",
"- pass",
"- elif i % 5 == 0:",
"- pass",
"- else:",
"- sum = sum + i",
"+for i in range(1, n + 1):",
"+ if i % 3 != 0 and i % 5 != 0:",
"+ sum += i"
] | false | 0.233729 | 0.736841 | 0.317204 | [
"s718530453",
"s323393572"
] |
u228636605 | p02755 | python | s722077375 | s246924690 | 19 | 17 | 2,940 | 3,060 | Accepted | Accepted | 10.53 | import math
import sys
a , b = list(map(int , input().split()))
for i in range(2000):
if math.floor(i * 0.08) == a and math.floor(i * 0.1) == b:
print(i)
sys.exit()
print((-1)) | import math
import sys
a , b = list(map(int , input().split()))
for i in range(1001):
if math.floor(i * 0.08) == a and math.floor(i * 0.1) == b:
print(i)
sys.exit()
print((-1)) | 10 | 10 | 199 | 199 | import math
import sys
a, b = list(map(int, input().split()))
for i in range(2000):
if math.floor(i * 0.08) == a and math.floor(i * 0.1) == b:
print(i)
sys.exit()
print((-1))
| import math
import sys
a, b = list(map(int, input().split()))
for i in range(1001):
if math.floor(i * 0.08) == a and math.floor(i * 0.1) == b:
print(i)
sys.exit()
print((-1))
| false | 0 | [
"-for i in range(2000):",
"+for i in range(1001):"
] | false | 0.151924 | 0.103557 | 1.467061 | [
"s722077375",
"s246924690"
] |
u357751375 | p03993 | python | s572282671 | s500620525 | 79 | 73 | 20,712 | 20,632 | Accepted | Accepted | 7.59 | n = int(eval(input()))
a = list(map(int,input().split()))
c = 0
for i in range(n):
if a[i] == -1:
pass
elif a[a[i] - 1] - 1 == i:
c += 1
a[a[i] - 1] = -1
a[i] = -1
else:
pass
print(c) | n = int(eval(input()))
a = list(map(int,input().split()))
ans = 0
for i in range(n):
if a[a[i]-1]-1 == i:
ans += 1
print((ans // 2)) | 15 | 7 | 245 | 142 | n = int(eval(input()))
a = list(map(int, input().split()))
c = 0
for i in range(n):
if a[i] == -1:
pass
elif a[a[i] - 1] - 1 == i:
c += 1
a[a[i] - 1] = -1
a[i] = -1
else:
pass
print(c)
| n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(n):
if a[a[i] - 1] - 1 == i:
ans += 1
print((ans // 2))
| false | 53.333333 | [
"-c = 0",
"+ans = 0",
"- if a[i] == -1:",
"- pass",
"- elif a[a[i] - 1] - 1 == i:",
"- c += 1",
"- a[a[i] - 1] = -1",
"- a[i] = -1",
"- else:",
"- pass",
"-print(c)",
"+ if a[a[i] - 1] - 1 == i:",
"+ ans += 1",
"+print((ans // 2))"
] | false | 0.045698 | 0.04527 | 1.009459 | [
"s572282671",
"s500620525"
] |
u439396449 | p03078 | python | s320374866 | s364569792 | 1,792 | 113 | 161,104 | 8,708 | Accepted | Accepted | 93.69 | X, Y, Z, K = list(map(int, input().split()))
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
C = [int(x) for x in input().split()]
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
D = []
for a in A:
for b in B:
D.append(a + b)
D.sort(reverse=True)
D = D[:K]
E = []
for c in C:
for d in D:
E.append(c + d)
E.sort(reverse=True)
E = E[:K]
for e in E:
print(e)
| X, Y, Z, K = list(map(int, input().split()))
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
C = [int(x) for x in input().split()]
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
D = []
for i in range(X):
for j in range(Y):
if (i + 1) * (j + 1) > K:
break
for k in range(Z):
if (i + 1) * (j + 1) * (k + 1) > K:
break
D.append(A[i] + B[j] + C[k])
D.sort(reverse=True)
D = D[:K]
for d in D:
print(d)
| 25 | 22 | 449 | 534 | X, Y, Z, K = list(map(int, input().split()))
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
C = [int(x) for x in input().split()]
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
D = []
for a in A:
for b in B:
D.append(a + b)
D.sort(reverse=True)
D = D[:K]
E = []
for c in C:
for d in D:
E.append(c + d)
E.sort(reverse=True)
E = E[:K]
for e in E:
print(e)
| X, Y, Z, K = list(map(int, input().split()))
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
C = [int(x) for x in input().split()]
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
D = []
for i in range(X):
for j in range(Y):
if (i + 1) * (j + 1) > K:
break
for k in range(Z):
if (i + 1) * (j + 1) * (k + 1) > K:
break
D.append(A[i] + B[j] + C[k])
D.sort(reverse=True)
D = D[:K]
for d in D:
print(d)
| false | 12 | [
"-for a in A:",
"- for b in B:",
"- D.append(a + b)",
"+for i in range(X):",
"+ for j in range(Y):",
"+ if (i + 1) * (j + 1) > K:",
"+ break",
"+ for k in range(Z):",
"+ if (i + 1) * (j + 1) * (k + 1) > K:",
"+ break",
"+ D.append(A[i] + B[j] + C[k])",
"-E = []",
"-for c in C:",
"- for d in D:",
"- E.append(c + d)",
"-E.sort(reverse=True)",
"-E = E[:K]",
"-for e in E:",
"- print(e)",
"+for d in D:",
"+ print(d)"
] | false | 0.206625 | 0.036419 | 5.673553 | [
"s320374866",
"s364569792"
] |
u535659144 | p02695 | python | s502581324 | s728781820 | 1,200 | 1,046 | 67,752 | 23,224 | Accepted | Accepted | 12.83 | import math
from collections import deque
n,m,q=[int(_) for _ in input().split()]
lista=[[int(i) for i in input().split()] for j in range(q)]
v=deque() #0,0,0,0,0....,0
def make(a,b,c): #a=list b=maxlen c=max
global v
if len(a)==b:
v.append(a)
else:
for i in range(a[-1],c+1):
make(a+deque([i]),b,c)
for t in range(1,m+1):
make(deque([t]),n,m)
max=0
for j in v:
point=0
for l in lista:
if j[l[1]-1]-j[l[0]-1]==l[2]:
point+=l[3]
if max<point:
max=point
print(max) | from collections import deque
n,m,q=[int(_) for _ in input().split()]
lista=[[int(i) for i in input().split()] for j in range(q)]
v=deque() #0,0,0,0,0....,0
def make(a,b,c): #a=list b=maxlen c=max
global v
if len(a)==b:
v.append(a)
else:
for i in range(a[-1],c+1):
make(a+[i],b,c)
for t in range(1,m+1):
make([t],n,m)
max=0
for j in v:
point=0
for l in lista:
if j[l[1]-1]-j[l[0]-1]==l[2]:
point+=l[3]
if max<point:
max=point
print(max)
| 23 | 22 | 569 | 543 | import math
from collections import deque
n, m, q = [int(_) for _ in input().split()]
lista = [[int(i) for i in input().split()] for j in range(q)]
v = deque() # 0,0,0,0,0....,0
def make(a, b, c): # a=list b=maxlen c=max
global v
if len(a) == b:
v.append(a)
else:
for i in range(a[-1], c + 1):
make(a + deque([i]), b, c)
for t in range(1, m + 1):
make(deque([t]), n, m)
max = 0
for j in v:
point = 0
for l in lista:
if j[l[1] - 1] - j[l[0] - 1] == l[2]:
point += l[3]
if max < point:
max = point
print(max)
| from collections import deque
n, m, q = [int(_) for _ in input().split()]
lista = [[int(i) for i in input().split()] for j in range(q)]
v = deque() # 0,0,0,0,0....,0
def make(a, b, c): # a=list b=maxlen c=max
global v
if len(a) == b:
v.append(a)
else:
for i in range(a[-1], c + 1):
make(a + [i], b, c)
for t in range(1, m + 1):
make([t], n, m)
max = 0
for j in v:
point = 0
for l in lista:
if j[l[1] - 1] - j[l[0] - 1] == l[2]:
point += l[3]
if max < point:
max = point
print(max)
| false | 4.347826 | [
"-import math",
"- make(a + deque([i]), b, c)",
"+ make(a + [i], b, c)",
"- make(deque([t]), n, m)",
"+ make([t], n, m)"
] | false | 0.10684 | 0.079815 | 1.338585 | [
"s502581324",
"s728781820"
] |
u284474275 | p02314 | python | s917471843 | s638461372 | 350 | 280 | 9,064 | 9,384 | Accepted | Accepted | 20 |
from sys import stdin, maxint
def solve(n, m, ds):
dp = [maxint] * (n + 1)
dp[0] = 0
for i in range(1, n + 1):
for j in range(m):
if i >= ds[j]:
dp[i] = min(dp[i], dp[i - ds[j]] + 1)
return dp[n]
if __name__ == '__main__':
n, m = list(map(int, stdin.readline().strip().split()))
ds = list(map(int, stdin.readline().strip().split()))
print((solve(n, m, ds))) | """
problem statment url: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_A
"""
from sys import stdin, maxint
def solve(n, m, ds):
dp = [maxint] * (n + 1)
dp[0] = 0
for i in range(m):
for j in range(ds[i], n + 1):
dp[j] = min(dp[j], dp[j - ds[i]] + 1)
return dp[n]
if __name__ == '__main__':
n, m = list(map(int, stdin.readline().strip().split()))
ds = list(map(int, stdin.readline().strip().split()))
print((solve(n, m, ds))) | 17 | 20 | 458 | 530 | from sys import stdin, maxint
def solve(n, m, ds):
dp = [maxint] * (n + 1)
dp[0] = 0
for i in range(1, n + 1):
for j in range(m):
if i >= ds[j]:
dp[i] = min(dp[i], dp[i - ds[j]] + 1)
return dp[n]
if __name__ == "__main__":
n, m = list(map(int, stdin.readline().strip().split()))
ds = list(map(int, stdin.readline().strip().split()))
print((solve(n, m, ds)))
| """
problem statment url: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_A
"""
from sys import stdin, maxint
def solve(n, m, ds):
dp = [maxint] * (n + 1)
dp[0] = 0
for i in range(m):
for j in range(ds[i], n + 1):
dp[j] = min(dp[j], dp[j - ds[i]] + 1)
return dp[n]
if __name__ == "__main__":
n, m = list(map(int, stdin.readline().strip().split()))
ds = list(map(int, stdin.readline().strip().split()))
print((solve(n, m, ds)))
| false | 15 | [
"+\"\"\"",
"+problem statment url: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_A",
"+\"\"\"",
"- for i in range(1, n + 1):",
"- for j in range(m):",
"- if i >= ds[j]:",
"- dp[i] = min(dp[i], dp[i - ds[j]] + 1)",
"+ for i in range(m):",
"+ for j in range(ds[i], n + 1):",
"+ dp[j] = min(dp[j], dp[j - ds[i]] + 1)"
] | false | 0.043929 | 0.043179 | 1.017372 | [
"s917471843",
"s638461372"
] |
u729133443 | p02762 | python | s761688428 | s901112661 | 1,932 | 1,525 | 96,856 | 96,856 | Accepted | Accepted | 21.07 | r=lambda x:p[x]>0and r(p[x])or x
(n,m,k),*t=[list(map(int,t.split()))for t in open(0)]
p=[-1]*-~n
s=p[:]
for a,b in t:
x,y=sorted((r(a),r(b)))
if(x!=y)*m>0:p[x]+=p[y];p[y]=y=x
if x==y:s[a]-=1;s[b]-=1
m-=1
print((*[s[i+1]-p[r(i+1)]for i in range(n)])) | r=lambda x:p[x]>0and r(p[x])or x
(n,m,k),*t=[list(map(int,t.split()))for t in open(0)]
p=[-1]*-~n
s=p[:]
for a,b in t:
x,y=sorted((r(a),r(b)))
if(x!=y)*m>0:p[x]+=p[y];p[y]=y=x
if x==y:s[a]-=1;s[b]-=1;m-=1
print((*[s[i+1]-p[r(i+1)]for i in range(n)])) | 10 | 9 | 255 | 253 | r = lambda x: p[x] > 0 and r(p[x]) or x
(n, m, k), *t = [list(map(int, t.split())) for t in open(0)]
p = [-1] * -~n
s = p[:]
for a, b in t:
x, y = sorted((r(a), r(b)))
if (x != y) * m > 0:
p[x] += p[y]
p[y] = y = x
if x == y:
s[a] -= 1
s[b] -= 1
m -= 1
print((*[s[i + 1] - p[r(i + 1)] for i in range(n)]))
| r = lambda x: p[x] > 0 and r(p[x]) or x
(n, m, k), *t = [list(map(int, t.split())) for t in open(0)]
p = [-1] * -~n
s = p[:]
for a, b in t:
x, y = sorted((r(a), r(b)))
if (x != y) * m > 0:
p[x] += p[y]
p[y] = y = x
if x == y:
s[a] -= 1
s[b] -= 1
m -= 1
print((*[s[i + 1] - p[r(i + 1)] for i in range(n)]))
| false | 10 | [
"- m -= 1",
"+ m -= 1"
] | false | 0.045469 | 0.037597 | 1.209384 | [
"s761688428",
"s901112661"
] |
u248670337 | p03640 | python | s387635024 | s671843258 | 36 | 32 | 9,576 | 9,592 | Accepted | Accepted | 11.11 | h,w,n,*A=list(map(int,open(0).read().split()));c=[]
for i in range(1,n+1):c+=[i]*A[i-1]
for i in range(h):print((*(c[i*w:-~i*w])[::(-1)**i])) | h,w,n,*A=list(map(int,open(0).read().split()));c=[]
for i in range(n):c+=[i+1]*A[i]
for i in range(h):print((*(c[i*w:-~i*w])[::(-1)**i])) | 3 | 3 | 135 | 131 | h, w, n, *A = list(map(int, open(0).read().split()))
c = []
for i in range(1, n + 1):
c += [i] * A[i - 1]
for i in range(h):
print((*(c[i * w : -~i * w])[:: (-1) ** i]))
| h, w, n, *A = list(map(int, open(0).read().split()))
c = []
for i in range(n):
c += [i + 1] * A[i]
for i in range(h):
print((*(c[i * w : -~i * w])[:: (-1) ** i]))
| false | 0 | [
"-for i in range(1, n + 1):",
"- c += [i] * A[i - 1]",
"+for i in range(n):",
"+ c += [i + 1] * A[i]"
] | false | 0.045725 | 0.039632 | 1.153726 | [
"s387635024",
"s671843258"
] |
u947883560 | p02824 | python | s537976520 | s618123135 | 258 | 237 | 64,672 | 64,672 | Accepted | Accepted | 8.14 | #!/usr/bin/env python3
import sys
from itertools import accumulate
INF = float("inf")
def solve(N: int, M: int, V: int, P: int, A: "List[int]"):
ans = 0
# 降順
A.sort(reverse=True)
acc = [0]+list(accumulate(A))
for i in range(N):
# ソート後の冒頭P問は大きいので可
if i < P:
ans += 1
continue
# M人が投票してもP番目のスコアに届かないなら無駄。
if A[i]+M < A[P-1]:
continue
# 対象iがP問目として選ばれるために
# 許容可能な投票数と、実際の投票数を比較する。
cap = 0
# 始めのP-1問にはM人が投票してよい
cap += M*(P-1)
# 後ろのN-i問(i, i+1, ..., N-1)にはM人が投票して良い
cap += M*(N-i)
# P問目からi-1問目までは、A[i]+Mを超えない範囲で投票して良い
# \sum_{j = P-1}^{i-1} A[i]+M-A[j]
# = (i-P+1)*(A[i]+M) - \sum_{j=P-1}^{i-1}A[j]
cap += (i-P+1)*(A[i]+M)
# accは始めに0を加えているので、インデックスが異なるので注意
# 数列(0-index)のi-1番目までの和はacc[i](0-index)
cap -= acc[i] - acc[P-1]
if cap >= M*V:
ans += 1
print(ans)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
V = int(next(tokens)) # type: int
P = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, M, V, P, A)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
from itertools import accumulate
INF = float("inf")
def solve(N: int, M: int, V: int, P: int, A: "List[int]"):
ans = 0
# 降順
A.sort(reverse=True)
acc = [0]+list(accumulate(A))
left = P-1
right = len(A)
while right - left > 1:
mid = (right + left)//2
if A[mid]+M < A[P-1]:
right = mid
continue
cap = M*N+(mid-P+1)*(A[mid]) - acc[mid] + acc[P-1]
if cap >= M*V:
left = mid
else:
right = mid
print((left+1))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
V = int(next(tokens)) # type: int
P = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, M, V, P, A)
if __name__ == '__main__':
main()
| 62 | 49 | 1,510 | 1,076 | #!/usr/bin/env python3
import sys
from itertools import accumulate
INF = float("inf")
def solve(N: int, M: int, V: int, P: int, A: "List[int]"):
ans = 0
# 降順
A.sort(reverse=True)
acc = [0] + list(accumulate(A))
for i in range(N):
# ソート後の冒頭P問は大きいので可
if i < P:
ans += 1
continue
# M人が投票してもP番目のスコアに届かないなら無駄。
if A[i] + M < A[P - 1]:
continue
# 対象iがP問目として選ばれるために
# 許容可能な投票数と、実際の投票数を比較する。
cap = 0
# 始めのP-1問にはM人が投票してよい
cap += M * (P - 1)
# 後ろのN-i問(i, i+1, ..., N-1)にはM人が投票して良い
cap += M * (N - i)
# P問目からi-1問目までは、A[i]+Mを超えない範囲で投票して良い
# \sum_{j = P-1}^{i-1} A[i]+M-A[j]
# = (i-P+1)*(A[i]+M) - \sum_{j=P-1}^{i-1}A[j]
cap += (i - P + 1) * (A[i] + M)
# accは始めに0を加えているので、インデックスが異なるので注意
# 数列(0-index)のi-1番目までの和はacc[i](0-index)
cap -= acc[i] - acc[P - 1]
if cap >= M * V:
ans += 1
print(ans)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
V = int(next(tokens)) # type: int
P = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, M, V, P, A)
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
import sys
from itertools import accumulate
INF = float("inf")
def solve(N: int, M: int, V: int, P: int, A: "List[int]"):
ans = 0
# 降順
A.sort(reverse=True)
acc = [0] + list(accumulate(A))
left = P - 1
right = len(A)
while right - left > 1:
mid = (right + left) // 2
if A[mid] + M < A[P - 1]:
right = mid
continue
cap = M * N + (mid - P + 1) * (A[mid]) - acc[mid] + acc[P - 1]
if cap >= M * V:
left = mid
else:
right = mid
print((left + 1))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
V = int(next(tokens)) # type: int
P = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, M, V, P, A)
if __name__ == "__main__":
main()
| false | 20.967742 | [
"- for i in range(N):",
"- # ソート後の冒頭P問は大きいので可",
"- if i < P:",
"- ans += 1",
"+ left = P - 1",
"+ right = len(A)",
"+ while right - left > 1:",
"+ mid = (right + left) // 2",
"+ if A[mid] + M < A[P - 1]:",
"+ right = mid",
"- # M人が投票してもP番目のスコアに届かないなら無駄。",
"- if A[i] + M < A[P - 1]:",
"- continue",
"- # 対象iがP問目として選ばれるために",
"- # 許容可能な投票数と、実際の投票数を比較する。",
"- cap = 0",
"- # 始めのP-1問にはM人が投票してよい",
"- cap += M * (P - 1)",
"- # 後ろのN-i問(i, i+1, ..., N-1)にはM人が投票して良い",
"- cap += M * (N - i)",
"- # P問目からi-1問目までは、A[i]+Mを超えない範囲で投票して良い",
"- # \\sum_{j = P-1}^{i-1} A[i]+M-A[j]",
"- # = (i-P+1)*(A[i]+M) - \\sum_{j=P-1}^{i-1}A[j]",
"- cap += (i - P + 1) * (A[i] + M)",
"- # accは始めに0を加えているので、インデックスが異なるので注意",
"- # 数列(0-index)のi-1番目までの和はacc[i](0-index)",
"- cap -= acc[i] - acc[P - 1]",
"+ cap = M * N + (mid - P + 1) * (A[mid]) - acc[mid] + acc[P - 1]",
"- ans += 1",
"- print(ans)",
"+ left = mid",
"+ else:",
"+ right = mid",
"+ print((left + 1))"
] | false | 0.048003 | 0.035134 | 1.366289 | [
"s537976520",
"s618123135"
] |
u754022296 | p03465 | python | s505538667 | s496214883 | 790 | 335 | 10,576 | 12,184 | Accepted | Accepted | 57.59 | import sys
input = sys.stdin.readline
n = int(eval(input()))
A = list(map(int, input().split()))
M = sum(A)
s = 1 << M
for a in A:
s |= s >> a
ans = bin(s)[2+(M+1)//2:].find("1") + (M+1)//2
print(ans) | import sys
input = sys.stdin.readline
n = int(eval(input()))
A = tuple(map(int, input().split()))
M = sum(A)
l = -(-M//2)
dp = 1
mask = (1<<(2*M))-1
for a in A:
dp |= (dp<<a)&mask
dp >>= l
ans = (dp&(-dp)).bit_length() - 1 + l
print(ans) | 11 | 14 | 207 | 247 | import sys
input = sys.stdin.readline
n = int(eval(input()))
A = list(map(int, input().split()))
M = sum(A)
s = 1 << M
for a in A:
s |= s >> a
ans = bin(s)[2 + (M + 1) // 2 :].find("1") + (M + 1) // 2
print(ans)
| import sys
input = sys.stdin.readline
n = int(eval(input()))
A = tuple(map(int, input().split()))
M = sum(A)
l = -(-M // 2)
dp = 1
mask = (1 << (2 * M)) - 1
for a in A:
dp |= (dp << a) & mask
dp >>= l
ans = (dp & (-dp)).bit_length() - 1 + l
print(ans)
| false | 21.428571 | [
"-A = list(map(int, input().split()))",
"+A = tuple(map(int, input().split()))",
"-s = 1 << M",
"+l = -(-M // 2)",
"+dp = 1",
"+mask = (1 << (2 * M)) - 1",
"- s |= s >> a",
"-ans = bin(s)[2 + (M + 1) // 2 :].find(\"1\") + (M + 1) // 2",
"+ dp |= (dp << a) & mask",
"+dp >>= l",
"+ans = (dp & (-dp)).bit_length() - 1 + l"
] | false | 0.036618 | 0.036506 | 1.003081 | [
"s505538667",
"s496214883"
] |
u861141787 | p04013 | python | s975573416 | s161345647 | 40 | 28 | 5,492 | 3,188 | Accepted | Accepted | 30 | from collections import defaultdict
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
dp = [defaultdict(int) for _ in range(n+1)]
dp[0][a] += 1
for i, x_i in enumerate(x):
for p in list(dp[i].keys()):
pk = p + a - x_i
dp[i+1][pk] += dp[i][p]
dp[i+1][p] += dp[i][p]
print((dp[n][a] - 1)) | n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
x = [i - a for i in x]
# print(x)
D = {0 : 1}
for i in x:
for j, k in list(D.items()):
D[i+j] = D.get(i+j, 0) + k
# print(D)
print((D[0] - 1))
| 14 | 13 | 341 | 249 | from collections import defaultdict
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
dp = [defaultdict(int) for _ in range(n + 1)]
dp[0][a] += 1
for i, x_i in enumerate(x):
for p in list(dp[i].keys()):
pk = p + a - x_i
dp[i + 1][pk] += dp[i][p]
dp[i + 1][p] += dp[i][p]
print((dp[n][a] - 1))
| n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
x = [i - a for i in x]
# print(x)
D = {0: 1}
for i in x:
for j, k in list(D.items()):
D[i + j] = D.get(i + j, 0) + k
# print(D)
print((D[0] - 1))
| false | 7.142857 | [
"-from collections import defaultdict",
"-",
"-dp = [defaultdict(int) for _ in range(n + 1)]",
"-dp[0][a] += 1",
"-for i, x_i in enumerate(x):",
"- for p in list(dp[i].keys()):",
"- pk = p + a - x_i",
"- dp[i + 1][pk] += dp[i][p]",
"- dp[i + 1][p] += dp[i][p]",
"-print((dp[n][a] - 1))",
"+x.sort()",
"+x = [i - a for i in x]",
"+# print(x)",
"+D = {0: 1}",
"+for i in x:",
"+ for j, k in list(D.items()):",
"+ D[i + j] = D.get(i + j, 0) + k",
"+ # print(D)",
"+print((D[0] - 1))"
] | false | 0.040864 | 0.037861 | 1.0793 | [
"s975573416",
"s161345647"
] |
u729133443 | p03139 | python | s019207114 | s900818511 | 163 | 18 | 38,384 | 2,940 | Accepted | Accepted | 88.96 | n,a,b=list(map(int,input().split()))
print((min(a,b),max(0,-(n-a-b)))) | n,a,b=list(map(int,input().split()));print((min(a,b),max(0,a+b-n))) | 2 | 1 | 63 | 59 | n, a, b = list(map(int, input().split()))
print((min(a, b), max(0, -(n - a - b))))
| n, a, b = list(map(int, input().split()))
print((min(a, b), max(0, a + b - n)))
| false | 50 | [
"-print((min(a, b), max(0, -(n - a - b))))",
"+print((min(a, b), max(0, a + b - n)))"
] | false | 0.059076 | 0.056911 | 1.038037 | [
"s019207114",
"s900818511"
] |
u192154323 | p03163 | python | s255275028 | s489661200 | 539 | 238 | 120,684 | 146,716 | Accepted | Accepted | 55.84 | N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = [[0] * (W + 1) for _ in range(N + 1)]
# dp[i][j](j=0,1,...,W)の値が求まっている状態で、dp[i+1][j]を更新することを考える
for i in range(N):
for j in range(W + 1):
# 品物(w[i],v[i])を選ぶとき、j-w[i]>=0に限って、価値v[i]が加算される
if j - w[i] >= 0:
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j - w[i]] + v[i])
# 品物(w[i],v[i])を選ばないとき、何も加算しない
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
print((dp[N][W])) | n, W = list(map(int,input().split()))
items = [[0,0] for _ in range(n+1)]
for i in range(n):
items[i+1] = list(map(int, input().split()))
dp = [[0]*(W+1) for _ in range(n+1)]
for i in range(1,n+1):
weight, value = items[i][0], items[i][1]
for w_limit in range(1,W+1):
if w_limit - weight >= 0:
dp[i][w_limit] = max(dp[i-1][w_limit], dp[i-1][w_limit-weight] + value)
else:
dp[i][w_limit] = dp[i-1][w_limit]
print((dp[n][W]))
| 15 | 16 | 498 | 493 | N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = [[0] * (W + 1) for _ in range(N + 1)]
# dp[i][j](j=0,1,...,W)の値が求まっている状態で、dp[i+1][j]を更新することを考える
for i in range(N):
for j in range(W + 1):
# 品物(w[i],v[i])を選ぶとき、j-w[i]>=0に限って、価値v[i]が加算される
if j - w[i] >= 0:
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j - w[i]] + v[i])
# 品物(w[i],v[i])を選ばないとき、何も加算しない
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
print((dp[N][W]))
| n, W = list(map(int, input().split()))
items = [[0, 0] for _ in range(n + 1)]
for i in range(n):
items[i + 1] = list(map(int, input().split()))
dp = [[0] * (W + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
weight, value = items[i][0], items[i][1]
for w_limit in range(1, W + 1):
if w_limit - weight >= 0:
dp[i][w_limit] = max(
dp[i - 1][w_limit], dp[i - 1][w_limit - weight] + value
)
else:
dp[i][w_limit] = dp[i - 1][w_limit]
print((dp[n][W]))
| false | 6.25 | [
"-N, W = list(map(int, input().split()))",
"-w, v = [0] * N, [0] * N",
"-for i in range(N):",
"- w[i], v[i] = list(map(int, input().split()))",
"-dp = [[0] * (W + 1) for _ in range(N + 1)]",
"-# dp[i][j](j=0,1,...,W)の値が求まっている状態で、dp[i+1][j]を更新することを考える",
"-for i in range(N):",
"- for j in range(W + 1):",
"- # 品物(w[i],v[i])を選ぶとき、j-w[i]>=0に限って、価値v[i]が加算される",
"- if j - w[i] >= 0:",
"- dp[i + 1][j] = max(dp[i + 1][j], dp[i][j - w[i]] + v[i])",
"- # 品物(w[i],v[i])を選ばないとき、何も加算しない",
"- dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])",
"-print((dp[N][W]))",
"+n, W = list(map(int, input().split()))",
"+items = [[0, 0] for _ in range(n + 1)]",
"+for i in range(n):",
"+ items[i + 1] = list(map(int, input().split()))",
"+dp = [[0] * (W + 1) for _ in range(n + 1)]",
"+for i in range(1, n + 1):",
"+ weight, value = items[i][0], items[i][1]",
"+ for w_limit in range(1, W + 1):",
"+ if w_limit - weight >= 0:",
"+ dp[i][w_limit] = max(",
"+ dp[i - 1][w_limit], dp[i - 1][w_limit - weight] + value",
"+ )",
"+ else:",
"+ dp[i][w_limit] = dp[i - 1][w_limit]",
"+print((dp[n][W]))"
] | false | 0.041925 | 0.078877 | 0.531524 | [
"s255275028",
"s489661200"
] |
u417096287 | p02678 | python | s759968077 | s043579429 | 535 | 434 | 94,584 | 94,632 | Accepted | Accepted | 18.88 | import sys
from collections import deque
N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
goal = False
for _ in range(M):
A, B = list(map(int, input().split()))
G[A - 1].append(B - 1)
G[B - 1].append(A - 1)
if A == 1 or B == 1:
goal = True
if goal:
print("Yes")
else:
print("No")
sys.exit()
d = deque([0])
ans = [-1] * N
while d:
q = d.popleft()
for g in G[q]:
if ans[g] == -1:
ans[g] = q + 1
d.append(g)
for i in range(1, N):
print((ans[i])) | from collections import deque
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
N, M = MI()
room = [[] for _ in range(N)]
for _ in range(M):
A, B = MI()
room[A - 1].append(B - 1)
room[B - 1].append(A - 1)
ans = [-1] * N
queue = deque([0])
while queue:
u = queue.popleft()
for r in room[u]:
if ans[r] == -1:
ans[r] = u + 1
queue.append(r)
print("Yes")
for a in ans[1:]:
print(a) | 32 | 31 | 567 | 526 | import sys
from collections import deque
N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
goal = False
for _ in range(M):
A, B = list(map(int, input().split()))
G[A - 1].append(B - 1)
G[B - 1].append(A - 1)
if A == 1 or B == 1:
goal = True
if goal:
print("Yes")
else:
print("No")
sys.exit()
d = deque([0])
ans = [-1] * N
while d:
q = d.popleft()
for g in G[q]:
if ans[g] == -1:
ans[g] = q + 1
d.append(g)
for i in range(1, N):
print((ans[i]))
| from collections import deque
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
N, M = MI()
room = [[] for _ in range(N)]
for _ in range(M):
A, B = MI()
room[A - 1].append(B - 1)
room[B - 1].append(A - 1)
ans = [-1] * N
queue = deque([0])
while queue:
u = queue.popleft()
for r in room[u]:
if ans[r] == -1:
ans[r] = u + 1
queue.append(r)
print("Yes")
for a in ans[1:]:
print(a)
| false | 3.125 | [
"-import sys",
"-N, M = list(map(int, input().split()))",
"-G = [[] for _ in range(N)]",
"-goal = False",
"+",
"+def MI():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def LI():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+N, M = MI()",
"+room = [[] for _ in range(N)]",
"- A, B = list(map(int, input().split()))",
"- G[A - 1].append(B - 1)",
"- G[B - 1].append(A - 1)",
"- if A == 1 or B == 1:",
"- goal = True",
"-if goal:",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"- sys.exit()",
"-d = deque([0])",
"+ A, B = MI()",
"+ room[A - 1].append(B - 1)",
"+ room[B - 1].append(A - 1)",
"-while d:",
"- q = d.popleft()",
"- for g in G[q]:",
"- if ans[g] == -1:",
"- ans[g] = q + 1",
"- d.append(g)",
"-for i in range(1, N):",
"- print((ans[i]))",
"+queue = deque([0])",
"+while queue:",
"+ u = queue.popleft()",
"+ for r in room[u]:",
"+ if ans[r] == -1:",
"+ ans[r] = u + 1",
"+ queue.append(r)",
"+print(\"Yes\")",
"+for a in ans[1:]:",
"+ print(a)"
] | false | 0.039666 | 0.040294 | 0.984416 | [
"s759968077",
"s043579429"
] |
u254871849 | p03828 | python | s504945854 | s634034971 | 34 | 24 | 3,064 | 3,444 | Accepted | Accepted | 29.41 | import math
mod = int(1e9+7)
N = int(eval(input()))
n = math.factorial(N)
count_of_prime_factors = {}
while True:
if n > 1:
count = 0
while n % 2 == 0:
n //= 2
count += 1
if count != 0:
count_of_prime_factors.update({2: count})
if n == 1:
break
for i in range(3, N+1, 2):
count = 0
while n % i == 0:
n //= i
count += 1
if count != 0:
count_of_prime_factors.update({i: count})
if n == 1:
break
else:
count_of_prime_factors.update({n: 1})
break
else:
print((1))
exit()
ans = 1
for prime_factor, count in list(count_of_prime_factors.items()):
ans *= count + 1
print((ans % mod))
| import sys
from math import floor, sqrt
from collections import defaultdict
MOD = 10 ** 9 + 7
n = int(sys.stdin.readline().rstrip())
res = defaultdict(int)
def primeFactorize(n):
while n % 2 == 0:
res[2] += 1
n //= 2
if n == 1:
return
for i in range(3, floor(sqrt(n))+1, 2):
while n % i == 0:
res[i] += 1
n //= i
if n == 1:
return
res[n] += 1
def main():
for i in range(1, n+1):
primeFactorize(i)
ans = 1
for c in list(res.values()):
ans *= c + 1
ans %= MOD
return ans
if __name__ == '__main__':
ans = main()
print(ans) | 39 | 38 | 872 | 706 | import math
mod = int(1e9 + 7)
N = int(eval(input()))
n = math.factorial(N)
count_of_prime_factors = {}
while True:
if n > 1:
count = 0
while n % 2 == 0:
n //= 2
count += 1
if count != 0:
count_of_prime_factors.update({2: count})
if n == 1:
break
for i in range(3, N + 1, 2):
count = 0
while n % i == 0:
n //= i
count += 1
if count != 0:
count_of_prime_factors.update({i: count})
if n == 1:
break
else:
count_of_prime_factors.update({n: 1})
break
else:
print((1))
exit()
ans = 1
for prime_factor, count in list(count_of_prime_factors.items()):
ans *= count + 1
print((ans % mod))
| import sys
from math import floor, sqrt
from collections import defaultdict
MOD = 10**9 + 7
n = int(sys.stdin.readline().rstrip())
res = defaultdict(int)
def primeFactorize(n):
while n % 2 == 0:
res[2] += 1
n //= 2
if n == 1:
return
for i in range(3, floor(sqrt(n)) + 1, 2):
while n % i == 0:
res[i] += 1
n //= i
if n == 1:
return
res[n] += 1
def main():
for i in range(1, n + 1):
primeFactorize(i)
ans = 1
for c in list(res.values()):
ans *= c + 1
ans %= MOD
return ans
if __name__ == "__main__":
ans = main()
print(ans)
| false | 2.564103 | [
"-import math",
"+import sys",
"+from math import floor, sqrt",
"+from collections import defaultdict",
"-mod = int(1e9 + 7)",
"-N = int(eval(input()))",
"-n = math.factorial(N)",
"-count_of_prime_factors = {}",
"-while True:",
"- if n > 1:",
"- count = 0",
"- while n % 2 == 0:",
"- n //= 2",
"- count += 1",
"- if count != 0:",
"- count_of_prime_factors.update({2: count})",
"+MOD = 10**9 + 7",
"+n = int(sys.stdin.readline().rstrip())",
"+res = defaultdict(int)",
"+",
"+",
"+def primeFactorize(n):",
"+ while n % 2 == 0:",
"+ res[2] += 1",
"+ n //= 2",
"+ if n == 1:",
"+ return",
"+ for i in range(3, floor(sqrt(n)) + 1, 2):",
"+ while n % i == 0:",
"+ res[i] += 1",
"+ n //= i",
"- break",
"- for i in range(3, N + 1, 2):",
"- count = 0",
"- while n % i == 0:",
"- n //= i",
"- count += 1",
"- if count != 0:",
"- count_of_prime_factors.update({i: count})",
"- if n == 1:",
"- break",
"- else:",
"- count_of_prime_factors.update({n: 1})",
"- break",
"- else:",
"- print((1))",
"- exit()",
"-ans = 1",
"-for prime_factor, count in list(count_of_prime_factors.items()):",
"- ans *= count + 1",
"-print((ans % mod))",
"+ return",
"+ res[n] += 1",
"+",
"+",
"+def main():",
"+ for i in range(1, n + 1):",
"+ primeFactorize(i)",
"+ ans = 1",
"+ for c in list(res.values()):",
"+ ans *= c + 1",
"+ ans %= MOD",
"+ return ans",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ ans = main()",
"+ print(ans)"
] | false | 0.064656 | 0.054618 | 1.183796 | [
"s504945854",
"s634034971"
] |
u466330895 | p03370 | python | s220585220 | s269704303 | 34 | 17 | 3,064 | 2,940 | Accepted | Accepted | 50 | n, x = list(map(int, input().split()))
M = [int(eval(input())) for i in range(n)]
rest_powder = x - sum(M)
max_make = 0
min_powder = min(M)
while True:
if max_make*min_powder < rest_powder:
max_make += 1
elif max_make*min_powder == rest_powder:
break
else:
max_make -= 1
break
print((n + max_make)) | n, x = list(map(int, input().split()))
M = [int(eval(input())) for i in range(n)]
rest_powder = x - sum(M)
min_powder = min(M)
print((n + rest_powder//min_powder)) | 17 | 7 | 347 | 157 | n, x = list(map(int, input().split()))
M = [int(eval(input())) for i in range(n)]
rest_powder = x - sum(M)
max_make = 0
min_powder = min(M)
while True:
if max_make * min_powder < rest_powder:
max_make += 1
elif max_make * min_powder == rest_powder:
break
else:
max_make -= 1
break
print((n + max_make))
| n, x = list(map(int, input().split()))
M = [int(eval(input())) for i in range(n)]
rest_powder = x - sum(M)
min_powder = min(M)
print((n + rest_powder // min_powder))
| false | 58.823529 | [
"-max_make = 0",
"-while True:",
"- if max_make * min_powder < rest_powder:",
"- max_make += 1",
"- elif max_make * min_powder == rest_powder:",
"- break",
"- else:",
"- max_make -= 1",
"- break",
"-print((n + max_make))",
"+print((n + rest_powder // min_powder))"
] | false | 0.035631 | 0.035443 | 1.005307 | [
"s220585220",
"s269704303"
] |
u981767024 | p03043 | python | s241058561 | s210210028 | 88 | 54 | 3,060 | 9,204 | Accepted | Accepted | 38.64 | # 2019/05/19
# AtCoder Beginner Contest 126 - C
import math
# Input
n, k = list(map(int,input().split()))
# Init
bl = list()
for i in range(18):
bl.append(2 ** i)
# Calc
ans = 0
for i in range(1, n + 1):
for j in range(18):
wval = i * bl[j]
if wval >= k:
break
ans += (1 / n) * (1 / bl[j])
# Output
print(ans)
| # 2020/07/23
# AtCoder Beginner Contest 126 - C
import math
# Input
n, k = list(map(int,input().split()))
ans = 0
# Calc
for i in range(1, n+1):
idx = 1
wval = i
while(wval < k):
wval = wval * 2
idx = idx + 1
ans = ans + (1/n) * (1/2) ** idx
# Output
print((ans*2))
| 25 | 21 | 374 | 319 | # 2019/05/19
# AtCoder Beginner Contest 126 - C
import math
# Input
n, k = list(map(int, input().split()))
# Init
bl = list()
for i in range(18):
bl.append(2**i)
# Calc
ans = 0
for i in range(1, n + 1):
for j in range(18):
wval = i * bl[j]
if wval >= k:
break
ans += (1 / n) * (1 / bl[j])
# Output
print(ans)
| # 2020/07/23
# AtCoder Beginner Contest 126 - C
import math
# Input
n, k = list(map(int, input().split()))
ans = 0
# Calc
for i in range(1, n + 1):
idx = 1
wval = i
while wval < k:
wval = wval * 2
idx = idx + 1
ans = ans + (1 / n) * (1 / 2) ** idx
# Output
print((ans * 2))
| false | 16 | [
"-# 2019/05/19",
"+# 2020/07/23",
"-# Init",
"-bl = list()",
"-for i in range(18):",
"- bl.append(2**i)",
"+ans = 0",
"-ans = 0",
"- for j in range(18):",
"- wval = i * bl[j]",
"- if wval >= k:",
"- break",
"- ans += (1 / n) * (1 / bl[j])",
"+ idx = 1",
"+ wval = i",
"+ while wval < k:",
"+ wval = wval * 2",
"+ idx = idx + 1",
"+ ans = ans + (1 / n) * (1 / 2) ** idx",
"-print(ans)",
"+print((ans * 2))"
] | false | 0.118682 | 0.269955 | 0.439637 | [
"s241058561",
"s210210028"
] |
u808585569 | p03244 | python | s644132591 | s352051894 | 506 | 131 | 64,900 | 19,040 | Accepted | Accepted | 74.11 | from collections import Counter
n = int(eval(input()))
v = list(map(int,input().split()))
v1 = v[::2]
v2 = v[1::2]
C1 = Counter(v1)
C2 = Counter(v2)
#print(C1.most_common(1))
#print(C2.most_common(1))
#print(C1.most_common(1)[0][0]!=C2.most_common(1)[0][0])
if C1.most_common(1)[0][0]!=C2.most_common(1)[0][0]:
print(((n//2-C1.most_common(1)[0][1])+(n//2-C2.most_common(1)[0][1])))
exit()
elif C1.most_common(1)[0][1]==C2.most_common(1)[0][1]==n//2:
print((n//2))
exit()
elif C1.most_common(1)==C2.most_common(1) and C1.most_common(2)[1][1] >= C2.most_common(2)[1][1]:
print(((n//2-C1.most_common(2)[1][1])+(n//2-C2.most_common(1)[0][1])))
exit()
else:
print(((n//2-C1.most_common(1)[0][1])+(n//2-C2.most_common(2)[1][1])))
exit() | from collections import Counter
n = int(eval(input()))
v = list(map(int,input().split()))
v1 = v[::2]
v2 = v[1::2]
C1 = Counter(v1)
C2 = Counter(v2)
if C1.most_common(1)[0][0]!=C2.most_common(1)[0][0]:
print(((n//2-C1.most_common(1)[0][1])+(n//2-C2.most_common(1)[0][1])))
elif C1.most_common(1)[0][1]==C2.most_common(1)[0][1]==n//2:
print((n//2))
elif C1.most_common(1)==C2.most_common(1) and C1.most_common(2)[1][1] >= C2.most_common(2)[1][1]:
print(((n//2-C1.most_common(2)[1][1])+(n//2-C2.most_common(1)[0][1])))
else:
print(((n//2-C1.most_common(1)[0][1])+(n//2-C2.most_common(2)[1][1])))
| 26 | 16 | 766 | 605 | from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
v1 = v[::2]
v2 = v[1::2]
C1 = Counter(v1)
C2 = Counter(v2)
# print(C1.most_common(1))
# print(C2.most_common(1))
# print(C1.most_common(1)[0][0]!=C2.most_common(1)[0][0])
if C1.most_common(1)[0][0] != C2.most_common(1)[0][0]:
print(((n // 2 - C1.most_common(1)[0][1]) + (n // 2 - C2.most_common(1)[0][1])))
exit()
elif C1.most_common(1)[0][1] == C2.most_common(1)[0][1] == n // 2:
print((n // 2))
exit()
elif (
C1.most_common(1) == C2.most_common(1)
and C1.most_common(2)[1][1] >= C2.most_common(2)[1][1]
):
print(((n // 2 - C1.most_common(2)[1][1]) + (n // 2 - C2.most_common(1)[0][1])))
exit()
else:
print(((n // 2 - C1.most_common(1)[0][1]) + (n // 2 - C2.most_common(2)[1][1])))
exit()
| from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
v1 = v[::2]
v2 = v[1::2]
C1 = Counter(v1)
C2 = Counter(v2)
if C1.most_common(1)[0][0] != C2.most_common(1)[0][0]:
print(((n // 2 - C1.most_common(1)[0][1]) + (n // 2 - C2.most_common(1)[0][1])))
elif C1.most_common(1)[0][1] == C2.most_common(1)[0][1] == n // 2:
print((n // 2))
elif (
C1.most_common(1) == C2.most_common(1)
and C1.most_common(2)[1][1] >= C2.most_common(2)[1][1]
):
print(((n // 2 - C1.most_common(2)[1][1]) + (n // 2 - C2.most_common(1)[0][1])))
else:
print(((n // 2 - C1.most_common(1)[0][1]) + (n // 2 - C2.most_common(2)[1][1])))
| false | 38.461538 | [
"-# print(C1.most_common(1))",
"-# print(C2.most_common(1))",
"-# print(C1.most_common(1)[0][0]!=C2.most_common(1)[0][0])",
"- exit()",
"- exit()",
"- exit()",
"- exit()"
] | false | 0.036182 | 0.038273 | 0.945367 | [
"s644132591",
"s352051894"
] |
u349293999 | p00004 | python | s677654405 | s582743626 | 20 | 10 | 4,220 | 4,260 | Accepted | Accepted | 50 | import sys
for line in sys.stdin:
a, b, c, d, e, f = list(map(int, line.rstrip('\n').split(' ')))
x = int((e*c - b*f) * 1000 / (a*e - b*d)) / 1000.0
y = int((a*f - d*c) * 1000 / (a*e - b*d)) / 1000.0
print('%.3f %.3f' % (x, y)) | import sys
out=[]
for line in sys.stdin.readlines():
num = list(map(float, line.strip().split()))
x = (num[2]*num[4] - num[1]*num[5]) / (num[0]*num[4] - num[1]*num[3])
y = (num[5]*num[0] - num[2]*num[3]) / (num[0]*num[4] - num[3]*num[1])
if x == 0:
x=0.00
if y == 0:
y=0.00
out.append( "%.3f %.3f"%(round(x,3),round(y,3)))
for i in range(len(out)):
print(out[i]) | 6 | 13 | 241 | 412 | import sys
for line in sys.stdin:
a, b, c, d, e, f = list(map(int, line.rstrip("\n").split(" ")))
x = int((e * c - b * f) * 1000 / (a * e - b * d)) / 1000.0
y = int((a * f - d * c) * 1000 / (a * e - b * d)) / 1000.0
print("%.3f %.3f" % (x, y))
| import sys
out = []
for line in sys.stdin.readlines():
num = list(map(float, line.strip().split()))
x = (num[2] * num[4] - num[1] * num[5]) / (num[0] * num[4] - num[1] * num[3])
y = (num[5] * num[0] - num[2] * num[3]) / (num[0] * num[4] - num[3] * num[1])
if x == 0:
x = 0.00
if y == 0:
y = 0.00
out.append("%.3f %.3f" % (round(x, 3), round(y, 3)))
for i in range(len(out)):
print(out[i])
| false | 53.846154 | [
"-for line in sys.stdin:",
"- a, b, c, d, e, f = list(map(int, line.rstrip(\"\\n\").split(\" \")))",
"- x = int((e * c - b * f) * 1000 / (a * e - b * d)) / 1000.0",
"- y = int((a * f - d * c) * 1000 / (a * e - b * d)) / 1000.0",
"- print(\"%.3f %.3f\" % (x, y))",
"+out = []",
"+for line in sys.stdin.readlines():",
"+ num = list(map(float, line.strip().split()))",
"+ x = (num[2] * num[4] - num[1] * num[5]) / (num[0] * num[4] - num[1] * num[3])",
"+ y = (num[5] * num[0] - num[2] * num[3]) / (num[0] * num[4] - num[3] * num[1])",
"+ if x == 0:",
"+ x = 0.00",
"+ if y == 0:",
"+ y = 0.00",
"+ out.append(\"%.3f %.3f\" % (round(x, 3), round(y, 3)))",
"+for i in range(len(out)):",
"+ print(out[i])"
] | false | 0.039705 | 0.037431 | 1.060776 | [
"s677654405",
"s582743626"
] |
u088553842 | p03110 | python | s573606711 | s688004277 | 29 | 25 | 9,056 | 9,196 | Accepted | Accepted | 13.79 | n = int(eval(input()))
res = 0
for i in range(n):
x, u = input().split()
x = float(x)
if u == 'JPY':
res += x
else:
res += (380000 * x)
print(res) | res=0
for i in range(int(eval(input()))):
x,u=input().split()
x=float(x)
res+=x if u>'C'else 380000*x
print(res) | 10 | 6 | 165 | 117 | n = int(eval(input()))
res = 0
for i in range(n):
x, u = input().split()
x = float(x)
if u == "JPY":
res += x
else:
res += 380000 * x
print(res)
| res = 0
for i in range(int(eval(input()))):
x, u = input().split()
x = float(x)
res += x if u > "C" else 380000 * x
print(res)
| false | 40 | [
"-n = int(eval(input()))",
"-for i in range(n):",
"+for i in range(int(eval(input()))):",
"- if u == \"JPY\":",
"- res += x",
"- else:",
"- res += 380000 * x",
"+ res += x if u > \"C\" else 380000 * x"
] | false | 0.083208 | 0.035839 | 2.321705 | [
"s573606711",
"s688004277"
] |
u365686736 | p02397 | python | s042231307 | s552932468 | 40 | 30 | 7,824 | 5,892 | Accepted | Accepted | 25 | import sys
while 1:
(a,b)=[int(c)for c in sys.stdin.readline().split(' ')]
if a==0 and b==0:break
if a>b:a,b=b,a
print((a,b)) | import sys
for c in sys.stdin:
a,b=sorted(map(int,c.split()))
if a==0 and b==0:break
print((a,b)) | 6 | 5 | 144 | 111 | import sys
while 1:
(a, b) = [int(c) for c in sys.stdin.readline().split(" ")]
if a == 0 and b == 0:
break
if a > b:
a, b = b, a
print((a, b))
| import sys
for c in sys.stdin:
a, b = sorted(map(int, c.split()))
if a == 0 and b == 0:
break
print((a, b))
| false | 16.666667 | [
"-while 1:",
"- (a, b) = [int(c) for c in sys.stdin.readline().split(\" \")]",
"+for c in sys.stdin:",
"+ a, b = sorted(map(int, c.split()))",
"- if a > b:",
"- a, b = b, a"
] | false | 0.037291 | 0.037393 | 0.997275 | [
"s042231307",
"s552932468"
] |
u754022296 | p02647 | python | s743388853 | s955542402 | 529 | 358 | 225,836 | 202,240 | Accepted | Accepted | 32.33 | import sys
input = sys.stdin.readline
from itertools import accumulate
n, k = list(map(int, input().split()))
A = tuple(map(int, input().split()))
for _ in range(k):
C = [0]*n
for i, a in enumerate(A):
C[max(0, i-a)] += 1
if i+a < n-1:
C[i+a+1] -= 1
A = tuple(accumulate(C))
if min(A) == n:
break
print((*A)) | from itertools import accumulate
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for _ in range(k):
B = [0]*(n+1)
for i, a in enumerate(A):
B[max(i-a, 0)] += 1
B[min(i+a+1, n)] -= 1
A = list(accumulate(B))[:-1]
if min(A) == n:
break
print((*A)) | 16 | 12 | 342 | 294 | import sys
input = sys.stdin.readline
from itertools import accumulate
n, k = list(map(int, input().split()))
A = tuple(map(int, input().split()))
for _ in range(k):
C = [0] * n
for i, a in enumerate(A):
C[max(0, i - a)] += 1
if i + a < n - 1:
C[i + a + 1] -= 1
A = tuple(accumulate(C))
if min(A) == n:
break
print((*A))
| from itertools import accumulate
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for _ in range(k):
B = [0] * (n + 1)
for i, a in enumerate(A):
B[max(i - a, 0)] += 1
B[min(i + a + 1, n)] -= 1
A = list(accumulate(B))[:-1]
if min(A) == n:
break
print((*A))
| false | 25 | [
"-import sys",
"-",
"-input = sys.stdin.readline",
"-A = tuple(map(int, input().split()))",
"+A = list(map(int, input().split()))",
"- C = [0] * n",
"+ B = [0] * (n + 1)",
"- C[max(0, i - a)] += 1",
"- if i + a < n - 1:",
"- C[i + a + 1] -= 1",
"- A = tuple(accumulate(C))",
"+ B[max(i - a, 0)] += 1",
"+ B[min(i + a + 1, n)] -= 1",
"+ A = list(accumulate(B))[:-1]"
] | false | 0.036068 | 0.036101 | 0.999083 | [
"s743388853",
"s955542402"
] |
u928784113 | p03326 | python | s715426453 | s537430335 | 67 | 52 | 5,812 | 5,684 | Accepted | Accepted | 22.39 | import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush
from fractions import gcd
from copy import deepcopy
import math
import queue
#import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys
sys.setrecursionlimit(100000)
def sieve_of_eratosthenes(n):
if not isinstance(n,int):
raise TypeError("n is not int")
if n<2:
raise ValueError("n is not effective")
prime = [1]*(n+1)
for i in range(2,int(math.sqrt(n))+1):
if prime[i] == 1:
for j in range(2*i,n+1):
if j%i == 0:
prime[j] = 0
res = []
for i in range(2,n+1):
if prime[i] == 1:
res.append(i)
return res
def factorial(i):
if i == 1:
return 1
else:
return i*factorial(i-1)
class UnionFind:
def __init__(self,n):
self.parent = [i for i in range(n+1)]
self.rank = [0 for i in range(n+1)]
def findroot(self,x):
if x == self.parent[x]:
return x
else:
y = self.parent[x]
y = self.findroot(self.parent[x])
return y
def union(self,x,y):
px = self.findroot(x)
py = self.findroot(y)
if px < py:
self.parent[py] = px
else:
self.parent[px] = py
def same_group_or_no(self,x,y):
return self.findroot(x) == self.findroot(y)
def main(): #startline--------------------------------------------
n,m = list(map(int,input().split()))
xyz = [list(map(int,input().split())) for i in range(n)]
anslist = []
for i in range(8):
cand = []
for j in range(n):
p = 0
for k in range(3):
if ((i>>k)&1):
p -= xyz[j][k]
else:
p += xyz[j][k]
cand.append(p)
cand.sort(reverse = True)
anslist.append(sum(cand[:m]))
print((max(anslist)))
if __name__ == "__main__":
main() #endline===============================================
| import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush
from fractions import gcd
from copy import deepcopy
import math
import queue
#import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys
sys.setrecursionlimit(100000)
def sieve_of_eratosthenes(n):
if not isinstance(n,int):
raise TypeError("n is not int")
if n<2:
raise ValueError("n is not effective")
prime = [1]*(n+1)
for i in range(2,int(math.sqrt(n))+1):
if prime[i] == 1:
for j in range(2*i,n+1):
if j%i == 0:
prime[j] = 0
res = []
for i in range(2,n+1):
if prime[i] == 1:
res.append(i)
return res
def factorial(i):
if i == 1:
return 1
else:
return i*factorial(i-1)
class UnionFind:
def __init__(self,n):
self.parent = [i for i in range(n+1)]
self.rank = [0 for i in range(n+1)]
def findroot(self,x):
if x == self.parent[x]:
return x
else:
y = self.parent[x]
y = self.findroot(self.parent[x])
return y
def union(self,x,y):
px = self.findroot(x)
py = self.findroot(y)
if px < py:
self.parent[py] = px
else:
self.parent[px] = py
def same_group_or_no(self,x,y):
return self.findroot(x) == self.findroot(y)
def main(): #startline--------------------------------------------
n,m = list(map(int,input().split()))
xyz = [list(map(int,input().split())) for i in range(n)]
ans = []
for i in range(8):
sub = []
for j in range(n):
cnt = 0
for k in range(3):
if ((i>>k)&1):
cnt -= xyz[j][k]
else:
cnt += xyz[j][k]
sub.append(cnt)
sub.sort(reverse = True)
ans.append(sum(sub[:m]))
print((max(ans)))
if __name__ == "__main__":
main() #endline===============================================
| 87 | 87 | 2,231 | 2,223 | import itertools
from collections import deque, defaultdict, Counter
from itertools import accumulate
import bisect
from heapq import heappop, heappush
from fractions import gcd
from copy import deepcopy
import math
import queue
# import numpy as np
# import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys
sys.setrecursionlimit(100000)
def sieve_of_eratosthenes(n):
if not isinstance(n, int):
raise TypeError("n is not int")
if n < 2:
raise ValueError("n is not effective")
prime = [1] * (n + 1)
for i in range(2, int(math.sqrt(n)) + 1):
if prime[i] == 1:
for j in range(2 * i, n + 1):
if j % i == 0:
prime[j] = 0
res = []
for i in range(2, n + 1):
if prime[i] == 1:
res.append(i)
return res
def factorial(i):
if i == 1:
return 1
else:
return i * factorial(i - 1)
class UnionFind:
def __init__(self, n):
self.parent = [i for i in range(n + 1)]
self.rank = [0 for i in range(n + 1)]
def findroot(self, x):
if x == self.parent[x]:
return x
else:
y = self.parent[x]
y = self.findroot(self.parent[x])
return y
def union(self, x, y):
px = self.findroot(x)
py = self.findroot(y)
if px < py:
self.parent[py] = px
else:
self.parent[px] = py
def same_group_or_no(self, x, y):
return self.findroot(x) == self.findroot(y)
def main(): # startline--------------------------------------------
n, m = list(map(int, input().split()))
xyz = [list(map(int, input().split())) for i in range(n)]
anslist = []
for i in range(8):
cand = []
for j in range(n):
p = 0
for k in range(3):
if (i >> k) & 1:
p -= xyz[j][k]
else:
p += xyz[j][k]
cand.append(p)
cand.sort(reverse=True)
anslist.append(sum(cand[:m]))
print((max(anslist)))
if __name__ == "__main__":
main() # endline===============================================
| import itertools
from collections import deque, defaultdict, Counter
from itertools import accumulate
import bisect
from heapq import heappop, heappush
from fractions import gcd
from copy import deepcopy
import math
import queue
# import numpy as np
# import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys
sys.setrecursionlimit(100000)
def sieve_of_eratosthenes(n):
if not isinstance(n, int):
raise TypeError("n is not int")
if n < 2:
raise ValueError("n is not effective")
prime = [1] * (n + 1)
for i in range(2, int(math.sqrt(n)) + 1):
if prime[i] == 1:
for j in range(2 * i, n + 1):
if j % i == 0:
prime[j] = 0
res = []
for i in range(2, n + 1):
if prime[i] == 1:
res.append(i)
return res
def factorial(i):
if i == 1:
return 1
else:
return i * factorial(i - 1)
class UnionFind:
def __init__(self, n):
self.parent = [i for i in range(n + 1)]
self.rank = [0 for i in range(n + 1)]
def findroot(self, x):
if x == self.parent[x]:
return x
else:
y = self.parent[x]
y = self.findroot(self.parent[x])
return y
def union(self, x, y):
px = self.findroot(x)
py = self.findroot(y)
if px < py:
self.parent[py] = px
else:
self.parent[px] = py
def same_group_or_no(self, x, y):
return self.findroot(x) == self.findroot(y)
def main(): # startline--------------------------------------------
n, m = list(map(int, input().split()))
xyz = [list(map(int, input().split())) for i in range(n)]
ans = []
for i in range(8):
sub = []
for j in range(n):
cnt = 0
for k in range(3):
if (i >> k) & 1:
cnt -= xyz[j][k]
else:
cnt += xyz[j][k]
sub.append(cnt)
sub.sort(reverse=True)
ans.append(sum(sub[:m]))
print((max(ans)))
if __name__ == "__main__":
main() # endline===============================================
| false | 0 | [
"- anslist = []",
"+ ans = []",
"- cand = []",
"+ sub = []",
"- p = 0",
"+ cnt = 0",
"- p -= xyz[j][k]",
"+ cnt -= xyz[j][k]",
"- p += xyz[j][k]",
"- cand.append(p)",
"- cand.sort(reverse=True)",
"- anslist.append(sum(cand[:m]))",
"- print((max(anslist)))",
"+ cnt += xyz[j][k]",
"+ sub.append(cnt)",
"+ sub.sort(reverse=True)",
"+ ans.append(sum(sub[:m]))",
"+ print((max(ans)))"
] | false | 0.007137 | 0.040199 | 0.177538 | [
"s715426453",
"s537430335"
] |
u595375942 | p03485 | python | s594399710 | s547688196 | 174 | 17 | 38,384 | 2,940 | Accepted | Accepted | 90.23 | a,b=list(map(int,input().split()))
ans= (a+b)//2 if (a+b)%2 == 0 else (a+b)//2+1
print(ans) | import math
a,b=list(map(int,input().split()))
print((math.ceil((a+b)/2))) | 3 | 3 | 87 | 68 | a, b = list(map(int, input().split()))
ans = (a + b) // 2 if (a + b) % 2 == 0 else (a + b) // 2 + 1
print(ans)
| import math
a, b = list(map(int, input().split()))
print((math.ceil((a + b) / 2)))
| false | 0 | [
"+import math",
"+",
"-ans = (a + b) // 2 if (a + b) % 2 == 0 else (a + b) // 2 + 1",
"-print(ans)",
"+print((math.ceil((a + b) / 2)))"
] | false | 0.161466 | 0.047958 | 3.36684 | [
"s594399710",
"s547688196"
] |
u190178779 | p02676 | python | s765643917 | s680556263 | 30 | 25 | 9,092 | 9,116 | Accepted | Accepted | 16.67 | import sys
K = int(input())
S = input()
print(S) if len(S) <= K else print(S[:K]+"...")
| K=int(eval(input()))
S=eval(input())
if len(S)<=K:
print(S)
else:
print((S[:K]+'...')) | 5 | 7 | 92 | 88 | import sys
K = int(input())
S = input()
print(S) if len(S) <= K else print(S[:K] + "...")
| K = int(eval(input()))
S = eval(input())
if len(S) <= K:
print(S)
else:
print((S[:K] + "..."))
| false | 28.571429 | [
"-import sys",
"-",
"-K = int(input())",
"-S = input()",
"-print(S) if len(S) <= K else print(S[:K] + \"...\")",
"+K = int(eval(input()))",
"+S = eval(input())",
"+if len(S) <= K:",
"+ print(S)",
"+else:",
"+ print((S[:K] + \"...\"))"
] | false | 0.047998 | 0.04854 | 0.988825 | [
"s765643917",
"s680556263"
] |
u075595666 | p03465 | python | s475002094 | s079986002 | 532 | 436 | 218,908 | 11,552 | Accepted | Accepted | 18.05 | n = int(eval(input()))
a = list(map(int,input().split()))
s = sum(a)
a.sort()
b = 1
for i in a:
b |= b<<i
b &= 2**(s+1)-2**((s-1)//2)
while True:
t = b&(-b)
#print(i,t,b)
if (s+1)//2 <= t.bit_length()-1 <= s:
print((t.bit_length()-1))
break
b ^= t | n = int(eval(input()))
a = list(map(int,input().split()))
s = sum(a)
a.sort()
b = 1
for i in a:
b |= b<<i
b &= 2**(s+1)-2**((s-1)//2)
while True:
t = b&(-b)
T = t.bit_length()-1
if (s+1)//2 <= T <= s:
print(T)
break
b ^= t | 16 | 16 | 275 | 252 | n = int(eval(input()))
a = list(map(int, input().split()))
s = sum(a)
a.sort()
b = 1
for i in a:
b |= b << i
b &= 2 ** (s + 1) - 2 ** ((s - 1) // 2)
while True:
t = b & (-b)
# print(i,t,b)
if (s + 1) // 2 <= t.bit_length() - 1 <= s:
print((t.bit_length() - 1))
break
b ^= t
| n = int(eval(input()))
a = list(map(int, input().split()))
s = sum(a)
a.sort()
b = 1
for i in a:
b |= b << i
b &= 2 ** (s + 1) - 2 ** ((s - 1) // 2)
while True:
t = b & (-b)
T = t.bit_length() - 1
if (s + 1) // 2 <= T <= s:
print(T)
break
b ^= t
| false | 0 | [
"- # print(i,t,b)",
"- if (s + 1) // 2 <= t.bit_length() - 1 <= s:",
"- print((t.bit_length() - 1))",
"+ T = t.bit_length() - 1",
"+ if (s + 1) // 2 <= T <= s:",
"+ print(T)"
] | false | 0.036064 | 0.035668 | 1.011117 | [
"s475002094",
"s079986002"
] |
u013408661 | p03779 | python | s774220610 | s972988075 | 45 | 31 | 7,448 | 5,144 | Accepted | Accepted | 31.11 | Acsum=[]
acsum=0
for i in range(10**5):
acsum+=i
Acsum.append(acsum)
def binarysearch(x):
ng=-1
ok=10**5
while abs(ok-ng)>1:
mid=(ok+ng)//2
if Acsum[mid]>=x:
ok=mid
else:
ng=mid
return ok
n=int(eval(input()))
print((binarysearch(n))) | Acsum=[]
acsum=0
for i in range(5*10**4):
acsum+=i
Acsum.append(acsum)
def binarysearch(x):
ng=-1
ok=5*10**4
while abs(ok-ng)>1:
mid=(ok+ng)//2
if Acsum[mid]>=x:
ok=mid
else:
ng=mid
return ok
n=abs(int(eval(input())))
print((binarysearch(n)))
| 17 | 17 | 277 | 287 | Acsum = []
acsum = 0
for i in range(10**5):
acsum += i
Acsum.append(acsum)
def binarysearch(x):
ng = -1
ok = 10**5
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if Acsum[mid] >= x:
ok = mid
else:
ng = mid
return ok
n = int(eval(input()))
print((binarysearch(n)))
| Acsum = []
acsum = 0
for i in range(5 * 10**4):
acsum += i
Acsum.append(acsum)
def binarysearch(x):
ng = -1
ok = 5 * 10**4
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if Acsum[mid] >= x:
ok = mid
else:
ng = mid
return ok
n = abs(int(eval(input())))
print((binarysearch(n)))
| false | 0 | [
"-for i in range(10**5):",
"+for i in range(5 * 10**4):",
"- ok = 10**5",
"+ ok = 5 * 10**4",
"-n = int(eval(input()))",
"+n = abs(int(eval(input())))"
] | false | 0.06736 | 0.053684 | 1.254753 | [
"s774220610",
"s972988075"
] |
u832039789 | p03101 | python | s803239927 | s533932205 | 20 | 17 | 2,940 | 2,940 | Accepted | Accepted | 15 | h,w = list(map(int,input().split()))
p, q = list(map(int,input().split()))
print((h * w - p * w - q * h + p * q))
| H,W = list(map(int,input().split()))
h,w = list(map(int,input().split()))
print(((H - h) * (W - w)))
| 3 | 3 | 102 | 89 | h, w = list(map(int, input().split()))
p, q = list(map(int, input().split()))
print((h * w - p * w - q * h + p * q))
| H, W = list(map(int, input().split()))
h, w = list(map(int, input().split()))
print(((H - h) * (W - w)))
| false | 0 | [
"+H, W = list(map(int, input().split()))",
"-p, q = list(map(int, input().split()))",
"-print((h * w - p * w - q * h + p * q))",
"+print(((H - h) * (W - w)))"
] | false | 0.048158 | 0.049304 | 0.97675 | [
"s803239927",
"s533932205"
] |
u579699847 | p03162 | python | s876380922 | s750792643 | 814 | 399 | 51,380 | 72,924 | Accepted | Accepted | 50.98 | import itertools,sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N = I()
abc = [LI() for _ in range(N)]
dp = [[0,0,0] for _ in range(N)]
dp[0] = abc[0]
for i,j,k in itertools.product(list(range(N)),[0,1,2],[0,1,2]):
if j==k:
continue
if i-1>=0:
dp[i][j] = max(dp[i][j],dp[i-1][k]+abc[i][j])
print((max(dp[-1])))
| import itertools,sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N = I()
abc = [LI() for _ in range(N)]
dp = [[0,0,0] for _ in range(N)]
dp[0] = abc[0]
for i,j,k in itertools.product(list(range(1,N)),[0,1,2],[0,1,2]):
if j==k:
continue
dp[i][j] = max(dp[i][j],dp[i-1][k]+abc[i][j])
print((max(dp[-1])))
| 13 | 12 | 417 | 399 | import itertools, sys
def I():
return int(sys.stdin.readline().rstrip())
def LI():
return list(map(int, sys.stdin.readline().rstrip().split()))
N = I()
abc = [LI() for _ in range(N)]
dp = [[0, 0, 0] for _ in range(N)]
dp[0] = abc[0]
for i, j, k in itertools.product(list(range(N)), [0, 1, 2], [0, 1, 2]):
if j == k:
continue
if i - 1 >= 0:
dp[i][j] = max(dp[i][j], dp[i - 1][k] + abc[i][j])
print((max(dp[-1])))
| import itertools, sys
def I():
return int(sys.stdin.readline().rstrip())
def LI():
return list(map(int, sys.stdin.readline().rstrip().split()))
N = I()
abc = [LI() for _ in range(N)]
dp = [[0, 0, 0] for _ in range(N)]
dp[0] = abc[0]
for i, j, k in itertools.product(list(range(1, N)), [0, 1, 2], [0, 1, 2]):
if j == k:
continue
dp[i][j] = max(dp[i][j], dp[i - 1][k] + abc[i][j])
print((max(dp[-1])))
| false | 7.692308 | [
"-for i, j, k in itertools.product(list(range(N)), [0, 1, 2], [0, 1, 2]):",
"+for i, j, k in itertools.product(list(range(1, N)), [0, 1, 2], [0, 1, 2]):",
"- if i - 1 >= 0:",
"- dp[i][j] = max(dp[i][j], dp[i - 1][k] + abc[i][j])",
"+ dp[i][j] = max(dp[i][j], dp[i - 1][k] + abc[i][j])"
] | false | 0.037855 | 0.036641 | 1.033133 | [
"s876380922",
"s750792643"
] |
u655110382 | p03107 | python | s649596146 | s143836066 | 29 | 18 | 3,188 | 3,188 | Accepted | Accepted | 37.93 | S = eval(input())
zero = 0
one = 0
for ch in S:
if ch == "0":
zero = zero + 1
else:
one = one + 1
print((min(zero, one) * 2))
| S = eval(input())
z = S.count("0")
o = S.count("1")
print((min(z, o) * 2))
| 12 | 5 | 156 | 72 | S = eval(input())
zero = 0
one = 0
for ch in S:
if ch == "0":
zero = zero + 1
else:
one = one + 1
print((min(zero, one) * 2))
| S = eval(input())
z = S.count("0")
o = S.count("1")
print((min(z, o) * 2))
| false | 58.333333 | [
"-zero = 0",
"-one = 0",
"-for ch in S:",
"- if ch == \"0\":",
"- zero = zero + 1",
"- else:",
"- one = one + 1",
"-print((min(zero, one) * 2))",
"+z = S.count(\"0\")",
"+o = S.count(\"1\")",
"+print((min(z, o) * 2))"
] | false | 0.04456 | 0.036366 | 1.225335 | [
"s649596146",
"s143836066"
] |
u667084803 | p03132 | python | s814539717 | s967552287 | 1,558 | 1,339 | 74,092 | 74,060 | Accepted | Accepted | 14.06 | #https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_d
#2019-02-10
#DP
L = int(eval(input()))
A = [int(eval(input())) for i in range(L)]
DP = [[float("inf") for i in range(5)] for j in range(L+1)]
for i in range(5):
DP[0][i] = 0
def cost(s, i, A):
if s == 0 or s == 4:
return A[i]
elif s == 1 or s == 3:
if A[i] > 0:
if A[i]%2 == 0:
return 0
else:
return 1
else:
return 2
else:
if A[i]%2 == 1:
return 0
else:
return 1
for i in range(L):
DP[i+1][0] = DP[i][0] + cost(0, i, A)
DP[i+1][1] = min(DP[i][:2]) + cost(1, i, A)
DP[i+1][2] = min(DP[i][:3]) + cost(2, i, A)
DP[i+1][3] = min(DP[i][:4]) + cost(3, i, A)
DP[i+1][4] = min(DP[i][:5]) + cost(4, i, A)
print((min(DP[L]))) | #https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_d
#2019-02-10
#DP
L = int(eval(input()))
A = [int(eval(input())) for i in range(L)]
DP = [[0 for i in range(5)] for j in range(L+1)]
def cost(s, i, A):
if s == 0 or s == 4:
return A[i]
elif s == 1 or s == 3:
if A[i] > 0:
if A[i]%2 == 0:
return 0
else:
return 1
else:
return 2
else:
if A[i]%2 == 1:
return 0
else:
return 1
for i in range(L):
DP[i+1][0] = DP[i][0] + cost(0, i, A)
DP[i+1][1] = min(DP[i][:2]) + cost(1, i, A)
DP[i+1][2] = min(DP[i][:3]) + cost(2, i, A)
DP[i+1][3] = min(DP[i][:4]) + cost(3, i, A)
DP[i+1][4] = min(DP[i][:5]) + cost(4, i, A)
print((min(DP[L]))) | 39 | 37 | 896 | 847 | # https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_d
# 2019-02-10
# DP
L = int(eval(input()))
A = [int(eval(input())) for i in range(L)]
DP = [[float("inf") for i in range(5)] for j in range(L + 1)]
for i in range(5):
DP[0][i] = 0
def cost(s, i, A):
if s == 0 or s == 4:
return A[i]
elif s == 1 or s == 3:
if A[i] > 0:
if A[i] % 2 == 0:
return 0
else:
return 1
else:
return 2
else:
if A[i] % 2 == 1:
return 0
else:
return 1
for i in range(L):
DP[i + 1][0] = DP[i][0] + cost(0, i, A)
DP[i + 1][1] = min(DP[i][:2]) + cost(1, i, A)
DP[i + 1][2] = min(DP[i][:3]) + cost(2, i, A)
DP[i + 1][3] = min(DP[i][:4]) + cost(3, i, A)
DP[i + 1][4] = min(DP[i][:5]) + cost(4, i, A)
print((min(DP[L])))
| # https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_d
# 2019-02-10
# DP
L = int(eval(input()))
A = [int(eval(input())) for i in range(L)]
DP = [[0 for i in range(5)] for j in range(L + 1)]
def cost(s, i, A):
if s == 0 or s == 4:
return A[i]
elif s == 1 or s == 3:
if A[i] > 0:
if A[i] % 2 == 0:
return 0
else:
return 1
else:
return 2
else:
if A[i] % 2 == 1:
return 0
else:
return 1
for i in range(L):
DP[i + 1][0] = DP[i][0] + cost(0, i, A)
DP[i + 1][1] = min(DP[i][:2]) + cost(1, i, A)
DP[i + 1][2] = min(DP[i][:3]) + cost(2, i, A)
DP[i + 1][3] = min(DP[i][:4]) + cost(3, i, A)
DP[i + 1][4] = min(DP[i][:5]) + cost(4, i, A)
print((min(DP[L])))
| false | 5.128205 | [
"-DP = [[float(\"inf\") for i in range(5)] for j in range(L + 1)]",
"-for i in range(5):",
"- DP[0][i] = 0",
"+DP = [[0 for i in range(5)] for j in range(L + 1)]"
] | false | 0.041107 | 0.044777 | 0.918028 | [
"s814539717",
"s967552287"
] |
u396495667 | p03711 | python | s867351664 | s056129027 | 172 | 17 | 38,256 | 3,060 | Accepted | Accepted | 90.12 | x,y = list(map(int, input().split()))
a = [1,3,5,7,8,10,12]
b = [4,6,9,11]
c = [2]
if x in a and y in a:
print('Yes')
elif x in b and y in b:
print('Yes')
else:
print('No') | x,y = list(map(int, input().split()))
a = [1,3,5,7,8,10,12]
b = [4,6,9,11]
c =[2]
if x in a and y in a:
print('Yes')
elif x in b and y in b:
print('Yes')
elif x==y==2:
print('Yes')
else:
print('No') | 12 | 12 | 185 | 211 | x, y = list(map(int, input().split()))
a = [1, 3, 5, 7, 8, 10, 12]
b = [4, 6, 9, 11]
c = [2]
if x in a and y in a:
print("Yes")
elif x in b and y in b:
print("Yes")
else:
print("No")
| x, y = list(map(int, input().split()))
a = [1, 3, 5, 7, 8, 10, 12]
b = [4, 6, 9, 11]
c = [2]
if x in a and y in a:
print("Yes")
elif x in b and y in b:
print("Yes")
elif x == y == 2:
print("Yes")
else:
print("No")
| false | 0 | [
"+elif x == y == 2:",
"+ print(\"Yes\")"
] | false | 0.048182 | 0.034993 | 1.376891 | [
"s867351664",
"s056129027"
] |
u073852194 | p03026 | python | s561320392 | s394153216 | 251 | 65 | 48,092 | 13,444 | Accepted | Accepted | 74.1 | import sys
import collections
input = sys.stdin.readline
N = int(eval(input()))
edge = [list(map(int,input().split())) for _ in range(N-1)]
c = sorted(list(map(int,input().split())),reverse=True)
graph = [[] for _ in range(N)]
ans = [-1 for _ in range(N)]
queue = collections.deque()
for e in edge:
graph[e[0]-1].append(e[1]-1)
graph[e[1]-1].append(e[0]-1)
for i in range(N):
if len(graph[i])==1:
queue.append(i)
ans[i] = c[0]
break
k=1
while queue:
node = queue.popleft()
for adj in graph[node]:
if ans[adj]==-1:
ans[adj] = c[k]
k += 1
queue.append(adj)
print((sum(c)-max(c)))
print((*ans)) | class Tree():
def __init__(self, n, edge, indexed=1):
self.n = n
self.tree = [[] for _ in range(n)]
for e in edge:
self.tree[e[0] - indexed].append(e[1] - indexed)
self.tree[e[1] - indexed].append(e[0] - indexed)
def setroot(self, root):
self.root = root
self.parent = [None for _ in range(self.n)]
self.parent[root] = -1
self.depth = [None for _ in range(self.n)]
self.depth[root] = 0
self.order = []
self.order.append(root)
self.size = [1 for _ in range(self.n)]
stack = [root]
while stack:
node = stack.pop()
for adj in self.tree[node]:
if self.parent[adj] is None:
self.parent[adj] = node
self.depth[adj] = self.depth[node] + 1
self.order.append(adj)
stack.append(adj)
for node in self.order[::-1]:
for adj in self.tree[node]:
if self.parent[node] == adj:
continue
self.size[node] += self.size[adj]
import sys
input = sys.stdin.readline
N = int(eval(input()))
E = [tuple(map(int, input().split())) for _ in range(N - 1)]
C = list(map(int, input().split()))
C.sort(reverse=True)
res = [None for _ in range(N)]
t = Tree(N, E)
t.setroot(0)
for i in range(N):
res[t.order[i]] = C[i]
print((sum(C) - max(C)))
print((*res)) | 30 | 50 | 713 | 1,499 | import sys
import collections
input = sys.stdin.readline
N = int(eval(input()))
edge = [list(map(int, input().split())) for _ in range(N - 1)]
c = sorted(list(map(int, input().split())), reverse=True)
graph = [[] for _ in range(N)]
ans = [-1 for _ in range(N)]
queue = collections.deque()
for e in edge:
graph[e[0] - 1].append(e[1] - 1)
graph[e[1] - 1].append(e[0] - 1)
for i in range(N):
if len(graph[i]) == 1:
queue.append(i)
ans[i] = c[0]
break
k = 1
while queue:
node = queue.popleft()
for adj in graph[node]:
if ans[adj] == -1:
ans[adj] = c[k]
k += 1
queue.append(adj)
print((sum(c) - max(c)))
print((*ans))
| class Tree:
def __init__(self, n, edge, indexed=1):
self.n = n
self.tree = [[] for _ in range(n)]
for e in edge:
self.tree[e[0] - indexed].append(e[1] - indexed)
self.tree[e[1] - indexed].append(e[0] - indexed)
def setroot(self, root):
self.root = root
self.parent = [None for _ in range(self.n)]
self.parent[root] = -1
self.depth = [None for _ in range(self.n)]
self.depth[root] = 0
self.order = []
self.order.append(root)
self.size = [1 for _ in range(self.n)]
stack = [root]
while stack:
node = stack.pop()
for adj in self.tree[node]:
if self.parent[adj] is None:
self.parent[adj] = node
self.depth[adj] = self.depth[node] + 1
self.order.append(adj)
stack.append(adj)
for node in self.order[::-1]:
for adj in self.tree[node]:
if self.parent[node] == adj:
continue
self.size[node] += self.size[adj]
import sys
input = sys.stdin.readline
N = int(eval(input()))
E = [tuple(map(int, input().split())) for _ in range(N - 1)]
C = list(map(int, input().split()))
C.sort(reverse=True)
res = [None for _ in range(N)]
t = Tree(N, E)
t.setroot(0)
for i in range(N):
res[t.order[i]] = C[i]
print((sum(C) - max(C)))
print((*res))
| false | 40 | [
"+class Tree:",
"+ def __init__(self, n, edge, indexed=1):",
"+ self.n = n",
"+ self.tree = [[] for _ in range(n)]",
"+ for e in edge:",
"+ self.tree[e[0] - indexed].append(e[1] - indexed)",
"+ self.tree[e[1] - indexed].append(e[0] - indexed)",
"+",
"+ def setroot(self, root):",
"+ self.root = root",
"+ self.parent = [None for _ in range(self.n)]",
"+ self.parent[root] = -1",
"+ self.depth = [None for _ in range(self.n)]",
"+ self.depth[root] = 0",
"+ self.order = []",
"+ self.order.append(root)",
"+ self.size = [1 for _ in range(self.n)]",
"+ stack = [root]",
"+ while stack:",
"+ node = stack.pop()",
"+ for adj in self.tree[node]:",
"+ if self.parent[adj] is None:",
"+ self.parent[adj] = node",
"+ self.depth[adj] = self.depth[node] + 1",
"+ self.order.append(adj)",
"+ stack.append(adj)",
"+ for node in self.order[::-1]:",
"+ for adj in self.tree[node]:",
"+ if self.parent[node] == adj:",
"+ continue",
"+ self.size[node] += self.size[adj]",
"+",
"+",
"-import collections",
"-edge = [list(map(int, input().split())) for _ in range(N - 1)]",
"-c = sorted(list(map(int, input().split())), reverse=True)",
"-graph = [[] for _ in range(N)]",
"-ans = [-1 for _ in range(N)]",
"-queue = collections.deque()",
"-for e in edge:",
"- graph[e[0] - 1].append(e[1] - 1)",
"- graph[e[1] - 1].append(e[0] - 1)",
"+E = [tuple(map(int, input().split())) for _ in range(N - 1)]",
"+C = list(map(int, input().split()))",
"+C.sort(reverse=True)",
"+res = [None for _ in range(N)]",
"+t = Tree(N, E)",
"+t.setroot(0)",
"- if len(graph[i]) == 1:",
"- queue.append(i)",
"- ans[i] = c[0]",
"- break",
"-k = 1",
"-while queue:",
"- node = queue.popleft()",
"- for adj in graph[node]:",
"- if ans[adj] == -1:",
"- ans[adj] = c[k]",
"- k += 1",
"- queue.append(adj)",
"-print((sum(c) - max(c)))",
"-print((*ans))",
"+ res[t.order[i]] = C[i]",
"+print((sum(C) - max(C)))",
"+print((*res))"
] | false | 0.065671 | 0.041522 | 1.581584 | [
"s561320392",
"s394153216"
] |
u022979415 | p03274 | python | s964931779 | s491254216 | 84 | 74 | 14,252 | 14,128 | Accepted | Accepted | 11.9 | def main():
n, k = list(map(int, input().split()))
x = [int(x) for x in input().split()]
answer = float("inf")
if 1 < n:
for i in range(n - k + 1):
if x[i + k - 1] < 0:
answer = min(answer, -x[i])
elif 0 < x[i]:
answer = min(answer, x[i + k - 1])
else:
answer = min(answer, min(abs(x[i]), abs(x[i + k - 1])) + x[i + k - 1] - x[i])
else:
answer = abs(x[0])
print(answer)
if __name__ == '__main__':
main()
| def main():
n, k = list(map(int, input().split()))
x = [int(i) for i in input().split()]
x.sort()
answer = float("inf")
if n == k:
if n == 1:
answer = abs(x[0])
if 0 <= x[0]:
answer = x[-1]
elif x[-1] <= 0:
answer = abs(x[0])
else:
answer = x[-1] - x[0] + min(abs(x[-1]), abs(x[0]))
else:
for i in range(n - k + 1):
left = x[i]
right = x[i + k - 1]
if left * right >= 0:
answer = min(answer, max(abs(left), abs(right)))
else:
answer = min(answer, right - left + min(abs(left), abs(right)))
print(answer)
if __name__ == '__main__':
main()
| 20 | 28 | 548 | 762 | def main():
n, k = list(map(int, input().split()))
x = [int(x) for x in input().split()]
answer = float("inf")
if 1 < n:
for i in range(n - k + 1):
if x[i + k - 1] < 0:
answer = min(answer, -x[i])
elif 0 < x[i]:
answer = min(answer, x[i + k - 1])
else:
answer = min(
answer, min(abs(x[i]), abs(x[i + k - 1])) + x[i + k - 1] - x[i]
)
else:
answer = abs(x[0])
print(answer)
if __name__ == "__main__":
main()
| def main():
n, k = list(map(int, input().split()))
x = [int(i) for i in input().split()]
x.sort()
answer = float("inf")
if n == k:
if n == 1:
answer = abs(x[0])
if 0 <= x[0]:
answer = x[-1]
elif x[-1] <= 0:
answer = abs(x[0])
else:
answer = x[-1] - x[0] + min(abs(x[-1]), abs(x[0]))
else:
for i in range(n - k + 1):
left = x[i]
right = x[i + k - 1]
if left * right >= 0:
answer = min(answer, max(abs(left), abs(right)))
else:
answer = min(answer, right - left + min(abs(left), abs(right)))
print(answer)
if __name__ == "__main__":
main()
| false | 28.571429 | [
"- x = [int(x) for x in input().split()]",
"+ x = [int(i) for i in input().split()]",
"+ x.sort()",
"- if 1 < n:",
"+ if n == k:",
"+ if n == 1:",
"+ answer = abs(x[0])",
"+ if 0 <= x[0]:",
"+ answer = x[-1]",
"+ elif x[-1] <= 0:",
"+ answer = abs(x[0])",
"+ else:",
"+ answer = x[-1] - x[0] + min(abs(x[-1]), abs(x[0]))",
"+ else:",
"- if x[i + k - 1] < 0:",
"- answer = min(answer, -x[i])",
"- elif 0 < x[i]:",
"- answer = min(answer, x[i + k - 1])",
"+ left = x[i]",
"+ right = x[i + k - 1]",
"+ if left * right >= 0:",
"+ answer = min(answer, max(abs(left), abs(right)))",
"- answer = min(",
"- answer, min(abs(x[i]), abs(x[i + k - 1])) + x[i + k - 1] - x[i]",
"- )",
"- else:",
"- answer = abs(x[0])",
"+ answer = min(answer, right - left + min(abs(left), abs(right)))"
] | false | 0.085482 | 0.123441 | 0.692492 | [
"s964931779",
"s491254216"
] |
u396495667 | p03555 | python | s819370365 | s522024331 | 173 | 17 | 38,384 | 2,940 | Accepted | Accepted | 90.17 | a = list(eval(input()))
b = list(eval(input()))
if a[0]==b[2] and a[1]==b[1] and a[2]==b[0]:
print('YES')
else:
print('NO') | a = eval(input())
b = eval(input())
c = a[2]+ a[1] + a[0]
print(('YES' if b == c else 'NO')) | 7 | 5 | 122 | 83 | a = list(eval(input()))
b = list(eval(input()))
if a[0] == b[2] and a[1] == b[1] and a[2] == b[0]:
print("YES")
else:
print("NO")
| a = eval(input())
b = eval(input())
c = a[2] + a[1] + a[0]
print(("YES" if b == c else "NO"))
| false | 28.571429 | [
"-a = list(eval(input()))",
"-b = list(eval(input()))",
"-if a[0] == b[2] and a[1] == b[1] and a[2] == b[0]:",
"- print(\"YES\")",
"-else:",
"- print(\"NO\")",
"+a = eval(input())",
"+b = eval(input())",
"+c = a[2] + a[1] + a[0]",
"+print((\"YES\" if b == c else \"NO\"))"
] | false | 0.118772 | 0.038391 | 3.093753 | [
"s819370365",
"s522024331"
] |
u227082700 | p03248 | python | s928205251 | s655043817 | 314 | 122 | 51,160 | 12,976 | Accepted | Accepted | 61.15 | s=eval(input())
n=len(s)
if s[0]=="0" or s[-1]=="1":print((-1));exit()
for i in range(n-1):
if s[i]!=s[-i-2]:print((-1));exit()
b=[]
for i in range(n-1):
if s[i]=="1":
for j in b:print((j+1,i+1))
b=[]
b.append(i)
for j in b:print((j+1,n)) | s=input()
if s[0]=="0":exit(print(-1))
if s[-1]=="1":exit(print(-1))
for i in range(len(s)-1):
if s[i]!=s[(len(s)-1)-(i+1)]:exit(print(-1))
ans=[]
for i in range(len(s)-1):
if s[i]=="1":
for j in ans:print(j+1,i+1)
ans=[]
ans.append(i)
for j in ans:print(j+1,len(s))
| 12 | 12 | 249 | 291 | s = eval(input())
n = len(s)
if s[0] == "0" or s[-1] == "1":
print((-1))
exit()
for i in range(n - 1):
if s[i] != s[-i - 2]:
print((-1))
exit()
b = []
for i in range(n - 1):
if s[i] == "1":
for j in b:
print((j + 1, i + 1))
b = []
b.append(i)
for j in b:
print((j + 1, n))
| s = input()
if s[0] == "0":
exit(print(-1))
if s[-1] == "1":
exit(print(-1))
for i in range(len(s) - 1):
if s[i] != s[(len(s) - 1) - (i + 1)]:
exit(print(-1))
ans = []
for i in range(len(s) - 1):
if s[i] == "1":
for j in ans:
print(j + 1, i + 1)
ans = []
ans.append(i)
for j in ans:
print(j + 1, len(s))
| false | 0 | [
"-s = eval(input())",
"-n = len(s)",
"-if s[0] == \"0\" or s[-1] == \"1\":",
"- print((-1))",
"- exit()",
"-for i in range(n - 1):",
"- if s[i] != s[-i - 2]:",
"- print((-1))",
"- exit()",
"-b = []",
"-for i in range(n - 1):",
"+s = input()",
"+if s[0] == \"0\":",
"+ exit(print(-1))",
"+if s[-1] == \"1\":",
"+ exit(print(-1))",
"+for i in range(len(s) - 1):",
"+ if s[i] != s[(len(s) - 1) - (i + 1)]:",
"+ exit(print(-1))",
"+ans = []",
"+for i in range(len(s) - 1):",
"- for j in b:",
"- print((j + 1, i + 1))",
"- b = []",
"- b.append(i)",
"-for j in b:",
"- print((j + 1, n))",
"+ for j in ans:",
"+ print(j + 1, i + 1)",
"+ ans = []",
"+ ans.append(i)",
"+for j in ans:",
"+ print(j + 1, len(s))"
] | false | 0.036438 | 0.044284 | 0.822825 | [
"s928205251",
"s655043817"
] |
u644907318 | p02975 | python | s155718107 | s381205639 | 227 | 91 | 60,784 | 93,560 | Accepted | Accepted | 59.91 | N = int(eval(input()))
A = list(map(int,input().split()))
B = set(A)
C = list(B)
k = len(C)
if N%3==0:
if k==3 and C[0]^C[1]==C[2] and A.count(C[0])==A.count(C[1]) and A.count(C[0])==A.count(C[2]):
print("Yes")
elif k==2:
C = sorted(C)
if C[0]==0 and A.count(C[0])==N//3:
print("Yes")
else:
print("No")
elif k==1 and C[0] == 0:
print("Yes")
else:
print("No")
else:
if k==1 and C[0] ==0:
print("Yes")
else:
print("No") | N = int(eval(input()))
A = list(map(int,input().split()))
C = {}
for i in range(N):
if A[i] not in C:
C[A[i]] = 0
C[A[i]] += 1
if len(C)>3:
print("No")
else:
if N%3==0:
if 0 in C:
if len(C)==1:
print("Yes")
elif len(C)==2:
if C[0]==N//3:
print("Yes")
else:
print("No")
else:
print("No")
else:
if len(C)!=3:
print("No")
else:
flag = 0
for a in C:
if C[a]!=N//3:
flag = 1
break
if flag==0:
C = list(C.keys())
if C[0]^C[1]==C[2]:
print("Yes")
else:
print("No")
else:
print("No")
else:
if len(C)==1 and 0 in C:
print("Yes")
else:
print("No") | 23 | 43 | 545 | 1,097 | N = int(eval(input()))
A = list(map(int, input().split()))
B = set(A)
C = list(B)
k = len(C)
if N % 3 == 0:
if (
k == 3
and C[0] ^ C[1] == C[2]
and A.count(C[0]) == A.count(C[1])
and A.count(C[0]) == A.count(C[2])
):
print("Yes")
elif k == 2:
C = sorted(C)
if C[0] == 0 and A.count(C[0]) == N // 3:
print("Yes")
else:
print("No")
elif k == 1 and C[0] == 0:
print("Yes")
else:
print("No")
else:
if k == 1 and C[0] == 0:
print("Yes")
else:
print("No")
| N = int(eval(input()))
A = list(map(int, input().split()))
C = {}
for i in range(N):
if A[i] not in C:
C[A[i]] = 0
C[A[i]] += 1
if len(C) > 3:
print("No")
else:
if N % 3 == 0:
if 0 in C:
if len(C) == 1:
print("Yes")
elif len(C) == 2:
if C[0] == N // 3:
print("Yes")
else:
print("No")
else:
print("No")
else:
if len(C) != 3:
print("No")
else:
flag = 0
for a in C:
if C[a] != N // 3:
flag = 1
break
if flag == 0:
C = list(C.keys())
if C[0] ^ C[1] == C[2]:
print("Yes")
else:
print("No")
else:
print("No")
else:
if len(C) == 1 and 0 in C:
print("Yes")
else:
print("No")
| false | 46.511628 | [
"-B = set(A)",
"-C = list(B)",
"-k = len(C)",
"-if N % 3 == 0:",
"- if (",
"- k == 3",
"- and C[0] ^ C[1] == C[2]",
"- and A.count(C[0]) == A.count(C[1])",
"- and A.count(C[0]) == A.count(C[2])",
"- ):",
"- print(\"Yes\")",
"- elif k == 2:",
"- C = sorted(C)",
"- if C[0] == 0 and A.count(C[0]) == N // 3:",
"+C = {}",
"+for i in range(N):",
"+ if A[i] not in C:",
"+ C[A[i]] = 0",
"+ C[A[i]] += 1",
"+if len(C) > 3:",
"+ print(\"No\")",
"+else:",
"+ if N % 3 == 0:",
"+ if 0 in C:",
"+ if len(C) == 1:",
"+ print(\"Yes\")",
"+ elif len(C) == 2:",
"+ if C[0] == N // 3:",
"+ print(\"Yes\")",
"+ else:",
"+ print(\"No\")",
"+ else:",
"+ print(\"No\")",
"+ else:",
"+ if len(C) != 3:",
"+ print(\"No\")",
"+ else:",
"+ flag = 0",
"+ for a in C:",
"+ if C[a] != N // 3:",
"+ flag = 1",
"+ break",
"+ if flag == 0:",
"+ C = list(C.keys())",
"+ if C[0] ^ C[1] == C[2]:",
"+ print(\"Yes\")",
"+ else:",
"+ print(\"No\")",
"+ else:",
"+ print(\"No\")",
"+ else:",
"+ if len(C) == 1 and 0 in C:",
"- elif k == 1 and C[0] == 0:",
"- print(\"Yes\")",
"- else:",
"- print(\"No\")",
"-else:",
"- if k == 1 and C[0] == 0:",
"- print(\"Yes\")",
"- else:",
"- print(\"No\")"
] | false | 0.035661 | 0.034152 | 1.044189 | [
"s155718107",
"s381205639"
] |
u537782349 | p03212 | python | s656384134 | s649638294 | 94 | 55 | 3,060 | 3,064 | Accepted | Accepted | 41.49 | import itertools
a = eval(input())
b = ["3", "5", "7"]
d = 0
for i in range(1, len(a)+1):
for j in itertools.product(b, repeat=i):
c = ""
for k in range(len(j)):
c += j[k]
if int(c) <= int(a):
if "3" in c and "5" in c and "7" in c:
d += 1
print(d)
| def ac(s, t, int3, int5, int7):
if s == "":
return ac(s + "3", t, int3 + 1, int5, int7) \
+ ac(s + "5", t, int3, int5+1, int7) \
+ ac(s + "7", t, int3, int5, int7+1)
elif int(s) <= t:
if int3 != 0 and int5 != 0 and int7 != 0:
return 1 \
+ ac(s + "3", t, int3 + 1, int5, int7) \
+ ac(s + "5", t, int3, int5+1, int7) \
+ ac(s + "7", t, int3, int5, int7+1)
else:
return 0 \
+ ac(s + "3", t, int3 + 1, int5, int7) \
+ ac(s + "5", t, int3, int5 + 1, int7) \
+ ac(s + "7", t, int3, int5, int7 + 1)
else:
return 0
a = int(input())
print(ac("", a, 0, 0, 0))
| 14 | 22 | 324 | 785 | import itertools
a = eval(input())
b = ["3", "5", "7"]
d = 0
for i in range(1, len(a) + 1):
for j in itertools.product(b, repeat=i):
c = ""
for k in range(len(j)):
c += j[k]
if int(c) <= int(a):
if "3" in c and "5" in c and "7" in c:
d += 1
print(d)
| def ac(s, t, int3, int5, int7):
if s == "":
return (
ac(s + "3", t, int3 + 1, int5, int7)
+ ac(s + "5", t, int3, int5 + 1, int7)
+ ac(s + "7", t, int3, int5, int7 + 1)
)
elif int(s) <= t:
if int3 != 0 and int5 != 0 and int7 != 0:
return (
1
+ ac(s + "3", t, int3 + 1, int5, int7)
+ ac(s + "5", t, int3, int5 + 1, int7)
+ ac(s + "7", t, int3, int5, int7 + 1)
)
else:
return (
0
+ ac(s + "3", t, int3 + 1, int5, int7)
+ ac(s + "5", t, int3, int5 + 1, int7)
+ ac(s + "7", t, int3, int5, int7 + 1)
)
else:
return 0
a = int(input())
print(ac("", a, 0, 0, 0))
| false | 36.363636 | [
"-import itertools",
"+def ac(s, t, int3, int5, int7):",
"+ if s == \"\":",
"+ return (",
"+ ac(s + \"3\", t, int3 + 1, int5, int7)",
"+ + ac(s + \"5\", t, int3, int5 + 1, int7)",
"+ + ac(s + \"7\", t, int3, int5, int7 + 1)",
"+ )",
"+ elif int(s) <= t:",
"+ if int3 != 0 and int5 != 0 and int7 != 0:",
"+ return (",
"+ 1",
"+ + ac(s + \"3\", t, int3 + 1, int5, int7)",
"+ + ac(s + \"5\", t, int3, int5 + 1, int7)",
"+ + ac(s + \"7\", t, int3, int5, int7 + 1)",
"+ )",
"+ else:",
"+ return (",
"+ 0",
"+ + ac(s + \"3\", t, int3 + 1, int5, int7)",
"+ + ac(s + \"5\", t, int3, int5 + 1, int7)",
"+ + ac(s + \"7\", t, int3, int5, int7 + 1)",
"+ )",
"+ else:",
"+ return 0",
"-a = eval(input())",
"-b = [\"3\", \"5\", \"7\"]",
"-d = 0",
"-for i in range(1, len(a) + 1):",
"- for j in itertools.product(b, repeat=i):",
"- c = \"\"",
"- for k in range(len(j)):",
"- c += j[k]",
"- if int(c) <= int(a):",
"- if \"3\" in c and \"5\" in c and \"7\" in c:",
"- d += 1",
"-print(d)",
"+",
"+a = int(input())",
"+print(ac(\"\", a, 0, 0, 0))"
] | false | 0.095779 | 0.042755 | 2.240187 | [
"s656384134",
"s649638294"
] |
u072053884 | p02281 | python | s511626339 | s319998889 | 80 | 20 | 7,744 | 7,748 | Accepted | Accepted | 75 | class BinaryTree:
class Node:
def __init__(self, num, left_child, right_child):
self.id = num
self.left_child = left_child
self.right_child = right_child
def __init__(self, n):
self.nodes = [None] * n
self.root_id = int(n * (n - 1) / 2)
def add_node(self, i_s):
num, left_child, right_child = map(int, i_s.split())
self.nodes[num] = BinaryTree.Node(num, left_child, right_child)
if left_child != -1:
self.root_id -= left_child
if right_child != -1:
self.root_id -= right_child
def preorder_walk(self):
print('Preorder')
root_node = self.nodes[self.root_id]
def _pre_walk(node):
print(' {0}'.format(node.id), end = '')
if node.left_child != -1:
_pre_walk(self.nodes[node.left_child])
if node.right_child != -1:
_pre_walk(self.nodes[node.right_child])
_pre_walk(root_node)
print('')
def inorder_walk(self):
print('Inorder')
root_node = self.nodes[self.root_id]
def _in_walk(node):
if node.left_child != -1:
_in_walk(self.nodes[node.left_child])
print(' {0}'.format(node.id), end = '')
if node.right_child != -1:
_in_walk(self.nodes[node.right_child])
_in_walk(root_node)
print('')
def postorder_walk(self):
print('Postorder')
root_node = self.nodes[self.root_id]
def _post_walk(node):
if node.left_child != -1:
_post_walk(self.nodes[node.left_child])
if node.right_child != -1:
_post_walk(self.nodes[node.right_child])
print(' {0}'.format(node.id), end = '')
_post_walk(root_node)
print('')
n = int(input())
BT = BinaryTree(n)
for i in range(n):
BT.add_node(input())
BT.preorder_walk()
BT.inorder_walk()
BT.postorder_walk()
| class BinaryTree:
class Node:
def __init__(self, num, left_child, right_child):
self.id = num
self.left_child = left_child
self.right_child = right_child
def __init__(self, n):
self.nodes = [None] * n
self.root_id = int(n * (n - 1) / 2)
def add_node(self, i_s):
num, left_child, right_child = map(int, i_s.split())
self.nodes[num] = BinaryTree.Node(num, left_child, right_child)
if left_child != -1:
self.root_id -= left_child
if right_child != -1:
self.root_id -= right_child
def preorder_walk(self):
print('Preorder')
def _pre_walk(node_id):
if node_id != -1:
print(' {0}'.format(node_id), end = '')
_pre_walk(self.nodes[node_id].left_child)
_pre_walk(self.nodes[node_id].right_child)
_pre_walk(self.root_id)
print('')
def inorder_walk(self):
print('Inorder')
root_node = self.nodes[self.root_id]
def _in_walk(node_id):
if node_id != -1:
_in_walk(self.nodes[node_id].left_child)
print(' {0}'.format(node_id), end = '')
_in_walk(self.nodes[node_id].right_child)
_in_walk(self.root_id)
print('')
def postorder_walk(self):
print('Postorder')
root_node = self.nodes[self.root_id]
def _post_walk(node_id):
if node_id != -1:
_post_walk(self.nodes[node_id].left_child)
_post_walk(self.nodes[node_id].right_child)
print(' {0}'.format(node_id), end = '')
_post_walk(self.root_id)
print('')
n = int(input())
BT = BinaryTree(n)
for i in range(n):
BT.add_node(input())
BT.preorder_walk()
BT.inorder_walk()
BT.postorder_walk()
| 66 | 62 | 2,076 | 1,934 | class BinaryTree:
class Node:
def __init__(self, num, left_child, right_child):
self.id = num
self.left_child = left_child
self.right_child = right_child
def __init__(self, n):
self.nodes = [None] * n
self.root_id = int(n * (n - 1) / 2)
def add_node(self, i_s):
num, left_child, right_child = map(int, i_s.split())
self.nodes[num] = BinaryTree.Node(num, left_child, right_child)
if left_child != -1:
self.root_id -= left_child
if right_child != -1:
self.root_id -= right_child
def preorder_walk(self):
print("Preorder")
root_node = self.nodes[self.root_id]
def _pre_walk(node):
print(" {0}".format(node.id), end="")
if node.left_child != -1:
_pre_walk(self.nodes[node.left_child])
if node.right_child != -1:
_pre_walk(self.nodes[node.right_child])
_pre_walk(root_node)
print("")
def inorder_walk(self):
print("Inorder")
root_node = self.nodes[self.root_id]
def _in_walk(node):
if node.left_child != -1:
_in_walk(self.nodes[node.left_child])
print(" {0}".format(node.id), end="")
if node.right_child != -1:
_in_walk(self.nodes[node.right_child])
_in_walk(root_node)
print("")
def postorder_walk(self):
print("Postorder")
root_node = self.nodes[self.root_id]
def _post_walk(node):
if node.left_child != -1:
_post_walk(self.nodes[node.left_child])
if node.right_child != -1:
_post_walk(self.nodes[node.right_child])
print(" {0}".format(node.id), end="")
_post_walk(root_node)
print("")
n = int(input())
BT = BinaryTree(n)
for i in range(n):
BT.add_node(input())
BT.preorder_walk()
BT.inorder_walk()
BT.postorder_walk()
| class BinaryTree:
class Node:
def __init__(self, num, left_child, right_child):
self.id = num
self.left_child = left_child
self.right_child = right_child
def __init__(self, n):
self.nodes = [None] * n
self.root_id = int(n * (n - 1) / 2)
def add_node(self, i_s):
num, left_child, right_child = map(int, i_s.split())
self.nodes[num] = BinaryTree.Node(num, left_child, right_child)
if left_child != -1:
self.root_id -= left_child
if right_child != -1:
self.root_id -= right_child
def preorder_walk(self):
print("Preorder")
def _pre_walk(node_id):
if node_id != -1:
print(" {0}".format(node_id), end="")
_pre_walk(self.nodes[node_id].left_child)
_pre_walk(self.nodes[node_id].right_child)
_pre_walk(self.root_id)
print("")
def inorder_walk(self):
print("Inorder")
root_node = self.nodes[self.root_id]
def _in_walk(node_id):
if node_id != -1:
_in_walk(self.nodes[node_id].left_child)
print(" {0}".format(node_id), end="")
_in_walk(self.nodes[node_id].right_child)
_in_walk(self.root_id)
print("")
def postorder_walk(self):
print("Postorder")
root_node = self.nodes[self.root_id]
def _post_walk(node_id):
if node_id != -1:
_post_walk(self.nodes[node_id].left_child)
_post_walk(self.nodes[node_id].right_child)
print(" {0}".format(node_id), end="")
_post_walk(self.root_id)
print("")
n = int(input())
BT = BinaryTree(n)
for i in range(n):
BT.add_node(input())
BT.preorder_walk()
BT.inorder_walk()
BT.postorder_walk()
| false | 6.060606 | [
"- root_node = self.nodes[self.root_id]",
"- def _pre_walk(node):",
"- print(\" {0}\".format(node.id), end=\"\")",
"- if node.left_child != -1:",
"- _pre_walk(self.nodes[node.left_child])",
"- if node.right_child != -1:",
"- _pre_walk(self.nodes[node.right_child])",
"+ def _pre_walk(node_id):",
"+ if node_id != -1:",
"+ print(\" {0}\".format(node_id), end=\"\")",
"+ _pre_walk(self.nodes[node_id].left_child)",
"+ _pre_walk(self.nodes[node_id].right_child)",
"- _pre_walk(root_node)",
"+ _pre_walk(self.root_id)",
"- def _in_walk(node):",
"- if node.left_child != -1:",
"- _in_walk(self.nodes[node.left_child])",
"- print(\" {0}\".format(node.id), end=\"\")",
"- if node.right_child != -1:",
"- _in_walk(self.nodes[node.right_child])",
"+ def _in_walk(node_id):",
"+ if node_id != -1:",
"+ _in_walk(self.nodes[node_id].left_child)",
"+ print(\" {0}\".format(node_id), end=\"\")",
"+ _in_walk(self.nodes[node_id].right_child)",
"- _in_walk(root_node)",
"+ _in_walk(self.root_id)",
"- def _post_walk(node):",
"- if node.left_child != -1:",
"- _post_walk(self.nodes[node.left_child])",
"- if node.right_child != -1:",
"- _post_walk(self.nodes[node.right_child])",
"- print(\" {0}\".format(node.id), end=\"\")",
"+ def _post_walk(node_id):",
"+ if node_id != -1:",
"+ _post_walk(self.nodes[node_id].left_child)",
"+ _post_walk(self.nodes[node_id].right_child)",
"+ print(\" {0}\".format(node_id), end=\"\")",
"- _post_walk(root_node)",
"+ _post_walk(self.root_id)"
] | false | 0.087859 | 0.127087 | 0.691328 | [
"s511626339",
"s319998889"
] |
u440566786 | p03550 | python | s215367363 | s345461192 | 1,482 | 808 | 5,620 | 49,884 | Accepted | Accepted | 45.48 | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,z,w=list(map(int,input().split()))
A=list(map(int,input().split()))
dp=[[None]*2 for _ in range(n+1)] # dp[i][turn] 消費枚数i,turnの手から始まるときの最適解
def dfs(i,turn):
if(dp[i][turn] is not None): return
# i+1からn-1のdp[1-turn]を埋めておく(i=n-1のときterminate)
for j in range(i+1,n):
dfs(j,1-turn)
res=-INF if(turn==0) else INF
if(turn==0):
for j in range(i+1,n):
res=max(res,dp[j][1])
y=A[i-1] if(i!=0) else w
res=max(res,abs(A[-1]-y))
else:
for j in range(i+1,n):
res=min(res,dp[j][0])
x=A[i-1] if(i!=0) else z # x=zとなることは無い
res=min(res,abs(A[-1]-x))
dp[i][turn]=res
dfs(0,0)
print((dp[0][0]))
resolve() | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,z,w=list(map(int,input().split()))
A=list(map(int,input().split()))
dp=[[None]*2 for _ in range(n+1)] # dp[i][turn] 消費枚数i,turnの手から始まるときの最適解
def dfs(i,turn)->NoneType:
if(dp[i][turn] is not None): return
# i+1からn-1のdp[1-turn]を埋めておく(i=n-1のときterminate)
for j in range(i+1,n):
dfs(j,1-turn)
res=-INF if(turn==0) else INF
if(turn==0):
for j in range(i+1,n):
res=max(res,dp[j][1])
y=A[i-1] if(i!=0) else w
res=max(res,abs(A[-1]-y))
else:
for j in range(i+1,n):
res=min(res,dp[j][0])
x=A[i-1]
res=min(res,abs(A[-1]-x))
dp[i][turn]=res
dfs(0,0)
print((dp[0][0]))
resolve() | 33 | 33 | 943 | 923 | import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7
input = lambda: sys.stdin.readline().rstrip()
def resolve():
n, z, w = list(map(int, input().split()))
A = list(map(int, input().split()))
dp = [[None] * 2 for _ in range(n + 1)] # dp[i][turn] 消費枚数i,turnの手から始まるときの最適解
def dfs(i, turn):
if dp[i][turn] is not None:
return
# i+1からn-1のdp[1-turn]を埋めておく(i=n-1のときterminate)
for j in range(i + 1, n):
dfs(j, 1 - turn)
res = -INF if (turn == 0) else INF
if turn == 0:
for j in range(i + 1, n):
res = max(res, dp[j][1])
y = A[i - 1] if (i != 0) else w
res = max(res, abs(A[-1] - y))
else:
for j in range(i + 1, n):
res = min(res, dp[j][0])
x = A[i - 1] if (i != 0) else z # x=zとなることは無い
res = min(res, abs(A[-1] - x))
dp[i][turn] = res
dfs(0, 0)
print((dp[0][0]))
resolve()
| import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7
input = lambda: sys.stdin.readline().rstrip()
def resolve():
n, z, w = list(map(int, input().split()))
A = list(map(int, input().split()))
dp = [[None] * 2 for _ in range(n + 1)] # dp[i][turn] 消費枚数i,turnの手から始まるときの最適解
def dfs(i, turn) -> NoneType:
if dp[i][turn] is not None:
return
# i+1からn-1のdp[1-turn]を埋めておく(i=n-1のときterminate)
for j in range(i + 1, n):
dfs(j, 1 - turn)
res = -INF if (turn == 0) else INF
if turn == 0:
for j in range(i + 1, n):
res = max(res, dp[j][1])
y = A[i - 1] if (i != 0) else w
res = max(res, abs(A[-1] - y))
else:
for j in range(i + 1, n):
res = min(res, dp[j][0])
x = A[i - 1]
res = min(res, abs(A[-1] - x))
dp[i][turn] = res
dfs(0, 0)
print((dp[0][0]))
resolve()
| false | 0 | [
"- def dfs(i, turn):",
"+ def dfs(i, turn) -> NoneType:",
"- x = A[i - 1] if (i != 0) else z # x=zとなることは無い",
"+ x = A[i - 1]"
] | false | 0.054746 | 0.054467 | 1.005129 | [
"s215367363",
"s345461192"
] |
u623819879 | p03705 | python | s672376073 | s238686239 | 161 | 61 | 38,384 | 61,796 | Accepted | Accepted | 62.11 | n,a,b=list(map(int,input().split()))
print((max(0,(n-2)*(b-a)+1))) | n,a,b=list(map(int,input().split()))
n-=2;print((max(b*n-a*n+1,0))) | 2 | 2 | 59 | 60 | n, a, b = list(map(int, input().split()))
print((max(0, (n - 2) * (b - a) + 1)))
| n, a, b = list(map(int, input().split()))
n -= 2
print((max(b * n - a * n + 1, 0)))
| false | 0 | [
"-print((max(0, (n - 2) * (b - a) + 1)))",
"+n -= 2",
"+print((max(b * n - a * n + 1, 0)))"
] | false | 0.064261 | 0.051879 | 1.23867 | [
"s672376073",
"s238686239"
] |
u325282913 | p02911 | python | s194735951 | s608700134 | 558 | 182 | 50,904 | 9,760 | Accepted | Accepted | 67.38 | N, K, Q = list(map(int, input().split()))
point = [K - Q] * N
for i in range(Q):
ans = int(eval(input()))
point[ans-1] += 1
for item in point:
if item <= 0:
print('No')
else:
print('Yes')
| N, K, Q = list(map(int, input().split()))
ans = [0]*(N+1)
for i in range(Q):
ans[int(eval(input()))] += 1
sum_ans = sum(ans)
for i in range(1,N+1):
print(('Yes' if K-(sum_ans-ans[i]) > 0 else 'No')) | 10 | 7 | 193 | 198 | N, K, Q = list(map(int, input().split()))
point = [K - Q] * N
for i in range(Q):
ans = int(eval(input()))
point[ans - 1] += 1
for item in point:
if item <= 0:
print("No")
else:
print("Yes")
| N, K, Q = list(map(int, input().split()))
ans = [0] * (N + 1)
for i in range(Q):
ans[int(eval(input()))] += 1
sum_ans = sum(ans)
for i in range(1, N + 1):
print(("Yes" if K - (sum_ans - ans[i]) > 0 else "No"))
| false | 30 | [
"-point = [K - Q] * N",
"+ans = [0] * (N + 1)",
"- ans = int(eval(input()))",
"- point[ans - 1] += 1",
"-for item in point:",
"- if item <= 0:",
"- print(\"No\")",
"- else:",
"- print(\"Yes\")",
"+ ans[int(eval(input()))] += 1",
"+sum_ans = sum(ans)",
"+for i in range(1, N + 1):",
"+ print((\"Yes\" if K - (sum_ans - ans[i]) > 0 else \"No\"))"
] | false | 0.03588 | 0.036364 | 0.986694 | [
"s194735951",
"s608700134"
] |
u131411061 | p03221 | python | s806102660 | s775245903 | 734 | 651 | 30,388 | 28,956 | Accepted | Accepted | 11.31 | N,M = list(map(int,input().split()))
d=[0]*M
res = []
for i in range(M):
P,Y = list(map(int,input().split()))
res.append((P,Y,i))
c=0
res.sort()
t = str(res[0][0])
for i in res:
x = str(i[0])
tmp = (6-len(x))*'0'+x+(6-len(str(c)))*'0'+str(c)
if x == t:
c+=1
else:
c=1
t = x
d[i[2]] = (6-len(x))*'0'+x+(6-len(str(c)))*'0'+str(c)
for i in d:
print(i) | N,M = list(map(int,input().split()))
d=[0]*M
res = []
for i in range(M):
P,Y = list(map(int,input().split()))
res.append((P,Y,i))
c=0
res.sort()
t = str(res[0][0])
for i in res:
x = str(i[0])
if x == t:
c+=1
else:
c=1
t = x
d[i[2]] = (6-len(x))*'0'+x+(6-len(str(c)))*'0'+str(c)
for i in d:
print(i)
| 21 | 20 | 413 | 359 | N, M = list(map(int, input().split()))
d = [0] * M
res = []
for i in range(M):
P, Y = list(map(int, input().split()))
res.append((P, Y, i))
c = 0
res.sort()
t = str(res[0][0])
for i in res:
x = str(i[0])
tmp = (6 - len(x)) * "0" + x + (6 - len(str(c))) * "0" + str(c)
if x == t:
c += 1
else:
c = 1
t = x
d[i[2]] = (6 - len(x)) * "0" + x + (6 - len(str(c))) * "0" + str(c)
for i in d:
print(i)
| N, M = list(map(int, input().split()))
d = [0] * M
res = []
for i in range(M):
P, Y = list(map(int, input().split()))
res.append((P, Y, i))
c = 0
res.sort()
t = str(res[0][0])
for i in res:
x = str(i[0])
if x == t:
c += 1
else:
c = 1
t = x
d[i[2]] = (6 - len(x)) * "0" + x + (6 - len(str(c))) * "0" + str(c)
for i in d:
print(i)
| false | 4.761905 | [
"- tmp = (6 - len(x)) * \"0\" + x + (6 - len(str(c))) * \"0\" + str(c)"
] | false | 0.048404 | 0.047717 | 1.014396 | [
"s806102660",
"s775245903"
] |
u440161695 | p03624 | python | s262056089 | s139208267 | 19 | 17 | 3,956 | 3,188 | Accepted | Accepted | 10.53 | s=set(list(eval(input())))
a=set([chr(i+97) for i in range(26)])
a-=s
print((sorted(list(a))[0] if len(a)!=0 else "None")) | s=eval(input())
a=[chr(i) for i in range(ord("a"),ord("z")+1) if chr(i) not in s]
print(("None" if len(a)==0 else a[0])) | 4 | 3 | 117 | 114 | s = set(list(eval(input())))
a = set([chr(i + 97) for i in range(26)])
a -= s
print((sorted(list(a))[0] if len(a) != 0 else "None"))
| s = eval(input())
a = [chr(i) for i in range(ord("a"), ord("z") + 1) if chr(i) not in s]
print(("None" if len(a) == 0 else a[0]))
| false | 25 | [
"-s = set(list(eval(input())))",
"-a = set([chr(i + 97) for i in range(26)])",
"-a -= s",
"-print((sorted(list(a))[0] if len(a) != 0 else \"None\"))",
"+s = eval(input())",
"+a = [chr(i) for i in range(ord(\"a\"), ord(\"z\") + 1) if chr(i) not in s]",
"+print((\"None\" if len(a) == 0 else a[0]))"
] | false | 0.07789 | 0.084204 | 0.925009 | [
"s262056089",
"s139208267"
] |
u606045429 | p02793 | python | s836678127 | s921273359 | 1,890 | 1,512 | 6,140 | 6,076 | Accepted | Accepted | 20 | from fractions import gcd
from functools import reduce
lcm = lambda a, b: a * b // gcd(a, b)
mod = 10 ** 9 + 7
N, *A = list(map(int, open(0).read().split()))
L = reduce(lcm, A)
print((sum(L // a for a in A) % mod)) | from fractions import gcd
mod = 10 ** 9 + 7
N, *A = list(map(int, open(0).read().split()))
L = 1
for a in A:
L *= a // gcd(L, a)
print((sum(L // a for a in A) % mod)) | 10 | 11 | 218 | 176 | from fractions import gcd
from functools import reduce
lcm = lambda a, b: a * b // gcd(a, b)
mod = 10**9 + 7
N, *A = list(map(int, open(0).read().split()))
L = reduce(lcm, A)
print((sum(L // a for a in A) % mod))
| from fractions import gcd
mod = 10**9 + 7
N, *A = list(map(int, open(0).read().split()))
L = 1
for a in A:
L *= a // gcd(L, a)
print((sum(L // a for a in A) % mod))
| false | 9.090909 | [
"-from functools import reduce",
"-lcm = lambda a, b: a * b // gcd(a, b)",
"-L = reduce(lcm, A)",
"+L = 1",
"+for a in A:",
"+ L *= a // gcd(L, a)"
] | false | 0.160572 | 0.046114 | 3.482071 | [
"s836678127",
"s921273359"
] |
u260980560 | p00099 | python | s440305969 | s393386599 | 890 | 560 | 37,896 | 37,888 | Accepted | Accepted | 37.08 | from heapq import heappush, heappop
inputs = lambda: list(map(int, input().split()))
n, q = inputs()
n += 1
que = [(0, 1, -1)]
data = [0] * n
T = [-1] * n
for t in range(q):
a, v = inputs()
data[a] += v
T[a] = t
heappush(que, (-data[a], a, t))
while 1:
v, k, p = heappop(que)
if T[k] == p:
print(k, -v)
heappush(que, (v, k, p))
break | from heapq import heappush, heappop
inputs = lambda: list(map(int, input().split()))
n, q = inputs()
n += 1
que = [(0, 1, -1)]
data = [0] * n
T = [-1] * n
for t in range(q):
a, v = inputs()
data[a] += v
T[a] = t
heappush(que, (-data[a], a, t))
v, k, p = que[0]
while T[k]!=p:
heappop(que)
v, k, p = que[0]
print(k, -v) | 19 | 18 | 422 | 378 | from heapq import heappush, heappop
inputs = lambda: list(map(int, input().split()))
n, q = inputs()
n += 1
que = [(0, 1, -1)]
data = [0] * n
T = [-1] * n
for t in range(q):
a, v = inputs()
data[a] += v
T[a] = t
heappush(que, (-data[a], a, t))
while 1:
v, k, p = heappop(que)
if T[k] == p:
print(k, -v)
heappush(que, (v, k, p))
break
| from heapq import heappush, heappop
inputs = lambda: list(map(int, input().split()))
n, q = inputs()
n += 1
que = [(0, 1, -1)]
data = [0] * n
T = [-1] * n
for t in range(q):
a, v = inputs()
data[a] += v
T[a] = t
heappush(que, (-data[a], a, t))
v, k, p = que[0]
while T[k] != p:
heappop(que)
v, k, p = que[0]
print(k, -v)
| false | 5.263158 | [
"- while 1:",
"- v, k, p = heappop(que)",
"- if T[k] == p:",
"- print(k, -v)",
"- heappush(que, (v, k, p))",
"- break",
"+ v, k, p = que[0]",
"+ while T[k] != p:",
"+ heappop(que)",
"+ v, k, p = que[0]",
"+ print(k, -v)"
] | false | 0.063927 | 0.046271 | 1.381571 | [
"s440305969",
"s393386599"
] |
u190405389 | p02661 | python | s233690658 | s376030647 | 736 | 208 | 99,404 | 93,504 | Accepted | Accepted | 71.74 | import sys
sys.setrecursionlimit(10**7)
readline = sys.stdin.buffer.readline
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print(('\n'.join(map(str,x))))
def printline(x):print((' '.join(map(str,x))))
n = readint()
ab = [readints() for i in range(n)]
if n%2==1:
l = -1
r = 10**9+1
while l+1 != r:
m = (l+r)//2
x = 0
for i in range(n):
a,b = ab[i]
if a<=m:
x+=1
if x>=n//2+1:
r = m
else:
l = m
left = r
l = -1
r = 10**9+1
while l+1 != r:
m = (l+r)//2
x = 0
for i in range(n):
a,b = ab[i]
if m<=b:
x+=1
if x>=n//2+1:
l = m
else:
r = m
right = l
print((right-left+1))
else:
l = -1
r = 10**9+1
while l+1 != r:
m = (l+r)//2
x = 0
for i in range(n):
a,b = ab[i]
if a<=m:
x+=1
if x>=n//2:
r = m
else:
l = m
left1 = r
l = -1
r = 10**9+1
while l+1 != r:
m = (l+r)//2
x = 0
for i in range(n):
a,b = ab[i]
if a<=m:
x+=1
if x>=n//2+1:
r = m
else:
l = m
left2 = r
l = -1
r = 10**9+1
while l+1 != r:
m = (l+r)//2
x = 0
for i in range(n):
a,b = ab[i]
if m<=b:
x+=1
if x>=n//2:
l = m
else:
r = m
right1 = l
l = -1
r = 10**9+1
while l+1 != r:
m = (l+r)//2
x = 0
for i in range(n):
a,b = ab[i]
if m<=b:
x+=1
if x>=n//2+1:
l = m
else:
r = m
right2 = l
ans = 0
ans += right2+right1 - left2-left1 + 1
print(ans)
| import sys
sys.setrecursionlimit(10**7)
readline = sys.stdin.buffer.readline
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print(('\n'.join(map(str,x))))
def printline(x):print((' '.join(map(str,x))))
n = readint()
a = []
b = []
for i in range(n):
x,y = readints()
a.append(x)
b.append(y)
a.sort()
b.sort()
if n%2==1:
l = a[n//2]
r = b[n//2]
print((r-l+1))
else:
l = a[n//2] + a[n//2-1]
r = b[n//2] + b[n//2-1]
print((r-l+1)) | 114 | 30 | 2,217 | 656 | import sys
sys.setrecursionlimit(10**7)
readline = sys.stdin.buffer.readline
def readstr():
return readline().rstrip().decode()
def readstrs():
return list(readline().decode().split())
def readint():
return int(readline())
def readints():
return list(map(int, readline().split()))
def printrows(x):
print(("\n".join(map(str, x))))
def printline(x):
print((" ".join(map(str, x))))
n = readint()
ab = [readints() for i in range(n)]
if n % 2 == 1:
l = -1
r = 10**9 + 1
while l + 1 != r:
m = (l + r) // 2
x = 0
for i in range(n):
a, b = ab[i]
if a <= m:
x += 1
if x >= n // 2 + 1:
r = m
else:
l = m
left = r
l = -1
r = 10**9 + 1
while l + 1 != r:
m = (l + r) // 2
x = 0
for i in range(n):
a, b = ab[i]
if m <= b:
x += 1
if x >= n // 2 + 1:
l = m
else:
r = m
right = l
print((right - left + 1))
else:
l = -1
r = 10**9 + 1
while l + 1 != r:
m = (l + r) // 2
x = 0
for i in range(n):
a, b = ab[i]
if a <= m:
x += 1
if x >= n // 2:
r = m
else:
l = m
left1 = r
l = -1
r = 10**9 + 1
while l + 1 != r:
m = (l + r) // 2
x = 0
for i in range(n):
a, b = ab[i]
if a <= m:
x += 1
if x >= n // 2 + 1:
r = m
else:
l = m
left2 = r
l = -1
r = 10**9 + 1
while l + 1 != r:
m = (l + r) // 2
x = 0
for i in range(n):
a, b = ab[i]
if m <= b:
x += 1
if x >= n // 2:
l = m
else:
r = m
right1 = l
l = -1
r = 10**9 + 1
while l + 1 != r:
m = (l + r) // 2
x = 0
for i in range(n):
a, b = ab[i]
if m <= b:
x += 1
if x >= n // 2 + 1:
l = m
else:
r = m
right2 = l
ans = 0
ans += right2 + right1 - left2 - left1 + 1
print(ans)
| import sys
sys.setrecursionlimit(10**7)
readline = sys.stdin.buffer.readline
def readstr():
return readline().rstrip().decode()
def readstrs():
return list(readline().decode().split())
def readint():
return int(readline())
def readints():
return list(map(int, readline().split()))
def printrows(x):
print(("\n".join(map(str, x))))
def printline(x):
print((" ".join(map(str, x))))
n = readint()
a = []
b = []
for i in range(n):
x, y = readints()
a.append(x)
b.append(y)
a.sort()
b.sort()
if n % 2 == 1:
l = a[n // 2]
r = b[n // 2]
print((r - l + 1))
else:
l = a[n // 2] + a[n // 2 - 1]
r = b[n // 2] + b[n // 2 - 1]
print((r - l + 1))
| false | 73.684211 | [
"-ab = [readints() for i in range(n)]",
"+a = []",
"+b = []",
"+for i in range(n):",
"+ x, y = readints()",
"+ a.append(x)",
"+ b.append(y)",
"+a.sort()",
"+b.sort()",
"- l = -1",
"- r = 10**9 + 1",
"- while l + 1 != r:",
"- m = (l + r) // 2",
"- x = 0",
"- for i in range(n):",
"- a, b = ab[i]",
"- if a <= m:",
"- x += 1",
"- if x >= n // 2 + 1:",
"- r = m",
"- else:",
"- l = m",
"- left = r",
"- l = -1",
"- r = 10**9 + 1",
"- while l + 1 != r:",
"- m = (l + r) // 2",
"- x = 0",
"- for i in range(n):",
"- a, b = ab[i]",
"- if m <= b:",
"- x += 1",
"- if x >= n // 2 + 1:",
"- l = m",
"- else:",
"- r = m",
"- right = l",
"- print((right - left + 1))",
"+ l = a[n // 2]",
"+ r = b[n // 2]",
"+ print((r - l + 1))",
"- l = -1",
"- r = 10**9 + 1",
"- while l + 1 != r:",
"- m = (l + r) // 2",
"- x = 0",
"- for i in range(n):",
"- a, b = ab[i]",
"- if a <= m:",
"- x += 1",
"- if x >= n // 2:",
"- r = m",
"- else:",
"- l = m",
"- left1 = r",
"- l = -1",
"- r = 10**9 + 1",
"- while l + 1 != r:",
"- m = (l + r) // 2",
"- x = 0",
"- for i in range(n):",
"- a, b = ab[i]",
"- if a <= m:",
"- x += 1",
"- if x >= n // 2 + 1:",
"- r = m",
"- else:",
"- l = m",
"- left2 = r",
"- l = -1",
"- r = 10**9 + 1",
"- while l + 1 != r:",
"- m = (l + r) // 2",
"- x = 0",
"- for i in range(n):",
"- a, b = ab[i]",
"- if m <= b:",
"- x += 1",
"- if x >= n // 2:",
"- l = m",
"- else:",
"- r = m",
"- right1 = l",
"- l = -1",
"- r = 10**9 + 1",
"- while l + 1 != r:",
"- m = (l + r) // 2",
"- x = 0",
"- for i in range(n):",
"- a, b = ab[i]",
"- if m <= b:",
"- x += 1",
"- if x >= n // 2 + 1:",
"- l = m",
"- else:",
"- r = m",
"- right2 = l",
"- ans = 0",
"- ans += right2 + right1 - left2 - left1 + 1",
"- print(ans)",
"+ l = a[n // 2] + a[n // 2 - 1]",
"+ r = b[n // 2] + b[n // 2 - 1]",
"+ print((r - l + 1))"
] | false | 0.037815 | 0.035973 | 1.051209 | [
"s233690658",
"s376030647"
] |
u773265208 | p03011 | python | s739686880 | s223105216 | 166 | 17 | 38,512 | 2,940 | Accepted | Accepted | 89.76 | import heapq
l = list(map(int,input().split()))
heapq.heapify(l)
print((heapq.heappop(l) + heapq.heappop(l)))
| ans = list(map(int,input().split()))
ans.sort()
print((ans[0]+ans[1]))
| 5 | 5 | 113 | 75 | import heapq
l = list(map(int, input().split()))
heapq.heapify(l)
print((heapq.heappop(l) + heapq.heappop(l)))
| ans = list(map(int, input().split()))
ans.sort()
print((ans[0] + ans[1]))
| false | 0 | [
"-import heapq",
"-",
"-l = list(map(int, input().split()))",
"-heapq.heapify(l)",
"-print((heapq.heappop(l) + heapq.heappop(l)))",
"+ans = list(map(int, input().split()))",
"+ans.sort()",
"+print((ans[0] + ans[1]))"
] | false | 0.044659 | 0.045869 | 0.97363 | [
"s739686880",
"s223105216"
] |
u616719454 | p02607 | python | s097641002 | s847644051 | 29 | 25 | 9,164 | 8,940 | Accepted | Accepted | 13.79 | N = int(eval(input()))
a =list(map(int,input().split()))
count = 0
for k in range(N+1):
if k % 2 == 0:
continue
else:
if a[k-1] % 2 != 0:
count += 1
print(count)
| N =int(eval(input()))
a =list(map(int,input().split()))
#print(a)
count = 0
D = []
for i in range(N):
if i % 2 == 0:
D.append(i)
#print(D)
for j in D:
if a[j] % 2 != 0:
count += 1
print(count)
| 12 | 19 | 205 | 246 | N = int(eval(input()))
a = list(map(int, input().split()))
count = 0
for k in range(N + 1):
if k % 2 == 0:
continue
else:
if a[k - 1] % 2 != 0:
count += 1
print(count)
| N = int(eval(input()))
a = list(map(int, input().split()))
# print(a)
count = 0
D = []
for i in range(N):
if i % 2 == 0:
D.append(i)
# print(D)
for j in D:
if a[j] % 2 != 0:
count += 1
print(count)
| false | 36.842105 | [
"+# print(a)",
"-for k in range(N + 1):",
"- if k % 2 == 0:",
"- continue",
"- else:",
"- if a[k - 1] % 2 != 0:",
"- count += 1",
"+D = []",
"+for i in range(N):",
"+ if i % 2 == 0:",
"+ D.append(i)",
"+# print(D)",
"+for j in D:",
"+ if a[j] % 2 != 0:",
"+ count += 1"
] | false | 0.007494 | 0.043098 | 0.173892 | [
"s097641002",
"s847644051"
] |
u141786930 | p02911 | python | s564054140 | s516300946 | 266 | 238 | 6,596 | 6,580 | Accepted | Accepted | 10.53 | n, k, q = list(map(int, input().split()))
S = [k-q]*n
for i in range(q):
j = int(eval(input()))
S[j-1] += 1
for i in range(n):
if S[i]>0:
print('Yes')
else:
print('No') | def main():
N, K, Q = list(map(int, input().split()))
ans = [K-Q] * N
for i in range(Q):
ans[int(eval(input()))-1] += 1
for i in ans:
if i > 0:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() | 11 | 15 | 199 | 282 | n, k, q = list(map(int, input().split()))
S = [k - q] * n
for i in range(q):
j = int(eval(input()))
S[j - 1] += 1
for i in range(n):
if S[i] > 0:
print("Yes")
else:
print("No")
| def main():
N, K, Q = list(map(int, input().split()))
ans = [K - Q] * N
for i in range(Q):
ans[int(eval(input())) - 1] += 1
for i in ans:
if i > 0:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
| false | 26.666667 | [
"-n, k, q = list(map(int, input().split()))",
"-S = [k - q] * n",
"-for i in range(q):",
"- j = int(eval(input()))",
"- S[j - 1] += 1",
"-for i in range(n):",
"- if S[i] > 0:",
"- print(\"Yes\")",
"- else:",
"- print(\"No\")",
"+def main():",
"+ N, K, Q = list(map(int, input().split()))",
"+ ans = [K - Q] * N",
"+ for i in range(Q):",
"+ ans[int(eval(input())) - 1] += 1",
"+ for i in ans:",
"+ if i > 0:",
"+ print(\"Yes\")",
"+ else:",
"+ print(\"No\")",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.041596 | 0.04298 | 0.967802 | [
"s564054140",
"s516300946"
] |
u312025627 | p02642 | python | s911500991 | s639620703 | 905 | 788 | 143,288 | 143,952 | Accepted | Accepted | 12.93 | from numba import njit, int32
import numpy as np
@njit(int32(int32[:], int32[:]))
def main(A, B):
ans = 0
for a in A:
B[a] += 1
for a in set(A):
v = 2*a
while v <= 10**6:
B[v] += 1
v += a
for a in A:
if B[a] == 1:
ans += 1
return ans
if __name__ == '__main__':
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [0]*(10**6+1)
ans = main(np.array(A, dtype=np.int32), np.array(B, dtype=np.int32))
print(ans)
| from numba import njit, int32
import numpy as np
@njit(int32(int32[:], int32[:], int32[:]))
def main(A, B, C):
ans = 0
for a in A:
B[a] += 1
for a in C:
v = 2*a
while v <= 10**6:
B[v] += 1
v += a
for a in A:
if B[a] == 1:
ans += 1
return ans
if __name__ == '__main__':
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [0]*(10**6+1)
ans = main(np.array(A, dtype=np.int32),
np.array(B, dtype=np.int32),
np.array([a for a in set(A)], dtype=np.int32))
print(ans)
| 30 | 32 | 559 | 646 | from numba import njit, int32
import numpy as np
@njit(int32(int32[:], int32[:]))
def main(A, B):
ans = 0
for a in A:
B[a] += 1
for a in set(A):
v = 2 * a
while v <= 10**6:
B[v] += 1
v += a
for a in A:
if B[a] == 1:
ans += 1
return ans
if __name__ == "__main__":
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [0] * (10**6 + 1)
ans = main(np.array(A, dtype=np.int32), np.array(B, dtype=np.int32))
print(ans)
| from numba import njit, int32
import numpy as np
@njit(int32(int32[:], int32[:], int32[:]))
def main(A, B, C):
ans = 0
for a in A:
B[a] += 1
for a in C:
v = 2 * a
while v <= 10**6:
B[v] += 1
v += a
for a in A:
if B[a] == 1:
ans += 1
return ans
if __name__ == "__main__":
N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [0] * (10**6 + 1)
ans = main(
np.array(A, dtype=np.int32),
np.array(B, dtype=np.int32),
np.array([a for a in set(A)], dtype=np.int32),
)
print(ans)
| false | 6.25 | [
"-@njit(int32(int32[:], int32[:]))",
"-def main(A, B):",
"+@njit(int32(int32[:], int32[:], int32[:]))",
"+def main(A, B, C):",
"- for a in set(A):",
"+ for a in C:",
"- ans = main(np.array(A, dtype=np.int32), np.array(B, dtype=np.int32))",
"+ ans = main(",
"+ np.array(A, dtype=np.int32),",
"+ np.array(B, dtype=np.int32),",
"+ np.array([a for a in set(A)], dtype=np.int32),",
"+ )"
] | false | 0.04069 | 0.007351 | 5.535297 | [
"s911500991",
"s639620703"
] |
u941047297 | p03680 | python | s228740572 | s982477824 | 517 | 200 | 50,136 | 7,084 | Accepted | Accepted | 61.32 | N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
a = [0] + a
count = 0
i = 1
while i != 2:
j = i
i = a[i]
a[j] = -1
count += 1
if i == -1:
count = -1
break
print(count) | n = int(eval(input()))
A = [int(eval(input())) for _ in range(n)]
count = 0
i = 1
for _ in range(n):
i = A[i - 1]
count += 1
if i == 2:
print(count)
exit()
print((-1)) | 14 | 11 | 223 | 191 | N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
a = [0] + a
count = 0
i = 1
while i != 2:
j = i
i = a[i]
a[j] = -1
count += 1
if i == -1:
count = -1
break
print(count)
| n = int(eval(input()))
A = [int(eval(input())) for _ in range(n)]
count = 0
i = 1
for _ in range(n):
i = A[i - 1]
count += 1
if i == 2:
print(count)
exit()
print((-1))
| false | 21.428571 | [
"-N = int(eval(input()))",
"-a = [int(eval(input())) for _ in range(N)]",
"-a = [0] + a",
"+n = int(eval(input()))",
"+A = [int(eval(input())) for _ in range(n)]",
"-while i != 2:",
"- j = i",
"- i = a[i]",
"- a[j] = -1",
"+for _ in range(n):",
"+ i = A[i - 1]",
"- if i == -1:",
"- count = -1",
"- break",
"-print(count)",
"+ if i == 2:",
"+ print(count)",
"+ exit()",
"+print((-1))"
] | false | 0.045071 | 0.082578 | 0.545805 | [
"s228740572",
"s982477824"
] |
u034128150 | p02647 | python | s992429954 | s669205965 | 976 | 871 | 134,748 | 132,812 | Accepted | Accepted | 10.76 | import numpy as np
from numba import njit
#'''
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
'''
N = 200000
K = 100000
As = [0] * N
#'''
@njit(cache = True)
def update(A_array):
before_csum = np.zeros(N+1, np.int32)
for i, A in enumerate(A_array[:N]):
before_csum[max(0, i-A)] += 1
before_csum[min(N, i+A+1)] -= 1
return np.cumsum(before_csum)
A_array = np.array(As + [0], dtype = np.int32)
for k in range(min(K, 50)):
A_array = update(A_array)
print((*A_array.tolist()[:N]))
| import numpy as np
from numba import njit, prange
#'''
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
'''
N = 200000
K = 100000
As = [0] * N
#'''
@njit("i8[:](i8[:],)", cache = True)
def update(A_array):
before_csum = np.zeros(N+1, np.int64)
for i, A in enumerate(A_array[:N]):
before_csum[max(0, i-A)] += 1
before_csum[min(N, i+A+1)] -= 1
return np.cumsum(before_csum)
A_array = np.array(As + [0], dtype = np.int64)
for k in range(min(K, 50)):
A_array = update(A_array)
print((*A_array.tolist()[:N])) | 25 | 25 | 566 | 590 | import numpy as np
from numba import njit
#'''
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
"""
N = 200000
K = 100000
As = [0] * N
#"""
@njit(cache=True)
def update(A_array):
before_csum = np.zeros(N + 1, np.int32)
for i, A in enumerate(A_array[:N]):
before_csum[max(0, i - A)] += 1
before_csum[min(N, i + A + 1)] -= 1
return np.cumsum(before_csum)
A_array = np.array(As + [0], dtype=np.int32)
for k in range(min(K, 50)):
A_array = update(A_array)
print((*A_array.tolist()[:N]))
| import numpy as np
from numba import njit, prange
#'''
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
"""
N = 200000
K = 100000
As = [0] * N
#"""
@njit("i8[:](i8[:],)", cache=True)
def update(A_array):
before_csum = np.zeros(N + 1, np.int64)
for i, A in enumerate(A_array[:N]):
before_csum[max(0, i - A)] += 1
before_csum[min(N, i + A + 1)] -= 1
return np.cumsum(before_csum)
A_array = np.array(As + [0], dtype=np.int64)
for k in range(min(K, 50)):
A_array = update(A_array)
print((*A_array.tolist()[:N]))
| false | 0 | [
"-from numba import njit",
"+from numba import njit, prange",
"-@njit(cache=True)",
"+@njit(\"i8[:](i8[:],)\", cache=True)",
"- before_csum = np.zeros(N + 1, np.int32)",
"+ before_csum = np.zeros(N + 1, np.int64)",
"-A_array = np.array(As + [0], dtype=np.int32)",
"+A_array = np.array(As + [0], dtype=np.int64)"
] | false | 0.381514 | 0.242635 | 1.57238 | [
"s992429954",
"s669205965"
] |
u284854859 | p03108 | python | s049141343 | s575873876 | 630 | 496 | 48,392 | 24,052 | Accepted | Accepted | 21.27 | import sys
input = sys.stdin.readline
#木の根を求める
def find(x):
if par[x] == x:
return x
else:
return find(par[x])
#xとyの属する集合の併合
def unite(x,y):
x = find(x)
y = find(y)
if x != y:
#xとyの属している集合が異なる時
if rank[x] < rank[y]:
par[x] = y
size[y] += size[x]
else:
par[y] = x
size[x] += size[y]
if rank[x]==rank[y]:
rank[x] += 1
#xとyが同じ集合に属するかの判定
def same(x,y):
return find(x) == find(y)
########################################
#初期化
n,m = list(map(int,input().split()))
par = [0]*n #親
for i in range(n):
par[i] = i
rank = [1]*n #深さ
size = [1]*n #size[i]:iを根とするグループのサイズ
edge2 = [[0] for i in range(m)]
for i in range(m):
edge2[i] = list(map(int,input().split()))
edge = [[0] for i in range(m)]
for i in range(m):
edge[i] = [edge2[m-1-i][0]-1,edge2[m-1-i][1]-1]
res = []
for i in range(m):
fi = find(edge[i][0])
se = find(edge[i][1])
if fi == se:
res.append(0)
else:
res.append(size[fi]*size[se])
unite(fi,se)
ass = 0
for i in range(m):
ass += res[m-1-i]
print(ass)
| import sys
input = sys.stdin.readline
#木の根を求める
def find(x):
if par[x] == x:
return x
else:
return find(par[x])
#xとyの属する集合の併合
def unite(x,y):
x = find(x)
y = find(y)
if x != y:
#xとyの属している集合が異なる時
if rank[x] < rank[y]:
par[x] = y
size[y] += size[x]
else:
par[y] = x
size[x] += size[y]
if rank[x]==rank[y]:
rank[x] += 1
#xとyが同じ集合に属するかの判定
def same(x,y):
return find(x) == find(y)
########################################
#初期化
n,m = list(map(int,input().split()))
par = [0]*n #親
for i in range(n):
par[i] = i
rank = [1]*n #深さ
size = [1]*n #size[i]:iを根とするグループのサイズ
edge = [tuple(map(int,input().split())) for i in range(m)]
edge = edge[::-1]
for i in range(m):
edge[i] = (edge[i][0]-1,edge[i][1]-1)
res = []
for i in range(m):
fi = find(edge[i][0])
se = find(edge[i][1])
if fi == se:
res.append(0)
else:
res.append(size[fi]*size[se])
unite(fi,se)
ass = 0
for i in range(m):
ass += res[m-1-i]
print(ass)
| 59 | 58 | 1,215 | 1,154 | import sys
input = sys.stdin.readline
# 木の根を求める
def find(x):
if par[x] == x:
return x
else:
return find(par[x])
# xとyの属する集合の併合
def unite(x, y):
x = find(x)
y = find(y)
if x != y:
# xとyの属している集合が異なる時
if rank[x] < rank[y]:
par[x] = y
size[y] += size[x]
else:
par[y] = x
size[x] += size[y]
if rank[x] == rank[y]:
rank[x] += 1
# xとyが同じ集合に属するかの判定
def same(x, y):
return find(x) == find(y)
########################################
# 初期化
n, m = list(map(int, input().split()))
par = [0] * n # 親
for i in range(n):
par[i] = i
rank = [1] * n # 深さ
size = [1] * n # size[i]:iを根とするグループのサイズ
edge2 = [[0] for i in range(m)]
for i in range(m):
edge2[i] = list(map(int, input().split()))
edge = [[0] for i in range(m)]
for i in range(m):
edge[i] = [edge2[m - 1 - i][0] - 1, edge2[m - 1 - i][1] - 1]
res = []
for i in range(m):
fi = find(edge[i][0])
se = find(edge[i][1])
if fi == se:
res.append(0)
else:
res.append(size[fi] * size[se])
unite(fi, se)
ass = 0
for i in range(m):
ass += res[m - 1 - i]
print(ass)
| import sys
input = sys.stdin.readline
# 木の根を求める
def find(x):
if par[x] == x:
return x
else:
return find(par[x])
# xとyの属する集合の併合
def unite(x, y):
x = find(x)
y = find(y)
if x != y:
# xとyの属している集合が異なる時
if rank[x] < rank[y]:
par[x] = y
size[y] += size[x]
else:
par[y] = x
size[x] += size[y]
if rank[x] == rank[y]:
rank[x] += 1
# xとyが同じ集合に属するかの判定
def same(x, y):
return find(x) == find(y)
########################################
# 初期化
n, m = list(map(int, input().split()))
par = [0] * n # 親
for i in range(n):
par[i] = i
rank = [1] * n # 深さ
size = [1] * n # size[i]:iを根とするグループのサイズ
edge = [tuple(map(int, input().split())) for i in range(m)]
edge = edge[::-1]
for i in range(m):
edge[i] = (edge[i][0] - 1, edge[i][1] - 1)
res = []
for i in range(m):
fi = find(edge[i][0])
se = find(edge[i][1])
if fi == se:
res.append(0)
else:
res.append(size[fi] * size[se])
unite(fi, se)
ass = 0
for i in range(m):
ass += res[m - 1 - i]
print(ass)
| false | 1.694915 | [
"-edge2 = [[0] for i in range(m)]",
"+edge = [tuple(map(int, input().split())) for i in range(m)]",
"+edge = edge[::-1]",
"- edge2[i] = list(map(int, input().split()))",
"-edge = [[0] for i in range(m)]",
"-for i in range(m):",
"- edge[i] = [edge2[m - 1 - i][0] - 1, edge2[m - 1 - i][1] - 1]",
"+ edge[i] = (edge[i][0] - 1, edge[i][1] - 1)"
] | false | 0.039561 | 0.092086 | 0.429607 | [
"s049141343",
"s575873876"
] |
u102461423 | p03939 | python | s060543750 | s050489325 | 265 | 88 | 3,064 | 9,188 | Accepted | Accepted | 66.79 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,D,X = list(map(int,read().split()))
answer = 0
for n in range(N,0,-1):
mean = D + X * (n+n-1) / 2
answer += mean
D = ((n+n+2) * D + 5 * X) / (2*n)
X = (n + 2) * X / n
print(answer) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, d, x = list(map(int, read().split()))
def main(N, d, x):
ret = 0
while N:
ret += d + (N-0.5) * x
d = d + (d/N) + (5*x)/(2*N)
x += 2*x/N
N -= 1
return ret
print((main(N, d, x))) | 15 | 18 | 325 | 352 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, D, X = list(map(int, read().split()))
answer = 0
for n in range(N, 0, -1):
mean = D + X * (n + n - 1) / 2
answer += mean
D = ((n + n + 2) * D + 5 * X) / (2 * n)
X = (n + 2) * X / n
print(answer)
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, d, x = list(map(int, read().split()))
def main(N, d, x):
ret = 0
while N:
ret += d + (N - 0.5) * x
d = d + (d / N) + (5 * x) / (2 * N)
x += 2 * x / N
N -= 1
return ret
print((main(N, d, x)))
| false | 16.666667 | [
"-N, D, X = list(map(int, read().split()))",
"-answer = 0",
"-for n in range(N, 0, -1):",
"- mean = D + X * (n + n - 1) / 2",
"- answer += mean",
"- D = ((n + n + 2) * D + 5 * X) / (2 * n)",
"- X = (n + 2) * X / n",
"-print(answer)",
"+N, d, x = list(map(int, read().split()))",
"+",
"+",
"+def main(N, d, x):",
"+ ret = 0",
"+ while N:",
"+ ret += d + (N - 0.5) * x",
"+ d = d + (d / N) + (5 * x) / (2 * N)",
"+ x += 2 * x / N",
"+ N -= 1",
"+ return ret",
"+",
"+",
"+print((main(N, d, x)))"
] | false | 0.110414 | 0.041675 | 2.649438 | [
"s060543750",
"s050489325"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.