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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u519939795 | p03338 | python | s243724016 | s776472345 | 21 | 17 | 3,064 | 2,940 | Accepted | Accepted | 19.05 | n=int(eval(input()))
s=eval(input())
t=""
k=""
l=[]
for i in range(1,n):
ans1=0
t=sorted(set(s[:i]))
k=sorted(set(s[i:]))
for i in t:
for j in k:
if i==j:
ans1+=1
l.append(ans1)
print((max(l))) | N = int(eval(input()))
S = eval(input())
ans = 0
for i in range(N):
ans = max(ans, len(set(S[:i]) & set(S[i:])))
print(ans)
| 15 | 7 | 249 | 123 | n = int(eval(input()))
s = eval(input())
t = ""
k = ""
l = []
for i in range(1, n):
ans1 = 0
t = sorted(set(s[:i]))
k = sorted(set(s[i:]))
for i in t:
for j in k:
if i == j:
ans1 += 1
l.append(ans1)
print((max(l)))
| N = int(eval(input()))
S = eval(input())
ans = 0
for i in range(N):
ans = max(ans, len(set(S[:i]) & set(S[i:])))
print(ans)
| false | 53.333333 | [
"-n = int(eval(input()))",
"-s = eval(input())",
"-t = \"\"",
"-k = \"\"",
"-l = []",
"-for i in range(1, n):",
"- ans1 = 0",
"- t = sorted(set(s[:i]))",
"- k = sorted(set(s[i:]))",
"- for i in t:",
"- for j in k:",
"- if i == j:",
"- ans1 += 1",
"- l.append(ans1)",
"-print((max(l)))",
"+N = int(eval(input()))",
"+S = eval(input())",
"+ans = 0",
"+for i in range(N):",
"+ ans = max(ans, len(set(S[:i]) & set(S[i:])))",
"+print(ans)"
] | false | 0.047152 | 0.045816 | 1.029154 | [
"s243724016",
"s776472345"
] |
u167988719 | p03128 | python | s154450292 | s427308795 | 531 | 116 | 245,128 | 14,836 | Accepted | Accepted | 78.15 | import sys
import copy
sys.setrecursionlimit(10**6)
m = [0,2,5,5,4,5,6,3,7,6]
def a_le_b(a, b):
la, lb = len(a), len(b)
if la == lb:
for i in range(la):
if a[i] < b[i]:
return True
elif a[i] > b[i]:
return False
return True
return la < lb
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
for i in range(len(A)-1, 0, -1):
for j in range(i-1, -1, -1):
if m[A[i]] == m[A[j]]:
del A[i]
break
# print(A)
dp = [[] for _ in range(N+1)]
for i in range(N):
if len(dp[i])==0 and i != 0: continue
x = copy.copy(dp[i]) + [0]
# print(x)
for j in range(len(A)):
ind = i + m[A[j]]
if ind <= N:
x[-1] = A[j]
if a_le_b(dp[ind], x):
dp[ind] = copy.copy(x)
# print(dp)
print((''.join(map(str, dp[-1]))))
| m = [0,2,5,5,4,5,6,3,7,6]
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
for i in range(len(A)-1, 0, -1):
for j in range(i-1, -1, -1):
if m[A[i]] == m[A[j]]:
del A[i]
break
dp = [-1] * (N+1)
dp[0] = 0
for i in range(N):
if dp[i]==-1: continue
for j in range(len(A)):
ind = i + m[A[j]]
if ind <= N:
dp[ind] = max(dp[ind], dp[i] * 10 + A[j])
print((dp[-1]))
| 41 | 22 | 961 | 494 | import sys
import copy
sys.setrecursionlimit(10**6)
m = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
def a_le_b(a, b):
la, lb = len(a), len(b)
if la == lb:
for i in range(la):
if a[i] < b[i]:
return True
elif a[i] > b[i]:
return False
return True
return la < lb
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
for i in range(len(A) - 1, 0, -1):
for j in range(i - 1, -1, -1):
if m[A[i]] == m[A[j]]:
del A[i]
break
# print(A)
dp = [[] for _ in range(N + 1)]
for i in range(N):
if len(dp[i]) == 0 and i != 0:
continue
x = copy.copy(dp[i]) + [0]
# print(x)
for j in range(len(A)):
ind = i + m[A[j]]
if ind <= N:
x[-1] = A[j]
if a_le_b(dp[ind], x):
dp[ind] = copy.copy(x)
# print(dp)
print(("".join(map(str, dp[-1]))))
| m = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
for i in range(len(A) - 1, 0, -1):
for j in range(i - 1, -1, -1):
if m[A[i]] == m[A[j]]:
del A[i]
break
dp = [-1] * (N + 1)
dp[0] = 0
for i in range(N):
if dp[i] == -1:
continue
for j in range(len(A)):
ind = i + m[A[j]]
if ind <= N:
dp[ind] = max(dp[ind], dp[i] * 10 + A[j])
print((dp[-1]))
| false | 46.341463 | [
"-import sys",
"-import copy",
"-",
"-sys.setrecursionlimit(10**6)",
"-",
"-",
"-def a_le_b(a, b):",
"- la, lb = len(a), len(b)",
"- if la == lb:",
"- for i in range(la):",
"- if a[i] < b[i]:",
"- return True",
"- elif a[i] > b[i]:",
"- return False",
"- return True",
"- return la < lb",
"-",
"-",
"-# print(A)",
"-dp = [[] for _ in range(N + 1)]",
"+dp = [-1] * (N + 1)",
"+dp[0] = 0",
"- if len(dp[i]) == 0 and i != 0:",
"+ if dp[i] == -1:",
"- x = copy.copy(dp[i]) + [0]",
"- # print(x)",
"- x[-1] = A[j]",
"- if a_le_b(dp[ind], x):",
"- dp[ind] = copy.copy(x)",
"-# print(dp)",
"-print((\"\".join(map(str, dp[-1]))))",
"+ dp[ind] = max(dp[ind], dp[i] * 10 + A[j])",
"+print((dp[-1]))"
] | false | 0.035894 | 0.035474 | 1.011819 | [
"s154450292",
"s427308795"
] |
u481187938 | p02834 | python | s848612382 | s765258662 | 275 | 251 | 107,704 | 107,324 | Accepted | Accepted | 8.73 | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline().rstrip())
def SL(): return list(sys.stdin.readline().rstrip())
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI1(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return [list(x) for x in sys.stdin.readline().split()]
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def LIR1(n): return [LI1() for _ in range(n)]
def SR(n): return [SL() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
def LR(n): return [L() for _ in range(n)]
def perm(n, r): return math.factorial(n) // math.factorial(r)
def comb(n, r): return math.factorial(n) // (math.factorial(r) * math.factorial(n-r))
def make_list(n, *args, default=0): return [make_list(*args, default=default) for _ in range(n)] if len(args) > 0 else [default for _ in range(n)]
def adjacency_list(N, edges):
g = make_list(N, 0)
for a, b in edges: g[a].append(b), g[b].append(a)
return g
def tree_utils(start, g):
parent, children, depth, q = [-1]*len(g), make_list(len(g), 0), [-1]*len(g), deque([start]); depth[start] = 0
while q:
i = q.popleft()
for j in g[i]:
if depth[j] != -1: parent[i] = j
else: depth[j] = depth[i] + 1; children[i].append(j), q.append(j)
return parent, children, depth
def graph_distance(start, g):
dist, q = [-1] * len(g), deque([start]); dist[start] = 0
while q:
i = q.popleft()
for j in g[i]:
if dist[j] == -1: dist[j] = dist[i] + 1; q.append(j)
return dist
sys.setrecursionlimit(1000000)
dire, dire8 = [[1, 0], [0, 1], [-1, 0], [0, -1]], [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]
alphabets, ALPHABETS = "abcdefghijklmnopqrstuvwxyz", "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
MOD, INF = 1000000007, float("inf")
def main():
N, u, v = LI()
AB = LIR1(N-1)
max_dist = [None] * N
g = adjacency_list(N, AB)
udist = graph_distance(u-1, g)
vdist = graph_distance(v-1, g)
visit = [False] * N
ans = vdist[u-1] - 1
q = deque([u-1])
while q:
i = q.popleft()
visit[i] = True
if udist[i] < vdist[i]:
ans = max(ans, vdist[i]-1)
for j in g[i]:
if not visit[j]:
q.append(j)
print(ans)
if __name__ == '__main__':
main() | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline().rstrip())
def SL(): return list(sys.stdin.readline().rstrip())
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI1(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return [list(x) for x in sys.stdin.readline().split()]
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def LIR1(n): return [LI1() for _ in range(n)]
def SR(n): return [SL() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
def LR(n): return [L() for _ in range(n)]
def perm(n, r): return math.factorial(n) // math.factorial(r)
def comb(n, r): return math.factorial(n) // (math.factorial(r) * math.factorial(n-r))
def make_list(n, *args, default=0): return [make_list(*args, default=default) for _ in range(n)] if len(args) > 0 else [default for _ in range(n)]
def adjacency_list(N, edges):
g = make_list(N, 0)
for a, b in edges: g[a].append(b), g[b].append(a)
return g
def tree_utils(start, g):
parent, children, depth, q = [-1]*len(g), make_list(len(g), 0), [-1]*len(g), deque([start]); depth[start] = 0
while q:
i = q.popleft()
for j in g[i]:
if depth[j] != -1: parent[i] = j
else: depth[j] = depth[i] + 1; children[i].append(j), q.append(j)
return parent, children, depth
def graph_distance(start, g):
dist, q = [-1] * len(g), deque([start]); dist[start] = 0
while q:
i = q.popleft()
for j in g[i]:
if dist[j] == -1: dist[j] = dist[i] + 1; q.append(j)
return dist
sys.setrecursionlimit(1000000)
dire, dire8 = [[1, 0], [0, 1], [-1, 0], [0, -1]], [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]
alphabets, ALPHABETS = "abcdefghijklmnopqrstuvwxyz", "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
MOD, INF = 1000000007, float("inf")
def main():
N, u, v = LI()
AB = LIR1(N-1)
max_dist = [None] * N
g = adjacency_list(N, AB)
udist = graph_distance(u-1, g)
vdist = graph_distance(v-1, g)
ans = vdist[u-1] - 1
for ud, vd in zip(udist, vdist):
if ud < vd:
ans = max(ans, vd - 1)
print(ans)
if __name__ == '__main__':
main() | 76 | 68 | 2,764 | 2,578 | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L():
return sys.stdin.readline().split()
def I():
return int(sys.stdin.readline().rstrip())
def SL():
return list(sys.stdin.readline().rstrip())
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def LI1():
return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS():
return [list(x) for x in sys.stdin.readline().split()]
def IR(n):
return [I() for _ in range(n)]
def LIR(n):
return [LI() for _ in range(n)]
def LIR1(n):
return [LI1() for _ in range(n)]
def SR(n):
return [SL() for _ in range(n)]
def LSR(n):
return [LS() for _ in range(n)]
def LR(n):
return [L() for _ in range(n)]
def perm(n, r):
return math.factorial(n) // math.factorial(r)
def comb(n, r):
return math.factorial(n) // (math.factorial(r) * math.factorial(n - r))
def make_list(n, *args, default=0):
return (
[make_list(*args, default=default) for _ in range(n)]
if len(args) > 0
else [default for _ in range(n)]
)
def adjacency_list(N, edges):
g = make_list(N, 0)
for a, b in edges:
g[a].append(b), g[b].append(a)
return g
def tree_utils(start, g):
parent, children, depth, q = (
[-1] * len(g),
make_list(len(g), 0),
[-1] * len(g),
deque([start]),
)
depth[start] = 0
while q:
i = q.popleft()
for j in g[i]:
if depth[j] != -1:
parent[i] = j
else:
depth[j] = depth[i] + 1
children[i].append(j), q.append(j)
return parent, children, depth
def graph_distance(start, g):
dist, q = [-1] * len(g), deque([start])
dist[start] = 0
while q:
i = q.popleft()
for j in g[i]:
if dist[j] == -1:
dist[j] = dist[i] + 1
q.append(j)
return dist
sys.setrecursionlimit(1000000)
dire, dire8 = [[1, 0], [0, 1], [-1, 0], [0, -1]], [
[1, 0],
[1, 1],
[0, 1],
[-1, 1],
[-1, 0],
[-1, -1],
[0, -1],
[1, -1],
]
alphabets, ALPHABETS = "abcdefghijklmnopqrstuvwxyz", "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
MOD, INF = 1000000007, float("inf")
def main():
N, u, v = LI()
AB = LIR1(N - 1)
max_dist = [None] * N
g = adjacency_list(N, AB)
udist = graph_distance(u - 1, g)
vdist = graph_distance(v - 1, g)
visit = [False] * N
ans = vdist[u - 1] - 1
q = deque([u - 1])
while q:
i = q.popleft()
visit[i] = True
if udist[i] < vdist[i]:
ans = max(ans, vdist[i] - 1)
for j in g[i]:
if not visit[j]:
q.append(j)
print(ans)
if __name__ == "__main__":
main()
| #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L():
return sys.stdin.readline().split()
def I():
return int(sys.stdin.readline().rstrip())
def SL():
return list(sys.stdin.readline().rstrip())
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def LI1():
return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS():
return [list(x) for x in sys.stdin.readline().split()]
def IR(n):
return [I() for _ in range(n)]
def LIR(n):
return [LI() for _ in range(n)]
def LIR1(n):
return [LI1() for _ in range(n)]
def SR(n):
return [SL() for _ in range(n)]
def LSR(n):
return [LS() for _ in range(n)]
def LR(n):
return [L() for _ in range(n)]
def perm(n, r):
return math.factorial(n) // math.factorial(r)
def comb(n, r):
return math.factorial(n) // (math.factorial(r) * math.factorial(n - r))
def make_list(n, *args, default=0):
return (
[make_list(*args, default=default) for _ in range(n)]
if len(args) > 0
else [default for _ in range(n)]
)
def adjacency_list(N, edges):
g = make_list(N, 0)
for a, b in edges:
g[a].append(b), g[b].append(a)
return g
def tree_utils(start, g):
parent, children, depth, q = (
[-1] * len(g),
make_list(len(g), 0),
[-1] * len(g),
deque([start]),
)
depth[start] = 0
while q:
i = q.popleft()
for j in g[i]:
if depth[j] != -1:
parent[i] = j
else:
depth[j] = depth[i] + 1
children[i].append(j), q.append(j)
return parent, children, depth
def graph_distance(start, g):
dist, q = [-1] * len(g), deque([start])
dist[start] = 0
while q:
i = q.popleft()
for j in g[i]:
if dist[j] == -1:
dist[j] = dist[i] + 1
q.append(j)
return dist
sys.setrecursionlimit(1000000)
dire, dire8 = [[1, 0], [0, 1], [-1, 0], [0, -1]], [
[1, 0],
[1, 1],
[0, 1],
[-1, 1],
[-1, 0],
[-1, -1],
[0, -1],
[1, -1],
]
alphabets, ALPHABETS = "abcdefghijklmnopqrstuvwxyz", "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
MOD, INF = 1000000007, float("inf")
def main():
N, u, v = LI()
AB = LIR1(N - 1)
max_dist = [None] * N
g = adjacency_list(N, AB)
udist = graph_distance(u - 1, g)
vdist = graph_distance(v - 1, g)
ans = vdist[u - 1] - 1
for ud, vd in zip(udist, vdist):
if ud < vd:
ans = max(ans, vd - 1)
print(ans)
if __name__ == "__main__":
main()
| false | 10.526316 | [
"- visit = [False] * N",
"- q = deque([u - 1])",
"- while q:",
"- i = q.popleft()",
"- visit[i] = True",
"- if udist[i] < vdist[i]:",
"- ans = max(ans, vdist[i] - 1)",
"- for j in g[i]:",
"- if not visit[j]:",
"- q.append(j)",
"+ for ud, vd in zip(udist, vdist):",
"+ if ud < vd:",
"+ ans = max(ans, vd - 1)"
] | false | 0.056258 | 0.038623 | 1.456576 | [
"s848612382",
"s765258662"
] |
u328510800 | p03207 | python | s734888151 | s228918557 | 26 | 24 | 9,108 | 9,136 | Accepted | Accepted | 7.69 | N = int(eval(input()))
P = sorted([int(eval(input())) for x in range(N)])
m = P[N-1]
P = P[:N-1]
print((sum(P) + m // 2)) | N = int(eval(input()))
m, *P = sorted([int(eval(input())) for x in range(N)], reverse=True)
"""
m = P[N-1]
P = P[:N-1]
"""
print((sum(P) + m // 2)) | 6 | 9 | 113 | 143 | N = int(eval(input()))
P = sorted([int(eval(input())) for x in range(N)])
m = P[N - 1]
P = P[: N - 1]
print((sum(P) + m // 2))
| N = int(eval(input()))
m, *P = sorted([int(eval(input())) for x in range(N)], reverse=True)
"""
m = P[N-1]
P = P[:N-1]
"""
print((sum(P) + m // 2))
| false | 33.333333 | [
"-P = sorted([int(eval(input())) for x in range(N)])",
"-m = P[N - 1]",
"-P = P[: N - 1]",
"+m, *P = sorted([int(eval(input())) for x in range(N)], reverse=True)",
"+\"\"\"",
"+m = P[N-1]",
"+P = P[:N-1]",
"+\"\"\""
] | false | 0.046459 | 0.04535 | 1.024464 | [
"s734888151",
"s228918557"
] |
u337626942 | p02595 | python | s447614585 | s000187438 | 497 | 319 | 9,636 | 69,792 | Accepted | Accepted | 35.81 | n, d=list(map(int, input().split()))
cnt=0
for i in range(n):
x, y=list(map(int, input().split()))
tmp=(x**2 +y**2)**0.5
if tmp<=d:
cnt+=1
print(cnt) | n, d=list(map(int, input().split()))
cnt=0
for i in range(n):
x, y=list(map(int, input().split()))
tmp=x**2 + y**2
if tmp<=d**2:
cnt+=1
print(cnt) | 10 | 10 | 168 | 165 | n, d = list(map(int, input().split()))
cnt = 0
for i in range(n):
x, y = list(map(int, input().split()))
tmp = (x**2 + y**2) ** 0.5
if tmp <= d:
cnt += 1
print(cnt)
| n, d = list(map(int, input().split()))
cnt = 0
for i in range(n):
x, y = list(map(int, input().split()))
tmp = x**2 + y**2
if tmp <= d**2:
cnt += 1
print(cnt)
| false | 0 | [
"- tmp = (x**2 + y**2) ** 0.5",
"- if tmp <= d:",
"+ tmp = x**2 + y**2",
"+ if tmp <= d**2:"
] | false | 0.043241 | 0.044373 | 0.974487 | [
"s447614585",
"s000187438"
] |
u384935968 | p03385 | python | s016949266 | s700236356 | 31 | 24 | 8,992 | 9,032 | Accepted | Accepted | 22.58 | S = eval(input())
if S[0] == S[1] or S[0] == S[2] or S[1] == S[2]:
print ('No')
else:
print ('Yes') | S = list(eval(input()))
S.sort()
a = ['a','b','c']
if S == a:
print('Yes')
else:
print('No') | 6 | 9 | 107 | 100 | S = eval(input())
if S[0] == S[1] or S[0] == S[2] or S[1] == S[2]:
print("No")
else:
print("Yes")
| S = list(eval(input()))
S.sort()
a = ["a", "b", "c"]
if S == a:
print("Yes")
else:
print("No")
| false | 33.333333 | [
"-S = eval(input())",
"-if S[0] == S[1] or S[0] == S[2] or S[1] == S[2]:",
"+S = list(eval(input()))",
"+S.sort()",
"+a = [\"a\", \"b\", \"c\"]",
"+if S == a:",
"+ print(\"Yes\")",
"+else:",
"-else:",
"- print(\"Yes\")"
] | false | 0.04044 | 0.041103 | 0.983873 | [
"s016949266",
"s700236356"
] |
u309423187 | p02755 | python | s399332841 | s022037729 | 22 | 18 | 3,064 | 2,940 | Accepted | Accepted | 18.18 | a, b = list(map(int, input().split()))
for i in range(10000):
if int(i * 0.08) == a and int(i * 0.1) == b:
print(i)
exit(0)
else :
print((-1))
| a, b = list(map(int, input().split()))
for i in range(1001):
if int(i * 0.08) == a and int(i * 0.1) == b:
print(i)
break
else:print((-1))
| 10 | 8 | 175 | 159 | a, b = list(map(int, input().split()))
for i in range(10000):
if int(i * 0.08) == a and int(i * 0.1) == b:
print(i)
exit(0)
else:
print((-1))
| a, b = list(map(int, input().split()))
for i in range(1001):
if int(i * 0.08) == a and int(i * 0.1) == b:
print(i)
break
else:
print((-1))
| false | 20 | [
"-for i in range(10000):",
"+for i in range(1001):",
"- exit(0)",
"+ break"
] | false | 0.04871 | 0.045298 | 1.075317 | [
"s399332841",
"s022037729"
] |
u039355749 | p02693 | python | s810922165 | s277303200 | 60 | 21 | 61,948 | 9,176 | Accepted | Accepted | 65 | k = int(eval(input()))
a, b = list(map(int, input().split()))
if (a%k == 0 or b%k == 0):
print('OK')
elif (a//k != b//k):
print('OK')
else:
print('NG') | k = int(eval(input()))
a, b = list(map(int, input().split()))
Flag = False
for i in range(a, b+1):
if (i%k == 0):
Flag = True
if (Flag):
print('OK')
else:
print('NG') | 9 | 12 | 154 | 177 | k = int(eval(input()))
a, b = list(map(int, input().split()))
if a % k == 0 or b % k == 0:
print("OK")
elif a // k != b // k:
print("OK")
else:
print("NG")
| k = int(eval(input()))
a, b = list(map(int, input().split()))
Flag = False
for i in range(a, b + 1):
if i % k == 0:
Flag = True
if Flag:
print("OK")
else:
print("NG")
| false | 25 | [
"-if a % k == 0 or b % k == 0:",
"- print(\"OK\")",
"-elif a // k != b // k:",
"+Flag = False",
"+for i in range(a, b + 1):",
"+ if i % k == 0:",
"+ Flag = True",
"+if Flag:"
] | false | 0.034623 | 0.04102 | 0.844047 | [
"s810922165",
"s277303200"
] |
u298297089 | p03266 | python | s844009132 | s012607425 | 184 | 158 | 39,024 | 3,064 | Accepted | Accepted | 14.13 | n,k = list(map(int, input().split()))
kk = 2*k
if k % 2:
tmp = (n//k)**3
print(tmp)
exit()
kk = 0
k2 = 0
kkk = 0
for i in range(k//2,n+1):
if i % k == 0:
kk += 1
if i % k == k//2:
k2 += 1
if i % k == 0 and i % k == k//2:
kkk += 1
# print(i, kk, k2, kkk)
print((kk**3 + k2**3 - kkk**3))
| n,k = list(map(int, input().split()))
a = 0
b = 0
c = 0
kk = k // 2
for i in range(1,n+1):
d = 2*i
if k % 2 == 0 and i % k == kk:
a += 1
if i % k == 0:
b += 1
if (k % 2 == 0 and i % k == kk) and i % k == 0:
c += 1
print((a**3 + b**3 - c**3))
# print(a,b,c) | 19 | 16 | 349 | 304 | n, k = list(map(int, input().split()))
kk = 2 * k
if k % 2:
tmp = (n // k) ** 3
print(tmp)
exit()
kk = 0
k2 = 0
kkk = 0
for i in range(k // 2, n + 1):
if i % k == 0:
kk += 1
if i % k == k // 2:
k2 += 1
if i % k == 0 and i % k == k // 2:
kkk += 1
# print(i, kk, k2, kkk)
print((kk**3 + k2**3 - kkk**3))
| n, k = list(map(int, input().split()))
a = 0
b = 0
c = 0
kk = k // 2
for i in range(1, n + 1):
d = 2 * i
if k % 2 == 0 and i % k == kk:
a += 1
if i % k == 0:
b += 1
if (k % 2 == 0 and i % k == kk) and i % k == 0:
c += 1
print((a**3 + b**3 - c**3))
# print(a,b,c)
| false | 15.789474 | [
"-kk = 2 * k",
"-if k % 2:",
"- tmp = (n // k) ** 3",
"- print(tmp)",
"- exit()",
"-kk = 0",
"-k2 = 0",
"-kkk = 0",
"-for i in range(k // 2, n + 1):",
"+a = 0",
"+b = 0",
"+c = 0",
"+kk = k // 2",
"+for i in range(1, n + 1):",
"+ d = 2 * i",
"+ if k % 2 == 0 and i % k == kk:",
"+ a += 1",
"- kk += 1",
"- if i % k == k // 2:",
"- k2 += 1",
"- if i % k == 0 and i % k == k // 2:",
"- kkk += 1",
"- # print(i, kk, k2, kkk)",
"-print((kk**3 + k2**3 - kkk**3))",
"+ b += 1",
"+ if (k % 2 == 0 and i % k == kk) and i % k == 0:",
"+ c += 1",
"+print((a**3 + b**3 - c**3))",
"+# print(a,b,c)"
] | false | 0.03766 | 0.037349 | 1.008322 | [
"s844009132",
"s012607425"
] |
u355371431 | p02813 | python | s945021952 | s488340546 | 212 | 174 | 46,192 | 44,656 | Accepted | Accepted | 17.92 | import itertools
N = int(eval(input()))
P = list(map(int,input().split()))
Q = list(map(int,input().split()))
seq = [x for x in range(1,N+1)]
L = list(itertools.permutations(seq))
for i in range(len(L)):
X = list(L[i])
if X == P:
a = i + 1
if X == Q:
b = i + 1
ans = abs(a-b)
print(ans) | import itertools
N = int(eval(input()))
P = tuple(map(int,input().split()))
Q = tuple(map(int,input().split()))
A = list(itertools.permutations(list(range(1,N+1))))
ans = abs(A.index(P) - A.index(Q))
print(ans) | 14 | 9 | 321 | 208 | import itertools
N = int(eval(input()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
seq = [x for x in range(1, N + 1)]
L = list(itertools.permutations(seq))
for i in range(len(L)):
X = list(L[i])
if X == P:
a = i + 1
if X == Q:
b = i + 1
ans = abs(a - b)
print(ans)
| import itertools
N = int(eval(input()))
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
A = list(itertools.permutations(list(range(1, N + 1))))
ans = abs(A.index(P) - A.index(Q))
print(ans)
| false | 35.714286 | [
"-P = list(map(int, input().split()))",
"-Q = list(map(int, input().split()))",
"-seq = [x for x in range(1, N + 1)]",
"-L = list(itertools.permutations(seq))",
"-for i in range(len(L)):",
"- X = list(L[i])",
"- if X == P:",
"- a = i + 1",
"- if X == Q:",
"- b = i + 1",
"-ans = abs(a - b)",
"+P = tuple(map(int, input().split()))",
"+Q = tuple(map(int, input().split()))",
"+A = list(itertools.permutations(list(range(1, N + 1))))",
"+ans = abs(A.index(P) - A.index(Q))"
] | false | 0.04675 | 0.13248 | 0.352885 | [
"s945021952",
"s488340546"
] |
u790710233 | p03830 | python | s987706564 | s251527095 | 25 | 22 | 3,444 | 3,316 | Accepted | Accepted | 12 | from collections import defaultdict
n = int(eval(input()))
MOD = 10**9+7
def factorization(n):
retval = []
tmp = n
for i in range(2, int(-(-n**.5//1))+1):
if tmp % i == 0:
cnt = 0
while tmp % i == 0:
cnt += 1
tmp //= i
retval.append((i, cnt))
if tmp != 1:
retval.append((tmp, 1))
if not retval:
retval.append((n, 1))
return retval
d = defaultdict(int)
for i in range(1, n+1):
f = factorization(i)
for k, v in f:
d[k] += v
ans = 1
for k, v in list(d.items()):
if k == 1:
continue
ans = ans*(v+1) % MOD
print(ans)
| from collections import defaultdict
MOD = 10**9+7
n = int(eval(input()))
def sieve(n):
n += 1
res = [i for i in range(n)]
for p in range(2, int(n**.5)+1):
if res[p] < p:
continue
for q in range(p**2, n, p):
if res[q] == q:
res[q] = p
return res
U = 10**3
min_factor = sieve(U)
pf = defaultdict(lambda: 0)
def prime_factor(n):
while 1 < n:
pf[min_factor[n]] += 1
n //= min_factor[n]
for i in range(1, n+1):
prime_factor(i)
ans = 1
for v in list(pf.values()):
ans *= v+1
ans %= MOD
print(ans)
| 36 | 36 | 690 | 627 | from collections import defaultdict
n = int(eval(input()))
MOD = 10**9 + 7
def factorization(n):
retval = []
tmp = n
for i in range(2, int(-(-(n**0.5) // 1)) + 1):
if tmp % i == 0:
cnt = 0
while tmp % i == 0:
cnt += 1
tmp //= i
retval.append((i, cnt))
if tmp != 1:
retval.append((tmp, 1))
if not retval:
retval.append((n, 1))
return retval
d = defaultdict(int)
for i in range(1, n + 1):
f = factorization(i)
for k, v in f:
d[k] += v
ans = 1
for k, v in list(d.items()):
if k == 1:
continue
ans = ans * (v + 1) % MOD
print(ans)
| from collections import defaultdict
MOD = 10**9 + 7
n = int(eval(input()))
def sieve(n):
n += 1
res = [i for i in range(n)]
for p in range(2, int(n**0.5) + 1):
if res[p] < p:
continue
for q in range(p**2, n, p):
if res[q] == q:
res[q] = p
return res
U = 10**3
min_factor = sieve(U)
pf = defaultdict(lambda: 0)
def prime_factor(n):
while 1 < n:
pf[min_factor[n]] += 1
n //= min_factor[n]
for i in range(1, n + 1):
prime_factor(i)
ans = 1
for v in list(pf.values()):
ans *= v + 1
ans %= MOD
print(ans)
| false | 0 | [
"+MOD = 10**9 + 7",
"-MOD = 10**9 + 7",
"-def factorization(n):",
"- retval = []",
"- tmp = n",
"- for i in range(2, int(-(-(n**0.5) // 1)) + 1):",
"- if tmp % i == 0:",
"- cnt = 0",
"- while tmp % i == 0:",
"- cnt += 1",
"- tmp //= i",
"- retval.append((i, cnt))",
"- if tmp != 1:",
"- retval.append((tmp, 1))",
"- if not retval:",
"- retval.append((n, 1))",
"- return retval",
"+def sieve(n):",
"+ n += 1",
"+ res = [i for i in range(n)]",
"+ for p in range(2, int(n**0.5) + 1):",
"+ if res[p] < p:",
"+ continue",
"+ for q in range(p**2, n, p):",
"+ if res[q] == q:",
"+ res[q] = p",
"+ return res",
"-d = defaultdict(int)",
"+U = 10**3",
"+min_factor = sieve(U)",
"+pf = defaultdict(lambda: 0)",
"+",
"+",
"+def prime_factor(n):",
"+ while 1 < n:",
"+ pf[min_factor[n]] += 1",
"+ n //= min_factor[n]",
"+",
"+",
"- f = factorization(i)",
"- for k, v in f:",
"- d[k] += v",
"+ prime_factor(i)",
"-for k, v in list(d.items()):",
"- if k == 1:",
"- continue",
"- ans = ans * (v + 1) % MOD",
"+for v in list(pf.values()):",
"+ ans *= v + 1",
"+ ans %= MOD"
] | false | 0.038022 | 0.040249 | 0.944679 | [
"s987706564",
"s251527095"
] |
u193264896 | p03031 | python | s993093794 | s552165239 | 43 | 30 | 5,168 | 9,088 | Accepted | Accepted | 30.23 | from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7
def main():
n, m = list(map(int, readline().split()))
sw = [[] for _ in range(m)]
for i in range(m):
sw[i] = list(map(int, readline().split()[1:]))
p = [int(x) for x in input().split()] # 不要
answer = 0
for jotai in product([0,1], repeat=n):
bl = True
for i in range(m):
s = sum([jotai[s-1] for s in sw[i]])
if (s-p[i])%2 != 0:
bl = False
break
if bl:
answer += 1
print(answer)
if __name__ == '__main__':
main() | import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
from itertools import product
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N, M = list(map(int, readline().split()))
S = []
for _ in range(M):
k, *s = list(map(int, readline().split()))
S.append(s)
P = list(map(int, readline().split()))
ans = 0
for switch in product((0,1),repeat=N):
for i, s in enumerate(S):
tmp = 0
for k in s:
tmp ^= switch[k-1]
if tmp==P[i]:
continue
else:
break
else:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| 43 | 36 | 1,254 | 751 | from collections import deque
from collections import Counter
from itertools import product, permutations, combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
# pypyではscipy, numpyは使えない
# from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
# from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
# import numpy as np
from fractions import gcd
from math import ceil, floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float("inf")
MOD = 10**9 + 7
def main():
n, m = list(map(int, readline().split()))
sw = [[] for _ in range(m)]
for i in range(m):
sw[i] = list(map(int, readline().split()[1:]))
p = [int(x) for x in input().split()] # 不要
answer = 0
for jotai in product([0, 1], repeat=n):
bl = True
for i in range(m):
s = sum([jotai[s - 1] for s in sw[i]])
if (s - p[i]) % 2 != 0:
bl = False
break
if bl:
answer += 1
print(answer)
if __name__ == "__main__":
main()
| import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
from itertools import product
sys.setrecursionlimit(10**8)
INF = float("inf")
MOD = 10**9 + 7
def main():
N, M = list(map(int, readline().split()))
S = []
for _ in range(M):
k, *s = list(map(int, readline().split()))
S.append(s)
P = list(map(int, readline().split()))
ans = 0
for switch in product((0, 1), repeat=N):
for i, s in enumerate(S):
tmp = 0
for k in s:
tmp ^= switch[k - 1]
if tmp == P[i]:
continue
else:
break
else:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| false | 16.27907 | [
"-from collections import deque",
"-from collections import Counter",
"-from itertools import product, permutations, combinations",
"-from operator import itemgetter",
"-from heapq import heappop, heappush",
"-from bisect import bisect_left, bisect_right, bisect",
"-",
"-# pypyではscipy, numpyは使えない",
"-# from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree",
"-# from scipy.sparse import csr_matrix, coo_matrix, lil_matrix",
"-# import numpy as np",
"-from fractions import gcd",
"-from math import ceil, floor, sqrt, cos, sin, pi, factorial",
"-read = sys.stdin.buffer.read",
"+read = sys.stdin.read",
"-readlines = sys.stdin.buffer.readlines",
"+from itertools import product",
"+",
"- n, m = list(map(int, readline().split()))",
"- sw = [[] for _ in range(m)]",
"- for i in range(m):",
"- sw[i] = list(map(int, readline().split()[1:]))",
"- p = [int(x) for x in input().split()] # 不要",
"- answer = 0",
"- for jotai in product([0, 1], repeat=n):",
"- bl = True",
"- for i in range(m):",
"- s = sum([jotai[s - 1] for s in sw[i]])",
"- if (s - p[i]) % 2 != 0:",
"- bl = False",
"+ N, M = list(map(int, readline().split()))",
"+ S = []",
"+ for _ in range(M):",
"+ k, *s = list(map(int, readline().split()))",
"+ S.append(s)",
"+ P = list(map(int, readline().split()))",
"+ ans = 0",
"+ for switch in product((0, 1), repeat=N):",
"+ for i, s in enumerate(S):",
"+ tmp = 0",
"+ for k in s:",
"+ tmp ^= switch[k - 1]",
"+ if tmp == P[i]:",
"+ continue",
"+ else:",
"- if bl:",
"- answer += 1",
"- print(answer)",
"+ else:",
"+ ans += 1",
"+ print(ans)"
] | false | 0.041552 | 0.041445 | 1.002587 | [
"s993093794",
"s552165239"
] |
u745087332 | p03296 | python | s304525939 | s890925522 | 39 | 18 | 4,336 | 3,064 | Accepted | Accepted | 53.85 | import random
n = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(1, n-1):
if A[i] == A[i-1]:
ans += 1
while(1):
A[i] = random.randrange(10000)+1
if A[i] != A[i-1] and A[i] != A[i+1]: break
if A[-1] == A[-2]: ans += 1
print(ans) | # coding:utf-8
import sys
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
def main():
n = II()
A = LI()
res = 0
for i in range(1, n):
if A[i] == A[i - 1]:
A[i] = 0
res += 1
return res
print((main()))
| 15 | 29 | 313 | 589 | import random
n = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
for i in range(1, n - 1):
if A[i] == A[i - 1]:
ans += 1
while 1:
A[i] = random.randrange(10000) + 1
if A[i] != A[i - 1] and A[i] != A[i + 1]:
break
if A[-1] == A[-2]:
ans += 1
print(ans)
| # coding:utf-8
import sys
INF = float("inf")
MOD = 10**9 + 7
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def LI_():
return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF():
return [float(x) for x in sys.stdin.readline().split()]
def LS():
return sys.stdin.readline().split()
def II():
return int(sys.stdin.readline())
def SI():
return eval(input())
def main():
n = II()
A = LI()
res = 0
for i in range(1, n):
if A[i] == A[i - 1]:
A[i] = 0
res += 1
return res
print((main()))
| false | 48.275862 | [
"-import random",
"+# coding:utf-8",
"+import sys",
"-n = int(eval(input()))",
"-A = list(map(int, input().split()))",
"-ans = 0",
"-for i in range(1, n - 1):",
"- if A[i] == A[i - 1]:",
"- ans += 1",
"- while 1:",
"- A[i] = random.randrange(10000) + 1",
"- if A[i] != A[i - 1] and A[i] != A[i + 1]:",
"- break",
"-if A[-1] == A[-2]:",
"- ans += 1",
"-print(ans)",
"+INF = float(\"inf\")",
"+MOD = 10**9 + 7",
"+",
"+",
"+def LI():",
"+ return [int(x) for x in sys.stdin.readline().split()]",
"+",
"+",
"+def LI_():",
"+ return [int(x) - 1 for x in sys.stdin.readline().split()]",
"+",
"+",
"+def LF():",
"+ return [float(x) for x in sys.stdin.readline().split()]",
"+",
"+",
"+def LS():",
"+ return sys.stdin.readline().split()",
"+",
"+",
"+def II():",
"+ return int(sys.stdin.readline())",
"+",
"+",
"+def SI():",
"+ return eval(input())",
"+",
"+",
"+def main():",
"+ n = II()",
"+ A = LI()",
"+ res = 0",
"+ for i in range(1, n):",
"+ if A[i] == A[i - 1]:",
"+ A[i] = 0",
"+ res += 1",
"+ return res",
"+",
"+",
"+print((main()))"
] | false | 0.070545 | 0.063171 | 1.116727 | [
"s304525939",
"s890925522"
] |
u925567828 | p02947 | python | s777827712 | s933703771 | 716 | 249 | 26,308 | 20,028 | Accepted | Accepted | 65.22 | N =int(eval(input()))
#横文字数、縦N行の行列を作成
s = [list(eval(input())) for i in range(N)]
#文字列をアルファベット順に並び替える
for i in range(len(s)):
s[i].sort()
s.sort()
ans = 0
cnt = 1
for i in range(1,N):
for j in range(10):
#1文とその次の文の文字を比較
#異なっていた場合はbreak
if(s[i][j] != s[i-1][j]):
break
else:
cnt +=1
continue
ans += cnt*(cnt-1)//2
cnt =1
ans +=cnt*(cnt-1)//2
print(ans) | import sys
import collections
from functools import reduce
import operator as op
def nCr(n,r):
r = min(r,n-r)
""" operator.mul = 掛け算を行う関数"""
"""引数の２つ目は先頭を示す"""
up = reduce(op.mul,list(range(n,n-r,-1)),1)
down= reduce(op.mul,list(range(r,0,-1)),1)
return up // down
def main():
n = int(sys.stdin.readline().rstrip())
sorted_letters =[''.join(sorted(sys.stdin.readline().rstrip())) for _ in range(n)]
count = 0
for c in list(collections.Counter(sorted_letters).values()):
if c >=2:
count +=nCr(c,2)
print(count)
if __name__ == "__main__":
main() | 23 | 29 | 438 | 649 | N = int(eval(input()))
# 横文字数、縦N行の行列を作成
s = [list(eval(input())) for i in range(N)]
# 文字列をアルファベット順に並び替える
for i in range(len(s)):
s[i].sort()
s.sort()
ans = 0
cnt = 1
for i in range(1, N):
for j in range(10):
# 1文とその次の文の文字を比較
# 異なっていた場合はbreak
if s[i][j] != s[i - 1][j]:
break
else:
cnt += 1
continue
ans += cnt * (cnt - 1) // 2
cnt = 1
ans += cnt * (cnt - 1) // 2
print(ans)
| import sys
import collections
from functools import reduce
import operator as op
def nCr(n, r):
r = min(r, n - r)
""" operator.mul = 掛け算を行う関数"""
"""引数の２つ目は先頭を示す"""
up = reduce(op.mul, list(range(n, n - r, -1)), 1)
down = reduce(op.mul, list(range(r, 0, -1)), 1)
return up // down
def main():
n = int(sys.stdin.readline().rstrip())
sorted_letters = ["".join(sorted(sys.stdin.readline().rstrip())) for _ in range(n)]
count = 0
for c in list(collections.Counter(sorted_letters).values()):
if c >= 2:
count += nCr(c, 2)
print(count)
if __name__ == "__main__":
main()
| false | 20.689655 | [
"-N = int(eval(input()))",
"-# 横文字数、縦N行の行列を作成",
"-s = [list(eval(input())) for i in range(N)]",
"-# 文字列をアルファベット順に並び替える",
"-for i in range(len(s)):",
"- s[i].sort()",
"-s.sort()",
"-ans = 0",
"-cnt = 1",
"-for i in range(1, N):",
"- for j in range(10):",
"- # 1文とその次の文の文字を比較",
"- # 異なっていた場合はbreak",
"- if s[i][j] != s[i - 1][j]:",
"- break",
"- else:",
"- cnt += 1",
"- continue",
"- ans += cnt * (cnt - 1) // 2",
"- cnt = 1",
"-ans += cnt * (cnt - 1) // 2",
"-print(ans)",
"+import sys",
"+import collections",
"+from functools import reduce",
"+import operator as op",
"+",
"+",
"+def nCr(n, r):",
"+ r = min(r, n - r)",
"+ \"\"\" operator.mul = 掛け算を行う関数\"\"\"",
"+ \"\"\"引数の２つ目は先頭を示す\"\"\"",
"+ up = reduce(op.mul, list(range(n, n - r, -1)), 1)",
"+ down = reduce(op.mul, list(range(r, 0, -1)), 1)",
"+ return up // down",
"+",
"+",
"+def main():",
"+ n = int(sys.stdin.readline().rstrip())",
"+ sorted_letters = [\"\".join(sorted(sys.stdin.readline().rstrip())) for _ in range(n)]",
"+ count = 0",
"+ for c in list(collections.Counter(sorted_letters).values()):",
"+ if c >= 2:",
"+ count += nCr(c, 2)",
"+ print(count)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.083887 | 0.09226 | 0.90924 | [
"s777827712",
"s933703771"
] |
u844789719 | p02625 | python | s124028008 | s760453407 | 813 | 203 | 52,384 | 112,204 | Accepted | Accepted | 75.03 | max_fact = 5 * 10**5
mod = 10**9 + 7
f = [1] * (max_fact + 1)
for idx in range(2, max_fact + 1):
f[idx] = f[idx - 1] * idx
f[idx] %= mod
fi = [pow(f[-1], mod - 2, mod)]
for idx in range(max_fact, 0, -1):
fi += [fi[-1] * idx % mod]
fi = fi[::-1]
def factorial(n):
return f[n]
def factorial_inverse(n):
return fi[n]
def combination(n, r):
return f[n] * fi[r] * fi[n - r] % mod
def permutation(n, r):
return f[n] * fi[n - r] % mod
def homogeneous_product(n, r):
return f[n + r - 1] * fi[r] * fi[n - 1] % mod
comb = combination
perm = permutation
N, M = [int(_) for _ in input().split()]
ans = 0
for p in range(N + 1):
ans += (-1)**p * comb(N, p) * perm(M - p, N - p)
ans %= mod
ans *= perm(M, N)
ans %= mod
print(ans)
| class Factorial:
def __init__(self, max_fact, mod):
#mod should be prime number
#using homogeneous_product(n,r), max_fact ≧ max(n+r-1)
f = [1] * (max_fact + 1)
for idx in range(2, max_fact + 1):
f[idx] = f[idx - 1] * idx
f[idx] %= mod
fi = [pow(f[-1], mod - 2, mod)]
for idx in range(max_fact, 0, -1):
fi += [fi[-1] * idx % mod]
fi = fi[::-1]
self.mod = mod
self.f = f
self.fi = fi
def factorial(self, n):
return self.f[n]
def factorial_inverse(self, n):
return self.fi[n]
def combination(self, n, r):
f = self.f
fi = self.fi
return f[n] * fi[r] * fi[n - r] % self.mod
def permutation(self, n, r):
return self.f[n] * self.fi[n - r] % self.mod
def homogeneous_product(self, n, r):
f = self.f
fi = self.fi
return f[n + r - 1] * fi[r] * fi[n - 1] % self.mod
max_fact = 5 * 10**5
mod = 10**9 + 7
fact_instance = Factorial(max_fact, mod)
comb = fact_instance.combination
perm = fact_instance.permutation
N, M = [int(_) for _ in input().split()]
ans = 0
for p in range(N + 1):
ans += (-1)**p * comb(N, p) * perm(M - p, N - p)
ans %= mod
ans *= perm(M, N)
ans %= mod
print(ans)
| 39 | 50 | 802 | 1,348 | max_fact = 5 * 10**5
mod = 10**9 + 7
f = [1] * (max_fact + 1)
for idx in range(2, max_fact + 1):
f[idx] = f[idx - 1] * idx
f[idx] %= mod
fi = [pow(f[-1], mod - 2, mod)]
for idx in range(max_fact, 0, -1):
fi += [fi[-1] * idx % mod]
fi = fi[::-1]
def factorial(n):
return f[n]
def factorial_inverse(n):
return fi[n]
def combination(n, r):
return f[n] * fi[r] * fi[n - r] % mod
def permutation(n, r):
return f[n] * fi[n - r] % mod
def homogeneous_product(n, r):
return f[n + r - 1] * fi[r] * fi[n - 1] % mod
comb = combination
perm = permutation
N, M = [int(_) for _ in input().split()]
ans = 0
for p in range(N + 1):
ans += (-1) ** p * comb(N, p) * perm(M - p, N - p)
ans %= mod
ans *= perm(M, N)
ans %= mod
print(ans)
| class Factorial:
def __init__(self, max_fact, mod):
# mod should be prime number
# using homogeneous_product(n,r), max_fact ≧ max(n+r-1)
f = [1] * (max_fact + 1)
for idx in range(2, max_fact + 1):
f[idx] = f[idx - 1] * idx
f[idx] %= mod
fi = [pow(f[-1], mod - 2, mod)]
for idx in range(max_fact, 0, -1):
fi += [fi[-1] * idx % mod]
fi = fi[::-1]
self.mod = mod
self.f = f
self.fi = fi
def factorial(self, n):
return self.f[n]
def factorial_inverse(self, n):
return self.fi[n]
def combination(self, n, r):
f = self.f
fi = self.fi
return f[n] * fi[r] * fi[n - r] % self.mod
def permutation(self, n, r):
return self.f[n] * self.fi[n - r] % self.mod
def homogeneous_product(self, n, r):
f = self.f
fi = self.fi
return f[n + r - 1] * fi[r] * fi[n - 1] % self.mod
max_fact = 5 * 10**5
mod = 10**9 + 7
fact_instance = Factorial(max_fact, mod)
comb = fact_instance.combination
perm = fact_instance.permutation
N, M = [int(_) for _ in input().split()]
ans = 0
for p in range(N + 1):
ans += (-1) ** p * comb(N, p) * perm(M - p, N - p)
ans %= mod
ans *= perm(M, N)
ans %= mod
print(ans)
| false | 22 | [
"+class Factorial:",
"+ def __init__(self, max_fact, mod):",
"+ # mod should be prime number",
"+ # using homogeneous_product(n,r), max_fact ≧ max(n+r-1)",
"+ f = [1] * (max_fact + 1)",
"+ for idx in range(2, max_fact + 1):",
"+ f[idx] = f[idx - 1] * idx",
"+ f[idx] %= mod",
"+ fi = [pow(f[-1], mod - 2, mod)]",
"+ for idx in range(max_fact, 0, -1):",
"+ fi += [fi[-1] * idx % mod]",
"+ fi = fi[::-1]",
"+ self.mod = mod",
"+ self.f = f",
"+ self.fi = fi",
"+",
"+ def factorial(self, n):",
"+ return self.f[n]",
"+",
"+ def factorial_inverse(self, n):",
"+ return self.fi[n]",
"+",
"+ def combination(self, n, r):",
"+ f = self.f",
"+ fi = self.fi",
"+ return f[n] * fi[r] * fi[n - r] % self.mod",
"+",
"+ def permutation(self, n, r):",
"+ return self.f[n] * self.fi[n - r] % self.mod",
"+",
"+ def homogeneous_product(self, n, r):",
"+ f = self.f",
"+ fi = self.fi",
"+ return f[n + r - 1] * fi[r] * fi[n - 1] % self.mod",
"+",
"+",
"-f = [1] * (max_fact + 1)",
"-for idx in range(2, max_fact + 1):",
"- f[idx] = f[idx - 1] * idx",
"- f[idx] %= mod",
"-fi = [pow(f[-1], mod - 2, mod)]",
"-for idx in range(max_fact, 0, -1):",
"- fi += [fi[-1] * idx % mod]",
"-fi = fi[::-1]",
"-",
"-",
"-def factorial(n):",
"- return f[n]",
"-",
"-",
"-def factorial_inverse(n):",
"- return fi[n]",
"-",
"-",
"-def combination(n, r):",
"- return f[n] * fi[r] * fi[n - r] % mod",
"-",
"-",
"-def permutation(n, r):",
"- return f[n] * fi[n - r] % mod",
"-",
"-",
"-def homogeneous_product(n, r):",
"- return f[n + r - 1] * fi[r] * fi[n - 1] % mod",
"-",
"-",
"-comb = combination",
"-perm = permutation",
"+fact_instance = Factorial(max_fact, mod)",
"+comb = fact_instance.combination",
"+perm = fact_instance.permutation"
] | false | 1.050094 | 0.69269 | 1.515965 | [
"s124028008",
"s760453407"
] |
u170201762 | p02852 | python | s307434635 | s788979360 | 573 | 191 | 75,740 | 49,888 | Accepted | Accepted | 66.67 | N,M = list(map(int,input().split()))
S = eval(input())
N0 = 2**(N-1).bit_length()
INF = 2**31-1
# k番目の要素をxに更新
def update(k, x, data):
k += N0-1
data[k] = x
while k >= 0:
k = (k - 1) // 2
data[k] = min(data[2*k+1], data[2*k+2])
# [l,r)の最小値
def query(l, r, data):
L = l + N0; R = r + N0
s = INF
while L < R:
if R & 1:
R -= 1
s = min(s, data[R-1])
if L & 1:
s = min(s, data[L-1])
L += 1
L >>= 1; R >>= 1
return s
data1 = [INF]*(3*N0)
update(0,0,data1)
for n in range(N):
if S[n+1]=='0':
update(n+1,query(max(0,n-M+1),n+1,data1)+1,data1)
S = S[::-1]
data2 = [INF]*(3*N0)
update(0,0,data2)
for n in range(N):
if S[n+1]=='0':
update(n+1,query(max(0,n-M+1),n+1,data2)+1,data2)
cost1 = [INF]*(N+1)
cost2 = [INF]*(N+1)
for n in range(N+1):
cost1[n] = query(n,n+1,data1)
cost2[n] = query(N-n,N-n+1,data2)
ans = []
cost = 0
for n in range(N+1):
if cost != cost1[n] and cost1[n]+cost2[n]==cost1[N]:
ans.append(n)
cost = cost1[n]
ans = [0]+ans
for i in range(len(ans)-2,-1,-1):
ans[i+1] = ans[i+1]-ans[i]
ans = ' '.join([str(c) for c in ans[1:]])
if cost2[0]==INF:
ans = '-1'
print(ans)
| N,M = list(map(int,input().split()))
S = eval(input())
S = S[::-1]
s = 0
used = [0]
while s < N:
for i in range(M,-1,-1):
if s+i > N:
i = N-s
if S[s+i]=='0':
s += i
used.append(s)
break
if i==0:
break
if s==N:
ans = []
for i in range(len(used)-1):
ans.append(used[i+1]-used[i])
ans = ans[::-1]
ans = ' '.join([str(c) for c in ans])
print(ans)
else:
print((-1)) | 63 | 24 | 1,310 | 481 | N, M = list(map(int, input().split()))
S = eval(input())
N0 = 2 ** (N - 1).bit_length()
INF = 2**31 - 1
# k番目の要素をxに更新
def update(k, x, data):
k += N0 - 1
data[k] = x
while k >= 0:
k = (k - 1) // 2
data[k] = min(data[2 * k + 1], data[2 * k + 2])
# [l,r)の最小値
def query(l, r, data):
L = l + N0
R = r + N0
s = INF
while L < R:
if R & 1:
R -= 1
s = min(s, data[R - 1])
if L & 1:
s = min(s, data[L - 1])
L += 1
L >>= 1
R >>= 1
return s
data1 = [INF] * (3 * N0)
update(0, 0, data1)
for n in range(N):
if S[n + 1] == "0":
update(n + 1, query(max(0, n - M + 1), n + 1, data1) + 1, data1)
S = S[::-1]
data2 = [INF] * (3 * N0)
update(0, 0, data2)
for n in range(N):
if S[n + 1] == "0":
update(n + 1, query(max(0, n - M + 1), n + 1, data2) + 1, data2)
cost1 = [INF] * (N + 1)
cost2 = [INF] * (N + 1)
for n in range(N + 1):
cost1[n] = query(n, n + 1, data1)
cost2[n] = query(N - n, N - n + 1, data2)
ans = []
cost = 0
for n in range(N + 1):
if cost != cost1[n] and cost1[n] + cost2[n] == cost1[N]:
ans.append(n)
cost = cost1[n]
ans = [0] + ans
for i in range(len(ans) - 2, -1, -1):
ans[i + 1] = ans[i + 1] - ans[i]
ans = " ".join([str(c) for c in ans[1:]])
if cost2[0] == INF:
ans = "-1"
print(ans)
| N, M = list(map(int, input().split()))
S = eval(input())
S = S[::-1]
s = 0
used = [0]
while s < N:
for i in range(M, -1, -1):
if s + i > N:
i = N - s
if S[s + i] == "0":
s += i
used.append(s)
break
if i == 0:
break
if s == N:
ans = []
for i in range(len(used) - 1):
ans.append(used[i + 1] - used[i])
ans = ans[::-1]
ans = " ".join([str(c) for c in ans])
print(ans)
else:
print((-1))
| false | 61.904762 | [
"-N0 = 2 ** (N - 1).bit_length()",
"-INF = 2**31 - 1",
"-# k番目の要素をxに更新",
"-def update(k, x, data):",
"- k += N0 - 1",
"- data[k] = x",
"- while k >= 0:",
"- k = (k - 1) // 2",
"- data[k] = min(data[2 * k + 1], data[2 * k + 2])",
"-",
"-",
"-# [l,r)の最小値",
"-def query(l, r, data):",
"- L = l + N0",
"- R = r + N0",
"- s = INF",
"- while L < R:",
"- if R & 1:",
"- R -= 1",
"- s = min(s, data[R - 1])",
"- if L & 1:",
"- s = min(s, data[L - 1])",
"- L += 1",
"- L >>= 1",
"- R >>= 1",
"- return s",
"-",
"-",
"-data1 = [INF] * (3 * N0)",
"-update(0, 0, data1)",
"-for n in range(N):",
"- if S[n + 1] == \"0\":",
"- update(n + 1, query(max(0, n - M + 1), n + 1, data1) + 1, data1)",
"-data2 = [INF] * (3 * N0)",
"-update(0, 0, data2)",
"-for n in range(N):",
"- if S[n + 1] == \"0\":",
"- update(n + 1, query(max(0, n - M + 1), n + 1, data2) + 1, data2)",
"-cost1 = [INF] * (N + 1)",
"-cost2 = [INF] * (N + 1)",
"-for n in range(N + 1):",
"- cost1[n] = query(n, n + 1, data1)",
"- cost2[n] = query(N - n, N - n + 1, data2)",
"-ans = []",
"-cost = 0",
"-for n in range(N + 1):",
"- if cost != cost1[n] and cost1[n] + cost2[n] == cost1[N]:",
"- ans.append(n)",
"- cost = cost1[n]",
"-ans = [0] + ans",
"-for i in range(len(ans) - 2, -1, -1):",
"- ans[i + 1] = ans[i + 1] - ans[i]",
"-ans = \" \".join([str(c) for c in ans[1:]])",
"-if cost2[0] == INF:",
"- ans = \"-1\"",
"-print(ans)",
"+s = 0",
"+used = [0]",
"+while s < N:",
"+ for i in range(M, -1, -1):",
"+ if s + i > N:",
"+ i = N - s",
"+ if S[s + i] == \"0\":",
"+ s += i",
"+ used.append(s)",
"+ break",
"+ if i == 0:",
"+ break",
"+if s == N:",
"+ ans = []",
"+ for i in range(len(used) - 1):",
"+ ans.append(used[i + 1] - used[i])",
"+ ans = ans[::-1]",
"+ ans = \" \".join([str(c) for c in ans])",
"+ print(ans)",
"+else:",
"+ print((-1))"
] | false | 0.039185 | 0.064966 | 0.603161 | [
"s307434635",
"s788979360"
] |
u583507988 | p03073 | python | s631121366 | s123277572 | 101 | 88 | 11,732 | 89,464 | Accepted | Accepted | 12.87 | S = eval(input())
s = []
for _ in S:
s.append(int(_))
s1 = [1]
s2 = [0]
for i in range(1,len(s)):
if s1[i-1] == 0:
s1.append(1)
else:
s1.append(0)
if s2[i-1] == 0:
s2.append(1)
else:
s2.append(0)
a = 0
b = 0
for j in range(len(s)):
if s[j] != s1[j]:
a += 1
if s[j] != s2[j]:
b += 1
print((min(a,b))) | s=eval(input())
n=len(s)
d=[]
for i in range(n):
d.append(int(s[i]))
s1=[0]
s2=[1]
for i in range(1,n):
if s1[i-1]==0:
s1.append(1)
else:
s1.append(0)
if s2[i-1]==1:
s2.append(0)
else:
s2.append(1)
a,b=0,0
for i in range(n):
if d[i]!=s1[i]:
a+=1
if d[i]!=s2[i]:
b+=1
print((min(a,b))) | 24 | 23 | 357 | 336 | S = eval(input())
s = []
for _ in S:
s.append(int(_))
s1 = [1]
s2 = [0]
for i in range(1, len(s)):
if s1[i - 1] == 0:
s1.append(1)
else:
s1.append(0)
if s2[i - 1] == 0:
s2.append(1)
else:
s2.append(0)
a = 0
b = 0
for j in range(len(s)):
if s[j] != s1[j]:
a += 1
if s[j] != s2[j]:
b += 1
print((min(a, b)))
| s = eval(input())
n = len(s)
d = []
for i in range(n):
d.append(int(s[i]))
s1 = [0]
s2 = [1]
for i in range(1, n):
if s1[i - 1] == 0:
s1.append(1)
else:
s1.append(0)
if s2[i - 1] == 1:
s2.append(0)
else:
s2.append(1)
a, b = 0, 0
for i in range(n):
if d[i] != s1[i]:
a += 1
if d[i] != s2[i]:
b += 1
print((min(a, b)))
| false | 4.166667 | [
"-S = eval(input())",
"-s = []",
"-for _ in S:",
"- s.append(int(_))",
"-s1 = [1]",
"-s2 = [0]",
"-for i in range(1, len(s)):",
"+s = eval(input())",
"+n = len(s)",
"+d = []",
"+for i in range(n):",
"+ d.append(int(s[i]))",
"+s1 = [0]",
"+s2 = [1]",
"+for i in range(1, n):",
"- if s2[i - 1] == 0:",
"+ if s2[i - 1] == 1:",
"+ s2.append(0)",
"+ else:",
"- else:",
"- s2.append(0)",
"-a = 0",
"-b = 0",
"-for j in range(len(s)):",
"- if s[j] != s1[j]:",
"+a, b = 0, 0",
"+for i in range(n):",
"+ if d[i] != s1[i]:",
"- if s[j] != s2[j]:",
"+ if d[i] != s2[i]:"
] | false | 0.036128 | 0.072558 | 0.497917 | [
"s631121366",
"s123277572"
] |
u353797797 | p02793 | python | s596991784 | s525308205 | 1,990 | 962 | 262,644 | 4,212 | Accepted | Accepted | 51.66 | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]
def gcd(a,b):
while b:a,b=b,a%b
return a
def lcm(a,b):
return a*b//gcd(a,b)
def main():
md=10**9+7
n=II()
aa=LI()
l=1
for a in aa:
l=lcm(l,a)
bb=[]
for a in aa:
bb.append(l//a)
print(sum(bb)%md)
main()
| import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]
class mint:
def __init__(self, x):
self.__x = x % md
def __str__(self):
return str(self.__x)
def __add__(self, other):
if isinstance(other, mint): other = other.__x
return mint(self.__x + other)
def __sub__(self, other):
if isinstance(other, mint): other = other.__x
return mint(self.__x - other)
def __rsub__(self, other):
return mint(other - self.__x)
def __mul__(self, other):
if isinstance(other, mint): other = other.__x
return mint(self.__x * other)
__radd__ = __add__
__rmul__ = __mul__
def __truediv__(self, other):
if isinstance(other, mint): other = other.__x
return mint(self.__x * pow(other, md - 2, md))
def __pow__(self, power, modulo=None):
return mint(pow(self.__x, power, md))
def gcd(a, b):
while b: a, b = b, a % b
return a
def lcm(a, b):
return a * b // gcd(a, b)
md = 10 ** 9 + 7
def main():
n = II()
aa = LI()
l = 1
for a in aa:
l = lcm(l, a)
l = mint(l)
ans = sum(l / a for a in aa)
print(ans)
main()
| 31 | 62 | 670 | 1,557 | import sys
sys.setrecursionlimit(10**6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II():
return int(sys.stdin.readline())
def MI():
return map(int, sys.stdin.readline().split())
def LI():
return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number):
return [LI() for _ in range(rows_number)]
def SI():
return sys.stdin.readline()[:-1]
def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a, b):
return a * b // gcd(a, b)
def main():
md = 10**9 + 7
n = II()
aa = LI()
l = 1
for a in aa:
l = lcm(l, a)
bb = []
for a in aa:
bb.append(l // a)
print(sum(bb) % md)
main()
| import sys
sys.setrecursionlimit(10**6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II():
return int(sys.stdin.readline())
def MI():
return map(int, sys.stdin.readline().split())
def LI():
return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number):
return [LI() for _ in range(rows_number)]
def SI():
return sys.stdin.readline()[:-1]
class mint:
def __init__(self, x):
self.__x = x % md
def __str__(self):
return str(self.__x)
def __add__(self, other):
if isinstance(other, mint):
other = other.__x
return mint(self.__x + other)
def __sub__(self, other):
if isinstance(other, mint):
other = other.__x
return mint(self.__x - other)
def __rsub__(self, other):
return mint(other - self.__x)
def __mul__(self, other):
if isinstance(other, mint):
other = other.__x
return mint(self.__x * other)
__radd__ = __add__
__rmul__ = __mul__
def __truediv__(self, other):
if isinstance(other, mint):
other = other.__x
return mint(self.__x * pow(other, md - 2, md))
def __pow__(self, power, modulo=None):
return mint(pow(self.__x, power, md))
def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a, b):
return a * b // gcd(a, b)
md = 10**9 + 7
def main():
n = II()
aa = LI()
l = 1
for a in aa:
l = lcm(l, a)
l = mint(l)
ans = sum(l / a for a in aa)
print(ans)
main()
| false | 50 | [
"+class mint:",
"+ def __init__(self, x):",
"+ self.__x = x % md",
"+",
"+ def __str__(self):",
"+ return str(self.__x)",
"+",
"+ def __add__(self, other):",
"+ if isinstance(other, mint):",
"+ other = other.__x",
"+ return mint(self.__x + other)",
"+",
"+ def __sub__(self, other):",
"+ if isinstance(other, mint):",
"+ other = other.__x",
"+ return mint(self.__x - other)",
"+",
"+ def __rsub__(self, other):",
"+ return mint(other - self.__x)",
"+",
"+ def __mul__(self, other):",
"+ if isinstance(other, mint):",
"+ other = other.__x",
"+ return mint(self.__x * other)",
"+",
"+ __radd__ = __add__",
"+ __rmul__ = __mul__",
"+",
"+ def __truediv__(self, other):",
"+ if isinstance(other, mint):",
"+ other = other.__x",
"+ return mint(self.__x * pow(other, md - 2, md))",
"+",
"+ def __pow__(self, power, modulo=None):",
"+ return mint(pow(self.__x, power, md))",
"+",
"+",
"+md = 10**9 + 7",
"+",
"+",
"- md = 10**9 + 7",
"- bb = []",
"- for a in aa:",
"- bb.append(l // a)",
"- print(sum(bb) % md)",
"+ l = mint(l)",
"+ ans = sum(l / a for a in aa)",
"+ print(ans)"
] | false | 0.035778 | 0.058059 | 0.616221 | [
"s596991784",
"s525308205"
] |
u281303342 | p03854 | python | s527451825 | s476504396 | 72 | 37 | 3,188 | 3,188 | Accepted | Accepted | 48.61 | S = input()[::-1]
T = ["dream"[::-1],"dreamer"[::-1],"erase"[::-1],"eraser"[::-1]]
Ans = "YES"
while len(S) > 0:
if S[0:5] in T:
S = S[5:]
continue
elif S[0:6] in T:
S = S[6:]
continue
elif S[0:7] in T:
S = S[7:]
continue
else:
Ans = "NO"
break
print(Ans) | import sys
S = eval(input())
S = S[::-1]
AR = []
A = ["dream","dreamer","erase","eraser"]
for a in A:
AR.append(a[::-1])
i = 0
while i < len(S):
for ar in AR:
l = len(ar)
if ar == S[i:i+l]:
i += l
break
else:
print("NO")
sys.exit()
print("YES")
| 17 | 22 | 351 | 332 | S = input()[::-1]
T = ["dream"[::-1], "dreamer"[::-1], "erase"[::-1], "eraser"[::-1]]
Ans = "YES"
while len(S) > 0:
if S[0:5] in T:
S = S[5:]
continue
elif S[0:6] in T:
S = S[6:]
continue
elif S[0:7] in T:
S = S[7:]
continue
else:
Ans = "NO"
break
print(Ans)
| import sys
S = eval(input())
S = S[::-1]
AR = []
A = ["dream", "dreamer", "erase", "eraser"]
for a in A:
AR.append(a[::-1])
i = 0
while i < len(S):
for ar in AR:
l = len(ar)
if ar == S[i : i + l]:
i += l
break
else:
print("NO")
sys.exit()
print("YES")
| false | 22.727273 | [
"-S = input()[::-1]",
"-T = [\"dream\"[::-1], \"dreamer\"[::-1], \"erase\"[::-1], \"eraser\"[::-1]]",
"-Ans = \"YES\"",
"-while len(S) > 0:",
"- if S[0:5] in T:",
"- S = S[5:]",
"- continue",
"- elif S[0:6] in T:",
"- S = S[6:]",
"- continue",
"- elif S[0:7] in T:",
"- S = S[7:]",
"- continue",
"+import sys",
"+",
"+S = eval(input())",
"+S = S[::-1]",
"+AR = []",
"+A = [\"dream\", \"dreamer\", \"erase\", \"eraser\"]",
"+for a in A:",
"+ AR.append(a[::-1])",
"+i = 0",
"+while i < len(S):",
"+ for ar in AR:",
"+ l = len(ar)",
"+ if ar == S[i : i + l]:",
"+ i += l",
"+ break",
"- Ans = \"NO\"",
"- break",
"-print(Ans)",
"+ print(\"NO\")",
"+ sys.exit()",
"+print(\"YES\")"
] | false | 0.035965 | 0.03477 | 1.03436 | [
"s527451825",
"s476504396"
] |
u729939940 | p02780 | python | s265748038 | s708115172 | 151 | 99 | 32,032 | 32,232 | Accepted | Accepted | 34.44 | N,K=list(map(int,input().split()))
P=list(map(int,input().split()))
from itertools import accumulate
acc=[0]
acc.extend(accumulate(P))
ans=0
for i in range(N-K+1):
exp=(acc[K+i]-acc[i]+K)/2
ans=max(exp,ans)
print(ans) | N,K=list(map(int,input().split()))
P=list(map(int,input().split()))
from itertools import accumulate
acc=[0]+list(accumulate(P))
print(((max(b-a for a,b in zip(acc,acc[K:]))+K)/2)) | 10 | 5 | 224 | 176 | N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
from itertools import accumulate
acc = [0]
acc.extend(accumulate(P))
ans = 0
for i in range(N - K + 1):
exp = (acc[K + i] - acc[i] + K) / 2
ans = max(exp, ans)
print(ans)
| N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
from itertools import accumulate
acc = [0] + list(accumulate(P))
print(((max(b - a for a, b in zip(acc, acc[K:])) + K) / 2))
| false | 50 | [
"-acc = [0]",
"-acc.extend(accumulate(P))",
"-ans = 0",
"-for i in range(N - K + 1):",
"- exp = (acc[K + i] - acc[i] + K) / 2",
"- ans = max(exp, ans)",
"-print(ans)",
"+acc = [0] + list(accumulate(P))",
"+print(((max(b - a for a, b in zip(acc, acc[K:])) + K) / 2))"
] | false | 0.037184 | 0.007506 | 4.95419 | [
"s265748038",
"s708115172"
] |
u227082700 | p02559 | python | s231343417 | s257325711 | 4,456 | 3,785 | 65,076 | 65,068 | Accepted | Accepted | 15.06 | import sys
input = lambda: sys.stdin.readline().rstrip()
# BinaryIndexedTree
# O(logN)で累積和取得と値の更新
# add(i,x)...i番目にxを加算
# sum(i,j)...[i,j)の累積和を取得
class BinaryIndexedTree:
def __init__(self, n):
self.bit = [0] * n
def add(self, i, x):
i += 1
while i <= len(self.bit):
self.bit[i-1] += x
i += i & -i
def sum_sub(self, i):
a = 0
i += 1
while i:
a += self.bit[i-1]
i -= i & -i
return a
def sum(self, i, j):
a = 0
if j != 0:
a += self.sum_sub(j-1)
if i != 0:
a -= self.sum_sub(i-1)
return a
n,q=list(map(int,input().split()))
a=list(map(int,input().split()))
Bit=BinaryIndexedTree(n)
for i in range(n):Bit.add(i,a[i])
for _ in range(q):
t,a,b=list(map(int,input().split()))
if t==0:
Bit.add(a,b)
else:
print((Bit.sum(a,b))) | import sys
input = lambda: sys.stdin.readline().rstrip()
# UnionFind
class FenwickTree:
def __init__(self,n):
self.n=n
self.bit=[0]*(n+1)
def add(self,i,x):
i+=1
while i<=n:
self.bit[i]+=x
i+=i&-i
def sumsub(self,r):
ans=0
while r:
ans+=self.bit[r]
r-=r&-r
return ans
def sum(self,l,r):
ans=self.sumsub(r)
if l!=0:ans-=self.sumsub(l)
return ans
n,q=list(map(int,input().split()))
a=list(map(int,input().split()))
ft=FenwickTree(n)
for i in range(n):ft.add(i,a[i])
for _ in range(q):
t,a,b=list(map(int,input().split()))
if t==0:
ft.add(a,b)
else:
print((ft.sum(a,b))) | 43 | 34 | 853 | 674 | import sys
input = lambda: sys.stdin.readline().rstrip()
# BinaryIndexedTree
# O(logN)で累積和取得と値の更新
# add(i,x)...i番目にxを加算
# sum(i,j)...[i,j)の累積和を取得
class BinaryIndexedTree:
def __init__(self, n):
self.bit = [0] * n
def add(self, i, x):
i += 1
while i <= len(self.bit):
self.bit[i - 1] += x
i += i & -i
def sum_sub(self, i):
a = 0
i += 1
while i:
a += self.bit[i - 1]
i -= i & -i
return a
def sum(self, i, j):
a = 0
if j != 0:
a += self.sum_sub(j - 1)
if i != 0:
a -= self.sum_sub(i - 1)
return a
n, q = list(map(int, input().split()))
a = list(map(int, input().split()))
Bit = BinaryIndexedTree(n)
for i in range(n):
Bit.add(i, a[i])
for _ in range(q):
t, a, b = list(map(int, input().split()))
if t == 0:
Bit.add(a, b)
else:
print((Bit.sum(a, b)))
| import sys
input = lambda: sys.stdin.readline().rstrip()
# UnionFind
class FenwickTree:
def __init__(self, n):
self.n = n
self.bit = [0] * (n + 1)
def add(self, i, x):
i += 1
while i <= n:
self.bit[i] += x
i += i & -i
def sumsub(self, r):
ans = 0
while r:
ans += self.bit[r]
r -= r & -r
return ans
def sum(self, l, r):
ans = self.sumsub(r)
if l != 0:
ans -= self.sumsub(l)
return ans
n, q = list(map(int, input().split()))
a = list(map(int, input().split()))
ft = FenwickTree(n)
for i in range(n):
ft.add(i, a[i])
for _ in range(q):
t, a, b = list(map(int, input().split()))
if t == 0:
ft.add(a, b)
else:
print((ft.sum(a, b)))
| false | 20.930233 | [
"-# BinaryIndexedTree",
"-# O(logN)で累積和取得と値の更新",
"-# add(i,x)...i番目にxを加算",
"-# sum(i,j)...[i,j)の累積和を取得",
"-class BinaryIndexedTree:",
"+# UnionFind",
"+class FenwickTree:",
"- self.bit = [0] * n",
"+ self.n = n",
"+ self.bit = [0] * (n + 1)",
"- while i <= len(self.bit):",
"- self.bit[i - 1] += x",
"+ while i <= n:",
"+ self.bit[i] += x",
"- def sum_sub(self, i):",
"- a = 0",
"- i += 1",
"- while i:",
"- a += self.bit[i - 1]",
"- i -= i & -i",
"- return a",
"+ def sumsub(self, r):",
"+ ans = 0",
"+ while r:",
"+ ans += self.bit[r]",
"+ r -= r & -r",
"+ return ans",
"- def sum(self, i, j):",
"- a = 0",
"- if j != 0:",
"- a += self.sum_sub(j - 1)",
"- if i != 0:",
"- a -= self.sum_sub(i - 1)",
"- return a",
"+ def sum(self, l, r):",
"+ ans = self.sumsub(r)",
"+ if l != 0:",
"+ ans -= self.sumsub(l)",
"+ return ans",
"-Bit = BinaryIndexedTree(n)",
"+ft = FenwickTree(n)",
"- Bit.add(i, a[i])",
"+ ft.add(i, a[i])",
"- Bit.add(a, b)",
"+ ft.add(a, b)",
"- print((Bit.sum(a, b)))",
"+ print((ft.sum(a, b)))"
] | false | 0.046075 | 0.129742 | 0.355124 | [
"s231343417",
"s257325711"
] |
u075304271 | p02802 | python | s882263647 | s937256632 | 466 | 181 | 25,012 | 11,400 | Accepted | Accepted | 61.16 | import numpy as np
from collections import Counter
import fractions
import math
def main():
n, m = list(map(int, input().split()))
p_list, s_list = ["a"] * m, ["a"] * m
for i in range(m):
p_list[i], s_list[i] = list(map(str, input().split()))
p_list[i] = int(p_list[i])
pena = 0
mon_list, pena_list = [0] * n, [0] * n
for i in range(m):
if s_list[i] == "AC":
mon_list[p_list[i] - 1] = 1
if mon_list[p_list[i] - 1] == 0:
if s_list[i] == "WA":
pena_list[p_list[i] - 1] += 1
for i in range(n):
if mon_list[i] == 1:
pena += pena_list[i]
ac = mon_list.count(1)
print((ac, pena))
main() | import math
import collections
import fractions
import itertools
def solve():
n, m = list(map(int, input().split()))
mon = [0]*n
mon2 = [0]*n
for i in range(m):
q, a = input().split()
q = int(q)
if a == "AC":
mon[q-1] = 1
else:
if mon[q-1] == 0:
mon2[q-1] += 1
ac, pena = 0, 0
for i in range(n):
if mon[i] == 1:
ac += 1
pena += mon2[i]
print((ac, pena))
return 0
if __name__ == "__main__":
solve()
| 26 | 27 | 657 | 558 | import numpy as np
from collections import Counter
import fractions
import math
def main():
n, m = list(map(int, input().split()))
p_list, s_list = ["a"] * m, ["a"] * m
for i in range(m):
p_list[i], s_list[i] = list(map(str, input().split()))
p_list[i] = int(p_list[i])
pena = 0
mon_list, pena_list = [0] * n, [0] * n
for i in range(m):
if s_list[i] == "AC":
mon_list[p_list[i] - 1] = 1
if mon_list[p_list[i] - 1] == 0:
if s_list[i] == "WA":
pena_list[p_list[i] - 1] += 1
for i in range(n):
if mon_list[i] == 1:
pena += pena_list[i]
ac = mon_list.count(1)
print((ac, pena))
main()
| import math
import collections
import fractions
import itertools
def solve():
n, m = list(map(int, input().split()))
mon = [0] * n
mon2 = [0] * n
for i in range(m):
q, a = input().split()
q = int(q)
if a == "AC":
mon[q - 1] = 1
else:
if mon[q - 1] == 0:
mon2[q - 1] += 1
ac, pena = 0, 0
for i in range(n):
if mon[i] == 1:
ac += 1
pena += mon2[i]
print((ac, pena))
return 0
if __name__ == "__main__":
solve()
| false | 3.703704 | [
"-import numpy as np",
"-from collections import Counter",
"+import math",
"+import collections",
"-import math",
"+import itertools",
"-def main():",
"+def solve():",
"- p_list, s_list = [\"a\"] * m, [\"a\"] * m",
"+ mon = [0] * n",
"+ mon2 = [0] * n",
"- p_list[i], s_list[i] = list(map(str, input().split()))",
"- p_list[i] = int(p_list[i])",
"- pena = 0",
"- mon_list, pena_list = [0] * n, [0] * n",
"- for i in range(m):",
"- if s_list[i] == \"AC\":",
"- mon_list[p_list[i] - 1] = 1",
"- if mon_list[p_list[i] - 1] == 0:",
"- if s_list[i] == \"WA\":",
"- pena_list[p_list[i] - 1] += 1",
"+ q, a = input().split()",
"+ q = int(q)",
"+ if a == \"AC\":",
"+ mon[q - 1] = 1",
"+ else:",
"+ if mon[q - 1] == 0:",
"+ mon2[q - 1] += 1",
"+ ac, pena = 0, 0",
"- if mon_list[i] == 1:",
"- pena += pena_list[i]",
"- ac = mon_list.count(1)",
"+ if mon[i] == 1:",
"+ ac += 1",
"+ pena += mon2[i]",
"+ return 0",
"-main()",
"+if __name__ == \"__main__\":",
"+ solve()"
] | false | 0.067112 | 0.045218 | 1.484194 | [
"s882263647",
"s937256632"
] |
u644907318 | p02779 | python | s607792987 | s798657535 | 311 | 146 | 109,908 | 118,052 | Accepted | Accepted | 53.05 | N = int(eval(input()))
A = list(map(int,input().split()))
C = {}
for i in range(N):
a = A[i]
if a not in C:
C[a] = 0
C[a] += 1
flag = 0
for a in C:
if C[a]>1:
flag = 1
break
if flag==0:
print("YES")
else:
print("NO") | N = int(eval(input()))
A = list(map(int,input().split()))
C = {}
for i in range(N):
a = A[i]
if a not in C:
C[a] = 0
C[a] += 1
if len(C)==N:
print("YES")
else:
print("NO") | 17 | 12 | 274 | 204 | N = int(eval(input()))
A = list(map(int, input().split()))
C = {}
for i in range(N):
a = A[i]
if a not in C:
C[a] = 0
C[a] += 1
flag = 0
for a in C:
if C[a] > 1:
flag = 1
break
if flag == 0:
print("YES")
else:
print("NO")
| N = int(eval(input()))
A = list(map(int, input().split()))
C = {}
for i in range(N):
a = A[i]
if a not in C:
C[a] = 0
C[a] += 1
if len(C) == N:
print("YES")
else:
print("NO")
| false | 29.411765 | [
"-flag = 0",
"-for a in C:",
"- if C[a] > 1:",
"- flag = 1",
"- break",
"-if flag == 0:",
"+if len(C) == N:"
] | false | 0.086827 | 0.037429 | 2.319798 | [
"s607792987",
"s798657535"
] |
u539281377 | p02887 | python | s850468122 | s059487601 | 56 | 35 | 3,316 | 3,316 | Accepted | Accepted | 37.5 | N=int(eval(input()))
S=eval(input())
T=S[0]
for i in range(1,N):
if S[i-1]!=S[i]:
T+=S[i]
print((len(T))) | N=int(eval(input()))
S=eval(input())
print((1+sum(S[i]!=S[i-1] for i in range(1,N)))) | 7 | 3 | 109 | 73 | N = int(eval(input()))
S = eval(input())
T = S[0]
for i in range(1, N):
if S[i - 1] != S[i]:
T += S[i]
print((len(T)))
| N = int(eval(input()))
S = eval(input())
print((1 + sum(S[i] != S[i - 1] for i in range(1, N))))
| false | 57.142857 | [
"-T = S[0]",
"-for i in range(1, N):",
"- if S[i - 1] != S[i]:",
"- T += S[i]",
"-print((len(T)))",
"+print((1 + sum(S[i] != S[i - 1] for i in range(1, N))))"
] | false | 0.047469 | 0.045093 | 1.052691 | [
"s850468122",
"s059487601"
] |
u691018832 | p03599 | python | s803744614 | s314262183 | 355 | 22 | 3,188 | 3,064 | Accepted | Accepted | 93.8 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
a, b, c, d, e, f = list(map(int, readline().split()))
A = 100 * a
B = 100 * b
E = 100 * e / (100 + e)
ans = [0, 0]
check = 0
for i in range(f // A + 2):
for j in range(f // B + 2):
w = A * i + B * j
for k in range(int((w * E / 100) // c) + 2):
for l in range(int((w * E / 100) // d) + 2):
if k == 0 and l == 0:
continue
s = c * k + d * l
n = 100 * s / (w + s)
if w + s > f or n > E:
break
if n > check:
ans = w + s, s
check = n
if ans[0] == 0:
print((100 * a, ans[1]))
else:
print((*ans))
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
a, b, c, d, e, f = list(map(int, readline().split()))
A = 100 * a
B = 100 * b
E = e / (100 + e)
ans = [0, 0]
check = 0
for i in range(f // A + 2):
for j in range(f // B + 2):
w = A * i + B * j
for k in range(int((w * E) // c) + 2):
for l in range(int((w * E) // d) + 2):
if k == 0 and l == 0:
continue
s = c * k + d * l
n = s / (w + s)
if w + s > f or n > E:
break
if n > check:
ans = w + s, s
check = n
if check == E:
print((*ans))
exit()
if ans[0] == 0:
print((100 * a, ans[1]))
else:
print((*ans))
| 30 | 33 | 856 | 937 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
a, b, c, d, e, f = list(map(int, readline().split()))
A = 100 * a
B = 100 * b
E = 100 * e / (100 + e)
ans = [0, 0]
check = 0
for i in range(f // A + 2):
for j in range(f // B + 2):
w = A * i + B * j
for k in range(int((w * E / 100) // c) + 2):
for l in range(int((w * E / 100) // d) + 2):
if k == 0 and l == 0:
continue
s = c * k + d * l
n = 100 * s / (w + s)
if w + s > f or n > E:
break
if n > check:
ans = w + s, s
check = n
if ans[0] == 0:
print((100 * a, ans[1]))
else:
print((*ans))
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
a, b, c, d, e, f = list(map(int, readline().split()))
A = 100 * a
B = 100 * b
E = e / (100 + e)
ans = [0, 0]
check = 0
for i in range(f // A + 2):
for j in range(f // B + 2):
w = A * i + B * j
for k in range(int((w * E) // c) + 2):
for l in range(int((w * E) // d) + 2):
if k == 0 and l == 0:
continue
s = c * k + d * l
n = s / (w + s)
if w + s > f or n > E:
break
if n > check:
ans = w + s, s
check = n
if check == E:
print((*ans))
exit()
if ans[0] == 0:
print((100 * a, ans[1]))
else:
print((*ans))
| false | 9.090909 | [
"-E = 100 * e / (100 + e)",
"+E = e / (100 + e)",
"- for k in range(int((w * E / 100) // c) + 2):",
"- for l in range(int((w * E / 100) // d) + 2):",
"+ for k in range(int((w * E) // c) + 2):",
"+ for l in range(int((w * E) // d) + 2):",
"- n = 100 * s / (w + s)",
"+ n = s / (w + s)",
"+ if check == E:",
"+ print((*ans))",
"+ exit()"
] | false | 0.120247 | 0.036964 | 3.253099 | [
"s803744614",
"s314262183"
] |
u561083515 | p03053 | python | s867199294 | s751828402 | 692 | 387 | 105,976 | 108,200 | Accepted | Accepted | 44.08 | import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
def main():
H,W = list(map(int,input().split()))
# 番兵法 (#を外周に設置する)
visited = [[True]*(W+2)]
visited += [[True] + [x == '#' for x in input().rstrip()] + [True] for _ in range(H)]
visited.append([True]*(W+2))
# #の位置をqに格納
q = []
for i in range(1,H+1):
for j in range(1,W+1):
if visited[i][j]:
q.append((i,j))
# dx,dyを使用せずにBFS
# 定数倍改善
ans = -1
while q:
qq = []
# 新たに#となった地点をqqに格納
for x,y in q:
if not visited[x-1][y]:
visited[x-1][y] = True
qq.append((x-1,y))
if not visited[x+1][y]:
visited[x+1][y] = True
qq.append((x+1,y))
if not visited[x][y-1]:
visited[x][y-1] = True
qq.append((x,y-1))
if not visited[x][y+1]:
visited[x][y+1] = True
qq.append((x,y+1))
q = qq
ans += 1
print(ans)
if __name__ == '__main__':
main() | import sys
input = sys.stdin.readline
def main():
H,W = list(map(int,input().split()))
# 番兵法 (#を外周に設置する)
visited = [[True]*(W+2)]
visited += [[True] + [x == '#' for x in input().rstrip()] + [True] for _ in range(H)]
visited.append([True]*(W+2))
# #の位置をqに格納
q = []
for i in range(1,H+1):
for j in range(1,W+1):
if visited[i][j]:
q.append((i,j))
# dx,dyを使用せずにBFS
# 定数倍改善
ans = -1
while q:
qq = []
# 新たに#となった地点をqqに格納
for x,y in q:
if not visited[x-1][y]:
visited[x-1][y] = True
qq.append((x-1,y))
if not visited[x+1][y]:
visited[x+1][y] = True
qq.append((x+1,y))
if not visited[x][y-1]:
visited[x][y-1] = True
qq.append((x,y-1))
if not visited[x][y+1]:
visited[x][y+1] = True
qq.append((x,y+1))
q = qq
ans += 1
print(ans)
if __name__ == '__main__':
main() | 45 | 44 | 1,138 | 1,108 | import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
def main():
H, W = list(map(int, input().split()))
# 番兵法 (#を外周に設置する)
visited = [[True] * (W + 2)]
visited += [
[True] + [x == "#" for x in input().rstrip()] + [True] for _ in range(H)
]
visited.append([True] * (W + 2))
# #の位置をqに格納
q = []
for i in range(1, H + 1):
for j in range(1, W + 1):
if visited[i][j]:
q.append((i, j))
# dx,dyを使用せずにBFS
# 定数倍改善
ans = -1
while q:
qq = []
# 新たに#となった地点をqqに格納
for x, y in q:
if not visited[x - 1][y]:
visited[x - 1][y] = True
qq.append((x - 1, y))
if not visited[x + 1][y]:
visited[x + 1][y] = True
qq.append((x + 1, y))
if not visited[x][y - 1]:
visited[x][y - 1] = True
qq.append((x, y - 1))
if not visited[x][y + 1]:
visited[x][y + 1] = True
qq.append((x, y + 1))
q = qq
ans += 1
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def main():
H, W = list(map(int, input().split()))
# 番兵法 (#を外周に設置する)
visited = [[True] * (W + 2)]
visited += [
[True] + [x == "#" for x in input().rstrip()] + [True] for _ in range(H)
]
visited.append([True] * (W + 2))
# #の位置をqに格納
q = []
for i in range(1, H + 1):
for j in range(1, W + 1):
if visited[i][j]:
q.append((i, j))
# dx,dyを使用せずにBFS
# 定数倍改善
ans = -1
while q:
qq = []
# 新たに#となった地点をqqに格納
for x, y in q:
if not visited[x - 1][y]:
visited[x - 1][y] = True
qq.append((x - 1, y))
if not visited[x + 1][y]:
visited[x + 1][y] = True
qq.append((x + 1, y))
if not visited[x][y - 1]:
visited[x][y - 1] = True
qq.append((x, y - 1))
if not visited[x][y + 1]:
visited[x][y + 1] = True
qq.append((x, y + 1))
q = qq
ans += 1
print(ans)
if __name__ == "__main__":
main()
| false | 2.222222 | [
"-sys.setrecursionlimit(10**6)"
] | false | 0.037626 | 0.04157 | 0.905129 | [
"s867199294",
"s751828402"
] |
u347640436 | p03213 | python | s406342390 | s931167768 | 32 | 25 | 9,348 | 9,528 | Accepted | Accepted | 21.88 | # エラトステネスの篩
def make_prime_table(N):
sieve = list(range(N + 1))
sieve[0] = -1
sieve[1] = -1
for i in range(2, int(N ** 0.5) + 1):
if sieve[i] != i:
continue
for j in range(i * i, N + 1, i):
if sieve[j] == j:
sieve[j] = i
return sieve
N = int(eval(input()))
prime_table = make_prime_table(100)
d = {}
for i in range(2, N + 1):
while i != 1:
d.setdefault(prime_table[i], 0)
d[prime_table[i]] += 1
i //= prime_table[i]
# 75 = 5 * 5 * 3
# = 15 * 5
# = 25 * 3
# = 75
n74 = 0
n24 = 0
n14 = 0
n4 = 0
n2 = 0
for k in d:
if d[k] >= 74:
n74 += 1
if d[k] >= 24:
n24 += 1
if d[k] >= 14:
n14 += 1
if d[k] >= 4:
n4 += 1
if d[k] >= 2:
n2 += 1
result = 0
# x ^ 4 * y ^ 4 * z ^ 2 の約数の個数は75個
result += n4 * (n4 - 1) // 2 * (n2 - 2)
# x ^ 14 * y ^ 4 の約数の個数は75個
result += n14 * (n4 - 1)
# x ^ 24 * y ^ 2 の約数の個数は75個
result += n24 * (n2 - 1)
# x ^ 74 の約数の個数は75個
result += n74
print(result)
| # エラトステネスの篩
def make_prime_table(n):
sieve = list(range(n + 1))
sieve[0] = -1
sieve[1] = -1
for i in range(2, int(n ** 0.5) + 1):
if sieve[i] != i:
continue
for j in range(i * i, n + 1, i):
if sieve[j] == j:
sieve[j] = i
return sieve
def prime_factorize(n):
result = []
while n != 1:
p = prime_table[n]
c = 0
while n % p == 0:
n //= p
c += 1
result.append((p, c))
return result
N = int(eval(input()))
prime_table = make_prime_table(100)
d = {}
for i in range(2, N + 1):
for p, c in prime_factorize(i):
d.setdefault(p, 0)
d[p] += c
# 75 = 5 * 5 * 3
# = 15 * 5
# = 25 * 3
# = 75
n74 = 0
n24 = 0
n14 = 0
n4 = 0
n2 = 0
for k in d:
if d[k] >= 74:
n74 += 1
if d[k] >= 24:
n24 += 1
if d[k] >= 14:
n14 += 1
if d[k] >= 4:
n4 += 1
if d[k] >= 2:
n2 += 1
result = 0
# x ^ 4 * y ^ 4 * z ^ 2 の約数の個数は75個
result += n4 * (n4 - 1) // 2 * (n2 - 2)
# x ^ 14 * y ^ 4 の約数の個数は75個
result += n14 * (n4 - 1)
# x ^ 24 * y ^ 2 の約数の個数は75個
result += n24 * (n2 - 1)
# x ^ 74 の約数の個数は75個
result += n74
print(result)
| 56 | 67 | 1,096 | 1,284 | # エラトステネスの篩
def make_prime_table(N):
sieve = list(range(N + 1))
sieve[0] = -1
sieve[1] = -1
for i in range(2, int(N**0.5) + 1):
if sieve[i] != i:
continue
for j in range(i * i, N + 1, i):
if sieve[j] == j:
sieve[j] = i
return sieve
N = int(eval(input()))
prime_table = make_prime_table(100)
d = {}
for i in range(2, N + 1):
while i != 1:
d.setdefault(prime_table[i], 0)
d[prime_table[i]] += 1
i //= prime_table[i]
# 75 = 5 * 5 * 3
# = 15 * 5
# = 25 * 3
# = 75
n74 = 0
n24 = 0
n14 = 0
n4 = 0
n2 = 0
for k in d:
if d[k] >= 74:
n74 += 1
if d[k] >= 24:
n24 += 1
if d[k] >= 14:
n14 += 1
if d[k] >= 4:
n4 += 1
if d[k] >= 2:
n2 += 1
result = 0
# x ^ 4 * y ^ 4 * z ^ 2 の約数の個数は75個
result += n4 * (n4 - 1) // 2 * (n2 - 2)
# x ^ 14 * y ^ 4 の約数の個数は75個
result += n14 * (n4 - 1)
# x ^ 24 * y ^ 2 の約数の個数は75個
result += n24 * (n2 - 1)
# x ^ 74 の約数の個数は75個
result += n74
print(result)
| # エラトステネスの篩
def make_prime_table(n):
sieve = list(range(n + 1))
sieve[0] = -1
sieve[1] = -1
for i in range(2, int(n**0.5) + 1):
if sieve[i] != i:
continue
for j in range(i * i, n + 1, i):
if sieve[j] == j:
sieve[j] = i
return sieve
def prime_factorize(n):
result = []
while n != 1:
p = prime_table[n]
c = 0
while n % p == 0:
n //= p
c += 1
result.append((p, c))
return result
N = int(eval(input()))
prime_table = make_prime_table(100)
d = {}
for i in range(2, N + 1):
for p, c in prime_factorize(i):
d.setdefault(p, 0)
d[p] += c
# 75 = 5 * 5 * 3
# = 15 * 5
# = 25 * 3
# = 75
n74 = 0
n24 = 0
n14 = 0
n4 = 0
n2 = 0
for k in d:
if d[k] >= 74:
n74 += 1
if d[k] >= 24:
n24 += 1
if d[k] >= 14:
n14 += 1
if d[k] >= 4:
n4 += 1
if d[k] >= 2:
n2 += 1
result = 0
# x ^ 4 * y ^ 4 * z ^ 2 の約数の個数は75個
result += n4 * (n4 - 1) // 2 * (n2 - 2)
# x ^ 14 * y ^ 4 の約数の個数は75個
result += n14 * (n4 - 1)
# x ^ 24 * y ^ 2 の約数の個数は75個
result += n24 * (n2 - 1)
# x ^ 74 の約数の個数は75個
result += n74
print(result)
| false | 16.41791 | [
"-def make_prime_table(N):",
"- sieve = list(range(N + 1))",
"+def make_prime_table(n):",
"+ sieve = list(range(n + 1))",
"- for i in range(2, int(N**0.5) + 1):",
"+ for i in range(2, int(n**0.5) + 1):",
"- for j in range(i * i, N + 1, i):",
"+ for j in range(i * i, n + 1, i):",
"+",
"+",
"+def prime_factorize(n):",
"+ result = []",
"+ while n != 1:",
"+ p = prime_table[n]",
"+ c = 0",
"+ while n % p == 0:",
"+ n //= p",
"+ c += 1",
"+ result.append((p, c))",
"+ return result",
"- while i != 1:",
"- d.setdefault(prime_table[i], 0)",
"- d[prime_table[i]] += 1",
"- i //= prime_table[i]",
"+ for p, c in prime_factorize(i):",
"+ d.setdefault(p, 0)",
"+ d[p] += c"
] | false | 0.039835 | 0.081797 | 0.487 | [
"s406342390",
"s931167768"
] |
u156314159 | p02694 | python | s462130352 | s463995094 | 300 | 57 | 79,032 | 63,464 | Accepted | Accepted | 81 | from sys import exit
def main():
X = int(eval(input()))
deposit = 100
i = 0
while True:
deposit = int(deposit * 1.01)
i += 1
if deposit >= X:
print(i)
exit()
if __name__ == '__main__':
main() | # from sys import exit
def main():
x = int(eval(input()))
d = 100
ans = 0
while d < x:
d = int(d*1.01)
ans += 1
print(ans)
if __name__ == '__main__':
main() | 17 | 14 | 273 | 210 | from sys import exit
def main():
X = int(eval(input()))
deposit = 100
i = 0
while True:
deposit = int(deposit * 1.01)
i += 1
if deposit >= X:
print(i)
exit()
if __name__ == "__main__":
main()
| # from sys import exit
def main():
x = int(eval(input()))
d = 100
ans = 0
while d < x:
d = int(d * 1.01)
ans += 1
print(ans)
if __name__ == "__main__":
main()
| false | 17.647059 | [
"-from sys import exit",
"-",
"-",
"+# from sys import exit",
"- X = int(eval(input()))",
"- deposit = 100",
"- i = 0",
"- while True:",
"- deposit = int(deposit * 1.01)",
"- i += 1",
"- if deposit >= X:",
"- print(i)",
"- exit()",
"+ x = int(eval(input()))",
"+ d = 100",
"+ ans = 0",
"+ while d < x:",
"+ d = int(d * 1.01)",
"+ ans += 1",
"+ print(ans)"
] | false | 0.048503 | 0.065265 | 0.743175 | [
"s462130352",
"s463995094"
] |
u021548497 | p02579 | python | s012680481 | s703307433 | 906 | 355 | 96,800 | 93,056 | Accepted | Accepted | 60.82 | import sys
from collections import deque
input = sys.stdin.readline
def main():
h, w = list(map(int, input().split()))
ch, cw = list(map(int, input().split()))
dh, dw = list(map(int, input().split()))
s = [input().replace("\n", "") for _ in range(h)]
ans = [[-1]*w for _ in range(h)]
ans[ch-1][cw-1] = 0
not_yet = deque([(ch-1, cw-1)])
one_time = deque([])
while not_yet:
x, y = not_yet.popleft()
one_time.append((x, y))
if x > 0 and ans[x-1][y] == -1 and s[x-1][y] == ".":
not_yet.append((x-1, y))
ans[x-1][y] = ans[x][y]
if x < h-1 and ans[x+1][y] == -1 and s[x+1][y] == ".":
not_yet.append((x+1, y))
ans[x+1][y] = ans[x][y]
if y > 0 and ans[x][y-1] == -1 and s[x][y-1] == ".":
not_yet.append((x, y-1))
ans[x][y-1] = ans[x][y]
if y < w-1 and ans[x][y+1] == -1 and s[x][y+1] == ".":
not_yet.append((x, y+1))
ans[x][y+1] = ans[x][y]
if not not_yet:
while one_time:
x2, y2 = one_time.popleft()
for i in range(max(0, x2-2), min(h, x2+3)):
for j in range(max(0, y2-2), min(w, y2+3)):
if ans[i][j] == -1 and s[i][j] == ".":
ans[i][j] = ans[x][y]+1
not_yet.append((i, j))
print((ans[dh-1][dw-1]))
if __name__ == "__main__":
main()
| import sys
from collections import deque
input = sys.stdin.readline
def main():
h, w = list(map(int, input().split()))
ch, cw = list(map(int, input().split()))
dh, dw = list(map(int, input().split()))
ch += 1
cw += 1
dh += 1
dw += 1
s = ["#"*(w+4)]
s.append("#"*(w+4))
for i in range(h):
s.append("##" + input().replace("\n", "") + "##")
s.append("#"*(w+4))
s.append("#"*(w+4))
ans = [[-1]*(w+4) for _ in range(h+4)]
for i in range(h+4):
for j in range(w+4):
if s[i][j] == "#":
ans[i][j] = -2
ans[ch][cw] = 0
move = [(-1, 0), (1, 0), (0, -1), (0, 1)]
not_yet = deque([(ch, cw)])
one_time = deque([])
while len(not_yet) > 0:
x, y = not_yet.popleft()
one_time.append((x, y))
for (p, q) in move:
if ans[x+p][y+q] == -1:
not_yet.append((x+p, y+q))
ans[x+p][y+q] = ans[x][y]
if len(not_yet) == 0:
while len(one_time) > 0:
x2, y2 = one_time.popleft()
for i in range(x2-2, x2+3):
for j in range(y2-2, y2+3):
if ans[i][j] == -1:
ans[i][j] = ans[x2][y2]+1
not_yet.append((i, j))
print((ans[dh][dw]))
if __name__ == "__main__":
main()
| 51 | 59 | 1,577 | 1,532 | import sys
from collections import deque
input = sys.stdin.readline
def main():
h, w = list(map(int, input().split()))
ch, cw = list(map(int, input().split()))
dh, dw = list(map(int, input().split()))
s = [input().replace("\n", "") for _ in range(h)]
ans = [[-1] * w for _ in range(h)]
ans[ch - 1][cw - 1] = 0
not_yet = deque([(ch - 1, cw - 1)])
one_time = deque([])
while not_yet:
x, y = not_yet.popleft()
one_time.append((x, y))
if x > 0 and ans[x - 1][y] == -1 and s[x - 1][y] == ".":
not_yet.append((x - 1, y))
ans[x - 1][y] = ans[x][y]
if x < h - 1 and ans[x + 1][y] == -1 and s[x + 1][y] == ".":
not_yet.append((x + 1, y))
ans[x + 1][y] = ans[x][y]
if y > 0 and ans[x][y - 1] == -1 and s[x][y - 1] == ".":
not_yet.append((x, y - 1))
ans[x][y - 1] = ans[x][y]
if y < w - 1 and ans[x][y + 1] == -1 and s[x][y + 1] == ".":
not_yet.append((x, y + 1))
ans[x][y + 1] = ans[x][y]
if not not_yet:
while one_time:
x2, y2 = one_time.popleft()
for i in range(max(0, x2 - 2), min(h, x2 + 3)):
for j in range(max(0, y2 - 2), min(w, y2 + 3)):
if ans[i][j] == -1 and s[i][j] == ".":
ans[i][j] = ans[x][y] + 1
not_yet.append((i, j))
print((ans[dh - 1][dw - 1]))
if __name__ == "__main__":
main()
| import sys
from collections import deque
input = sys.stdin.readline
def main():
h, w = list(map(int, input().split()))
ch, cw = list(map(int, input().split()))
dh, dw = list(map(int, input().split()))
ch += 1
cw += 1
dh += 1
dw += 1
s = ["#" * (w + 4)]
s.append("#" * (w + 4))
for i in range(h):
s.append("##" + input().replace("\n", "") + "##")
s.append("#" * (w + 4))
s.append("#" * (w + 4))
ans = [[-1] * (w + 4) for _ in range(h + 4)]
for i in range(h + 4):
for j in range(w + 4):
if s[i][j] == "#":
ans[i][j] = -2
ans[ch][cw] = 0
move = [(-1, 0), (1, 0), (0, -1), (0, 1)]
not_yet = deque([(ch, cw)])
one_time = deque([])
while len(not_yet) > 0:
x, y = not_yet.popleft()
one_time.append((x, y))
for (p, q) in move:
if ans[x + p][y + q] == -1:
not_yet.append((x + p, y + q))
ans[x + p][y + q] = ans[x][y]
if len(not_yet) == 0:
while len(one_time) > 0:
x2, y2 = one_time.popleft()
for i in range(x2 - 2, x2 + 3):
for j in range(y2 - 2, y2 + 3):
if ans[i][j] == -1:
ans[i][j] = ans[x2][y2] + 1
not_yet.append((i, j))
print((ans[dh][dw]))
if __name__ == "__main__":
main()
| false | 13.559322 | [
"- s = [input().replace(\"\\n\", \"\") for _ in range(h)]",
"- ans = [[-1] * w for _ in range(h)]",
"- ans[ch - 1][cw - 1] = 0",
"- not_yet = deque([(ch - 1, cw - 1)])",
"+ ch += 1",
"+ cw += 1",
"+ dh += 1",
"+ dw += 1",
"+ s = [\"#\" * (w + 4)]",
"+ s.append(\"#\" * (w + 4))",
"+ for i in range(h):",
"+ s.append(\"##\" + input().replace(\"\\n\", \"\") + \"##\")",
"+ s.append(\"#\" * (w + 4))",
"+ s.append(\"#\" * (w + 4))",
"+ ans = [[-1] * (w + 4) for _ in range(h + 4)]",
"+ for i in range(h + 4):",
"+ for j in range(w + 4):",
"+ if s[i][j] == \"#\":",
"+ ans[i][j] = -2",
"+ ans[ch][cw] = 0",
"+ move = [(-1, 0), (1, 0), (0, -1), (0, 1)]",
"+ not_yet = deque([(ch, cw)])",
"- while not_yet:",
"+ while len(not_yet) > 0:",
"- if x > 0 and ans[x - 1][y] == -1 and s[x - 1][y] == \".\":",
"- not_yet.append((x - 1, y))",
"- ans[x - 1][y] = ans[x][y]",
"- if x < h - 1 and ans[x + 1][y] == -1 and s[x + 1][y] == \".\":",
"- not_yet.append((x + 1, y))",
"- ans[x + 1][y] = ans[x][y]",
"- if y > 0 and ans[x][y - 1] == -1 and s[x][y - 1] == \".\":",
"- not_yet.append((x, y - 1))",
"- ans[x][y - 1] = ans[x][y]",
"- if y < w - 1 and ans[x][y + 1] == -1 and s[x][y + 1] == \".\":",
"- not_yet.append((x, y + 1))",
"- ans[x][y + 1] = ans[x][y]",
"- if not not_yet:",
"- while one_time:",
"+ for (p, q) in move:",
"+ if ans[x + p][y + q] == -1:",
"+ not_yet.append((x + p, y + q))",
"+ ans[x + p][y + q] = ans[x][y]",
"+ if len(not_yet) == 0:",
"+ while len(one_time) > 0:",
"- for i in range(max(0, x2 - 2), min(h, x2 + 3)):",
"- for j in range(max(0, y2 - 2), min(w, y2 + 3)):",
"- if ans[i][j] == -1 and s[i][j] == \".\":",
"- ans[i][j] = ans[x][y] + 1",
"+ for i in range(x2 - 2, x2 + 3):",
"+ for j in range(y2 - 2, y2 + 3):",
"+ if ans[i][j] == -1:",
"+ ans[i][j] = ans[x2][y2] + 1",
"- print((ans[dh - 1][dw - 1]))",
"+ print((ans[dh][dw]))"
] | false | 0.035879 | 0.056006 | 0.640626 | [
"s012680481",
"s703307433"
] |
u143509139 | p02681 | python | s841450517 | s818562054 | 58 | 26 | 61,572 | 8,840 | Accepted | Accepted | 55.17 | s = eval(input())
t = eval(input())
for i in range(26):
if s + chr(i + ord('a')) == t:
print('Yes')
break
else:
print('No')
| s = eval(input())
t = eval(input())
if s == t[:-1]:
print('Yes')
else:
print('No')
| 8 | 6 | 143 | 84 | s = eval(input())
t = eval(input())
for i in range(26):
if s + chr(i + ord("a")) == t:
print("Yes")
break
else:
print("No")
| s = eval(input())
t = eval(input())
if s == t[:-1]:
print("Yes")
else:
print("No")
| false | 25 | [
"-for i in range(26):",
"- if s + chr(i + ord(\"a\")) == t:",
"- print(\"Yes\")",
"- break",
"+if s == t[:-1]:",
"+ print(\"Yes\")"
] | false | 0.031904 | 0.032986 | 0.967192 | [
"s841450517",
"s818562054"
] |
u879870653 | p02984 | python | s194445716 | s136049955 | 297 | 157 | 71,012 | 17,988 | Accepted | Accepted | 47.14 | N = int(eval(input()))
A = list(map(int,input().split()))
calc = 0
for i in range(0,len(A),2) :
calc += A[i]
for i in range(1,len(A),2) :
calc -= A[i]
p = calc//2
X = [0 for i in range(N)]
X[0] = p
for i in range(1,len(X)) :
X[i] = A[i-1] - X[i-1]
ans = [x*2 for x in X]
print((*ans))
| N = int(eval(input()))
A = list(map(int,input().split()))
X = []
ans = []
x0 = 0
for i,a in enumerate(A) :
x0 += (a if i % 2 == 0 else -a)
x0 //= 2
X.append(x0)
ans.append(2*x0)
for i in range(1,N) :
xi = A[i-1] - X[-1]
X.append(xi)
ans.append(2*xi)
print((*ans)) | 20 | 15 | 314 | 285 | N = int(eval(input()))
A = list(map(int, input().split()))
calc = 0
for i in range(0, len(A), 2):
calc += A[i]
for i in range(1, len(A), 2):
calc -= A[i]
p = calc // 2
X = [0 for i in range(N)]
X[0] = p
for i in range(1, len(X)):
X[i] = A[i - 1] - X[i - 1]
ans = [x * 2 for x in X]
print((*ans))
| N = int(eval(input()))
A = list(map(int, input().split()))
X = []
ans = []
x0 = 0
for i, a in enumerate(A):
x0 += a if i % 2 == 0 else -a
x0 //= 2
X.append(x0)
ans.append(2 * x0)
for i in range(1, N):
xi = A[i - 1] - X[-1]
X.append(xi)
ans.append(2 * xi)
print((*ans))
| false | 25 | [
"-calc = 0",
"-for i in range(0, len(A), 2):",
"- calc += A[i]",
"-for i in range(1, len(A), 2):",
"- calc -= A[i]",
"-p = calc // 2",
"-X = [0 for i in range(N)]",
"-X[0] = p",
"-for i in range(1, len(X)):",
"- X[i] = A[i - 1] - X[i - 1]",
"-ans = [x * 2 for x in X]",
"+X = []",
"+ans = []",
"+x0 = 0",
"+for i, a in enumerate(A):",
"+ x0 += a if i % 2 == 0 else -a",
"+x0 //= 2",
"+X.append(x0)",
"+ans.append(2 * x0)",
"+for i in range(1, N):",
"+ xi = A[i - 1] - X[-1]",
"+ X.append(xi)",
"+ ans.append(2 * xi)"
] | false | 0.057361 | 0.035485 | 1.616487 | [
"s194445716",
"s136049955"
] |
u843175622 | p03588 | python | s122950170 | s632176695 | 307 | 253 | 10,868 | 22,712 | Accepted | Accepted | 17.59 | n=int(eval(input()))
a=[0]*-~n;b=[0]*-~n
mx=-1
mi=-1
for i in range(n):
a[i], b[i] = list(map(int,input().split()))
if a[i] > mx:
mx = a[i]; mi = i
print((mx+b[mi])) | n = int(eval(input()))
ab = [tuple(map(int, input().split())) for _ in range(n)]
ab.sort()
ans = ab[0][0] + ab[n - 1][1] + (ab[n - 1][0] - ab[0][0])
print(ans)
| 10 | 6 | 169 | 160 | n = int(eval(input()))
a = [0] * -~n
b = [0] * -~n
mx = -1
mi = -1
for i in range(n):
a[i], b[i] = list(map(int, input().split()))
if a[i] > mx:
mx = a[i]
mi = i
print((mx + b[mi]))
| n = int(eval(input()))
ab = [tuple(map(int, input().split())) for _ in range(n)]
ab.sort()
ans = ab[0][0] + ab[n - 1][1] + (ab[n - 1][0] - ab[0][0])
print(ans)
| false | 40 | [
"-a = [0] * -~n",
"-b = [0] * -~n",
"-mx = -1",
"-mi = -1",
"-for i in range(n):",
"- a[i], b[i] = list(map(int, input().split()))",
"- if a[i] > mx:",
"- mx = a[i]",
"- mi = i",
"-print((mx + b[mi]))",
"+ab = [tuple(map(int, input().split())) for _ in range(n)]",
"+ab.sort()",
"+ans = ab[0][0] + ab[n - 1][1] + (ab[n - 1][0] - ab[0][0])",
"+print(ans)"
] | false | 0.041022 | 0.039282 | 1.044287 | [
"s122950170",
"s632176695"
] |
u857428111 | p03715 | python | s019239805 | s954791384 | 312 | 195 | 65,644 | 39,920 | Accepted | Accepted | 37.5 | #!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return list(map(type,input().split()))
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))
#%%code
from fractions import gcd
def resolve():
H,W=pin()
#たてに切る
hori=0 if W%3==0 else H
#よこにきる
vert=0 if H%3==0 else W
#たてに切った後よこ
sp1=H*W
for w in range(W):
g=H*(w+1)
#b>=rとする
t=(H+1)//2
b=t*(W-w-1)
r=(H//2)*(W-w-1)
sp1=min(sp1,max(g,b,r)-min(g,b,r))
#横に切った後たて
sp2=H*W
for h in range(H):
g=W*(h+1)
#b>=rとする
t=(W+1)//2
b=t*(H-h-1)
r=(W//2)*(H-h-1)
sp2=min(sp2,max(g,b,r)-min(g,b,r))
#上4つの最小 間に合ってほしいねぇ
print((min(hori,vert,sp1,sp2)))
#%%submit!
resolve() | #!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return list(map(type,input().split()))
def tupin(t=int):return tuple(pin(t))
#%%code
def resolve():
H,W=pin()
if H%3==0 or W%3==0:
print((0))
return
#
ans=min(H,W)
for i in range(1,H):
yoko=W*i
a=W//2*(H-i)
b=W*H-yoko-a
t=(max(yoko,a,b)-min(yoko,a,b))
ans=min(t,ans)
for j in range(1,W):
yoko=H*j
a=(H//2)*(W-j)
b=W*H-yoko-a
t=(max(yoko,a,b)-min(yoko,a,b))
ans=min(t,ans)
print(ans)
#%%submit!
resolve() | 39 | 33 | 905 | 703 | #!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):
return list(map(type, input().split()))
def tupin(t=int):
return tuple(pin(t))
def lispin(t=int):
return list(pin(t))
#%%code
from fractions import gcd
def resolve():
H, W = pin()
# たてに切る
hori = 0 if W % 3 == 0 else H
# よこにきる
vert = 0 if H % 3 == 0 else W
# たてに切った後よこ
sp1 = H * W
for w in range(W):
g = H * (w + 1)
# b>=rとする
t = (H + 1) // 2
b = t * (W - w - 1)
r = (H // 2) * (W - w - 1)
sp1 = min(sp1, max(g, b, r) - min(g, b, r))
# 横に切った後たて
sp2 = H * W
for h in range(H):
g = W * (h + 1)
# b>=rとする
t = (W + 1) // 2
b = t * (H - h - 1)
r = (W // 2) * (H - h - 1)
sp2 = min(sp2, max(g, b, r) - min(g, b, r))
# 上4つの最小 間に合ってほしいねぇ
print((min(hori, vert, sp1, sp2)))
#%%submit!
resolve()
| #!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input = lambda: sys.stdin.readline().rstrip()
def pin(type=int):
return list(map(type, input().split()))
def tupin(t=int):
return tuple(pin(t))
#%%code
def resolve():
H, W = pin()
if H % 3 == 0 or W % 3 == 0:
print((0))
return
#
ans = min(H, W)
for i in range(1, H):
yoko = W * i
a = W // 2 * (H - i)
b = W * H - yoko - a
t = max(yoko, a, b) - min(yoko, a, b)
ans = min(t, ans)
for j in range(1, W):
yoko = H * j
a = (H // 2) * (W - j)
b = W * H - yoko - a
t = max(yoko, a, b) - min(yoko, a, b)
ans = min(t, ans)
print(ans)
#%%submit!
resolve()
| false | 15.384615 | [
"-sys.setrecursionlimit(10**9)",
"-def lispin(t=int):",
"- return list(pin(t))",
"-",
"-",
"-from fractions import gcd",
"-",
"-",
"- # たてに切る",
"- hori = 0 if W % 3 == 0 else H",
"- # よこにきる",
"- vert = 0 if H % 3 == 0 else W",
"- # たてに切った後よこ",
"- sp1 = H * W",
"- for w in range(W):",
"- g = H * (w + 1)",
"- # b>=rとする",
"- t = (H + 1) // 2",
"- b = t * (W - w - 1)",
"- r = (H // 2) * (W - w - 1)",
"- sp1 = min(sp1, max(g, b, r) - min(g, b, r))",
"- # 横に切った後たて",
"- sp2 = H * W",
"- for h in range(H):",
"- g = W * (h + 1)",
"- # b>=rとする",
"- t = (W + 1) // 2",
"- b = t * (H - h - 1)",
"- r = (W // 2) * (H - h - 1)",
"- sp2 = min(sp2, max(g, b, r) - min(g, b, r))",
"- # 上4つの最小 間に合ってほしいねぇ",
"- print((min(hori, vert, sp1, sp2)))",
"+ if H % 3 == 0 or W % 3 == 0:",
"+ print((0))",
"+ return",
"+ #",
"+ ans = min(H, W)",
"+ for i in range(1, H):",
"+ yoko = W * i",
"+ a = W // 2 * (H - i)",
"+ b = W * H - yoko - a",
"+ t = max(yoko, a, b) - min(yoko, a, b)",
"+ ans = min(t, ans)",
"+ for j in range(1, W):",
"+ yoko = H * j",
"+ a = (H // 2) * (W - j)",
"+ b = W * H - yoko - a",
"+ t = max(yoko, a, b) - min(yoko, a, b)",
"+ ans = min(t, ans)",
"+ print(ans)"
] | false | 0.074109 | 0.069774 | 1.062137 | [
"s019239805",
"s954791384"
] |
u644907318 | p03221 | python | s117891941 | s939093824 | 1,124 | 934 | 53,120 | 82,452 | Accepted | Accepted | 16.9 | N,M = list(map(int,input().split()))
G = {}
for i in range(M):
P,Y = list(map(int,input().split()))
if P not in G:
G[P]=[]
G[P].append((i+1,Y))
C = []
for P in G:
G[P] = sorted(G[P],key=lambda x:x[1])
a = len(str(P))
x = "0"*(6-a)+str(P)
for i in range(len(G[P])):
b = len(str(i+1))
y = x+"0"*(6-b)+str(i+1)
C.append((G[P][i][0],y))
C = sorted(C,key=lambda x:x[0])
for c in C:
print((c[1])) | from bisect import bisect_left
N,M = list(map(int,input().split()))
C = {i:[] for i in range(1,N+1)}
city = [0 for _ in range(M+1)]
for j in range(1,M+1):
p,y = list(map(int,input().split()))
C[p].append((y,j))
city[j]=(p,y)
for p in C:
if len(C[p])>0:
C[p] = sorted(C[p],key=lambda x:x[0])
for j in range(1,M+1):
p,y = city[j]
ind = bisect_left(C[p],(y,j))
p = str(p)
if len(p)<6:
p ="0"*(6-len(p))+p
x = str(ind+1)
if len(x)<6:
x = "0"*(6-len(x))+x
print((p+x)) | 19 | 21 | 458 | 537 | N, M = list(map(int, input().split()))
G = {}
for i in range(M):
P, Y = list(map(int, input().split()))
if P not in G:
G[P] = []
G[P].append((i + 1, Y))
C = []
for P in G:
G[P] = sorted(G[P], key=lambda x: x[1])
a = len(str(P))
x = "0" * (6 - a) + str(P)
for i in range(len(G[P])):
b = len(str(i + 1))
y = x + "0" * (6 - b) + str(i + 1)
C.append((G[P][i][0], y))
C = sorted(C, key=lambda x: x[0])
for c in C:
print((c[1]))
| from bisect import bisect_left
N, M = list(map(int, input().split()))
C = {i: [] for i in range(1, N + 1)}
city = [0 for _ in range(M + 1)]
for j in range(1, M + 1):
p, y = list(map(int, input().split()))
C[p].append((y, j))
city[j] = (p, y)
for p in C:
if len(C[p]) > 0:
C[p] = sorted(C[p], key=lambda x: x[0])
for j in range(1, M + 1):
p, y = city[j]
ind = bisect_left(C[p], (y, j))
p = str(p)
if len(p) < 6:
p = "0" * (6 - len(p)) + p
x = str(ind + 1)
if len(x) < 6:
x = "0" * (6 - len(x)) + x
print((p + x))
| false | 9.52381 | [
"+from bisect import bisect_left",
"+",
"-G = {}",
"-for i in range(M):",
"- P, Y = list(map(int, input().split()))",
"- if P not in G:",
"- G[P] = []",
"- G[P].append((i + 1, Y))",
"-C = []",
"-for P in G:",
"- G[P] = sorted(G[P], key=lambda x: x[1])",
"- a = len(str(P))",
"- x = \"0\" * (6 - a) + str(P)",
"- for i in range(len(G[P])):",
"- b = len(str(i + 1))",
"- y = x + \"0\" * (6 - b) + str(i + 1)",
"- C.append((G[P][i][0], y))",
"-C = sorted(C, key=lambda x: x[0])",
"-for c in C:",
"- print((c[1]))",
"+C = {i: [] for i in range(1, N + 1)}",
"+city = [0 for _ in range(M + 1)]",
"+for j in range(1, M + 1):",
"+ p, y = list(map(int, input().split()))",
"+ C[p].append((y, j))",
"+ city[j] = (p, y)",
"+for p in C:",
"+ if len(C[p]) > 0:",
"+ C[p] = sorted(C[p], key=lambda x: x[0])",
"+for j in range(1, M + 1):",
"+ p, y = city[j]",
"+ ind = bisect_left(C[p], (y, j))",
"+ p = str(p)",
"+ if len(p) < 6:",
"+ p = \"0\" * (6 - len(p)) + p",
"+ x = str(ind + 1)",
"+ if len(x) < 6:",
"+ x = \"0\" * (6 - len(x)) + x",
"+ print((p + x))"
] | false | 0.037662 | 0.038346 | 0.982167 | [
"s117891941",
"s939093824"
] |
u644907318 | p02777 | python | s239266206 | s171823308 | 160 | 63 | 38,256 | 61,896 | Accepted | Accepted | 60.62 | S,T = input().split()
A,B = list(map(int,input().split()))
U = input().strip()
if U==S:
print((A-1,B))
else:
print((A,B-1)) | S,T = input().split()
A,B = list(map(int,input().split()))
U = input().strip()
if S==U:
print((A-1,B))
else:
print((A,B-1)) | 7 | 7 | 127 | 127 | S, T = input().split()
A, B = list(map(int, input().split()))
U = input().strip()
if U == S:
print((A - 1, B))
else:
print((A, B - 1))
| S, T = input().split()
A, B = list(map(int, input().split()))
U = input().strip()
if S == U:
print((A - 1, B))
else:
print((A, B - 1))
| false | 0 | [
"-if U == S:",
"+if S == U:"
] | false | 0.037042 | 0.037152 | 0.997029 | [
"s239266206",
"s171823308"
] |
u479719434 | p03167 | python | s126348699 | s448818889 | 958 | 494 | 44,608 | 44,636 | Accepted | Accepted | 48.43 | mod = 10**9+7
def main():
H, W = list(map(int, input().split()))
a = [eval(input()) for _ in range(H)]
dp = [[0 for _ in range(W)] for _ in range(H)]
dp[0][0] = 1
for i in range(H):
for j in range(W):
if a[i][j] == ".":
if j+1 < W:
dp[i][j + 1] += dp[i][j]
dp[i][j+1] %= mod
if i+1 < H:
dp[i + 1][j] += dp[i][j]
dp[i+1][j] %= mod
print((dp[-1][-1]))
if __name__ == "__main__":
main()
| mod = 10**9+7
def main():
H, W = list(map(int, input().split()))
a = [eval(input()) for _ in range(H)]
dp = [[0 for _ in range(W)] for _ in range(H)]
dp[0][0] = 1
for i in range(H):
for j in range(W):
if i != 0 or j != 0:
if a[i][j] == ".":
dp[i][j] = dp[i - 1][j] + dp[i][j - 1]
dp[i][j] %= mod
print((dp[-1][-1]))
if __name__ == "__main__":
main()
| 22 | 19 | 555 | 462 | mod = 10**9 + 7
def main():
H, W = list(map(int, input().split()))
a = [eval(input()) for _ in range(H)]
dp = [[0 for _ in range(W)] for _ in range(H)]
dp[0][0] = 1
for i in range(H):
for j in range(W):
if a[i][j] == ".":
if j + 1 < W:
dp[i][j + 1] += dp[i][j]
dp[i][j + 1] %= mod
if i + 1 < H:
dp[i + 1][j] += dp[i][j]
dp[i + 1][j] %= mod
print((dp[-1][-1]))
if __name__ == "__main__":
main()
| mod = 10**9 + 7
def main():
H, W = list(map(int, input().split()))
a = [eval(input()) for _ in range(H)]
dp = [[0 for _ in range(W)] for _ in range(H)]
dp[0][0] = 1
for i in range(H):
for j in range(W):
if i != 0 or j != 0:
if a[i][j] == ".":
dp[i][j] = dp[i - 1][j] + dp[i][j - 1]
dp[i][j] %= mod
print((dp[-1][-1]))
if __name__ == "__main__":
main()
| false | 13.636364 | [
"- if a[i][j] == \".\":",
"- if j + 1 < W:",
"- dp[i][j + 1] += dp[i][j]",
"- dp[i][j + 1] %= mod",
"- if i + 1 < H:",
"- dp[i + 1][j] += dp[i][j]",
"- dp[i + 1][j] %= mod",
"+ if i != 0 or j != 0:",
"+ if a[i][j] == \".\":",
"+ dp[i][j] = dp[i - 1][j] + dp[i][j - 1]",
"+ dp[i][j] %= mod"
] | false | 0.075428 | 0.032979 | 2.287146 | [
"s126348699",
"s448818889"
] |
u777283665 | p03578 | python | s996615285 | s130623653 | 262 | 239 | 67,680 | 67,680 | Accepted | Accepted | 8.78 | from collections import Counter
n = int(eval(input()))
D = Counter(input().split())
m = int(eval(input()))
for i, j in list(Counter(input().split()).items()):
if i not in D or D[i] < j:
print("NO")
exit()
print("YES") | from collections import Counter
eval(input())
d = Counter(input().split())
eval(input())
t = Counter(input().split())
if all(ti in d and d[ti] >= tc for ti, tc in list(t.items())):
print("YES")
else:
print("NO") | 9 | 11 | 227 | 213 | from collections import Counter
n = int(eval(input()))
D = Counter(input().split())
m = int(eval(input()))
for i, j in list(Counter(input().split()).items()):
if i not in D or D[i] < j:
print("NO")
exit()
print("YES")
| from collections import Counter
eval(input())
d = Counter(input().split())
eval(input())
t = Counter(input().split())
if all(ti in d and d[ti] >= tc for ti, tc in list(t.items())):
print("YES")
else:
print("NO")
| false | 18.181818 | [
"-n = int(eval(input()))",
"-D = Counter(input().split())",
"-m = int(eval(input()))",
"-for i, j in list(Counter(input().split()).items()):",
"- if i not in D or D[i] < j:",
"- print(\"NO\")",
"- exit()",
"-print(\"YES\")",
"+eval(input())",
"+d = Counter(input().split())",
"+eval(input())",
"+t = Counter(input().split())",
"+if all(ti in d and d[ti] >= tc for ti, tc in list(t.items())):",
"+ print(\"YES\")",
"+else:",
"+ print(\"NO\")"
] | false | 0.036224 | 0.037418 | 0.968101 | [
"s996615285",
"s130623653"
] |
u729133443 | p03533 | python | s058088426 | s529190269 | 22 | 19 | 3,188 | 3,188 | Accepted | Accepted | 13.64 | import re;print((['NO','YES'][re.match('A?KIHA?BA?RA?$',eval(input()))!=None])) | import re;print(('YES'if re.match('A?KIHA?BA?RA?$',eval(input()))else 'NO')) | 1 | 1 | 71 | 68 | import re
print((["NO", "YES"][re.match("A?KIHA?BA?RA?$", eval(input())) != None]))
| import re
print(("YES" if re.match("A?KIHA?BA?RA?$", eval(input())) else "NO"))
| false | 0 | [
"-print(([\"NO\", \"YES\"][re.match(\"A?KIHA?BA?RA?$\", eval(input())) != None]))",
"+print((\"YES\" if re.match(\"A?KIHA?BA?RA?$\", eval(input())) else \"NO\"))"
] | false | 0.049831 | 0.049373 | 1.009277 | [
"s058088426",
"s529190269"
] |
u241159583 | p03379 | python | s761056506 | s183281953 | 388 | 178 | 49,028 | 30,764 | Accepted | Accepted | 54.12 | n = int(eval(input()))
x = list(enumerate(map(int, input().split())))
x.sort(key=lambda x:x[1])
ans = [""]*n
for i in range(n):
if (n+1)//2 >= i+1: ans[x[i][0]] = x[(n+1)//2][1]
else: ans[x[i][0]] = x[(n+1)//2-1][1]
print(("\n".join(map(str, ans)))) | n = int(eval(input()))
X = list(map(int, input().split()))
x = sorted(X)
l = x[n//2-1]
r = x[n//2]
for i in range(n):
if X[i] <= l:
print(r)
else:
print(l) | 9 | 10 | 254 | 182 | n = int(eval(input()))
x = list(enumerate(map(int, input().split())))
x.sort(key=lambda x: x[1])
ans = [""] * n
for i in range(n):
if (n + 1) // 2 >= i + 1:
ans[x[i][0]] = x[(n + 1) // 2][1]
else:
ans[x[i][0]] = x[(n + 1) // 2 - 1][1]
print(("\n".join(map(str, ans))))
| n = int(eval(input()))
X = list(map(int, input().split()))
x = sorted(X)
l = x[n // 2 - 1]
r = x[n // 2]
for i in range(n):
if X[i] <= l:
print(r)
else:
print(l)
| false | 10 | [
"-x = list(enumerate(map(int, input().split())))",
"-x.sort(key=lambda x: x[1])",
"-ans = [\"\"] * n",
"+X = list(map(int, input().split()))",
"+x = sorted(X)",
"+l = x[n // 2 - 1]",
"+r = x[n // 2]",
"- if (n + 1) // 2 >= i + 1:",
"- ans[x[i][0]] = x[(n + 1) // 2][1]",
"+ if X[i] <= l:",
"+ print(r)",
"- ans[x[i][0]] = x[(n + 1) // 2 - 1][1]",
"-print((\"\\n\".join(map(str, ans))))",
"+ print(l)"
] | false | 0.040243 | 0.077472 | 0.51946 | [
"s761056506",
"s183281953"
] |
u707960254 | p02697 | python | s799146356 | s584233622 | 105 | 96 | 79,968 | 80,352 | Accepted | Accepted | 8.57 | def odd():
for i in range(M):
print((order[i], reverse[i]))
def multipule4():
d = 0
for i in range(M):
if reverse[i] - order[i] == N//2:
d = 1
print((order[i+d], reverse[i]))
def even():
d = 0
for i in range(M):
if i == (N//2-1) //2:
d = 1
print((order[i+d], reverse[i]))
N, M = list(map(int, input().split()))
order = [i for i in range(2, N+1)]
reverse = order[::-1]
if N%2 != 0:
odd()
elif N%4 == 0:
multipule4()
else:
even() | def main():
d = 0
for i in range(M):
if N%4 == 0 and reverse[i] - order[i] == N//2:
d = 1
if N%2 == 0 and i == (N//2-1) //2:
d = 1
print((order[i+d], reverse[i]))
N, M = list(map(int, input().split()))
order = [i for i in range(2, N+1)]
reverse = order[::-1]
main() | 29 | 13 | 548 | 326 | def odd():
for i in range(M):
print((order[i], reverse[i]))
def multipule4():
d = 0
for i in range(M):
if reverse[i] - order[i] == N // 2:
d = 1
print((order[i + d], reverse[i]))
def even():
d = 0
for i in range(M):
if i == (N // 2 - 1) // 2:
d = 1
print((order[i + d], reverse[i]))
N, M = list(map(int, input().split()))
order = [i for i in range(2, N + 1)]
reverse = order[::-1]
if N % 2 != 0:
odd()
elif N % 4 == 0:
multipule4()
else:
even()
| def main():
d = 0
for i in range(M):
if N % 4 == 0 and reverse[i] - order[i] == N // 2:
d = 1
if N % 2 == 0 and i == (N // 2 - 1) // 2:
d = 1
print((order[i + d], reverse[i]))
N, M = list(map(int, input().split()))
order = [i for i in range(2, N + 1)]
reverse = order[::-1]
main()
| false | 55.172414 | [
"-def odd():",
"- for i in range(M):",
"- print((order[i], reverse[i]))",
"-",
"-",
"-def multipule4():",
"+def main():",
"- if reverse[i] - order[i] == N // 2:",
"+ if N % 4 == 0 and reverse[i] - order[i] == N // 2:",
"- print((order[i + d], reverse[i]))",
"-",
"-",
"-def even():",
"- d = 0",
"- for i in range(M):",
"- if i == (N // 2 - 1) // 2:",
"+ if N % 2 == 0 and i == (N // 2 - 1) // 2:",
"-if N % 2 != 0:",
"- odd()",
"-elif N % 4 == 0:",
"- multipule4()",
"-else:",
"- even()",
"+main()"
] | false | 0.040843 | 0.040194 | 1.016135 | [
"s799146356",
"s584233622"
] |
u691896522 | p02781 | python | s654233510 | s279085629 | 1,953 | 169 | 83,804 | 38,256 | Accepted | Accepted | 91.35 | n = eval(input())
K = int(eval(input()))
len_n = len(n)
ans = 0
#自由な数字を選んでいいのかどうか？、今使った0以外、今の桁数
def calc(free, count, now):
global ans
if count == K:
ans += 1
return
if now == len_n:
return
if free:
for _ in range(9):
calc(free, count + 1, now+1)
#この数字を0にするとき
calc(free, count, now+1)
else:
#自由に数字選べない時
if n[now] != '0':
for _ in range(int(n[now])-1):
calc(not free, count + 1, now+1)
#この数字を元の数字と同じ
calc(free, count+1, now+1)
#このすうじを0にする
calc(not free, count, now+1)
else:
calc(free, count, now+1)
calc(False,0,0)
print(ans) | n = eval(input())
k = int(eval(input()))
#nより小さいことが確定しているdp
#dp_0[i][j] := i桁目まで決めて、0でない数字をj個使った時の数字の個数
dp_0 = [[0 for i in range(k+1)] for j in range(len(n))]
#nより小さいことが確定していないdp
#dp_1[i][j] := i桁目まで決めて、0でない数字をj個使った時の数字の個数。
dp_1 = [[0 for i in range(k+1)] for j in range(len(n))]
dp_0[0][0] = 1
dp_0[0][1] = int(n[0]) - 1
dp_1[0][1] = 1
for i in range(1,len(n)):
dp_0[i][0] = 1
for j in range(1,k+1):
#今回の桁が0でないことを想定
if n[i] != '0':
#0を使う場合と使わない場合両方考える
#まずは使わない場合
dp_0[i][j] = dp_0[i-1][j-1] * 9 + dp_1[i-1][j-1] * (int(n[i]) - 1) + dp_0[i-1][j] + dp_1[i-1][j]
dp_1[i][j] = dp_1[i-1][j-1]
#0を使う場合。この時はjが変化しない。なぜなら0を使うか
#dp_1の更新は無し。
#なぜなら、今回の桁が0でないことを想定しているため、もうnを超えることはないから
else:
#今回の桁が0の場合
#dp_1を遷移式に入れない理由は、今回の桁が0だった時は、どんな数字の選び方をしても
#さっきの桁まででnより小さいことが確定しないものが
#今回の桁の決め方で確定することはないから。
dp_0[i][j] = dp_0[i-1][j-1] * 9 + dp_0[i-1][j]
dp_1[i][j] = dp_1[i-1][j]
#print(dp_0)
#print(dp_1)
print((dp_0[-1][k] + dp_1[-1][k]))
| 30 | 34 | 730 | 1,125 | n = eval(input())
K = int(eval(input()))
len_n = len(n)
ans = 0
# 自由な数字を選んでいいのかどうか？、今使った0以外、今の桁数
def calc(free, count, now):
global ans
if count == K:
ans += 1
return
if now == len_n:
return
if free:
for _ in range(9):
calc(free, count + 1, now + 1)
# この数字を0にするとき
calc(free, count, now + 1)
else:
# 自由に数字選べない時
if n[now] != "0":
for _ in range(int(n[now]) - 1):
calc(not free, count + 1, now + 1)
# この数字を元の数字と同じ
calc(free, count + 1, now + 1)
# このすうじを0にする
calc(not free, count, now + 1)
else:
calc(free, count, now + 1)
calc(False, 0, 0)
print(ans)
| n = eval(input())
k = int(eval(input()))
# nより小さいことが確定しているdp
# dp_0[i][j] := i桁目まで決めて、0でない数字をj個使った時の数字の個数
dp_0 = [[0 for i in range(k + 1)] for j in range(len(n))]
# nより小さいことが確定していないdp
# dp_1[i][j] := i桁目まで決めて、0でない数字をj個使った時の数字の個数。
dp_1 = [[0 for i in range(k + 1)] for j in range(len(n))]
dp_0[0][0] = 1
dp_0[0][1] = int(n[0]) - 1
dp_1[0][1] = 1
for i in range(1, len(n)):
dp_0[i][0] = 1
for j in range(1, k + 1):
# 今回の桁が0でないことを想定
if n[i] != "0":
# 0を使う場合と使わない場合両方考える
# まずは使わない場合
dp_0[i][j] = (
dp_0[i - 1][j - 1] * 9
+ dp_1[i - 1][j - 1] * (int(n[i]) - 1)
+ dp_0[i - 1][j]
+ dp_1[i - 1][j]
)
dp_1[i][j] = dp_1[i - 1][j - 1]
# 0を使う場合。この時はjが変化しない。なぜなら0を使うか
# dp_1の更新は無し。
# なぜなら、今回の桁が0でないことを想定しているため、もうnを超えることはないから
else:
# 今回の桁が0の場合
# dp_1を遷移式に入れない理由は、今回の桁が0だった時は、どんな数字の選び方をしても
# さっきの桁まででnより小さいことが確定しないものが
# 今回の桁の決め方で確定することはないから。
dp_0[i][j] = dp_0[i - 1][j - 1] * 9 + dp_0[i - 1][j]
dp_1[i][j] = dp_1[i - 1][j]
# print(dp_0)
# print(dp_1)
print((dp_0[-1][k] + dp_1[-1][k]))
| false | 11.764706 | [
"-K = int(eval(input()))",
"-len_n = len(n)",
"-ans = 0",
"-# 自由な数字を選んでいいのかどうか？、今使った0以外、今の桁数",
"-def calc(free, count, now):",
"- global ans",
"- if count == K:",
"- ans += 1",
"- return",
"- if now == len_n:",
"- return",
"- if free:",
"- for _ in range(9):",
"- calc(free, count + 1, now + 1)",
"- # この数字を0にするとき",
"- calc(free, count, now + 1)",
"- else:",
"- # 自由に数字選べない時",
"- if n[now] != \"0\":",
"- for _ in range(int(n[now]) - 1):",
"- calc(not free, count + 1, now + 1)",
"- # この数字を元の数字と同じ",
"- calc(free, count + 1, now + 1)",
"- # このすうじを0にする",
"- calc(not free, count, now + 1)",
"+k = int(eval(input()))",
"+# nより小さいことが確定しているdp",
"+# dp_0[i][j] := i桁目まで決めて、0でない数字をj個使った時の数字の個数",
"+dp_0 = [[0 for i in range(k + 1)] for j in range(len(n))]",
"+# nより小さいことが確定していないdp",
"+# dp_1[i][j] := i桁目まで決めて、0でない数字をj個使った時の数字の個数。",
"+dp_1 = [[0 for i in range(k + 1)] for j in range(len(n))]",
"+dp_0[0][0] = 1",
"+dp_0[0][1] = int(n[0]) - 1",
"+dp_1[0][1] = 1",
"+for i in range(1, len(n)):",
"+ dp_0[i][0] = 1",
"+ for j in range(1, k + 1):",
"+ # 今回の桁が0でないことを想定",
"+ if n[i] != \"0\":",
"+ # 0を使う場合と使わない場合両方考える",
"+ # まずは使わない場合",
"+ dp_0[i][j] = (",
"+ dp_0[i - 1][j - 1] * 9",
"+ + dp_1[i - 1][j - 1] * (int(n[i]) - 1)",
"+ + dp_0[i - 1][j]",
"+ + dp_1[i - 1][j]",
"+ )",
"+ dp_1[i][j] = dp_1[i - 1][j - 1]",
"+ # 0を使う場合。この時はjが変化しない。なぜなら0を使うか",
"+ # dp_1の更新は無し。",
"+ # なぜなら、今回の桁が0でないことを想定しているため、もうnを超えることはないから",
"- calc(free, count, now + 1)",
"-",
"-",
"-calc(False, 0, 0)",
"-print(ans)",
"+ # 今回の桁が0の場合",
"+ # dp_1を遷移式に入れない理由は、今回の桁が0だった時は、どんな数字の選び方をしても",
"+ # さっきの桁まででnより小さいことが確定しないものが",
"+ # 今回の桁の決め方で確定することはないから。",
"+ dp_0[i][j] = dp_0[i - 1][j - 1] * 9 + dp_0[i - 1][j]",
"+ dp_1[i][j] = dp_1[i - 1][j]",
"+# print(dp_0)",
"+# print(dp_1)",
"+print((dp_0[-1][k] + dp_1[-1][k]))"
] | false | 0.061906 | 0.036595 | 1.691686 | [
"s654233510",
"s279085629"
] |
u297574184 | p02892 | python | s381653158 | s969395071 | 1,024 | 189 | 3,948 | 3,700 | Accepted | Accepted | 81.54 | from collections import deque
N = int(eval(input()))
Sss = [eval(input()) for _ in range(N)]
adjL = [[] for _ in range(N)]
for i, Ss in enumerate(Sss):
for j, S in enumerate(Ss):
if S == '1':
adjL[i].append(j)
def IsBipartiteGraph(adjList):
def bfs(vSt):
colors[vSt] = 1
Q = deque([vSt])
while Q:
vNow = Q.popleft()
color = colors[vNow]
for v2 in adjList[vNow]:
if colors[v2] == color:
return False
elif colors[v2] == 0:
colors[v2] = -color
Q.append(v2)
return True
numV = len(adjList)
colors = [0] * numV
for vSt in range(numV):
if colors[vSt] != 0: continue
if not bfs(vSt):
return False
return True
def WarshallFloyd(adjList):
numV = len(adjList)
D = [[float('inf')]*numV for _ in range(numV)]
for u, adj in enumerate(adjList):
for v in adj:
D[u][v] = 1
D[u][u] = 0
for k in range(numV):
Dk = D[k]
for i in range(numV):
Di = D[i]
Dik = Di[k]
for j in range(numV):
D2 = Dik + Dk[j]
if D2 < Di[j]:
D[i][j] = D2
return D
if not IsBipartiteGraph(adjL):
print((-1))
else:
distss = WarshallFloyd(adjL)
maxDist = max(list(map(max, distss)))
print((maxDist+1))
| from collections import deque
N = int(eval(input()))
Sss = [eval(input()) for _ in range(N)]
adjL = [[] for _ in range(N)]
for i, Ss in enumerate(Sss):
for j, S in enumerate(Ss):
if S == '1':
adjL[i].append(j)
def IsBipartiteGraph(adjList):
def bfs(vSt):
colors[vSt] = 1
Q = deque([vSt])
while Q:
vNow = Q.popleft()
color = colors[vNow]
for v2 in adjList[vNow]:
if colors[v2] == color:
return False
elif colors[v2] == 0:
colors[v2] = -color
Q.append(v2)
return True
numV = len(adjList)
colors = [0] * numV
for vSt in range(numV):
if colors[vSt] != 0: continue
if not bfs(vSt):
return False
return True
def getDiameterOfUnweightedGraph(adjList):
numV = len(adjList)
def bfs(vSt):
costs = [-1] * numV
costs[vSt] = cost = 0
vs = [vSt]
while vs:
cost += 1
v2s = []
for v in vs:
for v2 in adjList[v]:
if costs[v2] == -1:
costs[v2] = cost
v2s.append(v2)
vs = v2s
return cost - 1
return max([bfs(vSt) for vSt in range(numV)])
if not IsBipartiteGraph(adjL):
print((-1))
else:
maxDist = getDiameterOfUnweightedGraph(adjL)
print((maxDist+1))
| 58 | 57 | 1,497 | 1,506 | from collections import deque
N = int(eval(input()))
Sss = [eval(input()) for _ in range(N)]
adjL = [[] for _ in range(N)]
for i, Ss in enumerate(Sss):
for j, S in enumerate(Ss):
if S == "1":
adjL[i].append(j)
def IsBipartiteGraph(adjList):
def bfs(vSt):
colors[vSt] = 1
Q = deque([vSt])
while Q:
vNow = Q.popleft()
color = colors[vNow]
for v2 in adjList[vNow]:
if colors[v2] == color:
return False
elif colors[v2] == 0:
colors[v2] = -color
Q.append(v2)
return True
numV = len(adjList)
colors = [0] * numV
for vSt in range(numV):
if colors[vSt] != 0:
continue
if not bfs(vSt):
return False
return True
def WarshallFloyd(adjList):
numV = len(adjList)
D = [[float("inf")] * numV for _ in range(numV)]
for u, adj in enumerate(adjList):
for v in adj:
D[u][v] = 1
D[u][u] = 0
for k in range(numV):
Dk = D[k]
for i in range(numV):
Di = D[i]
Dik = Di[k]
for j in range(numV):
D2 = Dik + Dk[j]
if D2 < Di[j]:
D[i][j] = D2
return D
if not IsBipartiteGraph(adjL):
print((-1))
else:
distss = WarshallFloyd(adjL)
maxDist = max(list(map(max, distss)))
print((maxDist + 1))
| from collections import deque
N = int(eval(input()))
Sss = [eval(input()) for _ in range(N)]
adjL = [[] for _ in range(N)]
for i, Ss in enumerate(Sss):
for j, S in enumerate(Ss):
if S == "1":
adjL[i].append(j)
def IsBipartiteGraph(adjList):
def bfs(vSt):
colors[vSt] = 1
Q = deque([vSt])
while Q:
vNow = Q.popleft()
color = colors[vNow]
for v2 in adjList[vNow]:
if colors[v2] == color:
return False
elif colors[v2] == 0:
colors[v2] = -color
Q.append(v2)
return True
numV = len(adjList)
colors = [0] * numV
for vSt in range(numV):
if colors[vSt] != 0:
continue
if not bfs(vSt):
return False
return True
def getDiameterOfUnweightedGraph(adjList):
numV = len(adjList)
def bfs(vSt):
costs = [-1] * numV
costs[vSt] = cost = 0
vs = [vSt]
while vs:
cost += 1
v2s = []
for v in vs:
for v2 in adjList[v]:
if costs[v2] == -1:
costs[v2] = cost
v2s.append(v2)
vs = v2s
return cost - 1
return max([bfs(vSt) for vSt in range(numV)])
if not IsBipartiteGraph(adjL):
print((-1))
else:
maxDist = getDiameterOfUnweightedGraph(adjL)
print((maxDist + 1))
| false | 1.724138 | [
"-def WarshallFloyd(adjList):",
"+def getDiameterOfUnweightedGraph(adjList):",
"- D = [[float(\"inf\")] * numV for _ in range(numV)]",
"- for u, adj in enumerate(adjList):",
"- for v in adj:",
"- D[u][v] = 1",
"- D[u][u] = 0",
"- for k in range(numV):",
"- Dk = D[k]",
"- for i in range(numV):",
"- Di = D[i]",
"- Dik = Di[k]",
"- for j in range(numV):",
"- D2 = Dik + Dk[j]",
"- if D2 < Di[j]:",
"- D[i][j] = D2",
"- return D",
"+",
"+ def bfs(vSt):",
"+ costs = [-1] * numV",
"+ costs[vSt] = cost = 0",
"+ vs = [vSt]",
"+ while vs:",
"+ cost += 1",
"+ v2s = []",
"+ for v in vs:",
"+ for v2 in adjList[v]:",
"+ if costs[v2] == -1:",
"+ costs[v2] = cost",
"+ v2s.append(v2)",
"+ vs = v2s",
"+ return cost - 1",
"+",
"+ return max([bfs(vSt) for vSt in range(numV)])",
"- distss = WarshallFloyd(adjL)",
"- maxDist = max(list(map(max, distss)))",
"+ maxDist = getDiameterOfUnweightedGraph(adjL)"
] | false | 0.133438 | 0.085293 | 1.564477 | [
"s381653158",
"s969395071"
] |
u298633786 | p03012 | python | s052729980 | s876364751 | 323 | 154 | 21,536 | 12,744 | Accepted | Accepted | 52.32 | import numpy as np
num = int(eval(input()))
inputs = np.array(input().split(), dtype=np.int32)
left = 0
right = len(inputs)-1
diff = 0
while left <= right:
if diff == 0:
diff += inputs[left] - inputs[right]
left += 1
right -= 1
elif diff < 0:
diff += inputs[left]
left += 1
elif diff > 0:
diff -= inputs[right]
right -= 1
print((np.abs(diff))) | import numpy as np
N = int(eval(input()))
inputs = np.array(input().split(), dtype=np.uint8)
total = inputs.sum()
s1 = 0
diffs = []
for t in range(N):
s1 += inputs[t]
s2 = total - s1
diff = np.abs(s1-s2)
diffs.append(int(diff))
print((np.min(diffs))) | 22 | 16 | 428 | 277 | import numpy as np
num = int(eval(input()))
inputs = np.array(input().split(), dtype=np.int32)
left = 0
right = len(inputs) - 1
diff = 0
while left <= right:
if diff == 0:
diff += inputs[left] - inputs[right]
left += 1
right -= 1
elif diff < 0:
diff += inputs[left]
left += 1
elif diff > 0:
diff -= inputs[right]
right -= 1
print((np.abs(diff)))
| import numpy as np
N = int(eval(input()))
inputs = np.array(input().split(), dtype=np.uint8)
total = inputs.sum()
s1 = 0
diffs = []
for t in range(N):
s1 += inputs[t]
s2 = total - s1
diff = np.abs(s1 - s2)
diffs.append(int(diff))
print((np.min(diffs)))
| false | 27.272727 | [
"-num = int(eval(input()))",
"-inputs = np.array(input().split(), dtype=np.int32)",
"-left = 0",
"-right = len(inputs) - 1",
"-diff = 0",
"-while left <= right:",
"- if diff == 0:",
"- diff += inputs[left] - inputs[right]",
"- left += 1",
"- right -= 1",
"- elif diff < 0:",
"- diff += inputs[left]",
"- left += 1",
"- elif diff > 0:",
"- diff -= inputs[right]",
"- right -= 1",
"-print((np.abs(diff)))",
"+N = int(eval(input()))",
"+inputs = np.array(input().split(), dtype=np.uint8)",
"+total = inputs.sum()",
"+s1 = 0",
"+diffs = []",
"+for t in range(N):",
"+ s1 += inputs[t]",
"+ s2 = total - s1",
"+ diff = np.abs(s1 - s2)",
"+ diffs.append(int(diff))",
"+print((np.min(diffs)))"
] | false | 0.184499 | 0.181407 | 1.017044 | [
"s052729980",
"s876364751"
] |
u645250356 | p02838 | python | s821938578 | s077091170 | 843 | 218 | 119,980 | 124,184 | Accepted | Accepted | 74.14 | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions
from decimal import Decimal
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n = inp()
a = inpl()
a.sort()
lmx = len(bin(a[-1])) - 2
cnt = [[0,0] for _ in range(lmx)]
for i in a:
for j in range(lmx):
tt = 1 if (i>>j)&1 else 0
cnt[j][tt] += 1
res = 0
for i,bit in enumerate(cnt):
x,y = bit
res += x*y*pow(2,i)
res %= mod
print(res) | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n = inp()
a = inpl()
ln = len(bin(max(a))) -2
cnt = [0] * ln
for x in a:
for shift in range(ln):
cnt[shift] += (x>>shift)%2
# print(cnt)
res = 0
for i in range(ln):
now = cnt[i] * (n-cnt[i])
res += now*pow(2,i)
res %= mod
print(res)
| 26 | 25 | 646 | 628 | from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
import sys, bisect, math, itertools, fractions
from decimal import Decimal
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
INF = float("inf")
def inp():
return int(sys.stdin.readline())
def inpl():
return list(map(int, sys.stdin.readline().split()))
n = inp()
a = inpl()
a.sort()
lmx = len(bin(a[-1])) - 2
cnt = [[0, 0] for _ in range(lmx)]
for i in a:
for j in range(lmx):
tt = 1 if (i >> j) & 1 else 0
cnt[j][tt] += 1
res = 0
for i, bit in enumerate(cnt):
x, y = bit
res += x * y * pow(2, i)
res %= mod
print(res)
| from collections import Counter, defaultdict, deque
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
import sys, math, itertools, fractions, pprint
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
INF = float("inf")
def inp():
return int(sys.stdin.readline())
def inpl():
return list(map(int, sys.stdin.readline().split()))
n = inp()
a = inpl()
ln = len(bin(max(a))) - 2
cnt = [0] * ln
for x in a:
for shift in range(ln):
cnt[shift] += (x >> shift) % 2
# print(cnt)
res = 0
for i in range(ln):
now = cnt[i] * (n - cnt[i])
res += now * pow(2, i)
res %= mod
print(res)
| false | 3.846154 | [
"-from heapq import heappop, heappush, heapify",
"-import sys, bisect, math, itertools, fractions",
"-from decimal import Decimal",
"+from heapq import heappop, heappush",
"+from bisect import bisect_left, bisect_right",
"+import sys, math, itertools, fractions, pprint",
"-a.sort()",
"-lmx = len(bin(a[-1])) - 2",
"-cnt = [[0, 0] for _ in range(lmx)]",
"-for i in a:",
"- for j in range(lmx):",
"- tt = 1 if (i >> j) & 1 else 0",
"- cnt[j][tt] += 1",
"+ln = len(bin(max(a))) - 2",
"+cnt = [0] * ln",
"+for x in a:",
"+ for shift in range(ln):",
"+ cnt[shift] += (x >> shift) % 2",
"+# print(cnt)",
"-for i, bit in enumerate(cnt):",
"- x, y = bit",
"- res += x * y * pow(2, i)",
"+for i in range(ln):",
"+ now = cnt[i] * (n - cnt[i])",
"+ res += now * pow(2, i)"
] | false | 0.167508 | 0.127871 | 1.309977 | [
"s821938578",
"s077091170"
] |
u133936772 | p02598 | python | s719956788 | s603950979 | 764 | 576 | 31,076 | 30,656 | Accepted | Accepted | 24.61 | from math import *
f=lambda:[*list(map(int,input().split()))]
n,k=f()
a=f()
def ok(x):
c=0
for i in a:
c+=ceil(i/x)
return c<=n+k
l,r=0,10**9
while r-l>1:
m=(l+r)/2
if ok(m): r=m
else: l=m
t=ceil(r)
print((t-ok(t-1) if t>1 else t)) | f=lambda:[*list(map(int,input().split()))]
n,k=f()
a=f()
def ok(x):
c=0
for i in a:
c+=0--i//x
return c<=n+k
l,r=0,10**9
while r-l>1:
m=l+r>>1
if ok(m): r=m
else: l=m
print(r) | 16 | 14 | 254 | 198 | from math import *
f = lambda: [*list(map(int, input().split()))]
n, k = f()
a = f()
def ok(x):
c = 0
for i in a:
c += ceil(i / x)
return c <= n + k
l, r = 0, 10**9
while r - l > 1:
m = (l + r) / 2
if ok(m):
r = m
else:
l = m
t = ceil(r)
print((t - ok(t - 1) if t > 1 else t))
| f = lambda: [*list(map(int, input().split()))]
n, k = f()
a = f()
def ok(x):
c = 0
for i in a:
c += 0 - -i // x
return c <= n + k
l, r = 0, 10**9
while r - l > 1:
m = l + r >> 1
if ok(m):
r = m
else:
l = m
print(r)
| false | 12.5 | [
"-from math import *",
"-",
"- c += ceil(i / x)",
"+ c += 0 - -i // x",
"- m = (l + r) / 2",
"+ m = l + r >> 1",
"-t = ceil(r)",
"-print((t - ok(t - 1) if t > 1 else t))",
"+print(r)"
] | false | 0.043216 | 0.098969 | 0.436666 | [
"s719956788",
"s603950979"
] |
u707498674 | p03599 | python | s226947519 | s432046968 | 985 | 503 | 3,064 | 94,888 | Accepted | Accepted | 48.93 | import math
A,B,C,D,E,F = list(map(int, input().split()))
water = A
suger = 0
for a in range(31):
for b in range(31):
subwater = A * a + B * b
if subwater == 0:
continue
for c in range(1501):
subsuger = C * c
if subsuger <= subwater * E:
if F - subwater * 100 - subsuger > 0:
subsuger += D * min((F - subwater * 100 - subsuger) // D, (subwater * E - subsuger) // D)
if subsuger <= subwater * E and subwater * 100 + subsuger <= F and subsuger / (subwater * 100 + subsuger) > suger / (water * 100 + suger):
water = subwater
suger = subsuger
print(("{} {}".format(water * 100 + suger, suger))) | import math
import bisect
A,B,C,D,E,F = list(map(int, input().split()))
x = [A * a + B * b for b in range(31) for a in range(31)]
y = [C * c + D * d for d in range(1501) for c in range(1501)]
x.remove(0)
x = list(set(x))
y = list(set(y))
x.sort()
y.sort()
x = x[:bisect.bisect_right(x,F//100+1)]
y = y[:bisect.bisect_left(y,F)]
water = A
suger = 0
for i in x:
for j in y:
if j <= i * E and i * 100 + j <= F:
if j / (i * 100 + j) > suger / (water * 100 + suger):
water = i
suger = j
print(("{} {}".format(water * 100 + suger, suger))) | 18 | 23 | 759 | 605 | import math
A, B, C, D, E, F = list(map(int, input().split()))
water = A
suger = 0
for a in range(31):
for b in range(31):
subwater = A * a + B * b
if subwater == 0:
continue
for c in range(1501):
subsuger = C * c
if subsuger <= subwater * E:
if F - subwater * 100 - subsuger > 0:
subsuger += D * min(
(F - subwater * 100 - subsuger) // D,
(subwater * E - subsuger) // D,
)
if (
subsuger <= subwater * E
and subwater * 100 + subsuger <= F
and subsuger / (subwater * 100 + subsuger)
> suger / (water * 100 + suger)
):
water = subwater
suger = subsuger
print(("{} {}".format(water * 100 + suger, suger)))
| import math
import bisect
A, B, C, D, E, F = list(map(int, input().split()))
x = [A * a + B * b for b in range(31) for a in range(31)]
y = [C * c + D * d for d in range(1501) for c in range(1501)]
x.remove(0)
x = list(set(x))
y = list(set(y))
x.sort()
y.sort()
x = x[: bisect.bisect_right(x, F // 100 + 1)]
y = y[: bisect.bisect_left(y, F)]
water = A
suger = 0
for i in x:
for j in y:
if j <= i * E and i * 100 + j <= F:
if j / (i * 100 + j) > suger / (water * 100 + suger):
water = i
suger = j
print(("{} {}".format(water * 100 + suger, suger)))
| false | 21.73913 | [
"+import bisect",
"+x = [A * a + B * b for b in range(31) for a in range(31)]",
"+y = [C * c + D * d for d in range(1501) for c in range(1501)]",
"+x.remove(0)",
"+x = list(set(x))",
"+y = list(set(y))",
"+x.sort()",
"+y.sort()",
"+x = x[: bisect.bisect_right(x, F // 100 + 1)]",
"+y = y[: bisect.bisect_left(y, F)]",
"-for a in range(31):",
"- for b in range(31):",
"- subwater = A * a + B * b",
"- if subwater == 0:",
"- continue",
"- for c in range(1501):",
"- subsuger = C * c",
"- if subsuger <= subwater * E:",
"- if F - subwater * 100 - subsuger > 0:",
"- subsuger += D * min(",
"- (F - subwater * 100 - subsuger) // D,",
"- (subwater * E - subsuger) // D,",
"- )",
"- if (",
"- subsuger <= subwater * E",
"- and subwater * 100 + subsuger <= F",
"- and subsuger / (subwater * 100 + subsuger)",
"- > suger / (water * 100 + suger)",
"- ):",
"- water = subwater",
"- suger = subsuger",
"+for i in x:",
"+ for j in y:",
"+ if j <= i * E and i * 100 + j <= F:",
"+ if j / (i * 100 + j) > suger / (water * 100 + suger):",
"+ water = i",
"+ suger = j"
] | false | 2.510987 | 1.263896 | 1.986703 | [
"s226947519",
"s432046968"
] |
u297574184 | p02964 | python | s322844898 | s549977843 | 2,000 | 417 | 349,640 | 48,812 | Accepted | Accepted | 79.15 | def solve():
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
def getDistNexts(As):
lenA = len(As)
poss = dict()
for i, A in enumerate(As):
if A not in poss:
poss[A] = i + lenA
distNexts = [0]*(lenA)
for i in reversed(list(range(lenA))):
distNexts[i] = poss[As[i]] - i
poss[As[i]] = i
return distNexts
distNexts = getDistNexts(As)
NK = N*K
maxD = (NK).bit_length() - 1
dp = [[0]*(N) for _ in range(maxD+1)]
for i in range(N):
dp[0][i] = distNexts[i] + 1
for d in range(1, maxD+1):
for i in range(N):
i2 = i + dp[d-1][i]
dp[d][i] = i2 + dp[d-1][i2%N] - i
iNow = 0
dist = 0
for d in reversed(list(range(maxD+1))):
if dist+dp[d][iNow] < NK:
dist += dp[d][iNow]
iNow = dist%N
Ss = []
setS = set()
for A in As[iNow:]:
if A in setS:
S = ''
while S != A:
S = Ss.pop()
setS.remove(S)
else:
Ss.append(A)
setS.add(A)
if Ss:
print((' '.join(map(str, Ss))))
solve()
| N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
def getDistNexts(As):
lenA = len(As)
poss = dict()
for i, A in enumerate(As):
if A not in poss:
poss[A] = i + lenA
distNexts = [0]*(lenA)
for i in reversed(list(range(lenA))):
distNexts[i] = poss[As[i]] - i
poss[As[i]] = i
return distNexts
distNexts = getDistNexts(As)
NK = N*K
iNow = 0
dist = 0
hists = [-1] * N
hists[0] = 0
isSkipped = False
while dist + distNexts[iNow] + 1 < NK:
dist += distNexts[iNow] + 1
iNow = dist % N
if not isSkipped and hists[iNow] != -1:
period = dist - hists[iNow]
dist += (NK-1-dist) // period * period
isSkipped = True
hists[iNow] = dist
Ss = []
setS = set()
for A in As[iNow:]:
if A in setS:
S = ''
while S != A:
S = Ss.pop()
setS.remove(S)
else:
Ss.append(A)
setS.add(A)
if Ss:
print((' '.join(map(str, Ss))))
| 54 | 48 | 1,264 | 1,028 | def solve():
N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
def getDistNexts(As):
lenA = len(As)
poss = dict()
for i, A in enumerate(As):
if A not in poss:
poss[A] = i + lenA
distNexts = [0] * (lenA)
for i in reversed(list(range(lenA))):
distNexts[i] = poss[As[i]] - i
poss[As[i]] = i
return distNexts
distNexts = getDistNexts(As)
NK = N * K
maxD = (NK).bit_length() - 1
dp = [[0] * (N) for _ in range(maxD + 1)]
for i in range(N):
dp[0][i] = distNexts[i] + 1
for d in range(1, maxD + 1):
for i in range(N):
i2 = i + dp[d - 1][i]
dp[d][i] = i2 + dp[d - 1][i2 % N] - i
iNow = 0
dist = 0
for d in reversed(list(range(maxD + 1))):
if dist + dp[d][iNow] < NK:
dist += dp[d][iNow]
iNow = dist % N
Ss = []
setS = set()
for A in As[iNow:]:
if A in setS:
S = ""
while S != A:
S = Ss.pop()
setS.remove(S)
else:
Ss.append(A)
setS.add(A)
if Ss:
print((" ".join(map(str, Ss))))
solve()
| N, K = list(map(int, input().split()))
As = list(map(int, input().split()))
def getDistNexts(As):
lenA = len(As)
poss = dict()
for i, A in enumerate(As):
if A not in poss:
poss[A] = i + lenA
distNexts = [0] * (lenA)
for i in reversed(list(range(lenA))):
distNexts[i] = poss[As[i]] - i
poss[As[i]] = i
return distNexts
distNexts = getDistNexts(As)
NK = N * K
iNow = 0
dist = 0
hists = [-1] * N
hists[0] = 0
isSkipped = False
while dist + distNexts[iNow] + 1 < NK:
dist += distNexts[iNow] + 1
iNow = dist % N
if not isSkipped and hists[iNow] != -1:
period = dist - hists[iNow]
dist += (NK - 1 - dist) // period * period
isSkipped = True
hists[iNow] = dist
Ss = []
setS = set()
for A in As[iNow:]:
if A in setS:
S = ""
while S != A:
S = Ss.pop()
setS.remove(S)
else:
Ss.append(A)
setS.add(A)
if Ss:
print((" ".join(map(str, Ss))))
| false | 11.111111 | [
"-def solve():",
"- N, K = list(map(int, input().split()))",
"- As = list(map(int, input().split()))",
"-",
"- def getDistNexts(As):",
"- lenA = len(As)",
"- poss = dict()",
"- for i, A in enumerate(As):",
"- if A not in poss:",
"- poss[A] = i + lenA",
"- distNexts = [0] * (lenA)",
"- for i in reversed(list(range(lenA))):",
"- distNexts[i] = poss[As[i]] - i",
"- poss[As[i]] = i",
"- return distNexts",
"-",
"- distNexts = getDistNexts(As)",
"- NK = N * K",
"- maxD = (NK).bit_length() - 1",
"- dp = [[0] * (N) for _ in range(maxD + 1)]",
"- for i in range(N):",
"- dp[0][i] = distNexts[i] + 1",
"- for d in range(1, maxD + 1):",
"- for i in range(N):",
"- i2 = i + dp[d - 1][i]",
"- dp[d][i] = i2 + dp[d - 1][i2 % N] - i",
"- iNow = 0",
"- dist = 0",
"- for d in reversed(list(range(maxD + 1))):",
"- if dist + dp[d][iNow] < NK:",
"- dist += dp[d][iNow]",
"- iNow = dist % N",
"- Ss = []",
"- setS = set()",
"- for A in As[iNow:]:",
"- if A in setS:",
"- S = \"\"",
"- while S != A:",
"- S = Ss.pop()",
"- setS.remove(S)",
"- else:",
"- Ss.append(A)",
"- setS.add(A)",
"- if Ss:",
"- print((\" \".join(map(str, Ss))))",
"+N, K = list(map(int, input().split()))",
"+As = list(map(int, input().split()))",
"-solve()",
"+def getDistNexts(As):",
"+ lenA = len(As)",
"+ poss = dict()",
"+ for i, A in enumerate(As):",
"+ if A not in poss:",
"+ poss[A] = i + lenA",
"+ distNexts = [0] * (lenA)",
"+ for i in reversed(list(range(lenA))):",
"+ distNexts[i] = poss[As[i]] - i",
"+ poss[As[i]] = i",
"+ return distNexts",
"+",
"+",
"+distNexts = getDistNexts(As)",
"+NK = N * K",
"+iNow = 0",
"+dist = 0",
"+hists = [-1] * N",
"+hists[0] = 0",
"+isSkipped = False",
"+while dist + distNexts[iNow] + 1 < NK:",
"+ dist += distNexts[iNow] + 1",
"+ iNow = dist % N",
"+ if not isSkipped and hists[iNow] != -1:",
"+ period = dist - hists[iNow]",
"+ dist += (NK - 1 - dist) // period * period",
"+ isSkipped = True",
"+ hists[iNow] = dist",
"+Ss = []",
"+setS = set()",
"+for A in As[iNow:]:",
"+ if A in setS:",
"+ S = \"\"",
"+ while S != A:",
"+ S = Ss.pop()",
"+ setS.remove(S)",
"+ else:",
"+ Ss.append(A)",
"+ setS.add(A)",
"+if Ss:",
"+ print((\" \".join(map(str, Ss))))"
] | false | 0.08314 | 0.104934 | 0.792304 | [
"s322844898",
"s549977843"
] |
u285891772 | p03555 | python | s329167294 | s151613642 | 42 | 38 | 5,400 | 5,148 | Accepted | Accepted | 9.52 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def ZIP(n): return list(zip(*(MAP() for _ in range(n))))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
a = eval(input())
b = eval(input())
if a[0] == b[2] and a[1] == b[1] and a[2] == b[0]:
print("YES")
else:
print("NO")
| import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def ZIP(n): return list(zip(*(MAP() for _ in range(n))))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
a = eval(input())
b = eval(input())
print(("YES" if a == b[::-1] else "NO")) | 27 | 24 | 898 | 849 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input():
return sys.stdin.readline().strip()
def INT():
return int(eval(input()))
def MAP():
return list(map(int, input().split()))
def LIST():
return list(map(int, input().split()))
def ZIP(n):
return list(zip(*(MAP() for _ in range(n))))
sys.setrecursionlimit(10**9)
INF = float("inf")
mod = 10**9 + 7
a = eval(input())
b = eval(input())
if a[0] == b[2] and a[1] == b[1] and a[2] == b[0]:
print("YES")
else:
print("NO")
| import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input():
return sys.stdin.readline().strip()
def INT():
return int(eval(input()))
def MAP():
return list(map(int, input().split()))
def LIST():
return list(map(int, input().split()))
def ZIP(n):
return list(zip(*(MAP() for _ in range(n))))
sys.setrecursionlimit(10**9)
INF = float("inf")
mod = 10**9 + 7
a = eval(input())
b = eval(input())
print(("YES" if a == b[::-1] else "NO"))
| false | 11.111111 | [
"-if a[0] == b[2] and a[1] == b[1] and a[2] == b[0]:",
"- print(\"YES\")",
"-else:",
"- print(\"NO\")",
"+print((\"YES\" if a == b[::-1] else \"NO\"))"
] | false | 0.040256 | 0.044 | 0.91491 | [
"s329167294",
"s151613642"
] |
u793868662 | p02953 | python | s446362403 | s293881010 | 71 | 65 | 14,252 | 14,224 | Accepted | Accepted | 8.45 | def resolve():
n = int(eval(input()))
h = list(map(int, input().split()))
flag = 0
for i in range(n-1):
if h[i] == h[i+1]:
continue
else:
h[i+1] -= 1
if h[i] <= h[i+1]:
continue
else:
print("No")
exit()
print("Yes")
resolve() | def resolve():
n = int(eval(input()))
h = list(map(int, input().split()))
OK = True
for i in range(1, len(h)):
if h[i] == h[i-1]:
continue
elif h[i] > h[i-1]:
h[i] -= 1
else:
OK = False
break
if OK:
print("Yes")
else:
print("No")
resolve() | 16 | 17 | 366 | 361 | def resolve():
n = int(eval(input()))
h = list(map(int, input().split()))
flag = 0
for i in range(n - 1):
if h[i] == h[i + 1]:
continue
else:
h[i + 1] -= 1
if h[i] <= h[i + 1]:
continue
else:
print("No")
exit()
print("Yes")
resolve()
| def resolve():
n = int(eval(input()))
h = list(map(int, input().split()))
OK = True
for i in range(1, len(h)):
if h[i] == h[i - 1]:
continue
elif h[i] > h[i - 1]:
h[i] -= 1
else:
OK = False
break
if OK:
print("Yes")
else:
print("No")
resolve()
| false | 5.882353 | [
"- flag = 0",
"- for i in range(n - 1):",
"- if h[i] == h[i + 1]:",
"+ OK = True",
"+ for i in range(1, len(h)):",
"+ if h[i] == h[i - 1]:",
"+ elif h[i] > h[i - 1]:",
"+ h[i] -= 1",
"- h[i + 1] -= 1",
"- if h[i] <= h[i + 1]:",
"- continue",
"- else:",
"- print(\"No\")",
"- exit()",
"- print(\"Yes\")",
"+ OK = False",
"+ break",
"+ if OK:",
"+ print(\"Yes\")",
"+ else:",
"+ print(\"No\")"
] | false | 0.148678 | 0.073219 | 2.030587 | [
"s446362403",
"s293881010"
] |
u359358631 | p03157 | python | s946314403 | s747179347 | 194 | 179 | 108,620 | 108,692 | Accepted | Accepted | 7.73 | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1 for _ in range(n)] # 各要素の親 自分が根の場合は -1 * (木の要素数)
def root(self, x): # xが属する木の根を返す
if self.parents[x] < 0: # 自分が根の場合
return x
else:
self.parents[x] = self.root(self.parents[x])
return self.parents[x]
def merge(self, x, y): # xが属する木とyが属する木を合体する
x_root = self.root(x) # xの根
y_root = self.root(y) # yの根
if x_root == y_root: # 同じ木に属する
return
if self.parents[x_root] > self.parents[y_root]: # x_rootの要素数 > y_rootの要素数 にする
x_root, y_root = y_root, x_root
self.parents[x_root] += self.parents[y_root]
self.parents[y_root] = x_root
def main():
h, w = list(map(int, input().split()))
grid = [list(eval(input())) for _ in range(h)]
black_list = []
uf = UnionFind(h * w)
for r in range(h):
for c in range(w):
if grid[r][c] == "#":
black_list.append([r, c])
for dr, dc in [[0, 1], [1, 0]]:
nr = r + dr
nc = c + dc
if not (0 <= nr < h and 0 <= nc < w):
continue
if grid[r][c] != grid[nr][nc]:
uf.merge(r * w + c, nr * w + nc)
ans = 0
black_dict = dict()
for r, c in black_list:
z = uf.root(r * w + c)
if z in black_dict:
black_dict[z] += 1
else:
black_dict[z] = 1
for index, num in enumerate(uf.parents):
if num < 0:
if index not in black_dict:
continue
ans += black_dict[index] * (- num - black_dict[index])
print(ans)
if __name__ == "__main__":
main()
| class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1 for _ in range(n)] # 各要素の親 自分が根の場合は -1 * (木の要素数)
def root(self, x): # xが属する木の根を返す
if self.parents[x] < 0: # 自分が根の場合
return x
else:
self.parents[x] = self.root(self.parents[x])
return self.parents[x]
def merge(self, x, y): # xが属する木とyが属する木を合体する
x_root = self.root(x) # xの根
y_root = self.root(y) # yの根
if x_root == y_root: # 同じ木に属する
return
if self.parents[x_root] > self.parents[y_root]: # x_rootの要素数 > y_rootの要素数 にしたい
x_root, y_root = y_root, x_root
self.parents[x_root] += self.parents[y_root] # x_rootにy_rootを合体
self.parents[y_root] = x_root
def main():
h, w = list(map(int, input().split()))
grid = [list(eval(input())) for _ in range(h)]
black_list = []
uf = UnionFind(h * w)
for r in range(h):
for c in range(w):
if grid[r][c] == "#":
black_list.append([r, c])
for dr, dc in [[0, 1], [1, 0]]:
nr = r + dr
nc = c + dc
if not (0 <= nr < h and 0 <= nc < w):
continue
if grid[r][c] != grid[nr][nc]:
# 0 to h*w-1 に変換
uf.merge(r * w + c, nr * w + nc)
ans = 0
black_dict = dict()
for r, c in black_list: # それぞれの黒マスに対して
z = uf.root(r * w + c) # 根を求める
if z in black_dict: # それぞれの木に何個黒マスがあるか
black_dict[z] += 1
else:
black_dict[z] = 1
for index, size in enumerate(uf.parents):
if size < 0: # それぞれの木に対して
if index not in black_dict: # 黒マス0コは無視
continue
ans += black_dict[index] * (- size - black_dict[index]) # 黒マス x 白マス
print(ans)
if __name__ == "__main__":
main()
| 64 | 65 | 1,827 | 1,972 | class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1 for _ in range(n)] # 各要素の親 自分が根の場合は -1 * (木の要素数)
def root(self, x): # xが属する木の根を返す
if self.parents[x] < 0: # 自分が根の場合
return x
else:
self.parents[x] = self.root(self.parents[x])
return self.parents[x]
def merge(self, x, y): # xが属する木とyが属する木を合体する
x_root = self.root(x) # xの根
y_root = self.root(y) # yの根
if x_root == y_root: # 同じ木に属する
return
if self.parents[x_root] > self.parents[y_root]: # x_rootの要素数 > y_rootの要素数 にする
x_root, y_root = y_root, x_root
self.parents[x_root] += self.parents[y_root]
self.parents[y_root] = x_root
def main():
h, w = list(map(int, input().split()))
grid = [list(eval(input())) for _ in range(h)]
black_list = []
uf = UnionFind(h * w)
for r in range(h):
for c in range(w):
if grid[r][c] == "#":
black_list.append([r, c])
for dr, dc in [[0, 1], [1, 0]]:
nr = r + dr
nc = c + dc
if not (0 <= nr < h and 0 <= nc < w):
continue
if grid[r][c] != grid[nr][nc]:
uf.merge(r * w + c, nr * w + nc)
ans = 0
black_dict = dict()
for r, c in black_list:
z = uf.root(r * w + c)
if z in black_dict:
black_dict[z] += 1
else:
black_dict[z] = 1
for index, num in enumerate(uf.parents):
if num < 0:
if index not in black_dict:
continue
ans += black_dict[index] * (-num - black_dict[index])
print(ans)
if __name__ == "__main__":
main()
| class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1 for _ in range(n)] # 各要素の親 自分が根の場合は -1 * (木の要素数)
def root(self, x): # xが属する木の根を返す
if self.parents[x] < 0: # 自分が根の場合
return x
else:
self.parents[x] = self.root(self.parents[x])
return self.parents[x]
def merge(self, x, y): # xが属する木とyが属する木を合体する
x_root = self.root(x) # xの根
y_root = self.root(y) # yの根
if x_root == y_root: # 同じ木に属する
return
if self.parents[x_root] > self.parents[y_root]: # x_rootの要素数 > y_rootの要素数 にしたい
x_root, y_root = y_root, x_root
self.parents[x_root] += self.parents[y_root] # x_rootにy_rootを合体
self.parents[y_root] = x_root
def main():
h, w = list(map(int, input().split()))
grid = [list(eval(input())) for _ in range(h)]
black_list = []
uf = UnionFind(h * w)
for r in range(h):
for c in range(w):
if grid[r][c] == "#":
black_list.append([r, c])
for dr, dc in [[0, 1], [1, 0]]:
nr = r + dr
nc = c + dc
if not (0 <= nr < h and 0 <= nc < w):
continue
if grid[r][c] != grid[nr][nc]:
# 0 to h*w-1 に変換
uf.merge(r * w + c, nr * w + nc)
ans = 0
black_dict = dict()
for r, c in black_list: # それぞれの黒マスに対して
z = uf.root(r * w + c) # 根を求める
if z in black_dict: # それぞれの木に何個黒マスがあるか
black_dict[z] += 1
else:
black_dict[z] = 1
for index, size in enumerate(uf.parents):
if size < 0: # それぞれの木に対して
if index not in black_dict: # 黒マス0コは無視
continue
ans += black_dict[index] * (-size - black_dict[index]) # 黒マス x 白マス
print(ans)
if __name__ == "__main__":
main()
| false | 1.538462 | [
"- if self.parents[x_root] > self.parents[y_root]: # x_rootの要素数 > y_rootの要素数 にする",
"+ if self.parents[x_root] > self.parents[y_root]: # x_rootの要素数 > y_rootの要素数 にしたい",
"- self.parents[x_root] += self.parents[y_root]",
"+ self.parents[x_root] += self.parents[y_root] # x_rootにy_rootを合体",
"+ # 0 to h*w-1 に変換",
"- for r, c in black_list:",
"- z = uf.root(r * w + c)",
"- if z in black_dict:",
"+ for r, c in black_list: # それぞれの黒マスに対して",
"+ z = uf.root(r * w + c) # 根を求める",
"+ if z in black_dict: # それぞれの木に何個黒マスがあるか",
"- for index, num in enumerate(uf.parents):",
"- if num < 0:",
"- if index not in black_dict:",
"+ for index, size in enumerate(uf.parents):",
"+ if size < 0: # それぞれの木に対して",
"+ if index not in black_dict: # 黒マス0コは無視",
"- ans += black_dict[index] * (-num - black_dict[index])",
"+ ans += black_dict[index] * (-size - black_dict[index]) # 黒マス x 白マス"
] | false | 0.037071 | 0.036223 | 1.023418 | [
"s946314403",
"s747179347"
] |
u623814058 | p03862 | python | s143744224 | s690553925 | 103 | 93 | 19,960 | 19,996 | Accepted | Accepted | 9.71 | N,X=list(map(int,input().split()))
*A,=list(map(int,input().split()))
B=[a if a<=X else X for a in A]
c=sum(A)-sum(B)
for i in range(N-1):
t=B[i]+B[i+1]
if X < t:
d=t-X
B[i+1]-=d
c+=d
print(c) | f=lambda:list(map(int,input().split()))
N,X=f()
*A,=f()
B=[a if a<=X else X for a in A]
c=sum(A)-sum(B)
for i in range(N-1):
t=B[i]+B[i+1]
if X < t:
d=t-X
B[i+1]-=d
c+=d
print(c) | 12 | 13 | 206 | 199 | N, X = list(map(int, input().split()))
(*A,) = list(map(int, input().split()))
B = [a if a <= X else X for a in A]
c = sum(A) - sum(B)
for i in range(N - 1):
t = B[i] + B[i + 1]
if X < t:
d = t - X
B[i + 1] -= d
c += d
print(c)
| f = lambda: list(map(int, input().split()))
N, X = f()
(*A,) = f()
B = [a if a <= X else X for a in A]
c = sum(A) - sum(B)
for i in range(N - 1):
t = B[i] + B[i + 1]
if X < t:
d = t - X
B[i + 1] -= d
c += d
print(c)
| false | 7.692308 | [
"-N, X = list(map(int, input().split()))",
"-(*A,) = list(map(int, input().split()))",
"+f = lambda: list(map(int, input().split()))",
"+N, X = f()",
"+(*A,) = f()"
] | false | 0.038087 | 0.072457 | 0.525645 | [
"s143744224",
"s690553925"
] |
u678167152 | p02971 | python | s205216381 | s556836066 | 542 | 492 | 12,508 | 14,752 | Accepted | Accepted | 9.23 | N = int(eval(input()))
A = [0]*N
for i in range(N):
A[i] = int(eval(input()))
#print(A)
M = max(A)
ind = A.index(M)
#print(ind)
A.pop(ind)
m = max(A)
for i in range(N):
#print(i)
if i != ind:
print(M)
else:
print(m)
| def solve():
N = int(input())
A = [int(input()) for _ in range(N)]
B = sorted(A)
m = B[-1]
m2 = B[-2]
ans = []
for a in A:
if a!=m:
ans.append(m)
else:
ans.append(m2)
return ans
print(*solve(),sep='\n')
| 17 | 14 | 240 | 287 | N = int(eval(input()))
A = [0] * N
for i in range(N):
A[i] = int(eval(input()))
# print(A)
M = max(A)
ind = A.index(M)
# print(ind)
A.pop(ind)
m = max(A)
for i in range(N):
# print(i)
if i != ind:
print(M)
else:
print(m)
| def solve():
N = int(input())
A = [int(input()) for _ in range(N)]
B = sorted(A)
m = B[-1]
m2 = B[-2]
ans = []
for a in A:
if a != m:
ans.append(m)
else:
ans.append(m2)
return ans
print(*solve(), sep="\n")
| false | 17.647059 | [
"-N = int(eval(input()))",
"-A = [0] * N",
"-for i in range(N):",
"- A[i] = int(eval(input()))",
"-# print(A)",
"-M = max(A)",
"-ind = A.index(M)",
"-# print(ind)",
"-A.pop(ind)",
"-m = max(A)",
"-for i in range(N):",
"- # print(i)",
"- if i != ind:",
"- print(M)",
"- else:",
"- print(m)",
"+def solve():",
"+ N = int(input())",
"+ A = [int(input()) for _ in range(N)]",
"+ B = sorted(A)",
"+ m = B[-1]",
"+ m2 = B[-2]",
"+ ans = []",
"+ for a in A:",
"+ if a != m:",
"+ ans.append(m)",
"+ else:",
"+ ans.append(m2)",
"+ return ans",
"+",
"+",
"+print(*solve(), sep=\"\\n\")"
] | false | 0.008159 | 0.039595 | 0.20607 | [
"s205216381",
"s556836066"
] |
u328510800 | p03945 | python | s989384799 | s098085120 | 58 | 42 | 9,240 | 9,212 | Accepted | Accepted | 27.59 | s = eval(input())
min_value = 10 ** 9
# 左端に置く場合
pivot = s[0]
result = 0
for c in s:
if pivot != c:
pivot = c
result += 1
min_value = min(min_value, result)
# 右端に置く場合
result = 0
for c in reversed(s):
if pivot != c:
pivot = c
result += 1
min_value = min(min_value, result)
print(min_value) | s = eval(input())
pivot = s[0]
result = 0
for c in s:
if pivot != c:
pivot = c
result += 1
print(result) | 21 | 9 | 324 | 117 | s = eval(input())
min_value = 10**9
# 左端に置く場合
pivot = s[0]
result = 0
for c in s:
if pivot != c:
pivot = c
result += 1
min_value = min(min_value, result)
# 右端に置く場合
result = 0
for c in reversed(s):
if pivot != c:
pivot = c
result += 1
min_value = min(min_value, result)
print(min_value)
| s = eval(input())
pivot = s[0]
result = 0
for c in s:
if pivot != c:
pivot = c
result += 1
print(result)
| false | 57.142857 | [
"-min_value = 10**9",
"-# 左端に置く場合",
"-min_value = min(min_value, result)",
"-# 右端に置く場合",
"-result = 0",
"-for c in reversed(s):",
"- if pivot != c:",
"- pivot = c",
"- result += 1",
"-min_value = min(min_value, result)",
"-print(min_value)",
"+print(result)"
] | false | 0.070001 | 0.042225 | 1.65782 | [
"s989384799",
"s098085120"
] |
u597374218 | p03103 | python | s029028266 | s991607211 | 506 | 459 | 35,292 | 27,760 | Accepted | Accepted | 9.29 | N,M=list(map(int,input().split()))
AB=[list(map(int,input().split())) for i in range(N)]
AB.sort(key=lambda AB:(AB[0],AB[1]))
ans=0
count=0
for i in range(N):
count=M-AB[i][1]
if count>=0:
ans+=AB[i][0]*AB[i][1]
M=M-AB[i][1]
else:
ans+=AB[i][0]*M
break
print(ans) | N,M=list(map(int,input().split()))
AB=[list(map(int,input().split())) for i in range(N)]
AB.sort()
ans=0
count=0
for i in range(N):
count=M-AB[i][1]
if count>=0:
ans+=AB[i][0]*AB[i][1]
M=count
else:
ans+=AB[i][0]*M
break
print(ans) | 14 | 14 | 314 | 282 | N, M = list(map(int, input().split()))
AB = [list(map(int, input().split())) for i in range(N)]
AB.sort(key=lambda AB: (AB[0], AB[1]))
ans = 0
count = 0
for i in range(N):
count = M - AB[i][1]
if count >= 0:
ans += AB[i][0] * AB[i][1]
M = M - AB[i][1]
else:
ans += AB[i][0] * M
break
print(ans)
| N, M = list(map(int, input().split()))
AB = [list(map(int, input().split())) for i in range(N)]
AB.sort()
ans = 0
count = 0
for i in range(N):
count = M - AB[i][1]
if count >= 0:
ans += AB[i][0] * AB[i][1]
M = count
else:
ans += AB[i][0] * M
break
print(ans)
| false | 0 | [
"-AB.sort(key=lambda AB: (AB[0], AB[1]))",
"+AB.sort()",
"- M = M - AB[i][1]",
"+ M = count"
] | false | 0.047243 | 0.04899 | 0.964338 | [
"s029028266",
"s991607211"
] |
u724687935 | p02614 | python | s330214749 | s262155480 | 93 | 55 | 68,616 | 9,176 | Accepted | Accepted | 40.86 | from itertools import product
H, W, K = list(map(int, input().split()))
grid = [eval(input()) for _ in range(H)]
ans = 0
for a in product([0, 1], repeat=H):
for b in product([0, 1], repeat=W):
cnt = 0
for i in range(H):
if a[i] == 1:
continue
for j in range(W):
if b[j] == 1:
continue
if grid[i][j] == '#':
cnt += 1
if cnt == K:
ans += 1
print(ans)
| from itertools import product
H, W, K = list(map(int, input().split()))
grid = [eval(input()) for _ in range(H)]
ans = 0
for row in product([0, 1], repeat=H):
for col in product([0, 1], repeat=W):
cnt = 0
for i in range(H):
for j in range(W):
if row[i] == 0 and col[j] == 0 and grid[i][j] == '#':
cnt += 1
if cnt == K:
ans += 1
print(ans) | 21 | 17 | 512 | 433 | from itertools import product
H, W, K = list(map(int, input().split()))
grid = [eval(input()) for _ in range(H)]
ans = 0
for a in product([0, 1], repeat=H):
for b in product([0, 1], repeat=W):
cnt = 0
for i in range(H):
if a[i] == 1:
continue
for j in range(W):
if b[j] == 1:
continue
if grid[i][j] == "#":
cnt += 1
if cnt == K:
ans += 1
print(ans)
| from itertools import product
H, W, K = list(map(int, input().split()))
grid = [eval(input()) for _ in range(H)]
ans = 0
for row in product([0, 1], repeat=H):
for col in product([0, 1], repeat=W):
cnt = 0
for i in range(H):
for j in range(W):
if row[i] == 0 and col[j] == 0 and grid[i][j] == "#":
cnt += 1
if cnt == K:
ans += 1
print(ans)
| false | 19.047619 | [
"-for a in product([0, 1], repeat=H):",
"- for b in product([0, 1], repeat=W):",
"+for row in product([0, 1], repeat=H):",
"+ for col in product([0, 1], repeat=W):",
"- if a[i] == 1:",
"- continue",
"- if b[j] == 1:",
"- continue",
"- if grid[i][j] == \"#\":",
"+ if row[i] == 0 and col[j] == 0 and grid[i][j] == \"#\":"
] | false | 0.047419 | 0.079683 | 0.595096 | [
"s330214749",
"s262155480"
] |
u767797498 | p03785 | python | s415781314 | s234112070 | 223 | 138 | 13,308 | 19,908 | Accepted | Accepted | 38.12 | n,c,k=list(map(int,input().split()))
t=[int(eval(input())) for x in range(n)]
t.sort()
i=0
cnt=0
while i<n:
departure=t[i]+k
p=0
for j in range(i,n):
if t[j] > departure or p==c:
break
p+=1
i+=p
cnt+=1
print(cnt) | import sys
n,c,k,*t = list(map(int, sys.stdin.read().split()))
t.sort()
i=0
cnt=0
while i<n:
departure=t[i]+k
p=0
for j in range(i,n):
if t[j] > departure or p==c:
break
p+=1
i+=p
cnt+=1
print(cnt)
| 16 | 17 | 240 | 234 | n, c, k = list(map(int, input().split()))
t = [int(eval(input())) for x in range(n)]
t.sort()
i = 0
cnt = 0
while i < n:
departure = t[i] + k
p = 0
for j in range(i, n):
if t[j] > departure or p == c:
break
p += 1
i += p
cnt += 1
print(cnt)
| import sys
n, c, k, *t = list(map(int, sys.stdin.read().split()))
t.sort()
i = 0
cnt = 0
while i < n:
departure = t[i] + k
p = 0
for j in range(i, n):
if t[j] > departure or p == c:
break
p += 1
i += p
cnt += 1
print(cnt)
| false | 5.882353 | [
"-n, c, k = list(map(int, input().split()))",
"-t = [int(eval(input())) for x in range(n)]",
"+import sys",
"+",
"+n, c, k, *t = list(map(int, sys.stdin.read().split()))"
] | false | 0.0762 | 0.037289 | 2.043489 | [
"s415781314",
"s234112070"
] |
u934442292 | p03805 | python | s424714689 | s036563216 | 55 | 35 | 3,064 | 3,064 | Accepted | Accepted | 36.36 | import itertools
N, M = list(map(int, input().split()))
ab = [0] * M
for i in range(M):
ab[i] = list(map(int, input().split()))
perms = itertools.permutations(list(range(1, N+1)))
ans = 0
for perm in perms:
if perm[0] != 1:
continue
is_goal = True
for i in range(N-1):
a = perm[i]
b = perm[i+1]
if not a < b:
a, b = b, a
if not [a, b] in ab:
is_goal = False
if is_goal:
ans += 1
print(ans)
| # https://img.atcoder.jp/abc054/editorial.pdf
N, M = list(map(int, input().split()))
graph = [[False for _ in range(N)] for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
graph[a-1][b-1] = graph[b-1][a-1] = True
def dfs(v, visited):
all_visited = True
for i in range(N):
if not visited[i]:
all_visited = False
if all_visited:
return 1
ret = 0
for i in range(N):
if not graph[v][i]: continue
if visited[i]: continue
visited[i] = True
ret += dfs(i, visited)
visited[i] = False
return ret
visited = [False] * N
visited[0] = True
ans = dfs(0, visited)
print(ans)
| 24 | 33 | 450 | 677 | import itertools
N, M = list(map(int, input().split()))
ab = [0] * M
for i in range(M):
ab[i] = list(map(int, input().split()))
perms = itertools.permutations(list(range(1, N + 1)))
ans = 0
for perm in perms:
if perm[0] != 1:
continue
is_goal = True
for i in range(N - 1):
a = perm[i]
b = perm[i + 1]
if not a < b:
a, b = b, a
if not [a, b] in ab:
is_goal = False
if is_goal:
ans += 1
print(ans)
| # https://img.atcoder.jp/abc054/editorial.pdf
N, M = list(map(int, input().split()))
graph = [[False for _ in range(N)] for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
graph[a - 1][b - 1] = graph[b - 1][a - 1] = True
def dfs(v, visited):
all_visited = True
for i in range(N):
if not visited[i]:
all_visited = False
if all_visited:
return 1
ret = 0
for i in range(N):
if not graph[v][i]:
continue
if visited[i]:
continue
visited[i] = True
ret += dfs(i, visited)
visited[i] = False
return ret
visited = [False] * N
visited[0] = True
ans = dfs(0, visited)
print(ans)
| false | 27.272727 | [
"-import itertools",
"+# https://img.atcoder.jp/abc054/editorial.pdf",
"+N, M = list(map(int, input().split()))",
"+graph = [[False for _ in range(N)] for i in range(N)]",
"+for i in range(M):",
"+ a, b = list(map(int, input().split()))",
"+ graph[a - 1][b - 1] = graph[b - 1][a - 1] = True",
"-N, M = list(map(int, input().split()))",
"-ab = [0] * M",
"-for i in range(M):",
"- ab[i] = list(map(int, input().split()))",
"-perms = itertools.permutations(list(range(1, N + 1)))",
"-ans = 0",
"-for perm in perms:",
"- if perm[0] != 1:",
"- continue",
"- is_goal = True",
"- for i in range(N - 1):",
"- a = perm[i]",
"- b = perm[i + 1]",
"- if not a < b:",
"- a, b = b, a",
"- if not [a, b] in ab:",
"- is_goal = False",
"- if is_goal:",
"- ans += 1",
"+",
"+def dfs(v, visited):",
"+ all_visited = True",
"+ for i in range(N):",
"+ if not visited[i]:",
"+ all_visited = False",
"+ if all_visited:",
"+ return 1",
"+ ret = 0",
"+ for i in range(N):",
"+ if not graph[v][i]:",
"+ continue",
"+ if visited[i]:",
"+ continue",
"+ visited[i] = True",
"+ ret += dfs(i, visited)",
"+ visited[i] = False",
"+ return ret",
"+",
"+",
"+visited = [False] * N",
"+visited[0] = True",
"+ans = dfs(0, visited)"
] | false | 0.096849 | 0.042334 | 2.287715 | [
"s424714689",
"s036563216"
] |
u912237403 | p00074 | python | s649452364 | s107302699 | 20 | 10 | 4,216 | 4,212 | Accepted | Accepted | 50 | N=60
def f(t):
c,t=t%N,t/N
b,a=t%N,t/N
print("%02d:%02d:%02d"%(a,b,c))
return
t1=2*N*N
while 1:
h,m,s=list(map(int,input().split()))
if [h,m,s]==[-1,-1,-1]: break
t2=(h*N+m)*N+s
t=t1-t2
f(t)
f(t*3) | N=60
def f(t):
c,t=t%N,t/N
print("%02d:%02d:%02d"%(t/N,t%N,c))
return
while 1:
h,m,s=list(map(int,input().split()))
if [h,m,s]==[-1,-1,-1]: break
t=7200-(h*N+m)*N-s
f(t)
f(t*3) | 15 | 12 | 249 | 217 | N = 60
def f(t):
c, t = t % N, t / N
b, a = t % N, t / N
print("%02d:%02d:%02d" % (a, b, c))
return
t1 = 2 * N * N
while 1:
h, m, s = list(map(int, input().split()))
if [h, m, s] == [-1, -1, -1]:
break
t2 = (h * N + m) * N + s
t = t1 - t2
f(t)
f(t * 3)
| N = 60
def f(t):
c, t = t % N, t / N
print("%02d:%02d:%02d" % (t / N, t % N, c))
return
while 1:
h, m, s = list(map(int, input().split()))
if [h, m, s] == [-1, -1, -1]:
break
t = 7200 - (h * N + m) * N - s
f(t)
f(t * 3)
| false | 20 | [
"- b, a = t % N, t / N",
"- print(\"%02d:%02d:%02d\" % (a, b, c))",
"+ print(\"%02d:%02d:%02d\" % (t / N, t % N, c))",
"-t1 = 2 * N * N",
"- t2 = (h * N + m) * N + s",
"- t = t1 - t2",
"+ t = 7200 - (h * N + m) * N - s"
] | false | 0.04764 | 0.047196 | 1.009395 | [
"s649452364",
"s107302699"
] |
u352394527 | p00483 | python | s680370282 | s694891369 | 5,100 | 3,860 | 195,720 | 195,724 | Accepted | Accepted | 24.31 | m, n = list(map(int,input().split()))
k = int(eval(input()))
mp = [eval(input()) for i in range(m)]
dp = [[[0] * 3 for j in range(n + 1)] for i in range(m + 1)]
for i in range(1, m + 1):
for j in range(1, n + 1):
for p in range(3):
dp[i][j][p] = dp[i][j - 1][p] + dp[i - 1][j][p] - dp[i - 1][j - 1][p]
if mp[i - 1][j - 1] == "J":
dp[i][j][0] += 1
elif mp[i - 1][j - 1] == "O":
dp[i][j][1] += 1
else:
dp[i][j][2] += 1
# print(dp[i][j])
for i in range(k):
x1,y1,x2,y2 = list(map(int,input().split()))
print((dp[x2][y2][0] - dp[x1 - 1][y2][0] - dp[x2][y1 - 1][0] + dp[x1 - 1][y1 - 1][0], dp[x2][y2][1] - dp[x1 - 1][y2][1] - dp[x2][y1 - 1][1] + dp[x1 - 1][y1 - 1][1], dp[x2][y2][2] - dp[x1 - 1][y2][2] - dp[x2][y1 - 1][2] + dp[x1 - 1][y1 - 1][2]))
| def solve():
m, n = list(map(int,input().split()))
k = int(eval(input()))
mp = [eval(input()) for i in range(m)]
dp = [[[0] * 3 for j in range(n + 1)] for i in range(m + 1)]
for i in range(1, m + 1):
for j in range(1, n + 1):
for p in range(3):
dp[i][j][p] = dp[i][j - 1][p] + dp[i - 1][j][p] - dp[i - 1][j - 1][p]
if mp[i - 1][j - 1] == "J":
dp[i][j][0] += 1
elif mp[i - 1][j - 1] == "O":
dp[i][j][1] += 1
else:
dp[i][j][2] += 1
for i in range(k):
x1,y1,x2,y2 = list(map(int,input().split()))
print((dp[x2][y2][0] - dp[x1 - 1][y2][0] - dp[x2][y1 - 1][0] + dp[x1 - 1][y1 - 1][0], dp[x2][y2][1] - dp[x1 - 1][y2][1] - dp[x2][y1 - 1][1] + dp[x1 - 1][y1 - 1][1], dp[x2][y2][2] - dp[x1 - 1][y2][2] - dp[x2][y1 - 1][2] + dp[x1 - 1][y1 - 1][2]))
solve()
| 18 | 19 | 784 | 819 | m, n = list(map(int, input().split()))
k = int(eval(input()))
mp = [eval(input()) for i in range(m)]
dp = [[[0] * 3 for j in range(n + 1)] for i in range(m + 1)]
for i in range(1, m + 1):
for j in range(1, n + 1):
for p in range(3):
dp[i][j][p] = dp[i][j - 1][p] + dp[i - 1][j][p] - dp[i - 1][j - 1][p]
if mp[i - 1][j - 1] == "J":
dp[i][j][0] += 1
elif mp[i - 1][j - 1] == "O":
dp[i][j][1] += 1
else:
dp[i][j][2] += 1
# print(dp[i][j])
for i in range(k):
x1, y1, x2, y2 = list(map(int, input().split()))
print(
(
dp[x2][y2][0]
- dp[x1 - 1][y2][0]
- dp[x2][y1 - 1][0]
+ dp[x1 - 1][y1 - 1][0],
dp[x2][y2][1]
- dp[x1 - 1][y2][1]
- dp[x2][y1 - 1][1]
+ dp[x1 - 1][y1 - 1][1],
dp[x2][y2][2]
- dp[x1 - 1][y2][2]
- dp[x2][y1 - 1][2]
+ dp[x1 - 1][y1 - 1][2],
)
)
| def solve():
m, n = list(map(int, input().split()))
k = int(eval(input()))
mp = [eval(input()) for i in range(m)]
dp = [[[0] * 3 for j in range(n + 1)] for i in range(m + 1)]
for i in range(1, m + 1):
for j in range(1, n + 1):
for p in range(3):
dp[i][j][p] = dp[i][j - 1][p] + dp[i - 1][j][p] - dp[i - 1][j - 1][p]
if mp[i - 1][j - 1] == "J":
dp[i][j][0] += 1
elif mp[i - 1][j - 1] == "O":
dp[i][j][1] += 1
else:
dp[i][j][2] += 1
for i in range(k):
x1, y1, x2, y2 = list(map(int, input().split()))
print(
(
dp[x2][y2][0]
- dp[x1 - 1][y2][0]
- dp[x2][y1 - 1][0]
+ dp[x1 - 1][y1 - 1][0],
dp[x2][y2][1]
- dp[x1 - 1][y2][1]
- dp[x2][y1 - 1][1]
+ dp[x1 - 1][y1 - 1][1],
dp[x2][y2][2]
- dp[x1 - 1][y2][2]
- dp[x2][y1 - 1][2]
+ dp[x1 - 1][y1 - 1][2],
)
)
solve()
| false | 5.263158 | [
"-m, n = list(map(int, input().split()))",
"-k = int(eval(input()))",
"-mp = [eval(input()) for i in range(m)]",
"-dp = [[[0] * 3 for j in range(n + 1)] for i in range(m + 1)]",
"-for i in range(1, m + 1):",
"- for j in range(1, n + 1):",
"- for p in range(3):",
"- dp[i][j][p] = dp[i][j - 1][p] + dp[i - 1][j][p] - dp[i - 1][j - 1][p]",
"- if mp[i - 1][j - 1] == \"J\":",
"- dp[i][j][0] += 1",
"- elif mp[i - 1][j - 1] == \"O\":",
"- dp[i][j][1] += 1",
"- else:",
"- dp[i][j][2] += 1",
"-# print(dp[i][j])",
"-for i in range(k):",
"- x1, y1, x2, y2 = list(map(int, input().split()))",
"- print(",
"- (",
"- dp[x2][y2][0]",
"- - dp[x1 - 1][y2][0]",
"- - dp[x2][y1 - 1][0]",
"- + dp[x1 - 1][y1 - 1][0],",
"- dp[x2][y2][1]",
"- - dp[x1 - 1][y2][1]",
"- - dp[x2][y1 - 1][1]",
"- + dp[x1 - 1][y1 - 1][1],",
"- dp[x2][y2][2]",
"- - dp[x1 - 1][y2][2]",
"- - dp[x2][y1 - 1][2]",
"- + dp[x1 - 1][y1 - 1][2],",
"+def solve():",
"+ m, n = list(map(int, input().split()))",
"+ k = int(eval(input()))",
"+ mp = [eval(input()) for i in range(m)]",
"+ dp = [[[0] * 3 for j in range(n + 1)] for i in range(m + 1)]",
"+ for i in range(1, m + 1):",
"+ for j in range(1, n + 1):",
"+ for p in range(3):",
"+ dp[i][j][p] = dp[i][j - 1][p] + dp[i - 1][j][p] - dp[i - 1][j - 1][p]",
"+ if mp[i - 1][j - 1] == \"J\":",
"+ dp[i][j][0] += 1",
"+ elif mp[i - 1][j - 1] == \"O\":",
"+ dp[i][j][1] += 1",
"+ else:",
"+ dp[i][j][2] += 1",
"+ for i in range(k):",
"+ x1, y1, x2, y2 = list(map(int, input().split()))",
"+ print(",
"+ (",
"+ dp[x2][y2][0]",
"+ - dp[x1 - 1][y2][0]",
"+ - dp[x2][y1 - 1][0]",
"+ + dp[x1 - 1][y1 - 1][0],",
"+ dp[x2][y2][1]",
"+ - dp[x1 - 1][y2][1]",
"+ - dp[x2][y1 - 1][1]",
"+ + dp[x1 - 1][y1 - 1][1],",
"+ dp[x2][y2][2]",
"+ - dp[x1 - 1][y2][2]",
"+ - dp[x2][y1 - 1][2]",
"+ + dp[x1 - 1][y1 - 1][2],",
"+ )",
"- )",
"+",
"+",
"+solve()"
] | false | 0.104793 | 0.095479 | 1.097559 | [
"s680370282",
"s694891369"
] |
u968404618 | p02684 | python | s033933066 | s837770701 | 487 | 150 | 218,568 | 33,364 | Accepted | Accepted | 69.2 | n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
D = 60 #10**18は60桁なので2の59乗まで見る
MAX_N = 200005 #頂点番号
to = [[0 for _ in range(MAX_N)] for _ in range(D)]
#to[i][j]:jから2^i個先の頂点
for i in range(n):
to[0][i] = A[i]
to[0][i] -= 1
#ダブリングの表
for i in range(D-1):
for j in range(n):
to[i+1][j] = to[i][to[i][j]]
v = 0
for i in range(D-1, -1, -1):
l = 1<<i #2^i個先を見る
if l <= k:
v = to[i][v]
k -= l
print((v+1)) | def main():
## IMPORT MODULE
#import sys
#sys.setrecursionlimit(100000)
#input=lambda :sys.stdin.readline().rstrip()
#f_inf=float("inf")
#MOD=10**9+7
if 'get_ipython' in globals():
## SAMPLE INPUT
n, k = 4, 5
A = [3, 2, 4, 1]
else:
##INPUT
#n = input()
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
## SUBMITION CODES HERE
Town = []
rec = [-1] * (n+1) # The town we haven't visited yet is -1
idx = 1
# Loop to the cycle
while (rec[idx] == -1):
rec[idx] = len(Town)
Town.append(idx)
idx = A[idx-1]
# Pre-cycle
Exce = rec[idx]
# Intra-cycle
Cycl = len(Town) - Exce
if Exce > k:
print((Town[k]))
else:
Warp = (k - Exce) % Cycl
print((Town[Exce+Warp]))
main() | 25 | 44 | 489 | 824 | n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
D = 60 # 10**18は60桁なので2の59乗まで見る
MAX_N = 200005 # 頂点番号
to = [[0 for _ in range(MAX_N)] for _ in range(D)]
# to[i][j]:jから2^i個先の頂点
for i in range(n):
to[0][i] = A[i]
to[0][i] -= 1
# ダブリングの表
for i in range(D - 1):
for j in range(n):
to[i + 1][j] = to[i][to[i][j]]
v = 0
for i in range(D - 1, -1, -1):
l = 1 << i # 2^i個先を見る
if l <= k:
v = to[i][v]
k -= l
print((v + 1))
| def main():
## IMPORT MODULE
# import sys
# sys.setrecursionlimit(100000)
# input=lambda :sys.stdin.readline().rstrip()
# f_inf=float("inf")
# MOD=10**9+7
if "get_ipython" in globals():
## SAMPLE INPUT
n, k = 4, 5
A = [3, 2, 4, 1]
else:
##INPUT
# n = input()
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
## SUBMITION CODES HERE
Town = []
rec = [-1] * (n + 1) # The town we haven't visited yet is -1
idx = 1
# Loop to the cycle
while rec[idx] == -1:
rec[idx] = len(Town)
Town.append(idx)
idx = A[idx - 1]
# Pre-cycle
Exce = rec[idx]
# Intra-cycle
Cycl = len(Town) - Exce
if Exce > k:
print((Town[k]))
else:
Warp = (k - Exce) % Cycl
print((Town[Exce + Warp]))
main()
| false | 43.181818 | [
"-n, k = list(map(int, input().split()))",
"-A = list(map(int, input().split()))",
"-D = 60 # 10**18は60桁なので2の59乗まで見る",
"-MAX_N = 200005 # 頂点番号",
"-to = [[0 for _ in range(MAX_N)] for _ in range(D)]",
"-# to[i][j]:jから2^i個先の頂点",
"-for i in range(n):",
"- to[0][i] = A[i]",
"- to[0][i] -= 1",
"-# ダブリングの表",
"-for i in range(D - 1):",
"- for j in range(n):",
"- to[i + 1][j] = to[i][to[i][j]]",
"-v = 0",
"-for i in range(D - 1, -1, -1):",
"- l = 1 << i # 2^i個先を見る",
"- if l <= k:",
"- v = to[i][v]",
"- k -= l",
"-print((v + 1))",
"+def main():",
"+ ## IMPORT MODULE",
"+ # import sys",
"+ # sys.setrecursionlimit(100000)",
"+ # input=lambda :sys.stdin.readline().rstrip()",
"+ # f_inf=float(\"inf\")",
"+ # MOD=10**9+7",
"+ if \"get_ipython\" in globals():",
"+ ## SAMPLE INPUT",
"+ n, k = 4, 5",
"+ A = [3, 2, 4, 1]",
"+ else:",
"+ ##INPUT",
"+ # n = input()",
"+ n, k = list(map(int, input().split()))",
"+ A = list(map(int, input().split()))",
"+ ## SUBMITION CODES HERE",
"+ Town = []",
"+ rec = [-1] * (n + 1) # The town we haven't visited yet is -1",
"+ idx = 1",
"+ # Loop to the cycle",
"+ while rec[idx] == -1:",
"+ rec[idx] = len(Town)",
"+ Town.append(idx)",
"+ idx = A[idx - 1]",
"+ # Pre-cycle",
"+ Exce = rec[idx]",
"+ # Intra-cycle",
"+ Cycl = len(Town) - Exce",
"+ if Exce > k:",
"+ print((Town[k]))",
"+ else:",
"+ Warp = (k - Exce) % Cycl",
"+ print((Town[Exce + Warp]))",
"+",
"+",
"+main()"
] | false | 0.665514 | 0.03673 | 18.118978 | [
"s033933066",
"s837770701"
] |
u729972685 | p03166 | python | s760937979 | s800200073 | 733 | 427 | 116,444 | 67,164 | Accepted | Accepted | 41.75 | from sys import stdin, setrecursionlimit
from collections import defaultdict
input = stdin.readline
setrecursionlimit(200000)
N, M = list(map(int, input().split()))
# d = [0] * (N + 1)
adj = defaultdict(list)
for _ in range(M):
x, y = list(map(int, input().split()))
adj[x].append(y)
# d[y] += 1
dp = [-1] * (N + 1)
def lp(x: 'int') -> 'int':
if dp[x] >= 0:
return dp[x]
else:
dp[x] = 0
for y in adj[x]:
dp[x] = max(dp[x], lp(y) + 1)
return dp[x]
print((max(lp(i) for i in range(1, N + 1))))
| """
https://atcoder.jp/contests/dp/tasks/dp_g
Using list to store adjacent list is faster than using sets.
Maybe it is because the append operation of list in python is faster than add operation of sets.
Using defaultdict instead of list to store adj is faster. Maybe it is because in case the graph is
sparse, defauldict can save more query time.
"""
from sys import stdin
from collections import defaultdict, deque
input = stdin.readline
N, M = list(map(int, input().split()))
d = [0] * (N + 1)
adj = defaultdict(list)
for _ in range(M):
x, y = list(map(int, input().split()))
adj[x].append(y)
d[y] += 1
dp = [0] * (N + 1) # dp denotes longest path ends at i
Q = deque([i for i in range(1, N + 1) if d[i] == 0])
while Q:
cur = Q.popleft()
for nxt in adj[cur]:
dp[nxt] = max(dp[nxt], dp[cur] + 1)
d[nxt] -= 1
if d[nxt] == 0:
Q.append(nxt)
print((max(dp)))
| 26 | 32 | 572 | 936 | from sys import stdin, setrecursionlimit
from collections import defaultdict
input = stdin.readline
setrecursionlimit(200000)
N, M = list(map(int, input().split()))
# d = [0] * (N + 1)
adj = defaultdict(list)
for _ in range(M):
x, y = list(map(int, input().split()))
adj[x].append(y)
# d[y] += 1
dp = [-1] * (N + 1)
def lp(x: "int") -> "int":
if dp[x] >= 0:
return dp[x]
else:
dp[x] = 0
for y in adj[x]:
dp[x] = max(dp[x], lp(y) + 1)
return dp[x]
print((max(lp(i) for i in range(1, N + 1))))
| """
https://atcoder.jp/contests/dp/tasks/dp_g
Using list to store adjacent list is faster than using sets.
Maybe it is because the append operation of list in python is faster than add operation of sets.
Using defaultdict instead of list to store adj is faster. Maybe it is because in case the graph is
sparse, defauldict can save more query time.
"""
from sys import stdin
from collections import defaultdict, deque
input = stdin.readline
N, M = list(map(int, input().split()))
d = [0] * (N + 1)
adj = defaultdict(list)
for _ in range(M):
x, y = list(map(int, input().split()))
adj[x].append(y)
d[y] += 1
dp = [0] * (N + 1) # dp denotes longest path ends at i
Q = deque([i for i in range(1, N + 1) if d[i] == 0])
while Q:
cur = Q.popleft()
for nxt in adj[cur]:
dp[nxt] = max(dp[nxt], dp[cur] + 1)
d[nxt] -= 1
if d[nxt] == 0:
Q.append(nxt)
print((max(dp)))
| false | 18.75 | [
"-from sys import stdin, setrecursionlimit",
"-from collections import defaultdict",
"+\"\"\"",
"+https://atcoder.jp/contests/dp/tasks/dp_g",
"+Using list to store adjacent list is faster than using sets.",
"+Maybe it is because the append operation of list in python is faster than add operation of sets.",
"+Using defaultdict instead of list to store adj is faster. Maybe it is because in case the graph is",
"+sparse, defauldict can save more query time.",
"+\"\"\"",
"+from sys import stdin",
"+from collections import defaultdict, deque",
"-setrecursionlimit(200000)",
"-# d = [0] * (N + 1)",
"+d = [0] * (N + 1)",
"- # d[y] += 1",
"-dp = [-1] * (N + 1)",
"-",
"-",
"-def lp(x: \"int\") -> \"int\":",
"- if dp[x] >= 0:",
"- return dp[x]",
"- else:",
"- dp[x] = 0",
"- for y in adj[x]:",
"- dp[x] = max(dp[x], lp(y) + 1)",
"- return dp[x]",
"-",
"-",
"-print((max(lp(i) for i in range(1, N + 1))))",
"+ d[y] += 1",
"+dp = [0] * (N + 1) # dp denotes longest path ends at i",
"+Q = deque([i for i in range(1, N + 1) if d[i] == 0])",
"+while Q:",
"+ cur = Q.popleft()",
"+ for nxt in adj[cur]:",
"+ dp[nxt] = max(dp[nxt], dp[cur] + 1)",
"+ d[nxt] -= 1",
"+ if d[nxt] == 0:",
"+ Q.append(nxt)",
"+print((max(dp)))"
] | false | 0.062631 | 0.063991 | 0.978751 | [
"s760937979",
"s800200073"
] |
u512212329 | p02726 | python | s213753376 | s394127849 | 469 | 408 | 52,444 | 52,060 | Accepted | Accepted | 13.01 | from collections import deque
n, x, y = [int(x) for x in input().split()]
x -= 1
y -= 1
BIG = 65521
ans = {i: 0 for i in range(n)}
def bfs(start_v):
"""ある始点からほかの全点に行くまでの最短距離を求める。"""
qu = deque()
qu_append = qu.append
qu_popleft = qu.popleft
qu_append(start_v)
# 始点からvに移動するまでの最短距離: dist[v]
dist = [BIG] * n
def push(v, d):
"""始点からvまでの最短距離が算出されていないときに，その距離を保存し，
キューに頂点vを追加する。"""
if dist[v] != BIG:
# 既に訪問済みで距離が求められている。
return
dist[v] = d
qu_append(v)
push(start_v, 0)
while len(qu):
v = qu_popleft()
# 始点からvの次の頂点へ移動する距離。
d = dist[v] + 1
if v < n - 1:
push(v + 1, d)
if v > 0:
push(v - 1, d)
if v == x:
push(y, d)
if v == y:
push(x, d)
for i in range(n):
if dist[i] != 0:
ans[dist[i]] += 1
def main():
for i in range(n):
bfs(i)
for i in range(1, n):
print((ans[i] // 2))
if __name__ == '__main__':
main()
# TLE
| from collections import deque
n, x, y = [int(x) for x in input().split()]
x -= 1
y -= 1
BIG = 65521
ans = [0] * n
def bfs(start_v):
"""ある始点からほかの全点に行くまでの最短距離を求める。"""
qu = deque()
qu_append = qu.append
qu_popleft = qu.popleft
qu_append(start_v)
# 始点からvに移動するまでの最短距離: dist[v]
dist = [BIG] * n
def push(v, d):
"""始点からvまでの最短距離が算出されていないときに，その距離を保存し，
キューに頂点vを追加する。"""
if dist[v] != BIG:
# 既に訪問済みで距離が求められている。
return
dist[v] = d
qu_append(v)
push(start_v, 0)
while len(qu):
v = qu_popleft()
# 始点からvの次の頂点へ移動する距離。
d = dist[v] + 1
if v < n - 1:
push(v + 1, d)
if v > 0:
push(v - 1, d)
if v == x:
push(y, d)
if v == y:
push(x, d)
for i in range(n):
ans[dist[i]] += 1
def main():
for i in range(n):
bfs(i)
for i in range(1, n):
print((ans[i] // 2))
if __name__ == '__main__':
main()
| 59 | 56 | 1,137 | 1,081 | from collections import deque
n, x, y = [int(x) for x in input().split()]
x -= 1
y -= 1
BIG = 65521
ans = {i: 0 for i in range(n)}
def bfs(start_v):
"""ある始点からほかの全点に行くまでの最短距離を求める。"""
qu = deque()
qu_append = qu.append
qu_popleft = qu.popleft
qu_append(start_v)
# 始点からvに移動するまでの最短距離: dist[v]
dist = [BIG] * n
def push(v, d):
"""始点からvまでの最短距離が算出されていないときに，その距離を保存し，
キューに頂点vを追加する。"""
if dist[v] != BIG:
# 既に訪問済みで距離が求められている。
return
dist[v] = d
qu_append(v)
push(start_v, 0)
while len(qu):
v = qu_popleft()
# 始点からvの次の頂点へ移動する距離。
d = dist[v] + 1
if v < n - 1:
push(v + 1, d)
if v > 0:
push(v - 1, d)
if v == x:
push(y, d)
if v == y:
push(x, d)
for i in range(n):
if dist[i] != 0:
ans[dist[i]] += 1
def main():
for i in range(n):
bfs(i)
for i in range(1, n):
print((ans[i] // 2))
if __name__ == "__main__":
main()
# TLE
| from collections import deque
n, x, y = [int(x) for x in input().split()]
x -= 1
y -= 1
BIG = 65521
ans = [0] * n
def bfs(start_v):
"""ある始点からほかの全点に行くまでの最短距離を求める。"""
qu = deque()
qu_append = qu.append
qu_popleft = qu.popleft
qu_append(start_v)
# 始点からvに移動するまでの最短距離: dist[v]
dist = [BIG] * n
def push(v, d):
"""始点からvまでの最短距離が算出されていないときに，その距離を保存し，
キューに頂点vを追加する。"""
if dist[v] != BIG:
# 既に訪問済みで距離が求められている。
return
dist[v] = d
qu_append(v)
push(start_v, 0)
while len(qu):
v = qu_popleft()
# 始点からvの次の頂点へ移動する距離。
d = dist[v] + 1
if v < n - 1:
push(v + 1, d)
if v > 0:
push(v - 1, d)
if v == x:
push(y, d)
if v == y:
push(x, d)
for i in range(n):
ans[dist[i]] += 1
def main():
for i in range(n):
bfs(i)
for i in range(1, n):
print((ans[i] // 2))
if __name__ == "__main__":
main()
| false | 5.084746 | [
"-ans = {i: 0 for i in range(n)}",
"+ans = [0] * n",
"- if dist[i] != 0:",
"- ans[dist[i]] += 1",
"+ ans[dist[i]] += 1",
"-# TLE"
] | false | 0.037084 | 0.038204 | 0.970669 | [
"s213753376",
"s394127849"
] |
u150984829 | p02283 | python | s385943868 | s700441673 | 4,620 | 3,950 | 63,468 | 63,272 | Accepted | Accepted | 14.5 | # 04:58 sec 63276 KB 912 bytes
import sys
class Node:
__slots__ = ['key', 'left', 'right']
def __init__(self, key):
self.key = key
self.left = self.right = None
class BST:
def __init__(self):
self.root = None
def insert(self, key):
x, y, z = self.root, None, Node(key)
while x != None: x, y = x.left if z.key < x.key else x.right, x
if y == None: self.root = z
else:
if z.key < y.key: y.left = z
else: y.right = z
def print_tree(self):
def inorder(node):
return inorder(node.left) + f' {node.key}' + inorder(node.right) if node else ''
def preorder(node):
return f' {node.key}' + preorder(node.left) + preorder(node.right) if node else ''
print((inorder(self.root)))
print((preorder(self.root)))
tree = BST()
eval(input())
for e in sys.stdin:
if e[0] == 'i': tree.insert(int(e[7:]))
else: tree.print_tree()
| import sys
class Node:
__slots__ = ['key', 'left', 'right']
def __init__(self, key):
self.key = key
self.left = self.right = None
class BST:
def __init__(self):
self.root = None
def insert(self, key):
x, y = self.root, None
while x != None: x, y = x.left if key < x.key else x.right, x
if y == None: self.root = Node(key)
elif key < y.key: y.left = Node(key)
else: y.right = Node(key)
def print_tree(self):
def inorder(node):
return inorder(node.left) + f' {node.key}' + inorder(node.right) if node else ''
def preorder(node):
return f' {node.key}' + preorder(node.left) + preorder(node.right) if node else ''
print((inorder(self.root)))
print((preorder(self.root)))
tree = BST()
eval(input())
for e in sys.stdin:
if e[0] == 'i': tree.insert(int(e[7:]))
else: tree.print_tree()
| 32 | 30 | 1,002 | 948 | # 04:58 sec 63276 KB 912 bytes
import sys
class Node:
__slots__ = ["key", "left", "right"]
def __init__(self, key):
self.key = key
self.left = self.right = None
class BST:
def __init__(self):
self.root = None
def insert(self, key):
x, y, z = self.root, None, Node(key)
while x != None:
x, y = x.left if z.key < x.key else x.right, x
if y == None:
self.root = z
else:
if z.key < y.key:
y.left = z
else:
y.right = z
def print_tree(self):
def inorder(node):
return (
inorder(node.left) + f" {node.key}" + inorder(node.right)
if node
else ""
)
def preorder(node):
return (
f" {node.key}" + preorder(node.left) + preorder(node.right)
if node
else ""
)
print((inorder(self.root)))
print((preorder(self.root)))
tree = BST()
eval(input())
for e in sys.stdin:
if e[0] == "i":
tree.insert(int(e[7:]))
else:
tree.print_tree()
| import sys
class Node:
__slots__ = ["key", "left", "right"]
def __init__(self, key):
self.key = key
self.left = self.right = None
class BST:
def __init__(self):
self.root = None
def insert(self, key):
x, y = self.root, None
while x != None:
x, y = x.left if key < x.key else x.right, x
if y == None:
self.root = Node(key)
elif key < y.key:
y.left = Node(key)
else:
y.right = Node(key)
def print_tree(self):
def inorder(node):
return (
inorder(node.left) + f" {node.key}" + inorder(node.right)
if node
else ""
)
def preorder(node):
return (
f" {node.key}" + preorder(node.left) + preorder(node.right)
if node
else ""
)
print((inorder(self.root)))
print((preorder(self.root)))
tree = BST()
eval(input())
for e in sys.stdin:
if e[0] == "i":
tree.insert(int(e[7:]))
else:
tree.print_tree()
| false | 6.25 | [
"-# 04:58 sec 63276 KB 912 bytes",
"- x, y, z = self.root, None, Node(key)",
"+ x, y = self.root, None",
"- x, y = x.left if z.key < x.key else x.right, x",
"+ x, y = x.left if key < x.key else x.right, x",
"- self.root = z",
"+ self.root = Node(key)",
"+ elif key < y.key:",
"+ y.left = Node(key)",
"- if z.key < y.key:",
"- y.left = z",
"- else:",
"- y.right = z",
"+ y.right = Node(key)"
] | false | 0.045999 | 0.047075 | 0.977154 | [
"s385943868",
"s700441673"
] |
u077291787 | p02623 | python | s737536680 | s215786471 | 316 | 235 | 58,144 | 55,204 | Accepted | Accepted | 25.63 | # C - Tsundoku
from bisect import bisect
from itertools import accumulate
def main():
N, M, K, *AB = list(map(int, open(0).read().split()))
cum_A, cum_B = tuple(accumulate(AB[:N])), tuple(accumulate(AB[N:]))
candidates = []
for cum_x, cum_y in ((cum_A, cum_B), (cum_B, cum_A)):
for i, x_time in enumerate(cum_x, 1):
if x_time > K:
candidates.append(0)
break
y_time = K - x_time
candidates.append(i + bisect(cum_y, y_time))
print((max(candidates)))
if __name__ == "__main__":
main()
| # C - Tsundoku
from bisect import bisect
from itertools import accumulate
def main():
N, M, K, *AB = list(map(int, open(0).read().split()))
cum_A, cum_B = tuple(accumulate([0] + AB[:N])), tuple(accumulate(AB[N:]))
candidates = []
for i, a_time in enumerate(cum_A):
if a_time > K:
candidates.append(0)
break
b_time = K - a_time
candidates.append(i + bisect(cum_B, b_time))
print((max(candidates)))
if __name__ == "__main__":
main()
| 21 | 20 | 598 | 518 | # C - Tsundoku
from bisect import bisect
from itertools import accumulate
def main():
N, M, K, *AB = list(map(int, open(0).read().split()))
cum_A, cum_B = tuple(accumulate(AB[:N])), tuple(accumulate(AB[N:]))
candidates = []
for cum_x, cum_y in ((cum_A, cum_B), (cum_B, cum_A)):
for i, x_time in enumerate(cum_x, 1):
if x_time > K:
candidates.append(0)
break
y_time = K - x_time
candidates.append(i + bisect(cum_y, y_time))
print((max(candidates)))
if __name__ == "__main__":
main()
| # C - Tsundoku
from bisect import bisect
from itertools import accumulate
def main():
N, M, K, *AB = list(map(int, open(0).read().split()))
cum_A, cum_B = tuple(accumulate([0] + AB[:N])), tuple(accumulate(AB[N:]))
candidates = []
for i, a_time in enumerate(cum_A):
if a_time > K:
candidates.append(0)
break
b_time = K - a_time
candidates.append(i + bisect(cum_B, b_time))
print((max(candidates)))
if __name__ == "__main__":
main()
| false | 4.761905 | [
"- cum_A, cum_B = tuple(accumulate(AB[:N])), tuple(accumulate(AB[N:]))",
"+ cum_A, cum_B = tuple(accumulate([0] + AB[:N])), tuple(accumulate(AB[N:]))",
"- for cum_x, cum_y in ((cum_A, cum_B), (cum_B, cum_A)):",
"- for i, x_time in enumerate(cum_x, 1):",
"- if x_time > K:",
"- candidates.append(0)",
"- break",
"- y_time = K - x_time",
"- candidates.append(i + bisect(cum_y, y_time))",
"+ for i, a_time in enumerate(cum_A):",
"+ if a_time > K:",
"+ candidates.append(0)",
"+ break",
"+ b_time = K - a_time",
"+ candidates.append(i + bisect(cum_B, b_time))"
] | false | 0.036044 | 0.05945 | 0.606286 | [
"s737536680",
"s215786471"
] |
u392319141 | p03355 | python | s788847611 | s825533004 | 38 | 34 | 4,464 | 4,464 | Accepted | Accepted | 10.53 | S = eval(input())
N = len(S)
K = int(eval(input()))
A = set()
for i in range(N):
for j in range(i + 1, N + 1):
if j > i + K:
break
A.add(S[i:j])
A = list(A)
A.sort()
print((A[K - 1]))
| S = eval(input())
K = int(eval(input()))
A = set()
for leng in range(1, K + 1):
for i in range(len(S) - leng + 1):
A.add(S[i: i + leng])
A = list(A)
A.sort()
print((A[K - 1]))
| 14 | 11 | 217 | 186 | S = eval(input())
N = len(S)
K = int(eval(input()))
A = set()
for i in range(N):
for j in range(i + 1, N + 1):
if j > i + K:
break
A.add(S[i:j])
A = list(A)
A.sort()
print((A[K - 1]))
| S = eval(input())
K = int(eval(input()))
A = set()
for leng in range(1, K + 1):
for i in range(len(S) - leng + 1):
A.add(S[i : i + leng])
A = list(A)
A.sort()
print((A[K - 1]))
| false | 21.428571 | [
"-N = len(S)",
"-for i in range(N):",
"- for j in range(i + 1, N + 1):",
"- if j > i + K:",
"- break",
"- A.add(S[i:j])",
"+for leng in range(1, K + 1):",
"+ for i in range(len(S) - leng + 1):",
"+ A.add(S[i : i + leng])"
] | false | 0.085371 | 0.009239 | 9.239901 | [
"s788847611",
"s825533004"
] |
u426764965 | p02862 | python | s501359570 | s456217972 | 1,340 | 896 | 122,016 | 82,464 | Accepted | Accepted | 33.13 | # D - Knight
X, Y = list(map(int, input().split()))
####
a = (2*Y - X) / 3
b = (2*X - Y) / 3
# https://qiita.com/derodero24/items/91b6468e66923a87f39f
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] % mod * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
if a%1 != 0 or b%1 != 0:
print((0))
else:
ans = cmb(int(a+b), int(min(a,b)), mod)
print(ans)
| # D - Knight
X, Y = list(map(int, input().split()))
####
a = (2*Y - X) / 3
b = (2*X - Y) / 3
# https://qiita.com/derodero24/items/91b6468e66923a87f39f
# を一部修正
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] % mod * g2[n-r] % mod
mod = 10**9+7 #出力の制限
N = int(a+b)
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
if a%1 != 0 or b%1 != 0:
print((0))
else:
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
ans = cmb(int(a+b), int(min(a,b)), mod)
print(ans)
| 31 | 32 | 687 | 715 | # D - Knight
X, Y = list(map(int, input().split()))
####
a = (2 * Y - X) / 3
b = (2 * X - Y) / 3
# https://qiita.com/derodero24/items/91b6468e66923a87f39f
def cmb(n, r, mod):
if r < 0 or r > n:
return 0
r = min(r, n - r)
return g1[n] * g2[r] % mod * g2[n - r] % mod
mod = 10**9 + 7 # 出力の制限
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inverse = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, N + 1):
g1.append((g1[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod // i)) % mod)
g2.append((g2[-1] * inverse[-1]) % mod)
if a % 1 != 0 or b % 1 != 0:
print((0))
else:
ans = cmb(int(a + b), int(min(a, b)), mod)
print(ans)
| # D - Knight
X, Y = list(map(int, input().split()))
####
a = (2 * Y - X) / 3
b = (2 * X - Y) / 3
# https://qiita.com/derodero24/items/91b6468e66923a87f39f
# を一部修正
def cmb(n, r, mod):
if r < 0 or r > n:
return 0
r = min(r, n - r)
return g1[n] * g2[r] % mod * g2[n - r] % mod
mod = 10**9 + 7 # 出力の制限
N = int(a + b)
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inverse = [0, 1] # 逆元テーブル計算用テーブル
if a % 1 != 0 or b % 1 != 0:
print((0))
else:
for i in range(2, N + 1):
g1.append((g1[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod // i)) % mod)
g2.append((g2[-1] * inverse[-1]) % mod)
ans = cmb(int(a + b), int(min(a, b)), mod)
print(ans)
| false | 3.125 | [
"+# を一部修正",
"-N = 10**6",
"+N = int(a + b)",
"-for i in range(2, N + 1):",
"- g1.append((g1[-1] * i) % mod)",
"- inverse.append((-inverse[mod % i] * (mod // i)) % mod)",
"- g2.append((g2[-1] * inverse[-1]) % mod)",
"+ for i in range(2, N + 1):",
"+ g1.append((g1[-1] * i) % mod)",
"+ inverse.append((-inverse[mod % i] * (mod // i)) % mod)",
"+ g2.append((g2[-1] * inverse[-1]) % mod)"
] | false | 2.330114 | 0.418988 | 5.56129 | [
"s501359570",
"s456217972"
] |
u077291787 | p03221 | python | s907080916 | s445156938 | 588 | 391 | 62,516 | 30,564 | Accepted | Accepted | 33.5 | # ABC113C - ID
import sys
input = sys.stdin.readline
def main():
N, M = map(int, input().split())
P = tuple(map(int, input().split()) for _ in range(M))
A = sorted((p, y, i) for i, (p, y) in enumerate(P))
ans, cnt = [""] * M, 1
ans[A[0][2]] = "{:06}{:06}".format(A[0][0], cnt)
for i in range(1, M):
if A[i - 1][0] == A[i][0]:
cnt += 1
else:
cnt = 1
ans[A[i][2]] = "{:06}{:06}".format(A[i][0], cnt)
print(*ans, sep="\n")
if __name__ == "__main__":
main()
| # ABC113C - ID
import sys
input = sys.stdin.readline
def main():
N, M = map(int, input().split())
ans, A, cnt = [""] * M, [], 1
for i in range(M):
p, y = map(int, input().split())
A += [(p, y, i)]
A.sort()
ans[A[0][2]] = "{:06}{:06}".format(A[0][0], cnt)
prev = A[0][0]
for p, _, i in A[1:]:
if prev == p:
cnt += 1
else:
cnt = 1
ans[i] = "{:06}{:06}".format(p, cnt)
prev = p
print(*ans, sep="\n")
if __name__ == "__main__":
main()
| 21 | 25 | 556 | 565 | # ABC113C - ID
import sys
input = sys.stdin.readline
def main():
N, M = map(int, input().split())
P = tuple(map(int, input().split()) for _ in range(M))
A = sorted((p, y, i) for i, (p, y) in enumerate(P))
ans, cnt = [""] * M, 1
ans[A[0][2]] = "{:06}{:06}".format(A[0][0], cnt)
for i in range(1, M):
if A[i - 1][0] == A[i][0]:
cnt += 1
else:
cnt = 1
ans[A[i][2]] = "{:06}{:06}".format(A[i][0], cnt)
print(*ans, sep="\n")
if __name__ == "__main__":
main()
| # ABC113C - ID
import sys
input = sys.stdin.readline
def main():
N, M = map(int, input().split())
ans, A, cnt = [""] * M, [], 1
for i in range(M):
p, y = map(int, input().split())
A += [(p, y, i)]
A.sort()
ans[A[0][2]] = "{:06}{:06}".format(A[0][0], cnt)
prev = A[0][0]
for p, _, i in A[1:]:
if prev == p:
cnt += 1
else:
cnt = 1
ans[i] = "{:06}{:06}".format(p, cnt)
prev = p
print(*ans, sep="\n")
if __name__ == "__main__":
main()
| false | 16 | [
"- P = tuple(map(int, input().split()) for _ in range(M))",
"- A = sorted((p, y, i) for i, (p, y) in enumerate(P))",
"- ans, cnt = [\"\"] * M, 1",
"+ ans, A, cnt = [\"\"] * M, [], 1",
"+ for i in range(M):",
"+ p, y = map(int, input().split())",
"+ A += [(p, y, i)]",
"+ A.sort()",
"- for i in range(1, M):",
"- if A[i - 1][0] == A[i][0]:",
"+ prev = A[0][0]",
"+ for p, _, i in A[1:]:",
"+ if prev == p:",
"- ans[A[i][2]] = \"{:06}{:06}\".format(A[i][0], cnt)",
"+ ans[i] = \"{:06}{:06}\".format(p, cnt)",
"+ prev = p"
] | false | 0.036669 | 0.036086 | 1.016153 | [
"s907080916",
"s445156938"
] |
u437351386 | p03363 | python | s863473237 | s793445466 | 263 | 162 | 41,728 | 37,556 | Accepted | Accepted | 38.4 | from itertools import accumulate
from collections import Counter
n=int(eval(input()))
a=list(map(int,input().split()))
a=[0]+a
A=list(accumulate(a))
B=Counter(A)
ans=0
for i in B:
ans=ans+int((B[i]*(B[i]-1)/2))
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
from itertools import accumulate
from collections import Counter
a=[0]+list(accumulate(a))
a=Counter(a)
ans=0
for i in a:
ans=ans+a[i]*(a[i]-1)//2
print(ans)
| 11 | 10 | 227 | 217 | from itertools import accumulate
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
a = [0] + a
A = list(accumulate(a))
B = Counter(A)
ans = 0
for i in B:
ans = ans + int((B[i] * (B[i] - 1) / 2))
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
from itertools import accumulate
from collections import Counter
a = [0] + list(accumulate(a))
a = Counter(a)
ans = 0
for i in a:
ans = ans + a[i] * (a[i] - 1) // 2
print(ans)
| false | 9.090909 | [
"+n = int(eval(input()))",
"+a = list(map(int, input().split()))",
"-n = int(eval(input()))",
"-a = list(map(int, input().split()))",
"-a = [0] + a",
"-A = list(accumulate(a))",
"-B = Counter(A)",
"+a = [0] + list(accumulate(a))",
"+a = Counter(a)",
"-for i in B:",
"- ans = ans + int((B[i] * (B[i] - 1) / 2))",
"+for i in a:",
"+ ans = ans + a[i] * (a[i] - 1) // 2"
] | false | 0.036119 | 0.035804 | 1.008793 | [
"s863473237",
"s793445466"
] |
u621509943 | p03078 | python | s285195245 | s511265476 | 1,769 | 115 | 112,344 | 8,712 | Accepted | Accepted | 93.5 | x,y,z,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
a.sort(reverse = True)
b.sort(reverse = True)
c.sort(reverse = True)
h = []
for i in range(x):
for j in range(y):
if(i*j>k): break
for l in range(z):
if(i*j*l>k): break
h.append(a[i] + b[j] +c[l])
h.sort(reverse = True)
for i in range(k):
print((h[i])) | x,y,z,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
a.sort(reverse = True)
b.sort(reverse = True)
c.sort(reverse = True)
h = []
for i in range(x):
if(i + 1>k) : break
for j in range(y):
if((i + 1)*(j + 1)>k): break
for l in range(z):
if((i + 1)*(j + 1)*(l + 1)>k): break
h.append(a[i] + b[j] +c[l])
h.sort(reverse = True)
for i in range(k):
print((h[i])) | 17 | 18 | 454 | 509 | x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
h = []
for i in range(x):
for j in range(y):
if i * j > k:
break
for l in range(z):
if i * j * l > k:
break
h.append(a[i] + b[j] + c[l])
h.sort(reverse=True)
for i in range(k):
print((h[i]))
| x, y, z, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
h = []
for i in range(x):
if i + 1 > k:
break
for j in range(y):
if (i + 1) * (j + 1) > k:
break
for l in range(z):
if (i + 1) * (j + 1) * (l + 1) > k:
break
h.append(a[i] + b[j] + c[l])
h.sort(reverse=True)
for i in range(k):
print((h[i]))
| false | 5.555556 | [
"+ if i + 1 > k:",
"+ break",
"- if i * j > k:",
"+ if (i + 1) * (j + 1) > k:",
"- if i * j * l > k:",
"+ if (i + 1) * (j + 1) * (l + 1) > k:"
] | false | 0.034874 | 0.040074 | 0.870246 | [
"s285195245",
"s511265476"
] |
u312025627 | p03363 | python | s378855697 | s600169462 | 308 | 140 | 113,104 | 41,620 | Accepted | Accepted | 54.55 | def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
from itertools import accumulate
S = accumulate([0] + A)
from collections import Counter
c = Counter(S)
ans = 0
for v in list(c.values()):
if v > 1:
ans += v*(v-1)//2
print(ans)
if __name__ == '__main__':
main()
| def main():
from itertools import accumulate
from collections import Counter
N = int(eval(input()))
A = [int(i) for i in input().split()]
S = list(accumulate([0] + A))
# print(S)
c = Counter(S)
ans = 0
for v in list(c.values()):
ans += v*(v-1)//2
print(ans)
if __name__ == '__main__':
main()
| 16 | 16 | 350 | 349 | def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
from itertools import accumulate
S = accumulate([0] + A)
from collections import Counter
c = Counter(S)
ans = 0
for v in list(c.values()):
if v > 1:
ans += v * (v - 1) // 2
print(ans)
if __name__ == "__main__":
main()
| def main():
from itertools import accumulate
from collections import Counter
N = int(eval(input()))
A = [int(i) for i in input().split()]
S = list(accumulate([0] + A))
# print(S)
c = Counter(S)
ans = 0
for v in list(c.values()):
ans += v * (v - 1) // 2
print(ans)
if __name__ == "__main__":
main()
| false | 0 | [
"+ from itertools import accumulate",
"+ from collections import Counter",
"+",
"- from itertools import accumulate",
"-",
"- S = accumulate([0] + A)",
"- from collections import Counter",
"-",
"+ S = list(accumulate([0] + A))",
"+ # print(S)",
"- if v > 1:",
"- ans += v * (v - 1) // 2",
"+ ans += v * (v - 1) // 2"
] | false | 0.044633 | 0.067888 | 0.657452 | [
"s378855697",
"s600169462"
] |
u539367121 | p02949 | python | s569661464 | s559871446 | 1,808 | 302 | 11,836 | 40,444 | Accepted | Accepted | 83.3 | import sys
sys.setrecursionlimit(10**5)
def dfs(s):
for i in to[s]:
if not toflag[i]:
toflag[i]=True
dfs(i)
def rdfs(s):
for i in ot[s]:
if not otflag[i]:
otflag[i]=True
rdfs(i)
def bellman_ford():
for i in range(n):
upd=False
for a,b,c in edges:
if d[b]>d[a]+c:
upd=True
d[b]=d[a]+c
if not upd:
break
if i == n-1:
print((-1))
exit()
def main():
for i in range(m):
a,b,c=[int(x)-1 for x in input().split()]
edges.append([a,b,-(c+1-p)])
to[a].append(b)
ot[b].append(a)
toflag[0]=True
otflag[n-1]=True
dfs(0) # check for 0 to i path
rdfs(n-1) # check for n-1 to i path
for i in range(m):
a,b,c=edges[i]
if toflag[a] and otflag[a] and toflag[b] and otflag[b]: continue;
edges[i]=[0,0,0]
d[0]=0
bellman_ford()
print((max(0,-d[-1])))
if __name__=='__main__':
n,m,p=list(map(int,input().split()))
edges=[]
to=[[] for i in range(n)]
ot=[[] for i in range(n)]
toflag=[False]*n
otflag=[False]*n
d=[10**9]*n
main() | import sys
import numpy as np
from scipy.sparse.csgraph import bellman_ford, NegativeCycleError
from scipy.sparse import csr_matrix
sys.setrecursionlimit(10**5)
def dfs(s):
for u in to[s]:
if not toflag[u]:
toflag[u]=True
dfs(u)
def rdfs(s):
for u in ot[s]:
if not otflag[u]:
otflag[u]=True
rdfs(u)
def main():
for i in range(m):
a,b,c=[int(x)-1 for x in input().split()]
edges[i]=[a,b,-(c+1-p)]
to[a].append(b)
ot[b].append(a)
toflag[0]=True
otflag[-1]=True
dfs(0)
rdfs(n-1)
dic={}
for a,b,c in edges:
if toflag[a] and otflag[b]:
if (a,b) in list(dic.keys()):
dic[(a,b)]=min(dic[(a,b)],c)
else:
dic[(a,b)]=c
row=[]
col=[]
data=[]
for (a,b),c in list(dic.items()):
row.append(a)
col.append(b)
data.append(c)
g=csr_matrix((data,(row,col)), shape=(n,n))
try:
d=bellman_ford(g,indices=0).astype(int)
print((max(0,-d[-1])))
except NegativeCycleError:
print((-1))
if __name__=='__main__':
n,m,p=list(map(int,input().split()))
edges=[[] for i in range(m)]
to=[[] for i in range(n)]
ot=[[] for i in range(n)]
toflag=[False]*n
otflag=[False]*n
main() | 65 | 62 | 1,294 | 1,266 | import sys
sys.setrecursionlimit(10**5)
def dfs(s):
for i in to[s]:
if not toflag[i]:
toflag[i] = True
dfs(i)
def rdfs(s):
for i in ot[s]:
if not otflag[i]:
otflag[i] = True
rdfs(i)
def bellman_ford():
for i in range(n):
upd = False
for a, b, c in edges:
if d[b] > d[a] + c:
upd = True
d[b] = d[a] + c
if not upd:
break
if i == n - 1:
print((-1))
exit()
def main():
for i in range(m):
a, b, c = [int(x) - 1 for x in input().split()]
edges.append([a, b, -(c + 1 - p)])
to[a].append(b)
ot[b].append(a)
toflag[0] = True
otflag[n - 1] = True
dfs(0) # check for 0 to i path
rdfs(n - 1) # check for n-1 to i path
for i in range(m):
a, b, c = edges[i]
if toflag[a] and otflag[a] and toflag[b] and otflag[b]:
continue
edges[i] = [0, 0, 0]
d[0] = 0
bellman_ford()
print((max(0, -d[-1])))
if __name__ == "__main__":
n, m, p = list(map(int, input().split()))
edges = []
to = [[] for i in range(n)]
ot = [[] for i in range(n)]
toflag = [False] * n
otflag = [False] * n
d = [10**9] * n
main()
| import sys
import numpy as np
from scipy.sparse.csgraph import bellman_ford, NegativeCycleError
from scipy.sparse import csr_matrix
sys.setrecursionlimit(10**5)
def dfs(s):
for u in to[s]:
if not toflag[u]:
toflag[u] = True
dfs(u)
def rdfs(s):
for u in ot[s]:
if not otflag[u]:
otflag[u] = True
rdfs(u)
def main():
for i in range(m):
a, b, c = [int(x) - 1 for x in input().split()]
edges[i] = [a, b, -(c + 1 - p)]
to[a].append(b)
ot[b].append(a)
toflag[0] = True
otflag[-1] = True
dfs(0)
rdfs(n - 1)
dic = {}
for a, b, c in edges:
if toflag[a] and otflag[b]:
if (a, b) in list(dic.keys()):
dic[(a, b)] = min(dic[(a, b)], c)
else:
dic[(a, b)] = c
row = []
col = []
data = []
for (a, b), c in list(dic.items()):
row.append(a)
col.append(b)
data.append(c)
g = csr_matrix((data, (row, col)), shape=(n, n))
try:
d = bellman_ford(g, indices=0).astype(int)
print((max(0, -d[-1])))
except NegativeCycleError:
print((-1))
if __name__ == "__main__":
n, m, p = list(map(int, input().split()))
edges = [[] for i in range(m)]
to = [[] for i in range(n)]
ot = [[] for i in range(n)]
toflag = [False] * n
otflag = [False] * n
main()
| false | 4.615385 | [
"+import numpy as np",
"+from scipy.sparse.csgraph import bellman_ford, NegativeCycleError",
"+from scipy.sparse import csr_matrix",
"- for i in to[s]:",
"- if not toflag[i]:",
"- toflag[i] = True",
"- dfs(i)",
"+ for u in to[s]:",
"+ if not toflag[u]:",
"+ toflag[u] = True",
"+ dfs(u)",
"- for i in ot[s]:",
"- if not otflag[i]:",
"- otflag[i] = True",
"- rdfs(i)",
"-",
"-",
"-def bellman_ford():",
"- for i in range(n):",
"- upd = False",
"- for a, b, c in edges:",
"- if d[b] > d[a] + c:",
"- upd = True",
"- d[b] = d[a] + c",
"- if not upd:",
"- break",
"- if i == n - 1:",
"- print((-1))",
"- exit()",
"+ for u in ot[s]:",
"+ if not otflag[u]:",
"+ otflag[u] = True",
"+ rdfs(u)",
"- edges.append([a, b, -(c + 1 - p)])",
"+ edges[i] = [a, b, -(c + 1 - p)]",
"- otflag[n - 1] = True",
"- dfs(0) # check for 0 to i path",
"- rdfs(n - 1) # check for n-1 to i path",
"- for i in range(m):",
"- a, b, c = edges[i]",
"- if toflag[a] and otflag[a] and toflag[b] and otflag[b]:",
"- continue",
"- edges[i] = [0, 0, 0]",
"- d[0] = 0",
"- bellman_ford()",
"- print((max(0, -d[-1])))",
"+ otflag[-1] = True",
"+ dfs(0)",
"+ rdfs(n - 1)",
"+ dic = {}",
"+ for a, b, c in edges:",
"+ if toflag[a] and otflag[b]:",
"+ if (a, b) in list(dic.keys()):",
"+ dic[(a, b)] = min(dic[(a, b)], c)",
"+ else:",
"+ dic[(a, b)] = c",
"+ row = []",
"+ col = []",
"+ data = []",
"+ for (a, b), c in list(dic.items()):",
"+ row.append(a)",
"+ col.append(b)",
"+ data.append(c)",
"+ g = csr_matrix((data, (row, col)), shape=(n, n))",
"+ try:",
"+ d = bellman_ford(g, indices=0).astype(int)",
"+ print((max(0, -d[-1])))",
"+ except NegativeCycleError:",
"+ print((-1))",
"- edges = []",
"+ edges = [[] for i in range(m)]",
"- d = [10**9] * n"
] | false | 0.037185 | 0.296289 | 0.125501 | [
"s569661464",
"s559871446"
] |
u940139461 | p02873 | python | s948348097 | s427305934 | 225 | 205 | 50,888 | 46,536 | Accepted | Accepted | 8.89 | # https://atcoder.jp/contests/agc040/tasks/agc040_a
s = eval(input())
A = [0] * (len(s) + 1)
B = [0] * (len(s) + 1)
for i in range(len(s)):
if s[i] == '<':
A[i + 1] = A[i] + 1
for i in range(len(s))[::-1]:
if s[i] == '>':
B[i] = B[i + 1] + 1
ans = 0
for i in range(len(s) + 1):
ans += max(A[i], B[i])
print(ans) | s = eval(input())
c = 0
dp = [0] * (len(s) + 1)
for i in range(len(s)):
if s[i] == '<':
c += 1
dp[i + 1] = c
else:
c = 0
c = 0
for i in range(len(s))[::-1]:
if s[i] == '>':
c += 1
dp[i] = max(dp[i], c)
else:
c = 0
ans = sum(dp)
print(ans) | 16 | 19 | 350 | 315 | # https://atcoder.jp/contests/agc040/tasks/agc040_a
s = eval(input())
A = [0] * (len(s) + 1)
B = [0] * (len(s) + 1)
for i in range(len(s)):
if s[i] == "<":
A[i + 1] = A[i] + 1
for i in range(len(s))[::-1]:
if s[i] == ">":
B[i] = B[i + 1] + 1
ans = 0
for i in range(len(s) + 1):
ans += max(A[i], B[i])
print(ans)
| s = eval(input())
c = 0
dp = [0] * (len(s) + 1)
for i in range(len(s)):
if s[i] == "<":
c += 1
dp[i + 1] = c
else:
c = 0
c = 0
for i in range(len(s))[::-1]:
if s[i] == ">":
c += 1
dp[i] = max(dp[i], c)
else:
c = 0
ans = sum(dp)
print(ans)
| false | 15.789474 | [
"-# https://atcoder.jp/contests/agc040/tasks/agc040_a",
"-A = [0] * (len(s) + 1)",
"-B = [0] * (len(s) + 1)",
"+c = 0",
"+dp = [0] * (len(s) + 1)",
"- A[i + 1] = A[i] + 1",
"+ c += 1",
"+ dp[i + 1] = c",
"+ else:",
"+ c = 0",
"+c = 0",
"- B[i] = B[i + 1] + 1",
"-ans = 0",
"-for i in range(len(s) + 1):",
"- ans += max(A[i], B[i])",
"+ c += 1",
"+ dp[i] = max(dp[i], c)",
"+ else:",
"+ c = 0",
"+ans = sum(dp)"
] | false | 0.046801 | 0.042168 | 1.109883 | [
"s948348097",
"s427305934"
] |
u609061751 | p03945 | python | s389618859 | s164078452 | 48 | 43 | 3,956 | 3,188 | Accepted | Accepted | 10.42 | import sys
input = sys.stdin.readline
S = list(input().rstrip())
N = len(S)
cnt = 0
for i in range(N-1):
if S[i] != S[i+1]:
cnt += 1
print(cnt)
| import sys
input = sys.stdin.readline
s = input().rstrip()
cnt = 0
for i in range(len(s) - 1):
if s[i] != s[i + 1]:
cnt += 1
print(cnt)
| 10 | 9 | 169 | 157 | import sys
input = sys.stdin.readline
S = list(input().rstrip())
N = len(S)
cnt = 0
for i in range(N - 1):
if S[i] != S[i + 1]:
cnt += 1
print(cnt)
| import sys
input = sys.stdin.readline
s = input().rstrip()
cnt = 0
for i in range(len(s) - 1):
if s[i] != s[i + 1]:
cnt += 1
print(cnt)
| false | 10 | [
"-S = list(input().rstrip())",
"-N = len(S)",
"+s = input().rstrip()",
"-for i in range(N - 1):",
"- if S[i] != S[i + 1]:",
"+for i in range(len(s) - 1):",
"+ if s[i] != s[i + 1]:"
] | false | 0.062835 | 0.063332 | 0.99216 | [
"s389618859",
"s164078452"
] |
u583507988 | p03160 | python | s749177333 | s325075516 | 121 | 101 | 20,404 | 84,736 | Accepted | Accepted | 16.53 | n = int(eval(input()))
h = list(map(int, input().split()))
dp = [float('inf')] * n
dp[0] = 0
for i in range(1, n):
if i == 1:
dp[i] = dp[0] + abs(h[i]-h[i-1])
else:
dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]))
print((dp[n-1])) | n=int(eval(input()))
h=list(map(int,input().split()))
dp=[0]*n
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
dp[i]=min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]))
print((dp[n-1])) | 13 | 7 | 266 | 182 | n = int(eval(input()))
h = list(map(int, input().split()))
dp = [float("inf")] * n
dp[0] = 0
for i in range(1, n):
if i == 1:
dp[i] = dp[0] + abs(h[i] - h[i - 1])
else:
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[n - 1]))
| n = int(eval(input()))
h = list(map(int, input().split()))
dp = [0] * n
dp[1] = abs(h[1] - h[0])
for i in range(2, n):
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[n - 1]))
| false | 46.153846 | [
"-dp = [float(\"inf\")] * n",
"-dp[0] = 0",
"-for i in range(1, n):",
"- if i == 1:",
"- dp[i] = dp[0] + abs(h[i] - h[i - 1])",
"- else:",
"- dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]))",
"+dp = [0] * n",
"+dp[1] = abs(h[1] - h[0])",
"+for i in range(2, n):",
"+ dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]))"
] | false | 0.04005 | 0.045795 | 0.874564 | [
"s749177333",
"s325075516"
] |
u732061897 | p02573 | python | s072232638 | s780360434 | 1,093 | 718 | 87,996 | 36,000 | Accepted | Accepted | 34.31 | N, M = list(map(int, input().split()))
friends = {i: set([]) for i in range(N)}
for i in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
friends[a].add(b)
friends[b].add(a)
#print(friends)
from collections import deque
reached = [-1] * N
ans = 1
for i in range(N):
if reached[i] == -1:
queue = deque()
queue.append(i)
t = 1
reached[i] = 0
while len(queue) > 0:
v = queue.popleft()
for n in friends.get(v):
if reached[n] == -1:
reached[n] = 0
queue.append(n)
t += 1
ans = max(ans, t)
print(ans)
| N, M = list(map(int, input().split()))
t = [-1] * N
import sys
sys.setrecursionlimit(10 ** 6)
def find(e):
if t[e] < 0:
return e
else:
t[e] = find(t[e])
return t[e]
def unite(a, b):
a_root = find(a)
b_root = find(b)
if a_root == b_root:
return
t[a_root] += t[b_root]
t[b_root] = a_root
for i in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
unite(a, b)
def size(x):
x = find(x)
return -t[x]
ans = 0
for i in range(N):
ans = max(ans, size(i))
print(ans)
| 28 | 39 | 693 | 594 | N, M = list(map(int, input().split()))
friends = {i: set([]) for i in range(N)}
for i in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
friends[a].add(b)
friends[b].add(a)
# print(friends)
from collections import deque
reached = [-1] * N
ans = 1
for i in range(N):
if reached[i] == -1:
queue = deque()
queue.append(i)
t = 1
reached[i] = 0
while len(queue) > 0:
v = queue.popleft()
for n in friends.get(v):
if reached[n] == -1:
reached[n] = 0
queue.append(n)
t += 1
ans = max(ans, t)
print(ans)
| N, M = list(map(int, input().split()))
t = [-1] * N
import sys
sys.setrecursionlimit(10**6)
def find(e):
if t[e] < 0:
return e
else:
t[e] = find(t[e])
return t[e]
def unite(a, b):
a_root = find(a)
b_root = find(b)
if a_root == b_root:
return
t[a_root] += t[b_root]
t[b_root] = a_root
for i in range(M):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
unite(a, b)
def size(x):
x = find(x)
return -t[x]
ans = 0
for i in range(N):
ans = max(ans, size(i))
print(ans)
| false | 28.205128 | [
"-friends = {i: set([]) for i in range(N)}",
"+t = [-1] * N",
"+import sys",
"+",
"+sys.setrecursionlimit(10**6)",
"+",
"+",
"+def find(e):",
"+ if t[e] < 0:",
"+ return e",
"+ else:",
"+ t[e] = find(t[e])",
"+ return t[e]",
"+",
"+",
"+def unite(a, b):",
"+ a_root = find(a)",
"+ b_root = find(b)",
"+ if a_root == b_root:",
"+ return",
"+ t[a_root] += t[b_root]",
"+ t[b_root] = a_root",
"+",
"+",
"- friends[a].add(b)",
"- friends[b].add(a)",
"-# print(friends)",
"-from collections import deque",
"+ unite(a, b)",
"-reached = [-1] * N",
"-ans = 1",
"+",
"+def size(x):",
"+ x = find(x)",
"+ return -t[x]",
"+",
"+",
"+ans = 0",
"- if reached[i] == -1:",
"- queue = deque()",
"- queue.append(i)",
"- t = 1",
"- reached[i] = 0",
"- while len(queue) > 0:",
"- v = queue.popleft()",
"- for n in friends.get(v):",
"- if reached[n] == -1:",
"- reached[n] = 0",
"- queue.append(n)",
"- t += 1",
"- ans = max(ans, t)",
"+ ans = max(ans, size(i))"
] | false | 0.04041 | 0.042533 | 0.950078 | [
"s072232638",
"s780360434"
] |
u896741788 | p03497 | python | s012791246 | s550615956 | 212 | 101 | 39,348 | 32,572 | Accepted | Accepted | 52.36 | n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
from collections import Counter as co
var=co(l).most_common()
en=len(var)
ans=0
while en>k :
ans+=var[en-1][1]
en-=1
print(ans) | n,k=list(map(int,input().split()))
from collections import Counter as co
var=sorted(list(co(list(map(int,input().split()))).values()),reverse=1)
print((sum(var[k:])))
| 10 | 4 | 206 | 156 | n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
from collections import Counter as co
var = co(l).most_common()
en = len(var)
ans = 0
while en > k:
ans += var[en - 1][1]
en -= 1
print(ans)
| n, k = list(map(int, input().split()))
from collections import Counter as co
var = sorted(list(co(list(map(int, input().split()))).values()), reverse=1)
print((sum(var[k:])))
| false | 60 | [
"-l = list(map(int, input().split()))",
"-var = co(l).most_common()",
"-en = len(var)",
"-ans = 0",
"-while en > k:",
"- ans += var[en - 1][1]",
"- en -= 1",
"-print(ans)",
"+var = sorted(list(co(list(map(int, input().split()))).values()), reverse=1)",
"+print((sum(var[k:])))"
] | false | 0.089363 | 0.038175 | 2.340866 | [
"s012791246",
"s550615956"
] |
u982896977 | p03163 | python | s204602657 | s788383029 | 677 | 461 | 171,656 | 119,916 | Accepted | Accepted | 31.91 | N, W = list(map(int, input().split()))
w_list = []
v_list = []
for i in range(N):
w, v = list(map(int, input().split()))
w_list.append(w)
v_list.append(v)
dp = [[0 for i in range(W+1)] for i in range(N)]
for i in range(N):
w = w_list[i]
v = v_list[i]
for j in range(W+1):
if j-w >= 0:
dp[i][j] = max(dp[i-1][j], dp[i-1][j-w]+v)
else:
dp[i][j] = dp[i-1][j]
print((dp[N-1][W])) | N,W = list(map(int,input().split()))
w_list = []
v_list = []
for _ in range(N):
w,v = list(map(int,input().split()))
w_list.append(w)
v_list.append(v)
dp = [[0]*(W+1) for i in range(N+1)]
for i in range(1,N+1):
w = w_list[i-1]
v = v_list[i-1]
for j in range(1,W+1):
if j-w >= 0:
dp[i][j] = max(dp[i-1][j],dp[i-1][j-w]+v)
else:
dp[i][j] = dp[i-1][j]
print((dp[N][W])) | 17 | 17 | 441 | 432 | N, W = list(map(int, input().split()))
w_list = []
v_list = []
for i in range(N):
w, v = list(map(int, input().split()))
w_list.append(w)
v_list.append(v)
dp = [[0 for i in range(W + 1)] for i in range(N)]
for i in range(N):
w = w_list[i]
v = v_list[i]
for j in range(W + 1):
if j - w >= 0:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w] + v)
else:
dp[i][j] = dp[i - 1][j]
print((dp[N - 1][W]))
| N, W = list(map(int, input().split()))
w_list = []
v_list = []
for _ in range(N):
w, v = list(map(int, input().split()))
w_list.append(w)
v_list.append(v)
dp = [[0] * (W + 1) for i in range(N + 1)]
for i in range(1, N + 1):
w = w_list[i - 1]
v = v_list[i - 1]
for j in range(1, W + 1):
if j - w >= 0:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w] + v)
else:
dp[i][j] = dp[i - 1][j]
print((dp[N][W]))
| false | 0 | [
"-for i in range(N):",
"+for _ in range(N):",
"-dp = [[0 for i in range(W + 1)] for i in range(N)]",
"-for i in range(N):",
"- w = w_list[i]",
"- v = v_list[i]",
"- for j in range(W + 1):",
"+dp = [[0] * (W + 1) for i in range(N + 1)]",
"+for i in range(1, N + 1):",
"+ w = w_list[i - 1]",
"+ v = v_list[i - 1]",
"+ for j in range(1, W + 1):",
"-print((dp[N - 1][W]))",
"+print((dp[N][W]))"
] | false | 0.042343 | 0.122588 | 0.345412 | [
"s204602657",
"s788383029"
] |
u623349537 | p03005 | python | s778181805 | s660027758 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | N, K = list(map(int, input().split()))
if K == 1:
print((0))
else:
print((N - K + 1 - 1)) | N, K = list(map(int, input().split()))
if K == 1:
print((0))
else:
print((N - K)) | 5 | 5 | 91 | 83 | N, K = list(map(int, input().split()))
if K == 1:
print((0))
else:
print((N - K + 1 - 1))
| N, K = list(map(int, input().split()))
if K == 1:
print((0))
else:
print((N - K))
| false | 0 | [
"- print((N - K + 1 - 1))",
"+ print((N - K))"
] | false | 0.04549 | 0.045937 | 0.990267 | [
"s778181805",
"s660027758"
] |
u349449706 | p03804 | python | s632990822 | s938533807 | 77 | 71 | 74,160 | 70,320 | Accepted | Accepted | 7.79 | N, M = list(map(int, input().split()))
A = [list(eval(input())) for _ in range(N)]
B = [list(eval(input())) for _ in range(M)]
for i in range(N-M+1):
for j in range(N-M+1):
c = 1
for k in range(M):
if A[i+k][j:j+M] != B[k]:
c = 0
if c:
print('Yes')
exit()
print('No')
| N,M = list(map(int,input().split()))
A=[eval(input())for _ in range(N)]
B=[eval(input())for _ in range(M)]
print(('Yes'if any([A[i+k][j:j+M]for k in range(M)]==B for i in range(N-M+1)for j in range(N-M+1)) else'No'))
| 13 | 4 | 342 | 200 | N, M = list(map(int, input().split()))
A = [list(eval(input())) for _ in range(N)]
B = [list(eval(input())) for _ in range(M)]
for i in range(N - M + 1):
for j in range(N - M + 1):
c = 1
for k in range(M):
if A[i + k][j : j + M] != B[k]:
c = 0
if c:
print("Yes")
exit()
print("No")
| N, M = list(map(int, input().split()))
A = [eval(input()) for _ in range(N)]
B = [eval(input()) for _ in range(M)]
print(
(
"Yes"
if any(
[A[i + k][j : j + M] for k in range(M)] == B
for i in range(N - M + 1)
for j in range(N - M + 1)
)
else "No"
)
)
| false | 69.230769 | [
"-A = [list(eval(input())) for _ in range(N)]",
"-B = [list(eval(input())) for _ in range(M)]",
"-for i in range(N - M + 1):",
"- for j in range(N - M + 1):",
"- c = 1",
"- for k in range(M):",
"- if A[i + k][j : j + M] != B[k]:",
"- c = 0",
"- if c:",
"- print(\"Yes\")",
"- exit()",
"-print(\"No\")",
"+A = [eval(input()) for _ in range(N)]",
"+B = [eval(input()) for _ in range(M)]",
"+print(",
"+ (",
"+ \"Yes\"",
"+ if any(",
"+ [A[i + k][j : j + M] for k in range(M)] == B",
"+ for i in range(N - M + 1)",
"+ for j in range(N - M + 1)",
"+ )",
"+ else \"No\"",
"+ )",
"+)"
] | false | 0.069714 | 0.037201 | 1.873969 | [
"s632990822",
"s938533807"
] |
u761320129 | p03043 | python | s744704052 | s665032070 | 41 | 34 | 3,188 | 3,188 | Accepted | Accepted | 17.07 | from math import log2,ceil
N,K = list(map(int,input().split()))
r = [0.5]
for i in range(50):
r.append(r[-1] / 2)
ans = 0
for n in range(1,N+1):
if n > K-1:
ans += 1
continue
c = ceil(log2(K/n))
ans += r[c-1]
print((ans/N)) | N,K = list(map(int,input().split()))
ans = 0
for n in range(1,N+1):
if n >= K:
ans += 1
continue
k = 0
m = n
while m < K:
m *= 2
k += 1
ans += 2**-k
print((ans/N)) | 15 | 13 | 263 | 219 | from math import log2, ceil
N, K = list(map(int, input().split()))
r = [0.5]
for i in range(50):
r.append(r[-1] / 2)
ans = 0
for n in range(1, N + 1):
if n > K - 1:
ans += 1
continue
c = ceil(log2(K / n))
ans += r[c - 1]
print((ans / N))
| N, K = list(map(int, input().split()))
ans = 0
for n in range(1, N + 1):
if n >= K:
ans += 1
continue
k = 0
m = n
while m < K:
m *= 2
k += 1
ans += 2**-k
print((ans / N))
| false | 13.333333 | [
"-from math import log2, ceil",
"-",
"-r = [0.5]",
"-for i in range(50):",
"- r.append(r[-1] / 2)",
"- if n > K - 1:",
"+ if n >= K:",
"- c = ceil(log2(K / n))",
"- ans += r[c - 1]",
"+ k = 0",
"+ m = n",
"+ while m < K:",
"+ m *= 2",
"+ k += 1",
"+ ans += 2**-k"
] | false | 0.058896 | 0.048526 | 1.213702 | [
"s744704052",
"s665032070"
] |
u633068244 | p00070 | python | s615646264 | s364720985 | 4,300 | 3,800 | 4,268 | 4,260 | Accepted | Accepted | 11.63 | def mx(ls,m):
global n
sum = 0
for i in range(m):
sum += (n-i)*ls[-i-1]
return sum
def mn(ls,m):
global n
sum = 0
for i in range(m):
sum += (n-i)*ls[i]
return sum
def f(ls,m,s):
global n
count = 0
if m > 0:
vmx,vmn = mx(ls,m),mn(ls,m)
if vmx < s or vmn > s: return 0
elif vmx == s or vmn == s: return 1
for i in range(len(ls)):
lls = ls[:]
a = (n-m+1)*lls.pop(i)
if s-a < 0: break
else: count += f(lls,m-1,s-a)
return count
else:
return 1 if s == 0 else 0
ls = [i for i in range(10)]
while True:
try:
n,s = list(map(int, input().split()))
print(f(ls,n,s))
except:
break | def mxmn(ls,m):
global n
s1,s2 = 0, 0
for i in range(m):
s1 += (n-i)*ls[-i-1]
s2 += (n-i)*ls[i]
return s1,s2
def f(ls,m,s):
global n
count = 0
if m > 0:
mx,mn = mxmn(ls,m)
if mx < s or mn > s: return 0
elif mx == s or mn == s: return 1
for i in range(len(ls)):
lls = ls[:]
a = (n-m+1)*lls.pop(i)
if s-a < 0: break
else: count += f(lls,m-1,s-a)
return count
else:
return 1 if s == 0 else 0
ls = [i for i in range(10)]
while True:
try:
n,s = list(map(int, input().split()))
print(f(ls,n,s))
except:
break | 37 | 31 | 657 | 578 | def mx(ls, m):
global n
sum = 0
for i in range(m):
sum += (n - i) * ls[-i - 1]
return sum
def mn(ls, m):
global n
sum = 0
for i in range(m):
sum += (n - i) * ls[i]
return sum
def f(ls, m, s):
global n
count = 0
if m > 0:
vmx, vmn = mx(ls, m), mn(ls, m)
if vmx < s or vmn > s:
return 0
elif vmx == s or vmn == s:
return 1
for i in range(len(ls)):
lls = ls[:]
a = (n - m + 1) * lls.pop(i)
if s - a < 0:
break
else:
count += f(lls, m - 1, s - a)
return count
else:
return 1 if s == 0 else 0
ls = [i for i in range(10)]
while True:
try:
n, s = list(map(int, input().split()))
print(f(ls, n, s))
except:
break
| def mxmn(ls, m):
global n
s1, s2 = 0, 0
for i in range(m):
s1 += (n - i) * ls[-i - 1]
s2 += (n - i) * ls[i]
return s1, s2
def f(ls, m, s):
global n
count = 0
if m > 0:
mx, mn = mxmn(ls, m)
if mx < s or mn > s:
return 0
elif mx == s or mn == s:
return 1
for i in range(len(ls)):
lls = ls[:]
a = (n - m + 1) * lls.pop(i)
if s - a < 0:
break
else:
count += f(lls, m - 1, s - a)
return count
else:
return 1 if s == 0 else 0
ls = [i for i in range(10)]
while True:
try:
n, s = list(map(int, input().split()))
print(f(ls, n, s))
except:
break
| false | 16.216216 | [
"-def mx(ls, m):",
"+def mxmn(ls, m):",
"- sum = 0",
"+ s1, s2 = 0, 0",
"- sum += (n - i) * ls[-i - 1]",
"- return sum",
"-",
"-",
"-def mn(ls, m):",
"- global n",
"- sum = 0",
"- for i in range(m):",
"- sum += (n - i) * ls[i]",
"- return sum",
"+ s1 += (n - i) * ls[-i - 1]",
"+ s2 += (n - i) * ls[i]",
"+ return s1, s2",
"- vmx, vmn = mx(ls, m), mn(ls, m)",
"- if vmx < s or vmn > s:",
"+ mx, mn = mxmn(ls, m)",
"+ if mx < s or mn > s:",
"- elif vmx == s or vmn == s:",
"+ elif mx == s or mn == s:"
] | false | 0.035098 | 0.070366 | 0.498788 | [
"s615646264",
"s364720985"
] |
u155251346 | p03555 | python | s216029740 | s915803881 | 29 | 26 | 9,072 | 9,008 | Accepted | Accepted | 10.34 | a=eval(input())
b=eval(input())
if [a[2],a[1],a[0]]==[b[0],b[1],b[2]]:
print("YES")
else:
print("NO") | #入力例は合うがWAになる
A = eval(input())
B = eval(input())
if A[0]==B[2] and A[1]==B[1] and A[2]==B[0]:
print("YES")
else:
print("NO")
#YESとNOにしないといけないところをYes、Noになっていた | 6 | 12 | 102 | 169 | a = eval(input())
b = eval(input())
if [a[2], a[1], a[0]] == [b[0], b[1], b[2]]:
print("YES")
else:
print("NO")
| # 入力例は合うがWAになる
A = eval(input())
B = eval(input())
if A[0] == B[2] and A[1] == B[1] and A[2] == B[0]:
print("YES")
else:
print("NO")
# YESとNOにしないといけないところをYes、Noになっていた
| false | 50 | [
"-a = eval(input())",
"-b = eval(input())",
"-if [a[2], a[1], a[0]] == [b[0], b[1], b[2]]:",
"+# 入力例は合うがWAになる",
"+A = eval(input())",
"+B = eval(input())",
"+if A[0] == B[2] and A[1] == B[1] and A[2] == B[0]:",
"+# YESとNOにしないといけないところをYes、Noになっていた"
] | false | 0.072574 | 0.036849 | 1.969471 | [
"s216029740",
"s915803881"
] |
u390694622 | p03546 | python | s778629657 | s723020591 | 1,087 | 33 | 3,444 | 3,444 | Accepted | Accepted | 96.96 | def rec_cost(x,acc,plist,clist):
if x == 1:
return acc
else:
minimum = -1
for next in plist:
nextplist = plist.copy()
nextplist.remove(next)
candidate = rec_cost(next,acc+clist[x][next],nextplist,clist)
if minimum == -1:
minimum = candidate
elif candidate < minimum:
minimum = candidate
return minimum
def cost(n,clist):
plist = [0,1,2,3,4,5,6,7,8,9]
plist.remove(n)
return rec_cost(n,0,plist,clist)
def joisino(a,clist):
note = [-1,0,-1,-1,-1,-1,-1,-1,-1,-1]
answer = 0
for raw in a:
for number in raw:
if number != -1:
if note[number] == -1:
note[number] = cost(number,clist)
answer += note[number]
return answer
def i_o():
h, w = map(int,input().split(" "))
i = 0
clist = []
while i < 10:
raw = list(map(int,input().split(" ")))
clist.append(raw)
i += 1
a = []
i = 1
while i <= h:
raw = list(map(int,input().split(" ")))
a.append(raw)
i += 1
return h,w,clist,a
if __name__ == '__main__':
h,w,clist,a = i_o()
ans =joisino(a,clist)
print(ans, flush=True)
| def cost(n,clist):
k = 0
while k < 10:
i = 0
while i < 10:
j = 0
while j < 10:
clist[i][j] = min(clist[i][j],clist[i][k]+clist[k][j])
j += 1
i += 1
k += 1
return clist[n][1]
def joisino(a,clist):
note = [-1,0,-1,-1,-1,-1,-1,-1,-1,-1]
answer = 0
for raw in a:
for number in raw:
if number != -1:
if note[number] == -1:
note[number] = cost(number,clist)
answer += note[number]
return answer
def i_o():
h, w = map(int,input().split(" "))
i = 0
clist = []
while i < 10:
raw = list(map(int,input().split(" ")))
clist.append(raw)
i += 1
a = []
i = 1
while i <= h:
raw = list(map(int,input().split(" ")))
a.append(raw)
i += 1
return h,w,clist,a
if __name__ == '__main__':
h,w,clist,a = i_o()
ans =joisino(a,clist)
print(ans, flush=True)
| 53 | 46 | 1,184 | 930 | def rec_cost(x, acc, plist, clist):
if x == 1:
return acc
else:
minimum = -1
for next in plist:
nextplist = plist.copy()
nextplist.remove(next)
candidate = rec_cost(next, acc + clist[x][next], nextplist, clist)
if minimum == -1:
minimum = candidate
elif candidate < minimum:
minimum = candidate
return minimum
def cost(n, clist):
plist = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
plist.remove(n)
return rec_cost(n, 0, plist, clist)
def joisino(a, clist):
note = [-1, 0, -1, -1, -1, -1, -1, -1, -1, -1]
answer = 0
for raw in a:
for number in raw:
if number != -1:
if note[number] == -1:
note[number] = cost(number, clist)
answer += note[number]
return answer
def i_o():
h, w = map(int, input().split(" "))
i = 0
clist = []
while i < 10:
raw = list(map(int, input().split(" ")))
clist.append(raw)
i += 1
a = []
i = 1
while i <= h:
raw = list(map(int, input().split(" ")))
a.append(raw)
i += 1
return h, w, clist, a
if __name__ == "__main__":
h, w, clist, a = i_o()
ans = joisino(a, clist)
print(ans, flush=True)
| def cost(n, clist):
k = 0
while k < 10:
i = 0
while i < 10:
j = 0
while j < 10:
clist[i][j] = min(clist[i][j], clist[i][k] + clist[k][j])
j += 1
i += 1
k += 1
return clist[n][1]
def joisino(a, clist):
note = [-1, 0, -1, -1, -1, -1, -1, -1, -1, -1]
answer = 0
for raw in a:
for number in raw:
if number != -1:
if note[number] == -1:
note[number] = cost(number, clist)
answer += note[number]
return answer
def i_o():
h, w = map(int, input().split(" "))
i = 0
clist = []
while i < 10:
raw = list(map(int, input().split(" ")))
clist.append(raw)
i += 1
a = []
i = 1
while i <= h:
raw = list(map(int, input().split(" ")))
a.append(raw)
i += 1
return h, w, clist, a
if __name__ == "__main__":
h, w, clist, a = i_o()
ans = joisino(a, clist)
print(ans, flush=True)
| false | 13.207547 | [
"-def rec_cost(x, acc, plist, clist):",
"- if x == 1:",
"- return acc",
"- else:",
"- minimum = -1",
"- for next in plist:",
"- nextplist = plist.copy()",
"- nextplist.remove(next)",
"- candidate = rec_cost(next, acc + clist[x][next], nextplist, clist)",
"- if minimum == -1:",
"- minimum = candidate",
"- elif candidate < minimum:",
"- minimum = candidate",
"- return minimum",
"-",
"-",
"- plist = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]",
"- plist.remove(n)",
"- return rec_cost(n, 0, plist, clist)",
"+ k = 0",
"+ while k < 10:",
"+ i = 0",
"+ while i < 10:",
"+ j = 0",
"+ while j < 10:",
"+ clist[i][j] = min(clist[i][j], clist[i][k] + clist[k][j])",
"+ j += 1",
"+ i += 1",
"+ k += 1",
"+ return clist[n][1]"
] | false | 0.968266 | 0.036282 | 26.687121 | [
"s778629657",
"s723020591"
] |
u573754721 | p02881 | python | s993833068 | s056663662 | 136 | 116 | 3,060 | 3,268 | Accepted | Accepted | 14.71 | import math
n=int(eval(input()))
num=math.ceil(math.sqrt(n))
L=max([i for i in range(1,num+1) if n%i==0])
print((L+n//L-2)) | n=int(eval(input()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
L=make_divisors(n)
s=float('inf')
for i in L:
s=min(s,i+(n//i))
print((s-2)) | 5 | 21 | 119 | 359 | import math
n = int(eval(input()))
num = math.ceil(math.sqrt(n))
L = max([i for i in range(1, num + 1) if n % i == 0])
print((L + n // L - 2))
| n = int(eval(input()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
divisors.sort()
return divisors
L = make_divisors(n)
s = float("inf")
for i in L:
s = min(s, i + (n // i))
print((s - 2))
| false | 76.190476 | [
"-import math",
"+n = int(eval(input()))",
"-n = int(eval(input()))",
"-num = math.ceil(math.sqrt(n))",
"-L = max([i for i in range(1, num + 1) if n % i == 0])",
"-print((L + n // L - 2))",
"+",
"+def make_divisors(n):",
"+ divisors = []",
"+ for i in range(1, int(n**0.5) + 1):",
"+ if n % i == 0:",
"+ divisors.append(i)",
"+ if i != n // i:",
"+ divisors.append(n // i)",
"+ divisors.sort()",
"+ return divisors",
"+",
"+",
"+L = make_divisors(n)",
"+s = float(\"inf\")",
"+for i in L:",
"+ s = min(s, i + (n // i))",
"+print((s - 2))"
] | false | 0.092769 | 0.085704 | 1.082436 | [
"s993833068",
"s056663662"
] |
u156896646 | p03854 | python | s400985362 | s526299544 | 64 | 41 | 21,348 | 3,188 | Accepted | Accepted | 35.94 | import sys
sys.setrecursionlimit(1000000)
S = eval(input())
T = ['dream', 'dreamer', 'erase', 'eraser']
lenT = [len(i) for i in T]
def dayDream(pin):
global isGoal #;print('dayDream: ', pin, S[pin:])
for i, d in enumerate(T):
if isGoal:
return
#print('i, d:', i, d)
if S[pin:pin+lenT[i]] == d:
pout = pin + lenT[i] #;print(d, pout)
if pout == len(S):
isGoal = True #;print('YES')
return
else:
dayDream(pout)
#print('dayDream return', pin)
return
isGoal = False
dayDream(0)
if isGoal:
print('YES')
else:
print('NO') | S = eval(input())
Srev = S[::-1]
T = ['dream', 'dreamer', 'erase', 'eraser']
lenT = [len(i) for i in T]
Trev = [t[::-1] for t in T]
i = 0
while i < len(S):
for j, t in enumerate(Trev):
if Srev[i:i+lenT[j]] == t:
i += lenT[j] #; print(i, j, t)
break
else:
print('NO')
break
else:
print('YES')
| 30 | 18 | 735 | 370 | import sys
sys.setrecursionlimit(1000000)
S = eval(input())
T = ["dream", "dreamer", "erase", "eraser"]
lenT = [len(i) for i in T]
def dayDream(pin):
global isGoal # ;print('dayDream: ', pin, S[pin:])
for i, d in enumerate(T):
if isGoal:
return
# print('i, d:', i, d)
if S[pin : pin + lenT[i]] == d:
pout = pin + lenT[i] # ;print(d, pout)
if pout == len(S):
isGoal = True # ;print('YES')
return
else:
dayDream(pout)
# print('dayDream return', pin)
return
isGoal = False
dayDream(0)
if isGoal:
print("YES")
else:
print("NO")
| S = eval(input())
Srev = S[::-1]
T = ["dream", "dreamer", "erase", "eraser"]
lenT = [len(i) for i in T]
Trev = [t[::-1] for t in T]
i = 0
while i < len(S):
for j, t in enumerate(Trev):
if Srev[i : i + lenT[j]] == t:
i += lenT[j] # ; print(i, j, t)
break
else:
print("NO")
break
else:
print("YES")
| false | 40 | [
"-import sys",
"-",
"-sys.setrecursionlimit(1000000)",
"+Srev = S[::-1]",
"-",
"-",
"-def dayDream(pin):",
"- global isGoal # ;print('dayDream: ', pin, S[pin:])",
"- for i, d in enumerate(T):",
"- if isGoal:",
"- return",
"- # print('i, d:', i, d)",
"- if S[pin : pin + lenT[i]] == d:",
"- pout = pin + lenT[i] # ;print(d, pout)",
"- if pout == len(S):",
"- isGoal = True # ;print('YES')",
"- return",
"- else:",
"- dayDream(pout)",
"- # print('dayDream return', pin)",
"- return",
"-",
"-",
"-isGoal = False",
"-dayDream(0)",
"-if isGoal:",
"+Trev = [t[::-1] for t in T]",
"+i = 0",
"+while i < len(S):",
"+ for j, t in enumerate(Trev):",
"+ if Srev[i : i + lenT[j]] == t:",
"+ i += lenT[j] # ; print(i, j, t)",
"+ break",
"+ else:",
"+ print(\"NO\")",
"+ break",
"+else:",
"-else:",
"- print(\"NO\")"
] | false | 0.038389 | 0.066853 | 0.574234 | [
"s400985362",
"s526299544"
] |
u471214054 | p02579 | python | s611474662 | s858674988 | 1,132 | 1,004 | 215,032 | 224,036 | Accepted | Accepted | 11.31 | import sys
from collections import deque, defaultdict
sys.setrecursionlimit(10000)
H, W = list(map(int, input().split()))
C = tuple(map(int, input().split()))
D = tuple(map(int, input().split()))
S = [list(eval(input())) for _ in range(H)]
d = [(0, 1), (1, 0), (0, -1), (-1, 0)]
def dfs(h, w, i):
S[h][w] = i
for dh, dw in d:
nh = h + dh
nw = w + dw
if nh < 0 or nh >= H or nw < 0 or nw >= W:
continue
if S[nh][nw] != '.':
continue
dfs(nh, nw, i)
# 番号を振る
count = 1
for h in range(H):
for w in range(W):
if S[h][w] != '.':
continue
dfs(h, w, count)
count += 1
# グラフを構築
graph = {}
for i in range(1, count):
graph[i] = set()
for h in range(H):
for w in range(W):
if S[h][w] == '#':
continue
for dh in range(-2, 3):
for dw in range(-2, 3):
nh = h + dh
nw = w + dw
if nh < 0 or nh >= H or nw < 0 or nw >= W:
continue
if S[nh][nw] == '#':
continue
graph[S[h][w]].add(S[nh][nw])
start = S[C[0]-1][C[1]-1]
goal = S[D[0]-1][D[1]-1]
# 最短経路を求める
def bfs(start, goal):
queue = deque([start])
visited = set()
visited.add(start)
dist = defaultdict(int)
dist[start] = 0
while queue:
current_vertex = queue.popleft()
for v in graph[current_vertex]:
if v not in visited:
visited.add(v)
queue.append(v)
dist[v] = dist[current_vertex] + 1
return dist[goal] if goal in dist else -1
ans = bfs(start, goal)
print(ans)
| import sys
from collections import deque, defaultdict
sys.setrecursionlimit(10000)
H, W = list(map(int, input().split()))
C = tuple(map(int, input().split()))
D = tuple(map(int, input().split()))
S = [list(eval(input())) for _ in range(H)]
d = [(0, 1), (1, 0), (0, -1), (-1, 0)]
def dfs(h, w, i):
S[h][w] = i
for dh, dw in d:
nh = h + dh
nw = w + dw
if nh < 0 or nh >= H or nw < 0 or nw >= W:
continue
if S[nh][nw] != '.':
continue
dfs(nh, nw, i)
# 領域毎に番号を振る
count = 1
for h in range(H):
for w in range(W):
if S[h][w] != '.':
continue
dfs(h, w, count)
count += 1
# 各領域をノードとしてグラフを構築
graph = defaultdict(set)
for h in range(H):
for w in range(W):
if S[h][w] == '#':
continue
for dh in range(-2, 3):
for dw in range(-2, 3):
nh = h + dh
nw = w + dw
if nh < 0 or nh >= H or nw < 0 or nw >= W:
continue
if S[nh][nw] == '#':
continue
graph[S[h][w]].add(S[nh][nw])
start = S[C[0]-1][C[1]-1]
goal = S[D[0]-1][D[1]-1]
def shortest_dist(graph, start, goal):
queue = deque([start])
visited = set()
visited.add(start)
dist = defaultdict(int)
dist[start] = 0
while queue:
current_vertex = queue.popleft()
if current_vertex == goal:
return dist[goal]
for v in graph[current_vertex]:
if v not in visited:
visited.add(v)
queue.append(v)
dist[v] = dist[current_vertex] + 1
return -1
# 最短距離を求める
ans = shortest_dist(graph, start, goal)
print(ans)
| 75 | 77 | 1,754 | 1,806 | import sys
from collections import deque, defaultdict
sys.setrecursionlimit(10000)
H, W = list(map(int, input().split()))
C = tuple(map(int, input().split()))
D = tuple(map(int, input().split()))
S = [list(eval(input())) for _ in range(H)]
d = [(0, 1), (1, 0), (0, -1), (-1, 0)]
def dfs(h, w, i):
S[h][w] = i
for dh, dw in d:
nh = h + dh
nw = w + dw
if nh < 0 or nh >= H or nw < 0 or nw >= W:
continue
if S[nh][nw] != ".":
continue
dfs(nh, nw, i)
# 番号を振る
count = 1
for h in range(H):
for w in range(W):
if S[h][w] != ".":
continue
dfs(h, w, count)
count += 1
# グラフを構築
graph = {}
for i in range(1, count):
graph[i] = set()
for h in range(H):
for w in range(W):
if S[h][w] == "#":
continue
for dh in range(-2, 3):
for dw in range(-2, 3):
nh = h + dh
nw = w + dw
if nh < 0 or nh >= H or nw < 0 or nw >= W:
continue
if S[nh][nw] == "#":
continue
graph[S[h][w]].add(S[nh][nw])
start = S[C[0] - 1][C[1] - 1]
goal = S[D[0] - 1][D[1] - 1]
# 最短経路を求める
def bfs(start, goal):
queue = deque([start])
visited = set()
visited.add(start)
dist = defaultdict(int)
dist[start] = 0
while queue:
current_vertex = queue.popleft()
for v in graph[current_vertex]:
if v not in visited:
visited.add(v)
queue.append(v)
dist[v] = dist[current_vertex] + 1
return dist[goal] if goal in dist else -1
ans = bfs(start, goal)
print(ans)
| import sys
from collections import deque, defaultdict
sys.setrecursionlimit(10000)
H, W = list(map(int, input().split()))
C = tuple(map(int, input().split()))
D = tuple(map(int, input().split()))
S = [list(eval(input())) for _ in range(H)]
d = [(0, 1), (1, 0), (0, -1), (-1, 0)]
def dfs(h, w, i):
S[h][w] = i
for dh, dw in d:
nh = h + dh
nw = w + dw
if nh < 0 or nh >= H or nw < 0 or nw >= W:
continue
if S[nh][nw] != ".":
continue
dfs(nh, nw, i)
# 領域毎に番号を振る
count = 1
for h in range(H):
for w in range(W):
if S[h][w] != ".":
continue
dfs(h, w, count)
count += 1
# 各領域をノードとしてグラフを構築
graph = defaultdict(set)
for h in range(H):
for w in range(W):
if S[h][w] == "#":
continue
for dh in range(-2, 3):
for dw in range(-2, 3):
nh = h + dh
nw = w + dw
if nh < 0 or nh >= H or nw < 0 or nw >= W:
continue
if S[nh][nw] == "#":
continue
graph[S[h][w]].add(S[nh][nw])
start = S[C[0] - 1][C[1] - 1]
goal = S[D[0] - 1][D[1] - 1]
def shortest_dist(graph, start, goal):
queue = deque([start])
visited = set()
visited.add(start)
dist = defaultdict(int)
dist[start] = 0
while queue:
current_vertex = queue.popleft()
if current_vertex == goal:
return dist[goal]
for v in graph[current_vertex]:
if v not in visited:
visited.add(v)
queue.append(v)
dist[v] = dist[current_vertex] + 1
return -1
# 最短距離を求める
ans = shortest_dist(graph, start, goal)
print(ans)
| false | 2.597403 | [
"-# 番号を振る",
"+# 領域毎に番号を振る",
"-# グラフを構築",
"-graph = {}",
"-for i in range(1, count):",
"- graph[i] = set()",
"+# 各領域をノードとしてグラフを構築",
"+graph = defaultdict(set)",
"-# 最短経路を求める",
"-def bfs(start, goal):",
"+",
"+",
"+def shortest_dist(graph, start, goal):",
"+ if current_vertex == goal:",
"+ return dist[goal]",
"- return dist[goal] if goal in dist else -1",
"+ return -1",
"-ans = bfs(start, goal)",
"+# 最短距離を求める",
"+ans = shortest_dist(graph, start, goal)"
] | false | 0.038771 | 0.046155 | 0.840014 | [
"s611474662",
"s858674988"
] |
u198881450 | p00474 | python | s336604708 | s944214771 | 330 | 270 | 15,544 | 15,612 | Accepted | Accepted | 18.18 | def orderN(N,L,ices):
upPeak = L - ices[0]
downPeak = L - ices[0]
peaks = []
for i in range(len(ices)):
if i < N-1:
if ices[i] < ices[i+1]:
peaks.append(downPeak)
downPeak = L - ices[i+1]
upPeak += L - ices[i+1]
else:
peaks.append(upPeak)
upPeak = L - ices[i+1]
downPeak += L - ices[i+1]
else:
peaks.append(upPeak)
peaks.append(downPeak)
print((max(peaks)))
N,L = list(map(int,input().strip().split()))
ices = []
while True:
ice = int(input().strip())
ices.append(ice)
if len(ices) == N:
break
orderN(N,L,ices) | def orderN(N,L,ices):
upPeak = L - ices[0]
downPeak = L - ices[0]
peaks = []
for i in range(len(ices)):
if i < N-1:
if ices[i] < ices[i+1]:
peaks.append(downPeak)
downPeak = L - ices[i+1]
upPeak += L - ices[i+1]
elif ices[i] > ices[i+1]:
peaks.append(upPeak)
upPeak = L - ices[i+1]
downPeak += L - ices[i+1]
elif i == N-1:
peaks.append(upPeak)
peaks.append(downPeak)
print((max(peaks)))
N,L = list(map(int,input().strip().split()))
ices = [int(input().strip()) for _ in range(N)]
orderN(N,L,ices) | 28 | 24 | 731 | 694 | def orderN(N, L, ices):
upPeak = L - ices[0]
downPeak = L - ices[0]
peaks = []
for i in range(len(ices)):
if i < N - 1:
if ices[i] < ices[i + 1]:
peaks.append(downPeak)
downPeak = L - ices[i + 1]
upPeak += L - ices[i + 1]
else:
peaks.append(upPeak)
upPeak = L - ices[i + 1]
downPeak += L - ices[i + 1]
else:
peaks.append(upPeak)
peaks.append(downPeak)
print((max(peaks)))
N, L = list(map(int, input().strip().split()))
ices = []
while True:
ice = int(input().strip())
ices.append(ice)
if len(ices) == N:
break
orderN(N, L, ices)
| def orderN(N, L, ices):
upPeak = L - ices[0]
downPeak = L - ices[0]
peaks = []
for i in range(len(ices)):
if i < N - 1:
if ices[i] < ices[i + 1]:
peaks.append(downPeak)
downPeak = L - ices[i + 1]
upPeak += L - ices[i + 1]
elif ices[i] > ices[i + 1]:
peaks.append(upPeak)
upPeak = L - ices[i + 1]
downPeak += L - ices[i + 1]
elif i == N - 1:
peaks.append(upPeak)
peaks.append(downPeak)
print((max(peaks)))
N, L = list(map(int, input().strip().split()))
ices = [int(input().strip()) for _ in range(N)]
orderN(N, L, ices)
| false | 14.285714 | [
"- else:",
"+ elif ices[i] > ices[i + 1]:",
"- else:",
"+ elif i == N - 1:",
"-ices = []",
"-while True:",
"- ice = int(input().strip())",
"- ices.append(ice)",
"- if len(ices) == N:",
"- break",
"+ices = [int(input().strip()) for _ in range(N)]"
] | false | 0.03473 | 0.037628 | 0.922992 | [
"s336604708",
"s944214771"
] |
u967062796 | p02958 | python | s819514237 | s763097776 | 27 | 17 | 3,188 | 3,064 | Accepted | Accepted | 37.04 | n = int(eval(input()))
P = [int(x) for x in input().split()]
flag = True
for i in range(n):
for j in range(n):
if i == j:
continue
else:
copy_P = P[:]
copy_P[i], copy_P[j] = copy_P[j], copy_P[i]
if copy_P == sorted(P):
print("YES")
flag = False
break
else:
continue
break
if sorted(P) == P:
print("YES")
flag = False
if flag:
print("NO") | n = int(eval(input()))
p = [int(x) for x in input().split()]
p_copy = p[:]
p.sort()
count = 0
for i in range(n):
if p[i] != p_copy[i]:
count += 1
if count == 0 or count == 2:
print("YES")
else:
print("NO") | 24 | 15 | 504 | 236 | n = int(eval(input()))
P = [int(x) for x in input().split()]
flag = True
for i in range(n):
for j in range(n):
if i == j:
continue
else:
copy_P = P[:]
copy_P[i], copy_P[j] = copy_P[j], copy_P[i]
if copy_P == sorted(P):
print("YES")
flag = False
break
else:
continue
break
if sorted(P) == P:
print("YES")
flag = False
if flag:
print("NO")
| n = int(eval(input()))
p = [int(x) for x in input().split()]
p_copy = p[:]
p.sort()
count = 0
for i in range(n):
if p[i] != p_copy[i]:
count += 1
if count == 0 or count == 2:
print("YES")
else:
print("NO")
| false | 37.5 | [
"-P = [int(x) for x in input().split()]",
"-flag = True",
"+p = [int(x) for x in input().split()]",
"+p_copy = p[:]",
"+p.sort()",
"+count = 0",
"- for j in range(n):",
"- if i == j:",
"- continue",
"- else:",
"- copy_P = P[:]",
"- copy_P[i], copy_P[j] = copy_P[j], copy_P[i]",
"- if copy_P == sorted(P):",
"- print(\"YES\")",
"- flag = False",
"- break",
"- else:",
"- continue",
"- break",
"-if sorted(P) == P:",
"+ if p[i] != p_copy[i]:",
"+ count += 1",
"+if count == 0 or count == 2:",
"- flag = False",
"-if flag:",
"+else:"
] | false | 0.104856 | 0.120484 | 0.870292 | [
"s819514237",
"s763097776"
] |
u941753895 | p03032 | python | s538911583 | s306807829 | 78 | 52 | 5,432 | 5,204 | Accepted | Accepted | 33.33 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
n,k=LI()
l=LI()
ans=-inf
a=min(n,k)
for i in range(a+1):
sm=0
for j in range(a+1-i):
if j!=0:
_q=l[:i]+l[-j:]
else:
_q=l[:i]
q=[]
for x in _q:
heapq.heappush(q,x)
ans=max(ans,sum(q))
for _ in range(k-i-j):
if len(q)>0:
heapq.heappop(q)
ans=max(ans,sum(q))
else:
break
return ans
# main()
print((main()))
| import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=1000000007
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
n,k=LI()
l=LI()
cnt=min(n,k)
ans=0
for i in range(cnt+1):
for j in range(cnt-i+1):
q=[]
for _i in range(i):
heapq.heappush(q,l[_i])
for _j in range(j):
heapq.heappush(q,l[-(_j+1)])
ln=len(q)
for _ in range(min(k-i-j,ln)):
x=heapq.heappop(q)
if x>0:
q.append(x)
break
# print(q)
ans=max(ans,sum(q))
return ans
# main()
print((main()))
| 44 | 41 | 977 | 896 | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def LI_():
return [int(x) - 1 for x in sys.stdin.readline().split()]
def I():
return int(sys.stdin.readline())
def LS():
return sys.stdin.readline().split()
def S():
return eval(input())
def main():
n, k = LI()
l = LI()
ans = -inf
a = min(n, k)
for i in range(a + 1):
sm = 0
for j in range(a + 1 - i):
if j != 0:
_q = l[:i] + l[-j:]
else:
_q = l[:i]
q = []
for x in _q:
heapq.heappush(q, x)
ans = max(ans, sum(q))
for _ in range(k - i - j):
if len(q) > 0:
heapq.heappop(q)
ans = max(ans, sum(q))
else:
break
return ans
# main()
print((main()))
| import math, itertools, fractions, heapq, collections, bisect, sys, queue, copy
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 1000000007
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def I():
return int(sys.stdin.readline())
def LS():
return sys.stdin.readline().split()
def S():
return eval(input())
def main():
n, k = LI()
l = LI()
cnt = min(n, k)
ans = 0
for i in range(cnt + 1):
for j in range(cnt - i + 1):
q = []
for _i in range(i):
heapq.heappush(q, l[_i])
for _j in range(j):
heapq.heappush(q, l[-(_j + 1)])
ln = len(q)
for _ in range(min(k - i - j, ln)):
x = heapq.heappop(q)
if x > 0:
q.append(x)
break
# print(q)
ans = max(ans, sum(q))
return ans
# main()
print((main()))
| false | 6.818182 | [
"-import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy",
"+import math, itertools, fractions, heapq, collections, bisect, sys, queue, copy",
"-mod = 10**9 + 7",
"+mod = 1000000007",
"-",
"-",
"-def LI_():",
"- return [int(x) - 1 for x in sys.stdin.readline().split()]",
"- ans = -inf",
"- a = min(n, k)",
"- for i in range(a + 1):",
"- sm = 0",
"- for j in range(a + 1 - i):",
"- if j != 0:",
"- _q = l[:i] + l[-j:]",
"- else:",
"- _q = l[:i]",
"+ cnt = min(n, k)",
"+ ans = 0",
"+ for i in range(cnt + 1):",
"+ for j in range(cnt - i + 1):",
"- for x in _q:",
"- heapq.heappush(q, x)",
"+ for _i in range(i):",
"+ heapq.heappush(q, l[_i])",
"+ for _j in range(j):",
"+ heapq.heappush(q, l[-(_j + 1)])",
"+ ln = len(q)",
"+ for _ in range(min(k - i - j, ln)):",
"+ x = heapq.heappop(q)",
"+ if x > 0:",
"+ q.append(x)",
"+ break",
"+ # print(q)",
"- for _ in range(k - i - j):",
"- if len(q) > 0:",
"- heapq.heappop(q)",
"- ans = max(ans, sum(q))",
"- else:",
"- break"
] | false | 0.049712 | 0.047781 | 1.040408 | [
"s538911583",
"s306807829"
] |
u646110634 | p02700 | python | s241165585 | s003485769 | 22 | 18 | 9,120 | 9,164 | Accepted | Accepted | 18.18 | A, B, C, D = list(map(int, input().split()))
T_time = C // B
if not C % B == 0 :
T_time += 1
A_time = A // D
if not A % D == 0 :
A_time += 1
if T_time <= A_time :
print("Yes")
else :
print("No") | A, B, C, D = list(map(int, input().split()))
T_time = C // B if C % B == 0 else C // B + 1
A_time = A // D if A % D == 0 else A // D + 1
if T_time <= A_time :
print("Yes")
else :
print("No")
| 14 | 9 | 212 | 199 | A, B, C, D = list(map(int, input().split()))
T_time = C // B
if not C % B == 0:
T_time += 1
A_time = A // D
if not A % D == 0:
A_time += 1
if T_time <= A_time:
print("Yes")
else:
print("No")
| A, B, C, D = list(map(int, input().split()))
T_time = C // B if C % B == 0 else C // B + 1
A_time = A // D if A % D == 0 else A // D + 1
if T_time <= A_time:
print("Yes")
else:
print("No")
| false | 35.714286 | [
"-T_time = C // B",
"-if not C % B == 0:",
"- T_time += 1",
"-A_time = A // D",
"-if not A % D == 0:",
"- A_time += 1",
"+T_time = C // B if C % B == 0 else C // B + 1",
"+A_time = A // D if A % D == 0 else A // D + 1"
] | false | 0.178173 | 0.105888 | 1.682656 | [
"s241165585",
"s003485769"
] |
u698919163 | p02862 | python | s122061480 | s822439183 | 914 | 138 | 82,464 | 3,064 | Accepted | Accepted | 84.9 | X,Y = list(map(int,input().split()))
n = (-X+2*Y)//3
m = (2*X-Y)//3
mod = 10**9+7 #出力の制限
N = max(n+m,n)
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
if (-X+2*Y)%3 == 0 and (2*X-Y)%3 == 0:
print((cmb(n+m,n,mod)))
else:
print((0)) | X,Y = list(map(int,input().split()))
n = (-X+2*Y)//3
m = (2*X-Y)//3
MOD = 10**9+7
def comb(n,r,MOD):
x = n+1
y = min(r,n-r)
numer = 1
denom = 1
for i in range(1,r+1):
numer = numer*(x-i)%MOD
denom = denom*(i)%MOD
return numer * pow(denom,MOD-2,MOD) % MOD
import sys
if n < 0 or m < 0:
print((0))
sys.exit()
if (X+Y)%3 != 0:
print((0))
sys.exit()
print((comb(n+m,n,MOD))) | 26 | 29 | 587 | 478 | X, Y = list(map(int, input().split()))
n = (-X + 2 * Y) // 3
m = (2 * X - Y) // 3
mod = 10**9 + 7 # 出力の制限
N = max(n + m, n)
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inverse = [0, 1] # 逆元テーブル計算用テーブル
def cmb(n, r, mod):
if r < 0 or r > n:
return 0
r = min(r, n - r)
return g1[n] * g2[r] * g2[n - r] % mod
for i in range(2, N + 1):
g1.append((g1[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod // i)) % mod)
g2.append((g2[-1] * inverse[-1]) % mod)
if (-X + 2 * Y) % 3 == 0 and (2 * X - Y) % 3 == 0:
print((cmb(n + m, n, mod)))
else:
print((0))
| X, Y = list(map(int, input().split()))
n = (-X + 2 * Y) // 3
m = (2 * X - Y) // 3
MOD = 10**9 + 7
def comb(n, r, MOD):
x = n + 1
y = min(r, n - r)
numer = 1
denom = 1
for i in range(1, r + 1):
numer = numer * (x - i) % MOD
denom = denom * (i) % MOD
return numer * pow(denom, MOD - 2, MOD) % MOD
import sys
if n < 0 or m < 0:
print((0))
sys.exit()
if (X + Y) % 3 != 0:
print((0))
sys.exit()
print((comb(n + m, n, MOD)))
| false | 10.344828 | [
"-mod = 10**9 + 7 # 出力の制限",
"-N = max(n + m, n)",
"-g1 = [1, 1] # 元テーブル",
"-g2 = [1, 1] # 逆元テーブル",
"-inverse = [0, 1] # 逆元テーブル計算用テーブル",
"+MOD = 10**9 + 7",
"-def cmb(n, r, mod):",
"- if r < 0 or r > n:",
"- return 0",
"- r = min(r, n - r)",
"- return g1[n] * g2[r] * g2[n - r] % mod",
"+def comb(n, r, MOD):",
"+ x = n + 1",
"+ y = min(r, n - r)",
"+ numer = 1",
"+ denom = 1",
"+ for i in range(1, r + 1):",
"+ numer = numer * (x - i) % MOD",
"+ denom = denom * (i) % MOD",
"+ return numer * pow(denom, MOD - 2, MOD) % MOD",
"-for i in range(2, N + 1):",
"- g1.append((g1[-1] * i) % mod)",
"- inverse.append((-inverse[mod % i] * (mod // i)) % mod)",
"- g2.append((g2[-1] * inverse[-1]) % mod)",
"-if (-X + 2 * Y) % 3 == 0 and (2 * X - Y) % 3 == 0:",
"- print((cmb(n + m, n, mod)))",
"-else:",
"+import sys",
"+",
"+if n < 0 or m < 0:",
"+ sys.exit()",
"+if (X + Y) % 3 != 0:",
"+ print((0))",
"+ sys.exit()",
"+print((comb(n + m, n, MOD)))"
] | false | 0.454716 | 0.076076 | 5.977131 | [
"s122061480",
"s822439183"
] |
u864013199 | p03212 | python | s710940722 | s175832808 | 338 | 90 | 3,988 | 2,940 | Accepted | Accepted | 73.37 | # editorial
N = int(eval(input()))
from functools import lru_cache
@lru_cache(maxsize=1000)
def dfs(s):
if int(s) > N:
return 0
ret = 1 if all(s.count(c) for c in "753") else 0
for c in "753": #文字列数値をforで回すときの書き方！ 覚える
ret += dfs(s+c) #pythonなのでそのまま+できる
return ret
print((dfs("0"))) | # editorial
N = int(eval(input()))
#from functools import lru_cache
#@lru_cache(maxsize=1000)
def dfs(s):
if int(s) > N:
return 0
ret = 1 if all(s.count(c) for c in "753") else 0
for c in "753": #文字列数値をforで回すときの書き方！ 覚える
ret += dfs(s+c) #pythonなのでそのまま+できる
return ret
print((dfs("0"))) | 14 | 14 | 321 | 323 | # editorial
N = int(eval(input()))
from functools import lru_cache
@lru_cache(maxsize=1000)
def dfs(s):
if int(s) > N:
return 0
ret = 1 if all(s.count(c) for c in "753") else 0
for c in "753": # 文字列数値をforで回すときの書き方！ 覚える
ret += dfs(s + c) # pythonなのでそのまま+できる
return ret
print((dfs("0")))
| # editorial
N = int(eval(input()))
# from functools import lru_cache
# @lru_cache(maxsize=1000)
def dfs(s):
if int(s) > N:
return 0
ret = 1 if all(s.count(c) for c in "753") else 0
for c in "753": # 文字列数値をforで回すときの書き方！ 覚える
ret += dfs(s + c) # pythonなのでそのまま+できる
return ret
print((dfs("0")))
| false | 0 | [
"-from functools import lru_cache",
"-",
"-",
"-@lru_cache(maxsize=1000)",
"+# from functools import lru_cache",
"+# @lru_cache(maxsize=1000)"
] | false | 0.085468 | 0.045525 | 1.877377 | [
"s710940722",
"s175832808"
] |
u498575211 | p02725 | python | s527820521 | s740634277 | 204 | 131 | 26,444 | 26,004 | Accepted | Accepted | 35.78 | (K, N) = list(map(int, input().split()))
A = list(map(int, input().split()))
A.append(A[0]+K)
A_next = []
max = 0
result = 0
j = 0
k = 0
#print(A)
for x in range(1, len(A)):
#print(x)
#print(A[x]-A[x-1])
#print(A[x-1])
#print(A_next)
A_next.append(abs(A[x] - A[x-1]))
if max < A_next[j]:
max = A_next[j]
#print(max)
k = j
j += 1
#print(k)
#print(A_next)
for x in range(len(A_next)):
if x == k:
pass
else:
result += A_next[x]
print(result)
| N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
a.append(N+a[0])
#print(a)
max = 0
for i in range(len(a)-1):
p = abs(a[i]-a[i+1])
max = p if max < p else max
print((N-max))
| 32 | 9 | 515 | 204 | (K, N) = list(map(int, input().split()))
A = list(map(int, input().split()))
A.append(A[0] + K)
A_next = []
max = 0
result = 0
j = 0
k = 0
# print(A)
for x in range(1, len(A)):
# print(x)
# print(A[x]-A[x-1])
# print(A[x-1])
# print(A_next)
A_next.append(abs(A[x] - A[x - 1]))
if max < A_next[j]:
max = A_next[j]
# print(max)
k = j
j += 1
# print(k)
# print(A_next)
for x in range(len(A_next)):
if x == k:
pass
else:
result += A_next[x]
print(result)
| N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
a.append(N + a[0])
# print(a)
max = 0
for i in range(len(a) - 1):
p = abs(a[i] - a[i + 1])
max = p if max < p else max
print((N - max))
| false | 71.875 | [
"-(K, N) = list(map(int, input().split()))",
"-A = list(map(int, input().split()))",
"-A.append(A[0] + K)",
"-A_next = []",
"+N, K = list(map(int, input().split()))",
"+a = list(map(int, input().split()))",
"+a.append(N + a[0])",
"+# print(a)",
"-result = 0",
"-j = 0",
"-k = 0",
"-# print(A)",
"-for x in range(1, len(A)):",
"- # print(x)",
"- # print(A[x]-A[x-1])",
"- # print(A[x-1])",
"- # print(A_next)",
"- A_next.append(abs(A[x] - A[x - 1]))",
"- if max < A_next[j]:",
"- max = A_next[j]",
"- # print(max)",
"- k = j",
"- j += 1",
"-# print(k)",
"-# print(A_next)",
"-for x in range(len(A_next)):",
"- if x == k:",
"- pass",
"- else:",
"- result += A_next[x]",
"-print(result)",
"+for i in range(len(a) - 1):",
"+ p = abs(a[i] - a[i + 1])",
"+ max = p if max < p else max",
"+print((N - max))"
] | false | 0.037054 | 0.03673 | 1.008823 | [
"s527820521",
"s740634277"
] |
u537722973 | p02675 | python | s141430874 | s973400965 | 289 | 61 | 80,076 | 61,736 | Accepted | Accepted | 78.89 | N = eval(input())
if N[-1] in ['2','4','5','7','9']:
print('hon')
elif N[-1] in ['0','1','6','8']:
print('pon')
else:
print('bon') | n = input()[-1]
print(((n in '24579')*'hon' + (n in '0168')*'pon' + (n in '3')*'bon')) | 7 | 3 | 136 | 87 | N = eval(input())
if N[-1] in ["2", "4", "5", "7", "9"]:
print("hon")
elif N[-1] in ["0", "1", "6", "8"]:
print("pon")
else:
print("bon")
| n = input()[-1]
print(((n in "24579") * "hon" + (n in "0168") * "pon" + (n in "3") * "bon"))
| false | 57.142857 | [
"-N = eval(input())",
"-if N[-1] in [\"2\", \"4\", \"5\", \"7\", \"9\"]:",
"- print(\"hon\")",
"-elif N[-1] in [\"0\", \"1\", \"6\", \"8\"]:",
"- print(\"pon\")",
"-else:",
"- print(\"bon\")",
"+n = input()[-1]",
"+print(((n in \"24579\") * \"hon\" + (n in \"0168\") * \"pon\" + (n in \"3\") * \"bon\"))"
] | false | 0.06561 | 0.040013 | 1.639726 | [
"s141430874",
"s973400965"
] |
u380995377 | p03162 | python | s922456917 | s128251073 | 691 | 481 | 45,664 | 90,968 | Accepted | Accepted | 30.39 | n = int(eval(input()))
vv = []
for i in range(n):
v = [int(x) for x in input().split()]
vv.append(v)
dp = [[0 for i in range(3)] for j in range(n+1)]
for i in range(n):
for h in range(3):
dp[i+1][h] = max(dp[i][(h+1)%3],dp[i][(h+2)%3]) + vv[i][h]
print((max(dp[n]))) | import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return 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)]
#文字列を一文字ずつ数字に変換、'5678'を[5,6,7,8]とできる
def LSI(): return list(map(int, list(sys.stdin.readline().rstrip())))
def LSI2(N): return [list(map(int, list(sys.stdin.readline().rstrip()))) for i in range(N)]
#文字列として取得
def ST(): return sys.stdin.readline().rstrip()
def LST(): return sys.stdin.readline().rstrip().split()
def LST2(N): return [sys.stdin.readline().rstrip().split() for i in range(N)]
def FILL(i,h): return [i for j in range(h)]
def FILL2(i,h,w): return [FILL(i,w) for j in range(h)]
def FILL3(i,h,w,d): return [FILL2(i,w,d) for j in range(h)]
def FILL4(i,h,w,d,d2): return [FILL3(i,w,d,d2) for j in range(h)]
def sisha(num,digit): return Decimal(str(num)).quantize(Decimal(digit),rounding=ROUND_HALF_UP)
#'0.01'や'1E1'などで指定、整数に戻すならintをかます
MOD = 1000000007
INF = float("inf")
sys.setrecursionlimit(10**6+10)
N = I()
dp = FILL2(0,N+1,3)
H = LI2(N)
for i in range(N):
for j in range(3):
for k in range(3):
if j!=k:
dp[i+1][j] = max(dp[i+1][j],dp[i][k] + H[i][j])
print((max(dp[N])))
| 13 | 37 | 293 | 1,479 | n = int(eval(input()))
vv = []
for i in range(n):
v = [int(x) for x in input().split()]
vv.append(v)
dp = [[0 for i in range(3)] for j in range(n + 1)]
for i in range(n):
for h in range(3):
dp[i + 1][h] = max(dp[i][(h + 1) % 3], dp[i][(h + 2) % 3]) + vv[i][h]
print((max(dp[n])))
| import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I():
return int(sys.stdin.readline())
def MI():
return 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)]
# 文字列を一文字ずつ数字に変換、'5678'を[5,6,7,8]とできる
def LSI():
return list(map(int, list(sys.stdin.readline().rstrip())))
def LSI2(N):
return [list(map(int, list(sys.stdin.readline().rstrip()))) for i in range(N)]
# 文字列として取得
def ST():
return sys.stdin.readline().rstrip()
def LST():
return sys.stdin.readline().rstrip().split()
def LST2(N):
return [sys.stdin.readline().rstrip().split() for i in range(N)]
def FILL(i, h):
return [i for j in range(h)]
def FILL2(i, h, w):
return [FILL(i, w) for j in range(h)]
def FILL3(i, h, w, d):
return [FILL2(i, w, d) for j in range(h)]
def FILL4(i, h, w, d, d2):
return [FILL3(i, w, d, d2) for j in range(h)]
def sisha(num, digit):
return Decimal(str(num)).quantize(Decimal(digit), rounding=ROUND_HALF_UP)
#'0.01'や'1E1'などで指定、整数に戻すならintをかます
MOD = 1000000007
INF = float("inf")
sys.setrecursionlimit(10**6 + 10)
N = I()
dp = FILL2(0, N + 1, 3)
H = LI2(N)
for i in range(N):
for j in range(3):
for k in range(3):
if j != k:
dp[i + 1][j] = max(dp[i + 1][j], dp[i][k] + H[i][j])
print((max(dp[N])))
| false | 64.864865 | [
"-n = int(eval(input()))",
"-vv = []",
"-for i in range(n):",
"- v = [int(x) for x in input().split()]",
"- vv.append(v)",
"-dp = [[0 for i in range(3)] for j in range(n + 1)]",
"-for i in range(n):",
"- for h in range(3):",
"- dp[i + 1][h] = max(dp[i][(h + 1) % 3], dp[i][(h + 2) % 3]) + vv[i][h]",
"-print((max(dp[n])))",
"+import sys",
"+import math",
"+from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN",
"+from collections import deque",
"+from bisect import bisect_left",
"+from itertools import product",
"+",
"+",
"+def I():",
"+ return int(sys.stdin.readline())",
"+",
"+",
"+def MI():",
"+ return 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)]",
"+",
"+",
"+# 文字列を一文字ずつ数字に変換、'5678'を[5,6,7,8]とできる",
"+def LSI():",
"+ return list(map(int, list(sys.stdin.readline().rstrip())))",
"+",
"+",
"+def LSI2(N):",
"+ return [list(map(int, list(sys.stdin.readline().rstrip()))) for i in range(N)]",
"+",
"+",
"+# 文字列として取得",
"+def ST():",
"+ return sys.stdin.readline().rstrip()",
"+",
"+",
"+def LST():",
"+ return sys.stdin.readline().rstrip().split()",
"+",
"+",
"+def LST2(N):",
"+ return [sys.stdin.readline().rstrip().split() for i in range(N)]",
"+",
"+",
"+def FILL(i, h):",
"+ return [i for j in range(h)]",
"+",
"+",
"+def FILL2(i, h, w):",
"+ return [FILL(i, w) for j in range(h)]",
"+",
"+",
"+def FILL3(i, h, w, d):",
"+ return [FILL2(i, w, d) for j in range(h)]",
"+",
"+",
"+def FILL4(i, h, w, d, d2):",
"+ return [FILL3(i, w, d, d2) for j in range(h)]",
"+",
"+",
"+def sisha(num, digit):",
"+ return Decimal(str(num)).quantize(Decimal(digit), rounding=ROUND_HALF_UP)",
"+",
"+",
"+#'0.01'や'1E1'などで指定、整数に戻すならintをかます",
"+MOD = 1000000007",
"+INF = float(\"inf\")",
"+sys.setrecursionlimit(10**6 + 10)",
"+N = I()",
"+dp = FILL2(0, N + 1, 3)",
"+H = LI2(N)",
"+for i in range(N):",
"+ for j in range(3):",
"+ for k in range(3):",
"+ if j != k:",
"+ dp[i + 1][j] = max(dp[i + 1][j], dp[i][k] + H[i][j])",
"+print((max(dp[N])))"
] | false | 0.041467 | 0.045864 | 0.904118 | [
"s922456917",
"s128251073"
] |
u790710233 | p03786 | python | s055629821 | s695739445 | 234 | 108 | 14,320 | 14,320 | Accepted | Accepted | 53.85 | import heapq
n = int(eval(input()))
A = list(map(int, input().split()))
heapq.heapify(A)
cnt = 1
prev = heapq.heappop(A)
while A:
x = heapq.heappop(A)
if prev > x:
heapq.heappush(A, prev)
prev = x
continue
if 2*prev < x:
cnt = 1
else:
cnt += 1
prev += x
print(cnt)
| n = int(eval(input()))
A = sorted(map(int, input().split()))
t = 0
s = A[0]
for i in range(1, n):
if 2*s < A[i]:
t = i
s += A[i]
print((n-t)) | 20 | 11 | 340 | 161 | import heapq
n = int(eval(input()))
A = list(map(int, input().split()))
heapq.heapify(A)
cnt = 1
prev = heapq.heappop(A)
while A:
x = heapq.heappop(A)
if prev > x:
heapq.heappush(A, prev)
prev = x
continue
if 2 * prev < x:
cnt = 1
else:
cnt += 1
prev += x
print(cnt)
| n = int(eval(input()))
A = sorted(map(int, input().split()))
t = 0
s = A[0]
for i in range(1, n):
if 2 * s < A[i]:
t = i
s += A[i]
print((n - t))
| false | 45 | [
"-import heapq",
"-",
"-A = list(map(int, input().split()))",
"-heapq.heapify(A)",
"-cnt = 1",
"-prev = heapq.heappop(A)",
"-while A:",
"- x = heapq.heappop(A)",
"- if prev > x:",
"- heapq.heappush(A, prev)",
"- prev = x",
"- continue",
"- if 2 * prev < x:",
"- cnt = 1",
"- else:",
"- cnt += 1",
"- prev += x",
"-print(cnt)",
"+A = sorted(map(int, input().split()))",
"+t = 0",
"+s = A[0]",
"+for i in range(1, n):",
"+ if 2 * s < A[i]:",
"+ t = i",
"+ s += A[i]",
"+print((n - t))"
] | false | 0.037992 | 0.038378 | 0.989927 | [
"s055629821",
"s695739445"
] |
u917432951 | p02264 | python | s113541601 | s637411784 | 810 | 300 | 21,276 | 18,456 | Accepted | Accepted | 62.96 | n, q = list(map(int, input().split()))
data = []
for i in range(n):
tmp = input().split()
tmp[1] = int(tmp[1])
data.append(tmp)
dt_out = []
time_count = 0
while len(data) > 0 :
tmp = data.pop(0)
if(tmp[1] <= q):
time_count += tmp[1]
dt_out.append([tmp[0],time_count])
else:
tmp[1] -= q
time_count += q
data.append(tmp)
for tmp in dt_out:
print((tmp[0]+" "+str(tmp[1]))) | from collections import deque
def doRoundRobin(nt,q):
result = []
countTime = 0
while len(nt) > 0:
tmp = nt.popleft()
if tmp[1] <= q:
countTime += tmp[1]
result.append([tmp[0],countTime])
else:
tmp[1] -= q
countTime += q
nt.append(tmp)
return result
if __name__ == '__main__':
n, q = list(map(int,input().split()))
nameTime = deque()
for _ in range(n):
a, b = input().split()
nameTime.append([a,(int)(b)])
resultNameTime = doRoundRobin(nameTime,q)
for x in resultNameTime:
print((x[0],x[1])) | 22 | 31 | 453 | 670 | n, q = list(map(int, input().split()))
data = []
for i in range(n):
tmp = input().split()
tmp[1] = int(tmp[1])
data.append(tmp)
dt_out = []
time_count = 0
while len(data) > 0:
tmp = data.pop(0)
if tmp[1] <= q:
time_count += tmp[1]
dt_out.append([tmp[0], time_count])
else:
tmp[1] -= q
time_count += q
data.append(tmp)
for tmp in dt_out:
print((tmp[0] + " " + str(tmp[1])))
| from collections import deque
def doRoundRobin(nt, q):
result = []
countTime = 0
while len(nt) > 0:
tmp = nt.popleft()
if tmp[1] <= q:
countTime += tmp[1]
result.append([tmp[0], countTime])
else:
tmp[1] -= q
countTime += q
nt.append(tmp)
return result
if __name__ == "__main__":
n, q = list(map(int, input().split()))
nameTime = deque()
for _ in range(n):
a, b = input().split()
nameTime.append([a, (int)(b)])
resultNameTime = doRoundRobin(nameTime, q)
for x in resultNameTime:
print((x[0], x[1]))
| false | 29.032258 | [
"-n, q = list(map(int, input().split()))",
"-data = []",
"-for i in range(n):",
"- tmp = input().split()",
"- tmp[1] = int(tmp[1])",
"- data.append(tmp)",
"-dt_out = []",
"-time_count = 0",
"-while len(data) > 0:",
"- tmp = data.pop(0)",
"- if tmp[1] <= q:",
"- time_count += tmp[1]",
"- dt_out.append([tmp[0], time_count])",
"- else:",
"- tmp[1] -= q",
"- time_count += q",
"- data.append(tmp)",
"-for tmp in dt_out:",
"- print((tmp[0] + \" \" + str(tmp[1])))",
"+from collections import deque",
"+",
"+",
"+def doRoundRobin(nt, q):",
"+ result = []",
"+ countTime = 0",
"+ while len(nt) > 0:",
"+ tmp = nt.popleft()",
"+ if tmp[1] <= q:",
"+ countTime += tmp[1]",
"+ result.append([tmp[0], countTime])",
"+ else:",
"+ tmp[1] -= q",
"+ countTime += q",
"+ nt.append(tmp)",
"+ return result",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ n, q = list(map(int, input().split()))",
"+ nameTime = deque()",
"+ for _ in range(n):",
"+ a, b = input().split()",
"+ nameTime.append([a, (int)(b)])",
"+ resultNameTime = doRoundRobin(nameTime, q)",
"+ for x in resultNameTime:",
"+ print((x[0], x[1]))"
] | false | 0.171671 | 0.037533 | 4.573917 | [
"s113541601",
"s637411784"
] |
u048238198 | p02571 | python | s741212999 | s715569898 | 146 | 56 | 9,152 | 9,144 | Accepted | Accepted | 61.64 | import sys
import math
#https://atcoder.jp/contests/agc008/submissions/15248942
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
S = input()
T = input()
ans = 0
for i in range(len(S)):
for j in range(i+1,len(S)+1):
if (j-i) == len(T):
match = 0
for k,l in enumerate(range(i,j)):
if S[l] == T[k]:
match += 1
ans = max(ans,match)
print(len(T)-ans)
| import sys
import math
#https://atcoder.jp/contests/agc008/submissions/15248942
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
S = input()
T = input()
ans = 1e9
for si in range(len(S)):
if si+len(T) > len(S):
break
cnt = 0
for i in range(len(T)):
if S[si+i] != T[i]:
cnt += 1
ans = min(ans,cnt)
print(ans)
| 26 | 25 | 694 | 614 | import sys
import math
# https://atcoder.jp/contests/agc008/submissions/15248942
sys.setrecursionlimit(10**8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
S = input()
T = input()
ans = 0
for i in range(len(S)):
for j in range(i + 1, len(S) + 1):
if (j - i) == len(T):
match = 0
for k, l in enumerate(range(i, j)):
if S[l] == T[k]:
match += 1
ans = max(ans, match)
print(len(T) - ans)
| import sys
import math
# https://atcoder.jp/contests/agc008/submissions/15248942
sys.setrecursionlimit(10**8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
S = input()
T = input()
ans = 1e9
for si in range(len(S)):
if si + len(T) > len(S):
break
cnt = 0
for i in range(len(T)):
if S[si + i] != T[i]:
cnt += 1
ans = min(ans, cnt)
print(ans)
| false | 3.846154 | [
"-ans = 0",
"-for i in range(len(S)):",
"- for j in range(i + 1, len(S) + 1):",
"- if (j - i) == len(T):",
"- match = 0",
"- for k, l in enumerate(range(i, j)):",
"- if S[l] == T[k]:",
"- match += 1",
"- ans = max(ans, match)",
"-print(len(T) - ans)",
"+ans = 1e9",
"+for si in range(len(S)):",
"+ if si + len(T) > len(S):",
"+ break",
"+ cnt = 0",
"+ for i in range(len(T)):",
"+ if S[si + i] != T[i]:",
"+ cnt += 1",
"+ ans = min(ans, cnt)",
"+print(ans)"
] | false | 0.037066 | 0.037563 | 0.986753 | [
"s741212999",
"s715569898"
] |
u860002137 | p02924 | python | s644506756 | s424798866 | 303 | 17 | 21,652 | 2,940 | Accepted | Accepted | 94.39 | import numpy as np
N = int(eval(input()))
print((N*(N-1)//2)) | N = int(eval(input()))
print((N*(N-1)//2)) | 3 | 2 | 55 | 35 | import numpy as np
N = int(eval(input()))
print((N * (N - 1) // 2))
| N = int(eval(input()))
print((N * (N - 1) // 2))
| false | 33.333333 | [
"-import numpy as np",
"-"
] | false | 0.072816 | 0.035626 | 2.043875 | [
"s644506756",
"s424798866"
] |
u777283665 | p02947 | python | s547487707 | s653038542 | 703 | 462 | 62,168 | 17,848 | Accepted | Accepted | 34.28 | n = int(eval(input()))
d = dict()
for i in range(n):
s = "".join(sorted(list(eval(input()))))
d[s] = d.get(s, 0) + 1
count = 0
for i in list(d.items()):
count += (i[1] * (i[1] - 1)) // 2
print(count) | import math
n = int(eval(input()))
d = dict()
for _ in range(n):
s = "".join(sorted([x for x in eval(input())]))
d[s] = d.get(s, 0) + 1
ans = 0
for v in list(d.values()):
if v >= 2:
ans += (v * (v-1)) // 2
print(ans) | 14 | 16 | 205 | 238 | n = int(eval(input()))
d = dict()
for i in range(n):
s = "".join(sorted(list(eval(input()))))
d[s] = d.get(s, 0) + 1
count = 0
for i in list(d.items()):
count += (i[1] * (i[1] - 1)) // 2
print(count)
| import math
n = int(eval(input()))
d = dict()
for _ in range(n):
s = "".join(sorted([x for x in eval(input())]))
d[s] = d.get(s, 0) + 1
ans = 0
for v in list(d.values()):
if v >= 2:
ans += (v * (v - 1)) // 2
print(ans)
| false | 12.5 | [
"+import math",
"+",
"-for i in range(n):",
"- s = \"\".join(sorted(list(eval(input()))))",
"+for _ in range(n):",
"+ s = \"\".join(sorted([x for x in eval(input())]))",
"-count = 0",
"-for i in list(d.items()):",
"- count += (i[1] * (i[1] - 1)) // 2",
"-print(count)",
"+ans = 0",
"+for v in list(d.values()):",
"+ if v >= 2:",
"+ ans += (v * (v - 1)) // 2",
"+print(ans)"
] | false | 0.037058 | 0.03782 | 0.979858 | [
"s547487707",
"s653038542"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.