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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u150984829 | p00447 | python | s725148039 | s291041439 | 100 | 90 | 6,048 | 6,052 | Accepted | Accepted | 10 | while True:
m = int(eval(input()))
if m == 0: break
star = list({tuple(map(int, input().split())) for i in range(m)})
sx, sy = star[0]
n = int(eval(input()))
starset = {tuple(map(int, input().split())) for i in range(n)}
for x, y in starset:
flag = True
for j in range(len(star)-1):
dx = x + star[j+1][0] - sx
dy = y + star[j+1][1] - sy
if (dx, dy) not in starset:
flag = False
break
if flag == True:
print((x - sx, y - sy))
break
| for e in iter(input,'0'):
a=list({tuple(map(int, input().split())) for i in range(int(e))})
s,t=a[0]
b={tuple(map(int, input().split())) for i in range(int(eval(input())))}
for x,y in b:
flag = True
for u,v in a[1:]:
if (x + u - s, y + v - t) not in b:
flag = False
break
if flag == True:
print((x - s, y - t))
break
| 22 | 14 | 594 | 431 | while True:
m = int(eval(input()))
if m == 0:
break
star = list({tuple(map(int, input().split())) for i in range(m)})
sx, sy = star[0]
n = int(eval(input()))
starset = {tuple(map(int, input().split())) for i in range(n)}
for x, y in starset:
flag = True
for j in range(len(star) - 1):
dx = x + star[j + 1][0] - sx
dy = y + star[j + 1][1] - sy
if (dx, dy) not in starset:
flag = False
break
if flag == True:
print((x - sx, y - sy))
break
| for e in iter(input, "0"):
a = list({tuple(map(int, input().split())) for i in range(int(e))})
s, t = a[0]
b = {tuple(map(int, input().split())) for i in range(int(eval(input())))}
for x, y in b:
flag = True
for u, v in a[1:]:
if (x + u - s, y + v - t) not in b:
flag = False
break
if flag == True:
print((x - s, y - t))
break
| false | 36.363636 | [
"-while True:",
"- m = int(eval(input()))",
"- if m == 0:",
"- break",
"- star = list({tuple(map(int, input().split())) for i in range(m)})",
"- sx, sy = star[0]",
"- n = int(eval(input()))",
"- starset = {tuple(map(int, input().split())) for i in range(n)}",
"- for x, y in starset:",
"+for e in iter(input, \"0\"):",
"+ a = list({tuple(map(int, input().split())) for i in range(int(e))})",
"+ s, t = a[0]",
"+ b = {tuple(map(int, input().split())) for i in range(int(eval(input())))}",
"+ for x, y in b:",
"- for j in range(len(star) - 1):",
"- dx = x + star[j + 1][0] - sx",
"- dy = y + star[j + 1][1] - sy",
"- if (dx, dy) not in starset:",
"+ for u, v in a[1:]:",
"+ if (x + u - s, y + v - t) not in b:",
"- print((x - sx, y - sy))",
"+ print((x - s, y - t))"
] | false | 0.101111 | 0.29672 | 0.340761 | [
"s725148039",
"s291041439"
] |
u970197315 | p03779 | python | s225679805 | s146070885 | 50 | 39 | 6,040 | 3,060 | Accepted | Accepted | 22 | # ABC056 C - Go Home
X = int(eval(input()))
T = []
total = 0
idx = 0
ans = 0
while total < 2500000000:
idx += 1
total += idx
T.append(total)
for i in range(len(T)-1):
if i == 0:
if X == T[i]:
ans = i+1
break
if T[i-1]<X<=T[i]:
ans = i+1
break
print(ans) | x=int(eval(input()))
if x==1:
print((1))
exit(0)
for i in range(1,100001):
t=i*(i+1)//2
s=(i+1)*(i+2)//2
if t<x<=s:
print((i+1))
exit(0) | 22 | 10 | 339 | 153 | # ABC056 C - Go Home
X = int(eval(input()))
T = []
total = 0
idx = 0
ans = 0
while total < 2500000000:
idx += 1
total += idx
T.append(total)
for i in range(len(T) - 1):
if i == 0:
if X == T[i]:
ans = i + 1
break
if T[i - 1] < X <= T[i]:
ans = i + 1
break
print(ans)
| x = int(eval(input()))
if x == 1:
print((1))
exit(0)
for i in range(1, 100001):
t = i * (i + 1) // 2
s = (i + 1) * (i + 2) // 2
if t < x <= s:
print((i + 1))
exit(0)
| false | 54.545455 | [
"-# ABC056 C - Go Home",
"-X = int(eval(input()))",
"-T = []",
"-total = 0",
"-idx = 0",
"-ans = 0",
"-while total < 2500000000:",
"- idx += 1",
"- total += idx",
"- T.append(total)",
"-for i in range(len(T) - 1):",
"- if i == 0:",
"- if X == T[i]:",
"- ans = i + 1",
"- break",
"- if T[i - 1] < X <= T[i]:",
"- ans = i + 1",
"- break",
"-print(ans)",
"+x = int(eval(input()))",
"+if x == 1:",
"+ print((1))",
"+ exit(0)",
"+for i in range(1, 100001):",
"+ t = i * (i + 1) // 2",
"+ s = (i + 1) * (i + 2) // 2",
"+ if t < x <= s:",
"+ print((i + 1))",
"+ exit(0)"
] | false | 0.055439 | 0.112635 | 0.492199 | [
"s225679805",
"s146070885"
] |
u091533407 | p02265 | python | s483046232 | s186000152 | 4,340 | 1,930 | 71,812 | 214,316 | Accepted | Accepted | 55.53 | # -*- coding: utf-8 -*-
from collections import deque
COMMAND = ("insert", "delete", "deleteFirst", "deleteLast")
if __name__ == "__main__":
n = int(eval(input()))
ans = deque()
for i in range(n):
com = input().split()
if com[0] == COMMAND[0]:
ans.appendleft(com[1])
elif com[0] == COMMAND[1]:
if com[1] in ans:
ans.remove(com[1])
elif com[0] == COMMAND[2]:
ans.popleft()
elif com[0] == COMMAND[3]:
ans.pop()
print((" ".join(ans))) | # -*- coding: utf-8 -*-
from collections import deque
import sys
COMMAND = ("insert", "delete", "deleteFirst", "deleteLast")
if __name__ == "__main__":
n = int(sys.stdin.readline())
ans = deque()
inp = sys.stdin.readlines()
for i in range(n):
com = inp[i].split()
if com[0] == COMMAND[0]:
ans.appendleft(com[1])
elif com[0] == COMMAND[1]:
if com[1] in ans:
ans.remove(com[1])
elif com[0] == COMMAND[2]:
ans.popleft()
elif com[0] == COMMAND[3]:
ans.pop()
print((" ".join(ans))) | 21 | 23 | 566 | 623 | # -*- coding: utf-8 -*-
from collections import deque
COMMAND = ("insert", "delete", "deleteFirst", "deleteLast")
if __name__ == "__main__":
n = int(eval(input()))
ans = deque()
for i in range(n):
com = input().split()
if com[0] == COMMAND[0]:
ans.appendleft(com[1])
elif com[0] == COMMAND[1]:
if com[1] in ans:
ans.remove(com[1])
elif com[0] == COMMAND[2]:
ans.popleft()
elif com[0] == COMMAND[3]:
ans.pop()
print((" ".join(ans)))
| # -*- coding: utf-8 -*-
from collections import deque
import sys
COMMAND = ("insert", "delete", "deleteFirst", "deleteLast")
if __name__ == "__main__":
n = int(sys.stdin.readline())
ans = deque()
inp = sys.stdin.readlines()
for i in range(n):
com = inp[i].split()
if com[0] == COMMAND[0]:
ans.appendleft(com[1])
elif com[0] == COMMAND[1]:
if com[1] in ans:
ans.remove(com[1])
elif com[0] == COMMAND[2]:
ans.popleft()
elif com[0] == COMMAND[3]:
ans.pop()
print((" ".join(ans)))
| false | 8.695652 | [
"+import sys",
"- n = int(eval(input()))",
"+ n = int(sys.stdin.readline())",
"+ inp = sys.stdin.readlines()",
"- com = input().split()",
"+ com = inp[i].split()"
] | false | 0.069586 | 0.043653 | 1.594069 | [
"s483046232",
"s186000152"
] |
u406405116 | p02859 | python | s715029330 | s996612162 | 42 | 17 | 2,940 | 2,940 | Accepted | Accepted | 59.52 | r = int(eval(input()))
print((r*r)) | r = int(eval(input()))
print((r**2)) | 2 | 2 | 28 | 29 | r = int(eval(input()))
print((r * r))
| r = int(eval(input()))
print((r**2))
| false | 0 | [
"-print((r * r))",
"+print((r**2))"
] | false | 0.078218 | 0.053559 | 1.460407 | [
"s715029330",
"s996612162"
] |
u878654696 | p02729 | python | s621971837 | s666336562 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | n, m = list(map(int, input().split()))
print((m*(m-1)//2 + n*(n-1)//2))
| print((sum([int(i)*(int(i)-1)//2 for i in input().split()])))
| 3 | 1 | 67 | 65 | n, m = list(map(int, input().split()))
print((m * (m - 1) // 2 + n * (n - 1) // 2))
| print((sum([int(i) * (int(i) - 1) // 2 for i in input().split()])))
| false | 66.666667 | [
"-n, m = list(map(int, input().split()))",
"-print((m * (m - 1) // 2 + n * (n - 1) // 2))",
"+print((sum([int(i) * (int(i) - 1) // 2 for i in input().split()])))"
] | false | 0.104433 | 0.162912 | 0.641041 | [
"s621971837",
"s666336562"
] |
u761320129 | p02949 | python | s020544122 | s650300891 | 1,210 | 1,061 | 56,024 | 55,128 | Accepted | Accepted | 12.31 | N,M,P = list(map(int,input().split()))
ABC = [tuple(map(int,input().split())) for i in range(M)]
es = [[] for _ in range(N)]
rs = [[] for _ in range(N)]
for a,b,c in ABC:
a,b = a-1,b-1
es[a].append((b,P-c))
rs[b].append(a)
stack = [0]
govisit = set([0])
while stack:
v = stack.pop()
for to,_ in es[v]:
if to in govisit: continue
govisit.add(to)
stack.append(to)
stack = [N-1]
backvisit = set([N-1])
while stack:
v = stack.pop()
for to in rs[v]:
if to in backvisit: continue
backvisit.add(to)
stack.append(to)
use = govisit & backvisit
INF = float('inf')
dist = [INF] * N
dist[0] = 0
for i in range(N):
for fr,e in enumerate(es):
if fr not in use: continue
for to,c in e:
if to not in use: continue
if dist[to] > dist[fr] + c:
dist[to] = dist[fr] + c
if i==N-1:
print((-1))
exit()
print((max(0,-dist[-1]))) | N,M,P = list(map(int,input().split()))
ABC = [tuple(map(int,input().split())) for i in range(M)]
es = [[] for _ in range(N)]
bs = [[] for _ in range(N)]
for a,b,c in ABC:
a,b = a-1,b-1
es[a].append((b,c-P))
bs[b].append((a,c-P))
go_set = set([0])
stack = [0]
while stack:
v = stack.pop()
for to,_ in es[v]:
if to in go_set: continue
go_set.add(to)
stack.append(to)
bk_set = set([N-1])
stack = [N-1]
while stack:
v = stack.pop()
for to,_ in bs[v]:
if to in bk_set: continue
bk_set.add(to)
stack.append(to)
use = go_set & bk_set
K = len(use)
INF = float('inf')
d = [INF] * N
d[0] = 0
for i in range(K):
for v in range(N):
if v not in use: continue
for to,c in es[v]:
if to not in use: continue
if d[to] > d[v] - c:
d[to] = d[v] - c
if i==K-1:
print((-1))
exit()
print((max(0, -d[-1]))) | 42 | 44 | 1,031 | 1,012 | N, M, P = list(map(int, input().split()))
ABC = [tuple(map(int, input().split())) for i in range(M)]
es = [[] for _ in range(N)]
rs = [[] for _ in range(N)]
for a, b, c in ABC:
a, b = a - 1, b - 1
es[a].append((b, P - c))
rs[b].append(a)
stack = [0]
govisit = set([0])
while stack:
v = stack.pop()
for to, _ in es[v]:
if to in govisit:
continue
govisit.add(to)
stack.append(to)
stack = [N - 1]
backvisit = set([N - 1])
while stack:
v = stack.pop()
for to in rs[v]:
if to in backvisit:
continue
backvisit.add(to)
stack.append(to)
use = govisit & backvisit
INF = float("inf")
dist = [INF] * N
dist[0] = 0
for i in range(N):
for fr, e in enumerate(es):
if fr not in use:
continue
for to, c in e:
if to not in use:
continue
if dist[to] > dist[fr] + c:
dist[to] = dist[fr] + c
if i == N - 1:
print((-1))
exit()
print((max(0, -dist[-1])))
| N, M, P = list(map(int, input().split()))
ABC = [tuple(map(int, input().split())) for i in range(M)]
es = [[] for _ in range(N)]
bs = [[] for _ in range(N)]
for a, b, c in ABC:
a, b = a - 1, b - 1
es[a].append((b, c - P))
bs[b].append((a, c - P))
go_set = set([0])
stack = [0]
while stack:
v = stack.pop()
for to, _ in es[v]:
if to in go_set:
continue
go_set.add(to)
stack.append(to)
bk_set = set([N - 1])
stack = [N - 1]
while stack:
v = stack.pop()
for to, _ in bs[v]:
if to in bk_set:
continue
bk_set.add(to)
stack.append(to)
use = go_set & bk_set
K = len(use)
INF = float("inf")
d = [INF] * N
d[0] = 0
for i in range(K):
for v in range(N):
if v not in use:
continue
for to, c in es[v]:
if to not in use:
continue
if d[to] > d[v] - c:
d[to] = d[v] - c
if i == K - 1:
print((-1))
exit()
print((max(0, -d[-1])))
| false | 4.545455 | [
"-rs = [[] for _ in range(N)]",
"+bs = [[] for _ in range(N)]",
"- es[a].append((b, P - c))",
"- rs[b].append(a)",
"+ es[a].append((b, c - P))",
"+ bs[b].append((a, c - P))",
"+go_set = set([0])",
"-govisit = set([0])",
"- if to in govisit:",
"+ if to in go_set:",
"- govisit.add(to)",
"+ go_set.add(to)",
"+bk_set = set([N - 1])",
"-backvisit = set([N - 1])",
"- for to in rs[v]:",
"- if to in backvisit:",
"+ for to, _ in bs[v]:",
"+ if to in bk_set:",
"- backvisit.add(to)",
"+ bk_set.add(to)",
"-use = govisit & backvisit",
"+use = go_set & bk_set",
"+K = len(use)",
"-dist = [INF] * N",
"-dist[0] = 0",
"-for i in range(N):",
"- for fr, e in enumerate(es):",
"- if fr not in use:",
"+d = [INF] * N",
"+d[0] = 0",
"+for i in range(K):",
"+ for v in range(N):",
"+ if v not in use:",
"- for to, c in e:",
"+ for to, c in es[v]:",
"- if dist[to] > dist[fr] + c:",
"- dist[to] = dist[fr] + c",
"- if i == N - 1:",
"+ if d[to] > d[v] - c:",
"+ d[to] = d[v] - c",
"+ if i == K - 1:",
"-print((max(0, -dist[-1])))",
"+print((max(0, -d[-1])))"
] | false | 0.083217 | 0.032226 | 2.582336 | [
"s020544122",
"s650300891"
] |
u261103969 | p02658 | python | s379700498 | s465145294 | 79 | 53 | 84,836 | 21,476 | Accepted | Accepted | 32.91 | import sys
n = int(eval(input()))
a = list(map(int, input().split()))
if 0 in a:
print((0))
else:
cur = 1
for x in a:
cur *= x
if cur > 10 ** 18:
print((-1))
sys.exit()
print(cur) | import sys # sys.exit()を使いたいので
n = int(eval(input()))
a = list(map(int, input().split()))
if 0 in a:
# 0が1つでもあれば0です
print((0))
else:
# 0がない場合
cur = 1 # 現在の数値
for x in a:
cur *= x
if cur > 10 ** 18:
# 10**18を超えたので終了します
print((-1))
sys.exit()
print(cur) # 10**18以下なので、出力します | 15 | 18 | 241 | 347 | import sys
n = int(eval(input()))
a = list(map(int, input().split()))
if 0 in a:
print((0))
else:
cur = 1
for x in a:
cur *= x
if cur > 10**18:
print((-1))
sys.exit()
print(cur)
| import sys # sys.exit()を使いたいので
n = int(eval(input()))
a = list(map(int, input().split()))
if 0 in a:
# 0が1つでもあれば0です
print((0))
else:
# 0がない場合
cur = 1 # 現在の数値
for x in a:
cur *= x
if cur > 10**18:
# 10**18を超えたので終了します
print((-1))
sys.exit()
print(cur) # 10**18以下なので、出力します
| false | 16.666667 | [
"-import sys",
"+import sys # sys.exit()を使いたいので",
"+ # 0が1つでもあれば0です",
"- cur = 1",
"+ # 0がない場合",
"+ cur = 1 # 現在の数値",
"+ # 10**18を超えたので終了します",
"- print(cur)",
"+ print(cur) # 10**18以下なので、出力します"
] | false | 0.081866 | 0.10606 | 0.771889 | [
"s379700498",
"s465145294"
] |
u952708174 | p03221 | python | s939782754 | s343980578 | 833 | 638 | 59,576 | 66,592 | Accepted | Accepted | 23.41 | def c_id():
from collections import defaultdict
N, M = list(map(int, input().split()))
City = [[s] + [int(i) for i in input().split()] for s in range(M)]
# 同じ県に属する市を誕生年の早い順に並べ、順序付けする
city_dict = defaultdict(list)
for k, p, y in City:
city_dict[p].append([k, p, y])
for p in list(city_dict.keys()):
city_dict[p].sort(key=lambda x: x[2])
for i in range(len(city_dict[p])):
city_dict[p][i][2] = i + 1
# 変換は終わった。通し番号順に並べる
ans = sorted([e for v in list(city_dict.values()) for e in v])
return '\n'.join(['{0:06d}{1:06d}'.format(p, num) for _, p, num in ans]) # 通し番号は不要
print((c_id())) | def c_id():
from collections import defaultdict
N, M = [int(i) for i in input().split()]
Cities = [[int(i) for i in input().split()] for j in range(M)]
dic = defaultdict(list)
# 県毎に市をまとめる
for p, y in Cities:
dic[p].append(y)
# 市の認識番号を (座標) 圧縮
for p, lst in list(dic.items()):
dic[p] = {v: k for k, v in enumerate(sorted(lst), 1)}
return '\n'.join(['{0:06d}{1:06d}'.format(p, dic[p][y]) for p, y in Cities])
print((c_id())) | 19 | 15 | 657 | 482 | def c_id():
from collections import defaultdict
N, M = list(map(int, input().split()))
City = [[s] + [int(i) for i in input().split()] for s in range(M)]
# 同じ県に属する市を誕生年の早い順に並べ、順序付けする
city_dict = defaultdict(list)
for k, p, y in City:
city_dict[p].append([k, p, y])
for p in list(city_dict.keys()):
city_dict[p].sort(key=lambda x: x[2])
for i in range(len(city_dict[p])):
city_dict[p][i][2] = i + 1
# 変換は終わった。通し番号順に並べる
ans = sorted([e for v in list(city_dict.values()) for e in v])
return "\n".join(["{0:06d}{1:06d}".format(p, num) for _, p, num in ans]) # 通し番号は不要
print((c_id()))
| def c_id():
from collections import defaultdict
N, M = [int(i) for i in input().split()]
Cities = [[int(i) for i in input().split()] for j in range(M)]
dic = defaultdict(list)
# 県毎に市をまとめる
for p, y in Cities:
dic[p].append(y)
# 市の認識番号を (座標) 圧縮
for p, lst in list(dic.items()):
dic[p] = {v: k for k, v in enumerate(sorted(lst), 1)}
return "\n".join(["{0:06d}{1:06d}".format(p, dic[p][y]) for p, y in Cities])
print((c_id()))
| false | 21.052632 | [
"- N, M = list(map(int, input().split()))",
"- City = [[s] + [int(i) for i in input().split()] for s in range(M)]",
"- # 同じ県に属する市を誕生年の早い順に並べ、順序付けする",
"- city_dict = defaultdict(list)",
"- for k, p, y in City:",
"- city_dict[p].append([k, p, y])",
"- for p in list(city_dict.keys()):",
"- city_dict[p].sort(key=lambda x: x[2])",
"- for i in range(len(city_dict[p])):",
"- city_dict[p][i][2] = i + 1",
"- # 変換は終わった。通し番号順に並べる",
"- ans = sorted([e for v in list(city_dict.values()) for e in v])",
"- return \"\\n\".join([\"{0:06d}{1:06d}\".format(p, num) for _, p, num in ans]) # 通し番号は不要",
"+ N, M = [int(i) for i in input().split()]",
"+ Cities = [[int(i) for i in input().split()] for j in range(M)]",
"+ dic = defaultdict(list)",
"+ # 県毎に市をまとめる",
"+ for p, y in Cities:",
"+ dic[p].append(y)",
"+ # 市の認識番号を (座標) 圧縮",
"+ for p, lst in list(dic.items()):",
"+ dic[p] = {v: k for k, v in enumerate(sorted(lst), 1)}",
"+ return \"\\n\".join([\"{0:06d}{1:06d}\".format(p, dic[p][y]) for p, y in Cities])"
] | false | 0.045272 | 0.035444 | 1.277286 | [
"s939782754",
"s343980578"
] |
u343748576 | p02399 | python | s895631875 | s826060731 | 30 | 20 | 7,668 | 7,660 | Accepted | Accepted | 33.33 | a, b = [int(x) for x in input().split() if x.isdigit()]
d = a // b
r = a % b
f = a / b
print(('%s %s %.5f' % (d, r, f))) | a, b = [int(x) for x in input().split() if x.isdigit()]
d = a // b
r = a % b
f = a / b
print(("{0} {1} {2:.5f}".format(d, r, f))) | 5 | 5 | 122 | 131 | a, b = [int(x) for x in input().split() if x.isdigit()]
d = a // b
r = a % b
f = a / b
print(("%s %s %.5f" % (d, r, f)))
| a, b = [int(x) for x in input().split() if x.isdigit()]
d = a // b
r = a % b
f = a / b
print(("{0} {1} {2:.5f}".format(d, r, f)))
| false | 0 | [
"-print((\"%s %s %.5f\" % (d, r, f)))",
"+print((\"{0} {1} {2:.5f}\".format(d, r, f)))"
] | false | 0.03241 | 0.033601 | 0.96454 | [
"s895631875",
"s826060731"
] |
u268822556 | p02642 | python | s174433096 | s603600213 | 547 | 397 | 32,240 | 32,096 | Accepted | Accepted | 27.42 | N = int(eval(input()))
A_list = list(map(int, input().split()))
M = 10**6+1
cnt = [0 for _ in range(M)]
for i in A_list:
if cnt[i] != 0:
cnt[i] = 2
continue
for j in range(i, M, i): cnt[j] += 1
ans = 0
for k in A_list:
if cnt[k] == 1: ans += 1
print(ans) | N = int(eval(input()))
A_list = list(map(int, input().split()))
M = max(A_list)+1
cnt = [0 for _ in range(M)]
for i in A_list:
if cnt[i] != 0:
cnt[i] = 2
continue
for j in range(i, M, i): cnt[j] += 1
ans = 0
for k in A_list:
if cnt[k] == 1: ans += 1
print(ans)
| 15 | 15 | 292 | 299 | N = int(eval(input()))
A_list = list(map(int, input().split()))
M = 10**6 + 1
cnt = [0 for _ in range(M)]
for i in A_list:
if cnt[i] != 0:
cnt[i] = 2
continue
for j in range(i, M, i):
cnt[j] += 1
ans = 0
for k in A_list:
if cnt[k] == 1:
ans += 1
print(ans)
| N = int(eval(input()))
A_list = list(map(int, input().split()))
M = max(A_list) + 1
cnt = [0 for _ in range(M)]
for i in A_list:
if cnt[i] != 0:
cnt[i] = 2
continue
for j in range(i, M, i):
cnt[j] += 1
ans = 0
for k in A_list:
if cnt[k] == 1:
ans += 1
print(ans)
| false | 0 | [
"-M = 10**6 + 1",
"+M = max(A_list) + 1"
] | false | 0.186028 | 0.086548 | 2.149425 | [
"s174433096",
"s603600213"
] |
u989345508 | p02697 | python | s553673921 | s531185677 | 68 | 60 | 9,792 | 11,160 | Accepted | Accepted | 11.76 | n,m=map(int,input().split())
if n%2==1:
[print(i+1,n-i) for i in range(m)]
else:
[print(i+1,n-i) if i<m/2 else print(i+1,n-i-1) for i in range(m)]
| n,m=list(map(int,input().split()))
if n%2==1:
x=""
for i in range(m):
x+=f"{i+1} {n-i}\n"
print(x)
else:
x=""
for i in range(m):
x+=(f"{i+1} {n-i}\n" if i<m/2 else f"{i+1} {n-i-1}\n")
print(x) | 5 | 11 | 158 | 236 | n, m = map(int, input().split())
if n % 2 == 1:
[print(i + 1, n - i) for i in range(m)]
else:
[print(i + 1, n - i) if i < m / 2 else print(i + 1, n - i - 1) for i in range(m)]
| n, m = list(map(int, input().split()))
if n % 2 == 1:
x = ""
for i in range(m):
x += f"{i+1} {n-i}\n"
print(x)
else:
x = ""
for i in range(m):
x += f"{i+1} {n-i}\n" if i < m / 2 else f"{i+1} {n-i-1}\n"
print(x)
| false | 54.545455 | [
"-n, m = map(int, input().split())",
"+n, m = list(map(int, input().split()))",
"- [print(i + 1, n - i) for i in range(m)]",
"+ x = \"\"",
"+ for i in range(m):",
"+ x += f\"{i+1} {n-i}\\n\"",
"+ print(x)",
"- [print(i + 1, n - i) if i < m / 2 else print(i + 1, n - i - 1) for i in range(m)]",
"+ x = \"\"",
"+ for i in range(m):",
"+ x += f\"{i+1} {n-i}\\n\" if i < m / 2 else f\"{i+1} {n-i-1}\\n\"",
"+ print(x)"
] | false | 0.038022 | 0.037443 | 1.015451 | [
"s553673921",
"s531185677"
] |
u622011073 | p03834 | python | s116678172 | s511596739 | 23 | 17 | 3,064 | 2,940 | Accepted | Accepted | 26.09 | print((input().replace(',',' '))) | print((*input().split(','))) | 1 | 1 | 31 | 26 | print((input().replace(",", " ")))
| print((*input().split(",")))
| false | 0 | [
"-print((input().replace(\",\", \" \")))",
"+print((*input().split(\",\")))"
] | false | 0.037335 | 0.034682 | 1.076494 | [
"s116678172",
"s511596739"
] |
u391731808 | p03576 | python | s210681351 | s158690467 | 86 | 60 | 3,064 | 3,064 | Accepted | Accepted | 30.23 | N,K = list(map(int,input().split()))
XY = [list(map(int,input().split())) for _ in [0]*N]
iX = sorted(x for x,y in XY)
iY = sorted(y for x,y in XY)
X = {x:i for i,x in enumerate(iX)}
Y = {y:i for i,y in enumerate(iY)}
c = [[0]*(N+1) for i in [0]*(N+1)]
for x,y in XY:
c[Y[y]+1][X[x]+1] = 1
for i in range(N):
ci1 = c[i+1]
for j in range(N):
ci1[j+1] += ci1[j]
for i in range(N):
ci1 = c[i+1]
ci = c[i]
for j in range(N):
ci1[j+1] += ci[j+1]
ans = 10**20
for u in range(N):
for d in range(u+K-1,N):
l = 0
r = 1
dY = iY[d]-iY[u]
cd = c[d+1]
cu = c[u]
while r<N:
if cd[r+1]+cu[l]-cu[r+1]-cd[l] >=K:
ans = min(ans, (iX[r] - iX[l])*dY)
l+=1
else:r+=1
print(ans) | def main():
N,K = list(map(int,input().split()))
XY = [list(map(int,input().split())) for _ in [0]*N]
iX = sorted(x for x,y in XY)
iY = sorted(y for x,y in XY)
X = {x:i for i,x in enumerate(iX)}
Y = {y:i for i,y in enumerate(iY)}
c = [[0]*(N+1) for i in [0]*(N+1)]
for x,y in XY:
c[Y[y]+1][X[x]+1] = 1
for i in range(N):
ci1 = c[i+1]
for j in range(N):
ci1[j+1] += ci1[j]
for i in range(N):
ci1 = c[i+1]
ci = c[i]
for j in range(N):
ci1[j+1] += ci[j+1]
ans = 10**20
for u in range(N):
for d in range(u+K-1,N):
l = 0
r = 1
dY = iY[d]-iY[u]
cd = c[d+1]
cu = c[u]
while r<N:
if cd[r+1]+cu[l]-cu[r+1]-cd[l] >=K:
ans = min(ans, (iX[r] - iX[l])*dY)
l+=1
else:r+=1
print(ans)
main() | 37 | 39 | 839 | 992 | N, K = list(map(int, input().split()))
XY = [list(map(int, input().split())) for _ in [0] * N]
iX = sorted(x for x, y in XY)
iY = sorted(y for x, y in XY)
X = {x: i for i, x in enumerate(iX)}
Y = {y: i for i, y in enumerate(iY)}
c = [[0] * (N + 1) for i in [0] * (N + 1)]
for x, y in XY:
c[Y[y] + 1][X[x] + 1] = 1
for i in range(N):
ci1 = c[i + 1]
for j in range(N):
ci1[j + 1] += ci1[j]
for i in range(N):
ci1 = c[i + 1]
ci = c[i]
for j in range(N):
ci1[j + 1] += ci[j + 1]
ans = 10**20
for u in range(N):
for d in range(u + K - 1, N):
l = 0
r = 1
dY = iY[d] - iY[u]
cd = c[d + 1]
cu = c[u]
while r < N:
if cd[r + 1] + cu[l] - cu[r + 1] - cd[l] >= K:
ans = min(ans, (iX[r] - iX[l]) * dY)
l += 1
else:
r += 1
print(ans)
| def main():
N, K = list(map(int, input().split()))
XY = [list(map(int, input().split())) for _ in [0] * N]
iX = sorted(x for x, y in XY)
iY = sorted(y for x, y in XY)
X = {x: i for i, x in enumerate(iX)}
Y = {y: i for i, y in enumerate(iY)}
c = [[0] * (N + 1) for i in [0] * (N + 1)]
for x, y in XY:
c[Y[y] + 1][X[x] + 1] = 1
for i in range(N):
ci1 = c[i + 1]
for j in range(N):
ci1[j + 1] += ci1[j]
for i in range(N):
ci1 = c[i + 1]
ci = c[i]
for j in range(N):
ci1[j + 1] += ci[j + 1]
ans = 10**20
for u in range(N):
for d in range(u + K - 1, N):
l = 0
r = 1
dY = iY[d] - iY[u]
cd = c[d + 1]
cu = c[u]
while r < N:
if cd[r + 1] + cu[l] - cu[r + 1] - cd[l] >= K:
ans = min(ans, (iX[r] - iX[l]) * dY)
l += 1
else:
r += 1
print(ans)
main()
| false | 5.128205 | [
"-N, K = list(map(int, input().split()))",
"-XY = [list(map(int, input().split())) for _ in [0] * N]",
"-iX = sorted(x for x, y in XY)",
"-iY = sorted(y for x, y in XY)",
"-X = {x: i for i, x in enumerate(iX)}",
"-Y = {y: i for i, y in enumerate(iY)}",
"-c = [[0] * (N + 1) for i in [0] * (N + 1)]",
"-for x, y in XY:",
"- c[Y[y] + 1][X[x] + 1] = 1",
"-for i in range(N):",
"- ci1 = c[i + 1]",
"- for j in range(N):",
"- ci1[j + 1] += ci1[j]",
"-for i in range(N):",
"- ci1 = c[i + 1]",
"- ci = c[i]",
"- for j in range(N):",
"- ci1[j + 1] += ci[j + 1]",
"-ans = 10**20",
"-for u in range(N):",
"- for d in range(u + K - 1, N):",
"- l = 0",
"- r = 1",
"- dY = iY[d] - iY[u]",
"- cd = c[d + 1]",
"- cu = c[u]",
"- while r < N:",
"- if cd[r + 1] + cu[l] - cu[r + 1] - cd[l] >= K:",
"- ans = min(ans, (iX[r] - iX[l]) * dY)",
"- l += 1",
"- else:",
"- r += 1",
"-print(ans)",
"+def main():",
"+ N, K = list(map(int, input().split()))",
"+ XY = [list(map(int, input().split())) for _ in [0] * N]",
"+ iX = sorted(x for x, y in XY)",
"+ iY = sorted(y for x, y in XY)",
"+ X = {x: i for i, x in enumerate(iX)}",
"+ Y = {y: i for i, y in enumerate(iY)}",
"+ c = [[0] * (N + 1) for i in [0] * (N + 1)]",
"+ for x, y in XY:",
"+ c[Y[y] + 1][X[x] + 1] = 1",
"+ for i in range(N):",
"+ ci1 = c[i + 1]",
"+ for j in range(N):",
"+ ci1[j + 1] += ci1[j]",
"+ for i in range(N):",
"+ ci1 = c[i + 1]",
"+ ci = c[i]",
"+ for j in range(N):",
"+ ci1[j + 1] += ci[j + 1]",
"+ ans = 10**20",
"+ for u in range(N):",
"+ for d in range(u + K - 1, N):",
"+ l = 0",
"+ r = 1",
"+ dY = iY[d] - iY[u]",
"+ cd = c[d + 1]",
"+ cu = c[u]",
"+ while r < N:",
"+ if cd[r + 1] + cu[l] - cu[r + 1] - cd[l] >= K:",
"+ ans = min(ans, (iX[r] - iX[l]) * dY)",
"+ l += 1",
"+ else:",
"+ r += 1",
"+ print(ans)",
"+",
"+",
"+main()"
] | false | 0.048595 | 0.09021 | 0.538689 | [
"s210681351",
"s158690467"
] |
u670180528 | p02851 | python | s564404394 | s161053295 | 432 | 269 | 36,804 | 35,744 | Accepted | Accepted | 37.73 | from itertools import accumulate
from collections import Counter
n, k, *a = list(map(int, open(0).read().split()))
a = [x % k - 1 for x in a]
a = [0] + [x % k for x in accumulate(a)]
d = Counter()
ans = 0
for l, r in zip([k] * min(k, n + 1) + a, a):
d[l] -= 1
ans += d[r]
d[r] += 1
print(ans)
| n,k,*a=list(map(int, open(0).read().split()))
b=[0]*-~n
for i in range(n):b[i+1]=(a[i]+b[i]-1)%k
d={k:0}
a=0
for l,r in zip([k]*min(k,n+1)+b,b):d[l]-=1;t=d.get(r,0);a+=t;d[r]=t+1
print(a) | 12 | 7 | 301 | 187 | from itertools import accumulate
from collections import Counter
n, k, *a = list(map(int, open(0).read().split()))
a = [x % k - 1 for x in a]
a = [0] + [x % k for x in accumulate(a)]
d = Counter()
ans = 0
for l, r in zip([k] * min(k, n + 1) + a, a):
d[l] -= 1
ans += d[r]
d[r] += 1
print(ans)
| n, k, *a = list(map(int, open(0).read().split()))
b = [0] * -~n
for i in range(n):
b[i + 1] = (a[i] + b[i] - 1) % k
d = {k: 0}
a = 0
for l, r in zip([k] * min(k, n + 1) + b, b):
d[l] -= 1
t = d.get(r, 0)
a += t
d[r] = t + 1
print(a)
| false | 41.666667 | [
"-from itertools import accumulate",
"-from collections import Counter",
"-",
"-a = [x % k - 1 for x in a]",
"-a = [0] + [x % k for x in accumulate(a)]",
"-d = Counter()",
"-ans = 0",
"-for l, r in zip([k] * min(k, n + 1) + a, a):",
"+b = [0] * -~n",
"+for i in range(n):",
"+ b[i + 1] = (a[i] + b[i] - 1) % k",
"+d = {k: 0}",
"+a = 0",
"+for l, r in zip([k] * min(k, n + 1) + b, b):",
"- ans += d[r]",
"- d[r] += 1",
"-print(ans)",
"+ t = d.get(r, 0)",
"+ a += t",
"+ d[r] = t + 1",
"+print(a)"
] | false | 0.042557 | 0.034987 | 1.216354 | [
"s564404394",
"s161053295"
] |
u922449550 | p02990 | python | s955896312 | s506175371 | 1,326 | 945 | 122,148 | 3,444 | Accepted | Accepted | 28.73 | mod = 10**9 + 7
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range(2, 10 ** 6 + 1):
g1.append((g1[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod // i)) % mod)
g2.append((g2[-1] * inverse[-1]) % mod)
def comb(n, r, mod=mod):
if r < 0 or r > n:
return 0
r = min(r, n - r)
return g1[n] * g2[r] * g2[n-r] % mod
N, K = list(map(int, input().split()))
R = N - K
ans = [0]*K
if R == 0:
ans[0] = 1
elif R == 1:
ans[0] = 2
if K >= 2:
ans[1] = (K-1) % mod
elif R == 2:
ans[0] = 3
if K >= 2:
ans[1] = (3*K - 3) % mod
if K >= 3:
ans[2] = (K-1)*(K-2)//2 % mod
else:
ans[0] = R + 1
if K >= 2:
if R > K:
for i in range(2, K+1):
ans[i-1] = comb(K-1, i-1)*(comb(R-1, i-2)+2*comb(R-1, i-1)+comb(R-1, i)) % mod
else:
for i in range(2, R):
ans[i-1] = comb(K-1, i-1)*(comb(R-1, i-2)+2*comb(R-1, i-1)+comb(R-1, i)) % mod
for i in range(R, K+1):
ans[i-1] = comb(K-1, i-1)*(comb(R-1, i-2)+2*comb(R-1, i-1)) % mod
for a in ans:
print(a) | def framod(n, mod=10**9+7, a=1):
for i in range(1,n+1):
a=a * i % mod
return a
def power(n, r, mod=10**9+7):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mod) % mod
if r%2 == 1:
return n * power(n, r-1, mod) % mod
def comb(n, k, mod=10**9+7):
a=framod(n, mod)
b=framod(k, mod)
c=framod(n-k, mod)
return (a * power(b, mod-2, mod) * power(c, mod-2, mod)) % mod
N, K = list(map(int, input().split()))
R = N - K
mod = 10**9 + 7
ans = [0]*K
if R == 0:
ans[0] = 1
elif R == 1:
ans[0] = 2
if K >= 2:
ans[1] = (K-1) % mod
elif R == 2:
ans[0] = 3
if K >= 2:
ans[1] = (3*K - 3) % mod
if K >= 3:
ans[2] = (K-1)*(K-2)//2 % mod
else:
ans[0] = R + 1
if K >= 2:
if R > K:
for i in range(2, K+1):
ans[i-1] = comb(K-1, i-1)*(comb(R-1, i-2)+2*comb(R-1, i-1)+comb(R-1, i)) % mod
else:
for i in range(2, R):
ans[i-1] = comb(K-1, i-1)*(comb(R-1, i-2)+2*comb(R-1, i-1)+comb(R-1, i)) % mod
ans[R-1] = comb(K-1, R-1)*(comb(R-1, R-2)+2*comb(R-1, R-1)) % mod
if R <= K-1:
ans[R] = comb(K-1, R)*comb(R-1, R-1) % mod
for a in ans:
print(a) | 47 | 54 | 1,091 | 1,241 | mod = 10**9 + 7
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range(2, 10**6 + 1):
g1.append((g1[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod // i)) % mod)
g2.append((g2[-1] * inverse[-1]) % mod)
def comb(n, r, mod=mod):
if r < 0 or r > n:
return 0
r = min(r, n - r)
return g1[n] * g2[r] * g2[n - r] % mod
N, K = list(map(int, input().split()))
R = N - K
ans = [0] * K
if R == 0:
ans[0] = 1
elif R == 1:
ans[0] = 2
if K >= 2:
ans[1] = (K - 1) % mod
elif R == 2:
ans[0] = 3
if K >= 2:
ans[1] = (3 * K - 3) % mod
if K >= 3:
ans[2] = (K - 1) * (K - 2) // 2 % mod
else:
ans[0] = R + 1
if K >= 2:
if R > K:
for i in range(2, K + 1):
ans[i - 1] = (
comb(K - 1, i - 1)
* (comb(R - 1, i - 2) + 2 * comb(R - 1, i - 1) + comb(R - 1, i))
% mod
)
else:
for i in range(2, R):
ans[i - 1] = (
comb(K - 1, i - 1)
* (comb(R - 1, i - 2) + 2 * comb(R - 1, i - 1) + comb(R - 1, i))
% mod
)
for i in range(R, K + 1):
ans[i - 1] = (
comb(K - 1, i - 1)
* (comb(R - 1, i - 2) + 2 * comb(R - 1, i - 1))
% mod
)
for a in ans:
print(a)
| def framod(n, mod=10**9 + 7, a=1):
for i in range(1, n + 1):
a = a * i % mod
return a
def power(n, r, mod=10**9 + 7):
if r == 0:
return 1
if r % 2 == 0:
return power(n * n % mod, r // 2, mod) % mod
if r % 2 == 1:
return n * power(n, r - 1, mod) % mod
def comb(n, k, mod=10**9 + 7):
a = framod(n, mod)
b = framod(k, mod)
c = framod(n - k, mod)
return (a * power(b, mod - 2, mod) * power(c, mod - 2, mod)) % mod
N, K = list(map(int, input().split()))
R = N - K
mod = 10**9 + 7
ans = [0] * K
if R == 0:
ans[0] = 1
elif R == 1:
ans[0] = 2
if K >= 2:
ans[1] = (K - 1) % mod
elif R == 2:
ans[0] = 3
if K >= 2:
ans[1] = (3 * K - 3) % mod
if K >= 3:
ans[2] = (K - 1) * (K - 2) // 2 % mod
else:
ans[0] = R + 1
if K >= 2:
if R > K:
for i in range(2, K + 1):
ans[i - 1] = (
comb(K - 1, i - 1)
* (comb(R - 1, i - 2) + 2 * comb(R - 1, i - 1) + comb(R - 1, i))
% mod
)
else:
for i in range(2, R):
ans[i - 1] = (
comb(K - 1, i - 1)
* (comb(R - 1, i - 2) + 2 * comb(R - 1, i - 1) + comb(R - 1, i))
% mod
)
ans[R - 1] = (
comb(K - 1, R - 1) * (comb(R - 1, R - 2) + 2 * comb(R - 1, R - 1)) % mod
)
if R <= K - 1:
ans[R] = comb(K - 1, R) * comb(R - 1, R - 1) % mod
for a in ans:
print(a)
| false | 12.962963 | [
"-mod = 10**9 + 7",
"-g1 = [1, 1]",
"-g2 = [1, 1]",
"-inverse = [0, 1]",
"-for i in range(2, 10**6 + 1):",
"- g1.append((g1[-1] * i) % mod)",
"- inverse.append((-inverse[mod % i] * (mod // i)) % mod)",
"- g2.append((g2[-1] * inverse[-1]) % mod)",
"+def framod(n, mod=10**9 + 7, a=1):",
"+ for i in range(1, n + 1):",
"+ a = a * i % mod",
"+ return a",
"-def comb(n, r, mod=mod):",
"- if r < 0 or r > n:",
"- return 0",
"- r = min(r, n - r)",
"- return g1[n] * g2[r] * g2[n - r] % mod",
"+def power(n, r, mod=10**9 + 7):",
"+ if r == 0:",
"+ return 1",
"+ if r % 2 == 0:",
"+ return power(n * n % mod, r // 2, mod) % mod",
"+ if r % 2 == 1:",
"+ return n * power(n, r - 1, mod) % mod",
"+",
"+",
"+def comb(n, k, mod=10**9 + 7):",
"+ a = framod(n, mod)",
"+ b = framod(k, mod)",
"+ c = framod(n - k, mod)",
"+ return (a * power(b, mod - 2, mod) * power(c, mod - 2, mod)) % mod",
"+mod = 10**9 + 7",
"- for i in range(R, K + 1):",
"- ans[i - 1] = (",
"- comb(K - 1, i - 1)",
"- * (comb(R - 1, i - 2) + 2 * comb(R - 1, i - 1))",
"- % mod",
"- )",
"+ ans[R - 1] = (",
"+ comb(K - 1, R - 1) * (comb(R - 1, R - 2) + 2 * comb(R - 1, R - 1)) % mod",
"+ )",
"+ if R <= K - 1:",
"+ ans[R] = comb(K - 1, R) * comb(R - 1, R - 1) % mod"
] | false | 1.658993 | 0.038574 | 43.007765 | [
"s955896312",
"s506175371"
] |
u790012205 | p03680 | python | s534506607 | s524095352 | 195 | 165 | 7,888 | 13,620 | Accepted | Accepted | 15.38 | import sys
N = int(eval(input()))
a = [int(eval(input())) for i in range(N)]
d = [0] * N
b = 0
c = 0
while True:
if b == 1:
print(c)
sys.exit()
c += 1
b = a[b] - 1
if d[b] == 1:
print('-1')
sys.exit()
d[b] = 1
| N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
s = [0] * N
c = 0
OK = False
n = 0
while True:
c += 1
n = a[n] - 1
if n == 1:
OK = True
break
if s[n] == 1:
break
s[n] = 1
if OK:
print(c)
else:
print((-1)) | 16 | 19 | 265 | 278 | import sys
N = int(eval(input()))
a = [int(eval(input())) for i in range(N)]
d = [0] * N
b = 0
c = 0
while True:
if b == 1:
print(c)
sys.exit()
c += 1
b = a[b] - 1
if d[b] == 1:
print("-1")
sys.exit()
d[b] = 1
| N = int(eval(input()))
a = [int(eval(input())) for _ in range(N)]
s = [0] * N
c = 0
OK = False
n = 0
while True:
c += 1
n = a[n] - 1
if n == 1:
OK = True
break
if s[n] == 1:
break
s[n] = 1
if OK:
print(c)
else:
print((-1))
| false | 15.789474 | [
"-import sys",
"-",
"-a = [int(eval(input())) for i in range(N)]",
"-d = [0] * N",
"-b = 0",
"+a = [int(eval(input())) for _ in range(N)]",
"+s = [0] * N",
"+OK = False",
"+n = 0",
"- if b == 1:",
"- print(c)",
"- sys.exit()",
"- b = a[b] - 1",
"- if d[b] == 1:",
"- print(\"-1\")",
"- sys.exit()",
"- d[b] = 1",
"+ n = a[n] - 1",
"+ if n == 1:",
"+ OK = True",
"+ break",
"+ if s[n] == 1:",
"+ break",
"+ s[n] = 1",
"+if OK:",
"+ print(c)",
"+else:",
"+ print((-1))"
] | false | 0.056511 | 0.036203 | 1.560951 | [
"s534506607",
"s524095352"
] |
u138546245 | p02370 | python | s240763866 | s496127189 | 410 | 270 | 18,000 | 13,948 | Accepted | Accepted | 34.15 | #!/usr/bin/env python3
# GRL_4_B: Path/Cycle - Topological Sort
from collections import namedtuple
DirectedEdge = namedtuple('DirectedEdge', ('src', 'dest'))
def revert(edge):
return edge._replace(src=edge.dest, dest=edge.src)
class Digraph:
def __init__(self, v):
self.v = v
self._edges = [[] for _ in range(v)]
def add(self, edge):
self._edges[edge.src].append(edge)
def adj(self, v):
return self._edges[v]
def edges(self):
for es in self._edges:
for e in es:
yield e
def reversed(self):
g = self.__class__(self.v)
for e in self.edges():
g.add(revert(e))
return g
def sorted_topological(graph):
return reversed(list(reverse_post(graph.reversed())))
def reverse_post(graph):
def visit(v):
if not visited[v]:
visited[v] = True
return True
else:
return False
def leave(v):
if not left[v]:
left[v] = True
vs.append(v)
return False
visited = [False] * graph.v
left = [False] * graph.v
vs = []
for i in range(graph.v):
if not visited[i]:
stack = [(i, leave)]
stack.extend((e.dest, visit) for e in graph.adj(i))
while stack:
v, f = stack.pop()
if f(v):
stack.append((v, leave))
for e in graph.adj(v):
stack.append((e.dest, visit))
return reversed(vs)
def run():
v, e = [int(i) for i in input().split()]
g = Digraph(v)
for _ in range(e):
s, t = [int(i) for i in input().split()]
g.add(DirectedEdge(s, t))
for v in sorted_topological(g):
print(v)
if __name__ == '__main__':
run()
| #!/usr/bin/env python3
# GRL_4_B: Path/Cycle - Topological Sort
from collections import namedtuple
DirectedEdge = namedtuple('DirectedEdge', ('src', 'dest'))
def revert(edge):
return edge._replace(src=edge.dest, dest=edge.src)
class Digraph:
def __init__(self, v):
self.v = v
self._edges = [[] for _ in range(v)]
def add(self, edge):
self._edges[edge.src].append(edge)
def adj(self, v):
return self._edges[v]
def edges(self):
for es in self._edges:
for e in es:
yield e
def reversed(self):
g = self.__class__(self.v)
for e in self.edges():
g.add(revert(e))
return g
def sorted_topological(graph):
return reverse_post(graph)
def reverse_post(graph):
def visit(v):
if not visited[v]:
visited[v] = True
return True
else:
return False
def leave(v):
if not left[v]:
left[v] = True
vs.append(v)
return False
visited = [False] * graph.v
left = [False] * graph.v
vs = []
for i in range(graph.v):
if not visited[i]:
stack = [(i, leave)]
stack.extend((e.dest, visit) for e in graph.adj(i))
while stack:
v, f = stack.pop()
if f(v):
stack.append((v, leave))
for e in graph.adj(v):
stack.append((e.dest, visit))
return reversed(vs)
def run():
v, e = [int(i) for i in input().split()]
g = Digraph(v)
for _ in range(e):
s, t = [int(i) for i in input().split()]
g.add(DirectedEdge(s, t))
for v in sorted_topological(g):
print(v)
if __name__ == '__main__':
run()
| 87 | 87 | 1,921 | 1,894 | #!/usr/bin/env python3
# GRL_4_B: Path/Cycle - Topological Sort
from collections import namedtuple
DirectedEdge = namedtuple("DirectedEdge", ("src", "dest"))
def revert(edge):
return edge._replace(src=edge.dest, dest=edge.src)
class Digraph:
def __init__(self, v):
self.v = v
self._edges = [[] for _ in range(v)]
def add(self, edge):
self._edges[edge.src].append(edge)
def adj(self, v):
return self._edges[v]
def edges(self):
for es in self._edges:
for e in es:
yield e
def reversed(self):
g = self.__class__(self.v)
for e in self.edges():
g.add(revert(e))
return g
def sorted_topological(graph):
return reversed(list(reverse_post(graph.reversed())))
def reverse_post(graph):
def visit(v):
if not visited[v]:
visited[v] = True
return True
else:
return False
def leave(v):
if not left[v]:
left[v] = True
vs.append(v)
return False
visited = [False] * graph.v
left = [False] * graph.v
vs = []
for i in range(graph.v):
if not visited[i]:
stack = [(i, leave)]
stack.extend((e.dest, visit) for e in graph.adj(i))
while stack:
v, f = stack.pop()
if f(v):
stack.append((v, leave))
for e in graph.adj(v):
stack.append((e.dest, visit))
return reversed(vs)
def run():
v, e = [int(i) for i in input().split()]
g = Digraph(v)
for _ in range(e):
s, t = [int(i) for i in input().split()]
g.add(DirectedEdge(s, t))
for v in sorted_topological(g):
print(v)
if __name__ == "__main__":
run()
| #!/usr/bin/env python3
# GRL_4_B: Path/Cycle - Topological Sort
from collections import namedtuple
DirectedEdge = namedtuple("DirectedEdge", ("src", "dest"))
def revert(edge):
return edge._replace(src=edge.dest, dest=edge.src)
class Digraph:
def __init__(self, v):
self.v = v
self._edges = [[] for _ in range(v)]
def add(self, edge):
self._edges[edge.src].append(edge)
def adj(self, v):
return self._edges[v]
def edges(self):
for es in self._edges:
for e in es:
yield e
def reversed(self):
g = self.__class__(self.v)
for e in self.edges():
g.add(revert(e))
return g
def sorted_topological(graph):
return reverse_post(graph)
def reverse_post(graph):
def visit(v):
if not visited[v]:
visited[v] = True
return True
else:
return False
def leave(v):
if not left[v]:
left[v] = True
vs.append(v)
return False
visited = [False] * graph.v
left = [False] * graph.v
vs = []
for i in range(graph.v):
if not visited[i]:
stack = [(i, leave)]
stack.extend((e.dest, visit) for e in graph.adj(i))
while stack:
v, f = stack.pop()
if f(v):
stack.append((v, leave))
for e in graph.adj(v):
stack.append((e.dest, visit))
return reversed(vs)
def run():
v, e = [int(i) for i in input().split()]
g = Digraph(v)
for _ in range(e):
s, t = [int(i) for i in input().split()]
g.add(DirectedEdge(s, t))
for v in sorted_topological(g):
print(v)
if __name__ == "__main__":
run()
| false | 0 | [
"- return reversed(list(reverse_post(graph.reversed())))",
"+ return reverse_post(graph)"
] | false | 0.073857 | 0.050208 | 1.471027 | [
"s240763866",
"s496127189"
] |
u506705885 | p02400 | python | s682367044 | s719458036 | 60 | 20 | 7,576 | 5,632 | Accepted | Accepted | 66.67 | import math
r=float(eval(input()))
print(("{0:.6f}".format(r*r*math.pi),"{0:.6f}".format(2*r*math.pi))) | import math
r=float(eval(input()))
print(("{0:.10f}".format(r*r*math.pi),"{0:.10f}".format(r*2*math.pi))) | 3 | 3 | 97 | 99 | import math
r = float(eval(input()))
print(("{0:.6f}".format(r * r * math.pi), "{0:.6f}".format(2 * r * math.pi)))
| import math
r = float(eval(input()))
print(("{0:.10f}".format(r * r * math.pi), "{0:.10f}".format(r * 2 * math.pi)))
| false | 0 | [
"-print((\"{0:.6f}\".format(r * r * math.pi), \"{0:.6f}\".format(2 * r * math.pi)))",
"+print((\"{0:.10f}\".format(r * r * math.pi), \"{0:.10f}\".format(r * 2 * math.pi)))"
] | false | 0.103189 | 0.041143 | 2.508043 | [
"s682367044",
"s719458036"
] |
u496821919 | p02844 | python | s242696803 | s791558882 | 691 | 77 | 3,064 | 3,060 | Accepted | Accepted | 88.86 | n = int(eval(input()))
s = eval(input())
number = [n for n in range(10)]
ans = 0
for i in number:
try:
j = s.index(str(i))
for k in number:
try:
l = s[j+1:].index(str(k))
exist = [0]*10
for m in s[l+j+2:]:
exist[int(m)] = 1
#print(exist)
ans += sum(exist)
except:
continue
except:
continue
print(ans) | n = int(eval(input()))
s = eval(input())
number = [n for n in range(10)]
ans = 0
for i in number:
try:
j = s.index(str(i))
for k in number:
try:
l = s[j+1:].index(str(k))
ans += len(set(s[l+j+2:]))
except:
continue
except:
continue
print(ans) | 20 | 16 | 479 | 349 | n = int(eval(input()))
s = eval(input())
number = [n for n in range(10)]
ans = 0
for i in number:
try:
j = s.index(str(i))
for k in number:
try:
l = s[j + 1 :].index(str(k))
exist = [0] * 10
for m in s[l + j + 2 :]:
exist[int(m)] = 1
# print(exist)
ans += sum(exist)
except:
continue
except:
continue
print(ans)
| n = int(eval(input()))
s = eval(input())
number = [n for n in range(10)]
ans = 0
for i in number:
try:
j = s.index(str(i))
for k in number:
try:
l = s[j + 1 :].index(str(k))
ans += len(set(s[l + j + 2 :]))
except:
continue
except:
continue
print(ans)
| false | 20 | [
"- exist = [0] * 10",
"- for m in s[l + j + 2 :]:",
"- exist[int(m)] = 1",
"- # print(exist)",
"- ans += sum(exist)",
"+ ans += len(set(s[l + j + 2 :]))"
] | false | 0.09539 | 0.037947 | 2.513781 | [
"s242696803",
"s791558882"
] |
u973840923 | p03244 | python | s193121692 | s463495966 | 102 | 77 | 20,636 | 15,972 | Accepted | Accepted | 24.51 | n = int(eval(input()))
list = [int(i) for i in input().split()]
list_odd = list[::2]
list_even = list[1::2]
def cnt_element(x):
dict = {}
for i in x:
if i not in dict:
dict[i] = 1
else:
dict[i] += 1
return [(v,k) for k,v in list(dict.items())]
cnt_odd = sorted(cnt_element(list_odd),reverse=True)
cnt_even = sorted(cnt_element(list_even),reverse=True)
#最頻値が同じの場合
if cnt_odd[0][1] == cnt_even[0][1]:
#リスト内の値が１つの場合
if len(cnt_odd) ==1 or len(cnt_even) == 1:
ans = int(n / 2)
#リストが２つ以上の場合
else:
#第２最頻値の出現数が奇数の方が多い
if cnt_odd[1][0] > cnt_even[1][0]:
ans = n - cnt_odd[1][0] - cnt_even[0][0]
#第二２最頻値の出現数が偶数の方が多い
elif cnt_odd[1][0] <= cnt_even[1][0]:
ans = n - cnt_odd[0][0] - cnt_even[1][0]
#最頻値が異なる場合
else:
ans = n - cnt_odd[0][0] - cnt_even[0][0]
print(ans) | from collections import Counter
n = int(eval(input()))
list = list(map(int,input().split()))
list_o = list[::2]
list_e = list[1::2]
cnt_o = Counter(list_o).most_common(2)
cnt_e = Counter(list_e).most_common(2)
#最頻値が同じ
if cnt_o[0][0] == cnt_e[0][0]:
#値が1つ
if len(cnt_o) == 1 and len(cnt_e) ==1:
print((int(len(list) / 2)))
elif len(cnt_o) == 1 and len(cnt_e) != 1:
print((len(list) - cnt_o[0][1] - cnt_e[1][1]))
elif len(cnt_o) != 1 and len(cnt_e) == 1:
print((len(list) - cnt_o[0][1] - cnt_e[1][1]))
else:
print((min(len(list) - cnt_o[1][1] - cnt_e[0][1], len(list) - cnt_o[0][1] - cnt_e[1][1])))
#最頻値が異なる
elif cnt_o[0][0] != cnt_e[0][0]:
if len(cnt_o) == 1 and len(cnt_e) ==1:
print((0))
else:
print((len(list) - cnt_o[0][1] - cnt_e[0][1]))
| 36 | 28 | 919 | 831 | n = int(eval(input()))
list = [int(i) for i in input().split()]
list_odd = list[::2]
list_even = list[1::2]
def cnt_element(x):
dict = {}
for i in x:
if i not in dict:
dict[i] = 1
else:
dict[i] += 1
return [(v, k) for k, v in list(dict.items())]
cnt_odd = sorted(cnt_element(list_odd), reverse=True)
cnt_even = sorted(cnt_element(list_even), reverse=True)
# 最頻値が同じの場合
if cnt_odd[0][1] == cnt_even[0][1]:
# リスト内の値が１つの場合
if len(cnt_odd) == 1 or len(cnt_even) == 1:
ans = int(n / 2)
# リストが２つ以上の場合
else:
# 第２最頻値の出現数が奇数の方が多い
if cnt_odd[1][0] > cnt_even[1][0]:
ans = n - cnt_odd[1][0] - cnt_even[0][0]
# 第二２最頻値の出現数が偶数の方が多い
elif cnt_odd[1][0] <= cnt_even[1][0]:
ans = n - cnt_odd[0][0] - cnt_even[1][0]
# 最頻値が異なる場合
else:
ans = n - cnt_odd[0][0] - cnt_even[0][0]
print(ans)
| from collections import Counter
n = int(eval(input()))
list = list(map(int, input().split()))
list_o = list[::2]
list_e = list[1::2]
cnt_o = Counter(list_o).most_common(2)
cnt_e = Counter(list_e).most_common(2)
# 最頻値が同じ
if cnt_o[0][0] == cnt_e[0][0]:
# 値が1つ
if len(cnt_o) == 1 and len(cnt_e) == 1:
print((int(len(list) / 2)))
elif len(cnt_o) == 1 and len(cnt_e) != 1:
print((len(list) - cnt_o[0][1] - cnt_e[1][1]))
elif len(cnt_o) != 1 and len(cnt_e) == 1:
print((len(list) - cnt_o[0][1] - cnt_e[1][1]))
else:
print(
(
min(
len(list) - cnt_o[1][1] - cnt_e[0][1],
len(list) - cnt_o[0][1] - cnt_e[1][1],
)
)
)
# 最頻値が異なる
elif cnt_o[0][0] != cnt_e[0][0]:
if len(cnt_o) == 1 and len(cnt_e) == 1:
print((0))
else:
print((len(list) - cnt_o[0][1] - cnt_e[0][1]))
| false | 22.222222 | [
"+from collections import Counter",
"+",
"-list = [int(i) for i in input().split()]",
"-list_odd = list[::2]",
"-list_even = list[1::2]",
"-",
"-",
"-def cnt_element(x):",
"- dict = {}",
"- for i in x:",
"- if i not in dict:",
"- dict[i] = 1",
"- else:",
"- dict[i] += 1",
"- return [(v, k) for k, v in list(dict.items())]",
"-",
"-",
"-cnt_odd = sorted(cnt_element(list_odd), reverse=True)",
"-cnt_even = sorted(cnt_element(list_even), reverse=True)",
"-# 最頻値が同じの場合",
"-if cnt_odd[0][1] == cnt_even[0][1]:",
"- # リスト内の値が１つの場合",
"- if len(cnt_odd) == 1 or len(cnt_even) == 1:",
"- ans = int(n / 2)",
"- # リストが２つ以上の場合",
"+list = list(map(int, input().split()))",
"+list_o = list[::2]",
"+list_e = list[1::2]",
"+cnt_o = Counter(list_o).most_common(2)",
"+cnt_e = Counter(list_e).most_common(2)",
"+# 最頻値が同じ",
"+if cnt_o[0][0] == cnt_e[0][0]:",
"+ # 値が1つ",
"+ if len(cnt_o) == 1 and len(cnt_e) == 1:",
"+ print((int(len(list) / 2)))",
"+ elif len(cnt_o) == 1 and len(cnt_e) != 1:",
"+ print((len(list) - cnt_o[0][1] - cnt_e[1][1]))",
"+ elif len(cnt_o) != 1 and len(cnt_e) == 1:",
"+ print((len(list) - cnt_o[0][1] - cnt_e[1][1]))",
"- # 第２最頻値の出現数が奇数の方が多い",
"- if cnt_odd[1][0] > cnt_even[1][0]:",
"- ans = n - cnt_odd[1][0] - cnt_even[0][0]",
"- # 第二２最頻値の出現数が偶数の方が多い",
"- elif cnt_odd[1][0] <= cnt_even[1][0]:",
"- ans = n - cnt_odd[0][0] - cnt_even[1][0]",
"-# 最頻値が異なる場合",
"-else:",
"- ans = n - cnt_odd[0][0] - cnt_even[0][0]",
"-print(ans)",
"+ print(",
"+ (",
"+ min(",
"+ len(list) - cnt_o[1][1] - cnt_e[0][1],",
"+ len(list) - cnt_o[0][1] - cnt_e[1][1],",
"+ )",
"+ )",
"+ )",
"+# 最頻値が異なる",
"+elif cnt_o[0][0] != cnt_e[0][0]:",
"+ if len(cnt_o) == 1 and len(cnt_e) == 1:",
"+ print((0))",
"+ else:",
"+ print((len(list) - cnt_o[0][1] - cnt_e[0][1]))"
] | false | 0.007468 | 0.074436 | 0.100329 | [
"s193121692",
"s463495966"
] |
u777283665 | p02819 | python | s598733877 | s168424102 | 30 | 17 | 2,940 | 3,060 | Accepted | Accepted | 43.33 | x = int(eval(input()))
while True:
if all(x % i != 0 for i in range(2, x)):
print(x)
exit()
else:
x+=1 | def is_prime(n):
for i in range(2, int(n**0.5)+1):
if n % i == 0:
return False
return True
x = int(eval(input()))
while True:
if is_prime(x):
print(x)
exit()
x+=1 | 7 | 12 | 134 | 220 | x = int(eval(input()))
while True:
if all(x % i != 0 for i in range(2, x)):
print(x)
exit()
else:
x += 1
| def is_prime(n):
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
return False
return True
x = int(eval(input()))
while True:
if is_prime(x):
print(x)
exit()
x += 1
| false | 41.666667 | [
"+def is_prime(n):",
"+ for i in range(2, int(n**0.5) + 1):",
"+ if n % i == 0:",
"+ return False",
"+ return True",
"+",
"+",
"- if all(x % i != 0 for i in range(2, x)):",
"+ if is_prime(x):",
"- else:",
"- x += 1",
"+ x += 1"
] | false | 0.082159 | 0.047496 | 1.729812 | [
"s598733877",
"s168424102"
] |
u518378780 | p03291 | python | s910682539 | s787504372 | 315 | 171 | 27,608 | 3,188 | Accepted | Accepted | 45.71 | s = eval(input())
dp = [[0 for _ in range(4)] for _ in range(len(s) + 1)]
dp[len(s)][3] = 1
n = 10 ** 9 + 7
for i in reversed(list(range((len(s))))):
m = 1
m1 = 1
m2 = 0
m3 = 0
m4 = 0
if s[i] == '?':
m = 3
m1 = 3
m2 = 1
m3 = 1
m4 = 1
if s[i] == 'C':
m2 = 1
if s[i] == 'B':
m3 = 1
if s[i] == 'A':
m4 = 1
dp[i][3] = (m * dp[i+1][3]) % n
dp[i][2] = (m1 * dp[i+1][2] + m2 * dp[i+1][3]) % n
dp[i][1] = (m1 * dp[i+1][1] + m3 * dp[i+1][2]) % n
dp[i][0] = (m1 * dp[i+1][0] + m4 * dp[i+1][1]) % n
ans = dp[0][0]
print(ans) | s = eval(input())
dp3 = 1
dp2 = 0
dp1 = 0
dp0 = 0
n = 10 ** 9 + 7
for i in reversed(list(range((len(s))))):
if s[i] == '?':
m = 3
else:
m = 1
if s[i] == '?':
m1 = 3
else:
m1 = 1
if s[i] == '?' or s[i] == 'C':
m2 = 1
else:
m2 = 0
if s[i] == '?' or s[i] == 'B':
m3 = 1
else:
m3 = 0
if s[i] == '?' or s[i] == 'A':
m4 = 1
else:
m4 = 0
t_dp3 = (m * dp3) % n
t_dp2 = (m1 * dp2 + m2 * dp3) % n
t_dp1 = (m1 * dp1 + m3 * dp2) % n
t_dp0 = (m1 * dp0 + m4 * dp1) % n
dp3 = t_dp3
dp2 = t_dp2
dp1 = t_dp1
dp0 = t_dp0
ans = dp0
print(ans) | 35 | 46 | 658 | 717 | s = eval(input())
dp = [[0 for _ in range(4)] for _ in range(len(s) + 1)]
dp[len(s)][3] = 1
n = 10**9 + 7
for i in reversed(list(range((len(s))))):
m = 1
m1 = 1
m2 = 0
m3 = 0
m4 = 0
if s[i] == "?":
m = 3
m1 = 3
m2 = 1
m3 = 1
m4 = 1
if s[i] == "C":
m2 = 1
if s[i] == "B":
m3 = 1
if s[i] == "A":
m4 = 1
dp[i][3] = (m * dp[i + 1][3]) % n
dp[i][2] = (m1 * dp[i + 1][2] + m2 * dp[i + 1][3]) % n
dp[i][1] = (m1 * dp[i + 1][1] + m3 * dp[i + 1][2]) % n
dp[i][0] = (m1 * dp[i + 1][0] + m4 * dp[i + 1][1]) % n
ans = dp[0][0]
print(ans)
| s = eval(input())
dp3 = 1
dp2 = 0
dp1 = 0
dp0 = 0
n = 10**9 + 7
for i in reversed(list(range((len(s))))):
if s[i] == "?":
m = 3
else:
m = 1
if s[i] == "?":
m1 = 3
else:
m1 = 1
if s[i] == "?" or s[i] == "C":
m2 = 1
else:
m2 = 0
if s[i] == "?" or s[i] == "B":
m3 = 1
else:
m3 = 0
if s[i] == "?" or s[i] == "A":
m4 = 1
else:
m4 = 0
t_dp3 = (m * dp3) % n
t_dp2 = (m1 * dp2 + m2 * dp3) % n
t_dp1 = (m1 * dp1 + m3 * dp2) % n
t_dp0 = (m1 * dp0 + m4 * dp1) % n
dp3 = t_dp3
dp2 = t_dp2
dp1 = t_dp1
dp0 = t_dp0
ans = dp0
print(ans)
| false | 23.913043 | [
"-dp = [[0 for _ in range(4)] for _ in range(len(s) + 1)]",
"-dp[len(s)][3] = 1",
"+dp3 = 1",
"+dp2 = 0",
"+dp1 = 0",
"+dp0 = 0",
"- m = 1",
"- m1 = 1",
"- m2 = 0",
"- m3 = 0",
"- m4 = 0",
"+ else:",
"+ m = 1",
"+ if s[i] == \"?\":",
"+ else:",
"+ m1 = 1",
"+ if s[i] == \"?\" or s[i] == \"C\":",
"+ else:",
"+ m2 = 0",
"+ if s[i] == \"?\" or s[i] == \"B\":",
"+ else:",
"+ m3 = 0",
"+ if s[i] == \"?\" or s[i] == \"A\":",
"- if s[i] == \"C\":",
"- m2 = 1",
"- if s[i] == \"B\":",
"- m3 = 1",
"- if s[i] == \"A\":",
"- m4 = 1",
"- dp[i][3] = (m * dp[i + 1][3]) % n",
"- dp[i][2] = (m1 * dp[i + 1][2] + m2 * dp[i + 1][3]) % n",
"- dp[i][1] = (m1 * dp[i + 1][1] + m3 * dp[i + 1][2]) % n",
"- dp[i][0] = (m1 * dp[i + 1][0] + m4 * dp[i + 1][1]) % n",
"-ans = dp[0][0]",
"+ else:",
"+ m4 = 0",
"+ t_dp3 = (m * dp3) % n",
"+ t_dp2 = (m1 * dp2 + m2 * dp3) % n",
"+ t_dp1 = (m1 * dp1 + m3 * dp2) % n",
"+ t_dp0 = (m1 * dp0 + m4 * dp1) % n",
"+ dp3 = t_dp3",
"+ dp2 = t_dp2",
"+ dp1 = t_dp1",
"+ dp0 = t_dp0",
"+ans = dp0"
] | false | 0.093521 | 0.056167 | 1.66505 | [
"s910682539",
"s787504372"
] |
u861962192 | p03074 | python | s768362193 | s904466581 | 212 | 92 | 54,776 | 9,236 | Accepted | Accepted | 56.6 | def f_d():
n, k = list(map(int, input().split()))
*s, = list(map(int, list(eval(input()))))
l, t, c = [], 1, 0
for i in range(n):
if s[i]==t:
c += 1
else:
l.append(c)
c, t = 1, t^1
if c!=0:
l.append(c)
if len(l)%2==0:
l.append(0)
r, a = 2*k+1, 0
li = ri = tmp = 0
for i in range(0, len(l), 2):
nli, nri = i, min(i+r, len(l))
while li<nli:
tmp -= l[li]
li += 1
while ri<nri:
tmp += l[ri]
ri += 1
a = max(a, tmp)
print(a)
if __name__ == "__main__":
f_d()
| def f_d():
n, k = list(map(int, input().split()))
*s, = list(map(int, list(eval(input()))))
l, t, c = [], 1, 0
for i in range(n):
if s[i]==t:
c += 1
else:
l.append(c)
c, t = 1, t^1
if c!=0:
l.append(c)
if len(l)%2==0:
l.append(0)
r, cs = 2*k, [l[0]]
for i in range(1, len(l)):
cs.append(cs[i-1]+l[i])
a = cs[0]
for i in range(0, len(l), 2):
tmp = cs[min(i+r, len(l)-1)]-cs[i]+l[i]
a = max(a, tmp)
print(a)
if __name__ == "__main__":
f_d() | 30 | 27 | 658 | 589 | def f_d():
n, k = list(map(int, input().split()))
(*s,) = list(map(int, list(eval(input()))))
l, t, c = [], 1, 0
for i in range(n):
if s[i] == t:
c += 1
else:
l.append(c)
c, t = 1, t ^ 1
if c != 0:
l.append(c)
if len(l) % 2 == 0:
l.append(0)
r, a = 2 * k + 1, 0
li = ri = tmp = 0
for i in range(0, len(l), 2):
nli, nri = i, min(i + r, len(l))
while li < nli:
tmp -= l[li]
li += 1
while ri < nri:
tmp += l[ri]
ri += 1
a = max(a, tmp)
print(a)
if __name__ == "__main__":
f_d()
| def f_d():
n, k = list(map(int, input().split()))
(*s,) = list(map(int, list(eval(input()))))
l, t, c = [], 1, 0
for i in range(n):
if s[i] == t:
c += 1
else:
l.append(c)
c, t = 1, t ^ 1
if c != 0:
l.append(c)
if len(l) % 2 == 0:
l.append(0)
r, cs = 2 * k, [l[0]]
for i in range(1, len(l)):
cs.append(cs[i - 1] + l[i])
a = cs[0]
for i in range(0, len(l), 2):
tmp = cs[min(i + r, len(l) - 1)] - cs[i] + l[i]
a = max(a, tmp)
print(a)
if __name__ == "__main__":
f_d()
| false | 10 | [
"- r, a = 2 * k + 1, 0",
"- li = ri = tmp = 0",
"+ r, cs = 2 * k, [l[0]]",
"+ for i in range(1, len(l)):",
"+ cs.append(cs[i - 1] + l[i])",
"+ a = cs[0]",
"- nli, nri = i, min(i + r, len(l))",
"- while li < nli:",
"- tmp -= l[li]",
"- li += 1",
"- while ri < nri:",
"- tmp += l[ri]",
"- ri += 1",
"+ tmp = cs[min(i + r, len(l) - 1)] - cs[i] + l[i]"
] | false | 0.079389 | 0.138844 | 0.571788 | [
"s768362193",
"s904466581"
] |
u579875569 | p03608 | python | s147190456 | s913118535 | 1,090 | 651 | 83,160 | 74,968 | Accepted | Accepted | 40.28 | import heapq
import itertools
def solve():
N, M, _ = list(map(int, input().split()))
R = list(map(int, input().split()))
R = [x-1 for x in R]
G = [[] for i in range(N)]
for i in range(M):
A, B, C = list(map(int, input().split()))
A -= 1
B -= 1
G[A].append((C, B))
G[B].append((C, A))
def dijkstra(d):
que = []
tar = -1
for i in range(len(d)):
if d[i] == -1:
break
if d[i] == 0:
tar = i
heapq.heappush(que, (d[i], i))
while len(que) != 0:
dist, node = heapq.heappop(que)
for (cost, to) in G[node]:
if d[to] > d[node] + cost:
d[to] = d[node] + cost
heapq.heappush(que, (dist + cost, to))
return d
ds = [[1e16 for i in range(N)] for j in range(N)]
for i in range(N):
ds[i][i] = 0
for i in range(N):
ds[i] = dijkstra(ds[i])
for j in range(N):
ds[j][i] = ds[i][j]
res = 1e16
for r in list(itertools.permutations(R)):
d = 0
for i in range(len(r)-1):
d += ds[r[i]][r[i+1]]
res = min(res, d)
return res
print((solve())) | import heapq
import itertools
def solve():
N, M, _ = list(map(int, input().split()))
R = list(map(int, input().split()))
R = [x-1 for x in R]
G = [[] for i in range(N)]
for i in range(M):
A, B, C = list(map(int, input().split()))
A -= 1
B -= 1
G[A].append((C, B))
G[B].append((C, A))
def dijkstra(d):
que = []
tar = -1
count = set()
for i in range(len(d)):
if d[i] == 1e+16:
break
if d[i] == 0:
tar = i
heapq.heappush(que, (d[i], i))
count.add(i)
checked = [False for i in range(N)]
while len(que) != 0:
dist, node = heapq.heappop(que)
if checked[node]:
continue
count.add(node)
if len(count) == N:
break
for (cost, to) in G[node]:
if d[to] > d[node] + cost:
d[to] = d[node] + cost
heapq.heappush(que, (dist + cost, to))
checked[node] = True
return d
ds = [[1e16 for i in range(N)] for j in range(N)]
for i in range(N):
ds[i][i] = 0
for i in range(N):
ds[i] = dijkstra(ds[i])
for j in range(N):
ds[j][i] = ds[i][j]
res = 1e16
for r in list(itertools.permutations(R)):
d = 0
for i in range(len(r)-1):
d += ds[r[i]][r[i+1]]
res = min(res, d)
return res
print((solve())) | 58 | 70 | 1,333 | 1,612 | import heapq
import itertools
def solve():
N, M, _ = list(map(int, input().split()))
R = list(map(int, input().split()))
R = [x - 1 for x in R]
G = [[] for i in range(N)]
for i in range(M):
A, B, C = list(map(int, input().split()))
A -= 1
B -= 1
G[A].append((C, B))
G[B].append((C, A))
def dijkstra(d):
que = []
tar = -1
for i in range(len(d)):
if d[i] == -1:
break
if d[i] == 0:
tar = i
heapq.heappush(que, (d[i], i))
while len(que) != 0:
dist, node = heapq.heappop(que)
for (cost, to) in G[node]:
if d[to] > d[node] + cost:
d[to] = d[node] + cost
heapq.heappush(que, (dist + cost, to))
return d
ds = [[1e16 for i in range(N)] for j in range(N)]
for i in range(N):
ds[i][i] = 0
for i in range(N):
ds[i] = dijkstra(ds[i])
for j in range(N):
ds[j][i] = ds[i][j]
res = 1e16
for r in list(itertools.permutations(R)):
d = 0
for i in range(len(r) - 1):
d += ds[r[i]][r[i + 1]]
res = min(res, d)
return res
print((solve()))
| import heapq
import itertools
def solve():
N, M, _ = list(map(int, input().split()))
R = list(map(int, input().split()))
R = [x - 1 for x in R]
G = [[] for i in range(N)]
for i in range(M):
A, B, C = list(map(int, input().split()))
A -= 1
B -= 1
G[A].append((C, B))
G[B].append((C, A))
def dijkstra(d):
que = []
tar = -1
count = set()
for i in range(len(d)):
if d[i] == 1e16:
break
if d[i] == 0:
tar = i
heapq.heappush(que, (d[i], i))
count.add(i)
checked = [False for i in range(N)]
while len(que) != 0:
dist, node = heapq.heappop(que)
if checked[node]:
continue
count.add(node)
if len(count) == N:
break
for (cost, to) in G[node]:
if d[to] > d[node] + cost:
d[to] = d[node] + cost
heapq.heappush(que, (dist + cost, to))
checked[node] = True
return d
ds = [[1e16 for i in range(N)] for j in range(N)]
for i in range(N):
ds[i][i] = 0
for i in range(N):
ds[i] = dijkstra(ds[i])
for j in range(N):
ds[j][i] = ds[i][j]
res = 1e16
for r in list(itertools.permutations(R)):
d = 0
for i in range(len(r) - 1):
d += ds[r[i]][r[i + 1]]
res = min(res, d)
return res
print((solve()))
| false | 17.142857 | [
"+ count = set()",
"- if d[i] == -1:",
"+ if d[i] == 1e16:",
"+ count.add(i)",
"+ checked = [False for i in range(N)]",
"+ if checked[node]:",
"+ continue",
"+ count.add(node)",
"+ if len(count) == N:",
"+ break",
"+ checked[node] = True"
] | false | 0.037732 | 0.037403 | 1.008798 | [
"s147190456",
"s913118535"
] |
u977389981 | p03031 | python | s533184641 | s950145023 | 216 | 198 | 41,584 | 41,456 | Accepted | Accepted | 8.33 | import itertools
N, M = list(map(int, input().split()))
S = []
for i in range(M):
s = list(map(int, input().split()))
S.append(s[1:])
P = [int(i) for i in input().split()]
A = [0, 1]
ans = 0
for i in itertools.product(A, repeat = N):
flag = 0
for j in range(M):
cnt = 0
for s in S[j]:
if i[s - 1] == 1:
cnt += 1
if cnt % 2 != P[j]:
flag = 1
if flag == 0:
ans += 1
print(ans) | import itertools
N, M = list(map(int, input().split()))
S = []
for i in range(M):
k, *s = list(map(int, input().split()))
S.append(s)
P = [int(i) for i in input().split()]
A = [0, 1]
ans = 0
for i in itertools.product(A, repeat = N):
flag = 0
for j in range(M):
cnt = 0
for s in S[j]:
if i[s - 1] == 1:
cnt += 1
if cnt % 2 != P[j]:
flag = 1
if flag == 0:
ans += 1
print(ans) | 26 | 26 | 502 | 499 | import itertools
N, M = list(map(int, input().split()))
S = []
for i in range(M):
s = list(map(int, input().split()))
S.append(s[1:])
P = [int(i) for i in input().split()]
A = [0, 1]
ans = 0
for i in itertools.product(A, repeat=N):
flag = 0
for j in range(M):
cnt = 0
for s in S[j]:
if i[s - 1] == 1:
cnt += 1
if cnt % 2 != P[j]:
flag = 1
if flag == 0:
ans += 1
print(ans)
| import itertools
N, M = list(map(int, input().split()))
S = []
for i in range(M):
k, *s = list(map(int, input().split()))
S.append(s)
P = [int(i) for i in input().split()]
A = [0, 1]
ans = 0
for i in itertools.product(A, repeat=N):
flag = 0
for j in range(M):
cnt = 0
for s in S[j]:
if i[s - 1] == 1:
cnt += 1
if cnt % 2 != P[j]:
flag = 1
if flag == 0:
ans += 1
print(ans)
| false | 0 | [
"- s = list(map(int, input().split()))",
"- S.append(s[1:])",
"+ k, *s = list(map(int, input().split()))",
"+ S.append(s)"
] | false | 0.036434 | 0.046542 | 0.782823 | [
"s533184641",
"s950145023"
] |
u597374218 | p03493 | python | s543265094 | s827119711 | 30 | 24 | 9,028 | 8,888 | Accepted | Accepted | 20 | s=eval(input())
print((s.count("1"))) | s=int(eval(input()))
print((s%9)) | 2 | 2 | 30 | 26 | s = eval(input())
print((s.count("1")))
| s = int(eval(input()))
print((s % 9))
| false | 0 | [
"-s = eval(input())",
"-print((s.count(\"1\")))",
"+s = int(eval(input()))",
"+print((s % 9))"
] | false | 0.118291 | 0.044113 | 2.68151 | [
"s543265094",
"s827119711"
] |
u935184340 | p00444 | python | s220529012 | s199245391 | 110 | 20 | 7,608 | 7,600 | Accepted | Accepted | 81.82 | import sys
coins = [1,5,10,50,100,500]
for i in sys.stdin:
if int(i) == 0:
break
n =1000-int(i)
c = [ i for i in range(n+1) ]
for i in range(len(coins)):
coin = coins[i]
if coin <= n:
c[coin] = 1
coins.append(coin)
for coin in coins:
for p in range(coin+1, n+1):
minc = c[p]
if minc == 1:
continue
c[p] = c[p-coin]+1 if minc > c[p-coin] + 1 else minc
print((c[n])) | import sys
coins = [500,100,50,10,5,1]
for i in sys.stdin:
if int(i) == 0:
break
n =1000-int(i)
cnt = 0
while n != 0:
for i in range(len(coins)):
if n >= coins[i]:
n = n-coins[i]
break
cnt += 1
print(cnt) | 24 | 19 | 522 | 315 | import sys
coins = [1, 5, 10, 50, 100, 500]
for i in sys.stdin:
if int(i) == 0:
break
n = 1000 - int(i)
c = [i for i in range(n + 1)]
for i in range(len(coins)):
coin = coins[i]
if coin <= n:
c[coin] = 1
coins.append(coin)
for coin in coins:
for p in range(coin + 1, n + 1):
minc = c[p]
if minc == 1:
continue
c[p] = c[p - coin] + 1 if minc > c[p - coin] + 1 else minc
print((c[n]))
| import sys
coins = [500, 100, 50, 10, 5, 1]
for i in sys.stdin:
if int(i) == 0:
break
n = 1000 - int(i)
cnt = 0
while n != 0:
for i in range(len(coins)):
if n >= coins[i]:
n = n - coins[i]
break
cnt += 1
print(cnt)
| false | 20.833333 | [
"-coins = [1, 5, 10, 50, 100, 500]",
"+coins = [500, 100, 50, 10, 5, 1]",
"- c = [i for i in range(n + 1)]",
"- for i in range(len(coins)):",
"- coin = coins[i]",
"- if coin <= n:",
"- c[coin] = 1",
"- coins.append(coin)",
"- for coin in coins:",
"- for p in range(coin + 1, n + 1):",
"- minc = c[p]",
"- if minc == 1:",
"- continue",
"- c[p] = c[p - coin] + 1 if minc > c[p - coin] + 1 else minc",
"- print((c[n]))",
"+ cnt = 0",
"+ while n != 0:",
"+ for i in range(len(coins)):",
"+ if n >= coins[i]:",
"+ n = n - coins[i]",
"+ break",
"+ cnt += 1",
"+ print(cnt)"
] | false | 0.062051 | 0.046421 | 1.336711 | [
"s220529012",
"s199245391"
] |
u790905630 | p03244 | python | s918208879 | s371569413 | 82 | 70 | 23,020 | 16,884 | Accepted | Accepted | 14.63 | from collections import *
N = int(eval(input()))
v_list = input().split()
if len(set(v_list)) == 1:
print((len(v_list) // 2))
exit()
v1_count_list = Counter(v_list[::2]).most_common()
v2_count_list = Counter(v_list[1::2]).most_common()
if v1_count_list[0][0] != v2_count_list[0][0]:
leave_value = v1_count_list[0][1] + v2_count_list[0][1]
else:
leave_value = max(v1_count_list[1][1] + v2_count_list[0][1], v1_count_list[0][1] + v2_count_list[1][1])
print((len(v_list) - leave_value)) | from collections import *
N = eval(input())
v_list = input().split()
if len(set(v_list)) == 1:
print((len(v_list) // 2))
exit()
v1_count_list = Counter(v_list[::2]).most_common(2)
v2_count_list = Counter(v_list[1::2]).most_common(2)
if v1_count_list[0][0] != v2_count_list[0][0]:
leave_value = v1_count_list[0][1] + v2_count_list[0][1]
else:
leave_value = max(v1_count_list[1][1] + v2_count_list[0][1], v1_count_list[0][1] + v2_count_list[1][1])
print((len(v_list) - leave_value)) | 17 | 17 | 509 | 506 | from collections import *
N = int(eval(input()))
v_list = input().split()
if len(set(v_list)) == 1:
print((len(v_list) // 2))
exit()
v1_count_list = Counter(v_list[::2]).most_common()
v2_count_list = Counter(v_list[1::2]).most_common()
if v1_count_list[0][0] != v2_count_list[0][0]:
leave_value = v1_count_list[0][1] + v2_count_list[0][1]
else:
leave_value = max(
v1_count_list[1][1] + v2_count_list[0][1],
v1_count_list[0][1] + v2_count_list[1][1],
)
print((len(v_list) - leave_value))
| from collections import *
N = eval(input())
v_list = input().split()
if len(set(v_list)) == 1:
print((len(v_list) // 2))
exit()
v1_count_list = Counter(v_list[::2]).most_common(2)
v2_count_list = Counter(v_list[1::2]).most_common(2)
if v1_count_list[0][0] != v2_count_list[0][0]:
leave_value = v1_count_list[0][1] + v2_count_list[0][1]
else:
leave_value = max(
v1_count_list[1][1] + v2_count_list[0][1],
v1_count_list[0][1] + v2_count_list[1][1],
)
print((len(v_list) - leave_value))
| false | 0 | [
"-N = int(eval(input()))",
"+N = eval(input())",
"-v1_count_list = Counter(v_list[::2]).most_common()",
"-v2_count_list = Counter(v_list[1::2]).most_common()",
"+v1_count_list = Counter(v_list[::2]).most_common(2)",
"+v2_count_list = Counter(v_list[1::2]).most_common(2)"
] | false | 0.049618 | 0.113427 | 0.437441 | [
"s918208879",
"s371569413"
] |
u780342333 | p02419 | python | s055470319 | s231829158 | 30 | 20 | 7,492 | 5,564 | Accepted | Accepted | 33.33 | text = ''
key= input().lower()
while True:
s = eval(input())
if s.find("END_OF_TEXT") >= 0: break
try:
text += s + ' '
except:
break
print(([x.lower() for x in text.split(" ")].count(key) )) | if __name__ == "__main__":
target = eval(input())
res = 0
line = eval(input())
while line != "END_OF_TEXT":
res += [x.lower() for x in line.split()].count(target)
line = eval(input())
print(res)
| 12 | 10 | 227 | 224 | text = ""
key = input().lower()
while True:
s = eval(input())
if s.find("END_OF_TEXT") >= 0:
break
try:
text += s + " "
except:
break
print(([x.lower() for x in text.split(" ")].count(key)))
| if __name__ == "__main__":
target = eval(input())
res = 0
line = eval(input())
while line != "END_OF_TEXT":
res += [x.lower() for x in line.split()].count(target)
line = eval(input())
print(res)
| false | 16.666667 | [
"-text = \"\"",
"-key = input().lower()",
"-while True:",
"- s = eval(input())",
"- if s.find(\"END_OF_TEXT\") >= 0:",
"- break",
"- try:",
"- text += s + \" \"",
"- except:",
"- break",
"-print(([x.lower() for x in text.split(\" \")].count(key)))",
"+if __name__ == \"__main__\":",
"+ target = eval(input())",
"+ res = 0",
"+ line = eval(input())",
"+ while line != \"END_OF_TEXT\":",
"+ res += [x.lower() for x in line.split()].count(target)",
"+ line = eval(input())",
"+ print(res)"
] | false | 0.036312 | 0.034925 | 1.039701 | [
"s055470319",
"s231829158"
] |
u762420987 | p03673 | python | s717312375 | s837146724 | 338 | 210 | 25,588 | 25,412 | Accepted | Accepted | 37.87 | from collections import deque
d = deque()
n = int(input())
alist = list(map(int, input().split()))
for i in range(n):
if i % 2 == 0:
d.append(alist[i])
else:
d.appendleft(alist[i])
if n % 2 == 0:
d = list(d)
else:
d = list(d)[::-1]
for element in d:
print(element, end=" ")
print()
| from collections import deque
n = int(eval(input()))
alist = list(map(int, input().split()))
d = deque()
for i in range(n):
if i % 2 == 0:
d.append(alist[i])
else:
d.appendleft(alist[i])
if i % 2 == 0:
print((*reversed(d)))
else:
print((*d)) | 16 | 13 | 333 | 275 | from collections import deque
d = deque()
n = int(input())
alist = list(map(int, input().split()))
for i in range(n):
if i % 2 == 0:
d.append(alist[i])
else:
d.appendleft(alist[i])
if n % 2 == 0:
d = list(d)
else:
d = list(d)[::-1]
for element in d:
print(element, end=" ")
print()
| from collections import deque
n = int(eval(input()))
alist = list(map(int, input().split()))
d = deque()
for i in range(n):
if i % 2 == 0:
d.append(alist[i])
else:
d.appendleft(alist[i])
if i % 2 == 0:
print((*reversed(d)))
else:
print((*d))
| false | 18.75 | [
"+n = int(eval(input()))",
"+alist = list(map(int, input().split()))",
"-n = int(input())",
"-alist = list(map(int, input().split()))",
"-if n % 2 == 0:",
"- d = list(d)",
"+if i % 2 == 0:",
"+ print((*reversed(d)))",
"- d = list(d)[::-1]",
"-for element in d:",
"- print(element, end=\" \")",
"-print()",
"+ print((*d))"
] | false | 0.069255 | 0.06903 | 1.003267 | [
"s717312375",
"s837146724"
] |
u989345508 | p03287 | python | s418622378 | s803030464 | 122 | 102 | 16,780 | 14,476 | Accepted | Accepted | 16.39 | n,m,*c=open(0).read().split();d={0:1};r=s=0
for i in c:s+=int(i);s%=int(m);x=d.get(s,0);r+=x;d[s]=x+1
print(r) | n,m,*c=list(map(int,open(0).read().split()));d={0:1};r=s=0
for i in c:s+=i;s%=m;x=d.get(s,0);r+=x;d[s]=x+1
print(r) | 3 | 3 | 112 | 111 | n, m, *c = open(0).read().split()
d = {0: 1}
r = s = 0
for i in c:
s += int(i)
s %= int(m)
x = d.get(s, 0)
r += x
d[s] = x + 1
print(r)
| n, m, *c = list(map(int, open(0).read().split()))
d = {0: 1}
r = s = 0
for i in c:
s += i
s %= m
x = d.get(s, 0)
r += x
d[s] = x + 1
print(r)
| false | 0 | [
"-n, m, *c = open(0).read().split()",
"+n, m, *c = list(map(int, open(0).read().split()))",
"- s += int(i)",
"- s %= int(m)",
"+ s += i",
"+ s %= m"
] | false | 0.094629 | 0.047203 | 2.004728 | [
"s418622378",
"s803030464"
] |
u536560967 | p03060 | python | s904678142 | s290093074 | 19 | 17 | 3,060 | 3,060 | Accepted | Accepted | 10.53 | #!/usr/bin/env python3
n = int(eval(input()))
v = list(map(int, input().split()))
c = list(map(int, input().split()))
x = 0
y = 0
for i in range(n):
if v[i] >= c[i]:
x += v[i]
y += c[i]
print((x - y))
| #!/usr/bin/env python3
n = int(eval(input()))
v = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = 0
for i in range(n):
if v[i] >= c[i]:
ans += v[i] - c[i]
print(ans)
| 11 | 9 | 223 | 206 | #!/usr/bin/env python3
n = int(eval(input()))
v = list(map(int, input().split()))
c = list(map(int, input().split()))
x = 0
y = 0
for i in range(n):
if v[i] >= c[i]:
x += v[i]
y += c[i]
print((x - y))
| #!/usr/bin/env python3
n = int(eval(input()))
v = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = 0
for i in range(n):
if v[i] >= c[i]:
ans += v[i] - c[i]
print(ans)
| false | 18.181818 | [
"-x = 0",
"-y = 0",
"+ans = 0",
"- x += v[i]",
"- y += c[i]",
"-print((x - y))",
"+ ans += v[i] - c[i]",
"+print(ans)"
] | false | 0.050469 | 0.06837 | 0.738179 | [
"s904678142",
"s290093074"
] |
u325282913 | p03805 | python | s678336804 | s372024420 | 34 | 30 | 9,352 | 8,964 | Accepted | Accepted | 11.76 | import copy
import sys
sys.setrecursionlimit(10**7)
N, M = list(map(int, input().split()))
edges = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
edges[a - 1].append(b - 1)
edges[b - 1].append(a - 1)
ans = 0
def dfs(start,path):
next_path = copy.copy(path)
global ans
next_path.append(start)
if len(next_path) == N:
ans += 1
return
for i in edges[start]:
if i not in next_path:
dfs(i,next_path)
dfs(0,[])
print(ans) | def dfs(start,path):
res = 0
path.append(start)
if len(path) == N:
res += 1
return res
for i in graph[start]:
if i not in path:
res += dfs(i,path)
path.pop()
return res
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
graph[a-1].append(b-1)
graph[b-1].append(a-1)
print((dfs(0,[]))) | 22 | 19 | 526 | 446 | import copy
import sys
sys.setrecursionlimit(10**7)
N, M = list(map(int, input().split()))
edges = [[] for _ in range(N)]
for _ in range(M):
a, b = list(map(int, input().split()))
edges[a - 1].append(b - 1)
edges[b - 1].append(a - 1)
ans = 0
def dfs(start, path):
next_path = copy.copy(path)
global ans
next_path.append(start)
if len(next_path) == N:
ans += 1
return
for i in edges[start]:
if i not in next_path:
dfs(i, next_path)
dfs(0, [])
print(ans)
| def dfs(start, path):
res = 0
path.append(start)
if len(path) == N:
res += 1
return res
for i in graph[start]:
if i not in path:
res += dfs(i, path)
path.pop()
return res
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
graph[a - 1].append(b - 1)
graph[b - 1].append(a - 1)
print((dfs(0, [])))
| false | 13.636364 | [
"-import copy",
"-import sys",
"-",
"-sys.setrecursionlimit(10**7)",
"-N, M = list(map(int, input().split()))",
"-edges = [[] for _ in range(N)]",
"-for _ in range(M):",
"- a, b = list(map(int, input().split()))",
"- edges[a - 1].append(b - 1)",
"- edges[b - 1].append(a - 1)",
"-ans = 0",
"+def dfs(start, path):",
"+ res = 0",
"+ path.append(start)",
"+ if len(path) == N:",
"+ res += 1",
"+ return res",
"+ for i in graph[start]:",
"+ if i not in path:",
"+ res += dfs(i, path)",
"+ path.pop()",
"+ return res",
"-def dfs(start, path):",
"- next_path = copy.copy(path)",
"- global ans",
"- next_path.append(start)",
"- if len(next_path) == N:",
"- ans += 1",
"- return",
"- for i in edges[start]:",
"- if i not in next_path:",
"- dfs(i, next_path)",
"-",
"-",
"-dfs(0, [])",
"-print(ans)",
"+N, M = list(map(int, input().split()))",
"+graph = [[] for _ in range(N)]",
"+for i in range(M):",
"+ a, b = list(map(int, input().split()))",
"+ graph[a - 1].append(b - 1)",
"+ graph[b - 1].append(a - 1)",
"+print((dfs(0, [])))"
] | false | 0.235884 | 0.078861 | 2.991113 | [
"s678336804",
"s372024420"
] |
u979444096 | p02773 | python | s996448300 | s131442681 | 812 | 703 | 49,276 | 49,200 | Accepted | Accepted | 13.42 | from collections import Counter
n = int(eval(input()))
a = [eval(input()) for i in range(n)]
c = Counter(a)
d = c.most_common()
ans = []
for i in list(c.items()):
if i[1] == d[0][1]:
ans.append(i[0])
for i in sorted(ans):
print(i)
| from collections import Counter
def main():
N = int(eval(input()))
A = [eval(input()) for _ in range(N)]
c = Counter(A)
d = c.most_common()
ans = []
for i in list(c.items()):
if i[1] == d[0][1]:
ans.append(i[0])
for i in sorted(ans):
print(i)
if __name__ == '__main__':
main()
| 12 | 19 | 235 | 342 | from collections import Counter
n = int(eval(input()))
a = [eval(input()) for i in range(n)]
c = Counter(a)
d = c.most_common()
ans = []
for i in list(c.items()):
if i[1] == d[0][1]:
ans.append(i[0])
for i in sorted(ans):
print(i)
| from collections import Counter
def main():
N = int(eval(input()))
A = [eval(input()) for _ in range(N)]
c = Counter(A)
d = c.most_common()
ans = []
for i in list(c.items()):
if i[1] == d[0][1]:
ans.append(i[0])
for i in sorted(ans):
print(i)
if __name__ == "__main__":
main()
| false | 36.842105 | [
"-n = int(eval(input()))",
"-a = [eval(input()) for i in range(n)]",
"-c = Counter(a)",
"-d = c.most_common()",
"-ans = []",
"-for i in list(c.items()):",
"- if i[1] == d[0][1]:",
"- ans.append(i[0])",
"-for i in sorted(ans):",
"- print(i)",
"+",
"+def main():",
"+ N = int(eval(input()))",
"+ A = [eval(input()) for _ in range(N)]",
"+ c = Counter(A)",
"+ d = c.most_common()",
"+ ans = []",
"+ for i in list(c.items()):",
"+ if i[1] == d[0][1]:",
"+ ans.append(i[0])",
"+ for i in sorted(ans):",
"+ print(i)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.04717 | 0.047173 | 0.999932 | [
"s996448300",
"s131442681"
] |
u037830865 | p02844 | python | s848323122 | s004769486 | 24 | 21 | 3,188 | 3,060 | Accepted | Accepted | 12.5 | N = eval(input())
S = eval(input())
count = 0
for i in range(1000):
n = "{:03d}".format(i)
n1, n2, n3 = n[0], n[1], n[2]
i1 = S.find(n1)
if -1 < i1 < len(S) - 2:
S1 = S[i1 + 1:]
i2 = S1.find(n2)
if -1 < i2 < len(S1) - 1:
S2 = S1[i2 + 1:]
i3 = S2.find(n3)
if -1 < i3:
count += 1
continue
print(count)
| N = eval(input())
S = eval(input())
count = 0
for i in range(1000):
n = "{:03d}".format(i)
n1, n2, n3 = n[0], n[1], n[2]
i1 = S.find(n1)
if -1 < i1 < len(S) - 2:
i2 = S.find(n2, i1 + 1)
if -1 < i2 < len(S) - 1:
i3 = S.find(n3, i2 + 1)
if -1 < i3:
count += 1
continue
print(count)
| 17 | 15 | 412 | 370 | N = eval(input())
S = eval(input())
count = 0
for i in range(1000):
n = "{:03d}".format(i)
n1, n2, n3 = n[0], n[1], n[2]
i1 = S.find(n1)
if -1 < i1 < len(S) - 2:
S1 = S[i1 + 1 :]
i2 = S1.find(n2)
if -1 < i2 < len(S1) - 1:
S2 = S1[i2 + 1 :]
i3 = S2.find(n3)
if -1 < i3:
count += 1
continue
print(count)
| N = eval(input())
S = eval(input())
count = 0
for i in range(1000):
n = "{:03d}".format(i)
n1, n2, n3 = n[0], n[1], n[2]
i1 = S.find(n1)
if -1 < i1 < len(S) - 2:
i2 = S.find(n2, i1 + 1)
if -1 < i2 < len(S) - 1:
i3 = S.find(n3, i2 + 1)
if -1 < i3:
count += 1
continue
print(count)
| false | 11.764706 | [
"- S1 = S[i1 + 1 :]",
"- i2 = S1.find(n2)",
"- if -1 < i2 < len(S1) - 1:",
"- S2 = S1[i2 + 1 :]",
"- i3 = S2.find(n3)",
"+ i2 = S.find(n2, i1 + 1)",
"+ if -1 < i2 < len(S) - 1:",
"+ i3 = S.find(n3, i2 + 1)"
] | false | 0.079519 | 0.036305 | 2.190329 | [
"s848323122",
"s004769486"
] |
u182870307 | p03556 | python | s565398889 | s903713399 | 38 | 18 | 2,940 | 3,060 | Accepted | Accepted | 52.63 | N = int(eval(input()))
k = 0
for i in range(N+2):
if (i**2 <= N):
k = i**2
else:
print(k)
break | N = int(eval(input()))
print((int((N**0.5//1)**2))) | 9 | 2 | 130 | 44 | N = int(eval(input()))
k = 0
for i in range(N + 2):
if i**2 <= N:
k = i**2
else:
print(k)
break
| N = int(eval(input()))
print((int((N**0.5 // 1) ** 2)))
| false | 77.777778 | [
"-k = 0",
"-for i in range(N + 2):",
"- if i**2 <= N:",
"- k = i**2",
"- else:",
"- print(k)",
"- break",
"+print((int((N**0.5 // 1) ** 2)))"
] | false | 0.052178 | 0.044478 | 1.173122 | [
"s565398889",
"s903713399"
] |
u606045429 | p02695 | python | s507480388 | s847874432 | 541 | 338 | 9,132 | 9,212 | Accepted | Accepted | 37.52 | from itertools import combinations_with_replacement
N, M, Q, *ABCD = list(map(int, open(0).read().split()))
L = list(zip(*[iter(ABCD)] * 4))
print((max(sum(d for a, b, c, d in L if A[b - 1] - A[a - 1] == c) for A in combinations_with_replacement(list(range(1, M + 1)), N)))) | N, M, Q, *ABCD = list(map(int, open(0).read().split()))
L = list(zip(*[iter(ABCD)] * 4))
def solve(A):
if len(A) == N:
return sum(d for a, b, c, d in L if A[b - 1] - A[a - 1] == c)
return max(solve(A + [i]) for i in range(A[-1], M + 1))
print((solve([1]))) | 7 | 11 | 269 | 278 | from itertools import combinations_with_replacement
N, M, Q, *ABCD = list(map(int, open(0).read().split()))
L = list(zip(*[iter(ABCD)] * 4))
print(
(
max(
sum(d for a, b, c, d in L if A[b - 1] - A[a - 1] == c)
for A in combinations_with_replacement(list(range(1, M + 1)), N)
)
)
)
| N, M, Q, *ABCD = list(map(int, open(0).read().split()))
L = list(zip(*[iter(ABCD)] * 4))
def solve(A):
if len(A) == N:
return sum(d for a, b, c, d in L if A[b - 1] - A[a - 1] == c)
return max(solve(A + [i]) for i in range(A[-1], M + 1))
print((solve([1])))
| false | 36.363636 | [
"-from itertools import combinations_with_replacement",
"-",
"-print(",
"- (",
"- max(",
"- sum(d for a, b, c, d in L if A[b - 1] - A[a - 1] == c)",
"- for A in combinations_with_replacement(list(range(1, M + 1)), N)",
"- )",
"- )",
"-)",
"+",
"+",
"+def solve(A):",
"+ if len(A) == N:",
"+ return sum(d for a, b, c, d in L if A[b - 1] - A[a - 1] == c)",
"+ return max(solve(A + [i]) for i in range(A[-1], M + 1))",
"+",
"+",
"+print((solve([1])))"
] | false | 0.070607 | 0.060919 | 1.159033 | [
"s507480388",
"s847874432"
] |
u150984829 | p02386 | python | s910305190 | s976727443 | 30 | 20 | 5,608 | 5,608 | Accepted | Accepted | 33.33 | def f():
for c in range(n):
for d in a[c+1:]:
for p in([0,1,2,3,4,5],[1,5,2,0,4,3],[2,1,5,3,0,4],[3,0,2,5,4,1],[4,1,0,3,5,2],[5,1,4,3,2,0]):
f=[d[i]for i in p]
if f[::5]==a[c][::5]:
f=f[1:5]*2
for k in range(4):
if f[k:k+4]==a[c][1:5]:return"No"
return"Yes"
import sys
b=0
n=int(eval(input()))
a=[e.split()for e in sys.stdin]
for b in a:b[3:5]=b[4],b[3]
print((f()))
| def f():
for c in range(n):
for d in a[c+1:]:
for p in([0,1,2,3,4,5],[1,5,2,0,4,3],[2,1,5,3,0,4],[3,0,2,5,4,1],[4,1,0,3,5,2],[5,1,4,3,2,0]):
if[d[p[0]],d[p[5]]]==a[c][::5]:
f=[d[i]for i in p[1:5]]*2
for k in range(4):
if f[k:k+4]==a[c][1:5]:return"No"
return"Yes"
b=0
n=int(eval(input()))
a=[input().split()for _ in[0]*n]
for b in a:b[3:5]=b[4],b[3]
print((f()))
| 16 | 14 | 405 | 395 | def f():
for c in range(n):
for d in a[c + 1 :]:
for p in (
[0, 1, 2, 3, 4, 5],
[1, 5, 2, 0, 4, 3],
[2, 1, 5, 3, 0, 4],
[3, 0, 2, 5, 4, 1],
[4, 1, 0, 3, 5, 2],
[5, 1, 4, 3, 2, 0],
):
f = [d[i] for i in p]
if f[::5] == a[c][::5]:
f = f[1:5] * 2
for k in range(4):
if f[k : k + 4] == a[c][1:5]:
return "No"
return "Yes"
import sys
b = 0
n = int(eval(input()))
a = [e.split() for e in sys.stdin]
for b in a:
b[3:5] = b[4], b[3]
print((f()))
| def f():
for c in range(n):
for d in a[c + 1 :]:
for p in (
[0, 1, 2, 3, 4, 5],
[1, 5, 2, 0, 4, 3],
[2, 1, 5, 3, 0, 4],
[3, 0, 2, 5, 4, 1],
[4, 1, 0, 3, 5, 2],
[5, 1, 4, 3, 2, 0],
):
if [d[p[0]], d[p[5]]] == a[c][::5]:
f = [d[i] for i in p[1:5]] * 2
for k in range(4):
if f[k : k + 4] == a[c][1:5]:
return "No"
return "Yes"
b = 0
n = int(eval(input()))
a = [input().split() for _ in [0] * n]
for b in a:
b[3:5] = b[4], b[3]
print((f()))
| false | 12.5 | [
"- f = [d[i] for i in p]",
"- if f[::5] == a[c][::5]:",
"- f = f[1:5] * 2",
"+ if [d[p[0]], d[p[5]]] == a[c][::5]:",
"+ f = [d[i] for i in p[1:5]] * 2",
"-import sys",
"-",
"-a = [e.split() for e in sys.stdin]",
"+a = [input().split() for _ in [0] * n]"
] | false | 0.04956 | 0.050324 | 0.984825 | [
"s910305190",
"s976727443"
] |
u063052907 | p03137 | python | s458967722 | s479475465 | 119 | 105 | 13,960 | 13,968 | Accepted | Accepted | 11.76 | N, M = list(map(int, input().split()))
lst_X = sorted(list(map(int, input().split())))
if N>=M:
print((0))
else:
lst_diff = []
for i in range(M-1):
diff = abs(lst_X[i] - lst_X[i+1])
lst_diff.append(diff)
lst_diff.sort(reverse=True)
print((sum(lst_diff[N-1:])))
| N, M = list(map(int, input().split()))
lst_X = sorted(list(map(int, input().split())))
if N>=M:
print((0))
else:
lst_diff = sorted([lst_X[i+1]-lst_X[i] for i in range(M-1)])[:M-N]
print((sum(lst_diff)))
| 13 | 9 | 301 | 215 | N, M = list(map(int, input().split()))
lst_X = sorted(list(map(int, input().split())))
if N >= M:
print((0))
else:
lst_diff = []
for i in range(M - 1):
diff = abs(lst_X[i] - lst_X[i + 1])
lst_diff.append(diff)
lst_diff.sort(reverse=True)
print((sum(lst_diff[N - 1 :])))
| N, M = list(map(int, input().split()))
lst_X = sorted(list(map(int, input().split())))
if N >= M:
print((0))
else:
lst_diff = sorted([lst_X[i + 1] - lst_X[i] for i in range(M - 1)])[: M - N]
print((sum(lst_diff)))
| false | 30.769231 | [
"- lst_diff = []",
"- for i in range(M - 1):",
"- diff = abs(lst_X[i] - lst_X[i + 1])",
"- lst_diff.append(diff)",
"- lst_diff.sort(reverse=True)",
"- print((sum(lst_diff[N - 1 :])))",
"+ lst_diff = sorted([lst_X[i + 1] - lst_X[i] for i in range(M - 1)])[: M - N]",
"+ print((sum(lst_diff)))"
] | false | 0.072501 | 0.070822 | 1.023716 | [
"s458967722",
"s479475465"
] |
u557168336 | p02874 | python | s071349555 | s564431630 | 676 | 538 | 30,820 | 27,788 | Accepted | Accepted | 20.41 | import sys
input = sys.stdin.readline
N = int(eval(input()))
mG = [tuple(map(int, input().split())) for _ in range(N)]
mG.sort(key=lambda x: x[1], reverse=True)
mG.sort(key=lambda x: x[0])
# print(mG)###
vA1 = []
vL1 = []
vR1 = []
L = -1
R = 10**9 + 1
for l,r in mG[:-1]:
L = max(L, l)
R = min(R, r)
vL1.append(L)
vR1.append(R)
vA1.append(R-L+1)
# print(vA1)###
vA2 = []
vL2 = []
vR2 = []
L = -1
R = 10**9 + 1
for l,r in mG[:0:-1]:
L = max(L, l)
R = min(R, r)
vL2.append(L)
vR2.append(R)
vA2.append(R-L+1)
# print(vA2)###
M1 = max(a+b for a,b in zip(vA1, vA2[::-1]))
# pick max1
# and all others to 2
k = 0
idm = -1
for i,(l,r) in enumerate(mG):
d = r-l+1
if d > k:
k = d
idm = i
L = -1
R = 10**9 + 1
for i,(l,r) in enumerate(mG):
if i==idm:
continue
L = max(L, l)
R = min(R, r)
M2 = k + max(0, R-L+1)
print((max(M1,M2))) | import sys
from operator import itemgetter as ITEM
input = sys.stdin.readline
N = int(eval(input()))
mG = [tuple(map(int, input().split())) for _ in range(N)]
mG.sort(key=ITEM(1), reverse=True)
mG.sort(key=ITEM(0))
INF = 1000100100
vA1 = []
L = -1
R = INF
for l,r in mG[:-1]:
L = max(L, l)
R = min(R, r)
vA1.append(R-L+1)
vA2 = []
L = -1
R = INF
for l,r in mG[:0:-1]:
L = max(L, l)
R = min(R, r)
vA2.append(R-L+1)
M1 = max(a+b for a,b in zip(vA1, vA2[::-1]))
# pick max1
# and all others to 2
k = 0
idm = -1
for i,(l,r) in enumerate(mG):
d = r-l+1
if d > k:
k = d
idm = i
L = -1
R = INF
for i,(l,r) in enumerate(mG):
if i==idm:
continue
L = max(L, l)
R = min(R, r)
M2 = k + max(0, R-L+1)
print((max(M1,M2)))
| 64 | 50 | 976 | 826 | import sys
input = sys.stdin.readline
N = int(eval(input()))
mG = [tuple(map(int, input().split())) for _ in range(N)]
mG.sort(key=lambda x: x[1], reverse=True)
mG.sort(key=lambda x: x[0])
# print(mG)###
vA1 = []
vL1 = []
vR1 = []
L = -1
R = 10**9 + 1
for l, r in mG[:-1]:
L = max(L, l)
R = min(R, r)
vL1.append(L)
vR1.append(R)
vA1.append(R - L + 1)
# print(vA1)###
vA2 = []
vL2 = []
vR2 = []
L = -1
R = 10**9 + 1
for l, r in mG[:0:-1]:
L = max(L, l)
R = min(R, r)
vL2.append(L)
vR2.append(R)
vA2.append(R - L + 1)
# print(vA2)###
M1 = max(a + b for a, b in zip(vA1, vA2[::-1]))
# pick max1
# and all others to 2
k = 0
idm = -1
for i, (l, r) in enumerate(mG):
d = r - l + 1
if d > k:
k = d
idm = i
L = -1
R = 10**9 + 1
for i, (l, r) in enumerate(mG):
if i == idm:
continue
L = max(L, l)
R = min(R, r)
M2 = k + max(0, R - L + 1)
print((max(M1, M2)))
| import sys
from operator import itemgetter as ITEM
input = sys.stdin.readline
N = int(eval(input()))
mG = [tuple(map(int, input().split())) for _ in range(N)]
mG.sort(key=ITEM(1), reverse=True)
mG.sort(key=ITEM(0))
INF = 1000100100
vA1 = []
L = -1
R = INF
for l, r in mG[:-1]:
L = max(L, l)
R = min(R, r)
vA1.append(R - L + 1)
vA2 = []
L = -1
R = INF
for l, r in mG[:0:-1]:
L = max(L, l)
R = min(R, r)
vA2.append(R - L + 1)
M1 = max(a + b for a, b in zip(vA1, vA2[::-1]))
# pick max1
# and all others to 2
k = 0
idm = -1
for i, (l, r) in enumerate(mG):
d = r - l + 1
if d > k:
k = d
idm = i
L = -1
R = INF
for i, (l, r) in enumerate(mG):
if i == idm:
continue
L = max(L, l)
R = min(R, r)
M2 = k + max(0, R - L + 1)
print((max(M1, M2)))
| false | 21.875 | [
"+from operator import itemgetter as ITEM",
"-mG.sort(key=lambda x: x[1], reverse=True)",
"-mG.sort(key=lambda x: x[0])",
"-# print(mG)###",
"+mG.sort(key=ITEM(1), reverse=True)",
"+mG.sort(key=ITEM(0))",
"+INF = 1000100100",
"-vL1 = []",
"-vR1 = []",
"-R = 10**9 + 1",
"+R = INF",
"- vL1.append(L)",
"- vR1.append(R)",
"-# print(vA1)###",
"-vL2 = []",
"-vR2 = []",
"-R = 10**9 + 1",
"+R = INF",
"- vL2.append(L)",
"- vR2.append(R)",
"-# print(vA2)###",
"-R = 10**9 + 1",
"+R = INF"
] | false | 0.037291 | 0.034988 | 1.065838 | [
"s071349555",
"s564431630"
] |
u463655976 | p03032 | python | s917733270 | s495336358 | 111 | 102 | 3,436 | 3,444 | Accepted | Accepted | 8.11 | from collections import deque, _heapq
N, K = list(map(int, input().split()))
V = deque(list(map(int, input().split())))
class Money:
def __init__(self):
self.yen = 0
self.red = []
def value(self):
return self.yen + sum(self.red)
def add(self, yen):
if yen >= 0:
self.yen += yen
else:
self.red.append(yen)
def remove(self, yen):
if yen >= 0:
self.yen -= yen
else:
self.red.remove(yen)
#mny = Money()
def get(cnt, mny, lstop, rstop):
ans = mny.value()
if cnt <= 0:
return ans
if len(V) > 0:
if lstop == 0:
w = V.popleft()
mny.add(w)
ans = max(ans, get(cnt-1, mny, lstop, rstop))
mny.remove(w)
V.appendleft(w)
elif lstop > 0:
lstop -= 1
if rstop == 0:
w = V.pop()
mny.add(w)
ans = max(ans, get(cnt-1, mny, -1, rstop))
mny.remove(w)
V.append(w)
if len(mny.red) > 0:
w = min(mny.red)
mny.red.remove(w)
V.appendleft(w)
ans = max(ans, get(cnt-1, mny, -1, -1))
V.popleft()
mny.red.append(w)
return ans
print((get(K, Money(), 0, 0)))
| from collections import deque, _heapq
N, K = list(map(int, input().split()))
V = deque(list(map(int, input().split())))
class Money:
def __init__(self):
self.yen = 0
self.red = []
def value(self):
return self.yen + sum(self.red)
def add(self, yen):
if yen >= 0:
self.yen += yen
else:
self.red.append(yen)
def remove(self, yen):
if yen >= 0:
self.yen -= yen
else:
self.red.remove(yen)
#mny = Money()
def get(cnt, mny, lstop, rstop):
ans = mny.value()
if cnt <= 0:
return ans
if len(V) > 0:
if not lstop:
w = V.popleft()
mny.add(w)
ans = max(ans, get(cnt-1, mny, lstop, rstop))
mny.remove(w)
V.appendleft(w)
if not rstop:
w = V.pop()
mny.add(w)
ans = max(ans, get(cnt-1, mny, True, rstop))
mny.remove(w)
V.append(w)
if len(mny.red) > 0:
w = min(mny.red)
mny.red.remove(w)
V.appendleft(w)
ans = max(ans, get(cnt-1, mny, True, True))
V.popleft()
mny.red.append(w)
return ans
print((get(K, Money(), 0, 0)))
| 62 | 60 | 1,342 | 1,297 | from collections import deque, _heapq
N, K = list(map(int, input().split()))
V = deque(list(map(int, input().split())))
class Money:
def __init__(self):
self.yen = 0
self.red = []
def value(self):
return self.yen + sum(self.red)
def add(self, yen):
if yen >= 0:
self.yen += yen
else:
self.red.append(yen)
def remove(self, yen):
if yen >= 0:
self.yen -= yen
else:
self.red.remove(yen)
# mny = Money()
def get(cnt, mny, lstop, rstop):
ans = mny.value()
if cnt <= 0:
return ans
if len(V) > 0:
if lstop == 0:
w = V.popleft()
mny.add(w)
ans = max(ans, get(cnt - 1, mny, lstop, rstop))
mny.remove(w)
V.appendleft(w)
elif lstop > 0:
lstop -= 1
if rstop == 0:
w = V.pop()
mny.add(w)
ans = max(ans, get(cnt - 1, mny, -1, rstop))
mny.remove(w)
V.append(w)
if len(mny.red) > 0:
w = min(mny.red)
mny.red.remove(w)
V.appendleft(w)
ans = max(ans, get(cnt - 1, mny, -1, -1))
V.popleft()
mny.red.append(w)
return ans
print((get(K, Money(), 0, 0)))
| from collections import deque, _heapq
N, K = list(map(int, input().split()))
V = deque(list(map(int, input().split())))
class Money:
def __init__(self):
self.yen = 0
self.red = []
def value(self):
return self.yen + sum(self.red)
def add(self, yen):
if yen >= 0:
self.yen += yen
else:
self.red.append(yen)
def remove(self, yen):
if yen >= 0:
self.yen -= yen
else:
self.red.remove(yen)
# mny = Money()
def get(cnt, mny, lstop, rstop):
ans = mny.value()
if cnt <= 0:
return ans
if len(V) > 0:
if not lstop:
w = V.popleft()
mny.add(w)
ans = max(ans, get(cnt - 1, mny, lstop, rstop))
mny.remove(w)
V.appendleft(w)
if not rstop:
w = V.pop()
mny.add(w)
ans = max(ans, get(cnt - 1, mny, True, rstop))
mny.remove(w)
V.append(w)
if len(mny.red) > 0:
w = min(mny.red)
mny.red.remove(w)
V.appendleft(w)
ans = max(ans, get(cnt - 1, mny, True, True))
V.popleft()
mny.red.append(w)
return ans
print((get(K, Money(), 0, 0)))
| false | 3.225806 | [
"- if lstop == 0:",
"+ if not lstop:",
"- elif lstop > 0:",
"- lstop -= 1",
"- if rstop == 0:",
"+ if not rstop:",
"- ans = max(ans, get(cnt - 1, mny, -1, rstop))",
"+ ans = max(ans, get(cnt - 1, mny, True, rstop))",
"- ans = max(ans, get(cnt - 1, mny, -1, -1))",
"+ ans = max(ans, get(cnt - 1, mny, True, True))"
] | false | 0.046356 | 0.039059 | 1.186808 | [
"s917733270",
"s495336358"
] |
u153665391 | p02262 | python | s945109907 | s775974106 | 19,640 | 18,090 | 45,520 | 45,508 | Accepted | Accepted | 7.89 | N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
def insertion_sort(A, N, diff, cnt):
for i in range(diff, N):
tmp_num = A[i]
j = i - diff
while j >= 0 and A[j] > tmp_num:
A[j+diff] = A[j]
j = j - diff
cnt += 1
A[j+diff] = tmp_num
return cnt
if __name__ == "__main__":
cnt = 0
divide_cnt = 0
diffs = []
if N == 1:
diffs.append(1)
divide_cnt += 1
else:
quotient = N
while quotient != 1:
quotient = quotient // 2
diffs.append(quotient)
divide_cnt += 1
for diff in diffs:
cnt = insertion_sort(A, N, diff, cnt)
print(divide_cnt)
print((" ".join(map(str, diffs))))
print(cnt)
for num in A:
print(num)
| N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
def insertion_sort(A, N, diff, cnt):
for i in range(diff, N):
tmp_num = A[i]
j = i - diff
while j >= 0 and A[j] > tmp_num:
A[j+diff] = A[j]
j = j - diff
cnt += 1
A[j+diff] = tmp_num
return cnt
if __name__ == "__main__":
cnt = 0
diffs = []
h = 1
while h <= N:
diffs.append(h)
h = h*3 + 1
diffs.reverse()
diffs_cnt = len(diffs)
for diff in diffs:
cnt = insertion_sort(A, N, diff, cnt)
print(diffs_cnt)
print((" ".join(map(str, diffs))))
print(cnt)
for num in A:
print(num)
| 35 | 31 | 836 | 708 | N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
def insertion_sort(A, N, diff, cnt):
for i in range(diff, N):
tmp_num = A[i]
j = i - diff
while j >= 0 and A[j] > tmp_num:
A[j + diff] = A[j]
j = j - diff
cnt += 1
A[j + diff] = tmp_num
return cnt
if __name__ == "__main__":
cnt = 0
divide_cnt = 0
diffs = []
if N == 1:
diffs.append(1)
divide_cnt += 1
else:
quotient = N
while quotient != 1:
quotient = quotient // 2
diffs.append(quotient)
divide_cnt += 1
for diff in diffs:
cnt = insertion_sort(A, N, diff, cnt)
print(divide_cnt)
print((" ".join(map(str, diffs))))
print(cnt)
for num in A:
print(num)
| N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
def insertion_sort(A, N, diff, cnt):
for i in range(diff, N):
tmp_num = A[i]
j = i - diff
while j >= 0 and A[j] > tmp_num:
A[j + diff] = A[j]
j = j - diff
cnt += 1
A[j + diff] = tmp_num
return cnt
if __name__ == "__main__":
cnt = 0
diffs = []
h = 1
while h <= N:
diffs.append(h)
h = h * 3 + 1
diffs.reverse()
diffs_cnt = len(diffs)
for diff in diffs:
cnt = insertion_sort(A, N, diff, cnt)
print(diffs_cnt)
print((" ".join(map(str, diffs))))
print(cnt)
for num in A:
print(num)
| false | 11.428571 | [
"- divide_cnt = 0",
"- if N == 1:",
"- diffs.append(1)",
"- divide_cnt += 1",
"- else:",
"- quotient = N",
"- while quotient != 1:",
"- quotient = quotient // 2",
"- diffs.append(quotient)",
"- divide_cnt += 1",
"+ h = 1",
"+ while h <= N:",
"+ diffs.append(h)",
"+ h = h * 3 + 1",
"+ diffs.reverse()",
"+ diffs_cnt = len(diffs)",
"- print(divide_cnt)",
"+ print(diffs_cnt)"
] | false | 0.043245 | 0.04423 | 0.97773 | [
"s945109907",
"s775974106"
] |
u167681994 | p02693 | python | s048628094 | s121088043 | 29 | 23 | 9,152 | 9,108 | Accepted | Accepted | 20.69 | k = int(eval(input()))
a, b = list(map(int,input().split()))
for i in range(a, b + 1):
if i % k == 0:
print("OK")
exit()
print("NG")
| k = int(eval(input()))
a, b = list(map(int,input().split()))
for i in range(a, b + 1):
if i % k == 0:
print("OK")
break
else:
print("NG") | 9 | 8 | 145 | 144 | k = int(eval(input()))
a, b = list(map(int, input().split()))
for i in range(a, b + 1):
if i % k == 0:
print("OK")
exit()
print("NG")
| k = int(eval(input()))
a, b = list(map(int, input().split()))
for i in range(a, b + 1):
if i % k == 0:
print("OK")
break
else:
print("NG")
| false | 11.111111 | [
"- exit()",
"-print(\"NG\")",
"+ break",
"+else:",
"+ print(\"NG\")"
] | false | 0.040772 | 0.049865 | 0.817647 | [
"s048628094",
"s121088043"
] |
u762420987 | p02766 | python | s648945019 | s728548196 | 166 | 17 | 38,516 | 2,940 | Accepted | Accepted | 89.76 | from math import log, ceil
N, K = list(map(int, input().split()))
num = log(N, K)
if int(num) == 0:
print((1))
else:
print((ceil(num))) | def base_10_to_n(X, n):
if (int(X/n)):
return base_10_to_n(int(X/n), n)+str(X%n)
return str(X%n)
N, K = list(map(int, input().split()))
print((len(base_10_to_n(N, K))))
| 8 | 6 | 141 | 182 | from math import log, ceil
N, K = list(map(int, input().split()))
num = log(N, K)
if int(num) == 0:
print((1))
else:
print((ceil(num)))
| def base_10_to_n(X, n):
if int(X / n):
return base_10_to_n(int(X / n), n) + str(X % n)
return str(X % n)
N, K = list(map(int, input().split()))
print((len(base_10_to_n(N, K))))
| false | 25 | [
"-from math import log, ceil",
"+def base_10_to_n(X, n):",
"+ if int(X / n):",
"+ return base_10_to_n(int(X / n), n) + str(X % n)",
"+ return str(X % n)",
"+",
"-num = log(N, K)",
"-if int(num) == 0:",
"- print((1))",
"-else:",
"- print((ceil(num)))",
"+print((len(base_10_to_n(N, K))))"
] | false | 0.09387 | 0.037323 | 2.51509 | [
"s648945019",
"s728548196"
] |
u073852194 | p03213 | python | s307192279 | s054392827 | 180 | 31 | 39,484 | 3,444 | Accepted | Accepted | 82.78 | def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i == 0:
cnt = 0
while temp%i == 0:
cnt += 1
temp //= i
arr.append([i, cnt])
if temp != 1:
arr.append([temp, 1])
if arr == []:
arr.append([n, 1])
return arr
n = int(eval(input()))
exponent = [[0]*(n+1) for i in range(n+1)]
for i in range(2,n+1):
for j in range(n+1):
exponent[i][j] += exponent[i-1][j]
Fi = factorization(i)
for f in Fi:
exponent[i][f[0]] += f[1]
c75,c25,c15,c5,c3 = 0,0,0,0,0
for e in exponent[n]:
if e >= 74:
c75 += 1
if e >= 24:
c25 += 1
if e >= 14:
c15 += 1
if e >= 4:
c5 += 1
if e >= 2:
c3 += 1
print((
c75 + c25*(c3-c25)+c25*(c25-1) + c15*(c5-c15)+c15*(c15-1) + (c5*(c5-1))//2*(c5-2)+(c5*(c5-1))//2*(c3-c5)
)) | from collections import defaultdict
def factorization(n):
if n == 1: return []
res = []
x = n
y = 2
while y * y <= x:
while x % y == 0:
res.append(y)
x //= y
y += 1
if x > 1: res.append(x)
return res
N = int(eval(input()))
D = defaultdict(int)
for i in range(1, N + 1):
F = factorization(i)
for f in F:
D[f] += 1
cnt_75 = 0
cnt_25 = 0
cnt_15 = 0
cnt_5 = 0
cnt_3 = 0
for v in list(D.values()):
if v + 1 >= 75:
cnt_75 += 1
if v + 1 >= 25:
cnt_25 += 1
if v + 1 >= 15:
cnt_15 += 1
if v + 1 >= 5:
cnt_5 += 1
if v + 1 >= 3:
cnt_3 += 1
ans = 0
ans += cnt_75
ans += cnt_25 * (cnt_3 - 1)
ans += cnt_15 * (cnt_5 - 1)
ans += cnt_5 * (cnt_5 - 1) // 2 * (cnt_3 - 2)
print(ans) | 41 | 50 | 920 | 854 | def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-(n**0.5) // 1)) + 1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
temp //= i
arr.append([i, cnt])
if temp != 1:
arr.append([temp, 1])
if arr == []:
arr.append([n, 1])
return arr
n = int(eval(input()))
exponent = [[0] * (n + 1) for i in range(n + 1)]
for i in range(2, n + 1):
for j in range(n + 1):
exponent[i][j] += exponent[i - 1][j]
Fi = factorization(i)
for f in Fi:
exponent[i][f[0]] += f[1]
c75, c25, c15, c5, c3 = 0, 0, 0, 0, 0
for e in exponent[n]:
if e >= 74:
c75 += 1
if e >= 24:
c25 += 1
if e >= 14:
c15 += 1
if e >= 4:
c5 += 1
if e >= 2:
c3 += 1
print(
(
c75
+ c25 * (c3 - c25)
+ c25 * (c25 - 1)
+ c15 * (c5 - c15)
+ c15 * (c15 - 1)
+ (c5 * (c5 - 1)) // 2 * (c5 - 2)
+ (c5 * (c5 - 1)) // 2 * (c3 - c5)
)
)
| from collections import defaultdict
def factorization(n):
if n == 1:
return []
res = []
x = n
y = 2
while y * y <= x:
while x % y == 0:
res.append(y)
x //= y
y += 1
if x > 1:
res.append(x)
return res
N = int(eval(input()))
D = defaultdict(int)
for i in range(1, N + 1):
F = factorization(i)
for f in F:
D[f] += 1
cnt_75 = 0
cnt_25 = 0
cnt_15 = 0
cnt_5 = 0
cnt_3 = 0
for v in list(D.values()):
if v + 1 >= 75:
cnt_75 += 1
if v + 1 >= 25:
cnt_25 += 1
if v + 1 >= 15:
cnt_15 += 1
if v + 1 >= 5:
cnt_5 += 1
if v + 1 >= 3:
cnt_3 += 1
ans = 0
ans += cnt_75
ans += cnt_25 * (cnt_3 - 1)
ans += cnt_15 * (cnt_5 - 1)
ans += cnt_5 * (cnt_5 - 1) // 2 * (cnt_3 - 2)
print(ans)
| false | 18 | [
"-def factorization(n):",
"- arr = []",
"- temp = n",
"- for i in range(2, int(-(-(n**0.5) // 1)) + 1):",
"- if temp % i == 0:",
"- cnt = 0",
"- while temp % i == 0:",
"- cnt += 1",
"- temp //= i",
"- arr.append([i, cnt])",
"- if temp != 1:",
"- arr.append([temp, 1])",
"- if arr == []:",
"- arr.append([n, 1])",
"- return arr",
"+from collections import defaultdict",
"-n = int(eval(input()))",
"-exponent = [[0] * (n + 1) for i in range(n + 1)]",
"-for i in range(2, n + 1):",
"- for j in range(n + 1):",
"- exponent[i][j] += exponent[i - 1][j]",
"- Fi = factorization(i)",
"- for f in Fi:",
"- exponent[i][f[0]] += f[1]",
"-c75, c25, c15, c5, c3 = 0, 0, 0, 0, 0",
"-for e in exponent[n]:",
"- if e >= 74:",
"- c75 += 1",
"- if e >= 24:",
"- c25 += 1",
"- if e >= 14:",
"- c15 += 1",
"- if e >= 4:",
"- c5 += 1",
"- if e >= 2:",
"- c3 += 1",
"-print(",
"- (",
"- c75",
"- + c25 * (c3 - c25)",
"- + c25 * (c25 - 1)",
"- + c15 * (c5 - c15)",
"- + c15 * (c15 - 1)",
"- + (c5 * (c5 - 1)) // 2 * (c5 - 2)",
"- + (c5 * (c5 - 1)) // 2 * (c3 - c5)",
"- )",
"-)",
"+def factorization(n):",
"+ if n == 1:",
"+ return []",
"+ res = []",
"+ x = n",
"+ y = 2",
"+ while y * y <= x:",
"+ while x % y == 0:",
"+ res.append(y)",
"+ x //= y",
"+ y += 1",
"+ if x > 1:",
"+ res.append(x)",
"+ return res",
"+",
"+",
"+N = int(eval(input()))",
"+D = defaultdict(int)",
"+for i in range(1, N + 1):",
"+ F = factorization(i)",
"+ for f in F:",
"+ D[f] += 1",
"+cnt_75 = 0",
"+cnt_25 = 0",
"+cnt_15 = 0",
"+cnt_5 = 0",
"+cnt_3 = 0",
"+for v in list(D.values()):",
"+ if v + 1 >= 75:",
"+ cnt_75 += 1",
"+ if v + 1 >= 25:",
"+ cnt_25 += 1",
"+ if v + 1 >= 15:",
"+ cnt_15 += 1",
"+ if v + 1 >= 5:",
"+ cnt_5 += 1",
"+ if v + 1 >= 3:",
"+ cnt_3 += 1",
"+ans = 0",
"+ans += cnt_75",
"+ans += cnt_25 * (cnt_3 - 1)",
"+ans += cnt_15 * (cnt_5 - 1)",
"+ans += cnt_5 * (cnt_5 - 1) // 2 * (cnt_3 - 2)",
"+print(ans)"
] | false | 0.037764 | 0.04249 | 0.888771 | [
"s307192279",
"s054392827"
] |
u852690916 | p03644 | python | s107697503 | s426265613 | 186 | 64 | 38,256 | 61,840 | Accepted | Accepted | 65.59 | N=int(eval(input()))
ans=1
while ans*2 <= N:
ans*=2
print(ans) | N = int(eval(input()))
c = 0
ans = 1
for i in range(1, N + 1):
n = i
for t in range(N + 1):
if n % 2 != 0:
if c < t:
c = t
ans = i
break
n //= 2
print(ans)
| 5 | 13 | 64 | 242 | N = int(eval(input()))
ans = 1
while ans * 2 <= N:
ans *= 2
print(ans)
| N = int(eval(input()))
c = 0
ans = 1
for i in range(1, N + 1):
n = i
for t in range(N + 1):
if n % 2 != 0:
if c < t:
c = t
ans = i
break
n //= 2
print(ans)
| false | 61.538462 | [
"+c = 0",
"-while ans * 2 <= N:",
"- ans *= 2",
"+for i in range(1, N + 1):",
"+ n = i",
"+ for t in range(N + 1):",
"+ if n % 2 != 0:",
"+ if c < t:",
"+ c = t",
"+ ans = i",
"+ break",
"+ n //= 2"
] | false | 0.086407 | 0.034794 | 2.483412 | [
"s107697503",
"s426265613"
] |
u225388820 | p02553 | python | s679750329 | s125583470 | 101 | 67 | 61,548 | 61,992 | Accepted | Accepted | 33.66 | a, b, c, d = list(map(int, input().split()))
ans = max(a * c, a * d, b * c, b * d)
print(ans)
| from itertools import product
a, b, c, d = list(map(int, input().split()))
print((max(v[0] * v[1] for v in product((a, b), (c, d)))))
| 3 | 3 | 90 | 128 | a, b, c, d = list(map(int, input().split()))
ans = max(a * c, a * d, b * c, b * d)
print(ans)
| from itertools import product
a, b, c, d = list(map(int, input().split()))
print((max(v[0] * v[1] for v in product((a, b), (c, d)))))
| false | 0 | [
"+from itertools import product",
"+",
"-ans = max(a * c, a * d, b * c, b * d)",
"-print(ans)",
"+print((max(v[0] * v[1] for v in product((a, b), (c, d)))))"
] | false | 0.036596 | 0.036974 | 0.989781 | [
"s679750329",
"s125583470"
] |
u597374218 | p03363 | python | s410305532 | s499767384 | 322 | 194 | 39,296 | 38,676 | Accepted | Accepted | 39.75 | from collections import Counter
N=int(eval(input()))
A=list(map(int,input().split()))
cumulative_sum=0
count=0
counter=Counter([0])
for a in A:
cumulative_sum+=a
count+=counter[cumulative_sum]
counter[cumulative_sum]+=1
print(count) | N=int(eval(input()))
A=list(map(int,input().split()))
cumulative_sum=0
count=0
counter={0:1}
for a in A:
cumulative_sum+=a
if cumulative_sum not in counter:
counter[cumulative_sum]=0
count+=counter[cumulative_sum]
counter[cumulative_sum]+=1
print(count) | 11 | 12 | 248 | 282 | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
cumulative_sum = 0
count = 0
counter = Counter([0])
for a in A:
cumulative_sum += a
count += counter[cumulative_sum]
counter[cumulative_sum] += 1
print(count)
| N = int(eval(input()))
A = list(map(int, input().split()))
cumulative_sum = 0
count = 0
counter = {0: 1}
for a in A:
cumulative_sum += a
if cumulative_sum not in counter:
counter[cumulative_sum] = 0
count += counter[cumulative_sum]
counter[cumulative_sum] += 1
print(count)
| false | 8.333333 | [
"-from collections import Counter",
"-",
"-counter = Counter([0])",
"+counter = {0: 1}",
"+ if cumulative_sum not in counter:",
"+ counter[cumulative_sum] = 0"
] | false | 0.04266 | 0.039676 | 1.075218 | [
"s410305532",
"s499767384"
] |
u680851063 | p03252 | python | s334342434 | s504632940 | 1,065 | 820 | 30,892 | 7,472 | Accepted | Accepted | 23 | s = list(eval(input()))
t = list(eval(input()))
s_set = list(set(s))
t_set = list(set(t))
l = len(s)
l_s_set = len(s_set)
l_t_set = len(t_set)
x = [[] for _ in range(l)]
for i in range(l):
x[i].append(s[i])
x[i].append(t[i])
for j in range(l_s_set):
tmp = []
for k in range(l):
if s_set[j] == x[k][0]:
tmp.append(x[k][1])
if len(set(tmp)) > 1:
print('No')
exit()
for p in range(l_t_set):
tmp = []
for q in range(l):
if t_set[p] == x[q][1]:
tmp.append(x[q][0])
if len(set(tmp)) > 1:
print('No')
exit()
print('Yes') | s = list(eval(input()))
t = list(eval(input()))
s_set = list(set(s))
t_set = list(set(t))
for j in range(len(s_set)):
tmp = []
for k in range(len(s)):
if s_set[j] == s[k]:
tmp.append(t[k])
if len(set(tmp)) > 1:
print('No')
exit()
for p in range(len(t_set)):
tmp = []
for q in range(len(t)):
if t_set[p] == t[q]:
tmp.append(s[q])
if len(set(tmp)) > 1:
print('No')
exit()
print('Yes') | 32 | 24 | 640 | 492 | s = list(eval(input()))
t = list(eval(input()))
s_set = list(set(s))
t_set = list(set(t))
l = len(s)
l_s_set = len(s_set)
l_t_set = len(t_set)
x = [[] for _ in range(l)]
for i in range(l):
x[i].append(s[i])
x[i].append(t[i])
for j in range(l_s_set):
tmp = []
for k in range(l):
if s_set[j] == x[k][0]:
tmp.append(x[k][1])
if len(set(tmp)) > 1:
print("No")
exit()
for p in range(l_t_set):
tmp = []
for q in range(l):
if t_set[p] == x[q][1]:
tmp.append(x[q][0])
if len(set(tmp)) > 1:
print("No")
exit()
print("Yes")
| s = list(eval(input()))
t = list(eval(input()))
s_set = list(set(s))
t_set = list(set(t))
for j in range(len(s_set)):
tmp = []
for k in range(len(s)):
if s_set[j] == s[k]:
tmp.append(t[k])
if len(set(tmp)) > 1:
print("No")
exit()
for p in range(len(t_set)):
tmp = []
for q in range(len(t)):
if t_set[p] == t[q]:
tmp.append(s[q])
if len(set(tmp)) > 1:
print("No")
exit()
print("Yes")
| false | 25 | [
"-l = len(s)",
"-l_s_set = len(s_set)",
"-l_t_set = len(t_set)",
"-x = [[] for _ in range(l)]",
"-for i in range(l):",
"- x[i].append(s[i])",
"- x[i].append(t[i])",
"-for j in range(l_s_set):",
"+for j in range(len(s_set)):",
"- for k in range(l):",
"- if s_set[j] == x[k][0]:",
"- tmp.append(x[k][1])",
"+ for k in range(len(s)):",
"+ if s_set[j] == s[k]:",
"+ tmp.append(t[k])",
"-for p in range(l_t_set):",
"+for p in range(len(t_set)):",
"- for q in range(l):",
"- if t_set[p] == x[q][1]:",
"- tmp.append(x[q][0])",
"+ for q in range(len(t)):",
"+ if t_set[p] == t[q]:",
"+ tmp.append(s[q])"
] | false | 0.038207 | 0.046233 | 0.826412 | [
"s334342434",
"s504632940"
] |
u282228874 | p03546 | python | s941078774 | s864168780 | 42 | 37 | 3,444 | 3,444 | Accepted | Accepted | 11.9 | h,w = list(map(int,input().split()))
C = [list(map(int,input().split())) for i in range(10)]
A = [list(map(int,input().split())) for i in range(h)]
inf = float('inf')
cost = 0
D = [[inf]*10 for i in range(10)]
for k in range(10):
for i in range(10):
for j in range(10):
D[i][j] = min(C[i][j],C[i][k]+C[k][j])
for k in range(10):
for i in range(10):
for j in range(10):
D[i][j] = min(D[i][j],D[i][k]+D[k][j])
for y in range(h):
for x in range(w):
if A[y][x] == -1 or A[y][x] == 1:
continue
else:
cost += D[A[y][x]][1]
print(cost) | h,w = list(map(int,input().split()))
C = [list(map(int,input().split())) for i in range(10)]
A = [list(map(int,input().split())) for i in range(h)]
INF = float('inf')
cost = 0
for k in range(10):
for i in range(10):
for j in range(10):
C[i][j] = min(C[i][j],C[i][k]+C[k][j])
for y in range(h):
for x in range(w):
if A[y][x] != -1:
cost += C[A[y][x]][1]
print(cost)
| 23 | 15 | 638 | 422 | h, w = list(map(int, input().split()))
C = [list(map(int, input().split())) for i in range(10)]
A = [list(map(int, input().split())) for i in range(h)]
inf = float("inf")
cost = 0
D = [[inf] * 10 for i in range(10)]
for k in range(10):
for i in range(10):
for j in range(10):
D[i][j] = min(C[i][j], C[i][k] + C[k][j])
for k in range(10):
for i in range(10):
for j in range(10):
D[i][j] = min(D[i][j], D[i][k] + D[k][j])
for y in range(h):
for x in range(w):
if A[y][x] == -1 or A[y][x] == 1:
continue
else:
cost += D[A[y][x]][1]
print(cost)
| h, w = list(map(int, input().split()))
C = [list(map(int, input().split())) for i in range(10)]
A = [list(map(int, input().split())) for i in range(h)]
INF = float("inf")
cost = 0
for k in range(10):
for i in range(10):
for j in range(10):
C[i][j] = min(C[i][j], C[i][k] + C[k][j])
for y in range(h):
for x in range(w):
if A[y][x] != -1:
cost += C[A[y][x]][1]
print(cost)
| false | 34.782609 | [
"-inf = float(\"inf\")",
"+INF = float(\"inf\")",
"-D = [[inf] * 10 for i in range(10)]",
"- D[i][j] = min(C[i][j], C[i][k] + C[k][j])",
"-for k in range(10):",
"- for i in range(10):",
"- for j in range(10):",
"- D[i][j] = min(D[i][j], D[i][k] + D[k][j])",
"+ C[i][j] = min(C[i][j], C[i][k] + C[k][j])",
"- if A[y][x] == -1 or A[y][x] == 1:",
"- continue",
"- else:",
"- cost += D[A[y][x]][1]",
"+ if A[y][x] != -1:",
"+ cost += C[A[y][x]][1]"
] | false | 0.046291 | 0.037877 | 1.222114 | [
"s941078774",
"s864168780"
] |
u130900604 | p02665 | python | s316973403 | s713396244 | 666 | 85 | 646,076 | 20,072 | Accepted | Accepted | 87.24 | n=int(eval(input()))
a=list(map(int,input().split()))
tot=sum(a)
v=[1]
for q in a:
tot-=q
v.append(min(2*(v[-1]-q),tot))
if all([u>=0 for u in v]):
print((sum(v)))
else:
print((-1)) | n,*a=list(map(int,open(0).read().split()))
tot=sum(a)
v=[1]
for q in a:
tot-=q
vt=min(2*(v[-1]-q),tot)
if vt<0:
print((-1))
exit()
v.append(vt)
print((sum(v))) | 13 | 11 | 205 | 175 | n = int(eval(input()))
a = list(map(int, input().split()))
tot = sum(a)
v = [1]
for q in a:
tot -= q
v.append(min(2 * (v[-1] - q), tot))
if all([u >= 0 for u in v]):
print((sum(v)))
else:
print((-1))
| n, *a = list(map(int, open(0).read().split()))
tot = sum(a)
v = [1]
for q in a:
tot -= q
vt = min(2 * (v[-1] - q), tot)
if vt < 0:
print((-1))
exit()
v.append(vt)
print((sum(v)))
| false | 15.384615 | [
"-n = int(eval(input()))",
"-a = list(map(int, input().split()))",
"+n, *a = list(map(int, open(0).read().split()))",
"- v.append(min(2 * (v[-1] - q), tot))",
"-if all([u >= 0 for u in v]):",
"- print((sum(v)))",
"-else:",
"- print((-1))",
"+ vt = min(2 * (v[-1] - q), tot)",
"+ if vt < 0:",
"+ print((-1))",
"+ exit()",
"+ v.append(vt)",
"+print((sum(v)))"
] | false | 0.046511 | 0.041617 | 1.117601 | [
"s316973403",
"s713396244"
] |
u498487134 | p02558 | python | s751151110 | s734235985 | 440 | 298 | 80,788 | 76,108 | Accepted | Accepted | 32.27 | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
################
class UnionFind():
"""
parents : 親要素(findしない場合は根ではないことの注意)，根の場合は"-(要素数）"
find(x):要素xの属するグループの根を返す
size(x):要素xの属するグループの要素数を返す
same(x,y):x,yが同じグループに属しているか返す
重いかも！ members(x):要素xが属するグループに属する要素をリストで返す
roots():全ての根の要素を返す
group_count():グループの数を返す
重いかも！ all_group_members():{根要素：[そのグループに含まれる要素のリスト]}の辞書を返す
"""
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
#根を探す&つなぎかえる
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
################
N,Q=MI()
uf=UnionFind(N)
for _ in range(Q):
t,u,v=MI()
if t==0:
uf.union(u,v)
else:
ans=0
if uf.same(u,v):
ans=1
print(ans)
main()
| import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
################
class UnionFind:
def __init__(self, N: int):
"""
N:要素数
root:各要素の親要素の番号を格納するリスト.
ただし, root[x] < 0 ならその頂点が根で-root[x]が木の要素数.
rank:ランク
"""
self.N = N
self.root = [-1] * N
self.rank = [0] * N
def __repr__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
def find(self, x: int) -> int:
"""頂点xの根を見つける"""
if self.root[x] < 0:
return x
else:
while self.root[x] >= 0:
x = self.root[x]
return x
def union(self, x: int, y: int) -> int:
"""x,yが属する木をunion"""
# 根を比較する
# すでに同じ木に属していた場合は何もしない.
# 違う木に属していた場合はrankを見てくっつける方を決める.
# rankが同じ時はrankを1増やす
x = self.find(x)
y = self.find(y)
if x == y:
return
elif self.rank[x] > self.rank[y]:
self.root[x] += self.root[y]
self.root[y] = x
else:
self.root[y] += self.root[x]
self.root[x] = y
if self.rank[x] == self.rank[y]:
self.rank[y] += 1
def same(self, x: int, y: int) -> bool:
"""xとyが同じグループに属するかどうか"""
return self.find(x) == self.find(y)
def count(self, x):
"""頂点xが属する木のサイズを返す"""
return - self.root[self.find(x)]
def members(self, x):
"""xが属する木の要素を列挙"""
_root = self.find(x)
return [i for i in range(self.N) if self.find == _root]
def roots(self):
"""森の根を列挙"""
return [i for i, x in enumerate(self.root) if x < 0]
def group_count(self):
"""連結成分の数"""
return len(self.roots())
def all_group_members(self):
"""{ルート要素: [そのグループに含まれる要素のリスト], ...}の辞書を返す"""
return {r: self.members(r) for r in self.roots()}
################
N,Q=MI()
uf=UnionFind(N)
for _ in range(Q):
t,u,v=MI()
if t==0:
uf.union(u,v)
else:
ans=0
if uf.same(u,v):
ans=1
print(ans)
main()
| 84 | 93 | 2,209 | 2,659 | import sys
input = sys.stdin.readline
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
def main():
################
class UnionFind:
"""
parents : 親要素(findしない場合は根ではないことの注意)，根の場合は"-(要素数）"
find(x):要素xの属するグループの根を返す
size(x):要素xの属するグループの要素数を返す
same(x,y):x,yが同じグループに属しているか返す
重いかも！ members(x):要素xが属するグループに属する要素をリストで返す
roots():全ての根の要素を返す
group_count():グループの数を返す
重いかも！ all_group_members():{根要素：[そのグループに含まれる要素のリスト]}の辞書を返す
"""
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
# 根を探す&つなぎかえる
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots())
################
N, Q = MI()
uf = UnionFind(N)
for _ in range(Q):
t, u, v = MI()
if t == 0:
uf.union(u, v)
else:
ans = 0
if uf.same(u, v):
ans = 1
print(ans)
main()
| import sys
input = sys.stdin.readline
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
def main():
################
class UnionFind:
def __init__(self, N: int):
"""
N:要素数
root:各要素の親要素の番号を格納するリスト.
ただし, root[x] < 0 ならその頂点が根で-root[x]が木の要素数.
rank:ランク
"""
self.N = N
self.root = [-1] * N
self.rank = [0] * N
def __repr__(self):
return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots())
def find(self, x: int) -> int:
"""頂点xの根を見つける"""
if self.root[x] < 0:
return x
else:
while self.root[x] >= 0:
x = self.root[x]
return x
def union(self, x: int, y: int) -> int:
"""x,yが属する木をunion"""
# 根を比較する
# すでに同じ木に属していた場合は何もしない.
# 違う木に属していた場合はrankを見てくっつける方を決める.
# rankが同じ時はrankを1増やす
x = self.find(x)
y = self.find(y)
if x == y:
return
elif self.rank[x] > self.rank[y]:
self.root[x] += self.root[y]
self.root[y] = x
else:
self.root[y] += self.root[x]
self.root[x] = y
if self.rank[x] == self.rank[y]:
self.rank[y] += 1
def same(self, x: int, y: int) -> bool:
"""xとyが同じグループに属するかどうか"""
return self.find(x) == self.find(y)
def count(self, x):
"""頂点xが属する木のサイズを返す"""
return -self.root[self.find(x)]
def members(self, x):
"""xが属する木の要素を列挙"""
_root = self.find(x)
return [i for i in range(self.N) if self.find == _root]
def roots(self):
"""森の根を列挙"""
return [i for i, x in enumerate(self.root) if x < 0]
def group_count(self):
"""連結成分の数"""
return len(self.roots())
def all_group_members(self):
"""{ルート要素: [そのグループに含まれる要素のリスト], ...}の辞書を返す"""
return {r: self.members(r) for r in self.roots()}
################
N, Q = MI()
uf = UnionFind(N)
for _ in range(Q):
t, u, v = MI()
if t == 0:
uf.union(u, v)
else:
ans = 0
if uf.same(u, v):
ans = 1
print(ans)
main()
| false | 9.677419 | [
"- \"\"\"",
"- parents : 親要素(findしない場合は根ではないことの注意)，根の場合は\"-(要素数）\"",
"- find(x):要素xの属するグループの根を返す",
"- size(x):要素xの属するグループの要素数を返す",
"- same(x,y):x,yが同じグループに属しているか返す",
"- 重いかも！ members(x):要素xが属するグループに属する要素をリストで返す",
"- roots():全ての根の要素を返す",
"- group_count():グループの数を返す",
"- 重いかも！ all_group_members():{根要素：[そのグループに含まれる要素のリスト]}の辞書を返す",
"- \"\"\"",
"+ def __init__(self, N: int):",
"+ \"\"\"",
"+ N:要素数",
"+ root:各要素の親要素の番号を格納するリスト.",
"+ ただし, root[x] < 0 ならその頂点が根で-root[x]が木の要素数.",
"+ rank:ランク",
"+ \"\"\"",
"+ self.N = N",
"+ self.root = [-1] * N",
"+ self.rank = [0] * N",
"- def __init__(self, n):",
"- self.n = n",
"- self.parents = [-1] * n",
"+ def __repr__(self):",
"+ return \"\\n\".join(\"{}: {}\".format(r, self.members(r)) for r in self.roots())",
"- def find(self, x):",
"- # 根を探す&つなぎかえる",
"- if self.parents[x] < 0:",
"+ def find(self, x: int) -> int:",
"+ \"\"\"頂点xの根を見つける\"\"\"",
"+ if self.root[x] < 0:",
"- self.parents[x] = self.find(self.parents[x])",
"- return self.parents[x]",
"+ while self.root[x] >= 0:",
"+ x = self.root[x]",
"+ return x",
"- def union(self, x, y):",
"+ def union(self, x: int, y: int) -> int:",
"+ \"\"\"x,yが属する木をunion\"\"\"",
"+ # 根を比較する",
"+ # すでに同じ木に属していた場合は何もしない.",
"+ # 違う木に属していた場合はrankを見てくっつける方を決める.",
"+ # rankが同じ時はrankを1増やす",
"- if self.parents[x] > self.parents[y]:",
"- x, y = y, x",
"- self.parents[x] += self.parents[y]",
"- self.parents[y] = x",
"+ elif self.rank[x] > self.rank[y]:",
"+ self.root[x] += self.root[y]",
"+ self.root[y] = x",
"+ else:",
"+ self.root[y] += self.root[x]",
"+ self.root[x] = y",
"+ if self.rank[x] == self.rank[y]:",
"+ self.rank[y] += 1",
"- def size(self, x):",
"- return -self.parents[self.find(x)]",
"-",
"- def same(self, x, y):",
"+ def same(self, x: int, y: int) -> bool:",
"+ \"\"\"xとyが同じグループに属するかどうか\"\"\"",
"+ def count(self, x):",
"+ \"\"\"頂点xが属する木のサイズを返す\"\"\"",
"+ return -self.root[self.find(x)]",
"+",
"- root = self.find(x)",
"- return [i for i in range(self.n) if self.find(i) == root]",
"+ \"\"\"xが属する木の要素を列挙\"\"\"",
"+ _root = self.find(x)",
"+ return [i for i in range(self.N) if self.find == _root]",
"- return [i for i, x in enumerate(self.parents) if x < 0]",
"+ \"\"\"森の根を列挙\"\"\"",
"+ return [i for i, x in enumerate(self.root) if x < 0]",
"+ \"\"\"連結成分の数\"\"\"",
"+ \"\"\"{ルート要素: [そのグループに含まれる要素のリスト], ...}の辞書を返す\"\"\"",
"-",
"- def __str__(self):",
"- return \"\\n\".join(\"{}: {}\".format(r, self.members(r)) for r in self.roots())"
] | false | 0.12668 | 0.171437 | 0.738931 | [
"s751151110",
"s734235985"
] |
u510829608 | p02288 | python | s973951084 | s884793120 | 1,280 | 920 | 82,336 | 65,868 | Accepted | Accepted | 28.12 | import heapq
N = int(input())
H = list(map(int, input().split()))
ans = []
a = [(-x, x) for x in H]
heapq.heapify(a)
for i in range(N):
print(" {}".format(a[i][1]), end = "")
print()
| H = int(input())
A = list(map(int, input().split()))
def MaxHeapify(a, i):
li, ri = 2*i+1, 2*i+2
if li < H and a[li] > a[i]:
largest = li
else:
largest = i
if ri < H and a[ri] > a[largest]:
largest = ri
if a[largest] > a[i]:
a[i], a[largest] = a[largest], a[i]
MaxHeapify(a, largest)
def BuildMaxHeap(a):
for i in range(H//2, -1, -1):
MaxHeapify(a, i)
BuildMaxHeap(A)
print(' ', end='')
print(*A)
| 12 | 25 | 200 | 523 | import heapq
N = int(input())
H = list(map(int, input().split()))
ans = []
a = [(-x, x) for x in H]
heapq.heapify(a)
for i in range(N):
print(" {}".format(a[i][1]), end="")
print()
| H = int(input())
A = list(map(int, input().split()))
def MaxHeapify(a, i):
li, ri = 2 * i + 1, 2 * i + 2
if li < H and a[li] > a[i]:
largest = li
else:
largest = i
if ri < H and a[ri] > a[largest]:
largest = ri
if a[largest] > a[i]:
a[i], a[largest] = a[largest], a[i]
MaxHeapify(a, largest)
def BuildMaxHeap(a):
for i in range(H // 2, -1, -1):
MaxHeapify(a, i)
BuildMaxHeap(A)
print(" ", end="")
print(*A)
| false | 52 | [
"-import heapq",
"+H = int(input())",
"+A = list(map(int, input().split()))",
"-N = int(input())",
"-H = list(map(int, input().split()))",
"-ans = []",
"-a = [(-x, x) for x in H]",
"-heapq.heapify(a)",
"-for i in range(N):",
"- print(\" {}\".format(a[i][1]), end=\"\")",
"-print()",
"+",
"+def MaxHeapify(a, i):",
"+ li, ri = 2 * i + 1, 2 * i + 2",
"+ if li < H and a[li] > a[i]:",
"+ largest = li",
"+ else:",
"+ largest = i",
"+ if ri < H and a[ri] > a[largest]:",
"+ largest = ri",
"+ if a[largest] > a[i]:",
"+ a[i], a[largest] = a[largest], a[i]",
"+ MaxHeapify(a, largest)",
"+",
"+",
"+def BuildMaxHeap(a):",
"+ for i in range(H // 2, -1, -1):",
"+ MaxHeapify(a, i)",
"+",
"+",
"+BuildMaxHeap(A)",
"+print(\" \", end=\"\")",
"+print(*A)"
] | false | 0.038003 | 0.069002 | 0.550761 | [
"s973951084",
"s884793120"
] |
u386170566 | p02786 | python | s991687459 | s219572322 | 25 | 20 | 2,940 | 3,188 | Accepted | Accepted | 20 | import math
i = int(eval(input()))
c = 1
while i > 1:
i = i//2
c += 1
print((2**c-1)) | #D
import math
i = int(eval(input()))
low = 0
high = 45
for _ in range(100):
l = 2**low
h = 2**high
m = 2**((low+high)/2)
if i < m:
high = (low+high)/2
else:
low = (low+high)/2
#print(low,high)
tmp = math.floor(high) + 1
print(((2**tmp)-1)) | 7 | 16 | 91 | 283 | import math
i = int(eval(input()))
c = 1
while i > 1:
i = i // 2
c += 1
print((2**c - 1))
| # D
import math
i = int(eval(input()))
low = 0
high = 45
for _ in range(100):
l = 2**low
h = 2**high
m = 2 ** ((low + high) / 2)
if i < m:
high = (low + high) / 2
else:
low = (low + high) / 2
# print(low,high)
tmp = math.floor(high) + 1
print(((2**tmp) - 1))
| false | 56.25 | [
"+# D",
"-c = 1",
"-while i > 1:",
"- i = i // 2",
"- c += 1",
"-print((2**c - 1))",
"+low = 0",
"+high = 45",
"+for _ in range(100):",
"+ l = 2**low",
"+ h = 2**high",
"+ m = 2 ** ((low + high) / 2)",
"+ if i < m:",
"+ high = (low + high) / 2",
"+ else:",
"+ low = (low + high) / 2",
"+# print(low,high)",
"+tmp = math.floor(high) + 1",
"+print(((2**tmp) - 1))"
] | false | 0.096949 | 0.047232 | 2.052639 | [
"s991687459",
"s219572322"
] |
u436519884 | p03167 | python | s614889779 | s873611936 | 1,303 | 1,163 | 417,252 | 380,944 | Accepted | Accepted | 10.74 | import sys
sys.setrecursionlimit(10**9)
mod=10**9+7
m,n=list(map(int,input().split()))
grid=[list(eval(input())) for _ in range(m)]
cache={}
def dp(i,j):
if i<0 or j<0 or i>=len(grid) or j>=len(grid[0]) or grid[i][j]=='#':
return 0
elif (i,j) in cache:
return cache[(i,j)]
elif i==m-1 and j==n-1:
return 1
cache[(i,j)]=dp(i+1,j)+dp(i,j+1)
return cache[(i,j)]
print((dp(0,0)%mod))
| import sys
sys.setrecursionlimit(10**9)
mod=10**9+7
m,n=list(map(int,input().split()))
grid=[eval(input()) for _ in range(m)]
cache={}
def dp(i,j):
if i<0 or j<0 or i>=len(grid) or j>=len(grid[0]) or grid[i][j]=='#':
return 0
elif (i,j) in cache:
return cache[(i,j)]
elif i==m-1 and j==n-1:
return 1
cache[(i,j)]=dp(i+1,j)+dp(i,j+1)
return cache[(i,j)]
print((dp(0,0)%mod))
| 18 | 18 | 409 | 403 | import sys
sys.setrecursionlimit(10**9)
mod = 10**9 + 7
m, n = list(map(int, input().split()))
grid = [list(eval(input())) for _ in range(m)]
cache = {}
def dp(i, j):
if i < 0 or j < 0 or i >= len(grid) or j >= len(grid[0]) or grid[i][j] == "#":
return 0
elif (i, j) in cache:
return cache[(i, j)]
elif i == m - 1 and j == n - 1:
return 1
cache[(i, j)] = dp(i + 1, j) + dp(i, j + 1)
return cache[(i, j)]
print((dp(0, 0) % mod))
| import sys
sys.setrecursionlimit(10**9)
mod = 10**9 + 7
m, n = list(map(int, input().split()))
grid = [eval(input()) for _ in range(m)]
cache = {}
def dp(i, j):
if i < 0 or j < 0 or i >= len(grid) or j >= len(grid[0]) or grid[i][j] == "#":
return 0
elif (i, j) in cache:
return cache[(i, j)]
elif i == m - 1 and j == n - 1:
return 1
cache[(i, j)] = dp(i + 1, j) + dp(i, j + 1)
return cache[(i, j)]
print((dp(0, 0) % mod))
| false | 0 | [
"-grid = [list(eval(input())) for _ in range(m)]",
"+grid = [eval(input()) for _ in range(m)]"
] | false | 0.072202 | 0.044422 | 1.625359 | [
"s614889779",
"s873611936"
] |
u624475441 | p03339 | python | s215419537 | s454984904 | 161 | 107 | 3,700 | 3,676 | Accepted | Accepted | 33.54 | eval(input())
S = eval(input())
res = cnt = S.count('E')
for c in S:
cnt -= c == 'E'
res = min(res, cnt)
cnt += c == 'W'
print(res) | eval(input())
S = eval(input())
res = cnt = S.count('E')
for c in S:
if c == 'E':
cnt -= 1
res = min(res, cnt)
else:
cnt += 1
print(res) | 8 | 10 | 138 | 165 | eval(input())
S = eval(input())
res = cnt = S.count("E")
for c in S:
cnt -= c == "E"
res = min(res, cnt)
cnt += c == "W"
print(res)
| eval(input())
S = eval(input())
res = cnt = S.count("E")
for c in S:
if c == "E":
cnt -= 1
res = min(res, cnt)
else:
cnt += 1
print(res)
| false | 20 | [
"- cnt -= c == \"E\"",
"- res = min(res, cnt)",
"- cnt += c == \"W\"",
"+ if c == \"E\":",
"+ cnt -= 1",
"+ res = min(res, cnt)",
"+ else:",
"+ cnt += 1"
] | false | 0.044403 | 0.048452 | 0.916438 | [
"s215419537",
"s454984904"
] |
u885634168 | p02990 | python | s444862663 | s322557881 | 134 | 113 | 69,644 | 75,520 | Accepted | Accepted | 15.67 | from functools import reduce
def cin(): return list(map(int,input().split()))
def cmb(n, r):
INF = 10 ** 9 + 7
r = min(n - r, r)
if r == 0: return 1
numer = reduce(lambda x, y: (x * y) % INF, list(range(n, n - r, -1)))
denom = reduce(lambda x, y: (x * y) % INF, list(range(1, r + 1)))
return (numer * pow(denom, INF - 2, INF)) % INF
def nHr(n, r):
if n == 0: return 1
return cmb(n + r - 1, n)
N, K = cin()
INF = 10 ** 9 + 7
ans = [N - K + 1]
for i in range(2, K + 1):
b = nHr(K - i, i)
cnt = 0
tmp = N - K - (i + 1)
if tmp >= 0:
cnt += b * nHr(tmp, i + 1)
cnt %= INF
tmp += 1
if tmp >= 0:
cnt += 2 * b * nHr(tmp, i)
cnt %= INF
tmp += 1
if tmp >= 0:
cnt += nHr(tmp, i - 1) * b
cnt %= INF
ans.append(cnt)
for i in range(K): print((ans[i])) | from functools import reduce
def cin(): return list(map(int,input().split()))
def cmb(n, r):
INF = 10 ** 9 + 7
r = min(n - r, r)
if r == 0: return 1
numer = reduce(lambda x, y: (x * y) % INF, list(range(n, n - r, -1)))
denom = reduce(lambda x, y: (x * y) % INF, list(range(1, r + 1)))
return (numer * pow(denom, INF - 2, INF)) % INF
def nHr(n, r):
if n == 0: return 1
return cmb(n + r - 1, n)
INF = 10 ** 9 + 7
N, K = cin()
ans = [N - K + 1]
for i in range(2, K + 1):
if N - K + 1 >= i: cnt = cmb(N - K + 1, i) * nHr(K - i, i)
else: cnt = 0
ans.append(cnt % INF)
for i in range(K): print((ans[i])) | 39 | 26 | 890 | 666 | from functools import reduce
def cin():
return list(map(int, input().split()))
def cmb(n, r):
INF = 10**9 + 7
r = min(n - r, r)
if r == 0:
return 1
numer = reduce(lambda x, y: (x * y) % INF, list(range(n, n - r, -1)))
denom = reduce(lambda x, y: (x * y) % INF, list(range(1, r + 1)))
return (numer * pow(denom, INF - 2, INF)) % INF
def nHr(n, r):
if n == 0:
return 1
return cmb(n + r - 1, n)
N, K = cin()
INF = 10**9 + 7
ans = [N - K + 1]
for i in range(2, K + 1):
b = nHr(K - i, i)
cnt = 0
tmp = N - K - (i + 1)
if tmp >= 0:
cnt += b * nHr(tmp, i + 1)
cnt %= INF
tmp += 1
if tmp >= 0:
cnt += 2 * b * nHr(tmp, i)
cnt %= INF
tmp += 1
if tmp >= 0:
cnt += nHr(tmp, i - 1) * b
cnt %= INF
ans.append(cnt)
for i in range(K):
print((ans[i]))
| from functools import reduce
def cin():
return list(map(int, input().split()))
def cmb(n, r):
INF = 10**9 + 7
r = min(n - r, r)
if r == 0:
return 1
numer = reduce(lambda x, y: (x * y) % INF, list(range(n, n - r, -1)))
denom = reduce(lambda x, y: (x * y) % INF, list(range(1, r + 1)))
return (numer * pow(denom, INF - 2, INF)) % INF
def nHr(n, r):
if n == 0:
return 1
return cmb(n + r - 1, n)
INF = 10**9 + 7
N, K = cin()
ans = [N - K + 1]
for i in range(2, K + 1):
if N - K + 1 >= i:
cnt = cmb(N - K + 1, i) * nHr(K - i, i)
else:
cnt = 0
ans.append(cnt % INF)
for i in range(K):
print((ans[i]))
| false | 33.333333 | [
"+INF = 10**9 + 7",
"-INF = 10**9 + 7",
"- b = nHr(K - i, i)",
"- cnt = 0",
"- tmp = N - K - (i + 1)",
"- if tmp >= 0:",
"- cnt += b * nHr(tmp, i + 1)",
"- cnt %= INF",
"- tmp += 1",
"- if tmp >= 0:",
"- cnt += 2 * b * nHr(tmp, i)",
"- cnt %= INF",
"- tmp += 1",
"- if tmp >= 0:",
"- cnt += nHr(tmp, i - 1) * b",
"- cnt %= INF",
"- ans.append(cnt)",
"+ if N - K + 1 >= i:",
"+ cnt = cmb(N - K + 1, i) * nHr(K - i, i)",
"+ else:",
"+ cnt = 0",
"+ ans.append(cnt % INF)"
] | false | 0.052535 | 0.039796 | 1.320103 | [
"s444862663",
"s322557881"
] |
u949517845 | p02275 | python | s204043874 | s224292442 | 2,300 | 1,620 | 244,520 | 242,152 | Accepted | Accepted | 29.57 | # -*- coding:utf-8 -*-
def countingSort(A, B, k, n):
C = [0] * (k+1)
for i in range(1, n + 1):
C[A[i]] += 1
for j in range(1, k + 1):
C[j] = C[j] + C[j - 1]
for j in range(n, 0, -1):
B[C[A[j]]] = A[j]
C[A[j]] -= 1
if __name__ == "__main__":
n = int(eval(input()))
lst = [int(val) for val in input().split()]
lst.insert(0, 0)
result = [0] * (n + 1)
k = max(lst)
countingSort(lst, result, k, n)
result.pop(0)
print((" ".join([str(val) for val in result]))) | # -*- coding:utf-8 -*-
def countingSort(lst, n):
cnt_lst = [0] * (max(lst)+1)
for i in range(0, n):
cnt_lst[lst[i]] += 1
i = 0
result = []
for j, cnt in enumerate(cnt_lst):
for _ in range(0, cnt):
result.append(j)
return result
if __name__ == "__main__":
n = int(eval(input()))
lst = [int(val) for val in input().split()]
result = countingSort(lst, n)
print((" ".join([str(val) for val in result]))) | 26 | 22 | 558 | 486 | # -*- coding:utf-8 -*-
def countingSort(A, B, k, n):
C = [0] * (k + 1)
for i in range(1, n + 1):
C[A[i]] += 1
for j in range(1, k + 1):
C[j] = C[j] + C[j - 1]
for j in range(n, 0, -1):
B[C[A[j]]] = A[j]
C[A[j]] -= 1
if __name__ == "__main__":
n = int(eval(input()))
lst = [int(val) for val in input().split()]
lst.insert(0, 0)
result = [0] * (n + 1)
k = max(lst)
countingSort(lst, result, k, n)
result.pop(0)
print((" ".join([str(val) for val in result])))
| # -*- coding:utf-8 -*-
def countingSort(lst, n):
cnt_lst = [0] * (max(lst) + 1)
for i in range(0, n):
cnt_lst[lst[i]] += 1
i = 0
result = []
for j, cnt in enumerate(cnt_lst):
for _ in range(0, cnt):
result.append(j)
return result
if __name__ == "__main__":
n = int(eval(input()))
lst = [int(val) for val in input().split()]
result = countingSort(lst, n)
print((" ".join([str(val) for val in result])))
| false | 15.384615 | [
"-def countingSort(A, B, k, n):",
"- C = [0] * (k + 1)",
"- for i in range(1, n + 1):",
"- C[A[i]] += 1",
"- for j in range(1, k + 1):",
"- C[j] = C[j] + C[j - 1]",
"- for j in range(n, 0, -1):",
"- B[C[A[j]]] = A[j]",
"- C[A[j]] -= 1",
"+def countingSort(lst, n):",
"+ cnt_lst = [0] * (max(lst) + 1)",
"+ for i in range(0, n):",
"+ cnt_lst[lst[i]] += 1",
"+ i = 0",
"+ result = []",
"+ for j, cnt in enumerate(cnt_lst):",
"+ for _ in range(0, cnt):",
"+ result.append(j)",
"+ return result",
"- lst.insert(0, 0)",
"- result = [0] * (n + 1)",
"- k = max(lst)",
"- countingSort(lst, result, k, n)",
"- result.pop(0)",
"+ result = countingSort(lst, n)"
] | false | 0.03629 | 0.058699 | 0.618239 | [
"s204043874",
"s224292442"
] |
u186838327 | p03848 | python | s865175323 | s225291238 | 219 | 105 | 52,716 | 93,024 | Accepted | Accepted | 52.05 | n = int(eval(input()))
A = list(map(int, input().split()))
mod = 10**9+7
if n%2 == 1:
m = (n+1)//2
l =[0]*m
for i in range(n):
if (n-A[i]-1)%2 != 0:
print((0))
exit()
else:
id = (n-A[i]-1)//2
l[id] += 1
#print(l)
ans = 1
for i in range(m):
#print(i, ans)
if i != m -1:
if l[i] != 2:
print((0))
exit()
else:
ans *= l[i]
ans %= mod
else:
if l[i] != 1:
print((0))
exit()
else:
ans *= l[i]
ans %= mod
print(ans)
else:
m = n//2
l =[0]*m
for i in range(n):
if (n-A[i]-1)%2 != 0:
print((0))
exit()
else:
id = (n-A[i]-1)//2
l[id] += 1
#print(l)
ans = 1
for i in range(m):
#print(i, ans)
if l[i] != 2:
print((0))
exit()
else:
ans *= l[i]
ans %= mod
print(ans) | n = int(eval(input()))
A = list(map(int, input().split()))
mod = 10**9+7
def power(a, n, mod):
bi=str(format(n,"b")) #2進数
res=1
for i in range(len(bi)):
res=(res*res) %mod
if bi[i]=="1":
res=(res*a) %mod
return res
from collections import Counter
if n%2 == 0:
C = Counter(A)
for i in range(1, n+1):
if i%2 == 0:
continue
else:
if C[i] != 2:
print((0))
exit()
else:
print((power(2, n//2, mod)))
else:
C = Counter(A)
for i in range(1, n+1):
if i == 0:
if C[i] != 1:
print((0))
exit()
elif i%2 == 1:
continue
else:
if C[i] != 2:
print((0))
exit()
else:
print((power(2, n//2, mod)))
| 55 | 42 | 1,146 | 888 | n = int(eval(input()))
A = list(map(int, input().split()))
mod = 10**9 + 7
if n % 2 == 1:
m = (n + 1) // 2
l = [0] * m
for i in range(n):
if (n - A[i] - 1) % 2 != 0:
print((0))
exit()
else:
id = (n - A[i] - 1) // 2
l[id] += 1
# print(l)
ans = 1
for i in range(m):
# print(i, ans)
if i != m - 1:
if l[i] != 2:
print((0))
exit()
else:
ans *= l[i]
ans %= mod
else:
if l[i] != 1:
print((0))
exit()
else:
ans *= l[i]
ans %= mod
print(ans)
else:
m = n // 2
l = [0] * m
for i in range(n):
if (n - A[i] - 1) % 2 != 0:
print((0))
exit()
else:
id = (n - A[i] - 1) // 2
l[id] += 1
# print(l)
ans = 1
for i in range(m):
# print(i, ans)
if l[i] != 2:
print((0))
exit()
else:
ans *= l[i]
ans %= mod
print(ans)
| n = int(eval(input()))
A = list(map(int, input().split()))
mod = 10**9 + 7
def power(a, n, mod):
bi = str(format(n, "b")) # 2進数
res = 1
for i in range(len(bi)):
res = (res * res) % mod
if bi[i] == "1":
res = (res * a) % mod
return res
from collections import Counter
if n % 2 == 0:
C = Counter(A)
for i in range(1, n + 1):
if i % 2 == 0:
continue
else:
if C[i] != 2:
print((0))
exit()
else:
print((power(2, n // 2, mod)))
else:
C = Counter(A)
for i in range(1, n + 1):
if i == 0:
if C[i] != 1:
print((0))
exit()
elif i % 2 == 1:
continue
else:
if C[i] != 2:
print((0))
exit()
else:
print((power(2, n // 2, mod)))
| false | 23.636364 | [
"-if n % 2 == 1:",
"- m = (n + 1) // 2",
"- l = [0] * m",
"- for i in range(n):",
"- if (n - A[i] - 1) % 2 != 0:",
"- print((0))",
"- exit()",
"+",
"+",
"+def power(a, n, mod):",
"+ bi = str(format(n, \"b\")) # 2進数",
"+ res = 1",
"+ for i in range(len(bi)):",
"+ res = (res * res) % mod",
"+ if bi[i] == \"1\":",
"+ res = (res * a) % mod",
"+ return res",
"+",
"+",
"+from collections import Counter",
"+",
"+if n % 2 == 0:",
"+ C = Counter(A)",
"+ for i in range(1, n + 1):",
"+ if i % 2 == 0:",
"+ continue",
"- id = (n - A[i] - 1) // 2",
"- l[id] += 1",
"- # print(l)",
"- ans = 1",
"- for i in range(m):",
"- # print(i, ans)",
"- if i != m - 1:",
"- if l[i] != 2:",
"+ if C[i] != 2:",
"- else:",
"- ans *= l[i]",
"- ans %= mod",
"- else:",
"- if l[i] != 1:",
"+ else:",
"+ print((power(2, n // 2, mod)))",
"+else:",
"+ C = Counter(A)",
"+ for i in range(1, n + 1):",
"+ if i == 0:",
"+ if C[i] != 1:",
"- else:",
"- ans *= l[i]",
"- ans %= mod",
"- print(ans)",
"-else:",
"- m = n // 2",
"- l = [0] * m",
"- for i in range(n):",
"- if (n - A[i] - 1) % 2 != 0:",
"- print((0))",
"- exit()",
"+ elif i % 2 == 1:",
"+ continue",
"- id = (n - A[i] - 1) // 2",
"- l[id] += 1",
"- # print(l)",
"- ans = 1",
"- for i in range(m):",
"- # print(i, ans)",
"- if l[i] != 2:",
"- print((0))",
"- exit()",
"- else:",
"- ans *= l[i]",
"- ans %= mod",
"- print(ans)",
"+ if C[i] != 2:",
"+ print((0))",
"+ exit()",
"+ else:",
"+ print((power(2, n // 2, mod)))"
] | false | 0.083218 | 0.117671 | 0.70721 | [
"s865175323",
"s225291238"
] |
u489959379 | p02695 | python | s992638361 | s137034230 | 683 | 604 | 9,168 | 9,276 | Accepted | Accepted | 11.57 | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
ans = 0
def resolve():
n, m, q = list(map(int, input().split()))
ABCD = [list(map(int, input().split())) for _ in range(q)]
A = [0] * n
def dfs(idx):
global ans
if idx == n:
score = 0
for i in range(q):
a, b, c, d = ABCD[i]
if A[b - 1] - A[a - 1] == c:
score += d
ans = max(ans, score)
else:
if idx == 0:
k = 1
else:
k = A[idx - 1]
for i in range(k, m + 1):
A[idx] = i
dfs(idx + 1)
dfs(0)
print(ans)
if __name__ == '__main__':
resolve()
| # https://atcoder.jp/contests/abc165/tasks/abc165_c
# C - Many Requirements
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, m, q = list(map(int, input().split()))
ABCD = [list(map(int, input().split())) for _ in range(q)]
# 数列Aのスコアを返す
def calc_score(L):
score = 0
for a, b, c, d in ABCD:
if L[b - 1] - L[a - 1] == c:
score += d
return score
# 数列Aを全パターン試す
def dfs(A):
if len(A) == n:
return calc_score(A)
res = 0
prev = A[-1] if len(A) > 0 else 1
for v in range(prev, m + 1):
A.append(v)
res = max(res, dfs(A))
A.pop()
return res
print((dfs([])))
if __name__ == '__main__':
resolve()
| 39 | 40 | 799 | 847 | import sys
sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7
ans = 0
def resolve():
n, m, q = list(map(int, input().split()))
ABCD = [list(map(int, input().split())) for _ in range(q)]
A = [0] * n
def dfs(idx):
global ans
if idx == n:
score = 0
for i in range(q):
a, b, c, d = ABCD[i]
if A[b - 1] - A[a - 1] == c:
score += d
ans = max(ans, score)
else:
if idx == 0:
k = 1
else:
k = A[idx - 1]
for i in range(k, m + 1):
A[idx] = i
dfs(idx + 1)
dfs(0)
print(ans)
if __name__ == "__main__":
resolve()
| # https://atcoder.jp/contests/abc165/tasks/abc165_c
# C - Many Requirements
import sys
sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7
def resolve():
n, m, q = list(map(int, input().split()))
ABCD = [list(map(int, input().split())) for _ in range(q)]
# 数列Aのスコアを返す
def calc_score(L):
score = 0
for a, b, c, d in ABCD:
if L[b - 1] - L[a - 1] == c:
score += d
return score
# 数列Aを全パターン試す
def dfs(A):
if len(A) == n:
return calc_score(A)
res = 0
prev = A[-1] if len(A) > 0 else 1
for v in range(prev, m + 1):
A.append(v)
res = max(res, dfs(A))
A.pop()
return res
print((dfs([])))
if __name__ == "__main__":
resolve()
| false | 2.5 | [
"+# https://atcoder.jp/contests/abc165/tasks/abc165_c",
"+# C - Many Requirements",
"-ans = 0",
"- A = [0] * n",
"+ # 数列Aのスコアを返す",
"+ def calc_score(L):",
"+ score = 0",
"+ for a, b, c, d in ABCD:",
"+ if L[b - 1] - L[a - 1] == c:",
"+ score += d",
"+ return score",
"- def dfs(idx):",
"- global ans",
"- if idx == n:",
"- score = 0",
"- for i in range(q):",
"- a, b, c, d = ABCD[i]",
"- if A[b - 1] - A[a - 1] == c:",
"- score += d",
"- ans = max(ans, score)",
"- else:",
"- if idx == 0:",
"- k = 1",
"- else:",
"- k = A[idx - 1]",
"- for i in range(k, m + 1):",
"- A[idx] = i",
"- dfs(idx + 1)",
"+ # 数列Aを全パターン試す",
"+ def dfs(A):",
"+ if len(A) == n:",
"+ return calc_score(A)",
"+ res = 0",
"+ prev = A[-1] if len(A) > 0 else 1",
"+ for v in range(prev, m + 1):",
"+ A.append(v)",
"+ res = max(res, dfs(A))",
"+ A.pop()",
"+ return res",
"- dfs(0)",
"- print(ans)",
"+ print((dfs([])))"
] | false | 0.111883 | 0.069523 | 1.609297 | [
"s992638361",
"s137034230"
] |
u488127128 | p03827 | python | s586630380 | s329919640 | 21 | 17 | 3,060 | 2,940 | Accepted | Accepted | 19.05 | n = int(eval(input()))
S = eval(input())
x = 0
ans = 0
for s in S:
if s=='I':
x += 1
else:
x -= 1
ans = max(x,ans)
print(ans) | n = int(eval(input()))
S = eval(input())
x = 0
ans = 0
for s in S:
if s=='I':
x += 1
ans = max(x,ans)
else:
x -= 1
print(ans) | 11 | 11 | 151 | 155 | n = int(eval(input()))
S = eval(input())
x = 0
ans = 0
for s in S:
if s == "I":
x += 1
else:
x -= 1
ans = max(x, ans)
print(ans)
| n = int(eval(input()))
S = eval(input())
x = 0
ans = 0
for s in S:
if s == "I":
x += 1
ans = max(x, ans)
else:
x -= 1
print(ans)
| false | 0 | [
"+ ans = max(x, ans)",
"- ans = max(x, ans)"
] | false | 0.037277 | 0.098781 | 0.37737 | [
"s586630380",
"s329919640"
] |
u887207211 | p03846 | python | s165500157 | s592687354 | 83 | 45 | 13,880 | 13,876 | Accepted | Accepted | 45.78 | N = int(eval(input()))
A = sorted(list(map(int,input().split())))
mod = 10**9+7
if(N%2 == 0 and len(set(A)) == N//2):
print((2**(N//2) % mod))
elif(N%2 != 0 and A.count(0) == 1):
print((2**((N-1)//2) % mod))
else:
print((0)) | import sys
stdin = sys.stdin
ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : list(map(int, stdin.readline().split()))
def main():
n = ni()
a = na()
mod = int(1e9+7)
if n % 2 == 0 and len(set(a)) == n // 2:
print((2 ** (n // 2) % mod))
elif n % 2 == 1 and a.count(0) == 1:
print((2 ** ((n - 1) // 2) % mod))
else:
print((0))
main() | 10 | 20 | 228 | 401 | N = int(eval(input()))
A = sorted(list(map(int, input().split())))
mod = 10**9 + 7
if N % 2 == 0 and len(set(A)) == N // 2:
print((2 ** (N // 2) % mod))
elif N % 2 != 0 and A.count(0) == 1:
print((2 ** ((N - 1) // 2) % mod))
else:
print((0))
| import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
def main():
n = ni()
a = na()
mod = int(1e9 + 7)
if n % 2 == 0 and len(set(a)) == n // 2:
print((2 ** (n // 2) % mod))
elif n % 2 == 1 and a.count(0) == 1:
print((2 ** ((n - 1) // 2) % mod))
else:
print((0))
main()
| false | 50 | [
"-N = int(eval(input()))",
"-A = sorted(list(map(int, input().split())))",
"-mod = 10**9 + 7",
"-if N % 2 == 0 and len(set(A)) == N // 2:",
"- print((2 ** (N // 2) % mod))",
"-elif N % 2 != 0 and A.count(0) == 1:",
"- print((2 ** ((N - 1) // 2) % mod))",
"-else:",
"- print((0))",
"+import sys",
"+",
"+stdin = sys.stdin",
"+ns = lambda: stdin.readline().rstrip()",
"+ni = lambda: int(ns())",
"+na = lambda: list(map(int, stdin.readline().split()))",
"+",
"+",
"+def main():",
"+ n = ni()",
"+ a = na()",
"+ mod = int(1e9 + 7)",
"+ if n % 2 == 0 and len(set(a)) == n // 2:",
"+ print((2 ** (n // 2) % mod))",
"+ elif n % 2 == 1 and a.count(0) == 1:",
"+ print((2 ** ((n - 1) // 2) % mod))",
"+ else:",
"+ print((0))",
"+",
"+",
"+main()"
] | false | 0.060745 | 0.037009 | 1.641341 | [
"s165500157",
"s592687354"
] |
u588341295 | p03634 | python | s007303090 | s029838523 | 790 | 711 | 84,912 | 131,760 | Accepted | Accepted | 10 | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
from heapq import heappop, heappush
# 今回はダイクストラするので、データの持ち方は隣接リスト
N = int(eval(input()))
nodes = [[] for _ in range(N+1)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
# nodes[出発ノード](到着ノード, コスト))
nodes[a].append((b, c))
# 無向グラフなのでこっちも入れる
nodes[b].append((a, c))
def dijkstra(nodes, start):
# 最短距離メモ
memo = [float('inf')] * (len(nodes))
# スタート位置
que = [(0, start)]
memo[start] = 0
# キューが空になるまで
while len(que) != 0:
# startからの距離, 現在のノード
dist, cur = heappop(que)
# 出発ノードcurの到着ノードでループ
for nxt, cost in nodes[cur]:
# 今回の経路のが短い時
if memo[cur] + cost < memo[nxt]:
memo[nxt] = memo[cur] + cost
# 現在の移動距離をキューの優先度として、早い方から先に処理するようにする
heappush(que, (memo[nxt], nxt))
# ノードstartからの最短距離リストを返却
return memo
Q, K = list(map(int, input().split()))
# 引数：(ノードの隣接リスト, 出発ノード)
memo = dijkstra(nodes, K)
for i in range(Q):
x, y = list(map(int, input().split()))
# 今回は全てKを経由するので、Kからの距離さえ分かれば全部出る
print((memo[x] + memo[y]))
| # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
# 再帰呼び出しの回数制限(デフォルト1000)
sys.setrecursionlimit(10 ** 9)
N = int(eval(input()))
nodes = [[] for _ in range(N+1)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
# nodes[出発ノード](到着ノード, コスト))
nodes[a].append((b, c))
# 無向グラフなのでこっちも入れる
nodes[b].append((a, c))
memo = [0] * (N+1)
def dfs(cur, prev, dist):
memo[cur] = dist
for nxt, cost in nodes[cur]:
if nxt == prev:
continue
dfs(nxt, cur, dist+cost)
Q, K = list(map(int, input().split()))
dfs(K, -1, 0)
for i in range(Q):
x, y = list(map(int, input().split()))
# 今回は全てKを経由するので、Kからの距離さえ分かれば全部出る
print((memo[x] + memo[y]))
| 45 | 32 | 1,199 | 744 | # -*- coding: utf-8 -*-
import sys
def input():
return sys.stdin.readline().strip()
from heapq import heappop, heappush
# 今回はダイクストラするので、データの持ち方は隣接リスト
N = int(eval(input()))
nodes = [[] for _ in range(N + 1)]
for i in range(N - 1):
a, b, c = list(map(int, input().split()))
# nodes[出発ノード](到着ノード, コスト))
nodes[a].append((b, c))
# 無向グラフなのでこっちも入れる
nodes[b].append((a, c))
def dijkstra(nodes, start):
# 最短距離メモ
memo = [float("inf")] * (len(nodes))
# スタート位置
que = [(0, start)]
memo[start] = 0
# キューが空になるまで
while len(que) != 0:
# startからの距離, 現在のノード
dist, cur = heappop(que)
# 出発ノードcurの到着ノードでループ
for nxt, cost in nodes[cur]:
# 今回の経路のが短い時
if memo[cur] + cost < memo[nxt]:
memo[nxt] = memo[cur] + cost
# 現在の移動距離をキューの優先度として、早い方から先に処理するようにする
heappush(que, (memo[nxt], nxt))
# ノードstartからの最短距離リストを返却
return memo
Q, K = list(map(int, input().split()))
# 引数：(ノードの隣接リスト, 出発ノード)
memo = dijkstra(nodes, K)
for i in range(Q):
x, y = list(map(int, input().split()))
# 今回は全てKを経由するので、Kからの距離さえ分かれば全部出る
print((memo[x] + memo[y]))
| # -*- coding: utf-8 -*-
import sys
def input():
return sys.stdin.readline().strip()
# 再帰呼び出しの回数制限(デフォルト1000)
sys.setrecursionlimit(10**9)
N = int(eval(input()))
nodes = [[] for _ in range(N + 1)]
for i in range(N - 1):
a, b, c = list(map(int, input().split()))
# nodes[出発ノード](到着ノード, コスト))
nodes[a].append((b, c))
# 無向グラフなのでこっちも入れる
nodes[b].append((a, c))
memo = [0] * (N + 1)
def dfs(cur, prev, dist):
memo[cur] = dist
for nxt, cost in nodes[cur]:
if nxt == prev:
continue
dfs(nxt, cur, dist + cost)
Q, K = list(map(int, input().split()))
dfs(K, -1, 0)
for i in range(Q):
x, y = list(map(int, input().split()))
# 今回は全てKを経由するので、Kからの距離さえ分かれば全部出る
print((memo[x] + memo[y]))
| false | 28.888889 | [
"-from heapq import heappop, heappush",
"-",
"-# 今回はダイクストラするので、データの持ち方は隣接リスト",
"+# 再帰呼び出しの回数制限(デフォルト1000)",
"+sys.setrecursionlimit(10**9)",
"+memo = [0] * (N + 1)",
"-def dijkstra(nodes, start):",
"- # 最短距離メモ",
"- memo = [float(\"inf\")] * (len(nodes))",
"- # スタート位置",
"- que = [(0, start)]",
"- memo[start] = 0",
"- # キューが空になるまで",
"- while len(que) != 0:",
"- # startからの距離, 現在のノード",
"- dist, cur = heappop(que)",
"- # 出発ノードcurの到着ノードでループ",
"- for nxt, cost in nodes[cur]:",
"- # 今回の経路のが短い時",
"- if memo[cur] + cost < memo[nxt]:",
"- memo[nxt] = memo[cur] + cost",
"- # 現在の移動距離をキューの優先度として、早い方から先に処理するようにする",
"- heappush(que, (memo[nxt], nxt))",
"- # ノードstartからの最短距離リストを返却",
"- return memo",
"+def dfs(cur, prev, dist):",
"+ memo[cur] = dist",
"+ for nxt, cost in nodes[cur]:",
"+ if nxt == prev:",
"+ continue",
"+ dfs(nxt, cur, dist + cost)",
"-# 引数：(ノードの隣接リスト, 出発ノード)",
"-memo = dijkstra(nodes, K)",
"+dfs(K, -1, 0)"
] | false | 0.036201 | 0.041427 | 0.873846 | [
"s007303090",
"s029838523"
] |
u536017058 | p03457 | python | s309539064 | s189194454 | 221 | 184 | 90,012 | 74,064 | Accepted | Accepted | 16.74 | N = int(eval(input()))
pnt = [[0]*3]
for i in range(N):
pnt.append(list(map(int, input().split())))
cnt = 0
for i in range(1, N+1):
t = pnt[i][0] - pnt[i-1][0]
x = abs(pnt[i][1] - pnt[i-1][1])
y = abs(pnt[i][2] - pnt[i-1][2])
if t >= x+y and (t-(x+y)) % 2 == 0:
cnt += 1
if cnt == N: print("Yes")
else: print("No")
| n = int(eval(input()))
ti_1, xi_1, yi_1 = [0,0,0]
for i in range(n):
ti, xi, yi = list(map(int, input().split()))
tlim = ti- ti_1
dist = abs(xi - xi_1) + abs(yi - yi_1)
if tlim < dist or (tlim-dist) % 2 == 1:
print('No')
exit()
else:
ti_1, xi_1, yi_1 = ti, xi, yi
continue
print('Yes') | 13 | 13 | 335 | 311 | N = int(eval(input()))
pnt = [[0] * 3]
for i in range(N):
pnt.append(list(map(int, input().split())))
cnt = 0
for i in range(1, N + 1):
t = pnt[i][0] - pnt[i - 1][0]
x = abs(pnt[i][1] - pnt[i - 1][1])
y = abs(pnt[i][2] - pnt[i - 1][2])
if t >= x + y and (t - (x + y)) % 2 == 0:
cnt += 1
if cnt == N:
print("Yes")
else:
print("No")
| n = int(eval(input()))
ti_1, xi_1, yi_1 = [0, 0, 0]
for i in range(n):
ti, xi, yi = list(map(int, input().split()))
tlim = ti - ti_1
dist = abs(xi - xi_1) + abs(yi - yi_1)
if tlim < dist or (tlim - dist) % 2 == 1:
print("No")
exit()
else:
ti_1, xi_1, yi_1 = ti, xi, yi
continue
print("Yes")
| false | 0 | [
"-N = int(eval(input()))",
"-pnt = [[0] * 3]",
"-for i in range(N):",
"- pnt.append(list(map(int, input().split())))",
"-cnt = 0",
"-for i in range(1, N + 1):",
"- t = pnt[i][0] - pnt[i - 1][0]",
"- x = abs(pnt[i][1] - pnt[i - 1][1])",
"- y = abs(pnt[i][2] - pnt[i - 1][2])",
"- if t >= x + y and (t - (x + y)) % 2 == 0:",
"- cnt += 1",
"-if cnt == N:",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"+n = int(eval(input()))",
"+ti_1, xi_1, yi_1 = [0, 0, 0]",
"+for i in range(n):",
"+ ti, xi, yi = list(map(int, input().split()))",
"+ tlim = ti - ti_1",
"+ dist = abs(xi - xi_1) + abs(yi - yi_1)",
"+ if tlim < dist or (tlim - dist) % 2 == 1:",
"+ print(\"No\")",
"+ exit()",
"+ else:",
"+ ti_1, xi_1, yi_1 = ti, xi, yi",
"+ continue",
"+print(\"Yes\")"
] | false | 0.070896 | 0.036259 | 1.955268 | [
"s309539064",
"s189194454"
] |
u094191970 | p02803 | python | s212755502 | s225940621 | 443 | 262 | 3,436 | 9,668 | Accepted | Accepted | 40.86 | from collections import deque
import copy
def BFS(h,w,sy,sx,xy_list):
dist=[[-1]*w for i in range(h)]
dist[sy][sx]=0
xy_list[sy][sx]='#'
dq=deque()
dq.append((sy,sx))
while dq:
y,x=dq.popleft()
for dy,dx in [[1,0],[-1,0],[0,1],[0,-1]]:
ny=y+dy
nx=x+dx
if 0<=ny<h and 0<=nx<w and xy_list[ny][nx]!='#':
dq.append((ny,nx))
xy_list[ny][nx]='#'
dist[ny][nx]=dist[y][x]+1
return dist
def main():
h,w=list(map(int,input().split()))
s=[list(eval(input())) for i in range(h)]
ans=0
for hh in range(h):
for ww in range(w):
if s[hh][ww]=='#':
continue
xy_list=copy.deepcopy(s)
dist=BFS(h,w,hh,ww,xy_list)
for d in dist:
ans=max(ans,max(d))
print(ans)
if __name__=="__main__":
main() | from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
from copy import deepcopy
from collections import deque
h,w=nii()
s=[list(eval(input())) for i in range(h)]
def dfs(cs,i,j):
que=deque()
que.append([i,j])
cs[i][j]='#'
dist=[[-1 for a in range(w)] for b in range(h)]
dist[i][j]=0
while que:
y,x=que.popleft()
for dy,dx in [[1,0],[-1,0],[0,1],[0,-1]]:
ny=y+dy
nx=x+dx
if 0<=ny<h and 0<=nx<w and cs[ny][nx]=='.':
que.append([ny,nx])
cs[ny][nx]='#'
dist[ny][nx]=dist[y][x]+1
t_ans=0
for a in dist:
t_ans=max(t_ans,max(a))
return t_ans
ans=0
for i in range(h):
for j in range(w):
if s[i][j]=='.':
cs=deepcopy(s)
dist=dfs(cs,i,j)
ans=max(ans,dist)
print(ans) | 41 | 43 | 768 | 862 | from collections import deque
import copy
def BFS(h, w, sy, sx, xy_list):
dist = [[-1] * w for i in range(h)]
dist[sy][sx] = 0
xy_list[sy][sx] = "#"
dq = deque()
dq.append((sy, sx))
while dq:
y, x = dq.popleft()
for dy, dx in [[1, 0], [-1, 0], [0, 1], [0, -1]]:
ny = y + dy
nx = x + dx
if 0 <= ny < h and 0 <= nx < w and xy_list[ny][nx] != "#":
dq.append((ny, nx))
xy_list[ny][nx] = "#"
dist[ny][nx] = dist[y][x] + 1
return dist
def main():
h, w = list(map(int, input().split()))
s = [list(eval(input())) for i in range(h)]
ans = 0
for hh in range(h):
for ww in range(w):
if s[hh][ww] == "#":
continue
xy_list = copy.deepcopy(s)
dist = BFS(h, w, hh, ww, xy_list)
for d in dist:
ans = max(ans, max(d))
print(ans)
if __name__ == "__main__":
main()
| from sys import stdin
nii = lambda: list(map(int, stdin.readline().split()))
lnii = lambda: list(map(int, stdin.readline().split()))
from copy import deepcopy
from collections import deque
h, w = nii()
s = [list(eval(input())) for i in range(h)]
def dfs(cs, i, j):
que = deque()
que.append([i, j])
cs[i][j] = "#"
dist = [[-1 for a in range(w)] for b in range(h)]
dist[i][j] = 0
while que:
y, x = que.popleft()
for dy, dx in [[1, 0], [-1, 0], [0, 1], [0, -1]]:
ny = y + dy
nx = x + dx
if 0 <= ny < h and 0 <= nx < w and cs[ny][nx] == ".":
que.append([ny, nx])
cs[ny][nx] = "#"
dist[ny][nx] = dist[y][x] + 1
t_ans = 0
for a in dist:
t_ans = max(t_ans, max(a))
return t_ans
ans = 0
for i in range(h):
for j in range(w):
if s[i][j] == ".":
cs = deepcopy(s)
dist = dfs(cs, i, j)
ans = max(ans, dist)
print(ans)
| false | 4.651163 | [
"+from sys import stdin",
"+",
"+nii = lambda: list(map(int, stdin.readline().split()))",
"+lnii = lambda: list(map(int, stdin.readline().split()))",
"+from copy import deepcopy",
"-import copy",
"+",
"+h, w = nii()",
"+s = [list(eval(input())) for i in range(h)]",
"-def BFS(h, w, sy, sx, xy_list):",
"- dist = [[-1] * w for i in range(h)]",
"- dist[sy][sx] = 0",
"- xy_list[sy][sx] = \"#\"",
"- dq = deque()",
"- dq.append((sy, sx))",
"- while dq:",
"- y, x = dq.popleft()",
"+def dfs(cs, i, j):",
"+ que = deque()",
"+ que.append([i, j])",
"+ cs[i][j] = \"#\"",
"+ dist = [[-1 for a in range(w)] for b in range(h)]",
"+ dist[i][j] = 0",
"+ while que:",
"+ y, x = que.popleft()",
"- if 0 <= ny < h and 0 <= nx < w and xy_list[ny][nx] != \"#\":",
"- dq.append((ny, nx))",
"- xy_list[ny][nx] = \"#\"",
"+ if 0 <= ny < h and 0 <= nx < w and cs[ny][nx] == \".\":",
"+ que.append([ny, nx])",
"+ cs[ny][nx] = \"#\"",
"- return dist",
"+ t_ans = 0",
"+ for a in dist:",
"+ t_ans = max(t_ans, max(a))",
"+ return t_ans",
"-def main():",
"- h, w = list(map(int, input().split()))",
"- s = [list(eval(input())) for i in range(h)]",
"- ans = 0",
"- for hh in range(h):",
"- for ww in range(w):",
"- if s[hh][ww] == \"#\":",
"- continue",
"- xy_list = copy.deepcopy(s)",
"- dist = BFS(h, w, hh, ww, xy_list)",
"- for d in dist:",
"- ans = max(ans, max(d))",
"- print(ans)",
"-",
"-",
"-if __name__ == \"__main__\":",
"- main()",
"+ans = 0",
"+for i in range(h):",
"+ for j in range(w):",
"+ if s[i][j] == \".\":",
"+ cs = deepcopy(s)",
"+ dist = dfs(cs, i, j)",
"+ ans = max(ans, dist)",
"+print(ans)"
] | false | 0.041776 | 0.040674 | 1.027084 | [
"s212755502",
"s225940621"
] |
u046158516 | p03592 | python | s676506279 | s659684878 | 182 | 85 | 38,768 | 64,104 | Accepted | Accepted | 53.3 | import sys
n,m,k=list(map(int,input().split()))
for i in range(n+1):
for j in range(m+1):
if (i*j)+(n-i)*(m-j)==k:
print('Yes')
sys.exit()
print('No')
| import sys
n,m,k=list(map(int,input().split()))
for i in range(n+1):
for j in range(m+1):
if i*j+(n-i)*(m-j)==k:
print('Yes')
sys.exit()
print('No')
| 8 | 8 | 170 | 168 | import sys
n, m, k = list(map(int, input().split()))
for i in range(n + 1):
for j in range(m + 1):
if (i * j) + (n - i) * (m - j) == k:
print("Yes")
sys.exit()
print("No")
| import sys
n, m, k = list(map(int, input().split()))
for i in range(n + 1):
for j in range(m + 1):
if i * j + (n - i) * (m - j) == k:
print("Yes")
sys.exit()
print("No")
| false | 0 | [
"- if (i * j) + (n - i) * (m - j) == k:",
"+ if i * j + (n - i) * (m - j) == k:"
] | false | 0.081778 | 0.079373 | 1.030299 | [
"s676506279",
"s659684878"
] |
u539692012 | p03291 | python | s301084679 | s534060485 | 732 | 141 | 80,800 | 72,764 | Accepted | Accepted | 80.74 | MOD = 10 ** 9 + 7
dp = [0, 0]
ans = 0
t = 1
for c in eval(input()):
ndp = dp.copy()
if c in 'A':
ndp[0] = (dp[0] + t) % MOD
elif c in 'B':
ndp[1] = (ndp[1] + dp[0]) % MOD
elif c in 'C':
ans = (ans + dp[1]) % MOD
else:
ndp[0] = (3 * dp[0] + t) % MOD
ndp[1] = (3 * dp[1] + dp[0]) % MOD
ans = (3 * ans + dp[1]) % MOD
t = (t * 3) % MOD
#print(*ndp, ans)
dp = ndp
print(ans) | MOD = 10 ** 9 + 7
s = eval(input())
a = 0
ql = 0
c = s.count('C')
qr = s.count('?')
ans = 0
for si in s:
if si == '?':
qr -= 1
if si in 'B?':
ans = (ans + pow(3,ql+qr,MOD)*a*c
+ (pow(3,ql+qr-1,MOD)*(ql*c+a*qr) if ql + qr - 1 >= 0 else 0)
+ (pow(3,ql+qr-2,MOD)*ql*qr if ql + qr - 2 >= 0 else 0)) % MOD
if si == '?':
ql += 1
elif si == 'A':
a += 1
elif si == 'C':
c -= 1
print(ans) | 20 | 21 | 466 | 481 | MOD = 10**9 + 7
dp = [0, 0]
ans = 0
t = 1
for c in eval(input()):
ndp = dp.copy()
if c in "A":
ndp[0] = (dp[0] + t) % MOD
elif c in "B":
ndp[1] = (ndp[1] + dp[0]) % MOD
elif c in "C":
ans = (ans + dp[1]) % MOD
else:
ndp[0] = (3 * dp[0] + t) % MOD
ndp[1] = (3 * dp[1] + dp[0]) % MOD
ans = (3 * ans + dp[1]) % MOD
t = (t * 3) % MOD
# print(*ndp, ans)
dp = ndp
print(ans)
| MOD = 10**9 + 7
s = eval(input())
a = 0
ql = 0
c = s.count("C")
qr = s.count("?")
ans = 0
for si in s:
if si == "?":
qr -= 1
if si in "B?":
ans = (
ans
+ pow(3, ql + qr, MOD) * a * c
+ (pow(3, ql + qr - 1, MOD) * (ql * c + a * qr) if ql + qr - 1 >= 0 else 0)
+ (pow(3, ql + qr - 2, MOD) * ql * qr if ql + qr - 2 >= 0 else 0)
) % MOD
if si == "?":
ql += 1
elif si == "A":
a += 1
elif si == "C":
c -= 1
print(ans)
| false | 4.761905 | [
"-dp = [0, 0]",
"+s = eval(input())",
"+a = 0",
"+ql = 0",
"+c = s.count(\"C\")",
"+qr = s.count(\"?\")",
"-t = 1",
"-for c in eval(input()):",
"- ndp = dp.copy()",
"- if c in \"A\":",
"- ndp[0] = (dp[0] + t) % MOD",
"- elif c in \"B\":",
"- ndp[1] = (ndp[1] + dp[0]) % MOD",
"- elif c in \"C\":",
"- ans = (ans + dp[1]) % MOD",
"- else:",
"- ndp[0] = (3 * dp[0] + t) % MOD",
"- ndp[1] = (3 * dp[1] + dp[0]) % MOD",
"- ans = (3 * ans + dp[1]) % MOD",
"- t = (t * 3) % MOD",
"- # print(*ndp, ans)",
"- dp = ndp",
"+for si in s:",
"+ if si == \"?\":",
"+ qr -= 1",
"+ if si in \"B?\":",
"+ ans = (",
"+ ans",
"+ + pow(3, ql + qr, MOD) * a * c",
"+ + (pow(3, ql + qr - 1, MOD) * (ql * c + a * qr) if ql + qr - 1 >= 0 else 0)",
"+ + (pow(3, ql + qr - 2, MOD) * ql * qr if ql + qr - 2 >= 0 else 0)",
"+ ) % MOD",
"+ if si == \"?\":",
"+ ql += 1",
"+ elif si == \"A\":",
"+ a += 1",
"+ elif si == \"C\":",
"+ c -= 1"
] | false | 0.03737 | 0.035863 | 1.042008 | [
"s301084679",
"s534060485"
] |
u221061152 | p02678 | python | s462630912 | s297410322 | 693 | 611 | 38,948 | 38,904 | Accepted | Accepted | 11.83 | f=lambda:map(int,input().split())
n,m=f()
g=[[] for _ in range(n)]
for _ in range(m):
a,b=f()
g[a-1]+=[b-1]
g[b-1]+=[a-1]
p=[0]*n
from collections import*
q=deque([0])
while q:
v=q.popleft()
for c in g[v]:
if p[c]<1: p[c]=v+1; q.append(c)
if 0 in p: print('No')
else: print('Yes',*p[1:],sep='\n')
| f=lambda:map(int,input().split())
n,m=f()
g = [[] for _ in range(n)]
for _ in range(m):
a,b=f()
g[a-1].append(b-1)
g[b-1].append(a-1)
p = [0]*n
from collections import deque
q = deque([0])
while q:
v = q.popleft()
for c in g[v]:
if p[c]<1:p[c]=v+1;q.append(c)
if 0 in p: print('No')
else: print('Yes',*p[1:],sep='\n')
| 16 | 17 | 325 | 348 | f = lambda: map(int, input().split())
n, m = f()
g = [[] for _ in range(n)]
for _ in range(m):
a, b = f()
g[a - 1] += [b - 1]
g[b - 1] += [a - 1]
p = [0] * n
from collections import *
q = deque([0])
while q:
v = q.popleft()
for c in g[v]:
if p[c] < 1:
p[c] = v + 1
q.append(c)
if 0 in p:
print("No")
else:
print("Yes", *p[1:], sep="\n")
| f = lambda: map(int, input().split())
n, m = f()
g = [[] for _ in range(n)]
for _ in range(m):
a, b = f()
g[a - 1].append(b - 1)
g[b - 1].append(a - 1)
p = [0] * n
from collections import deque
q = deque([0])
while q:
v = q.popleft()
for c in g[v]:
if p[c] < 1:
p[c] = v + 1
q.append(c)
if 0 in p:
print("No")
else:
print("Yes", *p[1:], sep="\n")
| false | 5.882353 | [
"- g[a - 1] += [b - 1]",
"- g[b - 1] += [a - 1]",
"+ g[a - 1].append(b - 1)",
"+ g[b - 1].append(a - 1)",
"-from collections import *",
"+from collections import deque"
] | false | 0.04376 | 0.043451 | 1.007101 | [
"s462630912",
"s297410322"
] |
u328207927 | p03495 | python | s551833278 | s463671662 | 136 | 102 | 32,516 | 32,516 | Accepted | Accepted | 25 | import collections
n,k=list(map(int,input().split()))
a=[int(i) for i in input().split()]
cnt=collections.Counter(a)
shu=len(list(cnt.values()))
ans=0
if shu<=k:
print(ans)
else:
x=list(cnt.values())
x.sort()
for i in range(shu-k):
ans+=x[i]
print(ans) | import collections as C
n,k=list(map(int,input().split()))
x=list(C.Counter([int(i) for i in input().split()]).values())
shu=len(x)
if shu<=k:
print((0))
else:
x.sort()
print((sum(x[:shu-k]))) | 14 | 9 | 281 | 202 | import collections
n, k = list(map(int, input().split()))
a = [int(i) for i in input().split()]
cnt = collections.Counter(a)
shu = len(list(cnt.values()))
ans = 0
if shu <= k:
print(ans)
else:
x = list(cnt.values())
x.sort()
for i in range(shu - k):
ans += x[i]
print(ans)
| import collections as C
n, k = list(map(int, input().split()))
x = list(C.Counter([int(i) for i in input().split()]).values())
shu = len(x)
if shu <= k:
print((0))
else:
x.sort()
print((sum(x[: shu - k])))
| false | 35.714286 | [
"-import collections",
"+import collections as C",
"-a = [int(i) for i in input().split()]",
"-cnt = collections.Counter(a)",
"-shu = len(list(cnt.values()))",
"-ans = 0",
"+x = list(C.Counter([int(i) for i in input().split()]).values())",
"+shu = len(x)",
"- print(ans)",
"+ print((0))",
"- x = list(cnt.values())",
"- for i in range(shu - k):",
"- ans += x[i]",
"- print(ans)",
"+ print((sum(x[: shu - k])))"
] | false | 0.046759 | 0.04584 | 1.020043 | [
"s551833278",
"s463671662"
] |
u623231048 | p03295 | python | s681213160 | s627098894 | 308 | 284 | 29,124 | 29,028 | Accepted | Accepted | 7.79 | import sys
from operator import itemgetter
input = sys.stdin.readline
n,m = list(map(int,input().split()))
li = [list(map(int,input().split())) for _ in range(m)]
ans = 0
now = -1
li.sort(key = itemgetter(1))
for i in range(m):
if li[i][0] <= now and li[i][1] > now:
pass
else:
ans += 1
now = li[i][1] - 1
print(ans)
| import sys
input = sys.stdin.readline
n,m = list(map(int,input().split()))
li = [list(map(int,input().split())) for _ in range(m)]
ans = 0
now = -1
li.sort(key = lambda x:x[1])
for i in range(m):
if li[i][0] > now or li[i][1] <= now:
ans += 1
now = li[i][1] - 1
print(ans)
| 20 | 17 | 367 | 308 | import sys
from operator import itemgetter
input = sys.stdin.readline
n, m = list(map(int, input().split()))
li = [list(map(int, input().split())) for _ in range(m)]
ans = 0
now = -1
li.sort(key=itemgetter(1))
for i in range(m):
if li[i][0] <= now and li[i][1] > now:
pass
else:
ans += 1
now = li[i][1] - 1
print(ans)
| import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
li = [list(map(int, input().split())) for _ in range(m)]
ans = 0
now = -1
li.sort(key=lambda x: x[1])
for i in range(m):
if li[i][0] > now or li[i][1] <= now:
ans += 1
now = li[i][1] - 1
print(ans)
| false | 15 | [
"-from operator import itemgetter",
"-li.sort(key=itemgetter(1))",
"+li.sort(key=lambda x: x[1])",
"- if li[i][0] <= now and li[i][1] > now:",
"- pass",
"- else:",
"+ if li[i][0] > now or li[i][1] <= now:"
] | false | 0.036061 | 0.041827 | 0.862135 | [
"s681213160",
"s627098894"
] |
u392319141 | p03549 | python | s127460281 | s866123382 | 177 | 17 | 39,024 | 2,940 | Accepted | Accepted | 90.4 | N, M = list(map(int, input().split()))
Tone = M * 1900 + (N - M) * 100
Pone = 1.0 / 2**M
prob = 1 - 1.0 / 2**M
ans = 1
for time in range(2, 100000):
ans += prob * time
prob *= (1.0 - Pone)
print((int(ans * Tone * Pone + 0.5))) | N, M = list(map(int, input().split()))
tOne = M * 1900 + (N - M) * 100
ans = tOne * (2**M)
print(ans) | 12 | 6 | 240 | 102 | N, M = list(map(int, input().split()))
Tone = M * 1900 + (N - M) * 100
Pone = 1.0 / 2**M
prob = 1 - 1.0 / 2**M
ans = 1
for time in range(2, 100000):
ans += prob * time
prob *= 1.0 - Pone
print((int(ans * Tone * Pone + 0.5)))
| N, M = list(map(int, input().split()))
tOne = M * 1900 + (N - M) * 100
ans = tOne * (2**M)
print(ans)
| false | 50 | [
"-Tone = M * 1900 + (N - M) * 100",
"-Pone = 1.0 / 2**M",
"-prob = 1 - 1.0 / 2**M",
"-ans = 1",
"-for time in range(2, 100000):",
"- ans += prob * time",
"- prob *= 1.0 - Pone",
"-print((int(ans * Tone * Pone + 0.5)))",
"+tOne = M * 1900 + (N - M) * 100",
"+ans = tOne * (2**M)",
"+print(ans)"
] | false | 0.086049 | 0.036011 | 2.389544 | [
"s127460281",
"s866123382"
] |
u150984829 | p02258 | python | s981021714 | s622263223 | 200 | 110 | 19,844 | 19,840 | Accepted | Accepted | 45 | import sys
b,s=-1e10,1e10
eval(input())
for r in map(int,sys.stdin.readlines()):
b,s=max(b,r-s),min(s,r)
print(b)
| import sys
b,s=-1e10,1e10
eval(input())
for r in map(int,sys.stdin.readlines()):
if b<r-s:b=r-s
if s>r:s=r
print(b)
| 6 | 7 | 114 | 118 | import sys
b, s = -1e10, 1e10
eval(input())
for r in map(int, sys.stdin.readlines()):
b, s = max(b, r - s), min(s, r)
print(b)
| import sys
b, s = -1e10, 1e10
eval(input())
for r in map(int, sys.stdin.readlines()):
if b < r - s:
b = r - s
if s > r:
s = r
print(b)
| false | 14.285714 | [
"- b, s = max(b, r - s), min(s, r)",
"+ if b < r - s:",
"+ b = r - s",
"+ if s > r:",
"+ s = r"
] | false | 0.102773 | 0.085681 | 1.19948 | [
"s981021714",
"s622263223"
] |
u815878613 | p02866 | python | s715546770 | s957010515 | 162 | 116 | 98,264 | 24,516 | Accepted | Accepted | 28.4 | from collections import defaultdict
N = int(eval(input()))
D = list(map(int, input().split()))
MOD = 998244353
p = defaultdict(int)
for d in D:
p[d] += 1
if p[0] == 1 and D[0] == 0:
ans = 1
for i in range(N + 1):
ans *= p[i] ** p[i + 1]
ans %= MOD
print((ans % MOD))
else:
print((0))
| from collections import defaultdict
N = int(eval(input()))
D = list(map(int, input().split()))
MOD = 998244353
p = defaultdict(int)
for d in D:
p[d] += 1
if p[0] == 1 and D[0] == 0:
ans = 1
for i in range(max(D)):
ans *= p[i] ** p[i + 1]
ans %= MOD
if ans == 0:
break
print(ans)
else:
print((0))
| 21 | 23 | 336 | 372 | from collections import defaultdict
N = int(eval(input()))
D = list(map(int, input().split()))
MOD = 998244353
p = defaultdict(int)
for d in D:
p[d] += 1
if p[0] == 1 and D[0] == 0:
ans = 1
for i in range(N + 1):
ans *= p[i] ** p[i + 1]
ans %= MOD
print((ans % MOD))
else:
print((0))
| from collections import defaultdict
N = int(eval(input()))
D = list(map(int, input().split()))
MOD = 998244353
p = defaultdict(int)
for d in D:
p[d] += 1
if p[0] == 1 and D[0] == 0:
ans = 1
for i in range(max(D)):
ans *= p[i] ** p[i + 1]
ans %= MOD
if ans == 0:
break
print(ans)
else:
print((0))
| false | 8.695652 | [
"- for i in range(N + 1):",
"+ for i in range(max(D)):",
"- print((ans % MOD))",
"+ if ans == 0:",
"+ break",
"+ print(ans)"
] | false | 0.037753 | 0.040266 | 0.937608 | [
"s715546770",
"s957010515"
] |
u535803878 | p02925 | python | s848496887 | s041625888 | 1,984 | 1,651 | 306,592 | 272,980 | Accepted | Accepted | 16.78 | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(eval(input()))
a = [list([int(x)-1 for x in input().split()]) for _ in range(n)]
N = n*(n-1)//2
index = {}
ind = 0
from collections import defaultdict
ns = defaultdict(list)
for i in range(n):
for j in range(i+1,n):
index[i,j] = ind
index[j,i] = ind
ind += 1
for i in range(n):
for j in range(n-2):
u = index[i,a[i][j]]
v = index[i,a[i][j+1]]
ns[u].append(v)
### サイクル検出 cycle detection
seen = [False] * N
done = [False] * N
vals = [None] * N
def dfs(u):
# uからdfs
seen[u] = True
ans = 0
for v in ns[u]:
if done[v]:
ans = max(ans, vals[v]+1)
continue
elif seen[v]:
# サイクルを検出
return 1
else:
pos = dfs(v)
if pos>=0:
return 1
ans = max(ans, vals[v]+1)
done[u] = True
vals[u] = ans
return -1
ans = -float("inf")
for u in range(N):
if seen[u]:
continue
pos = dfs(u)
if pos>=0:
print((-1))
break
else:
print((max(vals)+1)) | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(eval(input()))
a = [list([int(x)-1 for x in input().split()]) for _ in range(n)]
N = n*(n-1)//2
index = {}
ind = 0
from collections import defaultdict
ns = defaultdict(list)
for i in range(n):
for j in range(i+1,n):
index[i,j] = ind
index[j,i] = ind
ind += 1
for i in range(n):
for j in range(n-2):
u = index[i,a[i][j]]
v = index[i,a[i][j+1]]
ns[u].append(v)
### サイクル検出 cycle detection
seen = [False] * N
done = [False] * N
vals = [None] * N
def dfs(u):
s = [u]
while s:
u = s.pop()
if u>=0:
seen[u] = True
s.append(~u)
for v in ns[u]:
if done[v]:
continue
elif not seen[v]:
s.append(v)
else:
# 閉路発見
return True
else:
u = ~u
done[u] = True
# ここに帰りがけ処理を書く
val = 0
for v in ns[u]:
val = max(val, vals[v]+1)
vals[u] = val
return False
ans = -float("inf")
for u in range(N):
if seen[u]:
continue
pos = dfs(u)
if pos:
print((-1))
break
else:
print((max(vals)+1)) | 56 | 62 | 1,263 | 1,449 | import sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x + "\n")
n = int(eval(input()))
a = [list([int(x) - 1 for x in input().split()]) for _ in range(n)]
N = n * (n - 1) // 2
index = {}
ind = 0
from collections import defaultdict
ns = defaultdict(list)
for i in range(n):
for j in range(i + 1, n):
index[i, j] = ind
index[j, i] = ind
ind += 1
for i in range(n):
for j in range(n - 2):
u = index[i, a[i][j]]
v = index[i, a[i][j + 1]]
ns[u].append(v)
### サイクル検出 cycle detection
seen = [False] * N
done = [False] * N
vals = [None] * N
def dfs(u):
# uからdfs
seen[u] = True
ans = 0
for v in ns[u]:
if done[v]:
ans = max(ans, vals[v] + 1)
continue
elif seen[v]:
# サイクルを検出
return 1
else:
pos = dfs(v)
if pos >= 0:
return 1
ans = max(ans, vals[v] + 1)
done[u] = True
vals[u] = ans
return -1
ans = -float("inf")
for u in range(N):
if seen[u]:
continue
pos = dfs(u)
if pos >= 0:
print((-1))
break
else:
print((max(vals) + 1))
| import sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x + "\n")
n = int(eval(input()))
a = [list([int(x) - 1 for x in input().split()]) for _ in range(n)]
N = n * (n - 1) // 2
index = {}
ind = 0
from collections import defaultdict
ns = defaultdict(list)
for i in range(n):
for j in range(i + 1, n):
index[i, j] = ind
index[j, i] = ind
ind += 1
for i in range(n):
for j in range(n - 2):
u = index[i, a[i][j]]
v = index[i, a[i][j + 1]]
ns[u].append(v)
### サイクル検出 cycle detection
seen = [False] * N
done = [False] * N
vals = [None] * N
def dfs(u):
s = [u]
while s:
u = s.pop()
if u >= 0:
seen[u] = True
s.append(~u)
for v in ns[u]:
if done[v]:
continue
elif not seen[v]:
s.append(v)
else:
# 閉路発見
return True
else:
u = ~u
done[u] = True
# ここに帰りがけ処理を書く
val = 0
for v in ns[u]:
val = max(val, vals[v] + 1)
vals[u] = val
return False
ans = -float("inf")
for u in range(N):
if seen[u]:
continue
pos = dfs(u)
if pos:
print((-1))
break
else:
print((max(vals) + 1))
| false | 9.677419 | [
"- # uからdfs",
"- seen[u] = True",
"- ans = 0",
"- for v in ns[u]:",
"- if done[v]:",
"- ans = max(ans, vals[v] + 1)",
"- continue",
"- elif seen[v]:",
"- # サイクルを検出",
"- return 1",
"+ s = [u]",
"+ while s:",
"+ u = s.pop()",
"+ if u >= 0:",
"+ seen[u] = True",
"+ s.append(~u)",
"+ for v in ns[u]:",
"+ if done[v]:",
"+ continue",
"+ elif not seen[v]:",
"+ s.append(v)",
"+ else:",
"+ # 閉路発見",
"+ return True",
"- pos = dfs(v)",
"- if pos >= 0:",
"- return 1",
"- ans = max(ans, vals[v] + 1)",
"- done[u] = True",
"- vals[u] = ans",
"- return -1",
"+ u = ~u",
"+ done[u] = True",
"+ # ここに帰りがけ処理を書く",
"+ val = 0",
"+ for v in ns[u]:",
"+ val = max(val, vals[v] + 1)",
"+ vals[u] = val",
"+ return False",
"- if pos >= 0:",
"+ if pos:"
] | false | 0.046345 | 0.037083 | 1.249758 | [
"s848496887",
"s041625888"
] |
u512212329 | p02629 | python | s963043233 | s095216880 | 30 | 27 | 9,136 | 9,136 | Accepted | Accepted | 10 | def main():
n = int(eval(input()))
base = 26
orig = ord('a')
ans = ''
for exp in range(1, 12):
if (tmp := pow(base, exp)) >= n:
n -= 1 # zero_indexed for ASCII mod
for digit in range(exp):
ans += (chr(orig + n % base))
n //= base
break
else:
n -= tmp
print((ans[::-1]))
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
base = 26
orig = ord('a')
ans = ''
while n > 0:
n -= 1
ans += chr(orig + n % base)
n //= base
print((ans[::-1]))
if __name__ == '__main__':
main()
| 19 | 14 | 441 | 241 | def main():
n = int(eval(input()))
base = 26
orig = ord("a")
ans = ""
for exp in range(1, 12):
if (tmp := pow(base, exp)) >= n:
n -= 1 # zero_indexed for ASCII mod
for digit in range(exp):
ans += chr(orig + n % base)
n //= base
break
else:
n -= tmp
print((ans[::-1]))
if __name__ == "__main__":
main()
| def main():
n = int(eval(input()))
base = 26
orig = ord("a")
ans = ""
while n > 0:
n -= 1
ans += chr(orig + n % base)
n //= base
print((ans[::-1]))
if __name__ == "__main__":
main()
| false | 26.315789 | [
"- for exp in range(1, 12):",
"- if (tmp := pow(base, exp)) >= n:",
"- n -= 1 # zero_indexed for ASCII mod",
"- for digit in range(exp):",
"- ans += chr(orig + n % base)",
"- n //= base",
"- break",
"- else:",
"- n -= tmp",
"+ while n > 0:",
"+ n -= 1",
"+ ans += chr(orig + n % base)",
"+ n //= base"
] | false | 0.043111 | 0.044933 | 0.95945 | [
"s963043233",
"s095216880"
] |
u076917070 | p03569 | python | s757738306 | s514407994 | 50 | 46 | 3,316 | 4,340 | Accepted | Accepted | 8 | import sys
input = sys.stdin.readline
def main():
s = input().strip()
l, r = 0, len(s)-1
ans = 0
while l < r:
if s[l] == s[r]:
l += 1
r -= 1
elif s[l] == "x" and s[r] != "x":
ans += 1
l += 1
elif s[l] != "x" and s[r] == "x":
ans += 1
r -= 1
else:
print((-1))
return
print(ans)
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
def main():
s = input().strip()
import collections
q = collections.deque(s)
ans = 0
while q:
s, t = q[0], q[-1]
if s == t:
q.popleft()
if q:
q.pop()
elif s == "x" and t != "x":
ans += 1
q.popleft()
elif s != "x" and t == "x":
ans += 1
q.pop()
else:
print((-1))
return
print(ans)
if __name__ == '__main__':
main()
| 26 | 29 | 490 | 561 | import sys
input = sys.stdin.readline
def main():
s = input().strip()
l, r = 0, len(s) - 1
ans = 0
while l < r:
if s[l] == s[r]:
l += 1
r -= 1
elif s[l] == "x" and s[r] != "x":
ans += 1
l += 1
elif s[l] != "x" and s[r] == "x":
ans += 1
r -= 1
else:
print((-1))
return
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def main():
s = input().strip()
import collections
q = collections.deque(s)
ans = 0
while q:
s, t = q[0], q[-1]
if s == t:
q.popleft()
if q:
q.pop()
elif s == "x" and t != "x":
ans += 1
q.popleft()
elif s != "x" and t == "x":
ans += 1
q.pop()
else:
print((-1))
return
print(ans)
if __name__ == "__main__":
main()
| false | 10.344828 | [
"- l, r = 0, len(s) - 1",
"+ import collections",
"+",
"+ q = collections.deque(s)",
"- while l < r:",
"- if s[l] == s[r]:",
"- l += 1",
"- r -= 1",
"- elif s[l] == \"x\" and s[r] != \"x\":",
"+ while q:",
"+ s, t = q[0], q[-1]",
"+ if s == t:",
"+ q.popleft()",
"+ if q:",
"+ q.pop()",
"+ elif s == \"x\" and t != \"x\":",
"- l += 1",
"- elif s[l] != \"x\" and s[r] == \"x\":",
"+ q.popleft()",
"+ elif s != \"x\" and t == \"x\":",
"- r -= 1",
"+ q.pop()"
] | false | 0.042673 | 0.061201 | 0.697264 | [
"s757738306",
"s514407994"
] |
u714642969 | p03167 | python | s431027026 | s125108112 | 476 | 240 | 80,220 | 52,208 | Accepted | Accepted | 49.58 | import sys
from collections import deque
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()
def main():
H,W=list(map(int,input().split()))
a=[[] for _ in range(H+2)]
a[0]=a[H+1]='#'*(W+2)
for i in range(1,H+1):
a[i]='#'+eval(input())+'#'
dp=[[0]*(W+2) for _ in range(H+2)]
dp[1][1]=1
que=deque()
que.append((1,1))
dx=[1,0]
dy=[0,1]
used=[[False]*(W*2) for _ in range(H+2)]
used[1][1]=True
while que:
y,x=que.popleft()
for k in range(2):
ny,nx=y+dy[k],x+dx[k]
if a[ny][nx]=='.':
dp[ny][nx]+=dp[y][x]
dp[ny][nx]%=MOD
if not used[ny][nx]:
que.append((ny,nx))
used[ny][nx]=True
print((dp[H][W]))
if __name__ == '__main__':
main()
| import sys
from collections import deque
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()
def main():
H,W=list(map(int,input().split()))
a=[[] for _ in range(H+2)]
a[0]=a[H+1]='#'*(W+2)
for i in range(1,H+1):
a[i]='#'+eval(input())+'#'
dp=[[0]*(W+2) for _ in range(H+2)]
for column in range(1,H+1):
for row in range(1,W+1):
if column==row==1:
dp[column][row]=1
elif a[column][row]=='.':
dp[column][row]=(dp[column-1][row]+dp[column][row-1])%MOD
print((dp[H][W]))
if __name__ == '__main__':
main()
| 35 | 24 | 895 | 665 | import sys
from collections import deque
sys.setrecursionlimit(10**9)
INF = 10**18
MOD = 10**9 + 7
def input():
return sys.stdin.readline().rstrip()
def main():
H, W = list(map(int, input().split()))
a = [[] for _ in range(H + 2)]
a[0] = a[H + 1] = "#" * (W + 2)
for i in range(1, H + 1):
a[i] = "#" + eval(input()) + "#"
dp = [[0] * (W + 2) for _ in range(H + 2)]
dp[1][1] = 1
que = deque()
que.append((1, 1))
dx = [1, 0]
dy = [0, 1]
used = [[False] * (W * 2) for _ in range(H + 2)]
used[1][1] = True
while que:
y, x = que.popleft()
for k in range(2):
ny, nx = y + dy[k], x + dx[k]
if a[ny][nx] == ".":
dp[ny][nx] += dp[y][x]
dp[ny][nx] %= MOD
if not used[ny][nx]:
que.append((ny, nx))
used[ny][nx] = True
print((dp[H][W]))
if __name__ == "__main__":
main()
| import sys
from collections import deque
sys.setrecursionlimit(10**9)
INF = 10**18
MOD = 10**9 + 7
def input():
return sys.stdin.readline().rstrip()
def main():
H, W = list(map(int, input().split()))
a = [[] for _ in range(H + 2)]
a[0] = a[H + 1] = "#" * (W + 2)
for i in range(1, H + 1):
a[i] = "#" + eval(input()) + "#"
dp = [[0] * (W + 2) for _ in range(H + 2)]
for column in range(1, H + 1):
for row in range(1, W + 1):
if column == row == 1:
dp[column][row] = 1
elif a[column][row] == ".":
dp[column][row] = (dp[column - 1][row] + dp[column][row - 1]) % MOD
print((dp[H][W]))
if __name__ == "__main__":
main()
| false | 31.428571 | [
"- dp[1][1] = 1",
"- que = deque()",
"- que.append((1, 1))",
"- dx = [1, 0]",
"- dy = [0, 1]",
"- used = [[False] * (W * 2) for _ in range(H + 2)]",
"- used[1][1] = True",
"- while que:",
"- y, x = que.popleft()",
"- for k in range(2):",
"- ny, nx = y + dy[k], x + dx[k]",
"- if a[ny][nx] == \".\":",
"- dp[ny][nx] += dp[y][x]",
"- dp[ny][nx] %= MOD",
"- if not used[ny][nx]:",
"- que.append((ny, nx))",
"- used[ny][nx] = True",
"+ for column in range(1, H + 1):",
"+ for row in range(1, W + 1):",
"+ if column == row == 1:",
"+ dp[column][row] = 1",
"+ elif a[column][row] == \".\":",
"+ dp[column][row] = (dp[column - 1][row] + dp[column][row - 1]) % MOD"
] | false | 0.04878 | 0.039983 | 1.220005 | [
"s431027026",
"s125108112"
] |
u145600939 | p03566 | python | s130840045 | s827138143 | 381 | 332 | 110,940 | 52,060 | Accepted | Accepted | 12.86 | n = int(eval(input()))
T = list(map(int,input().split()))
V = list(map(int,input().split()))
dp = [[-1]*102 for _ in range(sum(T) + 1)]
dp[0][0] = 0
nt = 0
pt = T[0]
# i 秒から i+1 秒へ配る
delta = [-1,0,1]
for i in range(sum(T)):
if pt == i:
nt += 1
pt += T[nt]
for j in range(101):
if j > V[nt] or dp[i][j] == -1:break
for d in delta:
nj = j + d
if 0 <= nj <= V[nt]:
if d != 0 or j == V[nt]:
dp[i+1][nj] = max(dp[i+1][nj], dp[i][j] + (j+nj)/2)
else :
dp[i+1][nj] = max(dp[i+1][nj], dp[i][j] + j + 0.25)
print((dp[-1][0]))
| n = int(eval(input()))
T = list(map(int,input().split()))
V = list(map(int,input().split()))
s = [0]*n
for i in range(n-1):
s[i+1] = s[i] + T[i]
l = (s[-1]+T[n-1])*2+1
ans = [1e100]*l
for i in range(l):
ans[i] = min(ans[i],i/2)
ans[l-i-1] = min(ans[i],i/2)
for j in range(n):
for i in range(l):
if i <= s[j]*2:
ans[i] = min(ans[i], V[j]+(s[j]*2-i)/2)
elif s[j]*2 <= i <= s[j]*2+T[j]*2:
ans[i] = min(ans[i],V[j])
else:
ans[i] = min(ans[i],V[j]+(i-s[j]*2-T[j]*2)/2)
anser = 0
for i in range(l-1):
anser += (ans[i]+ans[i+1])/4
print(anser)
| 26 | 25 | 673 | 637 | n = int(eval(input()))
T = list(map(int, input().split()))
V = list(map(int, input().split()))
dp = [[-1] * 102 for _ in range(sum(T) + 1)]
dp[0][0] = 0
nt = 0
pt = T[0]
# i 秒から i+1 秒へ配る
delta = [-1, 0, 1]
for i in range(sum(T)):
if pt == i:
nt += 1
pt += T[nt]
for j in range(101):
if j > V[nt] or dp[i][j] == -1:
break
for d in delta:
nj = j + d
if 0 <= nj <= V[nt]:
if d != 0 or j == V[nt]:
dp[i + 1][nj] = max(dp[i + 1][nj], dp[i][j] + (j + nj) / 2)
else:
dp[i + 1][nj] = max(dp[i + 1][nj], dp[i][j] + j + 0.25)
print((dp[-1][0]))
| n = int(eval(input()))
T = list(map(int, input().split()))
V = list(map(int, input().split()))
s = [0] * n
for i in range(n - 1):
s[i + 1] = s[i] + T[i]
l = (s[-1] + T[n - 1]) * 2 + 1
ans = [1e100] * l
for i in range(l):
ans[i] = min(ans[i], i / 2)
ans[l - i - 1] = min(ans[i], i / 2)
for j in range(n):
for i in range(l):
if i <= s[j] * 2:
ans[i] = min(ans[i], V[j] + (s[j] * 2 - i) / 2)
elif s[j] * 2 <= i <= s[j] * 2 + T[j] * 2:
ans[i] = min(ans[i], V[j])
else:
ans[i] = min(ans[i], V[j] + (i - s[j] * 2 - T[j] * 2) / 2)
anser = 0
for i in range(l - 1):
anser += (ans[i] + ans[i + 1]) / 4
print(anser)
| false | 3.846154 | [
"-dp = [[-1] * 102 for _ in range(sum(T) + 1)]",
"-dp[0][0] = 0",
"-nt = 0",
"-pt = T[0]",
"-# i 秒から i+1 秒へ配る",
"-delta = [-1, 0, 1]",
"-for i in range(sum(T)):",
"- if pt == i:",
"- nt += 1",
"- pt += T[nt]",
"- for j in range(101):",
"- if j > V[nt] or dp[i][j] == -1:",
"- break",
"- for d in delta:",
"- nj = j + d",
"- if 0 <= nj <= V[nt]:",
"- if d != 0 or j == V[nt]:",
"- dp[i + 1][nj] = max(dp[i + 1][nj], dp[i][j] + (j + nj) / 2)",
"- else:",
"- dp[i + 1][nj] = max(dp[i + 1][nj], dp[i][j] + j + 0.25)",
"-print((dp[-1][0]))",
"+s = [0] * n",
"+for i in range(n - 1):",
"+ s[i + 1] = s[i] + T[i]",
"+l = (s[-1] + T[n - 1]) * 2 + 1",
"+ans = [1e100] * l",
"+for i in range(l):",
"+ ans[i] = min(ans[i], i / 2)",
"+ ans[l - i - 1] = min(ans[i], i / 2)",
"+for j in range(n):",
"+ for i in range(l):",
"+ if i <= s[j] * 2:",
"+ ans[i] = min(ans[i], V[j] + (s[j] * 2 - i) / 2)",
"+ elif s[j] * 2 <= i <= s[j] * 2 + T[j] * 2:",
"+ ans[i] = min(ans[i], V[j])",
"+ else:",
"+ ans[i] = min(ans[i], V[j] + (i - s[j] * 2 - T[j] * 2) / 2)",
"+anser = 0",
"+for i in range(l - 1):",
"+ anser += (ans[i] + ans[i + 1]) / 4",
"+print(anser)"
] | false | 0.077658 | 0.042398 | 1.831667 | [
"s130840045",
"s827138143"
] |
u701318346 | p02983 | python | s685001613 | s541494738 | 1,053 | 102 | 3,060 | 2,940 | Accepted | Accepted | 90.31 | L, R = list(map(int, input().split()))
MOD = 2019
l = L % MOD
r = R % MOD
ans = 2019
if l >= r or (R - L) >= 2019:
ans = 0
else:
for i in range(l, r):
for j in range(l + 1, r + 1):
if j <= i:
continue
else:
ans = min(ans, i * j % MOD)
print(ans)
| L, R = list(map(int, input().split()))
ans = 10 ** 9
if R - L >= 673:
ans = 0
else:
for i in range(L, R):
for j in range(L + 1, R + 1):
work = (i * j) % 2019
# print(i, j, work, ans)
ans = min(ans, work)
print(ans)
| 17 | 15 | 330 | 298 | L, R = list(map(int, input().split()))
MOD = 2019
l = L % MOD
r = R % MOD
ans = 2019
if l >= r or (R - L) >= 2019:
ans = 0
else:
for i in range(l, r):
for j in range(l + 1, r + 1):
if j <= i:
continue
else:
ans = min(ans, i * j % MOD)
print(ans)
| L, R = list(map(int, input().split()))
ans = 10**9
if R - L >= 673:
ans = 0
else:
for i in range(L, R):
for j in range(L + 1, R + 1):
work = (i * j) % 2019
# print(i, j, work, ans)
ans = min(ans, work)
print(ans)
| false | 11.764706 | [
"-MOD = 2019",
"-l = L % MOD",
"-r = R % MOD",
"-ans = 2019",
"-if l >= r or (R - L) >= 2019:",
"+ans = 10**9",
"+if R - L >= 673:",
"- for i in range(l, r):",
"- for j in range(l + 1, r + 1):",
"- if j <= i:",
"- continue",
"- else:",
"- ans = min(ans, i * j % MOD)",
"+ for i in range(L, R):",
"+ for j in range(L + 1, R + 1):",
"+ work = (i * j) % 2019",
"+ # print(i, j, work, ans)",
"+ ans = min(ans, work)"
] | false | 0.034318 | 0.045122 | 0.760576 | [
"s685001613",
"s541494738"
] |
u644907318 | p03427 | python | s643389643 | s270956161 | 171 | 64 | 38,256 | 61,788 | Accepted | Accepted | 62.57 | N = input().strip()
n = len(N)
cntmax = 0
for i in range(n):
cntmax += int(N[i])
for j in range(n-1):
x=N[:j]
if N[j]!="0":
x += str(int(N[j])-1)+"9"*(n-1-j)
cnt = 0
for i in range(n):
cnt += int(x[i])
cntmax = max(cntmax,cnt)
print(cntmax) | N = input().strip()
k = len(N)
a = int(N[0])
if k==1:
cmax = a
else:
cnt = 0
for i in range(k):
cnt += int(N[i])
cmax = max((a-1)+9*(k-1),cnt)
print(cmax) | 14 | 11 | 316 | 188 | N = input().strip()
n = len(N)
cntmax = 0
for i in range(n):
cntmax += int(N[i])
for j in range(n - 1):
x = N[:j]
if N[j] != "0":
x += str(int(N[j]) - 1) + "9" * (n - 1 - j)
cnt = 0
for i in range(n):
cnt += int(x[i])
cntmax = max(cntmax, cnt)
print(cntmax)
| N = input().strip()
k = len(N)
a = int(N[0])
if k == 1:
cmax = a
else:
cnt = 0
for i in range(k):
cnt += int(N[i])
cmax = max((a - 1) + 9 * (k - 1), cnt)
print(cmax)
| false | 21.428571 | [
"-n = len(N)",
"-cntmax = 0",
"-for i in range(n):",
"- cntmax += int(N[i])",
"-for j in range(n - 1):",
"- x = N[:j]",
"- if N[j] != \"0\":",
"- x += str(int(N[j]) - 1) + \"9\" * (n - 1 - j)",
"- cnt = 0",
"- for i in range(n):",
"- cnt += int(x[i])",
"- cntmax = max(cntmax, cnt)",
"-print(cntmax)",
"+k = len(N)",
"+a = int(N[0])",
"+if k == 1:",
"+ cmax = a",
"+else:",
"+ cnt = 0",
"+ for i in range(k):",
"+ cnt += int(N[i])",
"+ cmax = max((a - 1) + 9 * (k - 1), cnt)",
"+print(cmax)"
] | false | 0.065603 | 0.068562 | 0.956843 | [
"s643389643",
"s270956161"
] |
u168578024 | p02625 | python | s627268783 | s131495132 | 475 | 439 | 102,784 | 101,984 | Accepted | Accepted | 7.58 | fac=[1]*505050
inv=[1]*505050
finv=[1]*505050
mod=1000000007
for i in range(2,500010):
fac[i]=fac[i-1]*i%mod
inv[i]=-inv[mod%i]*(mod//i)%mod
finv[i]=finv[i-1]*inv[i]%mod
def C(n,r):
if n<0 or r<0 or n<r: return 0
return fac[n]*finv[n-r]*finv[r]%mod
N,M=list(map(int,input().split()))
ans=0
for i in range(N+1):
ans+=C(N,i)*fac[M]%mod*finv[M-i]%mod*((fac[M-i]*finv[M-N])**2%mod)*(1 if i%2==0 else -1)%mod
ans%=mod
print((ans%mod))
| fac=[1]*505050
inv=[1]*505050
finv=[1]*505050
mod=1000000007
for i in range(2,500010):
fac[i]=fac[i-1]*i%mod
inv[i]=-inv[mod%i]*(mod//i)%mod
finv[i]=finv[i-1]*inv[i]%mod
def C(n,r):
if n<0 or r<0 or n<r: return 0
return fac[n]*finv[n-r]%mod*finv[r]%mod
N,M=list(map(int,input().split()))
ans=0
for i in range(N+1):
ans+=C(N,i)*fac[M]%mod*finv[M-i]%mod*((fac[M-i]*finv[M-N])**2%mod)*(1 if i%2==0 else -1)%mod
ans%=mod
print((ans%mod))
| 19 | 19 | 456 | 460 | fac = [1] * 505050
inv = [1] * 505050
finv = [1] * 505050
mod = 1000000007
for i in range(2, 500010):
fac[i] = fac[i - 1] * i % mod
inv[i] = -inv[mod % i] * (mod // i) % mod
finv[i] = finv[i - 1] * inv[i] % mod
def C(n, r):
if n < 0 or r < 0 or n < r:
return 0
return fac[n] * finv[n - r] * finv[r] % mod
N, M = list(map(int, input().split()))
ans = 0
for i in range(N + 1):
ans += (
C(N, i)
* fac[M]
% mod
* finv[M - i]
% mod
* ((fac[M - i] * finv[M - N]) ** 2 % mod)
* (1 if i % 2 == 0 else -1)
% mod
)
ans %= mod
print((ans % mod))
| fac = [1] * 505050
inv = [1] * 505050
finv = [1] * 505050
mod = 1000000007
for i in range(2, 500010):
fac[i] = fac[i - 1] * i % mod
inv[i] = -inv[mod % i] * (mod // i) % mod
finv[i] = finv[i - 1] * inv[i] % mod
def C(n, r):
if n < 0 or r < 0 or n < r:
return 0
return fac[n] * finv[n - r] % mod * finv[r] % mod
N, M = list(map(int, input().split()))
ans = 0
for i in range(N + 1):
ans += (
C(N, i)
* fac[M]
% mod
* finv[M - i]
% mod
* ((fac[M - i] * finv[M - N]) ** 2 % mod)
* (1 if i % 2 == 0 else -1)
% mod
)
ans %= mod
print((ans % mod))
| false | 0 | [
"- return fac[n] * finv[n - r] * finv[r] % mod",
"+ return fac[n] * finv[n - r] % mod * finv[r] % mod"
] | false | 3.011405 | 0.9841 | 3.060061 | [
"s627268783",
"s131495132"
] |
u785578220 | p02594 | python | s471082714 | s139792091 | 31 | 26 | 9,148 | 9,000 | Accepted | Accepted | 16.13 | a = int(eval(input()))
print(('YNeos'[a<30::2]))
| a = int(eval(input()))
ans = a >= 30 and 'Yes' or 'No'
print(ans) | 2 | 3 | 42 | 61 | a = int(eval(input()))
print(("YNeos"[a < 30 :: 2]))
| a = int(eval(input()))
ans = a >= 30 and "Yes" or "No"
print(ans)
| false | 33.333333 | [
"-print((\"YNeos\"[a < 30 :: 2]))",
"+ans = a >= 30 and \"Yes\" or \"No\"",
"+print(ans)"
] | false | 0.073761 | 0.110883 | 0.665214 | [
"s471082714",
"s139792091"
] |
u638795007 | p02889 | python | s669065916 | s847397888 | 1,646 | 947 | 127,964 | 28,228 | Accepted | Accepted | 42.47 | #################################
##ワーシャルフロイド法 n~3
#################################
def warshall_floyd(n,d):
#d[i][j]: iからjへの最短距離
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j],d[i][k] + d[k][j])
return d
##############################
import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
mod = 10**9 + 7
inf = float('inf')
ans = int(0)
N,M,L =LI()
s = []
t = []
dp = [[inf] * (N) for _ in range(N)]
for i in range(M):
a, b, c = list(map(int, input().split()))
dp[a-1][b-1] = c
dp[b-1][a-1] = c
Q = I()
for i in range(Q):
a,b = LI()
s.append(a-1)
t.append(b-1)
for i in range(N):
dp[i][i] = 0
#print(warshall_floyd(N,dp))
d1 = [[0] * (N) for _ in range(N)]
d1 = warshall_floyd(N,dp)
newdp = [[inf] * (N) for _ in range(N)]
for i in range(N):
for j in range(i+1,N):
if d1[i][j]<=L:
newdp[i][j] = 1
newdp[j][i] = 1
for i in range(N):
newdp[i][i] = 0
#print(newdp)
#print(warshall_floyd(N,newdp))
d2 = [[0] * (N) for _ in range(N)]
d2 = warshall_floyd(N,newdp)
for i in range(Q):
ans = d2[s[i]][t[i]]-1
if ans!= inf:
print(ans)
else:
print("-1")
| from scipy.sparse.csgraph import csgraph_from_dense,dijkstra,floyd_warshall
import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
mod = 10**9 + 7
inf = float('inf')
ans = int(0)
N,M,L =LI()
s = []
t = []
dp = [[inf] * (N) for _ in range(N)]
for i in range(M):
a, b, c = list(map(int, input().split()))
dp[a-1][b-1] = c
dp[b-1][a-1] = c
Q = I()
for i in range(Q):
a,b = LI()
s.append(a-1)
t.append(b-1)
for i in range(N):
dp[i][i] = 0
#print(warshall_floyd(N,dp))
#d1 = [[0] * (N) for _ in range(N)]
#d1 = warshall_floyd(N,dp)
G = csgraph_from_dense(dp)
d1 = floyd_warshall(G)
newdp = [[inf] * (N) for _ in range(N)]
for i in range(N):
for j in range(i+1,N):
if d1[i][j]<=L:
newdp[i][j] = 1
newdp[j][i] = 1
for i in range(N):
newdp[i][i] = 0
#print(newdp)
#print(warshall_floyd(N,newdp))
#d2 = [[0] * (N) for _ in range(N)]
#d2 = warshall_floyd(N,newdp)
G2 = csgraph_from_dense(newdp)
d2 = floyd_warshall(G2)
for i in range(Q):
ans = d2[s[i]][t[i]]-1
if ans!= inf:
print((int(ans)))
else:
print("-1") | 58 | 52 | 1,337 | 1,203 | #################################
##ワーシャルフロイド法 n~3
#################################
def warshall_floyd(n, d):
# d[i][j]: iからjへの最短距離
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j], d[i][k] + d[k][j])
return d
##############################
import sys
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
mod = 10**9 + 7
inf = float("inf")
ans = int(0)
N, M, L = LI()
s = []
t = []
dp = [[inf] * (N) for _ in range(N)]
for i in range(M):
a, b, c = list(map(int, input().split()))
dp[a - 1][b - 1] = c
dp[b - 1][a - 1] = c
Q = I()
for i in range(Q):
a, b = LI()
s.append(a - 1)
t.append(b - 1)
for i in range(N):
dp[i][i] = 0
# print(warshall_floyd(N,dp))
d1 = [[0] * (N) for _ in range(N)]
d1 = warshall_floyd(N, dp)
newdp = [[inf] * (N) for _ in range(N)]
for i in range(N):
for j in range(i + 1, N):
if d1[i][j] <= L:
newdp[i][j] = 1
newdp[j][i] = 1
for i in range(N):
newdp[i][i] = 0
# print(newdp)
# print(warshall_floyd(N,newdp))
d2 = [[0] * (N) for _ in range(N)]
d2 = warshall_floyd(N, newdp)
for i in range(Q):
ans = d2[s[i]][t[i]] - 1
if ans != inf:
print(ans)
else:
print("-1")
| from scipy.sparse.csgraph import csgraph_from_dense, dijkstra, floyd_warshall
import sys
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
mod = 10**9 + 7
inf = float("inf")
ans = int(0)
N, M, L = LI()
s = []
t = []
dp = [[inf] * (N) for _ in range(N)]
for i in range(M):
a, b, c = list(map(int, input().split()))
dp[a - 1][b - 1] = c
dp[b - 1][a - 1] = c
Q = I()
for i in range(Q):
a, b = LI()
s.append(a - 1)
t.append(b - 1)
for i in range(N):
dp[i][i] = 0
# print(warshall_floyd(N,dp))
# d1 = [[0] * (N) for _ in range(N)]
# d1 = warshall_floyd(N,dp)
G = csgraph_from_dense(dp)
d1 = floyd_warshall(G)
newdp = [[inf] * (N) for _ in range(N)]
for i in range(N):
for j in range(i + 1, N):
if d1[i][j] <= L:
newdp[i][j] = 1
newdp[j][i] = 1
for i in range(N):
newdp[i][i] = 0
# print(newdp)
# print(warshall_floyd(N,newdp))
# d2 = [[0] * (N) for _ in range(N)]
# d2 = warshall_floyd(N,newdp)
G2 = csgraph_from_dense(newdp)
d2 = floyd_warshall(G2)
for i in range(Q):
ans = d2[s[i]][t[i]] - 1
if ans != inf:
print((int(ans)))
else:
print("-1")
| false | 10.344828 | [
"-#################################",
"-##ワーシャルフロイド法 n~3",
"-#################################",
"-def warshall_floyd(n, d):",
"- # d[i][j]: iからjへの最短距離",
"- for k in range(n):",
"- for i in range(n):",
"- for j in range(n):",
"- d[i][j] = min(d[i][j], d[i][k] + d[k][j])",
"- return d",
"-",
"-",
"-##############################",
"+from scipy.sparse.csgraph import csgraph_from_dense, dijkstra, floyd_warshall",
"-d1 = [[0] * (N) for _ in range(N)]",
"-d1 = warshall_floyd(N, dp)",
"+# d1 = [[0] * (N) for _ in range(N)]",
"+# d1 = warshall_floyd(N,dp)",
"+G = csgraph_from_dense(dp)",
"+d1 = floyd_warshall(G)",
"-d2 = [[0] * (N) for _ in range(N)]",
"-d2 = warshall_floyd(N, newdp)",
"+# d2 = [[0] * (N) for _ in range(N)]",
"+# d2 = warshall_floyd(N,newdp)",
"+G2 = csgraph_from_dense(newdp)",
"+d2 = floyd_warshall(G2)",
"- print(ans)",
"+ print((int(ans)))"
] | false | 0.036441 | 0.514132 | 0.070878 | [
"s669065916",
"s847397888"
] |
u729133443 | p02862 | python | s592844321 | s388177655 | 759 | 412 | 82,392 | 122,296 | Accepted | Accepted | 45.72 | M=10**9+7
f=[1]
for j in range(1,10**6):f+=f[-1]*j%M,
i=[pow(f[-1],M-2,M)]
for j in range(1,10**6)[::-1]:i+=i[-1]*j%M,
x,y=list(map(int,input().split()))
n,m=divmod(x+y,3)
print(((m<1)*(x*2>=y)*(y*2>=x)*(y-n<=n)*f[n]*i[~n-n+y]*i[~y+n]%M)) | M=10**9+7
f=[1]
for j in range(1,10**6):f+=f[-1]*j%M,
i=[pow(f[-1],M-2,M)]
for j in range(1,10**6)[::-1]:i+=i[-1]*j%M,
x,y=list(map(int,input().split()))
n,m=divmod(x+y,3)
print(((m<1)*(x*2>=y)*(y*2>=x)*f[n]*i[~n-n+y]*i[~y+n]%M)) | 8 | 8 | 237 | 228 | M = 10**9 + 7
f = [1]
for j in range(1, 10**6):
f += (f[-1] * j % M,)
i = [pow(f[-1], M - 2, M)]
for j in range(1, 10**6)[::-1]:
i += (i[-1] * j % M,)
x, y = list(map(int, input().split()))
n, m = divmod(x + y, 3)
print(
(
(m < 1)
* (x * 2 >= y)
* (y * 2 >= x)
* (y - n <= n)
* f[n]
* i[~n - n + y]
* i[~y + n]
% M
)
)
| M = 10**9 + 7
f = [1]
for j in range(1, 10**6):
f += (f[-1] * j % M,)
i = [pow(f[-1], M - 2, M)]
for j in range(1, 10**6)[::-1]:
i += (i[-1] * j % M,)
x, y = list(map(int, input().split()))
n, m = divmod(x + y, 3)
print(((m < 1) * (x * 2 >= y) * (y * 2 >= x) * f[n] * i[~n - n + y] * i[~y + n] % M))
| false | 0 | [
"-print(",
"- (",
"- (m < 1)",
"- * (x * 2 >= y)",
"- * (y * 2 >= x)",
"- * (y - n <= n)",
"- * f[n]",
"- * i[~n - n + y]",
"- * i[~y + n]",
"- % M",
"- )",
"-)",
"+print(((m < 1) * (x * 2 >= y) * (y * 2 >= x) * f[n] * i[~n - n + y] * i[~y + n] % M))"
] | false | 2.650596 | 0.773108 | 3.428494 | [
"s592844321",
"s388177655"
] |
u911449886 | p03329 | python | s730928873 | s135293012 | 861 | 236 | 31,844 | 9,824 | Accepted | Accepted | 72.59 | import numpy as np
N = int(eval(input()))
#@njit
def main(n):
dp = []
for i in range(10**5+1):
dp.append(i)
dp = np.array(dp)
powers = [1]
i = 1
while True:
if 6**i>10**5:
break
powers.append(6**i)
if 9**i<=10**5:
powers.append(9**i)
i += 1
powers.sort()
for i in range(1,10**5+1):
for j in range(len(powers)):
if powers[j]>i:
break
dp[i] = min(dp[i],dp[i-powers[j]]+1)
print((dp[n]))
if __name__=="__main__":
main(N) | def getval():
n = int(eval(input()))
return n
def main(n):
dp = [0]
arr = [1]
a1 = 6
a2 = 9
for i in range(1,100):
if a1**i<=n:
arr.append(a1**i)
else:
break
for i in range(1,100):
if a2**i<=n:
arr.append(a2**i)
else:
break
arr.sort()
for i in range(1,n+1):
temp = i
for j in arr:
if j>i:
break
temp = min(temp,dp[i-j]+1)
dp.append(temp)
print((dp[n]))
if __name__=="__main__":
n = getval()
main(n) | 31 | 34 | 608 | 628 | import numpy as np
N = int(eval(input()))
# @njit
def main(n):
dp = []
for i in range(10**5 + 1):
dp.append(i)
dp = np.array(dp)
powers = [1]
i = 1
while True:
if 6**i > 10**5:
break
powers.append(6**i)
if 9**i <= 10**5:
powers.append(9**i)
i += 1
powers.sort()
for i in range(1, 10**5 + 1):
for j in range(len(powers)):
if powers[j] > i:
break
dp[i] = min(dp[i], dp[i - powers[j]] + 1)
print((dp[n]))
if __name__ == "__main__":
main(N)
| def getval():
n = int(eval(input()))
return n
def main(n):
dp = [0]
arr = [1]
a1 = 6
a2 = 9
for i in range(1, 100):
if a1**i <= n:
arr.append(a1**i)
else:
break
for i in range(1, 100):
if a2**i <= n:
arr.append(a2**i)
else:
break
arr.sort()
for i in range(1, n + 1):
temp = i
for j in arr:
if j > i:
break
temp = min(temp, dp[i - j] + 1)
dp.append(temp)
print((dp[n]))
if __name__ == "__main__":
n = getval()
main(n)
| false | 8.823529 | [
"-import numpy as np",
"+def getval():",
"+ n = int(eval(input()))",
"+ return n",
"-N = int(eval(input()))",
"-# @njit",
"+",
"- dp = []",
"- for i in range(10**5 + 1):",
"- dp.append(i)",
"- dp = np.array(dp)",
"- powers = [1]",
"- i = 1",
"- while True:",
"- if 6**i > 10**5:",
"+ dp = [0]",
"+ arr = [1]",
"+ a1 = 6",
"+ a2 = 9",
"+ for i in range(1, 100):",
"+ if a1**i <= n:",
"+ arr.append(a1**i)",
"+ else:",
"- powers.append(6**i)",
"- if 9**i <= 10**5:",
"- powers.append(9**i)",
"- i += 1",
"- powers.sort()",
"- for i in range(1, 10**5 + 1):",
"- for j in range(len(powers)):",
"- if powers[j] > i:",
"+ for i in range(1, 100):",
"+ if a2**i <= n:",
"+ arr.append(a2**i)",
"+ else:",
"+ break",
"+ arr.sort()",
"+ for i in range(1, n + 1):",
"+ temp = i",
"+ for j in arr:",
"+ if j > i:",
"- dp[i] = min(dp[i], dp[i - powers[j]] + 1)",
"+ temp = min(temp, dp[i - j] + 1)",
"+ dp.append(temp)",
"- main(N)",
"+ n = getval()",
"+ main(n)"
] | false | 0.858045 | 0.067625 | 12.688298 | [
"s730928873",
"s135293012"
] |
u644907318 | p03910 | python | s104189193 | s042342789 | 218 | 106 | 42,584 | 67,672 | Accepted | Accepted | 51.38 | N = int(eval(input()))
k = 1
while (k*(k+1))//2<N:
k += 1
A = [i for i in range(1,k+1)]
if N==(k*(k+1))//2:
for a in A:
print(a)
else:
m = (k*(k+1))//2-N
for a in A:
if a!=m:
print(a) | N = int(eval(input()))
A = []
while N>0:
k = 0
cnt = 0
while cnt<N:
k += 1
cnt += k
A.append(k)
N -= k
for a in A:
print(a) | 13 | 12 | 233 | 168 | N = int(eval(input()))
k = 1
while (k * (k + 1)) // 2 < N:
k += 1
A = [i for i in range(1, k + 1)]
if N == (k * (k + 1)) // 2:
for a in A:
print(a)
else:
m = (k * (k + 1)) // 2 - N
for a in A:
if a != m:
print(a)
| N = int(eval(input()))
A = []
while N > 0:
k = 0
cnt = 0
while cnt < N:
k += 1
cnt += k
A.append(k)
N -= k
for a in A:
print(a)
| false | 7.692308 | [
"-k = 1",
"-while (k * (k + 1)) // 2 < N:",
"- k += 1",
"-A = [i for i in range(1, k + 1)]",
"-if N == (k * (k + 1)) // 2:",
"- for a in A:",
"- print(a)",
"-else:",
"- m = (k * (k + 1)) // 2 - N",
"- for a in A:",
"- if a != m:",
"- print(a)",
"+A = []",
"+while N > 0:",
"+ k = 0",
"+ cnt = 0",
"+ while cnt < N:",
"+ k += 1",
"+ cnt += k",
"+ A.append(k)",
"+ N -= k",
"+for a in A:",
"+ print(a)"
] | false | 0.038476 | 0.080488 | 0.478032 | [
"s104189193",
"s042342789"
] |
u118642796 | p02820 | python | s786024268 | s252511016 | 304 | 206 | 67,704 | 51,596 | Accepted | Accepted | 32.24 | import sys
def I(): return int(sys.stdin.readline())
def LI(): return [int(x) for x in sys.stdin.readline().split()]
N,K = LI()
R,S,P = LI()
T = list(eval(input()))
dp = [[0]*3 for _ in range(N+1)]
def main():
for i in range(1,N+1):
if i<K:
if T[i-1] == 's':
dp[i] = [R,0,0]
if T[i-1] == 'p':
dp[i] = [0,S,0]
if T[i-1] == 'r':
dp[i] = [0,0,P]
else:
dp[i][0] = max(dp[i-K][1],dp[i-K][2])
dp[i][1] = max(dp[i-K][0],dp[i-K][2])
dp[i][2] = max(dp[i-K][0],dp[i-K][1])
if T[i-1] == 's':
dp[i][0] += R
if T[i-1] == 'p':
dp[i][1] += S
if T[i-1] == 'r':
dp[i][2] += P
ans = 0
for i in range(K):
ans += max(dp[N-i])
print(ans)
if __name__ == "__main__":
main()
| import sys
def I(): return int(sys.stdin.readline())
def LI(): return [int(x) for x in sys.stdin.readline().split()]
N,K = LI()
R,S,P = LI()
T = list(eval(input()))
hand = []
def main():
ans = 0
for i in range(N):
if T[i] == 's':
if i<K or hand[i-K]!='r':
ans += R
hand.append('r')
else:
hand.append('x')
if T[i] == 'p':
if i<K or hand[i-K] != 's':
ans += S
hand.append('s')
else:
hand.append('x')
if T[i] == 'r':
if i<K or hand[i-K] != 'p':
ans += P
hand.append('p')
else:
hand.append('x')
print(ans)
if __name__ == "__main__":
main()
| 36 | 34 | 932 | 822 | import sys
def I():
return int(sys.stdin.readline())
def LI():
return [int(x) for x in sys.stdin.readline().split()]
N, K = LI()
R, S, P = LI()
T = list(eval(input()))
dp = [[0] * 3 for _ in range(N + 1)]
def main():
for i in range(1, N + 1):
if i < K:
if T[i - 1] == "s":
dp[i] = [R, 0, 0]
if T[i - 1] == "p":
dp[i] = [0, S, 0]
if T[i - 1] == "r":
dp[i] = [0, 0, P]
else:
dp[i][0] = max(dp[i - K][1], dp[i - K][2])
dp[i][1] = max(dp[i - K][0], dp[i - K][2])
dp[i][2] = max(dp[i - K][0], dp[i - K][1])
if T[i - 1] == "s":
dp[i][0] += R
if T[i - 1] == "p":
dp[i][1] += S
if T[i - 1] == "r":
dp[i][2] += P
ans = 0
for i in range(K):
ans += max(dp[N - i])
print(ans)
if __name__ == "__main__":
main()
| import sys
def I():
return int(sys.stdin.readline())
def LI():
return [int(x) for x in sys.stdin.readline().split()]
N, K = LI()
R, S, P = LI()
T = list(eval(input()))
hand = []
def main():
ans = 0
for i in range(N):
if T[i] == "s":
if i < K or hand[i - K] != "r":
ans += R
hand.append("r")
else:
hand.append("x")
if T[i] == "p":
if i < K or hand[i - K] != "s":
ans += S
hand.append("s")
else:
hand.append("x")
if T[i] == "r":
if i < K or hand[i - K] != "p":
ans += P
hand.append("p")
else:
hand.append("x")
print(ans)
if __name__ == "__main__":
main()
| false | 5.555556 | [
"-dp = [[0] * 3 for _ in range(N + 1)]",
"+hand = []",
"- for i in range(1, N + 1):",
"- if i < K:",
"- if T[i - 1] == \"s\":",
"- dp[i] = [R, 0, 0]",
"- if T[i - 1] == \"p\":",
"- dp[i] = [0, S, 0]",
"- if T[i - 1] == \"r\":",
"- dp[i] = [0, 0, P]",
"- else:",
"- dp[i][0] = max(dp[i - K][1], dp[i - K][2])",
"- dp[i][1] = max(dp[i - K][0], dp[i - K][2])",
"- dp[i][2] = max(dp[i - K][0], dp[i - K][1])",
"- if T[i - 1] == \"s\":",
"- dp[i][0] += R",
"- if T[i - 1] == \"p\":",
"- dp[i][1] += S",
"- if T[i - 1] == \"r\":",
"- dp[i][2] += P",
"- for i in range(K):",
"- ans += max(dp[N - i])",
"+ for i in range(N):",
"+ if T[i] == \"s\":",
"+ if i < K or hand[i - K] != \"r\":",
"+ ans += R",
"+ hand.append(\"r\")",
"+ else:",
"+ hand.append(\"x\")",
"+ if T[i] == \"p\":",
"+ if i < K or hand[i - K] != \"s\":",
"+ ans += S",
"+ hand.append(\"s\")",
"+ else:",
"+ hand.append(\"x\")",
"+ if T[i] == \"r\":",
"+ if i < K or hand[i - K] != \"p\":",
"+ ans += P",
"+ hand.append(\"p\")",
"+ else:",
"+ hand.append(\"x\")"
] | false | 0.036324 | 0.044753 | 0.811654 | [
"s786024268",
"s252511016"
] |
u062691227 | p02669 | python | s300250414 | s490800131 | 517 | 279 | 92,780 | 85,780 | Accepted | Accepted | 46.03 | t = int(eval(input()))
import sys
sys.setrecursionlimit(10 ** 6)
def calc(x):
if x in dp:
return dp[x]
divs = [5, 3, 2]
costs = [c, b, a]
res = d * x
for div, cost in zip(divs, costs):
dived = x//div
res = min(res, calc(dived) + cost + abs(x-dived*div) * d)
if x > div:
dived = x//div+1
res = min(res, calc(dived) + cost + abs(x-dived*div) * d)
dp[x] = res
return res
for _ in range(t):
n, a, b, c, d = list(map(int, input().split()))
dp = {}
dp[0] = 0
dp[1] = d
print((calc(n)))
| t = int(eval(input()))
def calc(x):
if x not in dp:
divs = [5, 3, 2]
costs = [c, b, a]
values = lambda div, cost: [calc(x // div) + cost + x % div * d, calc((x + div - 1) // div) + cost + (-x) % div * d]
dp[x] = min(x * d, *[value for div, cost in zip(divs, costs) for value in values(div, cost)])
return dp[x]
for _ in range(t):
n, a, b, c, d = list(map(int, input().split()))
dp = {0: 0, 1: d}
print((calc(n)))
| 27 | 14 | 610 | 466 | t = int(eval(input()))
import sys
sys.setrecursionlimit(10**6)
def calc(x):
if x in dp:
return dp[x]
divs = [5, 3, 2]
costs = [c, b, a]
res = d * x
for div, cost in zip(divs, costs):
dived = x // div
res = min(res, calc(dived) + cost + abs(x - dived * div) * d)
if x > div:
dived = x // div + 1
res = min(res, calc(dived) + cost + abs(x - dived * div) * d)
dp[x] = res
return res
for _ in range(t):
n, a, b, c, d = list(map(int, input().split()))
dp = {}
dp[0] = 0
dp[1] = d
print((calc(n)))
| t = int(eval(input()))
def calc(x):
if x not in dp:
divs = [5, 3, 2]
costs = [c, b, a]
values = lambda div, cost: [
calc(x // div) + cost + x % div * d,
calc((x + div - 1) // div) + cost + (-x) % div * d,
]
dp[x] = min(
x * d,
*[value for div, cost in zip(divs, costs) for value in values(div, cost)]
)
return dp[x]
for _ in range(t):
n, a, b, c, d = list(map(int, input().split()))
dp = {0: 0, 1: d}
print((calc(n)))
| false | 48.148148 | [
"-import sys",
"-",
"-sys.setrecursionlimit(10**6)",
"- if x in dp:",
"- return dp[x]",
"- divs = [5, 3, 2]",
"- costs = [c, b, a]",
"- res = d * x",
"- for div, cost in zip(divs, costs):",
"- dived = x // div",
"- res = min(res, calc(dived) + cost + abs(x - dived * div) * d)",
"- if x > div:",
"- dived = x // div + 1",
"- res = min(res, calc(dived) + cost + abs(x - dived * div) * d)",
"- dp[x] = res",
"- return res",
"+ if x not in dp:",
"+ divs = [5, 3, 2]",
"+ costs = [c, b, a]",
"+ values = lambda div, cost: [",
"+ calc(x // div) + cost + x % div * d,",
"+ calc((x + div - 1) // div) + cost + (-x) % div * d,",
"+ ]",
"+ dp[x] = min(",
"+ x * d,",
"+ *[value for div, cost in zip(divs, costs) for value in values(div, cost)]",
"+ )",
"+ return dp[x]",
"- dp = {}",
"- dp[0] = 0",
"- dp[1] = d",
"+ dp = {0: 0, 1: d}"
] | false | 0.204928 | 0.276883 | 0.740124 | [
"s300250414",
"s490800131"
] |
u597455618 | p02793 | python | s457272342 | s208466800 | 1,565 | 575 | 4,084 | 4,084 | Accepted | Accepted | 63.26 | def gcd(m, n):
r = m % n
return gcd(n, r) if r else n
def lcm(m, n):
return m//gcd(m, n)*n
MOD = 10**9+7
n = int(eval(input()))
a = list(map(int, input().split()))
l = a[0]
for x in a:
l = lcm(x, l)
ans = 0
for x in a:
ans += l*pow(x, MOD-2, MOD)%MOD
print((ans%MOD))
| def gcd(m, n):
r = m % n
return gcd(n, r) if r else n
def lcm(m, n):
return m//gcd(m, n)*n
MOD = 10**9+7
n = int(eval(input()))
a = list(map(int, input().split()))
l = a[0]
for x in a[1:]:
l = lcm(x, l)
l %= MOD
ans = 0
for x in a:
ans += l*pow(x, MOD-2, MOD)%MOD
print((ans%MOD))
| 16 | 20 | 296 | 316 | def gcd(m, n):
r = m % n
return gcd(n, r) if r else n
def lcm(m, n):
return m // gcd(m, n) * n
MOD = 10**9 + 7
n = int(eval(input()))
a = list(map(int, input().split()))
l = a[0]
for x in a:
l = lcm(x, l)
ans = 0
for x in a:
ans += l * pow(x, MOD - 2, MOD) % MOD
print((ans % MOD))
| def gcd(m, n):
r = m % n
return gcd(n, r) if r else n
def lcm(m, n):
return m // gcd(m, n) * n
MOD = 10**9 + 7
n = int(eval(input()))
a = list(map(int, input().split()))
l = a[0]
for x in a[1:]:
l = lcm(x, l)
l %= MOD
ans = 0
for x in a:
ans += l * pow(x, MOD - 2, MOD) % MOD
print((ans % MOD))
| false | 20 | [
"-for x in a:",
"+for x in a[1:]:",
"+l %= MOD"
] | false | 0.077226 | 0.041334 | 1.868343 | [
"s457272342",
"s208466800"
] |
u744920373 | p03209 | python | s131743036 | s371129760 | 19 | 17 | 3,064 | 3,064 | Accepted | Accepted | 10.53 | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A))
N, X = mi()
'''
def rec(level):
if level == 0:
return 'P'
return 'B' + rec(level-1) + 'P' + rec(level-1) + 'B'
b = rec(N)
print(b)
'''
X -= 1
cnt = 0
level = N
while True:
if level == 0:
cnt += 1
break
half = 2**(level+1) - 2
#print(level, half, cnt)
if X == 0:
break
elif X == half * 2:
cnt += 2**(level+1) - 1
break
elif X > half:
cnt += 2**(level)
X -= half + 1
elif X == half:
cnt += 2**(level)
break
else:
X -= 1
level -= 1
print(cnt) | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A))
N, X = mi()
def rec(level, pos, score):
#print(level, pos, score)
if level == 0:
return score + 1
half = 2**(level+1) - 2
if pos == 0:
return score
elif pos == half * 2:
return score + 2**(level+1) - 1
elif pos == half:
return score + 2**(level)
elif pos > half:
score += 2**(level)
pos -= half + 1
else:
pos -= 1
return rec(level-1, pos, score)
X -= 1
print((rec(N, X, 0))) | 47 | 35 | 1,276 | 1,161 | import sys
sys.setrecursionlimit(10**8)
def ii():
return int(sys.stdin.readline())
def mi():
return list(map(int, sys.stdin.readline().split()))
def li():
return list(map(int, sys.stdin.readline().split()))
def li2(N):
return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j):
return [[ini] * i for i2 in range(j)]
def dp3(ini, i, j, k):
return [[[ini] * i for i2 in range(j)] for i3 in range(k)]
# import bisect #bisect.bisect_left(B, a)
# from collections import defaultdict #d = defaultdict(int) d[key] += value
# from collections import Counter # a = Counter(A).most_common()
# from itertools import accumulate #list(accumulate(A))
N, X = mi()
"""
def rec(level):
if level == 0:
return 'P'
return 'B' + rec(level-1) + 'P' + rec(level-1) + 'B'
b = rec(N)
print(b)
"""
X -= 1
cnt = 0
level = N
while True:
if level == 0:
cnt += 1
break
half = 2 ** (level + 1) - 2
# print(level, half, cnt)
if X == 0:
break
elif X == half * 2:
cnt += 2 ** (level + 1) - 1
break
elif X > half:
cnt += 2 ** (level)
X -= half + 1
elif X == half:
cnt += 2 ** (level)
break
else:
X -= 1
level -= 1
print(cnt)
| import sys
sys.setrecursionlimit(10**8)
def ii():
return int(sys.stdin.readline())
def mi():
return list(map(int, sys.stdin.readline().split()))
def li():
return list(map(int, sys.stdin.readline().split()))
def li2(N):
return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j):
return [[ini] * i for i2 in range(j)]
def dp3(ini, i, j, k):
return [[[ini] * i for i2 in range(j)] for i3 in range(k)]
# import bisect #bisect.bisect_left(B, a)
# from collections import defaultdict #d = defaultdict(int) d[key] += value
# from collections import Counter # a = Counter(A).most_common()
# from itertools import accumulate #list(accumulate(A))
N, X = mi()
def rec(level, pos, score):
# print(level, pos, score)
if level == 0:
return score + 1
half = 2 ** (level + 1) - 2
if pos == 0:
return score
elif pos == half * 2:
return score + 2 ** (level + 1) - 1
elif pos == half:
return score + 2 ** (level)
elif pos > half:
score += 2 ** (level)
pos -= half + 1
else:
pos -= 1
return rec(level - 1, pos, score)
X -= 1
print((rec(N, X, 0)))
| false | 25.531915 | [
"-\"\"\"",
"-def rec(level):",
"+",
"+",
"+def rec(level, pos, score):",
"+ # print(level, pos, score)",
"- return 'P'",
"- return 'B' + rec(level-1) + 'P' + rec(level-1) + 'B'",
"-b = rec(N)",
"-print(b)",
"-\"\"\"",
"+ return score + 1",
"+ half = 2 ** (level + 1) - 2",
"+ if pos == 0:",
"+ return score",
"+ elif pos == half * 2:",
"+ return score + 2 ** (level + 1) - 1",
"+ elif pos == half:",
"+ return score + 2 ** (level)",
"+ elif pos > half:",
"+ score += 2 ** (level)",
"+ pos -= half + 1",
"+ else:",
"+ pos -= 1",
"+ return rec(level - 1, pos, score)",
"+",
"+",
"-cnt = 0",
"-level = N",
"-while True:",
"- if level == 0:",
"- cnt += 1",
"- break",
"- half = 2 ** (level + 1) - 2",
"- # print(level, half, cnt)",
"- if X == 0:",
"- break",
"- elif X == half * 2:",
"- cnt += 2 ** (level + 1) - 1",
"- break",
"- elif X > half:",
"- cnt += 2 ** (level)",
"- X -= half + 1",
"- elif X == half:",
"- cnt += 2 ** (level)",
"- break",
"- else:",
"- X -= 1",
"- level -= 1",
"-print(cnt)",
"+print((rec(N, X, 0)))"
] | false | 0.045681 | 0.044803 | 1.019593 | [
"s131743036",
"s371129760"
] |
u956318161 | p02571 | python | s729934285 | s453852698 | 59 | 49 | 8,976 | 9,052 | Accepted | Accepted | 16.95 | S=eval(input())
T=eval(input())
N_max = len(T)
for i in range(len(S)-len(T)+1):
score=0
for j in range(len(T)):
if(S[i+j] != T[j]):
score += 1
N_max = min(score, N_max)
print(N_max) | s=eval(input())
t=eval(input())
scorelist=[]
for i in range(len(s)-len(t)+1):
S=s[i:i+len(t)]
score=0
for j in range(len(t)):
if S[j]!=t[j]:
score+=1
scorelist.append(str(score))
point=min(scorelist)
print(point)
| 13 | 12 | 208 | 230 | S = eval(input())
T = eval(input())
N_max = len(T)
for i in range(len(S) - len(T) + 1):
score = 0
for j in range(len(T)):
if S[i + j] != T[j]:
score += 1
N_max = min(score, N_max)
print(N_max)
| s = eval(input())
t = eval(input())
scorelist = []
for i in range(len(s) - len(t) + 1):
S = s[i : i + len(t)]
score = 0
for j in range(len(t)):
if S[j] != t[j]:
score += 1
scorelist.append(str(score))
point = min(scorelist)
print(point)
| false | 7.692308 | [
"-S = eval(input())",
"-T = eval(input())",
"-N_max = len(T)",
"-for i in range(len(S) - len(T) + 1):",
"+s = eval(input())",
"+t = eval(input())",
"+scorelist = []",
"+for i in range(len(s) - len(t) + 1):",
"+ S = s[i : i + len(t)]",
"- for j in range(len(T)):",
"- if S[i + j] != T[j]:",
"+ for j in range(len(t)):",
"+ if S[j] != t[j]:",
"- N_max = min(score, N_max)",
"-print(N_max)",
"+ scorelist.append(str(score))",
"+point = min(scorelist)",
"+print(point)"
] | false | 0.038118 | 0.044902 | 0.848907 | [
"s729934285",
"s453852698"
] |
u244416763 | p02859 | python | s824172879 | s802349826 | 17 | 11 | 2,940 | 2,568 | Accepted | Accepted | 35.29 | import math
x = int(eval(input()))
print(('{0}'.format(x**2))) | x = eval(input())
print(x*x) | 3 | 2 | 57 | 22 | import math
x = int(eval(input()))
print(("{0}".format(x**2)))
| x = eval(input())
print(x * x)
| false | 33.333333 | [
"-import math",
"-",
"-x = int(eval(input()))",
"-print((\"{0}\".format(x**2)))",
"+x = eval(input())",
"+print(x * x)"
] | false | 0.059234 | 0.041063 | 1.442513 | [
"s824172879",
"s802349826"
] |
u981931040 | p03545 | python | s297512702 | s744883884 | 20 | 17 | 3,064 | 3,060 | Accepted | Accepted | 15 | N = list(input())
num = list(map(lambda x: int(x) , N))
for i in range(8):
sum_val = num[0]
for j in range(3):
if i >> j & 1:
sum_val += num[j + 1]
else:
sum_val -= num[j + 1]
if sum_val == 7:
print(num[0] , end = '')
for j in range(3):
if i >> j & 1:
print("+" , end = '')
else:
print("-",end = '')
print(num[j + 1] , end = '')
print('=7')
exit()
| S = list(eval(input()))
opt = ['-', '+']
for i in range(8):
now = S[0]
for j in range(3):
if i >> j & 1:
now += opt[1]
else:
now += opt[0]
now += S[j + 1]
if eval(now) == 7:
print((now + "=7"))
exit()
| 19 | 14 | 518 | 283 | N = list(input())
num = list(map(lambda x: int(x), N))
for i in range(8):
sum_val = num[0]
for j in range(3):
if i >> j & 1:
sum_val += num[j + 1]
else:
sum_val -= num[j + 1]
if sum_val == 7:
print(num[0], end="")
for j in range(3):
if i >> j & 1:
print("+", end="")
else:
print("-", end="")
print(num[j + 1], end="")
print("=7")
exit()
| S = list(eval(input()))
opt = ["-", "+"]
for i in range(8):
now = S[0]
for j in range(3):
if i >> j & 1:
now += opt[1]
else:
now += opt[0]
now += S[j + 1]
if eval(now) == 7:
print((now + "=7"))
exit()
| false | 26.315789 | [
"-N = list(input())",
"-num = list(map(lambda x: int(x), N))",
"+S = list(eval(input()))",
"+opt = [\"-\", \"+\"]",
"- sum_val = num[0]",
"+ now = S[0]",
"- sum_val += num[j + 1]",
"+ now += opt[1]",
"- sum_val -= num[j + 1]",
"- if sum_val == 7:",
"- print(num[0], end=\"\")",
"- for j in range(3):",
"- if i >> j & 1:",
"- print(\"+\", end=\"\")",
"- else:",
"- print(\"-\", end=\"\")",
"- print(num[j + 1], end=\"\")",
"- print(\"=7\")",
"+ now += opt[0]",
"+ now += S[j + 1]",
"+ if eval(now) == 7:",
"+ print((now + \"=7\"))"
] | false | 0.121564 | 0.043362 | 2.803459 | [
"s297512702",
"s744883884"
] |
u540877546 | p03436 | python | s557380525 | s921562503 | 205 | 87 | 42,480 | 69,828 | Accepted | Accepted | 57.56 | from collections import deque
r, c = list(map(int, input().split()))
sy, sx = [0, 0]
gy, gx = [r-1, c-1]
s = [list(map(str, list(eval(input())))) for i in range(r)]
N = r*c
G = [[] for _ in range(N)]
w_c = 0
for i in range(r):
for j in range(c):
if s[i][j] == '.':
w_c += 1
for x, y in ([0, 1], [0, -1], [1, 0], [-1, 0]):
if 0 <= i+y <= r-1 and 0 <= j+x <= c-1:
if s[i+y][j+x] == '.':
G[i*c+j].append((i+y)*c+j+x)
# G[v]: 頂点vに隣接する頂点list
# N: 頂点数
# print(G)
dist = [-1]*N
que = deque([sy*c+sx])
dist[sy*c+sx] = 0
while que:
v = que.popleft()
d = dist[v]
for w in G[v]:
if dist[w] > -1:
continue
dist[w] = d + 1
que.append(w)
if dist[gy*c+gx] == -1:
print((-1))
else:
print((w_c-dist[gy*c+gx]-1))
| from collections import defaultdict
from collections import deque
h, w = list(map(int, input().split()))
s = [list(map(str, list(eval(input())))) for i in range(h)] # 文字列の二次元配列入力
cnt_sharp = 0
G = defaultdict(lambda: [])
vec = [(0, 1), (0, -1), (1, 0), (-1, 0)]
for i in range(h):
for j in range(w):
if s[i][j] == '#':
cnt_sharp += 1
for dy, dx in vec:
if 0 <= i+dy < h and 0 <= j+dx < w and s[i+dy][j+dx] == '.':
G[(i+dy, j+dx)].append((i, j))
# G[v]: 頂点vに隣接する頂点list
dist = defaultdict(lambda: -1)
que = deque([(0, 0)])
dist[(0, 0)] = 1
while que:
v = que.popleft()
d = dist[v]
for ww in G[v]:
if dist[ww] > -1:
continue
dist[ww] = d + 1
que.append(ww)
if dist[(h-1, w-1)] == -1:
print((-1))
else:
print((h*w-cnt_sharp-dist[(h-1, w-1)]))
| 38 | 30 | 878 | 875 | from collections import deque
r, c = list(map(int, input().split()))
sy, sx = [0, 0]
gy, gx = [r - 1, c - 1]
s = [list(map(str, list(eval(input())))) for i in range(r)]
N = r * c
G = [[] for _ in range(N)]
w_c = 0
for i in range(r):
for j in range(c):
if s[i][j] == ".":
w_c += 1
for x, y in ([0, 1], [0, -1], [1, 0], [-1, 0]):
if 0 <= i + y <= r - 1 and 0 <= j + x <= c - 1:
if s[i + y][j + x] == ".":
G[i * c + j].append((i + y) * c + j + x)
# G[v]: 頂点vに隣接する頂点list
# N: 頂点数
# print(G)
dist = [-1] * N
que = deque([sy * c + sx])
dist[sy * c + sx] = 0
while que:
v = que.popleft()
d = dist[v]
for w in G[v]:
if dist[w] > -1:
continue
dist[w] = d + 1
que.append(w)
if dist[gy * c + gx] == -1:
print((-1))
else:
print((w_c - dist[gy * c + gx] - 1))
| from collections import defaultdict
from collections import deque
h, w = list(map(int, input().split()))
s = [list(map(str, list(eval(input())))) for i in range(h)] # 文字列の二次元配列入力
cnt_sharp = 0
G = defaultdict(lambda: [])
vec = [(0, 1), (0, -1), (1, 0), (-1, 0)]
for i in range(h):
for j in range(w):
if s[i][j] == "#":
cnt_sharp += 1
for dy, dx in vec:
if 0 <= i + dy < h and 0 <= j + dx < w and s[i + dy][j + dx] == ".":
G[(i + dy, j + dx)].append((i, j))
# G[v]: 頂点vに隣接する頂点list
dist = defaultdict(lambda: -1)
que = deque([(0, 0)])
dist[(0, 0)] = 1
while que:
v = que.popleft()
d = dist[v]
for ww in G[v]:
if dist[ww] > -1:
continue
dist[ww] = d + 1
que.append(ww)
if dist[(h - 1, w - 1)] == -1:
print((-1))
else:
print((h * w - cnt_sharp - dist[(h - 1, w - 1)]))
| false | 21.052632 | [
"+from collections import defaultdict",
"-r, c = list(map(int, input().split()))",
"-sy, sx = [0, 0]",
"-gy, gx = [r - 1, c - 1]",
"-s = [list(map(str, list(eval(input())))) for i in range(r)]",
"-N = r * c",
"-G = [[] for _ in range(N)]",
"-w_c = 0",
"-for i in range(r):",
"- for j in range(c):",
"- if s[i][j] == \".\":",
"- w_c += 1",
"- for x, y in ([0, 1], [0, -1], [1, 0], [-1, 0]):",
"- if 0 <= i + y <= r - 1 and 0 <= j + x <= c - 1:",
"- if s[i + y][j + x] == \".\":",
"- G[i * c + j].append((i + y) * c + j + x)",
"+h, w = list(map(int, input().split()))",
"+s = [list(map(str, list(eval(input())))) for i in range(h)] # 文字列の二次元配列入力",
"+cnt_sharp = 0",
"+G = defaultdict(lambda: [])",
"+vec = [(0, 1), (0, -1), (1, 0), (-1, 0)]",
"+for i in range(h):",
"+ for j in range(w):",
"+ if s[i][j] == \"#\":",
"+ cnt_sharp += 1",
"+ for dy, dx in vec:",
"+ if 0 <= i + dy < h and 0 <= j + dx < w and s[i + dy][j + dx] == \".\":",
"+ G[(i + dy, j + dx)].append((i, j))",
"-# N: 頂点数",
"-# print(G)",
"-dist = [-1] * N",
"-que = deque([sy * c + sx])",
"-dist[sy * c + sx] = 0",
"+dist = defaultdict(lambda: -1)",
"+que = deque([(0, 0)])",
"+dist[(0, 0)] = 1",
"- for w in G[v]:",
"- if dist[w] > -1:",
"+ for ww in G[v]:",
"+ if dist[ww] > -1:",
"- dist[w] = d + 1",
"- que.append(w)",
"-if dist[gy * c + gx] == -1:",
"+ dist[ww] = d + 1",
"+ que.append(ww)",
"+if dist[(h - 1, w - 1)] == -1:",
"- print((w_c - dist[gy * c + gx] - 1))",
"+ print((h * w - cnt_sharp - dist[(h - 1, w - 1)]))"
] | false | 0.041932 | 0.148922 | 0.281573 | [
"s557380525",
"s921562503"
] |
u360061665 | p02660 | python | s327052821 | s639264105 | 138 | 119 | 29,124 | 34,728 | Accepted | Accepted | 13.77 | import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(read())
U = 10**6
is_prime = np.zeros(U, np.bool_)
is_prime[2] = 1
is_prime[3::2] = 1
for p in range(3, U, 2):
if p * p >= U:
break
if is_prime[p]:
is_prime[p * p::p + p] = 0
primes = is_prime.nonzero()[0]
def factor(N):
div = primes[N % primes == 0]
for p in div:
e = 0
while N % p == 0:
e += 1
N //= p
yield (p, e)
if N != 1:
yield (N, 1)
A = np.zeros(100, np.int32)
for i in range(14):
k = i * (i + 1) // 2
A[k] = i
np.maximum.accumulate(A, out=A)
x = 0
for p, e in factor(N):
x += A[e]
print(x)
| import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(read())
U = 10**6
is_prime = np.zeros(U, np.bool_)
is_prime[2] = 1
is_prime[3::2] = 1
for p in range(3, U, 2):
if p * p >= U:
break
if is_prime[p]:
is_prime[p * p::p * p] = 0
primes = is_prime.nonzero()[0]
def factor(N):
div = primes[N % primes == 0]
for p in div:
e = 0
while N % p == 0:
e += 1
N //= p
yield (p, e)
if N != 1:
yield (N, 1)
A = np.zeros(100, np.int32)
for i in range(14):
k = i * (i + 1) // 2
A[k] = i
np.maximum.accumulate(A, out=A)
x = 0
for p, e in factor(N):
x += A[e]
print(x)
| 44 | 44 | 798 | 798 | import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(read())
U = 10**6
is_prime = np.zeros(U, np.bool_)
is_prime[2] = 1
is_prime[3::2] = 1
for p in range(3, U, 2):
if p * p >= U:
break
if is_prime[p]:
is_prime[p * p :: p + p] = 0
primes = is_prime.nonzero()[0]
def factor(N):
div = primes[N % primes == 0]
for p in div:
e = 0
while N % p == 0:
e += 1
N //= p
yield (p, e)
if N != 1:
yield (N, 1)
A = np.zeros(100, np.int32)
for i in range(14):
k = i * (i + 1) // 2
A[k] = i
np.maximum.accumulate(A, out=A)
x = 0
for p, e in factor(N):
x += A[e]
print(x)
| import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(read())
U = 10**6
is_prime = np.zeros(U, np.bool_)
is_prime[2] = 1
is_prime[3::2] = 1
for p in range(3, U, 2):
if p * p >= U:
break
if is_prime[p]:
is_prime[p * p :: p * p] = 0
primes = is_prime.nonzero()[0]
def factor(N):
div = primes[N % primes == 0]
for p in div:
e = 0
while N % p == 0:
e += 1
N //= p
yield (p, e)
if N != 1:
yield (N, 1)
A = np.zeros(100, np.int32)
for i in range(14):
k = i * (i + 1) // 2
A[k] = i
np.maximum.accumulate(A, out=A)
x = 0
for p, e in factor(N):
x += A[e]
print(x)
| false | 0 | [
"- is_prime[p * p :: p + p] = 0",
"+ is_prime[p * p :: p * p] = 0"
] | false | 0.255332 | 0.262802 | 0.971577 | [
"s327052821",
"s639264105"
] |
u462831976 | p00022 | python | s535213106 | s097337122 | 50 | 40 | 7,748 | 7,800 | Accepted | Accepted | 20 | while True:
n = int(eval(input()))
if n == 0:
break
s = [int(eval(input()))]
for i in range(1, n):
a = int(eval(input()))
s.append(max(a, a + s[i - 1]))
print((max(s))) | # -*- coding: utf-8 -*-
import sys
import os
def max_seq(A):
s = []
s.append(A[0])
for i in range(1, len(A)):
v = max(A[i], A[i] + s[i-1])
s.append(v)
return max(s)
while True:
s = input().strip()
if s == '0':
break
N = int(s)
A = []
for i in range(N):
v = int(eval(input()))
A.append(v)
print((max_seq(A))) | 9 | 26 | 200 | 410 | while True:
n = int(eval(input()))
if n == 0:
break
s = [int(eval(input()))]
for i in range(1, n):
a = int(eval(input()))
s.append(max(a, a + s[i - 1]))
print((max(s)))
| # -*- coding: utf-8 -*-
import sys
import os
def max_seq(A):
s = []
s.append(A[0])
for i in range(1, len(A)):
v = max(A[i], A[i] + s[i - 1])
s.append(v)
return max(s)
while True:
s = input().strip()
if s == "0":
break
N = int(s)
A = []
for i in range(N):
v = int(eval(input()))
A.append(v)
print((max_seq(A)))
| false | 65.384615 | [
"+# -*- coding: utf-8 -*-",
"+import sys",
"+import os",
"+",
"+",
"+def max_seq(A):",
"+ s = []",
"+ s.append(A[0])",
"+ for i in range(1, len(A)):",
"+ v = max(A[i], A[i] + s[i - 1])",
"+ s.append(v)",
"+ return max(s)",
"+",
"+",
"- n = int(eval(input()))",
"- if n == 0:",
"+ s = input().strip()",
"+ if s == \"0\":",
"- s = [int(eval(input()))]",
"- for i in range(1, n):",
"- a = int(eval(input()))",
"- s.append(max(a, a + s[i - 1]))",
"- print((max(s)))",
"+ N = int(s)",
"+ A = []",
"+ for i in range(N):",
"+ v = int(eval(input()))",
"+ A.append(v)",
"+ print((max_seq(A)))"
] | false | 0.090867 | 0.046856 | 1.939285 | [
"s535213106",
"s097337122"
] |
u919633157 | p03606 | python | s209926690 | s375665409 | 29 | 20 | 3,060 | 3,188 | Accepted | Accepted | 31.03 | n=int(eval(input()))
ans=0
for i in range(n):
ans+=~(eval(input().replace(' ','-')))+2
print(ans) | # https://atcoder.jp/contests/abc073/tasks/abc073_b
n=int(eval(input()))
lr=[tuple(map(int,input().split())) for _ in range(n)]
ans=0
for l,r in lr:
ans+=r-l+1
print(ans) | 5 | 8 | 99 | 176 | n = int(eval(input()))
ans = 0
for i in range(n):
ans += ~(eval(input().replace(" ", "-"))) + 2
print(ans)
| # https://atcoder.jp/contests/abc073/tasks/abc073_b
n = int(eval(input()))
lr = [tuple(map(int, input().split())) for _ in range(n)]
ans = 0
for l, r in lr:
ans += r - l + 1
print(ans)
| false | 37.5 | [
"+# https://atcoder.jp/contests/abc073/tasks/abc073_b",
"+lr = [tuple(map(int, input().split())) for _ in range(n)]",
"-for i in range(n):",
"- ans += ~(eval(input().replace(\" \", \"-\"))) + 2",
"+for l, r in lr:",
"+ ans += r - l + 1"
] | false | 0.035643 | 0.034847 | 1.022838 | [
"s209926690",
"s375665409"
] |
u604774382 | p02394 | python | s681158384 | s921701275 | 30 | 20 | 6,724 | 4,204 | Accepted | Accepted | 33.33 | #coding:utf-8
import sys
WHxyr=sys.stdin.readline()
nums=WHxyr.split( ' ' )
for i in range( len( nums) ):
nums[i] = int( nums[i] )
if (0 <= nums[2]-nums[4]) and (nums[2]+nums[4] <= nums[0]) and (0 <= nums[3]-nums[4]) and (nums[3]+nums[4] <= nums[1]):
print( "Yes" )
else:
print( "No" ) | import sys
W, H, x, y, r = [ int( val ) for val in sys.stdin.readline().split( " " ) ]
if (0 <= x-r) and (x+r <= W) and (0 <= y-r) and (y+r <= H):
print( "Yes" )
else:
print( "No" ) | 11 | 7 | 300 | 190 | # coding:utf-8
import sys
WHxyr = sys.stdin.readline()
nums = WHxyr.split(" ")
for i in range(len(nums)):
nums[i] = int(nums[i])
if (
(0 <= nums[2] - nums[4])
and (nums[2] + nums[4] <= nums[0])
and (0 <= nums[3] - nums[4])
and (nums[3] + nums[4] <= nums[1])
):
print("Yes")
else:
print("No")
| import sys
W, H, x, y, r = [int(val) for val in sys.stdin.readline().split(" ")]
if (0 <= x - r) and (x + r <= W) and (0 <= y - r) and (y + r <= H):
print("Yes")
else:
print("No")
| false | 36.363636 | [
"-# coding:utf-8",
"-WHxyr = sys.stdin.readline()",
"-nums = WHxyr.split(\" \")",
"-for i in range(len(nums)):",
"- nums[i] = int(nums[i])",
"-if (",
"- (0 <= nums[2] - nums[4])",
"- and (nums[2] + nums[4] <= nums[0])",
"- and (0 <= nums[3] - nums[4])",
"- and (nums[3] + nums[4] <= nums[1])",
"-):",
"+W, H, x, y, r = [int(val) for val in sys.stdin.readline().split(\" \")]",
"+if (0 <= x - r) and (x + r <= W) and (0 <= y - r) and (y + r <= H):"
] | false | 0.036992 | 0.035492 | 1.042264 | [
"s681158384",
"s921701275"
] |
u330661451 | p03043 | python | s533116897 | s254648748 | 41 | 28 | 3,060 | 2,940 | Accepted | Accepted | 31.71 | from math import ceil,pow,log2
n,k = list(map(int,(input().split())))
ans = 0
for i in range(1,n+1):
coin = 0;
if i < k:
coin = ceil(log2(k/i))
else:
ans += 1.0 / n
continue
ans += 1.0 / n / pow(2.0,coin)
print(ans) | import math
def main():
n,k = list(map(int,input().split()))
ans = 0.0
for i in range(1,n+1):
p = 1 / n
while i < k:
i *= 2
p /= 2
ans += p
print(("{:.10f}".format(ans)))
if __name__ == "__main__":
main()
| 16 | 17 | 268 | 285 | from math import ceil, pow, log2
n, k = list(map(int, (input().split())))
ans = 0
for i in range(1, n + 1):
coin = 0
if i < k:
coin = ceil(log2(k / i))
else:
ans += 1.0 / n
continue
ans += 1.0 / n / pow(2.0, coin)
print(ans)
| import math
def main():
n, k = list(map(int, input().split()))
ans = 0.0
for i in range(1, n + 1):
p = 1 / n
while i < k:
i *= 2
p /= 2
ans += p
print(("{:.10f}".format(ans)))
if __name__ == "__main__":
main()
| false | 5.882353 | [
"-from math import ceil, pow, log2",
"+import math",
"-n, k = list(map(int, (input().split())))",
"-ans = 0",
"-for i in range(1, n + 1):",
"- coin = 0",
"- if i < k:",
"- coin = ceil(log2(k / i))",
"- else:",
"- ans += 1.0 / n",
"- continue",
"- ans += 1.0 / n / pow(2.0, coin)",
"-print(ans)",
"+",
"+def main():",
"+ n, k = list(map(int, input().split()))",
"+ ans = 0.0",
"+ for i in range(1, n + 1):",
"+ p = 1 / n",
"+ while i < k:",
"+ i *= 2",
"+ p /= 2",
"+ ans += p",
"+ print((\"{:.10f}\".format(ans)))",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.043347 | 0.049186 | 0.881294 | [
"s533116897",
"s254648748"
] |
u254871849 | p03503 | python | s929707143 | s542703181 | 164 | 87 | 21,480 | 3,064 | Accepted | Accepted | 46.95 | import sys
import numpy as np
I = np.array(sys.stdin.read().split(), dtype=np.int64)
n = I[0]
f = I[1:1+10*n].reshape(n, 10)
p = I[1+10*n:].reshape(n, 11)
def main():
schedules = np.arange(1, 2**10)[:, None] >> np.arange(10) & 1
res = f & schedules[:, None]
res = np.sum(res, axis=2)
res = p[np.arange(n), res]
res = np.sum(res, axis=1)
ans = np.amax(res)
return ans
if __name__ == '__main__':
ans = main()
print(ans) | import sys
*I, = list(map(int, sys.stdin.read().split()))
n = I[0]
f = list(zip(*[iter(I[1:1+10*n])] * 10))
p = list(zip(*[iter(I[1+10*n:])] * 11))
def main():
res = -float('inf')
for i in range(1, 2**10):
cnt = [0] * n
for j in range(10):
if i >> j & 1:
for k in range(n):
cnt[k] += f[k][j]
profit = 0
for k in range(n):
profit += p[k][cnt[k]]
res = max(res, profit)
return res
if __name__ == '__main__':
ans = main()
print(ans) | 23 | 25 | 486 | 579 | import sys
import numpy as np
I = np.array(sys.stdin.read().split(), dtype=np.int64)
n = I[0]
f = I[1 : 1 + 10 * n].reshape(n, 10)
p = I[1 + 10 * n :].reshape(n, 11)
def main():
schedules = np.arange(1, 2**10)[:, None] >> np.arange(10) & 1
res = f & schedules[:, None]
res = np.sum(res, axis=2)
res = p[np.arange(n), res]
res = np.sum(res, axis=1)
ans = np.amax(res)
return ans
if __name__ == "__main__":
ans = main()
print(ans)
| import sys
(*I,) = list(map(int, sys.stdin.read().split()))
n = I[0]
f = list(zip(*[iter(I[1 : 1 + 10 * n])] * 10))
p = list(zip(*[iter(I[1 + 10 * n :])] * 11))
def main():
res = -float("inf")
for i in range(1, 2**10):
cnt = [0] * n
for j in range(10):
if i >> j & 1:
for k in range(n):
cnt[k] += f[k][j]
profit = 0
for k in range(n):
profit += p[k][cnt[k]]
res = max(res, profit)
return res
if __name__ == "__main__":
ans = main()
print(ans)
| false | 8 | [
"-import numpy as np",
"-I = np.array(sys.stdin.read().split(), dtype=np.int64)",
"+(*I,) = list(map(int, sys.stdin.read().split()))",
"-f = I[1 : 1 + 10 * n].reshape(n, 10)",
"-p = I[1 + 10 * n :].reshape(n, 11)",
"+f = list(zip(*[iter(I[1 : 1 + 10 * n])] * 10))",
"+p = list(zip(*[iter(I[1 + 10 * n :])] * 11))",
"- schedules = np.arange(1, 2**10)[:, None] >> np.arange(10) & 1",
"- res = f & schedules[:, None]",
"- res = np.sum(res, axis=2)",
"- res = p[np.arange(n), res]",
"- res = np.sum(res, axis=1)",
"- ans = np.amax(res)",
"- return ans",
"+ res = -float(\"inf\")",
"+ for i in range(1, 2**10):",
"+ cnt = [0] * n",
"+ for j in range(10):",
"+ if i >> j & 1:",
"+ for k in range(n):",
"+ cnt[k] += f[k][j]",
"+ profit = 0",
"+ for k in range(n):",
"+ profit += p[k][cnt[k]]",
"+ res = max(res, profit)",
"+ return res"
] | false | 0.230831 | 0.067937 | 3.397736 | [
"s929707143",
"s542703181"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.