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
sequence | 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
sequence |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u037430802 | p03722 | python | s476952786 | s459119073 | 1,389 | 748 | 3,316 | 3,296 | Accepted | Accepted | 46.15 | N, M = list(map(int, input().split()))
es = [None] * M
for i in range(M):
a,b,c = list(map(int, input().split()))
es[i] = (a,b,c)
INF = float("inf")
d = [INF] * N # 頂点１からの最短距離
d[0] = 0
for i in range(N):
for f, t, c in es:
f, t = f-1, t-1
c = c * -1 # ここで負にしておくと最小経路を選んだ時に絶対値としては最大になるので最後にマイナスをかけて出せばよい
if d[f] != INF and d[t] > d[f] + c: # fromまで到達できる、かつ、toまでのコストがfromまでのコスト＋from->toのコストより大きいとき
d[t] = d[f] + c
if i == N-1 and t == N-1: #N回目の更新でそれでも頂点Nが更新された→負の閉路がある
print("inf")
exit()
print((-d[-1])) |
N, M = list(map(int, input().split()))
es = []
for i in range(M):
a,b,c = list(map(int, input().split()))
es.append((a-1, b-1, c))
INF = float("inf")
d = [INF] * N
d[0] = 0
"""
最大経路探索的な問題
よくあるベルマンフォード法なら、コストが正の値で、負の閉路が見つかったら失敗、という形で最小経路を求めることになる。
今回は最長経路なので、正の閉路が求まったら失敗にしたい。
なので
・コストを負の値でもつ。表示するときに正に変える
・コストを負にするので閉路を見つけられる
みたいな形にする
"""
def solve(start):
for i in range(N):
for a,b,c, in es:
if d[a] != INF and d[a] + (-c) < d[b]:
d[b] = d[a] + (-c)
# 最後まで確認しても更新されたら閉路あり
if i == N-1 and b == N-1:
return "inf"
return -1*d[-1]
print((solve(0))) | 22 | 34 | 606 | 676 | N, M = list(map(int, input().split()))
es = [None] * M
for i in range(M):
a, b, c = list(map(int, input().split()))
es[i] = (a, b, c)
INF = float("inf")
d = [INF] * N # 頂点１からの最短距離
d[0] = 0
for i in range(N):
for f, t, c in es:
f, t = f - 1, t - 1
c = c * -1 # ここで負にしておくと最小経路を選んだ時に絶対値としては最大になるので最後にマイナスをかけて出せばよい
if (
d[f] != INF and d[t] > d[f] + c
): # fromまで到達できる、かつ、toまでのコストがfromまでのコスト＋from->toのコストより大きいとき
d[t] = d[f] + c
if i == N - 1 and t == N - 1: # N回目の更新でそれでも頂点Nが更新された→負の閉路がある
print("inf")
exit()
print((-d[-1]))
| N, M = list(map(int, input().split()))
es = []
for i in range(M):
a, b, c = list(map(int, input().split()))
es.append((a - 1, b - 1, c))
INF = float("inf")
d = [INF] * N
d[0] = 0
"""
最大経路探索的な問題
よくあるベルマンフォード法なら、コストが正の値で、負の閉路が見つかったら失敗、という形で最小経路を求めることになる。
今回は最長経路なので、正の閉路が求まったら失敗にしたい。
なので
・コストを負の値でもつ。表示するときに正に変える
・コストを負にするので閉路を見つけられる
みたいな形にする
"""
def solve(start):
for i in range(N):
for (
a,
b,
c,
) in es:
if d[a] != INF and d[a] + (-c) < d[b]:
d[b] = d[a] + (-c)
# 最後まで確認しても更新されたら閉路あり
if i == N - 1 and b == N - 1:
return "inf"
return -1 * d[-1]
print((solve(0)))
| false | 35.294118 | [
"-es = [None] * M",
"+es = []",
"- es[i] = (a, b, c)",
"+ es.append((a - 1, b - 1, c))",
"-d = [INF] * N # 頂点１からの最短距離",
"+d = [INF] * N",
"-for i in range(N):",
"- for f, t, c in es:",
"- f, t = f - 1, t - 1",
"- c = c * -1 # ここで負にしておくと最小経路を選んだ時に絶対値としては最大になるので最後にマイナスをかけて出せばよい",
"- if (",
"- d[f] != INF and d[t] > d[f] + c",
"- ): # fromまで到達できる、かつ、toまでのコストがfromまでのコスト＋from->toのコストより大きいとき",
"- d[t] = d[f] + c",
"- if i == N - 1 and t == N - 1: # N回目の更新でそれでも頂点Nが更新された→負の閉路がある",
"- print(\"inf\")",
"- exit()",
"-print((-d[-1]))",
"+\"\"\"",
"+最大経路探索的な問題",
"+よくあるベルマンフォード法なら、コストが正の値で、負の閉路が見つかったら失敗、という形で最小経路を求めることになる。",
"+今回は最長経路なので、正の閉路が求まったら失敗にしたい。",
"+なので",
"+・コストを負の値でもつ。表示するときに正に変える",
"+・コストを負にするので閉路を見つけられる",
"+みたいな形にする",
"+\"\"\"",
"+",
"+",
"+def solve(start):",
"+ for i in range(N):",
"+ for (",
"+ a,",
"+ b,",
"+ c,",
"+ ) in es:",
"+ if d[a] != INF and d[a] + (-c) < d[b]:",
"+ d[b] = d[a] + (-c)",
"+ # 最後まで確認しても更新されたら閉路あり",
"+ if i == N - 1 and b == N - 1:",
"+ return \"inf\"",
"+ return -1 * d[-1]",
"+",
"+",
"+print((solve(0)))"
] | false | 0.035088 | 0.03454 | 1.015855 | [
"s476952786",
"s459119073"
] |
u148551245 | p03323 | python | s173508687 | s754739018 | 163 | 17 | 38,384 | 2,940 | Accepted | Accepted | 89.57 | (a, b) = list(map(int, input().split()))
if a <= 8 and b <= 8:
print("Yay!")
else:
print(":(") | a, b = list(map(int, input().split()))
if a <= 8 and b <= 8:
print("Yay!")
else:
print(":(") | 5 | 6 | 100 | 100 | (a, b) = list(map(int, input().split()))
if a <= 8 and b <= 8:
print("Yay!")
else:
print(":(")
| a, b = list(map(int, input().split()))
if a <= 8 and b <= 8:
print("Yay!")
else:
print(":(")
| false | 16.666667 | [
"-(a, b) = list(map(int, input().split()))",
"+a, b = list(map(int, input().split()))"
] | false | 0.068174 | 0.032017 | 2.129284 | [
"s173508687",
"s754739018"
] |
u864197622 | p02661 | python | s939771534 | s135451229 | 475 | 192 | 28,596 | 95,188 | Accepted | Accepted | 59.58 | N = int(eval(input()))
A, B = [], []
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
A, B = sorted(A), sorted(B)
m1 = A[N//2] + A[(N-1)//2]
m2 = B[N//2] + B[(N-1)//2]
print(((m2 - m1) // (N % 2 + 1) + 1)) | import sys
input = lambda: sys.stdin.readline().rstrip()
N = int(eval(input()))
A, B = [], []
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
A, B = sorted(A), sorted(B)
m1 = A[N//2] + A[(N-1)//2]
m2 = B[N//2] + B[(N-1)//2]
print(((m2 - m1) // (N % 2 + 1) + 1)) | 10 | 12 | 245 | 304 | N = int(eval(input()))
A, B = [], []
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
A, B = sorted(A), sorted(B)
m1 = A[N // 2] + A[(N - 1) // 2]
m2 = B[N // 2] + B[(N - 1) // 2]
print(((m2 - m1) // (N % 2 + 1) + 1))
| import sys
input = lambda: sys.stdin.readline().rstrip()
N = int(eval(input()))
A, B = [], []
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
A, B = sorted(A), sorted(B)
m1 = A[N // 2] + A[(N - 1) // 2]
m2 = B[N // 2] + B[(N - 1) // 2]
print(((m2 - m1) // (N % 2 + 1) + 1))
| false | 16.666667 | [
"+import sys",
"+",
"+input = lambda: sys.stdin.readline().rstrip()"
] | false | 0.041561 | 0.037516 | 1.107839 | [
"s939771534",
"s135451229"
] |
u416011173 | p02552 | python | s143618328 | s827518865 | 29 | 26 | 9,008 | 9,172 | Accepted | Accepted | 10.34 | # -*- coding: utf-8 -*-
# 標準入力を取得
x = int(eval(input()))
# 求解処理
ans = int()
if x == 0:
ans = 1
else:
ans = 0
# 結果出力
print(ans)
| # -*- coding: utf-8 -*-
def get_input() -> int:
"""
標準入力を取得する.
Returns:\n
int: 標準入力
"""
x = int(eval(input()))
return x
def main(x: int) -> None:
"""
メイン処理.
Args:\n
x (int): 整数(0 <= x <= 1)
"""
# 求解処理
ans = 1 - x
# 結果出力
print(ans)
if __name__ == "__main__":
# 標準入力を取得
x = get_input()
# メイン処理
main(x)
| 13 | 34 | 143 | 425 | # -*- coding: utf-8 -*-
# 標準入力を取得
x = int(eval(input()))
# 求解処理
ans = int()
if x == 0:
ans = 1
else:
ans = 0
# 結果出力
print(ans)
| # -*- coding: utf-8 -*-
def get_input() -> int:
"""
標準入力を取得する.
Returns:\n
int: 標準入力
"""
x = int(eval(input()))
return x
def main(x: int) -> None:
"""
メイン処理.
Args:\n
x (int): 整数(0 <= x <= 1)
"""
# 求解処理
ans = 1 - x
# 結果出力
print(ans)
if __name__ == "__main__":
# 標準入力を取得
x = get_input()
# メイン処理
main(x)
| false | 61.764706 | [
"-# 標準入力を取得",
"-x = int(eval(input()))",
"-# 求解処理",
"-ans = int()",
"-if x == 0:",
"- ans = 1",
"-else:",
"- ans = 0",
"-# 結果出力",
"-print(ans)",
"+def get_input() -> int:",
"+ \"\"\"",
"+ 標準入力を取得する.",
"+ Returns:\\n",
"+ int: 標準入力",
"+ \"\"\"",
"+ x = int(eval(input()))",
"+ return x",
"+",
"+",
"+def main(x: int) -> None:",
"+ \"\"\"",
"+ メイン処理.",
"+ Args:\\n",
"+ x (int): 整数(0 <= x <= 1)",
"+ \"\"\"",
"+ # 求解処理",
"+ ans = 1 - x",
"+ # 結果出力",
"+ print(ans)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ # 標準入力を取得",
"+ x = get_input()",
"+ # メイン処理",
"+ main(x)"
] | false | 0.043836 | 0.041664 | 1.052146 | [
"s143618328",
"s827518865"
] |
u133936772 | p02802 | python | s093701673 | s548403861 | 536 | 307 | 51,800 | 12,652 | Accepted | Accepted | 42.72 | n, m = list(map(int, input().split()))
lac = [0] * n
lwa = [0] * n
for i in range(m):
p, s = input().split()
p = int(p) - 1
if lac[p] == 0:
if s == 'WA':
lwa[p] += 1
if s == 'AC':
lac[p] = 1
lwa = [x * y for x, y in zip(lac, lwa)]
print((sum(lac), sum(lwa))) | n, m = list(map(int, input().split()))
lac = set()
lwa = [0] * n
ac = 0
wa = 0
for i in range(m):
p, s = input().split()
p = int(p) - 1
if p in lac:
continue
if s == 'AC':
lac.add(p)
ac += 1
wa += lwa[p]
if s == 'WA':
lwa[p] += 1
print((ac, wa)) | 16 | 20 | 320 | 319 | n, m = list(map(int, input().split()))
lac = [0] * n
lwa = [0] * n
for i in range(m):
p, s = input().split()
p = int(p) - 1
if lac[p] == 0:
if s == "WA":
lwa[p] += 1
if s == "AC":
lac[p] = 1
lwa = [x * y for x, y in zip(lac, lwa)]
print((sum(lac), sum(lwa)))
| n, m = list(map(int, input().split()))
lac = set()
lwa = [0] * n
ac = 0
wa = 0
for i in range(m):
p, s = input().split()
p = int(p) - 1
if p in lac:
continue
if s == "AC":
lac.add(p)
ac += 1
wa += lwa[p]
if s == "WA":
lwa[p] += 1
print((ac, wa))
| false | 20 | [
"-lac = [0] * n",
"+lac = set()",
"+ac = 0",
"+wa = 0",
"- if lac[p] == 0:",
"- if s == \"WA\":",
"- lwa[p] += 1",
"- if s == \"AC\":",
"- lac[p] = 1",
"-lwa = [x * y for x, y in zip(lac, lwa)]",
"-print((sum(lac), sum(lwa)))",
"+ if p in lac:",
"+ continue",
"+ if s == \"AC\":",
"+ lac.add(p)",
"+ ac += 1",
"+ wa += lwa[p]",
"+ if s == \"WA\":",
"+ lwa[p] += 1",
"+print((ac, wa))"
] | false | 0.048984 | 0.037839 | 1.294509 | [
"s093701673",
"s548403861"
] |
u357751375 | p02597 | python | s188428385 | s892390510 | 39 | 32 | 11,916 | 12,000 | Accepted | Accepted | 17.95 | n = int(eval(input()))
c = list(eval(input()))
r = c.count('R')
r2 = c[:r].count('R')
print((r - r2)) | n = int(eval(input()))
c = list(eval(input()))
r = c.count('R')
print((c[:r].count('W'))) | 5 | 4 | 91 | 78 | n = int(eval(input()))
c = list(eval(input()))
r = c.count("R")
r2 = c[:r].count("R")
print((r - r2))
| n = int(eval(input()))
c = list(eval(input()))
r = c.count("R")
print((c[:r].count("W")))
| false | 20 | [
"-r2 = c[:r].count(\"R\")",
"-print((r - r2))",
"+print((c[:r].count(\"W\")))"
] | false | 0.159828 | 0.117513 | 1.360091 | [
"s188428385",
"s892390510"
] |
u968404618 | p02725 | python | s717642501 | s226838891 | 140 | 128 | 26,444 | 32,280 | Accepted | Accepted | 8.57 | import sys
input = lambda: sys.stdin.readline().rstrip()
k, n = list(map(int, input().split()))
A = list(map(int, input().split()))
A.append(A[0]+k)
l = 0
for i in range(n):
l = max(l, A[i+1]-A[i])
ans = k - l
print(ans) | k, n = list(map(int, input().split()))
A = list(map(int, input().split()))
A.append(A[0]+k)
l = 0
for i in range(n):
l = max(l, A[i+1]-A[i])
ans = k - l
print(ans) | 12 | 9 | 231 | 170 | import sys
input = lambda: sys.stdin.readline().rstrip()
k, n = list(map(int, input().split()))
A = list(map(int, input().split()))
A.append(A[0] + k)
l = 0
for i in range(n):
l = max(l, A[i + 1] - A[i])
ans = k - l
print(ans)
| k, n = list(map(int, input().split()))
A = list(map(int, input().split()))
A.append(A[0] + k)
l = 0
for i in range(n):
l = max(l, A[i + 1] - A[i])
ans = k - l
print(ans)
| false | 25 | [
"-import sys",
"-",
"-input = lambda: sys.stdin.readline().rstrip()"
] | false | 0.034887 | 0.039939 | 0.87349 | [
"s717642501",
"s226838891"
] |
u893063840 | p02624 | python | s684078254 | s362414228 | 2,872 | 556 | 302,308 | 109,156 | Accepted | Accepted | 80.64 | import numpy as np
from numba import njit, int64
n = int(eval(input()))
@njit(int64(int64))
def f(n):
cnt = np.zeros(n + 1, np.int16)
for i in range(1, n + 1):
cnt[i::i] += 1
return (cnt * np.arange(n + 1)).sum()
ans = f(n)
print(ans)
| from numba import njit
n = int(eval(input()))
@njit
def f(n):
ret = 0
for i in range(1, n + 1):
for j in range(i, n + 1, i):
ret += j
return ret
ans = f(n)
print(ans)
| 17 | 17 | 271 | 215 | import numpy as np
from numba import njit, int64
n = int(eval(input()))
@njit(int64(int64))
def f(n):
cnt = np.zeros(n + 1, np.int16)
for i in range(1, n + 1):
cnt[i::i] += 1
return (cnt * np.arange(n + 1)).sum()
ans = f(n)
print(ans)
| from numba import njit
n = int(eval(input()))
@njit
def f(n):
ret = 0
for i in range(1, n + 1):
for j in range(i, n + 1, i):
ret += j
return ret
ans = f(n)
print(ans)
| false | 0 | [
"-import numpy as np",
"-from numba import njit, int64",
"+from numba import njit",
"-@njit(int64(int64))",
"+@njit",
"- cnt = np.zeros(n + 1, np.int16)",
"+ ret = 0",
"- cnt[i::i] += 1",
"- return (cnt * np.arange(n + 1)).sum()",
"+ for j in range(i, n + 1, i):",
"+ ret += j",
"+ return ret"
] | false | 0.171051 | 0.033731 | 5.071095 | [
"s684078254",
"s362414228"
] |
u173148629 | p02791 | python | s728844598 | s775852688 | 150 | 106 | 24,744 | 24,744 | Accepted | Accepted | 29.33 | N=int(eval(input()))
P=list(map(int,input().split()))
m=P[0]
c=0
for i in range(N):
if P[i]<=m:
c+=1
m=min(m,P[i])
print(c) | N=int(eval(input()))
P=list(map(int,input().split()))
m=P[0]
c=0
for i in range(N):
if P[i]<=m:
c+=1
m=P[i]
print(c) | 11 | 11 | 139 | 134 | N = int(eval(input()))
P = list(map(int, input().split()))
m = P[0]
c = 0
for i in range(N):
if P[i] <= m:
c += 1
m = min(m, P[i])
print(c)
| N = int(eval(input()))
P = list(map(int, input().split()))
m = P[0]
c = 0
for i in range(N):
if P[i] <= m:
c += 1
m = P[i]
print(c)
| false | 0 | [
"- m = min(m, P[i])",
"+ m = P[i]"
] | false | 0.061897 | 0.007223 | 8.569296 | [
"s728844598",
"s775852688"
] |
u645250356 | p02695 | python | s339734469 | s819728257 | 686 | 239 | 25,808 | 113,188 | Accepted | Accepted | 65.16 | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
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()))
def cal(x):
rr = 0
for i in range(Q):
a,b,c,d = query[i]
if x[b] - x[a] == c:
rr += d
return rr
n,m,Q = inpl()
q = deque()
q.append([1])
query = []
for _ in range(Q):
query.append(inpl())
res = 0
while q:
now = q.popleft()
if len(now) == n+1:
res = max(res, cal(now))
continue
for i in range(now[-1],m+1):
tmp = now + [i]
q.append(tmp)
print(res) | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,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,m,q = inpl()
abc = [inpl() for _ in range(q)]
q = deque()
q.append([1])
res = 0
while q:
now = q.popleft()
if len(now) == n+1:
# print(now)
ans = 0
for i,x in enumerate(abc):
a,b,c,d = x
if now[b] - now[a] == c:
ans += d
res = max(ans, res)
continue
for i in range(now[-1], m+1):
q.append(now + [i])
print(res)
| 34 | 29 | 820 | 756 | from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
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()))
def cal(x):
rr = 0
for i in range(Q):
a, b, c, d = query[i]
if x[b] - x[a] == c:
rr += d
return rr
n, m, Q = inpl()
q = deque()
q.append([1])
query = []
for _ in range(Q):
query.append(inpl())
res = 0
while q:
now = q.popleft()
if len(now) == n + 1:
res = max(res, cal(now))
continue
for i in range(now[-1], m + 1):
tmp = now + [i]
q.append(tmp)
print(res)
| from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
import sys, bisect, 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, m, q = inpl()
abc = [inpl() for _ in range(q)]
q = deque()
q.append([1])
res = 0
while q:
now = q.popleft()
if len(now) == n + 1:
# print(now)
ans = 0
for i, x in enumerate(abc):
a, b, c, d = x
if now[b] - now[a] == c:
ans += d
res = max(ans, res)
continue
for i in range(now[-1], m + 1):
q.append(now + [i])
print(res)
| false | 14.705882 | [
"-from bisect import bisect_left, bisect_right",
"-import sys, math, itertools, fractions, pprint",
"+import sys, bisect, math, itertools, fractions, pprint",
"-def cal(x):",
"- rr = 0",
"- for i in range(Q):",
"- a, b, c, d = query[i]",
"- if x[b] - x[a] == c:",
"- rr += d",
"- return rr",
"-",
"-",
"-n, m, Q = inpl()",
"+n, m, q = inpl()",
"+abc = [inpl() for _ in range(q)]",
"-query = []",
"-for _ in range(Q):",
"- query.append(inpl())",
"- res = max(res, cal(now))",
"+ # print(now)",
"+ ans = 0",
"+ for i, x in enumerate(abc):",
"+ a, b, c, d = x",
"+ if now[b] - now[a] == c:",
"+ ans += d",
"+ res = max(ans, res)",
"- tmp = now + [i]",
"- q.append(tmp)",
"+ q.append(now + [i])"
] | false | 0.220997 | 0.1673 | 1.320961 | [
"s339734469",
"s819728257"
] |
u391331433 | p03254 | python | s921571029 | s902912480 | 15 | 12 | 3,052 | 2,928 | Accepted | Accepted | 20 | import sys
from collections import deque
import copy
from math import *
def get_read_func(fileobject):
if fileobject == None :
return raw_input
else:
return fileobject.readline
def main():
if len(sys.argv) > 1:
f = open(sys.argv[1])
else:
f = None
read_func = get_read_func(f);
input_raw = read_func().strip().split()
[N, x] = [int(input_raw[0]), int(input_raw[1])]
A = []
A_dic = {}
input_raw = read_func().strip().split()
for i in range(N):
a = int(input_raw[i])
A.append(a)
if a in A_dic:
A_dic[a] += 1
else:
A_dic[a] = 1
A.sort()
max_count = 0
for i in range(N):
count = 0
x_tmp = x
for j in range(i, N):
if x_tmp - A[j] >= 0:
if j < N - 1:
count += 1
else:
if x_tmp == A[j]:
count += 1
x_tmp -= A[j]
#if x_tmp == 0:
max_count = max(max_count, count)
print(max_count)
if __name__ == '__main__':
main()
| import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
if fileobject == None :
return raw_input
else:
return fileobject.readline
def main():
if len(sys.argv) > 1:
f = open(sys.argv[1])
else:
f = None
read_func = get_read_func(f);
input_raw = read_func().strip().split()
[N, x] = [int(input_raw[0]), int(input_raw[1])]
input_raw = read_func().strip().split()
A = []
for i in range(N):
A.append(int(input_raw[i]))
A.sort()
for i in range(len(A)):
x -= A[i]
if x == 0:
print(i + 1)
return
if x < 0:
print(i)
return
print(len(A) - 1)
if __name__ == '__main__':
main() | 54 | 41 | 1,179 | 817 | import sys
from collections import deque
import copy
from math import *
def get_read_func(fileobject):
if fileobject == None:
return raw_input
else:
return fileobject.readline
def main():
if len(sys.argv) > 1:
f = open(sys.argv[1])
else:
f = None
read_func = get_read_func(f)
input_raw = read_func().strip().split()
[N, x] = [int(input_raw[0]), int(input_raw[1])]
A = []
A_dic = {}
input_raw = read_func().strip().split()
for i in range(N):
a = int(input_raw[i])
A.append(a)
if a in A_dic:
A_dic[a] += 1
else:
A_dic[a] = 1
A.sort()
max_count = 0
for i in range(N):
count = 0
x_tmp = x
for j in range(i, N):
if x_tmp - A[j] >= 0:
if j < N - 1:
count += 1
else:
if x_tmp == A[j]:
count += 1
x_tmp -= A[j]
# if x_tmp == 0:
max_count = max(max_count, count)
print(max_count)
if __name__ == "__main__":
main()
| import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
if fileobject == None:
return raw_input
else:
return fileobject.readline
def main():
if len(sys.argv) > 1:
f = open(sys.argv[1])
else:
f = None
read_func = get_read_func(f)
input_raw = read_func().strip().split()
[N, x] = [int(input_raw[0]), int(input_raw[1])]
input_raw = read_func().strip().split()
A = []
for i in range(N):
A.append(int(input_raw[i]))
A.sort()
for i in range(len(A)):
x -= A[i]
if x == 0:
print(i + 1)
return
if x < 0:
print(i)
return
print(len(A) - 1)
if __name__ == "__main__":
main()
| false | 24.074074 | [
"-from math import *",
"+import math",
"+ input_raw = read_func().strip().split()",
"- A_dic = {}",
"- input_raw = read_func().strip().split()",
"- a = int(input_raw[i])",
"- A.append(a)",
"- if a in A_dic:",
"- A_dic[a] += 1",
"- else:",
"- A_dic[a] = 1",
"+ A.append(int(input_raw[i]))",
"- max_count = 0",
"- for i in range(N):",
"- count = 0",
"- x_tmp = x",
"- for j in range(i, N):",
"- if x_tmp - A[j] >= 0:",
"- if j < N - 1:",
"- count += 1",
"- else:",
"- if x_tmp == A[j]:",
"- count += 1",
"- x_tmp -= A[j]",
"- # if x_tmp == 0:",
"- max_count = max(max_count, count)",
"- print(max_count)",
"+ for i in range(len(A)):",
"+ x -= A[i]",
"+ if x == 0:",
"+ print(i + 1)",
"+ return",
"+ if x < 0:",
"+ print(i)",
"+ return",
"+ print(len(A) - 1)"
] | false | 0.047242 | 0.039701 | 1.189964 | [
"s921571029",
"s902912480"
] |
u133936772 | p02609 | python | s015559065 | s071208550 | 637 | 488 | 9,416 | 12,508 | Accepted | Accepted | 23.39 | n=int(eval(input()))
x=eval(input())
t=int(x,2)
c=x.count('1')
a=t%-~c
b=0 if c<2 else t%~-c
for i in range(n):
if int(x[i]):
if c<2: print((0)); continue
else: t=(b-pow(2,n-i-1,c-1))%~-c
else: t=(a+pow(2,n-i-1,c+1))%-~c
z=1
while t:
d=bin(t).count('1')
t%=d
z+=1
print(z) | n=int(eval(input()))
x=eval(input())
t=int(x,2)
c=x.count('1')
from functools import lru_cache
@lru_cache(None)
def f(x):
if x==0: return 0
return f(x%bin(x).count('1'))+1
a=t%-~c
b=0 if c<2 else t%~-c
for i in range(n):
if int(x[i]):
d=c-1
if d<1: print((0))
else: print((f((b-pow(2,n-i-1,d))%d)+1))
else:
d=c+1
print((f((a+pow(2,n-i-1,d))%d)+1)) | 17 | 19 | 304 | 375 | n = int(eval(input()))
x = eval(input())
t = int(x, 2)
c = x.count("1")
a = t % -~c
b = 0 if c < 2 else t % ~-c
for i in range(n):
if int(x[i]):
if c < 2:
print((0))
continue
else:
t = (b - pow(2, n - i - 1, c - 1)) % ~-c
else:
t = (a + pow(2, n - i - 1, c + 1)) % -~c
z = 1
while t:
d = bin(t).count("1")
t %= d
z += 1
print(z)
| n = int(eval(input()))
x = eval(input())
t = int(x, 2)
c = x.count("1")
from functools import lru_cache
@lru_cache(None)
def f(x):
if x == 0:
return 0
return f(x % bin(x).count("1")) + 1
a = t % -~c
b = 0 if c < 2 else t % ~-c
for i in range(n):
if int(x[i]):
d = c - 1
if d < 1:
print((0))
else:
print((f((b - pow(2, n - i - 1, d)) % d) + 1))
else:
d = c + 1
print((f((a + pow(2, n - i - 1, d)) % d) + 1))
| false | 10.526316 | [
"+from functools import lru_cache",
"+",
"+",
"+@lru_cache(None)",
"+def f(x):",
"+ if x == 0:",
"+ return 0",
"+ return f(x % bin(x).count(\"1\")) + 1",
"+",
"+",
"- if c < 2:",
"+ d = c - 1",
"+ if d < 1:",
"- continue",
"- t = (b - pow(2, n - i - 1, c - 1)) % ~-c",
"+ print((f((b - pow(2, n - i - 1, d)) % d) + 1))",
"- t = (a + pow(2, n - i - 1, c + 1)) % -~c",
"- z = 1",
"- while t:",
"- d = bin(t).count(\"1\")",
"- t %= d",
"- z += 1",
"- print(z)",
"+ d = c + 1",
"+ print((f((a + pow(2, n - i - 1, d)) % d) + 1))"
] | false | 0.078869 | 0.038036 | 2.073548 | [
"s015559065",
"s071208550"
] |
u227020436 | p03261 | python | s937509930 | s638907427 | 21 | 17 | 3,064 | 3,064 | Accepted | Accepted | 19.05 | N = int(eval(input()))
W = []
for i in range(N):
w = eval(input())
W.append(w)
bag = set(W)
zipped = [(W[i-1], W[i]) for i in range(1, len(W))]
valid = len(bag) == len(W) and all(p[-1] == q[0] for p, q in zipped)
print(('Yes' if valid else 'No')) | N = int(input())
w = [input() for _ in range(N)]
bigram = [(w[i-1], w[i]) for i in range(1, len(w))]
valid = len(set(w)) == len(w) and \
all(a[-1] == b[0] for a, b in bigram)
print('Yes' if valid else 'No')
| 11 | 8 | 252 | 225 | N = int(eval(input()))
W = []
for i in range(N):
w = eval(input())
W.append(w)
bag = set(W)
zipped = [(W[i - 1], W[i]) for i in range(1, len(W))]
valid = len(bag) == len(W) and all(p[-1] == q[0] for p, q in zipped)
print(("Yes" if valid else "No"))
| N = int(input())
w = [input() for _ in range(N)]
bigram = [(w[i - 1], w[i]) for i in range(1, len(w))]
valid = len(set(w)) == len(w) and all(a[-1] == b[0] for a, b in bigram)
print("Yes" if valid else "No")
| false | 27.272727 | [
"-N = int(eval(input()))",
"-W = []",
"-for i in range(N):",
"- w = eval(input())",
"- W.append(w)",
"-bag = set(W)",
"-zipped = [(W[i - 1], W[i]) for i in range(1, len(W))]",
"-valid = len(bag) == len(W) and all(p[-1] == q[0] for p, q in zipped)",
"-print((\"Yes\" if valid else \"No\"))",
"+N = int(input())",
"+w = [input() for _ in range(N)]",
"+bigram = [(w[i - 1], w[i]) for i in range(1, len(w))]",
"+valid = len(set(w)) == len(w) and all(a[-1] == b[0] for a, b in bigram)",
"+print(\"Yes\" if valid else \"No\")"
] | false | 0.06998 | 0.053561 | 1.306544 | [
"s937509930",
"s638907427"
] |
u405660020 | p03608 | python | s391295660 | s845248654 | 268 | 190 | 75,328 | 79,172 | Accepted | Accepted | 29.1 | n, m, r = list(map(int, input().split())) # n:頂点数 w:辺の数
r_list = list(map(int, input().split()))
graph = [[float('inf')]*n for i in range(n)]
for _ in range(m):
u, v, w = list(map(int, input().split()))
graph[u-1][v-1] = w
graph[v-1][u-1] = w
for i in range(n):
graph[i][i] = 0
def warshall_floyd(d):
# d[i][j] : i から j への最短距離
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j], d[i][k]+d[k][j])
return d
from itertools import permutations
adj_m=warshall_floyd(graph)
ans=float('inf')
for path in permutations(r_list):
tmp_dist=0
for i in range(r-1):
tmp_dist+=adj_m[path[i]-1][path[i+1]-1]
ans=min(ans, tmp_dist)
print(ans)
| from collections import defaultdict
from itertools import permutations
import heapq
INF = float('inf')
N, M, R = list(map(int, input().split()))
r = list(map(int, input().split()))
Adj_list = defaultdict(set)
for i in range(M):
a, b, c = list(map(int, input().split()))
Adj_list[a-1].add((b-1, c))
Adj_list[b-1].add((a-1, c))
def dijkstra(x, vertex):
d = [INF] * x
d[vertex] = 0
hq = [(0, vertex)]
while hq:
u = heapq.heappop(hq)[1]
for (v, c) in Adj_list[u]:
if d[v] > d[u] + c:
d[v] = d[u] + c
heapq.heappush(hq, (d[u]+c, v))
return d
ans = INF
t_dis = 0
table = {}
for i in r:
table[i-1] = dijkstra(N, i-1)
for each in permutations(r):
t_dis = 0
for i in range(R-1):
t_dis += table[each[i]-1][each[i+1]-1]
ans = min(ans, t_dis)
print(ans) | 29 | 45 | 758 | 908 | n, m, r = list(map(int, input().split())) # n:頂点数 w:辺の数
r_list = list(map(int, input().split()))
graph = [[float("inf")] * n for i in range(n)]
for _ in range(m):
u, v, w = list(map(int, input().split()))
graph[u - 1][v - 1] = w
graph[v - 1][u - 1] = w
for i in range(n):
graph[i][i] = 0
def warshall_floyd(d):
# d[i][j] : i から j への最短距離
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j], d[i][k] + d[k][j])
return d
from itertools import permutations
adj_m = warshall_floyd(graph)
ans = float("inf")
for path in permutations(r_list):
tmp_dist = 0
for i in range(r - 1):
tmp_dist += adj_m[path[i] - 1][path[i + 1] - 1]
ans = min(ans, tmp_dist)
print(ans)
| from collections import defaultdict
from itertools import permutations
import heapq
INF = float("inf")
N, M, R = list(map(int, input().split()))
r = list(map(int, input().split()))
Adj_list = defaultdict(set)
for i in range(M):
a, b, c = list(map(int, input().split()))
Adj_list[a - 1].add((b - 1, c))
Adj_list[b - 1].add((a - 1, c))
def dijkstra(x, vertex):
d = [INF] * x
d[vertex] = 0
hq = [(0, vertex)]
while hq:
u = heapq.heappop(hq)[1]
for (v, c) in Adj_list[u]:
if d[v] > d[u] + c:
d[v] = d[u] + c
heapq.heappush(hq, (d[u] + c, v))
return d
ans = INF
t_dis = 0
table = {}
for i in r:
table[i - 1] = dijkstra(N, i - 1)
for each in permutations(r):
t_dis = 0
for i in range(R - 1):
t_dis += table[each[i] - 1][each[i + 1] - 1]
ans = min(ans, t_dis)
print(ans)
| false | 35.555556 | [
"-n, m, r = list(map(int, input().split())) # n:頂点数 w:辺の数",
"-r_list = list(map(int, input().split()))",
"-graph = [[float(\"inf\")] * n for i in range(n)]",
"-for _ in range(m):",
"- u, v, w = list(map(int, input().split()))",
"- graph[u - 1][v - 1] = w",
"- graph[v - 1][u - 1] = w",
"-for i in range(n):",
"- graph[i][i] = 0",
"+from collections import defaultdict",
"+from itertools import permutations",
"+import heapq",
"+",
"+INF = float(\"inf\")",
"+N, M, R = list(map(int, input().split()))",
"+r = list(map(int, input().split()))",
"+Adj_list = defaultdict(set)",
"+for i in range(M):",
"+ a, b, c = list(map(int, input().split()))",
"+ Adj_list[a - 1].add((b - 1, c))",
"+ Adj_list[b - 1].add((a - 1, c))",
"-def warshall_floyd(d):",
"- # d[i][j] : i から j への最短距離",
"- for k in range(n):",
"- for i in range(n):",
"- for j in range(n):",
"- d[i][j] = min(d[i][j], d[i][k] + d[k][j])",
"+def dijkstra(x, vertex):",
"+ d = [INF] * x",
"+ d[vertex] = 0",
"+ hq = [(0, vertex)]",
"+ while hq:",
"+ u = heapq.heappop(hq)[1]",
"+ for (v, c) in Adj_list[u]:",
"+ if d[v] > d[u] + c:",
"+ d[v] = d[u] + c",
"+ heapq.heappush(hq, (d[u] + c, v))",
"-from itertools import permutations",
"-",
"-adj_m = warshall_floyd(graph)",
"-ans = float(\"inf\")",
"-for path in permutations(r_list):",
"- tmp_dist = 0",
"- for i in range(r - 1):",
"- tmp_dist += adj_m[path[i] - 1][path[i + 1] - 1]",
"- ans = min(ans, tmp_dist)",
"+ans = INF",
"+t_dis = 0",
"+table = {}",
"+for i in r:",
"+ table[i - 1] = dijkstra(N, i - 1)",
"+for each in permutations(r):",
"+ t_dis = 0",
"+ for i in range(R - 1):",
"+ t_dis += table[each[i] - 1][each[i + 1] - 1]",
"+ ans = min(ans, t_dis)"
] | false | 0.106947 | 0.043919 | 2.435098 | [
"s391295660",
"s845248654"
] |
u671060652 | p03076 | python | s963266152 | s546328597 | 265 | 66 | 64,108 | 62,040 | Accepted | Accepted | 75.09 | import itertools
import math
import fractions
import functools
import copy
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
original = [a,b,c,d,e]
sum = 0
minimum = 10
index = 0
for i in range(len(original)):
if original[i] % 10 != 0:
sum += original[i]//10 * 10 + 10
if original[i]%10 < minimum:
index = i
minimum = original[i]%10
else:
sum += original[i]
if minimum != 10:
print((sum-(original[index]//10 * 10 + 10)+original[index]))
else: print((a+b+c+d+e)) | def main():
# s = int(input())
# n, k = map(int, input().split())
# h = list(map(int, input().split()))
# s = input()
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
total = 0
li = [a, b, c, d, e]
mini = 10**10
ans_idx = 0
for i, s in enumerate(li):
last_s = int(str(s)[-1])
if mini > last_s and last_s != 0:
mini = last_s
ans_idx = i
for i, s in enumerate(li):
if i != ans_idx:
if s % 10 != 0:
total += s // 10 * 10 + 10
else:
total += s
else:
total += s
print(total)
if __name__ == '__main__':
main()
| 27 | 36 | 580 | 773 | import itertools
import math
import fractions
import functools
import copy
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
original = [a, b, c, d, e]
sum = 0
minimum = 10
index = 0
for i in range(len(original)):
if original[i] % 10 != 0:
sum += original[i] // 10 * 10 + 10
if original[i] % 10 < minimum:
index = i
minimum = original[i] % 10
else:
sum += original[i]
if minimum != 10:
print((sum - (original[index] // 10 * 10 + 10) + original[index]))
else:
print((a + b + c + d + e))
| def main():
# s = int(input())
# n, k = map(int, input().split())
# h = list(map(int, input().split()))
# s = input()
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
total = 0
li = [a, b, c, d, e]
mini = 10**10
ans_idx = 0
for i, s in enumerate(li):
last_s = int(str(s)[-1])
if mini > last_s and last_s != 0:
mini = last_s
ans_idx = i
for i, s in enumerate(li):
if i != ans_idx:
if s % 10 != 0:
total += s // 10 * 10 + 10
else:
total += s
else:
total += s
print(total)
if __name__ == "__main__":
main()
| false | 25 | [
"-import itertools",
"-import math",
"-import fractions",
"-import functools",
"-import copy",
"+def main():",
"+ # s = int(input())",
"+ # n, k = map(int, input().split())",
"+ # h = list(map(int, input().split()))",
"+ # s = input()",
"+ a = int(eval(input()))",
"+ b = int(eval(input()))",
"+ c = int(eval(input()))",
"+ d = int(eval(input()))",
"+ e = int(eval(input()))",
"+ total = 0",
"+ li = [a, b, c, d, e]",
"+ mini = 10**10",
"+ ans_idx = 0",
"+ for i, s in enumerate(li):",
"+ last_s = int(str(s)[-1])",
"+ if mini > last_s and last_s != 0:",
"+ mini = last_s",
"+ ans_idx = i",
"+ for i, s in enumerate(li):",
"+ if i != ans_idx:",
"+ if s % 10 != 0:",
"+ total += s // 10 * 10 + 10",
"+ else:",
"+ total += s",
"+ else:",
"+ total += s",
"+ print(total)",
"-a = int(eval(input()))",
"-b = int(eval(input()))",
"-c = int(eval(input()))",
"-d = int(eval(input()))",
"-e = int(eval(input()))",
"-original = [a, b, c, d, e]",
"-sum = 0",
"-minimum = 10",
"-index = 0",
"-for i in range(len(original)):",
"- if original[i] % 10 != 0:",
"- sum += original[i] // 10 * 10 + 10",
"- if original[i] % 10 < minimum:",
"- index = i",
"- minimum = original[i] % 10",
"- else:",
"- sum += original[i]",
"-if minimum != 10:",
"- print((sum - (original[index] // 10 * 10 + 10) + original[index]))",
"-else:",
"- print((a + b + c + d + e))",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false | 0.047629 | 0.04036 | 1.180114 | [
"s963266152",
"s546328597"
] |
u910295650 | p02983 | python | s712179541 | s504494192 | 844 | 645 | 3,060 | 2,940 | Accepted | Accepted | 23.58 | L,R=list(map(int,input().split()))
ans=2020
if R-L>=2019:
ans=0
else:
for i in range(L,R+1):
for j in range(i+1,R+1):
a=(i*j)%2019
ans=min(ans,a)
print(ans) | L,R=list(map(int,input().split()))
if R-L>=2019:
minimum=0
else:
left,right=L%2019,R%2019
minimum=2018**2
for i in range(left,right+1):
for j in range(i+1,right+1):
minimum=min(minimum,i*j%2019)
print(minimum) | 10 | 10 | 199 | 248 | L, R = list(map(int, input().split()))
ans = 2020
if R - L >= 2019:
ans = 0
else:
for i in range(L, R + 1):
for j in range(i + 1, R + 1):
a = (i * j) % 2019
ans = min(ans, a)
print(ans)
| L, R = list(map(int, input().split()))
if R - L >= 2019:
minimum = 0
else:
left, right = L % 2019, R % 2019
minimum = 2018**2
for i in range(left, right + 1):
for j in range(i + 1, right + 1):
minimum = min(minimum, i * j % 2019)
print(minimum)
| false | 0 | [
"-ans = 2020",
"- ans = 0",
"+ minimum = 0",
"- for i in range(L, R + 1):",
"- for j in range(i + 1, R + 1):",
"- a = (i * j) % 2019",
"- ans = min(ans, a)",
"-print(ans)",
"+ left, right = L % 2019, R % 2019",
"+ minimum = 2018**2",
"+ for i in range(left, right + 1):",
"+ for j in range(i + 1, right + 1):",
"+ minimum = min(minimum, i * j % 2019)",
"+print(minimum)"
] | false | 0.054283 | 0.045292 | 1.198515 | [
"s712179541",
"s504494192"
] |
u562935282 | p03033 | python | s877531838 | s342667724 | 1,846 | 1,210 | 142,988 | 59,140 | Accepted | Accepted | 34.45 | class BIT:
def __init__(self, N):
self.tree = [0] * (N + 1) # 1-indexed
self.N = N
def add(self, i, x):
"""tree[i]と関連個所にxを加える"""
tree = self.tree
N = self.N
while i <= N:
tree[i] += x
i += i & (-i)
def sum(self, i):
tree = self.tree
s = 0
while i:
s += tree[i]
i -= i & (-i)
return s
def binary_search(self, x):
"""区間和 >=x となる最小のindex"""
tree = self.tree
N = self.N
i = 0
step = 1 << (N.bit_length() - 1)
while step:
if i + step <= N and tree[i + step] < x:
i += step
x -= tree[i]
step >>= 1
return i + 1
def main():
from collections import deque, namedtuple
from operator import attrgetter
import sys
input = sys.stdin.readline
Event = namedtuple('Event', 'time position')
N, Q = map(int, input().split())
go = []
stop = []
xs = set()
for _ in range(N):
s, t, x = map(int, input().split())
stop.append(Event(time=s - x, position=x))
go.append(Event(time=t - x, position=x))
xs.add(x)
xs = sorted(xs)
stop.sort(key=attrgetter('time'))
go.sort(key=attrgetter('time'))
stop = deque(stop)
go = deque(go)
compress = {x: i for i, x in enumerate(xs, 1)}
decompress = {i: x for i, x in enumerate(xs, 1)}
ans = []
b = BIT(N)
for _ in range(Q):
d = int(input())
while go and go[0].time <= d:
e = go.popleft()
p = compress[e.position]
b.add(p, -1)
while stop and stop[0].time <= d:
e = stop.popleft()
p = compress[e.position]
b.add(p, 1)
compressed_ind = b.binary_search(1)
ind = decompress.get(compressed_ind, -1)
ans.append(ind)
print(*ans, sep='\n')
if __name__ == '__main__':
main()
| def main():
from bisect import bisect_left
from collections import namedtuple
from operator import attrgetter
import sys
input = sys.stdin.readline
Event = namedtuple('Event', 'pos start end')
N, Q = map(int, input().split())
events = []
for _ in range(N):
s, t, x = map(int, input().split())
e = Event(pos=x, start=s - x, end=t - x) # 時間[s-x,t-x)にpos=0にいるとpos=xで工事中
events.append(e)
events.sort(key=attrgetter('pos'))
D = [int(input()) for _ in range(Q)]
ans = [-1] * Q
see = [-1] * Q
for e in events:
left = bisect_left(D, e.start)
right = bisect_left(D, e.end)
# Dの要素で index が [left,right) 内のものは e.pos で工事中
# e.pos 昇順ソートしているので, ans[idx] には工事中の最小のposが入る
idx = left
while idx < right:
if ~ans[idx]:
idx = see[idx]
continue
ans[idx] = e.pos
see[idx] = right
idx += 1
print(*ans, sep='\n')
if __name__ == '__main__':
main()
| 87 | 41 | 2,077 | 1,100 | class BIT:
def __init__(self, N):
self.tree = [0] * (N + 1) # 1-indexed
self.N = N
def add(self, i, x):
"""tree[i]と関連個所にxを加える"""
tree = self.tree
N = self.N
while i <= N:
tree[i] += x
i += i & (-i)
def sum(self, i):
tree = self.tree
s = 0
while i:
s += tree[i]
i -= i & (-i)
return s
def binary_search(self, x):
"""区間和 >=x となる最小のindex"""
tree = self.tree
N = self.N
i = 0
step = 1 << (N.bit_length() - 1)
while step:
if i + step <= N and tree[i + step] < x:
i += step
x -= tree[i]
step >>= 1
return i + 1
def main():
from collections import deque, namedtuple
from operator import attrgetter
import sys
input = sys.stdin.readline
Event = namedtuple("Event", "time position")
N, Q = map(int, input().split())
go = []
stop = []
xs = set()
for _ in range(N):
s, t, x = map(int, input().split())
stop.append(Event(time=s - x, position=x))
go.append(Event(time=t - x, position=x))
xs.add(x)
xs = sorted(xs)
stop.sort(key=attrgetter("time"))
go.sort(key=attrgetter("time"))
stop = deque(stop)
go = deque(go)
compress = {x: i for i, x in enumerate(xs, 1)}
decompress = {i: x for i, x in enumerate(xs, 1)}
ans = []
b = BIT(N)
for _ in range(Q):
d = int(input())
while go and go[0].time <= d:
e = go.popleft()
p = compress[e.position]
b.add(p, -1)
while stop and stop[0].time <= d:
e = stop.popleft()
p = compress[e.position]
b.add(p, 1)
compressed_ind = b.binary_search(1)
ind = decompress.get(compressed_ind, -1)
ans.append(ind)
print(*ans, sep="\n")
if __name__ == "__main__":
main()
| def main():
from bisect import bisect_left
from collections import namedtuple
from operator import attrgetter
import sys
input = sys.stdin.readline
Event = namedtuple("Event", "pos start end")
N, Q = map(int, input().split())
events = []
for _ in range(N):
s, t, x = map(int, input().split())
e = Event(pos=x, start=s - x, end=t - x) # 時間[s-x,t-x)にpos=0にいるとpos=xで工事中
events.append(e)
events.sort(key=attrgetter("pos"))
D = [int(input()) for _ in range(Q)]
ans = [-1] * Q
see = [-1] * Q
for e in events:
left = bisect_left(D, e.start)
right = bisect_left(D, e.end)
# Dの要素で index が [left,right) 内のものは e.pos で工事中
# e.pos 昇順ソートしているので, ans[idx] には工事中の最小のposが入る
idx = left
while idx < right:
if ~ans[idx]:
idx = see[idx]
continue
ans[idx] = e.pos
see[idx] = right
idx += 1
print(*ans, sep="\n")
if __name__ == "__main__":
main()
| false | 52.873563 | [
"-class BIT:",
"- def __init__(self, N):",
"- self.tree = [0] * (N + 1) # 1-indexed",
"- self.N = N",
"-",
"- def add(self, i, x):",
"- \"\"\"tree[i]と関連個所にxを加える\"\"\"",
"- tree = self.tree",
"- N = self.N",
"- while i <= N:",
"- tree[i] += x",
"- i += i & (-i)",
"-",
"- def sum(self, i):",
"- tree = self.tree",
"- s = 0",
"- while i:",
"- s += tree[i]",
"- i -= i & (-i)",
"- return s",
"-",
"- def binary_search(self, x):",
"- \"\"\"区間和 >=x となる最小のindex\"\"\"",
"- tree = self.tree",
"- N = self.N",
"- i = 0",
"- step = 1 << (N.bit_length() - 1)",
"- while step:",
"- if i + step <= N and tree[i + step] < x:",
"- i += step",
"- x -= tree[i]",
"- step >>= 1",
"- return i + 1",
"-",
"-",
"- from collections import deque, namedtuple",
"+ from bisect import bisect_left",
"+ from collections import namedtuple",
"- Event = namedtuple(\"Event\", \"time position\")",
"+ Event = namedtuple(\"Event\", \"pos start end\")",
"- go = []",
"- stop = []",
"- xs = set()",
"+ events = []",
"- stop.append(Event(time=s - x, position=x))",
"- go.append(Event(time=t - x, position=x))",
"- xs.add(x)",
"- xs = sorted(xs)",
"- stop.sort(key=attrgetter(\"time\"))",
"- go.sort(key=attrgetter(\"time\"))",
"- stop = deque(stop)",
"- go = deque(go)",
"- compress = {x: i for i, x in enumerate(xs, 1)}",
"- decompress = {i: x for i, x in enumerate(xs, 1)}",
"- ans = []",
"- b = BIT(N)",
"- for _ in range(Q):",
"- d = int(input())",
"- while go and go[0].time <= d:",
"- e = go.popleft()",
"- p = compress[e.position]",
"- b.add(p, -1)",
"- while stop and stop[0].time <= d:",
"- e = stop.popleft()",
"- p = compress[e.position]",
"- b.add(p, 1)",
"- compressed_ind = b.binary_search(1)",
"- ind = decompress.get(compressed_ind, -1)",
"- ans.append(ind)",
"+ e = Event(pos=x, start=s - x, end=t - x) # 時間[s-x,t-x)にpos=0にいるとpos=xで工事中",
"+ events.append(e)",
"+ events.sort(key=attrgetter(\"pos\"))",
"+ D = [int(input()) for _ in range(Q)]",
"+ ans = [-1] * Q",
"+ see = [-1] * Q",
"+ for e in events:",
"+ left = bisect_left(D, e.start)",
"+ right = bisect_left(D, e.end)",
"+ # Dの要素で index が [left,right) 内のものは e.pos で工事中",
"+ # e.pos 昇順ソートしているので, ans[idx] には工事中の最小のposが入る",
"+ idx = left",
"+ while idx < right:",
"+ if ~ans[idx]:",
"+ idx = see[idx]",
"+ continue",
"+ ans[idx] = e.pos",
"+ see[idx] = right",
"+ idx += 1"
] | false | 0.038747 | 0.080432 | 0.481734 | [
"s877531838",
"s342667724"
] |
u699296734 | p02552 | python | s454099209 | s765435306 | 32 | 29 | 9,072 | 9,008 | Accepted | Accepted | 9.38 | x = int(eval(input()))
a = [1, 0]
print((a[x]))
| x = int(eval(input()))
print((1 - x))
| 3 | 2 | 42 | 31 | x = int(eval(input()))
a = [1, 0]
print((a[x]))
| x = int(eval(input()))
print((1 - x))
| false | 33.333333 | [
"-a = [1, 0]",
"-print((a[x]))",
"+print((1 - x))"
] | false | 0.107805 | 0.04813 | 2.239876 | [
"s454099209",
"s765435306"
] |
u512212329 | p02615 | python | s715894583 | s904020699 | 154 | 125 | 32,760 | 31,436 | Accepted | Accepted | 18.83 | from collections import deque
def main():
eval(input()) # n
array = [int(x) for x in input().split()]
array.sort()
coming = deque(array)
edges = deque()
noob = coming.pop()
edges.append(noob)
ans = 0
while coming:
ans += edges.popleft()
noob = coming.pop()
edges.append(noob)
edges.append(noob)
print(ans)
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
friendliness = [int(x) for x in input().split()]
friendliness.sort(reverse=True)
ans = 0
for i in range(1, n):
ans += friendliness[i // 2]
print(ans)
if __name__ == '__main__':
main()
| 23 | 12 | 438 | 262 | from collections import deque
def main():
eval(input()) # n
array = [int(x) for x in input().split()]
array.sort()
coming = deque(array)
edges = deque()
noob = coming.pop()
edges.append(noob)
ans = 0
while coming:
ans += edges.popleft()
noob = coming.pop()
edges.append(noob)
edges.append(noob)
print(ans)
if __name__ == "__main__":
main()
| def main():
n = int(eval(input()))
friendliness = [int(x) for x in input().split()]
friendliness.sort(reverse=True)
ans = 0
for i in range(1, n):
ans += friendliness[i // 2]
print(ans)
if __name__ == "__main__":
main()
| false | 47.826087 | [
"-from collections import deque",
"-",
"-",
"- eval(input()) # n",
"- array = [int(x) for x in input().split()]",
"- array.sort()",
"- coming = deque(array)",
"- edges = deque()",
"- noob = coming.pop()",
"- edges.append(noob)",
"+ n = int(eval(input()))",
"+ friendliness = [int(x) for x in input().split()]",
"+ friendliness.sort(reverse=True)",
"- while coming:",
"- ans += edges.popleft()",
"- noob = coming.pop()",
"- edges.append(noob)",
"- edges.append(noob)",
"+ for i in range(1, n):",
"+ ans += friendliness[i // 2]"
] | false | 0.128756 | 0.120802 | 1.06584 | [
"s715894583",
"s904020699"
] |
u604774382 | p02397 | python | s309368767 | s736640264 | 40 | 20 | 6,720 | 4,192 | Accepted | Accepted | 50 | import sys
while True:
xy=sys.stdin.readline()
nums=xy.split( ' ' )
for i in range( len( nums) ):
nums[i] = int( nums[i] )
if nums[0] == 0 and nums[1] == 0:
break
else:
if nums[1] < nums[0]:
t=nums[0]
nums[0]=nums[1]
nums[1]=t
print(( "{} {}".format( nums[0], nums[1] ) )) | import sys
while True:
nums = [ int( val ) for val in sys.stdin.readline().split( " " ) ]
if 0 == nums[0] and 0 == nums[1]:
break
else:
nums.sort()
print(( "{} {}".format( nums[0], nums[1] ) )) | 15 | 9 | 307 | 209 | import sys
while True:
xy = sys.stdin.readline()
nums = xy.split(" ")
for i in range(len(nums)):
nums[i] = int(nums[i])
if nums[0] == 0 and nums[1] == 0:
break
else:
if nums[1] < nums[0]:
t = nums[0]
nums[0] = nums[1]
nums[1] = t
print(("{} {}".format(nums[0], nums[1])))
| import sys
while True:
nums = [int(val) for val in sys.stdin.readline().split(" ")]
if 0 == nums[0] and 0 == nums[1]:
break
else:
nums.sort()
print(("{} {}".format(nums[0], nums[1])))
| false | 40 | [
"- xy = sys.stdin.readline()",
"- nums = xy.split(\" \")",
"- for i in range(len(nums)):",
"- nums[i] = int(nums[i])",
"- if nums[0] == 0 and nums[1] == 0:",
"+ nums = [int(val) for val in sys.stdin.readline().split(\" \")]",
"+ if 0 == nums[0] and 0 == nums[1]:",
"- if nums[1] < nums[0]:",
"- t = nums[0]",
"- nums[0] = nums[1]",
"- nums[1] = t",
"+ nums.sort()"
] | false | 0.036244 | 0.041861 | 0.865838 | [
"s309368767",
"s736640264"
] |
u936985471 | p03026 | python | s681953314 | s871822101 | 76 | 68 | 6,292 | 11,952 | Accepted | Accepted | 10.53 | # スタート地点からDFSで大きい順に入れていけば、最も大きい数以外は得点を得られる
N = int(eval(input()))
E = [[] for i in range(N)]
for i in range(N-1):
a,b = list(map(int,input().split()))
E[a-1].append(b-1)
E[b-1].append(a-1)
# 得点を大きい順に並べる
C = sorted(list(map(int,input().split())))[::-1]
ans = [-1 for i in range(N)] # -1は未訪問
point = sum(C[1:])
from collections import deque
q = deque([])
q.append(0)
ind = 0
while q:
v = q.popleft()
if ans[v] != -1:
# 訪問済み
continue
ans[v] = C[ind]
ind += 1
if ind == len(C):
break
children = E[v]
for child in children:
q.append(child)
print(point)
print((*ans)) | import sys
readline = sys.stdin.readline
N = int(readline())
G = [[] for i in range(N)]
for i in range(N - 1):
a,b = list(map(int,readline().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
C = list(map(int,readline().split()))
def get_farest(x):
dist = [-1] * N
stack = [(x,-1,0)]
while stack:
v,parent,c = stack.pop()
if dist[v] != -1:
continue
dist[v] = c
for child in G[v]:
if child == parent:
continue
stack.append([child, v, c + 1])
maxv = -1
maxi = -1
for i in range(len(dist)):
if dist[i] > maxv:
maxv = dist[i]
maxi = i
return maxi
f = get_farest(0)
start = get_farest(f)
C = sorted(C, reverse = True)
from collections import deque
q = deque([])
q.append([start, -1])
ind = 0
ans = [None] * N
while q:
v,parent = q.popleft()
ans[v] = C[ind]
ind += 1
for child in G[v]:
if child == parent:
continue
q.append([child, v])
print((sum(C[1:])))
print((*ans)) | 34 | 53 | 625 | 1,021 | # スタート地点からDFSで大きい順に入れていけば、最も大きい数以外は得点を得られる
N = int(eval(input()))
E = [[] for i in range(N)]
for i in range(N - 1):
a, b = list(map(int, input().split()))
E[a - 1].append(b - 1)
E[b - 1].append(a - 1)
# 得点を大きい順に並べる
C = sorted(list(map(int, input().split())))[::-1]
ans = [-1 for i in range(N)] # -1は未訪問
point = sum(C[1:])
from collections import deque
q = deque([])
q.append(0)
ind = 0
while q:
v = q.popleft()
if ans[v] != -1:
# 訪問済み
continue
ans[v] = C[ind]
ind += 1
if ind == len(C):
break
children = E[v]
for child in children:
q.append(child)
print(point)
print((*ans))
| import sys
readline = sys.stdin.readline
N = int(readline())
G = [[] for i in range(N)]
for i in range(N - 1):
a, b = list(map(int, readline().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
C = list(map(int, readline().split()))
def get_farest(x):
dist = [-1] * N
stack = [(x, -1, 0)]
while stack:
v, parent, c = stack.pop()
if dist[v] != -1:
continue
dist[v] = c
for child in G[v]:
if child == parent:
continue
stack.append([child, v, c + 1])
maxv = -1
maxi = -1
for i in range(len(dist)):
if dist[i] > maxv:
maxv = dist[i]
maxi = i
return maxi
f = get_farest(0)
start = get_farest(f)
C = sorted(C, reverse=True)
from collections import deque
q = deque([])
q.append([start, -1])
ind = 0
ans = [None] * N
while q:
v, parent = q.popleft()
ans[v] = C[ind]
ind += 1
for child in G[v]:
if child == parent:
continue
q.append([child, v])
print((sum(C[1:])))
print((*ans))
| false | 35.849057 | [
"-# スタート地点からDFSで大きい順に入れていけば、最も大きい数以外は得点を得られる",
"-N = int(eval(input()))",
"-E = [[] for i in range(N)]",
"+import sys",
"+",
"+readline = sys.stdin.readline",
"+N = int(readline())",
"+G = [[] for i in range(N)]",
"- a, b = list(map(int, input().split()))",
"- E[a - 1].append(b - 1)",
"- E[b - 1].append(a - 1)",
"-# 得点を大きい順に並べる",
"-C = sorted(list(map(int, input().split())))[::-1]",
"-ans = [-1 for i in range(N)] # -1は未訪問",
"-point = sum(C[1:])",
"+ a, b = list(map(int, readline().split()))",
"+ G[a - 1].append(b - 1)",
"+ G[b - 1].append(a - 1)",
"+C = list(map(int, readline().split()))",
"+",
"+",
"+def get_farest(x):",
"+ dist = [-1] * N",
"+ stack = [(x, -1, 0)]",
"+ while stack:",
"+ v, parent, c = stack.pop()",
"+ if dist[v] != -1:",
"+ continue",
"+ dist[v] = c",
"+ for child in G[v]:",
"+ if child == parent:",
"+ continue",
"+ stack.append([child, v, c + 1])",
"+ maxv = -1",
"+ maxi = -1",
"+ for i in range(len(dist)):",
"+ if dist[i] > maxv:",
"+ maxv = dist[i]",
"+ maxi = i",
"+ return maxi",
"+",
"+",
"+f = get_farest(0)",
"+start = get_farest(f)",
"+C = sorted(C, reverse=True)",
"-q.append(0)",
"+q.append([start, -1])",
"+ans = [None] * N",
"- v = q.popleft()",
"- if ans[v] != -1:",
"- # 訪問済み",
"- continue",
"+ v, parent = q.popleft()",
"- if ind == len(C):",
"- break",
"- children = E[v]",
"- for child in children:",
"- q.append(child)",
"-print(point)",
"+ for child in G[v]:",
"+ if child == parent:",
"+ continue",
"+ q.append([child, v])",
"+print((sum(C[1:])))"
] | false | 0.042705 | 0.071669 | 0.595871 | [
"s681953314",
"s871822101"
] |
u352394527 | p00483 | python | s694891369 | s041170486 | 3,860 | 2,820 | 195,724 | 195,744 | Accepted | Accepted | 26.94 | 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()
| 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)]
dic = {"J":0, "O":1, "I":2}
for i in range(1, m + 1):
dpi = dp[i]
dpi_1 = dp[i - 1]
for j in range(1, n + 1):
dpij = dpi[j]
dpij_1 = dpi[j - 1]
dpi_1j = dpi_1[j]
dpi_1j_1 = dpi_1[j - 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]
dpij[p] = dpij_1[p] + dpi_1j[p] - dpi_1j_1[p]
#dp[i][j][mp[i - 1][j - 1]] += 1
dpij[dic[mp[i - 1][j - 1]]] += 1
for i in range(k):
x1,y1,x2,y2 = list(map(int,input().split()))
dpx2 = dp[x2]
dpx1 = dp[x1 - 1]
dpx2y2 = dpx2[y2]
dpx2y1 = dpx2[y1 - 1]
dpx1y2 = dpx1[y2]
dpx1y1 = dpx1[y1 - 1]
#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])
print((dpx2y2[0] - dpx1y2[0] - dpx2y1[0] + dpx1y1[0], dpx2y2[1] - dpx1y2[1] - dpx2y1[1] + dpx1y1[1], dpx2y2[2] - dpx1y2[2] - dpx2y1[2] + dpx1y1[2]))
solve()
| 19 | 36 | 819 | 1,279 | 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()
| 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)]
dic = {"J": 0, "O": 1, "I": 2}
for i in range(1, m + 1):
dpi = dp[i]
dpi_1 = dp[i - 1]
for j in range(1, n + 1):
dpij = dpi[j]
dpij_1 = dpi[j - 1]
dpi_1j = dpi_1[j]
dpi_1j_1 = dpi_1[j - 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]
dpij[p] = dpij_1[p] + dpi_1j[p] - dpi_1j_1[p]
# dp[i][j][mp[i - 1][j - 1]] += 1
dpij[dic[mp[i - 1][j - 1]]] += 1
for i in range(k):
x1, y1, x2, y2 = list(map(int, input().split()))
dpx2 = dp[x2]
dpx1 = dp[x1 - 1]
dpx2y2 = dpx2[y2]
dpx2y1 = dpx2[y1 - 1]
dpx1y2 = dpx1[y2]
dpx1y1 = dpx1[y1 - 1]
# 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])
print(
(
dpx2y2[0] - dpx1y2[0] - dpx2y1[0] + dpx1y1[0],
dpx2y2[1] - dpx1y2[1] - dpx2y1[1] + dpx1y1[1],
dpx2y2[2] - dpx1y2[2] - dpx2y1[2] + dpx1y1[2],
)
)
solve()
| false | 47.222222 | [
"+ dic = {\"J\": 0, \"O\": 1, \"I\": 2}",
"+ dpi = dp[i]",
"+ dpi_1 = dp[i - 1]",
"+ dpij = dpi[j]",
"+ dpij_1 = dpi[j - 1]",
"+ dpi_1j = dpi_1[j]",
"+ dpi_1j_1 = dpi_1[j - 1]",
"- 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",
"+ # dp[i][j][p] = dp[i][j - 1][p] + dp[i - 1][j][p] - dp[i - 1][j - 1][p]",
"+ dpij[p] = dpij_1[p] + dpi_1j[p] - dpi_1j_1[p]",
"+ # dp[i][j][mp[i - 1][j - 1]] += 1",
"+ dpij[dic[mp[i - 1][j - 1]]] += 1",
"+ dpx2 = dp[x2]",
"+ dpx1 = dp[x1 - 1]",
"+ dpx2y2 = dpx2[y2]",
"+ dpx2y1 = dpx2[y1 - 1]",
"+ dpx1y2 = dpx1[y2]",
"+ dpx1y1 = dpx1[y1 - 1]",
"+ # 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])",
"- 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],",
"+ dpx2y2[0] - dpx1y2[0] - dpx2y1[0] + dpx1y1[0],",
"+ dpx2y2[1] - dpx1y2[1] - dpx2y1[1] + dpx1y1[1],",
"+ dpx2y2[2] - dpx1y2[2] - dpx2y1[2] + dpx1y1[2],"
] | false | 0.095479 | 0.057902 | 1.648974 | [
"s694891369",
"s041170486"
] |
u562935282 | p02994 | python | s886412008 | s026969363 | 175 | 18 | 38,256 | 2,940 | Accepted | Accepted | 89.71 | inf = float('inf')
N, L = list(map(int, input().split()))
s = 0
eat = inf
for i in range(L, L + N):
if abs(i) < abs(eat):
eat = i
s += i
print((s - eat))
| def main():
N, L = list(map(int, input().split()))
e = sorted((x + L for x in range(N)), key=lambda x: abs(x))
ans = N * L + (N - 1) * N // 2 - e[0]
print(ans)
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
| 13 | 19 | 178 | 363 | inf = float("inf")
N, L = list(map(int, input().split()))
s = 0
eat = inf
for i in range(L, L + N):
if abs(i) < abs(eat):
eat = i
s += i
print((s - eat))
| def main():
N, L = list(map(int, input().split()))
e = sorted((x + L for x in range(N)), key=lambda x: abs(x))
ans = N * L + (N - 1) * N // 2 - e[0]
print(ans)
if __name__ == "__main__":
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
| false | 31.578947 | [
"-inf = float(\"inf\")",
"-N, L = list(map(int, input().split()))",
"-s = 0",
"-eat = inf",
"-for i in range(L, L + N):",
"- if abs(i) < abs(eat):",
"- eat = i",
"- s += i",
"-print((s - eat))",
"+def main():",
"+ N, L = list(map(int, input().split()))",
"+ e = sorted((x + L for x in range(N)), key=lambda x: abs(x))",
"+ ans = N * L + (N - 1) * N // 2 - e[0]",
"+ print(ans)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()",
"+# import sys",
"+#",
"+# sys.setrecursionlimit(10 ** 7)",
"+#",
"+# input = sys.stdin.readline",
"+# rstrip()",
"+# int(input())",
"+# map(int, input().split())"
] | false | 0.089313 | 0.042754 | 2.089007 | [
"s886412008",
"s026969363"
] |
u433380437 | p03289 | python | s964768080 | s796989077 | 71 | 64 | 61,688 | 61,656 | Accepted | Accepted | 9.86 | S=str(eval(input()))
cnt=0
for i in range(2,len(S)-1):
if S[i] =='C':
cnt+=1
if cnt==1:
if S[0]=='A':
T = S.replace("C","").replace("A","")
if T.islower():
print("AC")
exit()
print("WA") | S=str(eval(input()))
cnt=0
T = S.replace("C","").replace("A","")
for i in range(2,len(S)-1):
if S[i] =='C':cnt+=1
if cnt==1 and S[0]=='A' and T.islower():
print("AC")
exit()
print("WA") | 12 | 9 | 247 | 199 | S = str(eval(input()))
cnt = 0
for i in range(2, len(S) - 1):
if S[i] == "C":
cnt += 1
if cnt == 1:
if S[0] == "A":
T = S.replace("C", "").replace("A", "")
if T.islower():
print("AC")
exit()
print("WA")
| S = str(eval(input()))
cnt = 0
T = S.replace("C", "").replace("A", "")
for i in range(2, len(S) - 1):
if S[i] == "C":
cnt += 1
if cnt == 1 and S[0] == "A" and T.islower():
print("AC")
exit()
print("WA")
| false | 25 | [
"+T = S.replace(\"C\", \"\").replace(\"A\", \"\")",
"-if cnt == 1:",
"- if S[0] == \"A\":",
"- T = S.replace(\"C\", \"\").replace(\"A\", \"\")",
"- if T.islower():",
"- print(\"AC\")",
"- exit()",
"+if cnt == 1 and S[0] == \"A\" and T.islower():",
"+ print(\"AC\")",
"+ exit()"
] | false | 0.036939 | 0.043495 | 0.849279 | [
"s964768080",
"s796989077"
] |
u994521204 | p03599 | python | s255855162 | s467382824 | 931 | 215 | 109,548 | 42,224 | Accepted | Accepted | 76.91 | a, b, c, d, e, f = list(map(int, input().split()))
kouho = []
for i in range(f // (100 * a) + 1):
for j in range(f // (100 * b) + 1):
water = 100 * (a * i + b * j)
if water > f:
break
if water == 0:
continue
sugar_max = (a * i + b * j) * e
for k in range(sugar_max // c + 1):
for l in range(sugar_max // d + 1):
sugar = c * k + d * l
if water + sugar > f:
break
if sugar > sugar_max:
break
density = (sugar / (water + sugar), water + sugar, sugar)
kouho.append(density)
kouho.sort(reverse=True)
print((kouho[0][1], kouho[0][2]))
| a, b, c, d, e, f = list(map(int, input().split()))
kouho = 0
jisho = {}
max_a = 30 // a
max_b = 30 // b
for i in range(max_a + 1):
for j in range(max_b + 1):
water = (a * i + b * j) * 100
if water == 0:
continue
lim1 = e * (a * i + b * j)
lim2 = f - water
lim = min(lim1, lim2)
max_c = lim // c
max_d = lim // d
for k in range(max_c + 1):
for m in range(max_d + 1):
sugar = k * c + m * d
if sugar > lim:
continue
satoumizu = water + sugar
if satoumizu > f:
continue
if sugar == 0:
continue
noudo = 100 * sugar / satoumizu
if noudo > kouho:
kouho = noudo
jisho[noudo] = (sugar, satoumizu)
if kouho == 0:
print((100 * a, 0))
exit()
ans2, ans1 = jisho[kouho]
print((ans1, ans2))
| 21 | 35 | 741 | 1,013 | a, b, c, d, e, f = list(map(int, input().split()))
kouho = []
for i in range(f // (100 * a) + 1):
for j in range(f // (100 * b) + 1):
water = 100 * (a * i + b * j)
if water > f:
break
if water == 0:
continue
sugar_max = (a * i + b * j) * e
for k in range(sugar_max // c + 1):
for l in range(sugar_max // d + 1):
sugar = c * k + d * l
if water + sugar > f:
break
if sugar > sugar_max:
break
density = (sugar / (water + sugar), water + sugar, sugar)
kouho.append(density)
kouho.sort(reverse=True)
print((kouho[0][1], kouho[0][2]))
| a, b, c, d, e, f = list(map(int, input().split()))
kouho = 0
jisho = {}
max_a = 30 // a
max_b = 30 // b
for i in range(max_a + 1):
for j in range(max_b + 1):
water = (a * i + b * j) * 100
if water == 0:
continue
lim1 = e * (a * i + b * j)
lim2 = f - water
lim = min(lim1, lim2)
max_c = lim // c
max_d = lim // d
for k in range(max_c + 1):
for m in range(max_d + 1):
sugar = k * c + m * d
if sugar > lim:
continue
satoumizu = water + sugar
if satoumizu > f:
continue
if sugar == 0:
continue
noudo = 100 * sugar / satoumizu
if noudo > kouho:
kouho = noudo
jisho[noudo] = (sugar, satoumizu)
if kouho == 0:
print((100 * a, 0))
exit()
ans2, ans1 = jisho[kouho]
print((ans1, ans2))
| false | 40 | [
"-kouho = []",
"-for i in range(f // (100 * a) + 1):",
"- for j in range(f // (100 * b) + 1):",
"- water = 100 * (a * i + b * j)",
"- if water > f:",
"- break",
"+kouho = 0",
"+jisho = {}",
"+max_a = 30 // a",
"+max_b = 30 // b",
"+for i in range(max_a + 1):",
"+ for j in range(max_b + 1):",
"+ water = (a * i + b * j) * 100",
"- sugar_max = (a * i + b * j) * e",
"- for k in range(sugar_max // c + 1):",
"- for l in range(sugar_max // d + 1):",
"- sugar = c * k + d * l",
"- if water + sugar > f:",
"- break",
"- if sugar > sugar_max:",
"- break",
"- density = (sugar / (water + sugar), water + sugar, sugar)",
"- kouho.append(density)",
"-kouho.sort(reverse=True)",
"-print((kouho[0][1], kouho[0][2]))",
"+ lim1 = e * (a * i + b * j)",
"+ lim2 = f - water",
"+ lim = min(lim1, lim2)",
"+ max_c = lim // c",
"+ max_d = lim // d",
"+ for k in range(max_c + 1):",
"+ for m in range(max_d + 1):",
"+ sugar = k * c + m * d",
"+ if sugar > lim:",
"+ continue",
"+ satoumizu = water + sugar",
"+ if satoumizu > f:",
"+ continue",
"+ if sugar == 0:",
"+ continue",
"+ noudo = 100 * sugar / satoumizu",
"+ if noudo > kouho:",
"+ kouho = noudo",
"+ jisho[noudo] = (sugar, satoumizu)",
"+if kouho == 0:",
"+ print((100 * a, 0))",
"+ exit()",
"+ans2, ans1 = jisho[kouho]",
"+print((ans1, ans2))"
] | false | 0.712333 | 0.319123 | 2.232157 | [
"s255855162",
"s467382824"
] |
u844789719 | p02571 | python | s031358771 | s529570805 | 51 | 41 | 9,060 | 8,964 | Accepted | Accepted | 19.61 | S = eval(input())
T = eval(input())
ans = float('inf')
for i2 in range(len(S)):
if i2 + len(T) > len(S):
break
ans = min(ans, sum(S[i1] != T[i1 - i2] for i1 in range(i2, i2 + len(T))))
print(ans)
| S = eval(input())
T = eval(input())
ans = float('inf')
for start in range(len(S) - len(T) + 1):
ans = min(ans, sum(s != t for s, t in zip(S[start:], T)))
print(ans)
| 8 | 6 | 207 | 162 | S = eval(input())
T = eval(input())
ans = float("inf")
for i2 in range(len(S)):
if i2 + len(T) > len(S):
break
ans = min(ans, sum(S[i1] != T[i1 - i2] for i1 in range(i2, i2 + len(T))))
print(ans)
| S = eval(input())
T = eval(input())
ans = float("inf")
for start in range(len(S) - len(T) + 1):
ans = min(ans, sum(s != t for s, t in zip(S[start:], T)))
print(ans)
| false | 25 | [
"-for i2 in range(len(S)):",
"- if i2 + len(T) > len(S):",
"- break",
"- ans = min(ans, sum(S[i1] != T[i1 - i2] for i1 in range(i2, i2 + len(T))))",
"+for start in range(len(S) - len(T) + 1):",
"+ ans = min(ans, sum(s != t for s, t in zip(S[start:], T)))"
] | false | 0.039276 | 0.045411 | 0.864892 | [
"s031358771",
"s529570805"
] |
u597455618 | p02983 | python | s810116065 | s658008600 | 51 | 17 | 3,060 | 3,060 | Accepted | Accepted | 66.67 | l, r = list(map(int, input().split()))
m = 2019
if r - l >= 673:
print((0))
else:
ans = 2018
l = l%m
r = r%m
for i in range(l, r):
for j in range(i+1, r+1):
ans = min(ans, (i*j)%m)
print(ans) | l, r = list(map(int, input().split()))
m = 2019
if r - l >= 673:
print((0))
else:
ans = 2018
for i in range(l, r):
for j in range(i+1, r+1):
ans = min(ans, (i*j)%m)
if ans <= 2:
break
print(ans) | 12 | 12 | 238 | 253 | l, r = list(map(int, input().split()))
m = 2019
if r - l >= 673:
print((0))
else:
ans = 2018
l = l % m
r = r % m
for i in range(l, r):
for j in range(i + 1, r + 1):
ans = min(ans, (i * j) % m)
print(ans)
| l, r = list(map(int, input().split()))
m = 2019
if r - l >= 673:
print((0))
else:
ans = 2018
for i in range(l, r):
for j in range(i + 1, r + 1):
ans = min(ans, (i * j) % m)
if ans <= 2:
break
print(ans)
| false | 0 | [
"- l = l % m",
"- r = r % m",
"+ if ans <= 2:",
"+ break"
] | false | 0.036507 | 0.045023 | 0.810855 | [
"s810116065",
"s658008600"
] |
u345966487 | p02882 | python | s223590386 | s600901656 | 23 | 17 | 3,572 | 3,060 | Accepted | Accepted | 26.09 | #!/usr/bin/env python3
import sys
import math
sys.setrecursionlimit(10 ** 8)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a, b, x = list(map(int, readline().split()))
xda2 = x / (a * a)
def check1(rad):
return a * math.tan(rad) <= (b - xda2) * 2
def check2(rad):
return a * b * b >= x * math.tan(rad) * 2
def solve():
check = check1 if 2 * x > a * a * b else check2
ok, ng = 0.0, math.pi / 2.0
eps = 1e-12
while ng - ok > eps:
m = (ng + ok) / 2.0
if check(m):
ok = m
else:
ng = m
return ok
if __name__ == "__main__":
print((solve() / math.pi * 180.0))
| #!/usr/bin/env python3
import sys
import math
sys.setrecursionlimit(10 ** 8)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a, b, x = list(map(int, readline().split()))
def solve():
if 2 * x > a * a * b:
return math.atan(2.0 * (b / a - x / (a * a * a)))
else:
return math.atan(0.5 * a * b * b / x)
if __name__ == "__main__":
print((solve() / math.pi * 180.0))
| 36 | 21 | 729 | 464 | #!/usr/bin/env python3
import sys
import math
sys.setrecursionlimit(10**8)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a, b, x = list(map(int, readline().split()))
xda2 = x / (a * a)
def check1(rad):
return a * math.tan(rad) <= (b - xda2) * 2
def check2(rad):
return a * b * b >= x * math.tan(rad) * 2
def solve():
check = check1 if 2 * x > a * a * b else check2
ok, ng = 0.0, math.pi / 2.0
eps = 1e-12
while ng - ok > eps:
m = (ng + ok) / 2.0
if check(m):
ok = m
else:
ng = m
return ok
if __name__ == "__main__":
print((solve() / math.pi * 180.0))
| #!/usr/bin/env python3
import sys
import math
sys.setrecursionlimit(10**8)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a, b, x = list(map(int, readline().split()))
def solve():
if 2 * x > a * a * b:
return math.atan(2.0 * (b / a - x / (a * a * a)))
else:
return math.atan(0.5 * a * b * b / x)
if __name__ == "__main__":
print((solve() / math.pi * 180.0))
| false | 41.666667 | [
"-xda2 = x / (a * a)",
"-",
"-",
"-def check1(rad):",
"- return a * math.tan(rad) <= (b - xda2) * 2",
"-",
"-",
"-def check2(rad):",
"- return a * b * b >= x * math.tan(rad) * 2",
"- check = check1 if 2 * x > a * a * b else check2",
"- ok, ng = 0.0, math.pi / 2.0",
"- eps = 1e-12",
"- while ng - ok > eps:",
"- m = (ng + ok) / 2.0",
"- if check(m):",
"- ok = m",
"- else:",
"- ng = m",
"- return ok",
"+ if 2 * x > a * a * b:",
"+ return math.atan(2.0 * (b / a - x / (a * a * a)))",
"+ else:",
"+ return math.atan(0.5 * a * b * b / x)"
] | false | 0.078829 | 0.111852 | 0.704759 | [
"s223590386",
"s600901656"
] |
u440566786 | p03045 | python | s498236579 | s228179276 | 638 | 369 | 69,592 | 64,304 | Accepted | Accepted | 42.16 | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
class UnionFind(object):
def __init__(self,n):
self.__par=list(range(n))
self.__rank=[0]*n
self.__size=[1]*n
self.__connected=n
def root(self,k):
if(self.__par[k]==k): return k
self.__par[k]=self.root(self.__par[k])
return self.__par[k]
def unite(self,i,j):
i=self.root(i); j=self.root(j)
par=self.__par; rank=self.__rank; size=self.__size
if(i==j): return False
if(rank[i]>rank[j]):
par[j]=i
size[i]+=size[j]
else:
par[i]=j
size[j]+=size[i]
if(rank[i]==rank[j]): rank[j]+=1
self.__connected-=1
return True
def size(self,k):
return self.__size[self.root(k)]
def connected(self):
return self.__connected
def resolve():
n,m=list(map(int,input().split()))
uf=UnionFind(n)
for _ in range(m):
x,y,z=list(map(int,input().split()))
x-=1; y-=1
uf.unite(x,y)
print((uf.connected()))
resolve() | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n,m=list(map(int,input().split()))
E=[[] for _ in range(n)]
for _ in range(m):
x,y,z=list(map(int,input().split()))
x-=1; y-=1
E[x].append(y)
E[y].append(x)
cnt=0
col=[None]*n
def dfs(v)->bool:
if(col[v] is not None): return False
Q=[v]
col[v]=cnt
while(Q):
v=Q.pop()
for nv in E[v]:
if(col[nv] is not None): continue
col[nv]=cnt
Q.append(nv)
return True
for v in range(n):
cnt+=dfs(v)
print(cnt)
resolve() | 46 | 33 | 1,185 | 745 | import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7
input = lambda: sys.stdin.readline().rstrip()
class UnionFind(object):
def __init__(self, n):
self.__par = list(range(n))
self.__rank = [0] * n
self.__size = [1] * n
self.__connected = n
def root(self, k):
if self.__par[k] == k:
return k
self.__par[k] = self.root(self.__par[k])
return self.__par[k]
def unite(self, i, j):
i = self.root(i)
j = self.root(j)
par = self.__par
rank = self.__rank
size = self.__size
if i == j:
return False
if rank[i] > rank[j]:
par[j] = i
size[i] += size[j]
else:
par[i] = j
size[j] += size[i]
if rank[i] == rank[j]:
rank[j] += 1
self.__connected -= 1
return True
def size(self, k):
return self.__size[self.root(k)]
def connected(self):
return self.__connected
def resolve():
n, m = list(map(int, input().split()))
uf = UnionFind(n)
for _ in range(m):
x, y, z = list(map(int, input().split()))
x -= 1
y -= 1
uf.unite(x, y)
print((uf.connected()))
resolve()
| import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7
input = lambda: sys.stdin.readline().rstrip()
def resolve():
n, m = list(map(int, input().split()))
E = [[] for _ in range(n)]
for _ in range(m):
x, y, z = list(map(int, input().split()))
x -= 1
y -= 1
E[x].append(y)
E[y].append(x)
cnt = 0
col = [None] * n
def dfs(v) -> bool:
if col[v] is not None:
return False
Q = [v]
col[v] = cnt
while Q:
v = Q.pop()
for nv in E[v]:
if col[nv] is not None:
continue
col[nv] = cnt
Q.append(nv)
return True
for v in range(n):
cnt += dfs(v)
print(cnt)
resolve()
| false | 28.26087 | [
"-class UnionFind(object):",
"- def __init__(self, n):",
"- self.__par = list(range(n))",
"- self.__rank = [0] * n",
"- self.__size = [1] * n",
"- self.__connected = n",
"-",
"- def root(self, k):",
"- if self.__par[k] == k:",
"- return k",
"- self.__par[k] = self.root(self.__par[k])",
"- return self.__par[k]",
"-",
"- def unite(self, i, j):",
"- i = self.root(i)",
"- j = self.root(j)",
"- par = self.__par",
"- rank = self.__rank",
"- size = self.__size",
"- if i == j:",
"- return False",
"- if rank[i] > rank[j]:",
"- par[j] = i",
"- size[i] += size[j]",
"- else:",
"- par[i] = j",
"- size[j] += size[i]",
"- if rank[i] == rank[j]:",
"- rank[j] += 1",
"- self.__connected -= 1",
"- return True",
"-",
"- def size(self, k):",
"- return self.__size[self.root(k)]",
"-",
"- def connected(self):",
"- return self.__connected",
"-",
"-",
"- uf = UnionFind(n)",
"+ E = [[] for _ in range(n)]",
"- uf.unite(x, y)",
"- print((uf.connected()))",
"+ E[x].append(y)",
"+ E[y].append(x)",
"+ cnt = 0",
"+ col = [None] * n",
"+",
"+ def dfs(v) -> bool:",
"+ if col[v] is not None:",
"+ return False",
"+ Q = [v]",
"+ col[v] = cnt",
"+ while Q:",
"+ v = Q.pop()",
"+ for nv in E[v]:",
"+ if col[nv] is not None:",
"+ continue",
"+ col[nv] = cnt",
"+ Q.append(nv)",
"+ return True",
"+",
"+ for v in range(n):",
"+ cnt += dfs(v)",
"+ print(cnt)"
] | false | 0.039058 | 0.160738 | 0.242994 | [
"s498236579",
"s228179276"
] |
u188745744 | p02732 | python | s430360725 | s648626229 | 486 | 379 | 38,948 | 32,060 | Accepted | Accepted | 22.02 | A = eval(input())
B = list(input().split())
import collections
C = collections.Counter(B)
list_after = {}
list_n = list(C.items())
total = 0
for i in list_n:
total += i[1] * (i[1]-1) / 2
for i in list_n:
list_after[i[0]] = total - (i[1] * (i[1]-1) / 2 - (i[1]-1) * (i[1]-2) / 2)
for i in B:
print((int(list_after[i]))) | A = int(eval(input()))
import collections
total = 0
listN = list(map(int,input().split()))
dic = collections.Counter(listN)
listB = list(dic.values())
for i in listB:
total += i * (i-1) // 2
dic_keys = list(dic.keys())
dic_values = list(dic.values())
for i in range(len(dic_values)):
B = dic_values[i]
dic_values[i] = total-(B-1)
dic = {}
for i in range(len(dic_values)):
dic[dic_keys[i]] = dic_values[i]
for i in listN:
print((dic[i])) | 13 | 18 | 328 | 465 | A = eval(input())
B = list(input().split())
import collections
C = collections.Counter(B)
list_after = {}
list_n = list(C.items())
total = 0
for i in list_n:
total += i[1] * (i[1] - 1) / 2
for i in list_n:
list_after[i[0]] = total - (i[1] * (i[1] - 1) / 2 - (i[1] - 1) * (i[1] - 2) / 2)
for i in B:
print((int(list_after[i])))
| A = int(eval(input()))
import collections
total = 0
listN = list(map(int, input().split()))
dic = collections.Counter(listN)
listB = list(dic.values())
for i in listB:
total += i * (i - 1) // 2
dic_keys = list(dic.keys())
dic_values = list(dic.values())
for i in range(len(dic_values)):
B = dic_values[i]
dic_values[i] = total - (B - 1)
dic = {}
for i in range(len(dic_values)):
dic[dic_keys[i]] = dic_values[i]
for i in listN:
print((dic[i]))
| false | 27.777778 | [
"-A = eval(input())",
"-B = list(input().split())",
"+A = int(eval(input()))",
"-C = collections.Counter(B)",
"-list_after = {}",
"-list_n = list(C.items())",
"-for i in list_n:",
"- total += i[1] * (i[1] - 1) / 2",
"-for i in list_n:",
"- list_after[i[0]] = total - (i[1] * (i[1] - 1) / 2 - (i[1] - 1) * (i[1] - 2) / 2)",
"-for i in B:",
"- print((int(list_after[i])))",
"+listN = list(map(int, input().split()))",
"+dic = collections.Counter(listN)",
"+listB = list(dic.values())",
"+for i in listB:",
"+ total += i * (i - 1) // 2",
"+dic_keys = list(dic.keys())",
"+dic_values = list(dic.values())",
"+for i in range(len(dic_values)):",
"+ B = dic_values[i]",
"+ dic_values[i] = total - (B - 1)",
"+dic = {}",
"+for i in range(len(dic_values)):",
"+ dic[dic_keys[i]] = dic_values[i]",
"+for i in listN:",
"+ print((dic[i]))"
] | false | 0.099719 | 0.041165 | 2.422416 | [
"s430360725",
"s648626229"
] |
u398899024 | p03160 | python | s971797249 | s282134151 | 796 | 186 | 268,448 | 14,532 | Accepted | Accepted | 76.63 | from functools import lru_cache
import sys
sys.setrecursionlimit(10**6)
N = int(eval(input()))
h = list(map(int, input().split()))
@lru_cache(maxsize=None)
def recur(i):
if i == N - 1:
return 0
return min(abs(h[i] - h[i + 1]) + recur(i + 1), abs(h[i] - h[min(N - 1, i + 2)]) + recur(min(N - 1, i + 2)))
print((recur(0)))
# dp = [0]*(N + 1)
# for i in range(N):
| from functools import lru_cache
import sys
sys.setrecursionlimit(10**6)
N = int(eval(input()))
h = list(map(int, input().split()))
# @lru_cache(maxsize=None)
# def recur(i):
# if i == N - 1:
# return 0
# return min(abs(h[i] - h[i + 1]) + recur(i + 1), abs(h[i] - h[min(N - 1, i + 2)]) + recur(min(N - 1, i + 2)))
#
# print(recur(0))
dp = [float("inf")]*(N + 2)
dp[0] = 0
for i in range(N - 1):
dp[i + 1] = min(dp[i + 1], abs(h[i] - h[i + 1]) + dp[i])
if i < N - 2:
dp[i + 2] = min(dp[i + 2], abs(h[i] - h[i + 2]) + dp[i])
print((dp[N - 1]))
| 18 | 24 | 391 | 593 | from functools import lru_cache
import sys
sys.setrecursionlimit(10**6)
N = int(eval(input()))
h = list(map(int, input().split()))
@lru_cache(maxsize=None)
def recur(i):
if i == N - 1:
return 0
return min(
abs(h[i] - h[i + 1]) + recur(i + 1),
abs(h[i] - h[min(N - 1, i + 2)]) + recur(min(N - 1, i + 2)),
)
print((recur(0)))
# dp = [0]*(N + 1)
# for i in range(N):
| from functools import lru_cache
import sys
sys.setrecursionlimit(10**6)
N = int(eval(input()))
h = list(map(int, input().split()))
# @lru_cache(maxsize=None)
# def recur(i):
# if i == N - 1:
# return 0
# return min(abs(h[i] - h[i + 1]) + recur(i + 1), abs(h[i] - h[min(N - 1, i + 2)]) + recur(min(N - 1, i + 2)))
#
# print(recur(0))
dp = [float("inf")] * (N + 2)
dp[0] = 0
for i in range(N - 1):
dp[i + 1] = min(dp[i + 1], abs(h[i] - h[i + 1]) + dp[i])
if i < N - 2:
dp[i + 2] = min(dp[i + 2], abs(h[i] - h[i + 2]) + dp[i])
print((dp[N - 1]))
| false | 25 | [
"-",
"-",
"-@lru_cache(maxsize=None)",
"-def recur(i):",
"- if i == N - 1:",
"- return 0",
"- return min(",
"- abs(h[i] - h[i + 1]) + recur(i + 1),",
"- abs(h[i] - h[min(N - 1, i + 2)]) + recur(min(N - 1, i + 2)),",
"- )",
"-",
"-",
"-print((recur(0)))",
"-# dp = [0]*(N + 1)",
"-# for i in range(N):",
"+# @lru_cache(maxsize=None)",
"+# def recur(i):",
"+# if i == N - 1:",
"+# return 0",
"+# return min(abs(h[i] - h[i + 1]) + recur(i + 1), abs(h[i] - h[min(N - 1, i + 2)]) + recur(min(N - 1, i + 2)))",
"+#",
"+# print(recur(0))",
"+dp = [float(\"inf\")] * (N + 2)",
"+dp[0] = 0",
"+for i in range(N - 1):",
"+ dp[i + 1] = min(dp[i + 1], abs(h[i] - h[i + 1]) + dp[i])",
"+ if i < N - 2:",
"+ dp[i + 2] = min(dp[i + 2], abs(h[i] - h[i + 2]) + dp[i])",
"+print((dp[N - 1]))"
] | false | 0.071472 | 0.076447 | 0.934916 | [
"s971797249",
"s282134151"
] |
u597374218 | p02999 | python | s498845505 | s312571001 | 30 | 26 | 9,136 | 9,152 | Accepted | Accepted | 13.33 | X,A=list(map(int,input().split()))
print((10*(X>=A))) | X,A=list(map(int,input().split()))
print(("0" if X<A else "10")) | 2 | 2 | 46 | 57 | X, A = list(map(int, input().split()))
print((10 * (X >= A)))
| X, A = list(map(int, input().split()))
print(("0" if X < A else "10"))
| false | 0 | [
"-print((10 * (X >= A)))",
"+print((\"0\" if X < A else \"10\"))"
] | false | 0.034095 | 0.03652 | 0.933614 | [
"s498845505",
"s312571001"
] |
u764215612 | p02691 | python | s883412784 | s830813812 | 118 | 107 | 32,272 | 32,256 | Accepted | Accepted | 9.32 | n,a=int(eval(input())),list(map(int, input().split()))
d=[0]*n
def main():
for i,x in enumerate(a):
if i+x<n:d[i+x]+=1
print((sum([d[i-x]for i,x in enumerate(a)if i-x>=0])))
main() | def main():
n,a=int(eval(input())),list(map(int, input().split()));d,s=[0]*n,0
for i,x in enumerate(a):
if i+x<n:d[i+x]+=1
if i-x>=0:s+=d[i-x]
print(s)
main() | 7 | 7 | 182 | 165 | n, a = int(eval(input())), list(map(int, input().split()))
d = [0] * n
def main():
for i, x in enumerate(a):
if i + x < n:
d[i + x] += 1
print((sum([d[i - x] for i, x in enumerate(a) if i - x >= 0])))
main()
| def main():
n, a = int(eval(input())), list(map(int, input().split()))
d, s = [0] * n, 0
for i, x in enumerate(a):
if i + x < n:
d[i + x] += 1
if i - x >= 0:
s += d[i - x]
print(s)
main()
| false | 0 | [
"-n, a = int(eval(input())), list(map(int, input().split()))",
"-d = [0] * n",
"-",
"-",
"+ n, a = int(eval(input())), list(map(int, input().split()))",
"+ d, s = [0] * n, 0",
"- print((sum([d[i - x] for i, x in enumerate(a) if i - x >= 0])))",
"+ if i - x >= 0:",
"+ s += d[i - x]",
"+ print(s)"
] | false | 0.040544 | 0.03986 | 1.017172 | [
"s883412784",
"s830813812"
] |
u050708958 | p03031 | python | s217927559 | s869874413 | 50 | 38 | 3,064 | 3,064 | Accepted | Accepted | 24 | n, m = list(map(int, input().split()))
bits = '0b' + '1' * n
s = []
for _ in range(m):
i = [int(i) for i in input().split()]
s.append(i[1:])
p = [int(i) for i in input().split()]
c = 0
for i in range(2**n):
l = bin(i)[2:]
b = (n - len(l)) * '0' + l
addable = True
for h, j in enumerate(s):
d = 0
for k in j:
d += int(b[k - 1])
if addable:
addable = d % 2 == p[h]
if addable:
c += 1
print(c) | n, m = list(map(int, input().split()))
s = [[int(i) for i in input().split()[1:]] for _ in range(m)]
p = [int(i) for i in input().split()]
c = 0
for i in range(2**n):
addable = True
for j in range(m):
d = sum(2 ** (k - 1) for k in s[j])
if bin(i & d).count('1') % 2 != p[j]:
addable = False
break
if addable:
c += 1
print(c)
| 23 | 15 | 492 | 394 | n, m = list(map(int, input().split()))
bits = "0b" + "1" * n
s = []
for _ in range(m):
i = [int(i) for i in input().split()]
s.append(i[1:])
p = [int(i) for i in input().split()]
c = 0
for i in range(2**n):
l = bin(i)[2:]
b = (n - len(l)) * "0" + l
addable = True
for h, j in enumerate(s):
d = 0
for k in j:
d += int(b[k - 1])
if addable:
addable = d % 2 == p[h]
if addable:
c += 1
print(c)
| n, m = list(map(int, input().split()))
s = [[int(i) for i in input().split()[1:]] for _ in range(m)]
p = [int(i) for i in input().split()]
c = 0
for i in range(2**n):
addable = True
for j in range(m):
d = sum(2 ** (k - 1) for k in s[j])
if bin(i & d).count("1") % 2 != p[j]:
addable = False
break
if addable:
c += 1
print(c)
| false | 34.782609 | [
"-bits = \"0b\" + \"1\" * n",
"-s = []",
"-for _ in range(m):",
"- i = [int(i) for i in input().split()]",
"- s.append(i[1:])",
"+s = [[int(i) for i in input().split()[1:]] for _ in range(m)]",
"- l = bin(i)[2:]",
"- b = (n - len(l)) * \"0\" + l",
"- for h, j in enumerate(s):",
"- d = 0",
"- for k in j:",
"- d += int(b[k - 1])",
"- if addable:",
"- addable = d % 2 == p[h]",
"+ for j in range(m):",
"+ d = sum(2 ** (k - 1) for k in s[j])",
"+ if bin(i & d).count(\"1\") % 2 != p[j]:",
"+ addable = False",
"+ break"
] | false | 0.039202 | 0.083371 | 0.470207 | [
"s217927559",
"s869874413"
] |
u506858457 | p02792 | python | s573940061 | s849678814 | 267 | 223 | 9,172 | 9,164 | Accepted | Accepted | 16.48 | def II(): return int(eval(input()))
N=II()
tbl=[0]*101
for i in range(1,N+1):
i=str(i)
tbl[int(str(i[0]+i[-1]))]+=1
ans=0
for i in range(1,N+1):
i=str(i)
ans+=tbl[int(str(i[-1]+i[0]))]
print(ans)
| def II(): return int(eval(input()))
N=II()
tbl=[0]*101
for i in range(1,N+1):
i=str(i)
tbl[int(i[0]+i[-1])]+=1
ans=0
for i in range(1,N+1):
i=str(i)
ans+=tbl[int(i[-1]+i[0])]
print(ans)
| 12 | 12 | 215 | 205 | def II():
return int(eval(input()))
N = II()
tbl = [0] * 101
for i in range(1, N + 1):
i = str(i)
tbl[int(str(i[0] + i[-1]))] += 1
ans = 0
for i in range(1, N + 1):
i = str(i)
ans += tbl[int(str(i[-1] + i[0]))]
print(ans)
| def II():
return int(eval(input()))
N = II()
tbl = [0] * 101
for i in range(1, N + 1):
i = str(i)
tbl[int(i[0] + i[-1])] += 1
ans = 0
for i in range(1, N + 1):
i = str(i)
ans += tbl[int(i[-1] + i[0])]
print(ans)
| false | 0 | [
"- tbl[int(str(i[0] + i[-1]))] += 1",
"+ tbl[int(i[0] + i[-1])] += 1",
"- ans += tbl[int(str(i[-1] + i[0]))]",
"+ ans += tbl[int(i[-1] + i[0])]"
] | false | 0.103219 | 0.054593 | 1.890701 | [
"s573940061",
"s849678814"
] |
u377989038 | p03339 | python | s718293711 | s993743641 | 267 | 161 | 17,644 | 3,676 | Accepted | Accepted | 39.7 | n = int(eval(input()))
s = eval(input())
w = [0]
e = [0]
w_cnt = 0
e_cnt = 0
for i in range(n):
if s[i] == "W":
w_cnt += 1
else:
e_cnt += 1
w.append(w_cnt)
e.append(e_cnt)
ans = 10 ** 9
for i in range(n):
ans = min(ans, w[i]+(e[-1] - e[i+1]))
print(ans) | n = int(eval(input()))
s = eval(input())
w_cnt = 0
e_cnt = 0
E = s.count("E")
ans = 10 ** 9
for i in s:
if i == "E":
e_cnt += 1
ans = min(ans, w_cnt + E - e_cnt)
if i == "W":
w_cnt += 1
print(ans) | 19 | 16 | 297 | 230 | n = int(eval(input()))
s = eval(input())
w = [0]
e = [0]
w_cnt = 0
e_cnt = 0
for i in range(n):
if s[i] == "W":
w_cnt += 1
else:
e_cnt += 1
w.append(w_cnt)
e.append(e_cnt)
ans = 10**9
for i in range(n):
ans = min(ans, w[i] + (e[-1] - e[i + 1]))
print(ans)
| n = int(eval(input()))
s = eval(input())
w_cnt = 0
e_cnt = 0
E = s.count("E")
ans = 10**9
for i in s:
if i == "E":
e_cnt += 1
ans = min(ans, w_cnt + E - e_cnt)
if i == "W":
w_cnt += 1
print(ans)
| false | 15.789474 | [
"-w = [0]",
"-e = [0]",
"-for i in range(n):",
"- if s[i] == \"W\":",
"+E = s.count(\"E\")",
"+ans = 10**9",
"+for i in s:",
"+ if i == \"E\":",
"+ e_cnt += 1",
"+ ans = min(ans, w_cnt + E - e_cnt)",
"+ if i == \"W\":",
"- else:",
"- e_cnt += 1",
"- w.append(w_cnt)",
"- e.append(e_cnt)",
"-ans = 10**9",
"-for i in range(n):",
"- ans = min(ans, w[i] + (e[-1] - e[i + 1]))"
] | false | 0.142028 | 0.045055 | 3.1523 | [
"s718293711",
"s993743641"
] |
u723792785 | p02708 | python | s127099700 | s863524510 | 151 | 120 | 9,184 | 20,080 | Accepted | Accepted | 20.53 | n,k=list(map(int,input().split()))
sum = 0
for i in range(k, n+2):
minunchi = (i*(i-1))//2
maxunchi = (n*(n+1))//2 - ((n+1-i)*(n-i))//2
sum += maxunchi - minunchi + 1
print((sum%(10**9+7))) | n,k=list(map(int,input().split()))
print((sum([(n*(n+1))//2-((n+1-i)*(n-i))//2-(i*(i-1))//2+1 for i in range(k,n+2)])%(10**9+7))) | 9 | 2 | 194 | 122 | n, k = list(map(int, input().split()))
sum = 0
for i in range(k, n + 2):
minunchi = (i * (i - 1)) // 2
maxunchi = (n * (n + 1)) // 2 - ((n + 1 - i) * (n - i)) // 2
sum += maxunchi - minunchi + 1
print((sum % (10**9 + 7)))
| n, k = list(map(int, input().split()))
print(
(
sum(
[
(n * (n + 1)) // 2
- ((n + 1 - i) * (n - i)) // 2
- (i * (i - 1)) // 2
+ 1
for i in range(k, n + 2)
]
)
% (10**9 + 7)
)
)
| false | 77.777778 | [
"-sum = 0",
"-for i in range(k, n + 2):",
"- minunchi = (i * (i - 1)) // 2",
"- maxunchi = (n * (n + 1)) // 2 - ((n + 1 - i) * (n - i)) // 2",
"- sum += maxunchi - minunchi + 1",
"-print((sum % (10**9 + 7)))",
"+print(",
"+ (",
"+ sum(",
"+ [",
"+ (n * (n + 1)) // 2",
"+ - ((n + 1 - i) * (n - i)) // 2",
"+ - (i * (i - 1)) // 2",
"+ + 1",
"+ for i in range(k, n + 2)",
"+ ]",
"+ )",
"+ % (10**9 + 7)",
"+ )",
"+)"
] | false | 0.180825 | 0.070165 | 2.577136 | [
"s127099700",
"s863524510"
] |
u380772254 | p02804 | python | s025307751 | s142914833 | 369 | 300 | 119,148 | 78,376 | Accepted | Accepted | 18.7 |
class BinomialCoefficient(object):
def __init__(self, N=510000, MOD=10**9+7):
self.fac = [1, 1]
self.finv = [1, 1]
self.inv = [0, 1]
self.MOD = MOD
for i in range(2, N + 1):
self.fac.append((self.fac[-1] * i) % MOD)
self.inv.append((-self.inv[MOD % i] * (MOD // i)) % MOD)
self.finv.append((self.finv[-1] * self.inv[-1]) % MOD)
def comb(self, n, r):
if r < 0 or n < r or r < 0:
return 0
return self.fac[n] * self.finv[r] * self.finv[n - r] % self.MOD
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
A.sort()
bc = BinomialCoefficient()
nCk = bc.comb(N, K)
ans = 0
for i in range(N - 1):
c = nCk - bc.comb(i + 1, K) - bc.comb((N - i - 1), K)
ans += c * (A[i + 1] - A[i]) % MOD
ans %= MOD
print(ans)
|
class BinomialCoefficient(object):
def __init__(self, N=510000, MOD=10**9+7):
self.fac = [1, 1]
self.finv = [1, 1]
self.inv = [0, 1]
self.MOD = MOD
for i in range(2, N + 1):
self.fac.append((self.fac[-1] * i) % MOD)
self.inv.append((-self.inv[MOD % i] * (MOD // i)) % MOD)
self.finv.append((self.finv[-1] * self.inv[-1]) % MOD)
def comb(self, n, r):
if r < 0 or n < r or r < 0:
return 0
return self.fac[n] * self.finv[r] * self.finv[n - r] % self.MOD
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
A.sort()
bc = BinomialCoefficient(N)
nCk = bc.comb(N, K)
ans = 0
for i in range(N - 1):
c = nCk - bc.comb(i + 1, K) - bc.comb((N - i - 1), K)
ans += c * (A[i + 1] - A[i]) % MOD
ans %= MOD
print(ans)
| 32 | 32 | 897 | 898 | class BinomialCoefficient(object):
def __init__(self, N=510000, MOD=10**9 + 7):
self.fac = [1, 1]
self.finv = [1, 1]
self.inv = [0, 1]
self.MOD = MOD
for i in range(2, N + 1):
self.fac.append((self.fac[-1] * i) % MOD)
self.inv.append((-self.inv[MOD % i] * (MOD // i)) % MOD)
self.finv.append((self.finv[-1] * self.inv[-1]) % MOD)
def comb(self, n, r):
if r < 0 or n < r or r < 0:
return 0
return self.fac[n] * self.finv[r] * self.finv[n - r] % self.MOD
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
MOD = 10**9 + 7
A.sort()
bc = BinomialCoefficient()
nCk = bc.comb(N, K)
ans = 0
for i in range(N - 1):
c = nCk - bc.comb(i + 1, K) - bc.comb((N - i - 1), K)
ans += c * (A[i + 1] - A[i]) % MOD
ans %= MOD
print(ans)
| class BinomialCoefficient(object):
def __init__(self, N=510000, MOD=10**9 + 7):
self.fac = [1, 1]
self.finv = [1, 1]
self.inv = [0, 1]
self.MOD = MOD
for i in range(2, N + 1):
self.fac.append((self.fac[-1] * i) % MOD)
self.inv.append((-self.inv[MOD % i] * (MOD // i)) % MOD)
self.finv.append((self.finv[-1] * self.inv[-1]) % MOD)
def comb(self, n, r):
if r < 0 or n < r or r < 0:
return 0
return self.fac[n] * self.finv[r] * self.finv[n - r] % self.MOD
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
MOD = 10**9 + 7
A.sort()
bc = BinomialCoefficient(N)
nCk = bc.comb(N, K)
ans = 0
for i in range(N - 1):
c = nCk - bc.comb(i + 1, K) - bc.comb((N - i - 1), K)
ans += c * (A[i + 1] - A[i]) % MOD
ans %= MOD
print(ans)
| false | 0 | [
"-bc = BinomialCoefficient()",
"+bc = BinomialCoefficient(N)"
] | false | 0.875542 | 0.043077 | 20.325264 | [
"s025307751",
"s142914833"
] |
u810288681 | p03456 | python | s959252749 | s797905185 | 185 | 17 | 38,384 | 2,940 | Accepted | Accepted | 90.81 | import math
a,b = input().split()
print(('Yes' if math.sqrt(int(a+b)) == int(math.sqrt(int(a+b))) else 'No')) | a,b = input().split()
n = int(a+b)
print(('Yes' if n**0.5 == int(n**0.5) else 'No')) | 3 | 3 | 109 | 84 | import math
a, b = input().split()
print(("Yes" if math.sqrt(int(a + b)) == int(math.sqrt(int(a + b))) else "No"))
| a, b = input().split()
n = int(a + b)
print(("Yes" if n**0.5 == int(n**0.5) else "No"))
| false | 0 | [
"-import math",
"-",
"-print((\"Yes\" if math.sqrt(int(a + b)) == int(math.sqrt(int(a + b))) else \"No\"))",
"+n = int(a + b)",
"+print((\"Yes\" if n**0.5 == int(n**0.5) else \"No\"))"
] | false | 0.045052 | 0.082948 | 0.543135 | [
"s959252749",
"s797905185"
] |
u729133443 | p03816 | python | s970906143 | s791289724 | 193 | 40 | 53,248 | 16,160 | Accepted | Accepted | 79.27 | _,a=open(0);k=len(set(a.split()));print((k-(k%2<1))) | _,a=open(0);k=len(set(a.split()));print((k-1+k%2)) | 1 | 1 | 50 | 48 | _, a = open(0)
k = len(set(a.split()))
print((k - (k % 2 < 1)))
| _, a = open(0)
k = len(set(a.split()))
print((k - 1 + k % 2))
| false | 0 | [
"-print((k - (k % 2 < 1)))",
"+print((k - 1 + k % 2))"
] | false | 0.062687 | 0.039647 | 1.581103 | [
"s970906143",
"s791289724"
] |
u633068244 | p00067 | python | s782303714 | s373305269 | 20 | 10 | 4,340 | 4,292 | Accepted | Accepted | 50 | def island(f,x,y,m):
rf = f[:][:]
rf[y][x] = m
for i in [-1,1]:
if 0 <= x+i <= 11 and rf[y][x+i] == 1:
rf = island(rf,x+i,y,m)
if 0 <= y+i <= 11 and rf[y+i][x] == 1:
rf = island(rf,x,y+i,m)
return rf
while True:
f = []; m = 2
for i in range(12):
f.append(list(map(int, list(input()))))
for y in range(12):
for x in range(12):
if f[y][x] == 1:
f = island(f,x,y,m)
m += 1
ans = []
for i in range(12):
for j in range(12):
ans.append(f[i][j])
ans = list(set(ans))
print(len(ans) - 1*ans.count(0))
try:input()
except: break | W,H = 12,12
dxy = [[1,0],[0,1],[-1,0],[0,-1]]
def solve(field,w,h):
if 0 <= w < W and 0 <= h < H and field[h][w] == "1":
field[h][w] = "0"
for dx,dy in dxy:
solve(field,w+dx,h+dy)
while 1:
try:
field = [list(input()) for i in range(H)]
ans = 0
for h in range(H):
for w in range(W):
if field[h][w] == "1":
solve(field,w,h)
ans += 1
print(ans)
input()
except:
break | 27 | 21 | 718 | 430 | def island(f, x, y, m):
rf = f[:][:]
rf[y][x] = m
for i in [-1, 1]:
if 0 <= x + i <= 11 and rf[y][x + i] == 1:
rf = island(rf, x + i, y, m)
if 0 <= y + i <= 11 and rf[y + i][x] == 1:
rf = island(rf, x, y + i, m)
return rf
while True:
f = []
m = 2
for i in range(12):
f.append(list(map(int, list(input()))))
for y in range(12):
for x in range(12):
if f[y][x] == 1:
f = island(f, x, y, m)
m += 1
ans = []
for i in range(12):
for j in range(12):
ans.append(f[i][j])
ans = list(set(ans))
print(len(ans) - 1 * ans.count(0))
try:
input()
except:
break
| W, H = 12, 12
dxy = [[1, 0], [0, 1], [-1, 0], [0, -1]]
def solve(field, w, h):
if 0 <= w < W and 0 <= h < H and field[h][w] == "1":
field[h][w] = "0"
for dx, dy in dxy:
solve(field, w + dx, h + dy)
while 1:
try:
field = [list(input()) for i in range(H)]
ans = 0
for h in range(H):
for w in range(W):
if field[h][w] == "1":
solve(field, w, h)
ans += 1
print(ans)
input()
except:
break
| false | 22.222222 | [
"-def island(f, x, y, m):",
"- rf = f[:][:]",
"- rf[y][x] = m",
"- for i in [-1, 1]:",
"- if 0 <= x + i <= 11 and rf[y][x + i] == 1:",
"- rf = island(rf, x + i, y, m)",
"- if 0 <= y + i <= 11 and rf[y + i][x] == 1:",
"- rf = island(rf, x, y + i, m)",
"- return rf",
"+W, H = 12, 12",
"+dxy = [[1, 0], [0, 1], [-1, 0], [0, -1]]",
"-while True:",
"- f = []",
"- m = 2",
"- for i in range(12):",
"- f.append(list(map(int, list(input()))))",
"- for y in range(12):",
"- for x in range(12):",
"- if f[y][x] == 1:",
"- f = island(f, x, y, m)",
"- m += 1",
"- ans = []",
"- for i in range(12):",
"- for j in range(12):",
"- ans.append(f[i][j])",
"- ans = list(set(ans))",
"- print(len(ans) - 1 * ans.count(0))",
"+def solve(field, w, h):",
"+ if 0 <= w < W and 0 <= h < H and field[h][w] == \"1\":",
"+ field[h][w] = \"0\"",
"+ for dx, dy in dxy:",
"+ solve(field, w + dx, h + dy)",
"+",
"+",
"+while 1:",
"+ field = [list(input()) for i in range(H)]",
"+ ans = 0",
"+ for h in range(H):",
"+ for w in range(W):",
"+ if field[h][w] == \"1\":",
"+ solve(field, w, h)",
"+ ans += 1",
"+ print(ans)"
] | false | 0.039607 | 0.041505 | 0.954272 | [
"s782303714",
"s373305269"
] |
u734876600 | p03289 | python | s603429055 | s469665073 | 20 | 17 | 3,060 | 3,064 | Accepted | Accepted | 15 | s = list(eval(input()))
c = 0
if s[0] != "A":
print("WA")
else:
for a in s[2:-1]:
if a == "C":
c += 1
t = a
if c == 1:
s.remove(s[0])
s.remove(t)
if "".join(s).islower():
print("AC")
else:
print("WA")
else:
print("WA") | s = list(eval(input()))
c = 0
if s[0] != "A":
print("WA")
else:
for i in s[2:-1]:
if i == "C":
c += 1
b = i
if c == 1:
s.remove(s[0])
s.remove(b)
if "".join(s).islower():
print("AC")
else:
print("WA")
else:
print("WA") | 19 | 18 | 347 | 341 | s = list(eval(input()))
c = 0
if s[0] != "A":
print("WA")
else:
for a in s[2:-1]:
if a == "C":
c += 1
t = a
if c == 1:
s.remove(s[0])
s.remove(t)
if "".join(s).islower():
print("AC")
else:
print("WA")
else:
print("WA")
| s = list(eval(input()))
c = 0
if s[0] != "A":
print("WA")
else:
for i in s[2:-1]:
if i == "C":
c += 1
b = i
if c == 1:
s.remove(s[0])
s.remove(b)
if "".join(s).islower():
print("AC")
else:
print("WA")
else:
print("WA")
| false | 5.263158 | [
"- for a in s[2:-1]:",
"- if a == \"C\":",
"+ for i in s[2:-1]:",
"+ if i == \"C\":",
"- t = a",
"+ b = i",
"- s.remove(t)",
"+ s.remove(b)"
] | false | 0.066368 | 0.051402 | 1.291156 | [
"s603429055",
"s469665073"
] |
u352394527 | p00040 | python | s300432934 | s871664392 | 160 | 90 | 5,600 | 5,604 | Accepted | Accepted | 43.75 | base = ord("a")
alst = [i for i in range(3, 26, 2) if i % 13]
def restore(s):
for a in range(1,26):
for b in range(26):
new = "".join([chr((a * (ord(x) - base) + b) % 26 + base) if x != " " else " " for x in s])
if "that" in new or "this" in new:
return new
n = int(eval(input()))
for _ in range(n):
print((restore(eval(input()))))
| base = ord("a")
alst = [i for i in range(1, 26, 2) if i % 13]
def restore(s):
for a in alst:
for b in range(26):
new = "".join([chr((a * (ord(x) - base) + b) % 26 + base) if x != " " else " " for x in s])
if "that" in new or "this" in new:
return new
n = int(eval(input()))
for _ in range(n):
print((restore(eval(input()))))
| 13 | 13 | 360 | 353 | base = ord("a")
alst = [i for i in range(3, 26, 2) if i % 13]
def restore(s):
for a in range(1, 26):
for b in range(26):
new = "".join(
[
chr((a * (ord(x) - base) + b) % 26 + base) if x != " " else " "
for x in s
]
)
if "that" in new or "this" in new:
return new
n = int(eval(input()))
for _ in range(n):
print((restore(eval(input()))))
| base = ord("a")
alst = [i for i in range(1, 26, 2) if i % 13]
def restore(s):
for a in alst:
for b in range(26):
new = "".join(
[
chr((a * (ord(x) - base) + b) % 26 + base) if x != " " else " "
for x in s
]
)
if "that" in new or "this" in new:
return new
n = int(eval(input()))
for _ in range(n):
print((restore(eval(input()))))
| false | 0 | [
"-alst = [i for i in range(3, 26, 2) if i % 13]",
"+alst = [i for i in range(1, 26, 2) if i % 13]",
"- for a in range(1, 26):",
"+ for a in alst:"
] | false | 0.038206 | 0.054404 | 0.702266 | [
"s300432934",
"s871664392"
] |
u924406834 | p03045 | python | s209038496 | s915046772 | 1,011 | 670 | 80,044 | 70,176 | Accepted | Accepted | 33.73 | class UnionFind():
#ｎは頂点数
def __init__(self, n):
self.parent = [-1]*n
#aの属する集合の根を取得
def root(self,a):
if self.parent[a] < 0:return a
self.parent[a] = self.root(self.parent[a])
return self.parent[a]
#aの属する集合の要素数を取得
def size(self,a):
return -self.parent[self.root(a)]
#aとbをくっつける
def connect(self,a,b):
if self.root(a) == self.root(b):return False
a = self.root(a);b = self.root(b)
if self.size(a) < self.size(b):a,b = b,a
self.parent[a] += self.parent[b]
self.parent[b] = a
return True
n,m = list(map(int,input().split()))
uni = UnionFind(n)
for i in range(m):
x,y,z = list(map(int,input().split()))
x -= 1
y -= 1
uni.connect(x,y)
ans = 0
for i in uni.parent:
if i < 0:
ans += 1
print(ans) | n,m = list(map(int,input().split()))
graph = [[] for i in range(n)]
for i in range(m):
x,y,z = list(map(int,input().split()))
graph[x-1].append(y-1)
graph[y-1].append(x-1)
check = [True]*n
count = 0
for i in range(n):
if check[i]:
count += 1
stack = []
stack.append(i)
check[i] = False
while stack:
p = stack.pop()
for j in graph[p]:
if check[j]:
stack.append(j)
check[j] = False
else:
continue
print(count) | 36 | 24 | 866 | 567 | class UnionFind:
# ｎは頂点数
def __init__(self, n):
self.parent = [-1] * n
# aの属する集合の根を取得
def root(self, a):
if self.parent[a] < 0:
return a
self.parent[a] = self.root(self.parent[a])
return self.parent[a]
# aの属する集合の要素数を取得
def size(self, a):
return -self.parent[self.root(a)]
# aとbをくっつける
def connect(self, a, b):
if self.root(a) == self.root(b):
return False
a = self.root(a)
b = self.root(b)
if self.size(a) < self.size(b):
a, b = b, a
self.parent[a] += self.parent[b]
self.parent[b] = a
return True
n, m = list(map(int, input().split()))
uni = UnionFind(n)
for i in range(m):
x, y, z = list(map(int, input().split()))
x -= 1
y -= 1
uni.connect(x, y)
ans = 0
for i in uni.parent:
if i < 0:
ans += 1
print(ans)
| n, m = list(map(int, input().split()))
graph = [[] for i in range(n)]
for i in range(m):
x, y, z = list(map(int, input().split()))
graph[x - 1].append(y - 1)
graph[y - 1].append(x - 1)
check = [True] * n
count = 0
for i in range(n):
if check[i]:
count += 1
stack = []
stack.append(i)
check[i] = False
while stack:
p = stack.pop()
for j in graph[p]:
if check[j]:
stack.append(j)
check[j] = False
else:
continue
print(count)
| false | 33.333333 | [
"-class UnionFind:",
"- # ｎは頂点数",
"- def __init__(self, n):",
"- self.parent = [-1] * n",
"-",
"- # aの属する集合の根を取得",
"- def root(self, a):",
"- if self.parent[a] < 0:",
"- return a",
"- self.parent[a] = self.root(self.parent[a])",
"- return self.parent[a]",
"-",
"- # aの属する集合の要素数を取得",
"- def size(self, a):",
"- return -self.parent[self.root(a)]",
"-",
"- # aとbをくっつける",
"- def connect(self, a, b):",
"- if self.root(a) == self.root(b):",
"- return False",
"- a = self.root(a)",
"- b = self.root(b)",
"- if self.size(a) < self.size(b):",
"- a, b = b, a",
"- self.parent[a] += self.parent[b]",
"- self.parent[b] = a",
"- return True",
"-",
"-",
"-uni = UnionFind(n)",
"+graph = [[] for i in range(n)]",
"- x -= 1",
"- y -= 1",
"- uni.connect(x, y)",
"-ans = 0",
"-for i in uni.parent:",
"- if i < 0:",
"- ans += 1",
"-print(ans)",
"+ graph[x - 1].append(y - 1)",
"+ graph[y - 1].append(x - 1)",
"+check = [True] * n",
"+count = 0",
"+for i in range(n):",
"+ if check[i]:",
"+ count += 1",
"+ stack = []",
"+ stack.append(i)",
"+ check[i] = False",
"+ while stack:",
"+ p = stack.pop()",
"+ for j in graph[p]:",
"+ if check[j]:",
"+ stack.append(j)",
"+ check[j] = False",
"+ else:",
"+ continue",
"+print(count)"
] | false | 0.048583 | 0.065391 | 0.742969 | [
"s209038496",
"s915046772"
] |
u014333473 | p03738 | python | s751350021 | s484146644 | 30 | 27 | 9,144 | 9,064 | Accepted | Accepted | 10 | a,b=int(eval(input())),int(eval(input()));print((['LESS','GREATER'][a>b] if a!=b else 'EQUAL')) | a,b=int(eval(input())),int(eval(input()));print((['ELQEUSASL'[a<b::2],'GREATER'][a>b])) | 1 | 1 | 81 | 73 | a, b = int(eval(input())), int(eval(input()))
print((["LESS", "GREATER"][a > b] if a != b else "EQUAL"))
| a, b = int(eval(input())), int(eval(input()))
print((["ELQEUSASL"[a < b :: 2], "GREATER"][a > b]))
| false | 0 | [
"-print(([\"LESS\", \"GREATER\"][a > b] if a != b else \"EQUAL\"))",
"+print(([\"ELQEUSASL\"[a < b :: 2], \"GREATER\"][a > b]))"
] | false | 0.034684 | 0.032873 | 1.055091 | [
"s751350021",
"s484146644"
] |
u312025627 | p03611 | python | s874111121 | s151986541 | 122 | 77 | 20,572 | 13,964 | Accepted | Accepted | 36.89 | def main():
_ = int(eval(input()))
A = [int(i) for i in input().split()]
from collections import Counter, defaultdict
c = defaultdict(int)
for k, v in list(Counter(A).items()):
c[k] = v
ans = 0
for i in range(max(A) + 1):
if i != 0:
cur = c[i] + c[i-1] + c[i+1]
else:
cur = c[i] + c[i+1]
ans = max(ans, cur)
print(ans)
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
max_A = max(A)
counts = [0] * (max_A + 2)
for a in A:
if a > 0:
counts[a-1] += 1
counts[a] += 1
counts[a+1] += 1
print((max(counts)))
if __name__ == '__main__':
main()
| 19 | 15 | 453 | 313 | def main():
_ = int(eval(input()))
A = [int(i) for i in input().split()]
from collections import Counter, defaultdict
c = defaultdict(int)
for k, v in list(Counter(A).items()):
c[k] = v
ans = 0
for i in range(max(A) + 1):
if i != 0:
cur = c[i] + c[i - 1] + c[i + 1]
else:
cur = c[i] + c[i + 1]
ans = max(ans, cur)
print(ans)
if __name__ == "__main__":
main()
| def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
max_A = max(A)
counts = [0] * (max_A + 2)
for a in A:
if a > 0:
counts[a - 1] += 1
counts[a] += 1
counts[a + 1] += 1
print((max(counts)))
if __name__ == "__main__":
main()
| false | 21.052632 | [
"- _ = int(eval(input()))",
"+ N = int(eval(input()))",
"- from collections import Counter, defaultdict",
"-",
"- c = defaultdict(int)",
"- for k, v in list(Counter(A).items()):",
"- c[k] = v",
"- ans = 0",
"- for i in range(max(A) + 1):",
"- if i != 0:",
"- cur = c[i] + c[i - 1] + c[i + 1]",
"- else:",
"- cur = c[i] + c[i + 1]",
"- ans = max(ans, cur)",
"- print(ans)",
"+ max_A = max(A)",
"+ counts = [0] * (max_A + 2)",
"+ for a in A:",
"+ if a > 0:",
"+ counts[a - 1] += 1",
"+ counts[a] += 1",
"+ counts[a + 1] += 1",
"+ print((max(counts)))"
] | false | 0.039095 | 0.038763 | 1.008578 | [
"s874111121",
"s151986541"
] |
u309977459 | p03148 | python | s820831081 | s848155983 | 1,092 | 974 | 81,624 | 81,496 | Accepted | Accepted | 10.81 | from operator import itemgetter
N, K = list(map(int, input().split()))
td = [list(map(int, input().split())) for _ in range(N)]
td.sort(key=itemgetter(1, 0), reverse=True)
t, d = list(zip(*td))
s = set()
q = []
tmp = 0
now = 0
for i in range(K):
if t[i] not in s:
s.add(t[i])
else:
q.append(d[i])
tmp += d[i]
now += 1
kind = len(s)
sums = [-100000000000]*(kind+1)
sums[kind] = tmp
#for i in range(K, N):
# if not q:
# break
# if t[i] not in s:
# s.
while q:
kind += 1
tmp = q.pop()
for i in range(now, N):
now += 1
if t[i] not in s:
s.add(t[i])
sums.append(sums[kind-1] + d[i] - tmp)
break
for i in range(len(sums)):
sums[i] += i**2
print((max(sums)))
| from operator import itemgetter
N, K = list(map(int, input().split()))
td = [list(map(int, input().split())) for _ in range(N)]
td.sort(key=itemgetter(1, 0), reverse=True)
t, d = list(zip(*td))
s = set()
q = []
tmp = 0
now = 0
for i in range(K):
if t[i] not in s:
s.add(t[i])
else:
q.append(d[i])
tmp += d[i]
now += 1
kind = len(s)
sums = [-100000000000]*(kind+1)
sums[kind] = tmp
for i in range(K, N):
if not q:
break
if t[i] not in s:
s.add(t[i])
tmp = q.pop()
kind += 1
sums.append(sums[kind-1] + d[i] - tmp)
#while q:
# kind += 1
# tmp = q.pop()
# for i in range(now, N):
# now += 1
# if t[i] not in s:
# s.add(t[i])
# sums.append(sums[kind-1] + d[i] - tmp)
# break
for i in range(len(sums)):
sums[i] += i**2
print((max(sums)))
| 39 | 42 | 799 | 902 | from operator import itemgetter
N, K = list(map(int, input().split()))
td = [list(map(int, input().split())) for _ in range(N)]
td.sort(key=itemgetter(1, 0), reverse=True)
t, d = list(zip(*td))
s = set()
q = []
tmp = 0
now = 0
for i in range(K):
if t[i] not in s:
s.add(t[i])
else:
q.append(d[i])
tmp += d[i]
now += 1
kind = len(s)
sums = [-100000000000] * (kind + 1)
sums[kind] = tmp
# for i in range(K, N):
# if not q:
# break
# if t[i] not in s:
# s.
while q:
kind += 1
tmp = q.pop()
for i in range(now, N):
now += 1
if t[i] not in s:
s.add(t[i])
sums.append(sums[kind - 1] + d[i] - tmp)
break
for i in range(len(sums)):
sums[i] += i**2
print((max(sums)))
| from operator import itemgetter
N, K = list(map(int, input().split()))
td = [list(map(int, input().split())) for _ in range(N)]
td.sort(key=itemgetter(1, 0), reverse=True)
t, d = list(zip(*td))
s = set()
q = []
tmp = 0
now = 0
for i in range(K):
if t[i] not in s:
s.add(t[i])
else:
q.append(d[i])
tmp += d[i]
now += 1
kind = len(s)
sums = [-100000000000] * (kind + 1)
sums[kind] = tmp
for i in range(K, N):
if not q:
break
if t[i] not in s:
s.add(t[i])
tmp = q.pop()
kind += 1
sums.append(sums[kind - 1] + d[i] - tmp)
# while q:
# kind += 1
# tmp = q.pop()
# for i in range(now, N):
# now += 1
# if t[i] not in s:
# s.add(t[i])
# sums.append(sums[kind-1] + d[i] - tmp)
# break
for i in range(len(sums)):
sums[i] += i**2
print((max(sums)))
| false | 7.142857 | [
"-# for i in range(K, N):",
"-# if not q:",
"-# break",
"-# if t[i] not in s:",
"-# s.",
"-while q:",
"- kind += 1",
"- tmp = q.pop()",
"- for i in range(now, N):",
"- now += 1",
"- if t[i] not in s:",
"- s.add(t[i])",
"- sums.append(sums[kind - 1] + d[i] - tmp)",
"- break",
"+for i in range(K, N):",
"+ if not q:",
"+ break",
"+ if t[i] not in s:",
"+ s.add(t[i])",
"+ tmp = q.pop()",
"+ kind += 1",
"+ sums.append(sums[kind - 1] + d[i] - tmp)",
"+# while q:",
"+# kind += 1",
"+# tmp = q.pop()",
"+# for i in range(now, N):",
"+# now += 1",
"+# if t[i] not in s:",
"+# s.add(t[i])",
"+# sums.append(sums[kind-1] + d[i] - tmp)",
"+# break"
] | false | 0.058761 | 0.037282 | 1.576133 | [
"s820831081",
"s848155983"
] |
u729133443 | p03576 | python | s068522294 | s520903382 | 206 | 30 | 40,560 | 3,064 | Accepted | Accepted | 85.44 | n,k=list(map(int,input().split()))
z=[list(map(int,input().split()))for _ in range(n)]
z.sort()
a=10**20
for i in range(n):
for j in range(i+1,n):
x=z[j][0]-z[i][0]
l=sorted(t[1]for t in z[i:j+1])
for u,v in zip(l,l[k-1:]):
a=min(a,x*(v-u))
print(a) | I=lambda:list(map(int,input().split()))
n,k=I()
z=[I()for _ in[0]*n]
z.sort()
a=10**20
for i in range(n):
for j in range(i+k-1,n):l=sorted(t[1]for t in z[i:j+1]);a=min(a,*[(z[j][0]-z[i][0])*(v-u)for u,v in zip(l,l[k-1:])])
print(a) | 11 | 8 | 293 | 239 | n, k = list(map(int, input().split()))
z = [list(map(int, input().split())) for _ in range(n)]
z.sort()
a = 10**20
for i in range(n):
for j in range(i + 1, n):
x = z[j][0] - z[i][0]
l = sorted(t[1] for t in z[i : j + 1])
for u, v in zip(l, l[k - 1 :]):
a = min(a, x * (v - u))
print(a)
| I = lambda: list(map(int, input().split()))
n, k = I()
z = [I() for _ in [0] * n]
z.sort()
a = 10**20
for i in range(n):
for j in range(i + k - 1, n):
l = sorted(t[1] for t in z[i : j + 1])
a = min(a, *[(z[j][0] - z[i][0]) * (v - u) for u, v in zip(l, l[k - 1 :])])
print(a)
| false | 27.272727 | [
"-n, k = list(map(int, input().split()))",
"-z = [list(map(int, input().split())) for _ in range(n)]",
"+I = lambda: list(map(int, input().split()))",
"+n, k = I()",
"+z = [I() for _ in [0] * n]",
"- for j in range(i + 1, n):",
"- x = z[j][0] - z[i][0]",
"+ for j in range(i + k - 1, n):",
"- for u, v in zip(l, l[k - 1 :]):",
"- a = min(a, x * (v - u))",
"+ a = min(a, *[(z[j][0] - z[i][0]) * (v - u) for u, v in zip(l, l[k - 1 :])])"
] | false | 0.048181 | 0.086013 | 0.560157 | [
"s068522294",
"s520903382"
] |
u102461423 | p03883 | python | s235516171 | s059491406 | 1,838 | 1,076 | 22,796 | 23,180 | Accepted | Accepted | 41.46 | import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
import numpy as np
N = int(readline())
LR = [tuple(int(x) for x in line.split()) for line in readlines()]
"""
・奇数個のとき：中央にどれかを固定。
・偶数のとき：原点で左右に分けるとしてよい。
・基本的に長さで内側から昇順（奇数のときの中央は謎）。→ソートしてdpできる。
・左に置いた個数をもってdp更新。また、中央を使ったかも同時に持って。
・偶数のときは、中央に1つ置いた状態から始める。
・大きい区間から外側に入れていく。
"""
LR.sort(key = lambda x: -x[1]-x[0])
INF = 10**18
dp_0 = np.full(N+1,INF,np.int64) # 左に置いた個数 → コスト。中央未確定。
dp_1 = np.full(N+1,INF,np.int64) # 左に置いた個数 → コスト。中央確定。
if N&1:
dp_0[0] = 0
else:
dp_1[0] = 0
for n,(L,R) in enumerate(LR):
length = R + L
prev_0 = dp_0
prev_1 = dp_1
dp_0 = np.full(N+1,INF,np.int64)
dp_1 = np.full(N+1,INF,np.int64)
x = np.arange(n+1,dtype=np.int64) # もともと左側にあった個数
# 左側に置く場合
np.minimum(prev_0[:n+1] + R + x * length, dp_0[1:n+2], out=dp_0[1:n+2])
np.minimum(prev_1[:n+1] + R + x * length, dp_1[1:n+2], out=dp_1[1:n+2])
# 右側に置く場合
np.minimum(prev_0[:n+1] + L + (n-x) * length, dp_0[:n+1], out=dp_0[:n+1])
np.minimum(prev_1[:n+1] + L + (n-x) * length, dp_1[:n+1], out=dp_1[:n+1])
# 中央に置く場合
np.minimum(prev_0[:n+1] + (N-1)//2 * length, dp_1[:n+1], out = dp_1[:n+1])
answer = dp_1[N//2]
print(answer) | import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
import numpy as np
N = int(readline())
LR = [tuple(int(x) for x in line.split()) for line in readlines()]
"""
・奇数個のとき：中央にどれかを固定。
・偶数のとき：原点で左右に分けるとしてよい。
・基本的に長さで内側から昇順（奇数のときの中央は謎）。→ソートしてdpできる。
・左に置いた個数をもってdp更新。また、中央を使ったかも同時に持って。
・偶数のときは、中央に1つ置いた状態から始める。
・大きい区間から外側に入れていく。
"""
LR.sort(key = lambda x: -x[1]-x[0])
INF = 10**18
dp_0 = np.full(1,INF,np.int64) # 左に置いた個数 → コスト。中央未確定。
dp_1 = np.full(1,INF,np.int64) # 左に置いた個数 → コスト。中央確定。
if N&1:
dp_0[0] = 0
else:
dp_1[0] = 0
for n,(L,R) in enumerate(LR):
length = R + L
prev_0 = dp_0
prev_1 = dp_1
dp_0 = np.full(n+2,INF,np.int64)
dp_1 = np.full(n+2,INF,np.int64)
x = np.arange(n+1,dtype=np.int64) # もともと左側にあった個数
# 左側に置く場合
np.minimum(prev_0[:n+1] + R + x * length, dp_0[1:n+2], out=dp_0[1:n+2])
np.minimum(prev_1[:n+1] + R + x * length, dp_1[1:n+2], out=dp_1[1:n+2])
# 右側に置く場合
np.minimum(prev_0[:n+1] + L + (n-x) * length, dp_0[:n+1], out=dp_0[:n+1])
np.minimum(prev_1[:n+1] + L + (n-x) * length, dp_1[:n+1], out=dp_1[:n+1])
# 中央に置く場合
np.minimum(prev_0[:n+1] + (N-1)//2 * length, dp_1[:n+1], out = dp_1[:n+1])
answer = dp_1[N//2]
print(answer) | 45 | 45 | 1,278 | 1,274 | import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
import numpy as np
N = int(readline())
LR = [tuple(int(x) for x in line.split()) for line in readlines()]
"""
・奇数個のとき：中央にどれかを固定。
・偶数のとき：原点で左右に分けるとしてよい。
・基本的に長さで内側から昇順（奇数のときの中央は謎）。→ソートしてdpできる。
・左に置いた個数をもってdp更新。また、中央を使ったかも同時に持って。
・偶数のときは、中央に1つ置いた状態から始める。
・大きい区間から外側に入れていく。
"""
LR.sort(key=lambda x: -x[1] - x[0])
INF = 10**18
dp_0 = np.full(N + 1, INF, np.int64) # 左に置いた個数 → コスト。中央未確定。
dp_1 = np.full(N + 1, INF, np.int64) # 左に置いた個数 → コスト。中央確定。
if N & 1:
dp_0[0] = 0
else:
dp_1[0] = 0
for n, (L, R) in enumerate(LR):
length = R + L
prev_0 = dp_0
prev_1 = dp_1
dp_0 = np.full(N + 1, INF, np.int64)
dp_1 = np.full(N + 1, INF, np.int64)
x = np.arange(n + 1, dtype=np.int64) # もともと左側にあった個数
# 左側に置く場合
np.minimum(prev_0[: n + 1] + R + x * length, dp_0[1 : n + 2], out=dp_0[1 : n + 2])
np.minimum(prev_1[: n + 1] + R + x * length, dp_1[1 : n + 2], out=dp_1[1 : n + 2])
# 右側に置く場合
np.minimum(prev_0[: n + 1] + L + (n - x) * length, dp_0[: n + 1], out=dp_0[: n + 1])
np.minimum(prev_1[: n + 1] + L + (n - x) * length, dp_1[: n + 1], out=dp_1[: n + 1])
# 中央に置く場合
np.minimum(
prev_0[: n + 1] + (N - 1) // 2 * length, dp_1[: n + 1], out=dp_1[: n + 1]
)
answer = dp_1[N // 2]
print(answer)
| import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
import numpy as np
N = int(readline())
LR = [tuple(int(x) for x in line.split()) for line in readlines()]
"""
・奇数個のとき：中央にどれかを固定。
・偶数のとき：原点で左右に分けるとしてよい。
・基本的に長さで内側から昇順（奇数のときの中央は謎）。→ソートしてdpできる。
・左に置いた個数をもってdp更新。また、中央を使ったかも同時に持って。
・偶数のときは、中央に1つ置いた状態から始める。
・大きい区間から外側に入れていく。
"""
LR.sort(key=lambda x: -x[1] - x[0])
INF = 10**18
dp_0 = np.full(1, INF, np.int64) # 左に置いた個数 → コスト。中央未確定。
dp_1 = np.full(1, INF, np.int64) # 左に置いた個数 → コスト。中央確定。
if N & 1:
dp_0[0] = 0
else:
dp_1[0] = 0
for n, (L, R) in enumerate(LR):
length = R + L
prev_0 = dp_0
prev_1 = dp_1
dp_0 = np.full(n + 2, INF, np.int64)
dp_1 = np.full(n + 2, INF, np.int64)
x = np.arange(n + 1, dtype=np.int64) # もともと左側にあった個数
# 左側に置く場合
np.minimum(prev_0[: n + 1] + R + x * length, dp_0[1 : n + 2], out=dp_0[1 : n + 2])
np.minimum(prev_1[: n + 1] + R + x * length, dp_1[1 : n + 2], out=dp_1[1 : n + 2])
# 右側に置く場合
np.minimum(prev_0[: n + 1] + L + (n - x) * length, dp_0[: n + 1], out=dp_0[: n + 1])
np.minimum(prev_1[: n + 1] + L + (n - x) * length, dp_1[: n + 1], out=dp_1[: n + 1])
# 中央に置く場合
np.minimum(
prev_0[: n + 1] + (N - 1) // 2 * length, dp_1[: n + 1], out=dp_1[: n + 1]
)
answer = dp_1[N // 2]
print(answer)
| false | 0 | [
"-dp_0 = np.full(N + 1, INF, np.int64) # 左に置いた個数 → コスト。中央未確定。",
"-dp_1 = np.full(N + 1, INF, np.int64) # 左に置いた個数 → コスト。中央確定。",
"+dp_0 = np.full(1, INF, np.int64) # 左に置いた個数 → コスト。中央未確定。",
"+dp_1 = np.full(1, INF, np.int64) # 左に置いた個数 → コスト。中央確定。",
"- dp_0 = np.full(N + 1, INF, np.int64)",
"- dp_1 = np.full(N + 1, INF, np.int64)",
"+ dp_0 = np.full(n + 2, INF, np.int64)",
"+ dp_1 = np.full(n + 2, INF, np.int64)"
] | false | 0.307077 | 0.486418 | 0.631304 | [
"s235516171",
"s059491406"
] |
u782616557 | p02861 | python | s772816604 | s533043248 | 760 | 439 | 7,992 | 8,052 | Accepted | Accepted | 42.24 | N=int(eval(input()))
A=[input().split() for i in range(N)]
x=0
y=1
L=0
num=0
import itertools
import math
citylist=[0]*N
#０からN-1までのN要素のリスト生成
for j in range(N):
citylist[j]=j
Plist=list(itertools.permutations(citylist))
for l in range(math.factorial(N)):
L=0
for k in range(N-1):
L+=((int(A[Plist[l][k]][x])-int(A[Plist[l][k+1]][x]))**2+(int(A[Plist[l][k]][y])-int(A[Plist[l][k+1]][y]))**2)**(1/2)
num+=L
print((num/math.factorial(N)))
| N=int(eval(input()))
A=[]
for l in range(N):
array = list(map(int, input().split()))
A.append(array)
import math
import itertools as ir
x=0
y=1
#街u,vの距離
def distance(u,v):
distance = math.sqrt( (A[u][x]-A[v][x])**2 + (A[u][y]-A[v][y])**2 )
return distance
#街リストの生成（街0からN-1）
city_list=[]
for i in range(N):
city_list.append(i)
#街のまわり方の並べ方
permutations=list(ir.permutations(city_list))
#距離の計算(一パターンを組み合わせ分だけ）
sum_distance=0
for j in range(math.factorial(N)):
for k in range(N-1):
sum_distance+=distance(permutations[j][k],permutations[j][k+1])
result=sum_distance/math.factorial(N)
print(result)
| 23 | 27 | 467 | 634 | N = int(eval(input()))
A = [input().split() for i in range(N)]
x = 0
y = 1
L = 0
num = 0
import itertools
import math
citylist = [0] * N
# ０からN-1までのN要素のリスト生成
for j in range(N):
citylist[j] = j
Plist = list(itertools.permutations(citylist))
for l in range(math.factorial(N)):
L = 0
for k in range(N - 1):
L += (
(int(A[Plist[l][k]][x]) - int(A[Plist[l][k + 1]][x])) ** 2
+ (int(A[Plist[l][k]][y]) - int(A[Plist[l][k + 1]][y])) ** 2
) ** (1 / 2)
num += L
print((num / math.factorial(N)))
| N = int(eval(input()))
A = []
for l in range(N):
array = list(map(int, input().split()))
A.append(array)
import math
import itertools as ir
x = 0
y = 1
# 街u,vの距離
def distance(u, v):
distance = math.sqrt((A[u][x] - A[v][x]) ** 2 + (A[u][y] - A[v][y]) ** 2)
return distance
# 街リストの生成（街0からN-1）
city_list = []
for i in range(N):
city_list.append(i)
# 街のまわり方の並べ方
permutations = list(ir.permutations(city_list))
# 距離の計算(一パターンを組み合わせ分だけ）
sum_distance = 0
for j in range(math.factorial(N)):
for k in range(N - 1):
sum_distance += distance(permutations[j][k], permutations[j][k + 1])
result = sum_distance / math.factorial(N)
print(result)
| false | 14.814815 | [
"-A = [input().split() for i in range(N)]",
"+A = []",
"+for l in range(N):",
"+ array = list(map(int, input().split()))",
"+ A.append(array)",
"+import math",
"+import itertools as ir",
"+",
"-L = 0",
"-num = 0",
"-import itertools",
"-import math",
"+# 街u,vの距離",
"+def distance(u, v):",
"+ distance = math.sqrt((A[u][x] - A[v][x]) ** 2 + (A[u][y] - A[v][y]) ** 2)",
"+ return distance",
"-citylist = [0] * N",
"-# ０からN-1までのN要素のリスト生成",
"-for j in range(N):",
"- citylist[j] = j",
"-Plist = list(itertools.permutations(citylist))",
"-for l in range(math.factorial(N)):",
"- L = 0",
"+",
"+# 街リストの生成（街0からN-1）",
"+city_list = []",
"+for i in range(N):",
"+ city_list.append(i)",
"+# 街のまわり方の並べ方",
"+permutations = list(ir.permutations(city_list))",
"+# 距離の計算(一パターンを組み合わせ分だけ）",
"+sum_distance = 0",
"+for j in range(math.factorial(N)):",
"- L += (",
"- (int(A[Plist[l][k]][x]) - int(A[Plist[l][k + 1]][x])) ** 2",
"- + (int(A[Plist[l][k]][y]) - int(A[Plist[l][k + 1]][y])) ** 2",
"- ) ** (1 / 2)",
"- num += L",
"-print((num / math.factorial(N)))",
"+ sum_distance += distance(permutations[j][k], permutations[j][k + 1])",
"+result = sum_distance / math.factorial(N)",
"+print(result)"
] | false | 0.042712 | 0.043642 | 0.978692 | [
"s772816604",
"s533043248"
] |
u591143370 | p02623 | python | s438546475 | s648210610 | 291 | 178 | 40,376 | 118,160 | Accepted | Accepted | 38.83 | import bisect
N,M,K = list(map(int, input().split()))
A= list(map(int, input().split()))
B = list(map(int, input().split()))
for i in range(1,len(A)):
A[i]+=A[i-1]
for i in range(1,len(B)):
B[i]+=B[i-1]
honn=a=bisect.bisect(B,K)
for i in range(len(A)):
s=K-A[i]
if s>=0:
a=bisect.bisect(B,s)
if i+1+a>honn:
honn=i+1+a
print(honn) | import bisect
N,M,K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
for i in range(1,N):
A[i]+=A[i-1]
index = bisect.bisect(A,K)
for i in range(M):
K-=B[i]
if K>=0:
a=bisect.bisect(A,K)
if a+i+1>=index:
index=a+i+1
print(index) | 16 | 15 | 382 | 334 | import bisect
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
for i in range(1, len(A)):
A[i] += A[i - 1]
for i in range(1, len(B)):
B[i] += B[i - 1]
honn = a = bisect.bisect(B, K)
for i in range(len(A)):
s = K - A[i]
if s >= 0:
a = bisect.bisect(B, s)
if i + 1 + a > honn:
honn = i + 1 + a
print(honn)
| import bisect
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
for i in range(1, N):
A[i] += A[i - 1]
index = bisect.bisect(A, K)
for i in range(M):
K -= B[i]
if K >= 0:
a = bisect.bisect(A, K)
if a + i + 1 >= index:
index = a + i + 1
print(index)
| false | 6.25 | [
"-for i in range(1, len(A)):",
"+for i in range(1, N):",
"-for i in range(1, len(B)):",
"- B[i] += B[i - 1]",
"-honn = a = bisect.bisect(B, K)",
"-for i in range(len(A)):",
"- s = K - A[i]",
"- if s >= 0:",
"- a = bisect.bisect(B, s)",
"- if i + 1 + a > honn:",
"- honn = i + 1 + a",
"-print(honn)",
"+index = bisect.bisect(A, K)",
"+for i in range(M):",
"+ K -= B[i]",
"+ if K >= 0:",
"+ a = bisect.bisect(A, K)",
"+ if a + i + 1 >= index:",
"+ index = a + i + 1",
"+print(index)"
] | false | 0.101321 | 0.00737 | 13.747848 | [
"s438546475",
"s648210610"
] |
u197300260 | p03658 | python | s050818277 | s332020430 | 23 | 17 | 3,696 | 3,064 | Accepted | Accepted | 26.09 | # _*_ coding:utf-8 _*_
# Atcoder_Beginners_Contest067-B
# TODO https://atcoder.jp/contests/abc067/tasks/abc067_b
import time
from contextlib import contextmanager
# from time import sleep
@contextmanager
def timer(title):
t0 = time.time()
yield
print(("{} - done in {:.0f}s".format(title,time.time()-t0) ))
def calcLongSnakeToy(needBarNumber,barLengthList):
longSortedToyList = sorted(barLengthList,reverse=True)
getBarCountRange = list(range(0,needBarNumber,+1))
longLength = 0
for i in getBarCountRange:
longLength = longLength + longSortedToyList[i]
answer = longLength
return answer
if __name__ == '__main__':
_,K = list(map(int,input().strip().split(' ')))
lengthList = list(map(int,input().strip().split(' ')))
solution=calcLongSnakeToy(K,lengthList)
print(("{}".format(solution))) | # Problem: https://atcoder.jp/contests/abc067/tasks/abc067_b
# Python 1st Try
import sys
# from collections import defaultdict
# import heapq,copy
# from collections import deque
def II(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def solver(selectNum, barLongth):
result = 0
barLongth.sort(reverse=True)
# print("{}".format(barLongth))
# algorithm
j = 0
while j < selectNum:
result = result + barLongth[j]
j = j + 1
return result
if __name__ == "__main__":
_, K = MI() # Nは要らない
LII = LI()
print(("{}".format(solver(K, LII))))
| 27 | 37 | 818 | 806 | # _*_ coding:utf-8 _*_
# Atcoder_Beginners_Contest067-B
# TODO https://atcoder.jp/contests/abc067/tasks/abc067_b
import time
from contextlib import contextmanager
# from time import sleep
@contextmanager
def timer(title):
t0 = time.time()
yield
print(("{} - done in {:.0f}s".format(title, time.time() - t0)))
def calcLongSnakeToy(needBarNumber, barLengthList):
longSortedToyList = sorted(barLengthList, reverse=True)
getBarCountRange = list(range(0, needBarNumber, +1))
longLength = 0
for i in getBarCountRange:
longLength = longLength + longSortedToyList[i]
answer = longLength
return answer
if __name__ == "__main__":
_, K = list(map(int, input().strip().split(" ")))
lengthList = list(map(int, input().strip().split(" ")))
solution = calcLongSnakeToy(K, lengthList)
print(("{}".format(solution)))
| # Problem: https://atcoder.jp/contests/abc067/tasks/abc067_b
# Python 1st Try
import sys
# from collections import defaultdict
# import heapq,copy
# from collections import deque
def II():
return int(sys.stdin.readline())
def MI():
return list(map(int, sys.stdin.readline().split()))
def LI():
return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number):
return [LI() for _ in range(rows_number)]
def solver(selectNum, barLongth):
result = 0
barLongth.sort(reverse=True)
# print("{}".format(barLongth))
# algorithm
j = 0
while j < selectNum:
result = result + barLongth[j]
j = j + 1
return result
if __name__ == "__main__":
_, K = MI() # Nは要らない
LII = LI()
print(("{}".format(solver(K, LII))))
| false | 27.027027 | [
"-# _*_ coding:utf-8 _*_",
"-# Atcoder_Beginners_Contest067-B",
"-# TODO https://atcoder.jp/contests/abc067/tasks/abc067_b",
"-import time",
"-from contextlib import contextmanager",
"+# Problem: https://atcoder.jp/contests/abc067/tasks/abc067_b",
"+# Python 1st Try",
"+import sys",
"-# from time import sleep",
"-@contextmanager",
"-def timer(title):",
"- t0 = time.time()",
"- yield",
"- print((\"{} - done in {:.0f}s\".format(title, time.time() - t0)))",
"+# from collections import defaultdict",
"+# import heapq,copy",
"+# from collections import deque",
"+def II():",
"+ return int(sys.stdin.readline())",
"-def calcLongSnakeToy(needBarNumber, barLengthList):",
"- longSortedToyList = sorted(barLengthList, reverse=True)",
"- getBarCountRange = list(range(0, needBarNumber, +1))",
"- longLength = 0",
"- for i in getBarCountRange:",
"- longLength = longLength + longSortedToyList[i]",
"- answer = longLength",
"- return answer",
"+def MI():",
"+ return list(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 solver(selectNum, barLongth):",
"+ result = 0",
"+ barLongth.sort(reverse=True)",
"+ # print(\"{}\".format(barLongth))",
"+ # algorithm",
"+ j = 0",
"+ while j < selectNum:",
"+ result = result + barLongth[j]",
"+ j = j + 1",
"+ return result",
"- _, K = list(map(int, input().strip().split(\" \")))",
"- lengthList = list(map(int, input().strip().split(\" \")))",
"- solution = calcLongSnakeToy(K, lengthList)",
"- print((\"{}\".format(solution)))",
"+ _, K = MI() # Nは要らない",
"+ LII = LI()",
"+ print((\"{}\".format(solver(K, LII))))"
] | false | 0.03703 | 0.042279 | 0.875853 | [
"s050818277",
"s332020430"
] |
u638795007 | p03305 | python | s565783291 | s858865121 | 1,981 | 1,113 | 121,944 | 104,792 | Accepted | Accepted | 43.82 | def dijkstra_heap(n,s,edge,k):
# 始点sから各頂点への最短距離
d = [float("inf")] * n
used = [True] * n # True:未確定
d[s] = 0
used[s] = False
edgelist = []
for e in edge[s]:
heappush(edgelist, [e[k],e[2]])
while edgelist:
minedge = heappop(edgelist)
# まだ使われてない頂点の中から最小の距離のものを探す
if not used[minedge[1]]:
continue
v = minedge[1]
d[v] = minedge[0]
used[v] = False
for e in edge[v]:
if used[e[2]]:
heappush(edgelist, [e[k] + d[v], e[2]])
return d
def examD():
N, M, s, t = LI()
edge = defaultdict(list)
# edge2 = defaultdict(list)
# edge2 メモリ無駄
for i in range(M):
x, y, z1, z2 = list(map(int, input().split()))
x -=1; y -=1
edge[x].append((z1,z2,y))
edge[y].append((z1,z2,x))
start1 = s-1
start2 = t-1
res1 = dijkstra_heap(N,start1, edge,0)
res2 = dijkstra_heap(N,start2, edge,1)
ans = []
snuke = 10**15
cur = res1[N-1] + res2[N-1]
ans.append(snuke-cur)
for i in range(N-2,-1,-1):
if res1[i] + res2[i]<cur:
cur = res1[i] + res2[i]
ans.append(snuke-cur)
else:
ans.append(snuke-cur)
for v in ans[::-1]:
print(v)
import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')
examD()
| def dijkstra_heap(n,s,edge,k):
# 始点sから各頂点への最短距離
d = [float("inf")] * n
d[s] = 0
edgelist = [s]
while edgelist:
nextedge = []
for i in edgelist:
for j in edge[i]:
next = j[2]
c = j[k]
if d[next] > c + d[i]:
d[next] = c + d[i]
nextedge.append(next)
edgelist = nextedge
return d
def examD():
N, M, s, t = LI()
edge = defaultdict(list)
# edge2 = defaultdict(list)
# edge2 メモリ無駄
for i in range(M):
x, y, z1, z2 = list(map(int, input().split()))
x -=1; y -=1
edge[x].append((z1,z2,y))
edge[y].append((z1,z2,x))
start1 = s-1
start2 = t-1
res1 = dijkstra_heap(N,start1, edge,0)
res2 = dijkstra_heap(N,start2, edge,1)
ans = []
snuke = 10**15
cur = res1[N-1] + res2[N-1]
ans.append(cur)
for i in range(N-2,-1,-1):
if res1[i] + res2[i]<cur:
cur = res1[i] + res2[i]
ans.append(cur)
else:
ans.append(cur)
for v in ans[::-1]:
print((snuke-v))
import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')
examD()
| 61 | 56 | 1,775 | 1,615 | def dijkstra_heap(n, s, edge, k):
# 始点sから各頂点への最短距離
d = [float("inf")] * n
used = [True] * n # True:未確定
d[s] = 0
used[s] = False
edgelist = []
for e in edge[s]:
heappush(edgelist, [e[k], e[2]])
while edgelist:
minedge = heappop(edgelist)
# まだ使われてない頂点の中から最小の距離のものを探す
if not used[minedge[1]]:
continue
v = minedge[1]
d[v] = minedge[0]
used[v] = False
for e in edge[v]:
if used[e[2]]:
heappush(edgelist, [e[k] + d[v], e[2]])
return d
def examD():
N, M, s, t = LI()
edge = defaultdict(list)
# edge2 = defaultdict(list)
# edge2 メモリ無駄
for i in range(M):
x, y, z1, z2 = list(map(int, input().split()))
x -= 1
y -= 1
edge[x].append((z1, z2, y))
edge[y].append((z1, z2, x))
start1 = s - 1
start2 = t - 1
res1 = dijkstra_heap(N, start1, edge, 0)
res2 = dijkstra_heap(N, start2, edge, 1)
ans = []
snuke = 10**15
cur = res1[N - 1] + res2[N - 1]
ans.append(snuke - cur)
for i in range(N - 2, -1, -1):
if res1[i] + res2[i] < cur:
cur = res1[i] + res2[i]
ans.append(snuke - cur)
else:
ans.append(snuke - cur)
for v in ans[::-1]:
print(v)
import sys, copy, bisect, itertools, heapq, math
from heapq import heappop, heappush, heapify
from collections import Counter, defaultdict, deque
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
def LSI():
return list(map(str, sys.stdin.readline().split()))
def LS():
return sys.stdin.readline().split()
def SI():
return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float("inf")
examD()
| def dijkstra_heap(n, s, edge, k):
# 始点sから各頂点への最短距離
d = [float("inf")] * n
d[s] = 0
edgelist = [s]
while edgelist:
nextedge = []
for i in edgelist:
for j in edge[i]:
next = j[2]
c = j[k]
if d[next] > c + d[i]:
d[next] = c + d[i]
nextedge.append(next)
edgelist = nextedge
return d
def examD():
N, M, s, t = LI()
edge = defaultdict(list)
# edge2 = defaultdict(list)
# edge2 メモリ無駄
for i in range(M):
x, y, z1, z2 = list(map(int, input().split()))
x -= 1
y -= 1
edge[x].append((z1, z2, y))
edge[y].append((z1, z2, x))
start1 = s - 1
start2 = t - 1
res1 = dijkstra_heap(N, start1, edge, 0)
res2 = dijkstra_heap(N, start2, edge, 1)
ans = []
snuke = 10**15
cur = res1[N - 1] + res2[N - 1]
ans.append(cur)
for i in range(N - 2, -1, -1):
if res1[i] + res2[i] < cur:
cur = res1[i] + res2[i]
ans.append(cur)
else:
ans.append(cur)
for v in ans[::-1]:
print((snuke - v))
import sys, copy, bisect, itertools, heapq, math
from heapq import heappop, heappush, heapify
from collections import Counter, defaultdict, deque
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
def LSI():
return list(map(str, sys.stdin.readline().split()))
def LS():
return sys.stdin.readline().split()
def SI():
return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float("inf")
examD()
| false | 8.196721 | [
"- used = [True] * n # True:未確定",
"- used[s] = False",
"- edgelist = []",
"- for e in edge[s]:",
"- heappush(edgelist, [e[k], e[2]])",
"+ edgelist = [s]",
"- minedge = heappop(edgelist)",
"- # まだ使われてない頂点の中から最小の距離のものを探す",
"- if not used[minedge[1]]:",
"- continue",
"- v = minedge[1]",
"- d[v] = minedge[0]",
"- used[v] = False",
"- for e in edge[v]:",
"- if used[e[2]]:",
"- heappush(edgelist, [e[k] + d[v], e[2]])",
"+ nextedge = []",
"+ for i in edgelist:",
"+ for j in edge[i]:",
"+ next = j[2]",
"+ c = j[k]",
"+ if d[next] > c + d[i]:",
"+ d[next] = c + d[i]",
"+ nextedge.append(next)",
"+ edgelist = nextedge",
"- ans.append(snuke - cur)",
"+ ans.append(cur)",
"- ans.append(snuke - cur)",
"+ ans.append(cur)",
"- ans.append(snuke - cur)",
"+ ans.append(cur)",
"- print(v)",
"+ print((snuke - v))"
] | false | 0.037443 | 0.036087 | 1.037589 | [
"s565783291",
"s858865121"
] |
u440566786 | p03378 | python | s532438735 | s760846621 | 163 | 66 | 38,256 | 62,000 | Accepted | Accepted | 59.51 | n,m,p = list(map(int,input().split()))
a = list(map(int,input().split()))
up = len(list([x for x in a if x>p]))
down = len(list([x for x in a if x<p]))
print((min(up,down))) | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
n, m, x = list(map(int, input().split()))
toll = [False] * (n + 1)
for a in map(int, input().split()):
toll[a] = True
back = 0
for i in range(x - 1, -1, -1):
back += toll[i]
forth = 0
for i in range(x + 1, n + 1):
forth += toll[i]
print((min(back, forth)))
resolve() | 5 | 19 | 171 | 480 | n, m, p = list(map(int, input().split()))
a = list(map(int, input().split()))
up = len(list([x for x in a if x > p]))
down = len(list([x for x in a if x < p]))
print((min(up, down)))
| import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda: sys.stdin.readline().rstrip()
def resolve():
n, m, x = list(map(int, input().split()))
toll = [False] * (n + 1)
for a in map(int, input().split()):
toll[a] = True
back = 0
for i in range(x - 1, -1, -1):
back += toll[i]
forth = 0
for i in range(x + 1, n + 1):
forth += toll[i]
print((min(back, forth)))
resolve()
| false | 73.684211 | [
"-n, m, p = list(map(int, input().split()))",
"-a = list(map(int, input().split()))",
"-up = len(list([x for x in a if x > p]))",
"-down = len(list([x for x in a if x < p]))",
"-print((min(up, down)))",
"+import sys",
"+",
"+INF = 1 << 60",
"+MOD = 10**9 + 7 # 998244353",
"+sys.setrecursionlimit(2147483647)",
"+input = lambda: sys.stdin.readline().rstrip()",
"+",
"+",
"+def resolve():",
"+ n, m, x = list(map(int, input().split()))",
"+ toll = [False] * (n + 1)",
"+ for a in map(int, input().split()):",
"+ toll[a] = True",
"+ back = 0",
"+ for i in range(x - 1, -1, -1):",
"+ back += toll[i]",
"+ forth = 0",
"+ for i in range(x + 1, n + 1):",
"+ forth += toll[i]",
"+ print((min(back, forth)))",
"+",
"+",
"+resolve()"
] | false | 0.049134 | 0.048127 | 1.020926 | [
"s532438735",
"s760846621"
] |
u812576525 | p03127 | python | s009752079 | s436214131 | 140 | 80 | 14,252 | 14,224 | Accepted | Accepted | 42.86 | N = int(eval(input()))
A = list(map(int,input().split()))
A = sorted(A,reverse = False)
B = [A[0]]
for i in range(N):
if A[i]%A[0] != 0:
B.append(A[i]%A[0])
B = set(B)
#B = sorted(B,reverse = False)
#import math
import fractions
from functools import reduce
def gcd_list(numbers):
#return reduce(math.gcd, numbers)
return reduce(fractions.gcd, numbers)
print((gcd_list(B))) | N = int(eval(input()))
A = list(map(int,input().split()))
import fractions
from functools import reduce
def gcd_list(numbers):
#return reduce(math.gcd, numbers)
return reduce(fractions.gcd, numbers)
print((gcd_list(A))) | 20 | 11 | 410 | 232 | N = int(eval(input()))
A = list(map(int, input().split()))
A = sorted(A, reverse=False)
B = [A[0]]
for i in range(N):
if A[i] % A[0] != 0:
B.append(A[i] % A[0])
B = set(B)
# B = sorted(B,reverse = False)
# import math
import fractions
from functools import reduce
def gcd_list(numbers):
# return reduce(math.gcd, numbers)
return reduce(fractions.gcd, numbers)
print((gcd_list(B)))
| N = int(eval(input()))
A = list(map(int, input().split()))
import fractions
from functools import reduce
def gcd_list(numbers):
# return reduce(math.gcd, numbers)
return reduce(fractions.gcd, numbers)
print((gcd_list(A)))
| false | 45 | [
"-A = sorted(A, reverse=False)",
"-B = [A[0]]",
"-for i in range(N):",
"- if A[i] % A[0] != 0:",
"- B.append(A[i] % A[0])",
"-B = set(B)",
"-# B = sorted(B,reverse = False)",
"-# import math",
"-print((gcd_list(B)))",
"+print((gcd_list(A)))"
] | false | 0.043454 | 0.045531 | 0.95438 | [
"s009752079",
"s436214131"
] |
u039189422 | p02837 | python | s952986293 | s930443977 | 935 | 238 | 3,064 | 3,064 | Accepted | Accepted | 74.55 | n=int(eval(input()))
X=[]*n
A=[]*n
for i in range(n):
a=int(eval(input()))
A.append(a)
xy = [list(map(int,input().split())) for _ in range(a)]
X.append(xy)
ans=0
for i in range(2**n):
cnt=0
for j in range(n):
if (i>>j)&1:
for k,l in X[j]:
if not ((i>>(k-1))&1)==l:
cnt=1
if cnt==0:
ans = max(ans,bin(i).count("1"))
print(ans) | n=int(eval(input()))
X=[]*n
A=[]*n
for i in range(n):
a=int(eval(input()))
A.append(a)
xy = [list(map(int,input().split())) for _ in range(a)]
X.append(xy)
ans=0
for i in range(2**n):
cnt=0
for j in range(n):
if (i>>j)&1:
for k,l in X[j]:
if not ((i>>(k-1))&1)==l:
cnt=1
break
if cnt==0:
ans = max(ans,bin(i).count("1"))
print(ans) | 23 | 24 | 362 | 374 | n = int(eval(input()))
X = [] * n
A = [] * n
for i in range(n):
a = int(eval(input()))
A.append(a)
xy = [list(map(int, input().split())) for _ in range(a)]
X.append(xy)
ans = 0
for i in range(2**n):
cnt = 0
for j in range(n):
if (i >> j) & 1:
for k, l in X[j]:
if not ((i >> (k - 1)) & 1) == l:
cnt = 1
if cnt == 0:
ans = max(ans, bin(i).count("1"))
print(ans)
| n = int(eval(input()))
X = [] * n
A = [] * n
for i in range(n):
a = int(eval(input()))
A.append(a)
xy = [list(map(int, input().split())) for _ in range(a)]
X.append(xy)
ans = 0
for i in range(2**n):
cnt = 0
for j in range(n):
if (i >> j) & 1:
for k, l in X[j]:
if not ((i >> (k - 1)) & 1) == l:
cnt = 1
break
if cnt == 0:
ans = max(ans, bin(i).count("1"))
print(ans)
| false | 4.166667 | [
"+ break"
] | false | 0.044166 | 0.037173 | 1.188121 | [
"s952986293",
"s930443977"
] |
u191874006 | p03059 | python | s992299966 | s961482531 | 163 | 82 | 38,256 | 65,356 | Accepted | Accepted | 49.69 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
a,b,t = LI()
print((t//a*b)) | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
a, b, t = LI()
ans = 0
i = 1
while i*a <= t:
ans += b
i += 1
print(ans) | 21 | 26 | 587 | 645 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop, heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float("inf")
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
a, b, t = LI()
print((t // a * b))
| #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop, heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float("inf")
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
a, b, t = LI()
ans = 0
i = 1
while i * a <= t:
ans += b
i += 1
print(ans)
| false | 19.230769 | [
"-print((t // a * b))",
"+ans = 0",
"+i = 1",
"+while i * a <= t:",
"+ ans += b",
"+ i += 1",
"+print(ans)"
] | false | 0.083789 | 0.066394 | 1.261998 | [
"s992299966",
"s961482531"
] |
u724687935 | p02626 | python | s977219630 | s511194598 | 64 | 33 | 62,668 | 9,096 | Accepted | Accepted | 48.44 | N = int(eval(input()))
A = list(map(int, input().split()))
a, b = A[0], A[1]
X = 0
for i in range(2, N):
X ^= A[i]
S = a + b
M = 42
dp = [[[-1] * 2 for _ in range(2)] for _ in range(M + 1)]
dp[0][0][0] = 0
v = 1
for i in range(M):
cs = S & 1
cx = X & 1
ca = a & 1
for j in range(2):
for k in range(2):
if dp[i][j][k] == -1:
continue
for na in range(2):
for nb in range(2):
# 条件②: A' ^ B' = X
if na ^ nb != cx:
continue
# 条件①: A' + B' = S
ns = na + nb + j
if ns & 1 != cs:
continue
ni = i + 1
nj = 1 if ns >= 2 else 0
if na > ca:
nk = 1
elif na < ca:
nk = 0
else:
nk = k
dp[ni][nj][nk] = max(dp[ni][nj][nk], dp[i][j][k] + na * v)
S >>= 1
X >>= 1
a >>= 1
v <<= 1
ans = dp[M][0][0]
if ans <= 0:
print((-1))
else:
print((A[0] - ans))
| N = int(eval(input()))
A = list(map(int, input().split()))
# a = A_1, b = A_2, x = A_3 ^ ... ^ A_N, s = a + b とする
a, b = A[0], A[1]
x = 0
for i in range(2, N):
x ^= A[i]
s = a + b
M = 42
# dp[桁][繰り上げフラグ][これまでの桁でAより大きいフラグ] := Aとなり得る値の最大値
dp = [[[-1] * 2 for _ in range(2)] for _ in range(M + 1)]
dp[0][0][0] = 0
v = 1
for i in range(M):
cs = s & 1
cx = x & 1
ca = a & 1
for j in range(2):
for k in range(2):
if dp[i][j][k] == -1:
continue
for na in range(2):
for nb in range(2):
# 条件1: na ^ nb = x
if na ^ nb != cx:
continue
# 条件2: na + nb = S
ns = na + nb + j
if ns & 1 != cs:
continue
# 遷移先のi, j, kを求める
ni = i + 1
nj = 1 if ns >= 2 else 0
if na > ca:
nk = 1
elif na < ca:
nk = 0
else:
nk = k
# 遷移先を最大化
dp[ni][nj][nk] = max(dp[ni][nj][nk], dp[i][j][k] + na * v)
s >>= 1
x >>= 1
a >>= 1
v <<= 1
amax = dp[M][0][0]
if amax <= 0:
print((-1))
else:
print((A[0] - amax))
| 51 | 55 | 1,263 | 1,443 | N = int(eval(input()))
A = list(map(int, input().split()))
a, b = A[0], A[1]
X = 0
for i in range(2, N):
X ^= A[i]
S = a + b
M = 42
dp = [[[-1] * 2 for _ in range(2)] for _ in range(M + 1)]
dp[0][0][0] = 0
v = 1
for i in range(M):
cs = S & 1
cx = X & 1
ca = a & 1
for j in range(2):
for k in range(2):
if dp[i][j][k] == -1:
continue
for na in range(2):
for nb in range(2):
# 条件②: A' ^ B' = X
if na ^ nb != cx:
continue
# 条件①: A' + B' = S
ns = na + nb + j
if ns & 1 != cs:
continue
ni = i + 1
nj = 1 if ns >= 2 else 0
if na > ca:
nk = 1
elif na < ca:
nk = 0
else:
nk = k
dp[ni][nj][nk] = max(dp[ni][nj][nk], dp[i][j][k] + na * v)
S >>= 1
X >>= 1
a >>= 1
v <<= 1
ans = dp[M][0][0]
if ans <= 0:
print((-1))
else:
print((A[0] - ans))
| N = int(eval(input()))
A = list(map(int, input().split()))
# a = A_1, b = A_2, x = A_3 ^ ... ^ A_N, s = a + b とする
a, b = A[0], A[1]
x = 0
for i in range(2, N):
x ^= A[i]
s = a + b
M = 42
# dp[桁][繰り上げフラグ][これまでの桁でAより大きいフラグ] := Aとなり得る値の最大値
dp = [[[-1] * 2 for _ in range(2)] for _ in range(M + 1)]
dp[0][0][0] = 0
v = 1
for i in range(M):
cs = s & 1
cx = x & 1
ca = a & 1
for j in range(2):
for k in range(2):
if dp[i][j][k] == -1:
continue
for na in range(2):
for nb in range(2):
# 条件1: na ^ nb = x
if na ^ nb != cx:
continue
# 条件2: na + nb = S
ns = na + nb + j
if ns & 1 != cs:
continue
# 遷移先のi, j, kを求める
ni = i + 1
nj = 1 if ns >= 2 else 0
if na > ca:
nk = 1
elif na < ca:
nk = 0
else:
nk = k
# 遷移先を最大化
dp[ni][nj][nk] = max(dp[ni][nj][nk], dp[i][j][k] + na * v)
s >>= 1
x >>= 1
a >>= 1
v <<= 1
amax = dp[M][0][0]
if amax <= 0:
print((-1))
else:
print((A[0] - amax))
| false | 7.272727 | [
"+# a = A_1, b = A_2, x = A_3 ^ ... ^ A_N, s = a + b とする",
"-X = 0",
"+x = 0",
"- X ^= A[i]",
"-S = a + b",
"+ x ^= A[i]",
"+s = a + b",
"+# dp[桁][繰り上げフラグ][これまでの桁でAより大きいフラグ] := Aとなり得る値の最大値",
"- cs = S & 1",
"- cx = X & 1",
"+ cs = s & 1",
"+ cx = x & 1",
"- # 条件②: A' ^ B' = X",
"+ # 条件1: na ^ nb = x",
"- # 条件①: A' + B' = S",
"+ # 条件2: na + nb = S",
"+ # 遷移先のi, j, kを求める",
"+ # 遷移先を最大化",
"- S >>= 1",
"- X >>= 1",
"+ s >>= 1",
"+ x >>= 1",
"-ans = dp[M][0][0]",
"-if ans <= 0:",
"+amax = dp[M][0][0]",
"+if amax <= 0:",
"- print((A[0] - ans))",
"+ print((A[0] - amax))"
] | false | 0.035707 | 0.035525 | 1.00512 | [
"s977219630",
"s511194598"
] |
u174849391 | p02784 | python | s084938970 | s334096237 | 55 | 49 | 20,964 | 20,500 | Accepted | Accepted | 10.91 | def atc_153b(a: str, b: str) -> str:
HN = a.split(" ")
H = int(HN[0])
N = int(HN[1])
A = b.split(" ")
A_int = [int(ai) for ai in A]
damage = sum(A_int)
if (H - damage) <= 0:
return "Yes"
else:
return "No"
a = eval(input())
b = eval(input())
print((atc_153b(a, b))) | H,N=list(map(int,input().split()))
attack = list(map(int,input().split()))
total = sum(attack)
if H - total <= 0:
print("Yes")
else:
print("No") | 18 | 10 | 319 | 158 | def atc_153b(a: str, b: str) -> str:
HN = a.split(" ")
H = int(HN[0])
N = int(HN[1])
A = b.split(" ")
A_int = [int(ai) for ai in A]
damage = sum(A_int)
if (H - damage) <= 0:
return "Yes"
else:
return "No"
a = eval(input())
b = eval(input())
print((atc_153b(a, b)))
| H, N = list(map(int, input().split()))
attack = list(map(int, input().split()))
total = sum(attack)
if H - total <= 0:
print("Yes")
else:
print("No")
| false | 44.444444 | [
"-def atc_153b(a: str, b: str) -> str:",
"- HN = a.split(\" \")",
"- H = int(HN[0])",
"- N = int(HN[1])",
"- A = b.split(\" \")",
"- A_int = [int(ai) for ai in A]",
"- damage = sum(A_int)",
"- if (H - damage) <= 0:",
"- return \"Yes\"",
"- else:",
"- return \"No\"",
"-",
"-",
"-a = eval(input())",
"-b = eval(input())",
"-print((atc_153b(a, b)))",
"+H, N = list(map(int, input().split()))",
"+attack = list(map(int, input().split()))",
"+total = sum(attack)",
"+if H - total <= 0:",
"+ print(\"Yes\")",
"+else:",
"+ print(\"No\")"
] | false | 0.039362 | 0.04579 | 0.859612 | [
"s084938970",
"s334096237"
] |
u057109575 | p02813 | python | s451323892 | s582062124 | 182 | 116 | 39,024 | 69,336 | Accepted | Accepted | 36.26 | from itertools import permutations
N = int(eval(input()))
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
a = 0
b = 0
for i, v in enumerate(permutations(list(range(1, N + 1)), N)):
if v == P:
a = i
if v == Q:
b = i
print((abs(a - b)))
| N = int(eval(input()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
def dfs(x, d, res):
if len(x) == N + 1:
d[0] += 1
if x[1:] == P:
res["P"] = d[0]
if x[1:] == Q:
res["Q"] = d[0]
return
for v in range(1, N + 1):
if v not in x:
x.append(v)
dfs(x, d, res)
x.pop()
res = {"P": 0, "Q": 0}
dfs([0], [0], res)
print((abs(res["P"] - res["Q"])))
| 15 | 23 | 288 | 492 | from itertools import permutations
N = int(eval(input()))
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
a = 0
b = 0
for i, v in enumerate(permutations(list(range(1, N + 1)), N)):
if v == P:
a = i
if v == Q:
b = i
print((abs(a - b)))
| N = int(eval(input()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
def dfs(x, d, res):
if len(x) == N + 1:
d[0] += 1
if x[1:] == P:
res["P"] = d[0]
if x[1:] == Q:
res["Q"] = d[0]
return
for v in range(1, N + 1):
if v not in x:
x.append(v)
dfs(x, d, res)
x.pop()
res = {"P": 0, "Q": 0}
dfs([0], [0], res)
print((abs(res["P"] - res["Q"])))
| false | 34.782609 | [
"-from itertools import permutations",
"+N = int(eval(input()))",
"+P = list(map(int, input().split()))",
"+Q = list(map(int, input().split()))",
"-N = int(eval(input()))",
"-P = tuple(map(int, input().split()))",
"-Q = tuple(map(int, input().split()))",
"-a = 0",
"-b = 0",
"-for i, v in enumerate(permutations(list(range(1, N + 1)), N)):",
"- if v == P:",
"- a = i",
"- if v == Q:",
"- b = i",
"-print((abs(a - b)))",
"+",
"+def dfs(x, d, res):",
"+ if len(x) == N + 1:",
"+ d[0] += 1",
"+ if x[1:] == P:",
"+ res[\"P\"] = d[0]",
"+ if x[1:] == Q:",
"+ res[\"Q\"] = d[0]",
"+ return",
"+ for v in range(1, N + 1):",
"+ if v not in x:",
"+ x.append(v)",
"+ dfs(x, d, res)",
"+ x.pop()",
"+",
"+",
"+res = {\"P\": 0, \"Q\": 0}",
"+dfs([0], [0], res)",
"+print((abs(res[\"P\"] - res[\"Q\"])))"
] | false | 0.033578 | 0.039438 | 0.851426 | [
"s451323892",
"s582062124"
] |
u670180528 | p02972 | python | s139876546 | s176894169 | 332 | 254 | 8,392 | 11,644 | Accepted | Accepted | 23.49 | n,*a = map(int,open(0).read().split())
b = [0]*(n+1)
for x in range(n,0,-1):
b[x] = (sum(b[x::x])+a[x-1])%2
print(b.count(1))
for i in range(n+1):
if b[i]:
print(i,end=" ")
| n,*a=map(int,open(0).read().split())
for x in range(n-1,0,-1):a[x-1]=(sum(a[x*2-1::x])+a[x-1])%2
print(a.count(1));print(*[i+1 for i in range(n)if a[i]],end=" ")
| 8 | 3 | 183 | 163 | n, *a = map(int, open(0).read().split())
b = [0] * (n + 1)
for x in range(n, 0, -1):
b[x] = (sum(b[x::x]) + a[x - 1]) % 2
print(b.count(1))
for i in range(n + 1):
if b[i]:
print(i, end=" ")
| n, *a = map(int, open(0).read().split())
for x in range(n - 1, 0, -1):
a[x - 1] = (sum(a[x * 2 - 1 :: x]) + a[x - 1]) % 2
print(a.count(1))
print(*[i + 1 for i in range(n) if a[i]], end=" ")
| false | 62.5 | [
"-b = [0] * (n + 1)",
"-for x in range(n, 0, -1):",
"- b[x] = (sum(b[x::x]) + a[x - 1]) % 2",
"-print(b.count(1))",
"-for i in range(n + 1):",
"- if b[i]:",
"- print(i, end=\" \")",
"+for x in range(n - 1, 0, -1):",
"+ a[x - 1] = (sum(a[x * 2 - 1 :: x]) + a[x - 1]) % 2",
"+print(a.count(1))",
"+print(*[i + 1 for i in range(n) if a[i]], end=\" \")"
] | false | 0.033008 | 0.042894 | 0.769533 | [
"s139876546",
"s176894169"
] |
u566428756 | p03680 | python | s388173083 | s362553192 | 225 | 198 | 17,892 | 17,892 | Accepted | Accepted | 12 | N=int(eval(input()))
D={i+1:int(eval(input())) for i in range(N)}
d=D[1]
ans=1
for i in range(N):
if d==2:
print(ans)
exit()
d=D[d]
ans+=1
print((-1)) | N=int(eval(input()))
A={i:int(eval(input())) for i in range(1,N+1)}
flag=0
k=1
for i in range(N):
k=A[k]
if k==2: flag=1; break
if flag: print((i+1))
else: print((-1)) | 11 | 11 | 174 | 171 | N = int(eval(input()))
D = {i + 1: int(eval(input())) for i in range(N)}
d = D[1]
ans = 1
for i in range(N):
if d == 2:
print(ans)
exit()
d = D[d]
ans += 1
print((-1))
| N = int(eval(input()))
A = {i: int(eval(input())) for i in range(1, N + 1)}
flag = 0
k = 1
for i in range(N):
k = A[k]
if k == 2:
flag = 1
break
if flag:
print((i + 1))
else:
print((-1))
| false | 0 | [
"-D = {i + 1: int(eval(input())) for i in range(N)}",
"-d = D[1]",
"-ans = 1",
"+A = {i: int(eval(input())) for i in range(1, N + 1)}",
"+flag = 0",
"+k = 1",
"- if d == 2:",
"- print(ans)",
"- exit()",
"- d = D[d]",
"- ans += 1",
"-print((-1))",
"+ k = A[k]",
"+ if k == 2:",
"+ flag = 1",
"+ break",
"+if flag:",
"+ print((i + 1))",
"+else:",
"+ print((-1))"
] | false | 0.067366 | 0.091531 | 0.73599 | [
"s388173083",
"s362553192"
] |
u379959788 | p03665 | python | s779349666 | s767597799 | 197 | 17 | 14,908 | 3,064 | Accepted | Accepted | 91.37 | from scipy.misc import comb
N, P = list(map(int, input().split()))
A = list(map(int, input().split()))
B = [0] * N
for i in range(N):
B[i] = A[i] % 2
num_1 = sum(B)
num_0 = N - num_1
cnt_num_1 = 0
for i in range(1, num_1+1, 2):
cnt_num_1 += comb(num_1, i, exact=True) * (2 ** num_0)
if P == 1:
print(cnt_num_1)
else:
print((2 ** N - cnt_num_1)) | N, P = list(map(int, input().split()))
A = list(map(int, input().split()))
num_0 = 0
num_1 = 0
for i in range(N):
if A[i] % 2 == 0:
num_0 += 1
else:
num_1 += 1
if num_1 == 0:
if P == 1:
ans = 0
else:
ans = 2 ** N
else:
ans = 2 ** (N-1)
print(ans) | 17 | 18 | 370 | 310 | from scipy.misc import comb
N, P = list(map(int, input().split()))
A = list(map(int, input().split()))
B = [0] * N
for i in range(N):
B[i] = A[i] % 2
num_1 = sum(B)
num_0 = N - num_1
cnt_num_1 = 0
for i in range(1, num_1 + 1, 2):
cnt_num_1 += comb(num_1, i, exact=True) * (2**num_0)
if P == 1:
print(cnt_num_1)
else:
print((2**N - cnt_num_1))
| N, P = list(map(int, input().split()))
A = list(map(int, input().split()))
num_0 = 0
num_1 = 0
for i in range(N):
if A[i] % 2 == 0:
num_0 += 1
else:
num_1 += 1
if num_1 == 0:
if P == 1:
ans = 0
else:
ans = 2**N
else:
ans = 2 ** (N - 1)
print(ans)
| false | 5.555556 | [
"-from scipy.misc import comb",
"-",
"-B = [0] * N",
"+num_0 = 0",
"+num_1 = 0",
"- B[i] = A[i] % 2",
"-num_1 = sum(B)",
"-num_0 = N - num_1",
"-cnt_num_1 = 0",
"-for i in range(1, num_1 + 1, 2):",
"- cnt_num_1 += comb(num_1, i, exact=True) * (2**num_0)",
"-if P == 1:",
"- print(cnt_num_1)",
"+ if A[i] % 2 == 0:",
"+ num_0 += 1",
"+ else:",
"+ num_1 += 1",
"+if num_1 == 0:",
"+ if P == 1:",
"+ ans = 0",
"+ else:",
"+ ans = 2**N",
"- print((2**N - cnt_num_1))",
"+ ans = 2 ** (N - 1)",
"+print(ans)"
] | false | 0.543257 | 0.034953 | 15.5425 | [
"s779349666",
"s767597799"
] |
u111365362 | p02582 | python | s803441403 | s331632549 | 98 | 89 | 61,588 | 61,560 | Accepted | Accepted | 9.18 | s = eval(input())
if s == 'SSS':
print((0))
elif s == 'RRR':
print((3))
elif s == 'RRS' or s == 'SRR':
print((2))
else:
print((1)) | s = eval(input())
if s == 'RRR':
print((3))
elif s == 'RRS' or s == 'SRR':
print((2))
elif s == 'SSS':
print((0))
else:
print((1)) | 9 | 9 | 132 | 132 | s = eval(input())
if s == "SSS":
print((0))
elif s == "RRR":
print((3))
elif s == "RRS" or s == "SRR":
print((2))
else:
print((1))
| s = eval(input())
if s == "RRR":
print((3))
elif s == "RRS" or s == "SRR":
print((2))
elif s == "SSS":
print((0))
else:
print((1))
| false | 0 | [
"-if s == \"SSS\":",
"- print((0))",
"-elif s == \"RRR\":",
"+if s == \"RRR\":",
"+elif s == \"SSS\":",
"+ print((0))"
] | false | 0.044816 | 0.117661 | 0.380886 | [
"s803441403",
"s331632549"
] |
u223663729 | p02982 | python | s425404584 | s152528863 | 20 | 17 | 2,940 | 2,940 | Accepted | Accepted | 15 | N, M = list(map(int, input().split()))
X = [tuple(map(int, input().split())) for _ in [0]*N]
cnt = 0
for i, x in enumerate(X):
for j in range(i+1, N):
d = 0
for y, z in zip(x, X[j]):
d += (y-z)**2
if (d**0.5).is_integer():
cnt += 1
print(cnt)
| N, D, *X = list(map(int, open(0).read().split()))
*X, = list(zip(*[iter(X)]*D))
cnt = 0
for i, x in enumerate(X):
for j in range(i+1, N):
d = 0
for y, z in zip(x, X[j]):
d += (y-z)**2
if (d**0.5).is_integer():
cnt += 1
print(cnt)
| 13 | 13 | 303 | 284 | N, M = list(map(int, input().split()))
X = [tuple(map(int, input().split())) for _ in [0] * N]
cnt = 0
for i, x in enumerate(X):
for j in range(i + 1, N):
d = 0
for y, z in zip(x, X[j]):
d += (y - z) ** 2
if (d**0.5).is_integer():
cnt += 1
print(cnt)
| N, D, *X = list(map(int, open(0).read().split()))
(*X,) = list(zip(*[iter(X)] * D))
cnt = 0
for i, x in enumerate(X):
for j in range(i + 1, N):
d = 0
for y, z in zip(x, X[j]):
d += (y - z) ** 2
if (d**0.5).is_integer():
cnt += 1
print(cnt)
| false | 0 | [
"-N, M = list(map(int, input().split()))",
"-X = [tuple(map(int, input().split())) for _ in [0] * N]",
"+N, D, *X = list(map(int, open(0).read().split()))",
"+(*X,) = list(zip(*[iter(X)] * D))"
] | false | 0.037562 | 0.138141 | 0.271913 | [
"s425404584",
"s152528863"
] |
u006880673 | p03062 | python | s372537518 | s654016428 | 245 | 107 | 74,656 | 95,704 | Accepted | Accepted | 56.33 | N = int(eval(input()))
A = [0] + list(map(int, input().split()))
dp = [[0, 0] for _ in range(N+1)]
# dp[i][j]: j=0 -> A[1] + ... + A[i] の MAX
# j=1 -> A[i] and A[i+1] を反転させた状態での和の最大値
dp[0][0] = 0
dp[0][1] = -float("inf")
for i in range(N):
dp[i+1][0] = max(dp[i][0] + A[i+1], dp[i][1] - A[i+1])
dp[i+1][1] = max(dp[i][0] - A[i+1], dp[i][1] + A[i+1])
print((dp[N][0])) | N = int(eval(input()))
A = list(map(int, input().split()))
abss = [abs(A[i]) for i in range(N)]
minus = [A[i] for i in range(N) if A[i] < 0]
if len(minus) % 2 == 0:
ans = sum([abs(A[i]) for i in range(N)])
print(ans)
else:
abss.sort()
ans = -abss[0] + sum(abss[1:])
print(ans)
| 15 | 12 | 395 | 306 | N = int(eval(input()))
A = [0] + list(map(int, input().split()))
dp = [[0, 0] for _ in range(N + 1)]
# dp[i][j]: j=0 -> A[1] + ... + A[i] の MAX
# j=1 -> A[i] and A[i+1] を反転させた状態での和の最大値
dp[0][0] = 0
dp[0][1] = -float("inf")
for i in range(N):
dp[i + 1][0] = max(dp[i][0] + A[i + 1], dp[i][1] - A[i + 1])
dp[i + 1][1] = max(dp[i][0] - A[i + 1], dp[i][1] + A[i + 1])
print((dp[N][0]))
| N = int(eval(input()))
A = list(map(int, input().split()))
abss = [abs(A[i]) for i in range(N)]
minus = [A[i] for i in range(N) if A[i] < 0]
if len(minus) % 2 == 0:
ans = sum([abs(A[i]) for i in range(N)])
print(ans)
else:
abss.sort()
ans = -abss[0] + sum(abss[1:])
print(ans)
| false | 20 | [
"-A = [0] + list(map(int, input().split()))",
"-dp = [[0, 0] for _ in range(N + 1)]",
"-# dp[i][j]: j=0 -> A[1] + ... + A[i] の MAX",
"-# j=1 -> A[i] and A[i+1] を反転させた状態での和の最大値",
"-dp[0][0] = 0",
"-dp[0][1] = -float(\"inf\")",
"-for i in range(N):",
"- dp[i + 1][0] = max(dp[i][0] + A[i + 1], dp[i][1] - A[i + 1])",
"- dp[i + 1][1] = max(dp[i][0] - A[i + 1], dp[i][1] + A[i + 1])",
"-print((dp[N][0]))",
"+A = list(map(int, input().split()))",
"+abss = [abs(A[i]) for i in range(N)]",
"+minus = [A[i] for i in range(N) if A[i] < 0]",
"+if len(minus) % 2 == 0:",
"+ ans = sum([abs(A[i]) for i in range(N)])",
"+ print(ans)",
"+else:",
"+ abss.sort()",
"+ ans = -abss[0] + sum(abss[1:])",
"+ print(ans)"
] | false | 0.035267 | 0.034843 | 1.012181 | [
"s372537518",
"s654016428"
] |
u889914341 | p03221 | python | s927979891 | s017108304 | 600 | 457 | 30,592 | 30,864 | Accepted | Accepted | 23.83 | n, m = map(int, input().split())
ans = [""] * m
li = []
for i in range(m):
p, y = map(int, input().split())
li.append((p, y, i))
li.sort()
cnt = 1
ans[li[0][2]] = "{:06}{:06}".format(li[0][0], cnt)
for i in range(1, m):
cnt = cnt + 1 if li[i - 1][0] == li[i][0] else 1
ans[li[i][2]] = "{:06}{:06}".format(li[i][0], cnt)
print(*ans, sep="\n")
| import sys
readline = sys.stdin.readline
from collections import defaultdict
n, m = map(int, input().split())
ans = [""] * m
li = []
for i in range(m):
p, y = map(int, readline().split())
li.append((p, y, i))
li.sort()
cnt = 1
ans[li[0][2]] = "{:06}{:06}".format(li[0][0], cnt)
for i in range(1, m):
cnt = cnt + 1 if li[i - 1][0] == li[i][0] else 1
ans[li[i][2]] = "{:06}{:06}".format(li[i][0], cnt)
print(*ans, sep="\n")
| 13 | 16 | 370 | 453 | n, m = map(int, input().split())
ans = [""] * m
li = []
for i in range(m):
p, y = map(int, input().split())
li.append((p, y, i))
li.sort()
cnt = 1
ans[li[0][2]] = "{:06}{:06}".format(li[0][0], cnt)
for i in range(1, m):
cnt = cnt + 1 if li[i - 1][0] == li[i][0] else 1
ans[li[i][2]] = "{:06}{:06}".format(li[i][0], cnt)
print(*ans, sep="\n")
| import sys
readline = sys.stdin.readline
from collections import defaultdict
n, m = map(int, input().split())
ans = [""] * m
li = []
for i in range(m):
p, y = map(int, readline().split())
li.append((p, y, i))
li.sort()
cnt = 1
ans[li[0][2]] = "{:06}{:06}".format(li[0][0], cnt)
for i in range(1, m):
cnt = cnt + 1 if li[i - 1][0] == li[i][0] else 1
ans[li[i][2]] = "{:06}{:06}".format(li[i][0], cnt)
print(*ans, sep="\n")
| false | 18.75 | [
"+import sys",
"+",
"+readline = sys.stdin.readline",
"+from collections import defaultdict",
"+",
"- p, y = map(int, input().split())",
"+ p, y = map(int, readline().split())"
] | false | 0.119069 | 0.037373 | 3.185989 | [
"s927979891",
"s017108304"
] |
u119148115 | p03834 | python | s061990247 | s476514474 | 85 | 63 | 61,836 | 61,820 | Accepted | Accepted | 25.88 | import sys
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
s = LS2()
a = ''.join(s[0:5])
b = ''.join(s[6:13])
c = ''.join(s[14:19])
print(('{} {} {}'.format(a,b,c)))
| import sys
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
s = LS2()
s[5] = ' '
s[13] = ' '
print((''.join(s)))
| 8 | 7 | 185 | 130 | import sys
def LS2():
return list(sys.stdin.readline().rstrip()) # 空白なし
s = LS2()
a = "".join(s[0:5])
b = "".join(s[6:13])
c = "".join(s[14:19])
print(("{} {} {}".format(a, b, c)))
| import sys
def LS2():
return list(sys.stdin.readline().rstrip()) # 空白なし
s = LS2()
s[5] = " "
s[13] = " "
print(("".join(s)))
| false | 12.5 | [
"-a = \"\".join(s[0:5])",
"-b = \"\".join(s[6:13])",
"-c = \"\".join(s[14:19])",
"-print((\"{} {} {}\".format(a, b, c)))",
"+s[5] = \" \"",
"+s[13] = \" \"",
"+print((\"\".join(s)))"
] | false | 0.132303 | 0.079115 | 1.672294 | [
"s061990247",
"s476514474"
] |
u726615467 | p02834 | python | s024277338 | s037813634 | 1,121 | 972 | 55,256 | 48,936 | Accepted | Accepted | 13.29 | N, u, v = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N - 1)]
graph = [[] for _ in range(N)]
for Ai, Bi in AB:
graph[Ai - 1].append(Bi - 1)
graph[Bi - 1].append(Ai - 1)
import heapq
# tak table
d_tak = [10 ** 9 + 7] * N
p_tak = [None] * N
d_tak[u - 1] = 0
q = [(u - 1, 0)]
while len(q) > 0:
src, pen = heapq.heappop(q)
for dst in graph[src]:
if d_tak[dst] > pen + 1:
d_tak[dst] = pen + 1
p_tak[dst] = src
heapq.heappush(q, (dst, pen + 1))
# aok table
d_aok = [10 ** 9 + 7] * N
p_aok = [None] * N
d_aok[v - 1] = 0
q = [(v - 1, 0)]
while len(q) > 0:
src, pen = heapq.heappop(q)
for dst in graph[src]:
if d_aok[dst] > pen + 1:
d_aok[dst] = pen + 1
p_aok[dst] = src
heapq.heappush(q, (dst, pen + 1))
# where for tak to escape
i_ans = None
ans_tmp = 0
for i in range(N):
if d_tak[i] < d_aok[i] and ans_tmp < d_aok[i]:
ans_tmp = d_aok[i]
i_ans = i
# where is aok when tak stops
pos_aok = i_ans
for j in range(d_aok[i_ans] - d_tak[i_ans]):
pos_aok = p_aok[pos_aok]
# aok table 2
d_aok2 = [10 ** 9 + 7] * N
p_aok2 = [None] * N
d_aok2[v - 1] = 0
q = [(v - 1, 0)]
while len(q) > 0:
src, pen = heapq.heappop(q)
for dst in graph[src]:
if d_aok2[dst] > pen + 1:
d_aok2[dst] = pen + 1
p_aok2[dst] = src
heapq.heappush(q, (dst, pen + 1))
print((max(0, d_aok2[i_ans] - 1))) | N, u, v = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N - 1)]
graph = [[] for _ in range(N)]
for i, (Ai, Bi) in enumerate(AB):
graph[Ai - 1].append(Bi - 1)
graph[Bi - 1].append(Ai - 1)
import heapq
MY_INF = 10 ** 18
q = [(0, u - 1)]
d_u = [MY_INF] * N
d_u[u - 1] = 0
while len(q) > 0:
dist, src = heapq.heappop(q)
for dst in graph[src]:
dist_tmp = dist + 1
if d_u[dst] > dist_tmp:
d_u[dst] = dist_tmp
heapq.heappush(q, (dist_tmp, dst))
q = [(0, v - 1)]
d_v = [MY_INF] * N
d_v[v - 1] = 0
while len(q) > 0:
dist, src = heapq.heappop(q)
for dst in graph[src]:
dist_tmp = dist + 1
if d_v[dst] > dist_tmp:
d_v[dst] = dist_tmp
heapq.heappush(q, (dist_tmp, dst))
# print("#", d_u)
# print("#", d_v)
ans = 0
for i in range(N):
if d_u[i] < d_v[i] and ans < d_v[i] - 1:
ans = d_v[i] - 1
print(ans) | 63 | 42 | 1,548 | 998 | N, u, v = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N - 1)]
graph = [[] for _ in range(N)]
for Ai, Bi in AB:
graph[Ai - 1].append(Bi - 1)
graph[Bi - 1].append(Ai - 1)
import heapq
# tak table
d_tak = [10**9 + 7] * N
p_tak = [None] * N
d_tak[u - 1] = 0
q = [(u - 1, 0)]
while len(q) > 0:
src, pen = heapq.heappop(q)
for dst in graph[src]:
if d_tak[dst] > pen + 1:
d_tak[dst] = pen + 1
p_tak[dst] = src
heapq.heappush(q, (dst, pen + 1))
# aok table
d_aok = [10**9 + 7] * N
p_aok = [None] * N
d_aok[v - 1] = 0
q = [(v - 1, 0)]
while len(q) > 0:
src, pen = heapq.heappop(q)
for dst in graph[src]:
if d_aok[dst] > pen + 1:
d_aok[dst] = pen + 1
p_aok[dst] = src
heapq.heappush(q, (dst, pen + 1))
# where for tak to escape
i_ans = None
ans_tmp = 0
for i in range(N):
if d_tak[i] < d_aok[i] and ans_tmp < d_aok[i]:
ans_tmp = d_aok[i]
i_ans = i
# where is aok when tak stops
pos_aok = i_ans
for j in range(d_aok[i_ans] - d_tak[i_ans]):
pos_aok = p_aok[pos_aok]
# aok table 2
d_aok2 = [10**9 + 7] * N
p_aok2 = [None] * N
d_aok2[v - 1] = 0
q = [(v - 1, 0)]
while len(q) > 0:
src, pen = heapq.heappop(q)
for dst in graph[src]:
if d_aok2[dst] > pen + 1:
d_aok2[dst] = pen + 1
p_aok2[dst] = src
heapq.heappush(q, (dst, pen + 1))
print((max(0, d_aok2[i_ans] - 1)))
| N, u, v = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N - 1)]
graph = [[] for _ in range(N)]
for i, (Ai, Bi) in enumerate(AB):
graph[Ai - 1].append(Bi - 1)
graph[Bi - 1].append(Ai - 1)
import heapq
MY_INF = 10**18
q = [(0, u - 1)]
d_u = [MY_INF] * N
d_u[u - 1] = 0
while len(q) > 0:
dist, src = heapq.heappop(q)
for dst in graph[src]:
dist_tmp = dist + 1
if d_u[dst] > dist_tmp:
d_u[dst] = dist_tmp
heapq.heappush(q, (dist_tmp, dst))
q = [(0, v - 1)]
d_v = [MY_INF] * N
d_v[v - 1] = 0
while len(q) > 0:
dist, src = heapq.heappop(q)
for dst in graph[src]:
dist_tmp = dist + 1
if d_v[dst] > dist_tmp:
d_v[dst] = dist_tmp
heapq.heappush(q, (dist_tmp, dst))
# print("#", d_u)
# print("#", d_v)
ans = 0
for i in range(N):
if d_u[i] < d_v[i] and ans < d_v[i] - 1:
ans = d_v[i] - 1
print(ans)
| false | 33.333333 | [
"-for Ai, Bi in AB:",
"+for i, (Ai, Bi) in enumerate(AB):",
"-# tak table",
"-d_tak = [10**9 + 7] * N",
"-p_tak = [None] * N",
"-d_tak[u - 1] = 0",
"-q = [(u - 1, 0)]",
"+MY_INF = 10**18",
"+q = [(0, u - 1)]",
"+d_u = [MY_INF] * N",
"+d_u[u - 1] = 0",
"- src, pen = heapq.heappop(q)",
"+ dist, src = heapq.heappop(q)",
"- if d_tak[dst] > pen + 1:",
"- d_tak[dst] = pen + 1",
"- p_tak[dst] = src",
"- heapq.heappush(q, (dst, pen + 1))",
"-# aok table",
"-d_aok = [10**9 + 7] * N",
"-p_aok = [None] * N",
"-d_aok[v - 1] = 0",
"-q = [(v - 1, 0)]",
"+ dist_tmp = dist + 1",
"+ if d_u[dst] > dist_tmp:",
"+ d_u[dst] = dist_tmp",
"+ heapq.heappush(q, (dist_tmp, dst))",
"+q = [(0, v - 1)]",
"+d_v = [MY_INF] * N",
"+d_v[v - 1] = 0",
"- src, pen = heapq.heappop(q)",
"+ dist, src = heapq.heappop(q)",
"- if d_aok[dst] > pen + 1:",
"- d_aok[dst] = pen + 1",
"- p_aok[dst] = src",
"- heapq.heappush(q, (dst, pen + 1))",
"-# where for tak to escape",
"-i_ans = None",
"-ans_tmp = 0",
"+ dist_tmp = dist + 1",
"+ if d_v[dst] > dist_tmp:",
"+ d_v[dst] = dist_tmp",
"+ heapq.heappush(q, (dist_tmp, dst))",
"+# print(\"#\", d_u)",
"+# print(\"#\", d_v)",
"+ans = 0",
"- if d_tak[i] < d_aok[i] and ans_tmp < d_aok[i]:",
"- ans_tmp = d_aok[i]",
"- i_ans = i",
"-# where is aok when tak stops",
"-pos_aok = i_ans",
"-for j in range(d_aok[i_ans] - d_tak[i_ans]):",
"- pos_aok = p_aok[pos_aok]",
"-# aok table 2",
"-d_aok2 = [10**9 + 7] * N",
"-p_aok2 = [None] * N",
"-d_aok2[v - 1] = 0",
"-q = [(v - 1, 0)]",
"-while len(q) > 0:",
"- src, pen = heapq.heappop(q)",
"- for dst in graph[src]:",
"- if d_aok2[dst] > pen + 1:",
"- d_aok2[dst] = pen + 1",
"- p_aok2[dst] = src",
"- heapq.heappush(q, (dst, pen + 1))",
"-print((max(0, d_aok2[i_ans] - 1)))",
"+ if d_u[i] < d_v[i] and ans < d_v[i] - 1:",
"+ ans = d_v[i] - 1",
"+print(ans)"
] | false | 0.03687 | 0.069562 | 0.530036 | [
"s024277338",
"s037813634"
] |
u790012205 | p03329 | python | s077484759 | s890600887 | 673 | 491 | 5,364 | 9,648 | Accepted | Accepted | 27.04 | N = int(eval(input()))
A = [1, 6, 6**2, 6**3, 6**4, 6**5, 6**6, 9, 9**2, 9**3, 9**4, 9**5]
dp = [1000000] * 300000
dp[0] = 0
for i in range(N):
for a in A:
d = dp[i] + 1
dp[i + a] = min(dp[i + a], d)
print((dp[N])) | N = int(eval(input()))
INF = 10 ** 9
dp = [INF] * (N + 1)
dp[0] = 0
M = set()
M.add(1)
i = 1
while True:
if 6 ** i > N:
break
M.add(6 ** i)
i += 1
i = 1
while True:
if 9 ** i > N:
break
M.add(9 ** i)
i += 1
for i in range(N):
for m in M:
if i + m > N:
continue
dp[i + m] = min(dp[i + m], dp[i] + 1)
print((dp[N])) | 11 | 24 | 238 | 400 | N = int(eval(input()))
A = [1, 6, 6**2, 6**3, 6**4, 6**5, 6**6, 9, 9**2, 9**3, 9**4, 9**5]
dp = [1000000] * 300000
dp[0] = 0
for i in range(N):
for a in A:
d = dp[i] + 1
dp[i + a] = min(dp[i + a], d)
print((dp[N]))
| N = int(eval(input()))
INF = 10**9
dp = [INF] * (N + 1)
dp[0] = 0
M = set()
M.add(1)
i = 1
while True:
if 6**i > N:
break
M.add(6**i)
i += 1
i = 1
while True:
if 9**i > N:
break
M.add(9**i)
i += 1
for i in range(N):
for m in M:
if i + m > N:
continue
dp[i + m] = min(dp[i + m], dp[i] + 1)
print((dp[N]))
| false | 54.166667 | [
"-A = [1, 6, 6**2, 6**3, 6**4, 6**5, 6**6, 9, 9**2, 9**3, 9**4, 9**5]",
"-dp = [1000000] * 300000",
"+INF = 10**9",
"+dp = [INF] * (N + 1)",
"+M = set()",
"+M.add(1)",
"+i = 1",
"+while True:",
"+ if 6**i > N:",
"+ break",
"+ M.add(6**i)",
"+ i += 1",
"+i = 1",
"+while True:",
"+ if 9**i > N:",
"+ break",
"+ M.add(9**i)",
"+ i += 1",
"- for a in A:",
"- d = dp[i] + 1",
"- dp[i + a] = min(dp[i + a], d)",
"+ for m in M:",
"+ if i + m > N:",
"+ continue",
"+ dp[i + m] = min(dp[i + m], dp[i] + 1)"
] | false | 0.22266 | 0.349895 | 0.636363 | [
"s077484759",
"s890600887"
] |
u761320129 | p03863 | python | s614002977 | s862066697 | 19 | 17 | 3,316 | 3,316 | Accepted | Accepted | 10.53 | S = eval(input())
if S[0]==S[-1]:
print(('Second' if len(S)%2 else 'First'))
else:
print(('Second' if len(S)%2==0 else 'First')) | S = eval(input())
if S[0] == S[-1]:
l = len(S)-3
else:
l = len(S)-2
print(('First' if l%2 else 'Second')) | 5 | 6 | 130 | 110 | S = eval(input())
if S[0] == S[-1]:
print(("Second" if len(S) % 2 else "First"))
else:
print(("Second" if len(S) % 2 == 0 else "First"))
| S = eval(input())
if S[0] == S[-1]:
l = len(S) - 3
else:
l = len(S) - 2
print(("First" if l % 2 else "Second"))
| false | 16.666667 | [
"- print((\"Second\" if len(S) % 2 else \"First\"))",
"+ l = len(S) - 3",
"- print((\"Second\" if len(S) % 2 == 0 else \"First\"))",
"+ l = len(S) - 2",
"+print((\"First\" if l % 2 else \"Second\"))"
] | false | 0.044558 | 0.04471 | 0.996587 | [
"s614002977",
"s862066697"
] |
u475503988 | p03103 | python | s080598160 | s759926964 | 1,177 | 805 | 16,372 | 14,812 | Accepted | Accepted | 31.61 | import numpy as np
N, M = list(map(int, input().split()))
AB = np.empty((N, 2), dtype=np.int64)
for n in range(N):
AB[n, :] = list(map(int, input().split()))
AB = AB[AB[:, 0].argsort(), :]
n = 0
ans = 0
while M > 0:
if M > AB[n, 1]:
ans += AB[n, 0] * AB[n, 1]
M -= AB[n, 1]
else:
ans += AB[n, 0] * M
M = 0
n += 1
print(ans) | import numpy as np
n,m=list(map(int,input().split()))
a=np.zeros(n)
b=np.zeros(n)
for i in range(n):
a[i],b[i]=list(map(int,input().split()))
x=np.argsort(a)
ans=0
i=0
while m>0:
ans+=a[x[i]]*min(b[x[i]],m)
m-=b[x[i]]
i+=1
print((int(ans))) | 17 | 14 | 381 | 255 | import numpy as np
N, M = list(map(int, input().split()))
AB = np.empty((N, 2), dtype=np.int64)
for n in range(N):
AB[n, :] = list(map(int, input().split()))
AB = AB[AB[:, 0].argsort(), :]
n = 0
ans = 0
while M > 0:
if M > AB[n, 1]:
ans += AB[n, 0] * AB[n, 1]
M -= AB[n, 1]
else:
ans += AB[n, 0] * M
M = 0
n += 1
print(ans)
| import numpy as np
n, m = list(map(int, input().split()))
a = np.zeros(n)
b = np.zeros(n)
for i in range(n):
a[i], b[i] = list(map(int, input().split()))
x = np.argsort(a)
ans = 0
i = 0
while m > 0:
ans += a[x[i]] * min(b[x[i]], m)
m -= b[x[i]]
i += 1
print((int(ans)))
| false | 17.647059 | [
"-N, M = list(map(int, input().split()))",
"-AB = np.empty((N, 2), dtype=np.int64)",
"-for n in range(N):",
"- AB[n, :] = list(map(int, input().split()))",
"-AB = AB[AB[:, 0].argsort(), :]",
"-n = 0",
"+n, m = list(map(int, input().split()))",
"+a = np.zeros(n)",
"+b = np.zeros(n)",
"+for i in range(n):",
"+ a[i], b[i] = list(map(int, input().split()))",
"+x = np.argsort(a)",
"-while M > 0:",
"- if M > AB[n, 1]:",
"- ans += AB[n, 0] * AB[n, 1]",
"- M -= AB[n, 1]",
"- else:",
"- ans += AB[n, 0] * M",
"- M = 0",
"- n += 1",
"-print(ans)",
"+i = 0",
"+while m > 0:",
"+ ans += a[x[i]] * min(b[x[i]], m)",
"+ m -= b[x[i]]",
"+ i += 1",
"+print((int(ans)))"
] | false | 0.267965 | 0.246245 | 1.088205 | [
"s080598160",
"s759926964"
] |
u729133443 | p03108 | python | s826540177 | s680275390 | 874 | 740 | 131,292 | 55,916 | Accepted | Accepted | 15.33 | class UnionFind:
def __init__(self,n):
*self.table,=range(n)
self.rank=[1]*n
def root(self,x):
if self.table[x]==x:
return x
else:
self.table[x]=self.root(self.table[x])
return self.table[x]
def unite(self,x,y):
x=self.root(x)
y=self.root(y)
if x!=y:
if self.rank[x]<self.rank[y]:
x,y=y,x
self.rank[x]+=self.rank[y]
self.table[y]=x
def same(self,x,y):
return self.root(x)==self.root(y)
def size(self,x):
return self.rank[self.root(x)]
(n,m),_,*e=[map(int,t.split())for t in open(0).readlines()]
u=UnionFind(n)
a=[n*~-n//2]
for x,y in e[::-1]:
x,y=x-1,y-1
t=a[-1]
if not u.same(x,y):
t-=u.size(x)*u.size(y)
a.append(t)
u.unite(x,y)
print(*a[::-1],sep='\n')
| def root(x):
if table[x]==x:
return x
else:
table[x]=root(table[x])
return table[x]
def unite(x,y):
x=root(x)
y=root(y)
if x!=y:
if rank[x]<rank[y]:
x,y=y,x
rank[x]+=rank[y]
table[y]=x
def same(x,y):
return root(x)==root(y)
def size(x):
return rank[root(x)]
(n,m),_,*e=[map(int,t.split())for t in open(0).readlines()]
*table,=range(n)
rank=[1]*n
a=[n*~-n//2]
for x,y in e[::-1]:
x,y=x-1,y-1
t=a[-1]
if not same(x,y):
t-=size(x)*size(y)
a.append(t)
unite(x,y)
print(*a[::-1],sep='\n')
| 33 | 30 | 791 | 570 | class UnionFind:
def __init__(self, n):
(*self.table,) = range(n)
self.rank = [1] * n
def root(self, x):
if self.table[x] == x:
return x
else:
self.table[x] = self.root(self.table[x])
return self.table[x]
def unite(self, x, y):
x = self.root(x)
y = self.root(y)
if x != y:
if self.rank[x] < self.rank[y]:
x, y = y, x
self.rank[x] += self.rank[y]
self.table[y] = x
def same(self, x, y):
return self.root(x) == self.root(y)
def size(self, x):
return self.rank[self.root(x)]
(n, m), _, *e = [map(int, t.split()) for t in open(0).readlines()]
u = UnionFind(n)
a = [n * ~-n // 2]
for x, y in e[::-1]:
x, y = x - 1, y - 1
t = a[-1]
if not u.same(x, y):
t -= u.size(x) * u.size(y)
a.append(t)
u.unite(x, y)
print(*a[::-1], sep="\n")
| def root(x):
if table[x] == x:
return x
else:
table[x] = root(table[x])
return table[x]
def unite(x, y):
x = root(x)
y = root(y)
if x != y:
if rank[x] < rank[y]:
x, y = y, x
rank[x] += rank[y]
table[y] = x
def same(x, y):
return root(x) == root(y)
def size(x):
return rank[root(x)]
(n, m), _, *e = [map(int, t.split()) for t in open(0).readlines()]
(*table,) = range(n)
rank = [1] * n
a = [n * ~-n // 2]
for x, y in e[::-1]:
x, y = x - 1, y - 1
t = a[-1]
if not same(x, y):
t -= size(x) * size(y)
a.append(t)
unite(x, y)
print(*a[::-1], sep="\n")
| false | 9.090909 | [
"-class UnionFind:",
"- def __init__(self, n):",
"- (*self.table,) = range(n)",
"- self.rank = [1] * n",
"+def root(x):",
"+ if table[x] == x:",
"+ return x",
"+ else:",
"+ table[x] = root(table[x])",
"+ return table[x]",
"- def root(self, x):",
"- if self.table[x] == x:",
"- return x",
"- else:",
"- self.table[x] = self.root(self.table[x])",
"- return self.table[x]",
"- def unite(self, x, y):",
"- x = self.root(x)",
"- y = self.root(y)",
"- if x != y:",
"- if self.rank[x] < self.rank[y]:",
"- x, y = y, x",
"- self.rank[x] += self.rank[y]",
"- self.table[y] = x",
"+def unite(x, y):",
"+ x = root(x)",
"+ y = root(y)",
"+ if x != y:",
"+ if rank[x] < rank[y]:",
"+ x, y = y, x",
"+ rank[x] += rank[y]",
"+ table[y] = x",
"- def same(self, x, y):",
"- return self.root(x) == self.root(y)",
"- def size(self, x):",
"- return self.rank[self.root(x)]",
"+def same(x, y):",
"+ return root(x) == root(y)",
"+",
"+",
"+def size(x):",
"+ return rank[root(x)]",
"-u = UnionFind(n)",
"+(*table,) = range(n)",
"+rank = [1] * n",
"- if not u.same(x, y):",
"- t -= u.size(x) * u.size(y)",
"+ if not same(x, y):",
"+ t -= size(x) * size(y)",
"- u.unite(x, y)",
"+ unite(x, y)"
] | false | 0.049285 | 0.108507 | 0.454216 | [
"s826540177",
"s680275390"
] |
u314188085 | p02596 | python | s056109560 | s776361333 | 321 | 180 | 48,412 | 9,164 | Accepted | Accepted | 43.93 | K = int(eval(input()))
A = [0]*1000001
A[0] = 7%K
ans = -1
for i in range(1,1000001):
A[i] = (A[i-1]*10+7)%K
for i in range(1000001):
if A[i]==0:
ans = i+1
break
print(ans) | K = int(eval(input()))
ans = -1
mod = 7%K
for i in range(1000001):
if mod==0:
ans = i+1
break
else:
mod = (mod*10+7)%K
print(ans) | 15 | 12 | 216 | 176 | K = int(eval(input()))
A = [0] * 1000001
A[0] = 7 % K
ans = -1
for i in range(1, 1000001):
A[i] = (A[i - 1] * 10 + 7) % K
for i in range(1000001):
if A[i] == 0:
ans = i + 1
break
print(ans)
| K = int(eval(input()))
ans = -1
mod = 7 % K
for i in range(1000001):
if mod == 0:
ans = i + 1
break
else:
mod = (mod * 10 + 7) % K
print(ans)
| false | 20 | [
"-A = [0] * 1000001",
"-A[0] = 7 % K",
"-for i in range(1, 1000001):",
"- A[i] = (A[i - 1] * 10 + 7) % K",
"+mod = 7 % K",
"- if A[i] == 0:",
"+ if mod == 0:",
"+ else:",
"+ mod = (mod * 10 + 7) % K"
] | false | 0.948902 | 0.145699 | 6.512752 | [
"s056109560",
"s776361333"
] |
u796942881 | p03862 | python | s096259073 | s521951893 | 81 | 66 | 14,092 | 14,092 | Accepted | Accepted | 18.52 | def main():
N, x, *a = list(map(int, open(0).read().split()))
ans = 0
pre = a[0]
for i in range(1, N):
if x < pre + a[i]:
cur = pre + a[i] - x
ans += cur
a[i] = a[i] - cur if cur < a[i] else 0
pre = a[i]
print(ans)
return
main()
| def main():
N, x, *a = list(map(int, open(0).read().split()))
ans = a[0] - x if x < a[0] else 0
pre = min(a[0], x)
for i in range(1, N):
dif = pre + a[i] - x
if 0 < dif:
ans += dif
a[i] -= dif
pre = a[i]
print(ans)
return
main()
| 15 | 15 | 315 | 311 | def main():
N, x, *a = list(map(int, open(0).read().split()))
ans = 0
pre = a[0]
for i in range(1, N):
if x < pre + a[i]:
cur = pre + a[i] - x
ans += cur
a[i] = a[i] - cur if cur < a[i] else 0
pre = a[i]
print(ans)
return
main()
| def main():
N, x, *a = list(map(int, open(0).read().split()))
ans = a[0] - x if x < a[0] else 0
pre = min(a[0], x)
for i in range(1, N):
dif = pre + a[i] - x
if 0 < dif:
ans += dif
a[i] -= dif
pre = a[i]
print(ans)
return
main()
| false | 0 | [
"- ans = 0",
"- pre = a[0]",
"+ ans = a[0] - x if x < a[0] else 0",
"+ pre = min(a[0], x)",
"- if x < pre + a[i]:",
"- cur = pre + a[i] - x",
"- ans += cur",
"- a[i] = a[i] - cur if cur < a[i] else 0",
"+ dif = pre + a[i] - x",
"+ if 0 < dif:",
"+ ans += dif",
"+ a[i] -= dif"
] | false | 0.049122 | 0.047238 | 1.039895 | [
"s096259073",
"s521951893"
] |
u245641078 | p03370 | python | s939682583 | s352690379 | 30 | 25 | 9,096 | 9,076 | Accepted | Accepted | 16.67 | N,X = list(map(int,input().split()))
record= [int(eval(input())) for i in range(N)]
print((len(record)+(X-(sum(record)))//min(record))) | N,X = list(map(int,input().split()))
m = [int(eval(input())) for i in range(N)]
print((len(m)+((X-sum(m))//min(m)))) | 3 | 3 | 123 | 104 | N, X = list(map(int, input().split()))
record = [int(eval(input())) for i in range(N)]
print((len(record) + (X - (sum(record))) // min(record)))
| N, X = list(map(int, input().split()))
m = [int(eval(input())) for i in range(N)]
print((len(m) + ((X - sum(m)) // min(m))))
| false | 0 | [
"-record = [int(eval(input())) for i in range(N)]",
"-print((len(record) + (X - (sum(record))) // min(record)))",
"+m = [int(eval(input())) for i in range(N)]",
"+print((len(m) + ((X - sum(m)) // min(m))))"
] | false | 0.041042 | 0.040391 | 1.016122 | [
"s939682583",
"s352690379"
] |
u241159583 | p03478 | python | s688234920 | s944496029 | 49 | 40 | 3,276 | 2,940 | Accepted | Accepted | 18.37 | N, A, B = list(map(int, input().split()))
n = []
for i in range(1, N+1):
a = 0
for x in range(len(str(i))):
a += int(str(i)[x])
if a >= A and a <= B:
n.append(i)
print((sum(n))) | N, A, B = list(map(int, input().split()))
ans = 0
for i in range(1, N+1):
a = list(str(i))
c = 0
for j in range(len(a)):
c += int(a[j])
if A <= c <= B:
ans += i
print(ans)
| 10 | 11 | 193 | 193 | N, A, B = list(map(int, input().split()))
n = []
for i in range(1, N + 1):
a = 0
for x in range(len(str(i))):
a += int(str(i)[x])
if a >= A and a <= B:
n.append(i)
print((sum(n)))
| N, A, B = list(map(int, input().split()))
ans = 0
for i in range(1, N + 1):
a = list(str(i))
c = 0
for j in range(len(a)):
c += int(a[j])
if A <= c <= B:
ans += i
print(ans)
| false | 9.090909 | [
"-n = []",
"+ans = 0",
"- a = 0",
"- for x in range(len(str(i))):",
"- a += int(str(i)[x])",
"- if a >= A and a <= B:",
"- n.append(i)",
"-print((sum(n)))",
"+ a = list(str(i))",
"+ c = 0",
"+ for j in range(len(a)):",
"+ c += int(a[j])",
"+ if A <= c <= B:",
"+ ans += i",
"+print(ans)"
] | false | 0.045461 | 0.036853 | 1.233591 | [
"s688234920",
"s944496029"
] |
u505420467 | p03095 | python | s075299375 | s782864766 | 166 | 26 | 14,204 | 4,340 | Accepted | Accepted | 84.34 | from collections import Counter
import scipy.misc as scm
n = int(eval(input()))
s = list(eval(input()))
tmp = len(set(s))
count_s = Counter(s)
count_s = count_s.most_common()
ans = 1
for i in range(tmp):
if count_s[i][1] > 1:
ans *= (count_s[i][1]+1)
ans = ans % (10**9+7)
else:
ans *= 2
ans = ans % (10**9+7)
ans -= 1
print(ans)
| from collections import Counter
if __name__ == '__main__':
n = int(eval(input()))
s = list(eval(input()))
s = Counter(s)
s = s.most_common()
ans = 1
for k, v in s:
if v > 1:
ans *= v + 1
else:
ans *= 2
ans %= (10 ** 9 + 7)
print((ans - 1))
| 19 | 17 | 358 | 321 | from collections import Counter
import scipy.misc as scm
n = int(eval(input()))
s = list(eval(input()))
tmp = len(set(s))
count_s = Counter(s)
count_s = count_s.most_common()
ans = 1
for i in range(tmp):
if count_s[i][1] > 1:
ans *= count_s[i][1] + 1
ans = ans % (10**9 + 7)
else:
ans *= 2
ans = ans % (10**9 + 7)
ans -= 1
print(ans)
| from collections import Counter
if __name__ == "__main__":
n = int(eval(input()))
s = list(eval(input()))
s = Counter(s)
s = s.most_common()
ans = 1
for k, v in s:
if v > 1:
ans *= v + 1
else:
ans *= 2
ans %= 10**9 + 7
print((ans - 1))
| false | 10.526316 | [
"-import scipy.misc as scm",
"-n = int(eval(input()))",
"-s = list(eval(input()))",
"-tmp = len(set(s))",
"-count_s = Counter(s)",
"-count_s = count_s.most_common()",
"-ans = 1",
"-for i in range(tmp):",
"- if count_s[i][1] > 1:",
"- ans *= count_s[i][1] + 1",
"- ans = ans % (10**9 + 7)",
"- else:",
"- ans *= 2",
"- ans = ans % (10**9 + 7)",
"-ans -= 1",
"-print(ans)",
"+if __name__ == \"__main__\":",
"+ n = int(eval(input()))",
"+ s = list(eval(input()))",
"+ s = Counter(s)",
"+ s = s.most_common()",
"+ ans = 1",
"+ for k, v in s:",
"+ if v > 1:",
"+ ans *= v + 1",
"+ else:",
"+ ans *= 2",
"+ ans %= 10**9 + 7",
"+ print((ans - 1))"
] | false | 0.078077 | 0.045922 | 1.700222 | [
"s075299375",
"s782864766"
] |
u347640436 | p02999 | python | s309970201 | s619482319 | 19 | 17 | 3,060 | 2,940 | Accepted | Accepted | 10.53 | x, a = [int(e) for e in input().split()]
if x < a:
print((0))
else:
print((10)) | X, A = list(map(int, input().split()))
if X < A:
print((0))
else:
print((10))
| 5 | 6 | 83 | 82 | x, a = [int(e) for e in input().split()]
if x < a:
print((0))
else:
print((10))
| X, A = list(map(int, input().split()))
if X < A:
print((0))
else:
print((10))
| false | 16.666667 | [
"-x, a = [int(e) for e in input().split()]",
"-if x < a:",
"+X, A = list(map(int, input().split()))",
"+if X < A:"
] | false | 0.047709 | 0.048288 | 0.988002 | [
"s309970201",
"s619482319"
] |
u191829404 | p03111 | python | s154878473 | s938068752 | 533 | 208 | 14,476 | 12,440 | Accepted | Accepted | 60.98 | # https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde s=input() s='abcde'
# abcde s=list(input()) s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ) a=int(input()) a=5
# 1 2 | x,y = map(int,input().split()) | x=1,y=2
# 1 2 3 4 5 ... n li = input().split() li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n li = inpl() li=[1,2,3,4,5,...,n]
# FFFTFTTFF li = input().split('T') li=['FFF', 'F', '', 'FF']
# INPUT
# 3
# hoge
# foo
# bar
# ANSWER
# n=int(input())
# string_list=[input() for i in range(n)]
import math
import numpy as np
import copy
from collections import defaultdict, Counter
from itertools import product
from bisect import bisect_left, bisect_right
def inpl(): return list(map(int, input().split()))
li = list(map(int, input().split()))
N, A, B, C = li[0], li[1], li[2], li[3]
l = sorted([ int(eval(input())) for i in range(N) ])
ans = 1e9
# 0~3のデカルト積
# 0~3の組み合わせ全部
for X in product(list(range(4)), repeat=N):
# [[未使用], [Aの作成に使う], [Bの作成に使う], [Cの作成に使う]]
# 作成の際使う竹は必ず合成する
P = [[] for _ in range(4)]
for i, x in enumerate(X):
P[x].append(l[i])
# A, B, Cを合成する竹がない場合スキップ
if min(list(map(len, P[1:]))) == 0:
continue
tmp = 0
for q, d in zip(P[1:], [A, B, C]):
tmp += 10*(len(q)-1) + abs(d-sum(q))
if tmp < ans:
ans = min(tmp, ans)
print(ans) | # https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde s=input() s='abcde'
# abcde s=list(input()) s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ) a=int(input()) a=5
# 1 2 | x,y = map(int,input().split()) | x=1,y=2
# 1 2 3 4 5 ... n li = input().split() li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n li = inpl() li=[1,2,3,4,5,...,n]
# FFFTFTTFF li = input().split('T') li=['FFF', 'F', '', 'FF']
# INPUT
# 3
# hoge
# foo
# bar
# ANSWER
# n=int(input())
# string_list=[input() for i in range(n)]
import math
import numpy as np
import copy
from collections import defaultdict, Counter
from itertools import product
from bisect import bisect_left, bisect_right
def inpl(): return list(map(int, input().split()))
li = list(map(int, input().split()))
N, A, B, C = li[0], li[1], li[2], li[3]
l = sorted([ int(eval(input())) for i in range(N) ])
INF = 1e9
def dfs(ind, a, b, c):
if ind == N:
if min(a, b, c) > 0:
return abs(a-A) + abs(b-B) + abs(c-C) - 30
else:
return INF
ret0 = dfs(ind+1, a, b, c)
ret1 = dfs(ind+1, a + l[ind], b, c) + 10
ret2 = dfs(ind+1, a, b + l[ind], c) + 10
ret3 = dfs(ind+1, a, b, c + l[ind]) + 10
return min(ret0, ret1, ret2, ret3)
print((dfs(0, 0, 0, 0))) | 52 | 45 | 1,357 | 1,285 | # https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde s=input() s='abcde'
# abcde s=list(input()) s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ) a=int(input()) a=5
# 1 2 | x,y = map(int,input().split()) | x=1,y=2
# 1 2 3 4 5 ... n li = input().split() li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n li = inpl() li=[1,2,3,4,5,...,n]
# FFFTFTTFF li = input().split('T') li=['FFF', 'F', '', 'FF']
# INPUT
# 3
# hoge
# foo
# bar
# ANSWER
# n=int(input())
# string_list=[input() for i in range(n)]
import math
import numpy as np
import copy
from collections import defaultdict, Counter
from itertools import product
from bisect import bisect_left, bisect_right
def inpl():
return list(map(int, input().split()))
li = list(map(int, input().split()))
N, A, B, C = li[0], li[1], li[2], li[3]
l = sorted([int(eval(input())) for i in range(N)])
ans = 1e9
# 0~3のデカルト積
# 0~3の組み合わせ全部
for X in product(list(range(4)), repeat=N):
# [[未使用], [Aの作成に使う], [Bの作成に使う], [Cの作成に使う]]
# 作成の際使う竹は必ず合成する
P = [[] for _ in range(4)]
for i, x in enumerate(X):
P[x].append(l[i])
# A, B, Cを合成する竹がない場合スキップ
if min(list(map(len, P[1:]))) == 0:
continue
tmp = 0
for q, d in zip(P[1:], [A, B, C]):
tmp += 10 * (len(q) - 1) + abs(d - sum(q))
if tmp < ans:
ans = min(tmp, ans)
print(ans)
| # https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde s=input() s='abcde'
# abcde s=list(input()) s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ) a=int(input()) a=5
# 1 2 | x,y = map(int,input().split()) | x=1,y=2
# 1 2 3 4 5 ... n li = input().split() li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n li = inpl() li=[1,2,3,4,5,...,n]
# FFFTFTTFF li = input().split('T') li=['FFF', 'F', '', 'FF']
# INPUT
# 3
# hoge
# foo
# bar
# ANSWER
# n=int(input())
# string_list=[input() for i in range(n)]
import math
import numpy as np
import copy
from collections import defaultdict, Counter
from itertools import product
from bisect import bisect_left, bisect_right
def inpl():
return list(map(int, input().split()))
li = list(map(int, input().split()))
N, A, B, C = li[0], li[1], li[2], li[3]
l = sorted([int(eval(input())) for i in range(N)])
INF = 1e9
def dfs(ind, a, b, c):
if ind == N:
if min(a, b, c) > 0:
return abs(a - A) + abs(b - B) + abs(c - C) - 30
else:
return INF
ret0 = dfs(ind + 1, a, b, c)
ret1 = dfs(ind + 1, a + l[ind], b, c) + 10
ret2 = dfs(ind + 1, a, b + l[ind], c) + 10
ret3 = dfs(ind + 1, a, b, c + l[ind]) + 10
return min(ret0, ret1, ret2, ret3)
print((dfs(0, 0, 0, 0)))
| false | 13.461538 | [
"-ans = 1e9",
"-# 0~3のデカルト積",
"-# 0~3の組み合わせ全部",
"-for X in product(list(range(4)), repeat=N):",
"- # [[未使用], [Aの作成に使う], [Bの作成に使う], [Cの作成に使う]]",
"- # 作成の際使う竹は必ず合成する",
"- P = [[] for _ in range(4)]",
"- for i, x in enumerate(X):",
"- P[x].append(l[i])",
"- # A, B, Cを合成する竹がない場合スキップ",
"- if min(list(map(len, P[1:]))) == 0:",
"- continue",
"- tmp = 0",
"- for q, d in zip(P[1:], [A, B, C]):",
"- tmp += 10 * (len(q) - 1) + abs(d - sum(q))",
"- if tmp < ans:",
"- ans = min(tmp, ans)",
"-print(ans)",
"+INF = 1e9",
"+",
"+",
"+def dfs(ind, a, b, c):",
"+ if ind == N:",
"+ if min(a, b, c) > 0:",
"+ return abs(a - A) + abs(b - B) + abs(c - C) - 30",
"+ else:",
"+ return INF",
"+ ret0 = dfs(ind + 1, a, b, c)",
"+ ret1 = dfs(ind + 1, a + l[ind], b, c) + 10",
"+ ret2 = dfs(ind + 1, a, b + l[ind], c) + 10",
"+ ret3 = dfs(ind + 1, a, b, c + l[ind]) + 10",
"+ return min(ret0, ret1, ret2, ret3)",
"+",
"+",
"+print((dfs(0, 0, 0, 0)))"
] | false | 0.680127 | 0.073838 | 9.211125 | [
"s154878473",
"s938068752"
] |
u562935282 | p03039 | python | s173723065 | s515246220 | 130 | 86 | 3,064 | 3,828 | Accepted | Accepted | 33.85 | """
https://atcoder.jp/contests/abc127/submissions/5606400
"""
def inv(x):
return pow(x, MOD - 2, MOD)
def cmb(n, r):
r = min(r, n - r)
if r == 0:
return 1
if r == 1:
return n
f = 1
for k in range(n, n - r, -1):
f = (f * k) % MOD
# n!/(n-r)!
d = 1
for k in range(2, r + 1):
d = (d * k) % MOD
# r!
return (f * inv(d)) % MOD
MOD = 10 ** 9 + 7
N, M, K = list(map(int, input().split()))
ans = 0
for i in range(M):
ans += i * (M - i) * N ** 2
for i in range(N):
ans += i * (N - i) * M ** 2
pat = cmb(N * M - 2, K - 2)
ans = (ans * pat) % MOD
print(ans)
| # https://atcoder.jp/contests/abc127/submissions/5606400
from functools import reduce
def mod_mul(a, b):
return (a * b) % MOD
def cmb(n, r):
r = min(r, n - r)
if r == 0:
return 1
if r == 1:
return n
f = reduce(mod_mul, list(range(n - r + 1, n + 1))) # n!/(n-r)!
d = reduce(mod_mul, list(range(2, r + 1))) # r!
return (f * pow(d, MOD - 2, MOD)) % MOD
MOD = 10 ** 9 + 7
N, M, K = list(map(int, input().split()))
ans_x = 0
for i in range(M):
ans_x += i * (M - i)
ans_x *= N ** 2
ans_y = 0
for i in range(N):
ans_y += i * (N - i)
ans_y *= M ** 2
ans = ans_x + ans_y
pat = cmb(N * M - 2, K - 2)
ans = (ans * pat) % MOD
print(ans)
| 45 | 41 | 693 | 715 | """
https://atcoder.jp/contests/abc127/submissions/5606400
"""
def inv(x):
return pow(x, MOD - 2, MOD)
def cmb(n, r):
r = min(r, n - r)
if r == 0:
return 1
if r == 1:
return n
f = 1
for k in range(n, n - r, -1):
f = (f * k) % MOD
# n!/(n-r)!
d = 1
for k in range(2, r + 1):
d = (d * k) % MOD
# r!
return (f * inv(d)) % MOD
MOD = 10**9 + 7
N, M, K = list(map(int, input().split()))
ans = 0
for i in range(M):
ans += i * (M - i) * N**2
for i in range(N):
ans += i * (N - i) * M**2
pat = cmb(N * M - 2, K - 2)
ans = (ans * pat) % MOD
print(ans)
| # https://atcoder.jp/contests/abc127/submissions/5606400
from functools import reduce
def mod_mul(a, b):
return (a * b) % MOD
def cmb(n, r):
r = min(r, n - r)
if r == 0:
return 1
if r == 1:
return n
f = reduce(mod_mul, list(range(n - r + 1, n + 1))) # n!/(n-r)!
d = reduce(mod_mul, list(range(2, r + 1))) # r!
return (f * pow(d, MOD - 2, MOD)) % MOD
MOD = 10**9 + 7
N, M, K = list(map(int, input().split()))
ans_x = 0
for i in range(M):
ans_x += i * (M - i)
ans_x *= N**2
ans_y = 0
for i in range(N):
ans_y += i * (N - i)
ans_y *= M**2
ans = ans_x + ans_y
pat = cmb(N * M - 2, K - 2)
ans = (ans * pat) % MOD
print(ans)
| false | 8.888889 | [
"-\"\"\"",
"-https://atcoder.jp/contests/abc127/submissions/5606400",
"-\"\"\"",
"+# https://atcoder.jp/contests/abc127/submissions/5606400",
"+from functools import reduce",
"-def inv(x):",
"- return pow(x, MOD - 2, MOD)",
"+def mod_mul(a, b):",
"+ return (a * b) % MOD",
"- f = 1",
"- for k in range(n, n - r, -1):",
"- f = (f * k) % MOD",
"- # n!/(n-r)!",
"- d = 1",
"- for k in range(2, r + 1):",
"- d = (d * k) % MOD",
"- # r!",
"- return (f * inv(d)) % MOD",
"+ f = reduce(mod_mul, list(range(n - r + 1, n + 1))) # n!/(n-r)!",
"+ d = reduce(mod_mul, list(range(2, r + 1))) # r!",
"+ return (f * pow(d, MOD - 2, MOD)) % MOD",
"-ans = 0",
"+ans_x = 0",
"- ans += i * (M - i) * N**2",
"+ ans_x += i * (M - i)",
"+ans_x *= N**2",
"+ans_y = 0",
"- ans += i * (N - i) * M**2",
"+ ans_y += i * (N - i)",
"+ans_y *= M**2",
"+ans = ans_x + ans_y"
] | false | 0.041698 | 0.067638 | 0.616495 | [
"s173723065",
"s515246220"
] |
u729133443 | p02821 | python | s062987193 | s406312891 | 683 | 522 | 32,892 | 32,936 | Accepted | Accepted | 23.57 | from numpy import*
n,m,*a=int_(open(0).read().split())
a=int_(fft.irfft(fft.rfft(bincount(a,[1]*n,2**18))**2)+.5)
c=0
for i in where(a>0)[0][::-1]:
t=min(m,a[i])
c+=i*t
m-=t
if m<1:break
print(c) | from numpy import*
n,m,*a=int_(open(0).read().split())
a=int_(fft.irfft(fft.rfft(bincount(a,[1]*n,2**18))**2)+.5)
c=0
for i in where(a>0)[0][::-1]:t=min(m,a[i]);c+=i*t;m-=t
print(c) | 10 | 6 | 212 | 186 | from numpy import *
n, m, *a = int_(open(0).read().split())
a = int_(fft.irfft(fft.rfft(bincount(a, [1] * n, 2**18)) ** 2) + 0.5)
c = 0
for i in where(a > 0)[0][::-1]:
t = min(m, a[i])
c += i * t
m -= t
if m < 1:
break
print(c)
| from numpy import *
n, m, *a = int_(open(0).read().split())
a = int_(fft.irfft(fft.rfft(bincount(a, [1] * n, 2**18)) ** 2) + 0.5)
c = 0
for i in where(a > 0)[0][::-1]:
t = min(m, a[i])
c += i * t
m -= t
print(c)
| false | 40 | [
"- if m < 1:",
"- break"
] | false | 0.352019 | 0.282903 | 1.244309 | [
"s062987193",
"s406312891"
] |
u133936772 | p02983 | python | s775545863 | s645818607 | 420 | 38 | 2,940 | 2,940 | Accepted | Accepted | 90.95 | M=2019;l,r=list(map(int,input().split()))
print((0 if r//M-l//M>0 else min(i*j%M for i in range(l,r) for j in range(i+1,r+1)))) | l,r=list(map(int,input().split()))
print((0 if r-l>671 else min(i*j%2019 for i in range(l,r) for j in range(i+1,r+1)))) | 2 | 2 | 120 | 112 | M = 2019
l, r = list(map(int, input().split()))
print(
(
0
if r // M - l // M > 0
else min(i * j % M for i in range(l, r) for j in range(i + 1, r + 1))
)
)
| l, r = list(map(int, input().split()))
print(
(
0
if r - l > 671
else min(i * j % 2019 for i in range(l, r) for j in range(i + 1, r + 1))
)
)
| false | 0 | [
"-M = 2019",
"- if r // M - l // M > 0",
"- else min(i * j % M for i in range(l, r) for j in range(i + 1, r + 1))",
"+ if r - l > 671",
"+ else min(i * j % 2019 for i in range(l, r) for j in range(i + 1, r + 1))"
] | false | 0.101796 | 0.035522 | 2.865726 | [
"s775545863",
"s645818607"
] |
u708255304 | p02755 | python | s853656259 | s622642912 | 180 | 48 | 3,060 | 2,940 | Accepted | Accepted | 73.33 | A, B = list(map(int, input().split()))
for i in range(500000):
if int(i * 0.08) == A and int(i*0.10) == B:
print(i)
exit()
print((-1))
| A, B = list(map(int, input().split()))
for i in range(100000):
if int(i*0.08) == A and int(i*0.10) == B:
print(i)
exit()
print((-1))
| 6 | 6 | 152 | 150 | A, B = list(map(int, input().split()))
for i in range(500000):
if int(i * 0.08) == A and int(i * 0.10) == B:
print(i)
exit()
print((-1))
| A, B = list(map(int, input().split()))
for i in range(100000):
if int(i * 0.08) == A and int(i * 0.10) == B:
print(i)
exit()
print((-1))
| false | 0 | [
"-for i in range(500000):",
"+for i in range(100000):"
] | false | 0.399944 | 0.141334 | 2.829785 | [
"s853656259",
"s622642912"
] |
u659159398 | p03160 | python | s639472785 | s022202080 | 139 | 98 | 13,924 | 85,616 | Accepted | Accepted | 29.5 | n = int(eval(input()))
hlist = list(map(int, input().split()))
dp = [0]*(n+1)
for i in range(2, n+1):
dp[i] = min(dp[i-1] + abs(hlist[i-2] - hlist[i-1]), dp[i-2] + abs(hlist[i-3] - hlist[i-1]) if i>2 else 10**9)
print((dp[n])) | # n, k = map(int, input())
n = int(eval(input()))
heights = list(map(int, input().split()))
heights = [0] + heights
dp = [10**10]*(n+1)
dp[1] = 0
for i in range(1, n+1 - 2):
dp[i+1] = min(dp[i+1], abs(heights[i+1] - heights[i]) + dp[i])
dp[i+2] = min(dp[i+2], abs(heights[i+2] - heights[i]) + dp[i])
dp[n] = min(dp[n], dp[n-1] + abs(heights[n] - heights[n-1]))
print((dp[n]))
| 9 | 13 | 233 | 390 | n = int(eval(input()))
hlist = list(map(int, input().split()))
dp = [0] * (n + 1)
for i in range(2, n + 1):
dp[i] = min(
dp[i - 1] + abs(hlist[i - 2] - hlist[i - 1]),
dp[i - 2] + abs(hlist[i - 3] - hlist[i - 1]) if i > 2 else 10**9,
)
print((dp[n]))
| # n, k = map(int, input())
n = int(eval(input()))
heights = list(map(int, input().split()))
heights = [0] + heights
dp = [10**10] * (n + 1)
dp[1] = 0
for i in range(1, n + 1 - 2):
dp[i + 1] = min(dp[i + 1], abs(heights[i + 1] - heights[i]) + dp[i])
dp[i + 2] = min(dp[i + 2], abs(heights[i + 2] - heights[i]) + dp[i])
dp[n] = min(dp[n], dp[n - 1] + abs(heights[n] - heights[n - 1]))
print((dp[n]))
| false | 30.769231 | [
"+# n, k = map(int, input())",
"-hlist = list(map(int, input().split()))",
"-dp = [0] * (n + 1)",
"-for i in range(2, n + 1):",
"- dp[i] = min(",
"- dp[i - 1] + abs(hlist[i - 2] - hlist[i - 1]),",
"- dp[i - 2] + abs(hlist[i - 3] - hlist[i - 1]) if i > 2 else 10**9,",
"- )",
"+heights = list(map(int, input().split()))",
"+heights = [0] + heights",
"+dp = [10**10] * (n + 1)",
"+dp[1] = 0",
"+for i in range(1, n + 1 - 2):",
"+ dp[i + 1] = min(dp[i + 1], abs(heights[i + 1] - heights[i]) + dp[i])",
"+ dp[i + 2] = min(dp[i + 2], abs(heights[i + 2] - heights[i]) + dp[i])",
"+dp[n] = min(dp[n], dp[n - 1] + abs(heights[n] - heights[n - 1]))"
] | false | 0.036847 | 0.038616 | 0.954182 | [
"s639472785",
"s022202080"
] |
u785578220 | p03687 | python | s030089380 | s781340391 | 51 | 45 | 3,060 | 3,060 | Accepted | Accepted | 11.76 |
t = "abcdefghijklmnopqrstuvwxyz"
s = eval(input())
ans = 1000
for i in t:
S = s
c = 0
while len(set(S))!=1:
c+=1
ts = ""
for j,k in zip(S,S[1:]):
if j == i or k == i:
ts+=i
else:
ts+=k
S = ts
ans = min(ans,c)
# print(c)
print(ans)
| # t = "abcdefghijklmnopqrstuvwxyz"
s = eval(input())
t = set(list(s))
ans = 1000
for i in t:
S = s
c = 0
while len(set(S))!=1:
c+=1
ts = ""
for j,k in zip(S,S[1:]):
if j == i or k == i:
ts+=i
else:
ts+=k
S = ts
ans = min(ans,c)
# print(c)
print(ans)
| 22 | 22 | 359 | 377 | t = "abcdefghijklmnopqrstuvwxyz"
s = eval(input())
ans = 1000
for i in t:
S = s
c = 0
while len(set(S)) != 1:
c += 1
ts = ""
for j, k in zip(S, S[1:]):
if j == i or k == i:
ts += i
else:
ts += k
S = ts
ans = min(ans, c)
# print(c)
print(ans)
| # t = "abcdefghijklmnopqrstuvwxyz"
s = eval(input())
t = set(list(s))
ans = 1000
for i in t:
S = s
c = 0
while len(set(S)) != 1:
c += 1
ts = ""
for j, k in zip(S, S[1:]):
if j == i or k == i:
ts += i
else:
ts += k
S = ts
ans = min(ans, c)
# print(c)
print(ans)
| false | 0 | [
"-t = \"abcdefghijklmnopqrstuvwxyz\"",
"+# t = \"abcdefghijklmnopqrstuvwxyz\"",
"+t = set(list(s))"
] | false | 0.033847 | 0.036799 | 0.919788 | [
"s030089380",
"s781340391"
] |
u051422473 | p03323 | python | s287263654 | s648278948 | 91 | 69 | 61,048 | 61,672 | Accepted | Accepted | 24.18 | print((["Yay!", ":(", ":("][sum([int(x) > 8 for x in input().split()])]))
| a, b = [int(x) for x in input().split()]
print((["Yay!", ":("][a > 8 or b > 8])) | 1 | 2 | 72 | 79 | print((["Yay!", ":(", ":("][sum([int(x) > 8 for x in input().split()])]))
| a, b = [int(x) for x in input().split()]
print((["Yay!", ":("][a > 8 or b > 8]))
| false | 50 | [
"-print(([\"Yay!\", \":(\", \":(\"][sum([int(x) > 8 for x in input().split()])]))",
"+a, b = [int(x) for x in input().split()]",
"+print(([\"Yay!\", \":(\"][a > 8 or b > 8]))"
] | false | 0.045476 | 0.03917 | 1.160986 | [
"s287263654",
"s648278948"
] |
u054514819 | p02781 | python | s890197630 | s284427769 | 88 | 26 | 6,240 | 3,940 | Accepted | Accepted | 70.45 | from functools import lru_cache
@lru_cache(None)
def solve(n,k) :
if n<=9:
if k==0: return 1
if k==1: return n
return 0
m = n//10
r = n%10
return r*solve(m, k-1)+(9-r)*solve(m-1, k-1)+solve(m, k)
N = int(eval(input()))
K = int(eval(input()))
print((solve(N, K))) | from functools import lru_cache
@lru_cache(None)
def solve(n,k) :
if n<=9:
if k==0: return 1
if k==1: return n
return 0
if k==0: return 1
m, r = divmod(n, 10)
return r*solve(m, k-1)+(9-r)*solve(m-1, k-1)+solve(m, k)
N = int(eval(input()))
K = int(eval(input()))
print((solve(N, K))) | 15 | 15 | 284 | 304 | from functools import lru_cache
@lru_cache(None)
def solve(n, k):
if n <= 9:
if k == 0:
return 1
if k == 1:
return n
return 0
m = n // 10
r = n % 10
return r * solve(m, k - 1) + (9 - r) * solve(m - 1, k - 1) + solve(m, k)
N = int(eval(input()))
K = int(eval(input()))
print((solve(N, K)))
| from functools import lru_cache
@lru_cache(None)
def solve(n, k):
if n <= 9:
if k == 0:
return 1
if k == 1:
return n
return 0
if k == 0:
return 1
m, r = divmod(n, 10)
return r * solve(m, k - 1) + (9 - r) * solve(m - 1, k - 1) + solve(m, k)
N = int(eval(input()))
K = int(eval(input()))
print((solve(N, K)))
| false | 0 | [
"- m = n // 10",
"- r = n % 10",
"+ if k == 0:",
"+ return 1",
"+ m, r = divmod(n, 10)"
] | false | 0.040214 | 0.038657 | 1.040267 | [
"s890197630",
"s284427769"
] |
u362560965 | p03475 | python | s537789748 | s951508106 | 2,523 | 102 | 3,188 | 3,188 | Accepted | Accepted | 95.96 | # N:駅の数
# Ci:i駅から i+1 駅への移動にかかる時間(cost)
# Si:i駅の最初の発車時間(start)
# Fi:i駅の発車スパン(frequency)
# Si % Fi = 0
N = int(eval(input()))
C = [0 for i in range(N)]
S = [0 for i in range(N)]
F = [0 for i in range(N)]
C[0], S[0], F[0] = 0, 0, 0
for i in range(N-1):
C[i+1], S[i+1], F[i+1] = (int(i) for i in input().split())
for s in range(1, N+1):
# print("start=", s)
if s == N:
t = 0
pass
else:
t = 0
for i in range(s, N):
# print("i =", i)
# print("S[", i, "] =", S[i])
if t < S[i]:
t = S[i]
t += C[i]
else:
for j in range(F[i]):
if (t + j) % F[i] == 0:
t = t + j
# print("notta zikan =", t)
t += C[i]
# print("tuita zikan =", t)
break
print(t)
| # N:駅の数
# Ci:i駅から i+1 駅への移動にかかる時間(cost)
# Si:i駅の最初の発車時間(start)
# Fi:i駅の発車スパン(frequency)
# Si % Fi = 0
N = int(eval(input()))
C = [0 for i in range(N)]
S = [0 for i in range(N)]
F = [0 for i in range(N)]
C[0], S[0], F[0] = 0, 0, 0
for i in range(N-1):
C[i+1], S[i+1], F[i+1] = (int(i) for i in input().split())
for s in range(1, N+1):
# print("start=", s)
if s == N:
t = 0
pass
else:
t = 0
for i in range(s, N):
if t < S[i]:
t = S[i]
elif t % F[i] == 0:
pass
else:
t = t + F[i] - (t % F[i])
t += C[i]
print(t)
| 38 | 35 | 957 | 692 | # N:駅の数
# Ci:i駅から i+1 駅への移動にかかる時間(cost)
# Si:i駅の最初の発車時間(start)
# Fi:i駅の発車スパン(frequency)
# Si % Fi = 0
N = int(eval(input()))
C = [0 for i in range(N)]
S = [0 for i in range(N)]
F = [0 for i in range(N)]
C[0], S[0], F[0] = 0, 0, 0
for i in range(N - 1):
C[i + 1], S[i + 1], F[i + 1] = (int(i) for i in input().split())
for s in range(1, N + 1):
# print("start=", s)
if s == N:
t = 0
pass
else:
t = 0
for i in range(s, N):
# print("i =", i)
# print("S[", i, "] =", S[i])
if t < S[i]:
t = S[i]
t += C[i]
else:
for j in range(F[i]):
if (t + j) % F[i] == 0:
t = t + j
# print("notta zikan =", t)
t += C[i]
# print("tuita zikan =", t)
break
print(t)
| # N:駅の数
# Ci:i駅から i+1 駅への移動にかかる時間(cost)
# Si:i駅の最初の発車時間(start)
# Fi:i駅の発車スパン(frequency)
# Si % Fi = 0
N = int(eval(input()))
C = [0 for i in range(N)]
S = [0 for i in range(N)]
F = [0 for i in range(N)]
C[0], S[0], F[0] = 0, 0, 0
for i in range(N - 1):
C[i + 1], S[i + 1], F[i + 1] = (int(i) for i in input().split())
for s in range(1, N + 1):
# print("start=", s)
if s == N:
t = 0
pass
else:
t = 0
for i in range(s, N):
if t < S[i]:
t = S[i]
elif t % F[i] == 0:
pass
else:
t = t + F[i] - (t % F[i])
t += C[i]
print(t)
| false | 7.894737 | [
"- # print(\"i =\", i)",
"- # print(\"S[\", i, \"] =\", S[i])",
"- t += C[i]",
"+ elif t % F[i] == 0:",
"+ pass",
"- for j in range(F[i]):",
"- if (t + j) % F[i] == 0:",
"- t = t + j",
"- # print(\"notta zikan =\", t)",
"- t += C[i]",
"- # print(\"tuita zikan =\", t)",
"- break",
"+ t = t + F[i] - (t % F[i])",
"+ t += C[i]"
] | false | 0.063585 | 0.035166 | 1.808138 | [
"s537789748",
"s951508106"
] |
u072053884 | p00909 | python | s176325199 | s951853386 | 5,370 | 4,950 | 36,272 | 133,984 | Accepted | Accepted | 7.82 | def solve():
def measurement(a, b, w):
a_root = root[a]
b_root = root[b]
if a_root != b_root:
a_member = member[a_root]
b_member = member[b_root]
offset = w - (weight[b] - weight[a])
if len(a_member) > len(b_member):
a_member.extend(b_member)
for n in b_member:
root[n] = a_root
weight[n] += offset
else:
b_member.extend(a_member)
for n in a_member:
root[n] = b_root
weight[n] -= offset
def inquiry(a, b):
if root[a] == root[b]:
return weight[b] - weight[a]
else:
return 'UNKNOWN'
import sys
file_input = sys.stdin
while True:
N, M = list(map(int, file_input.readline().split()))
if N == 0:
break
root = [i for i in range(N + 1)]
member = [[i] for i in range(N + 1)]
weight = [0] * (N + 1)
for _ in range(M):
line = file_input.readline()
if line[0] == '!':
a, b, w = list(map(int, line[2:].split()))
measurement(a, b, w)
else:
a, b= list(map(int, line[2:].split()))
print((inquiry(a, b)))
solve()
| def solve():
def measurement(a, b, w):
a_root = root[a]
b_root = root[b]
if a_root != b_root:
a_member = member[a_root]
b_member = member[b_root]
offset = w - (weight[b] - weight[a])
if len(a_member) > len(b_member):
a_member.extend(b_member)
for n in b_member:
root[n] = a_root
weight[n] += offset
else:
b_member.extend(a_member)
for n in a_member:
root[n] = b_root
weight[n] -= offset
def inquiry(a, b):
if root[a] == root[b]:
return weight[b] - weight[a]
else:
return 'UNKNOWN'
import sys
file_input = sys.stdin.readlines()
while True:
N, M = list(map(int, file_input[0].split()))
if N == 0:
break
root = [i for i in range(N + 1)]
member = [[i] for i in range(N + 1)]
weight = [0] * (N + 1)
for line in file_input[1:M+1]:
if line[0] == '!':
a, b, w = list(map(int, line[2:].split()))
measurement(a, b, w)
else:
a, b= list(map(int, line[2:].split()))
print((inquiry(a, b)))
del file_input[:M+1]
solve()
| 47 | 48 | 1,421 | 1,435 | def solve():
def measurement(a, b, w):
a_root = root[a]
b_root = root[b]
if a_root != b_root:
a_member = member[a_root]
b_member = member[b_root]
offset = w - (weight[b] - weight[a])
if len(a_member) > len(b_member):
a_member.extend(b_member)
for n in b_member:
root[n] = a_root
weight[n] += offset
else:
b_member.extend(a_member)
for n in a_member:
root[n] = b_root
weight[n] -= offset
def inquiry(a, b):
if root[a] == root[b]:
return weight[b] - weight[a]
else:
return "UNKNOWN"
import sys
file_input = sys.stdin
while True:
N, M = list(map(int, file_input.readline().split()))
if N == 0:
break
root = [i for i in range(N + 1)]
member = [[i] for i in range(N + 1)]
weight = [0] * (N + 1)
for _ in range(M):
line = file_input.readline()
if line[0] == "!":
a, b, w = list(map(int, line[2:].split()))
measurement(a, b, w)
else:
a, b = list(map(int, line[2:].split()))
print((inquiry(a, b)))
solve()
| def solve():
def measurement(a, b, w):
a_root = root[a]
b_root = root[b]
if a_root != b_root:
a_member = member[a_root]
b_member = member[b_root]
offset = w - (weight[b] - weight[a])
if len(a_member) > len(b_member):
a_member.extend(b_member)
for n in b_member:
root[n] = a_root
weight[n] += offset
else:
b_member.extend(a_member)
for n in a_member:
root[n] = b_root
weight[n] -= offset
def inquiry(a, b):
if root[a] == root[b]:
return weight[b] - weight[a]
else:
return "UNKNOWN"
import sys
file_input = sys.stdin.readlines()
while True:
N, M = list(map(int, file_input[0].split()))
if N == 0:
break
root = [i for i in range(N + 1)]
member = [[i] for i in range(N + 1)]
weight = [0] * (N + 1)
for line in file_input[1 : M + 1]:
if line[0] == "!":
a, b, w = list(map(int, line[2:].split()))
measurement(a, b, w)
else:
a, b = list(map(int, line[2:].split()))
print((inquiry(a, b)))
del file_input[: M + 1]
solve()
| false | 2.083333 | [
"- file_input = sys.stdin",
"+ file_input = sys.stdin.readlines()",
"- N, M = list(map(int, file_input.readline().split()))",
"+ N, M = list(map(int, file_input[0].split()))",
"- for _ in range(M):",
"- line = file_input.readline()",
"+ for line in file_input[1 : M + 1]:",
"+ del file_input[: M + 1]"
] | false | 0.044543 | 0.04585 | 0.971509 | [
"s176325199",
"s951853386"
] |
u813534019 | p02412 | python | s686938609 | s882383030 | 4,280 | 30 | 4,216 | 4,212 | Accepted | Accepted | 99.3 | while True:
count=0
n, s = tuple([int(x) for x in input().split(" ")])
if n==0 and s==0:
break
for i in range(1, n+1):
for j in range(1, n+1):
if j==i:
continue
for k in range(1, n+1):
if k==i or k==j:
continue
if i+j+k==s:
count+=1
print(count / 6) | while True:
count=0
n, s = tuple([int(x) for x in input().split(" ")])
if n==0 and s==0:
break
for i in range(1, n-1):
for j in range(i+1, n):
r = s - (i + j)
if j < r and r <= n:
count+=1
print(count) | 18 | 13 | 424 | 298 | while True:
count = 0
n, s = tuple([int(x) for x in input().split(" ")])
if n == 0 and s == 0:
break
for i in range(1, n + 1):
for j in range(1, n + 1):
if j == i:
continue
for k in range(1, n + 1):
if k == i or k == j:
continue
if i + j + k == s:
count += 1
print(count / 6)
| while True:
count = 0
n, s = tuple([int(x) for x in input().split(" ")])
if n == 0 and s == 0:
break
for i in range(1, n - 1):
for j in range(i + 1, n):
r = s - (i + j)
if j < r and r <= n:
count += 1
print(count)
| false | 27.777778 | [
"- for i in range(1, n + 1):",
"- for j in range(1, n + 1):",
"- if j == i:",
"- continue",
"- for k in range(1, n + 1):",
"- if k == i or k == j:",
"- continue",
"- if i + j + k == s:",
"- count += 1",
"- print(count / 6)",
"+ for i in range(1, n - 1):",
"+ for j in range(i + 1, n):",
"+ r = s - (i + j)",
"+ if j < r and r <= n:",
"+ count += 1",
"+ print(count)"
] | false | 0.050139 | 0.050068 | 1.001413 | [
"s686938609",
"s882383030"
] |
u780962115 | p02781 | python | s656172273 | s003417507 | 866 | 18 | 46,812 | 3,188 | Accepted | Accepted | 97.92 | n=int(eval(input()))
K=int(eval(input()))
if K==1:
counter=0
for i in range(100):
for j in range(1,10):
a="0"*(i)+str(j)+"0"*(99-i)
if 1<=int(a)<=n:
counter+=1
print(counter)
elif K==2:
counter=0
for i in range(100):
for j in range(i+1,100):
for k in range(1,10):
for l in range(1,10):
a="0"*(i)+str(k)+"0"*(j-i-1)+str(l)+"0"*(99-j)
if 1<=int(a)<=n:
counter+=1
print(counter)
elif K==3:
counter=0
for i in range(100):
if 100-i>len(str(n)):
pass
elif 100-i<len(str(n)):
for j in range(i+1,100):
for k in range(j+1,100):
counter+=9*9*9
elif 100-i==len(str(n)):
for j in range(i+1,100):
for k in range(j+1,100):
for b in range(1,10):
for c in range(1,10):
P=(str(n)[0])+"0"*(j-i-1)+str(b)+"0"*(k-j-1)+str(c)+"0"*(99-k)
if 1<=int(P)<=n:
counter+=1
counter+=((98-i)*(99-i)//2)*9*9*(int(str(n)[0])-1)
print(counter)
| #almost everywhere zero
n=eval(input())
k=int(eval(input()))
dp_small=[[0 for i in range(4)] for j in range(101)]
dp_same=[[0 for i in range(4)] for j in range(101)]
#dp/smallすでに小さい
#dp_largeまだ小さいかどうかわからない
for i in range(101):
dp_small[i][0]=1
dp_small[0][0]=0
dp_same[0][0]=1
for i in range(len(n)):
a=int(n[i])
#左からi+1番目の桁について考える
if a!=0:
dp_small[i+1][1]=dp_small[i][1]+9*dp_small[i][0]+(a-1)*dp_same[i][0]+dp_same[i][1]
dp_small[i+1][2]=dp_small[i][2]+9*dp_small[i][1]+(a-1)*dp_same[i][1]+dp_same[i][2]
dp_small[i+1][3]=dp_small[i][3]+9*dp_small[i][2]+(a-1)*dp_same[i][2]+dp_same[i][3]
dp_same[i+1][1]=dp_same[i][0]
dp_same[i+1][2]=dp_same[i][1]
dp_same[i+1][3]=dp_same[i][2]
elif a==0:
dp_small[i+1][1]=dp_small[i][1]+9*dp_small[i][0]
dp_small[i+1][2]=dp_small[i][2]+9*dp_small[i][1]
dp_small[i+1][3]=dp_small[i][3]+9*dp_small[i][2]
dp_same[i+1][1]=dp_same[i][1]
dp_same[i+1][2]=dp_same[i][2]
dp_same[i+1][3]=dp_same[i][3]
L=len(n)
sums= dp_small[L][k]+dp_same[L][k]
print(sums)
| 44 | 41 | 1,346 | 1,185 | n = int(eval(input()))
K = int(eval(input()))
if K == 1:
counter = 0
for i in range(100):
for j in range(1, 10):
a = "0" * (i) + str(j) + "0" * (99 - i)
if 1 <= int(a) <= n:
counter += 1
print(counter)
elif K == 2:
counter = 0
for i in range(100):
for j in range(i + 1, 100):
for k in range(1, 10):
for l in range(1, 10):
a = "0" * (i) + str(k) + "0" * (j - i - 1) + str(l) + "0" * (99 - j)
if 1 <= int(a) <= n:
counter += 1
print(counter)
elif K == 3:
counter = 0
for i in range(100):
if 100 - i > len(str(n)):
pass
elif 100 - i < len(str(n)):
for j in range(i + 1, 100):
for k in range(j + 1, 100):
counter += 9 * 9 * 9
elif 100 - i == len(str(n)):
for j in range(i + 1, 100):
for k in range(j + 1, 100):
for b in range(1, 10):
for c in range(1, 10):
P = (
(str(n)[0])
+ "0" * (j - i - 1)
+ str(b)
+ "0" * (k - j - 1)
+ str(c)
+ "0" * (99 - k)
)
if 1 <= int(P) <= n:
counter += 1
counter += ((98 - i) * (99 - i) // 2) * 9 * 9 * (int(str(n)[0]) - 1)
print(counter)
| # almost everywhere zero
n = eval(input())
k = int(eval(input()))
dp_small = [[0 for i in range(4)] for j in range(101)]
dp_same = [[0 for i in range(4)] for j in range(101)]
# dp/smallすでに小さい
# dp_largeまだ小さいかどうかわからない
for i in range(101):
dp_small[i][0] = 1
dp_small[0][0] = 0
dp_same[0][0] = 1
for i in range(len(n)):
a = int(n[i])
# 左からi+1番目の桁について考える
if a != 0:
dp_small[i + 1][1] = (
dp_small[i][1]
+ 9 * dp_small[i][0]
+ (a - 1) * dp_same[i][0]
+ dp_same[i][1]
)
dp_small[i + 1][2] = (
dp_small[i][2]
+ 9 * dp_small[i][1]
+ (a - 1) * dp_same[i][1]
+ dp_same[i][2]
)
dp_small[i + 1][3] = (
dp_small[i][3]
+ 9 * dp_small[i][2]
+ (a - 1) * dp_same[i][2]
+ dp_same[i][3]
)
dp_same[i + 1][1] = dp_same[i][0]
dp_same[i + 1][2] = dp_same[i][1]
dp_same[i + 1][3] = dp_same[i][2]
elif a == 0:
dp_small[i + 1][1] = dp_small[i][1] + 9 * dp_small[i][0]
dp_small[i + 1][2] = dp_small[i][2] + 9 * dp_small[i][1]
dp_small[i + 1][3] = dp_small[i][3] + 9 * dp_small[i][2]
dp_same[i + 1][1] = dp_same[i][1]
dp_same[i + 1][2] = dp_same[i][2]
dp_same[i + 1][3] = dp_same[i][3]
L = len(n)
sums = dp_small[L][k] + dp_same[L][k]
print(sums)
| false | 6.818182 | [
"-n = int(eval(input()))",
"-K = int(eval(input()))",
"-if K == 1:",
"- counter = 0",
"- for i in range(100):",
"- for j in range(1, 10):",
"- a = \"0\" * (i) + str(j) + \"0\" * (99 - i)",
"- if 1 <= int(a) <= n:",
"- counter += 1",
"- print(counter)",
"-elif K == 2:",
"- counter = 0",
"- for i in range(100):",
"- for j in range(i + 1, 100):",
"- for k in range(1, 10):",
"- for l in range(1, 10):",
"- a = \"0\" * (i) + str(k) + \"0\" * (j - i - 1) + str(l) + \"0\" * (99 - j)",
"- if 1 <= int(a) <= n:",
"- counter += 1",
"- print(counter)",
"-elif K == 3:",
"- counter = 0",
"- for i in range(100):",
"- if 100 - i > len(str(n)):",
"- pass",
"- elif 100 - i < len(str(n)):",
"- for j in range(i + 1, 100):",
"- for k in range(j + 1, 100):",
"- counter += 9 * 9 * 9",
"- elif 100 - i == len(str(n)):",
"- for j in range(i + 1, 100):",
"- for k in range(j + 1, 100):",
"- for b in range(1, 10):",
"- for c in range(1, 10):",
"- P = (",
"- (str(n)[0])",
"- + \"0\" * (j - i - 1)",
"- + str(b)",
"- + \"0\" * (k - j - 1)",
"- + str(c)",
"- + \"0\" * (99 - k)",
"- )",
"- if 1 <= int(P) <= n:",
"- counter += 1",
"- counter += ((98 - i) * (99 - i) // 2) * 9 * 9 * (int(str(n)[0]) - 1)",
"- print(counter)",
"+# almost everywhere zero",
"+n = eval(input())",
"+k = int(eval(input()))",
"+dp_small = [[0 for i in range(4)] for j in range(101)]",
"+dp_same = [[0 for i in range(4)] for j in range(101)]",
"+# dp/smallすでに小さい",
"+# dp_largeまだ小さいかどうかわからない",
"+for i in range(101):",
"+ dp_small[i][0] = 1",
"+dp_small[0][0] = 0",
"+dp_same[0][0] = 1",
"+for i in range(len(n)):",
"+ a = int(n[i])",
"+ # 左からi+1番目の桁について考える",
"+ if a != 0:",
"+ dp_small[i + 1][1] = (",
"+ dp_small[i][1]",
"+ + 9 * dp_small[i][0]",
"+ + (a - 1) * dp_same[i][0]",
"+ + dp_same[i][1]",
"+ )",
"+ dp_small[i + 1][2] = (",
"+ dp_small[i][2]",
"+ + 9 * dp_small[i][1]",
"+ + (a - 1) * dp_same[i][1]",
"+ + dp_same[i][2]",
"+ )",
"+ dp_small[i + 1][3] = (",
"+ dp_small[i][3]",
"+ + 9 * dp_small[i][2]",
"+ + (a - 1) * dp_same[i][2]",
"+ + dp_same[i][3]",
"+ )",
"+ dp_same[i + 1][1] = dp_same[i][0]",
"+ dp_same[i + 1][2] = dp_same[i][1]",
"+ dp_same[i + 1][3] = dp_same[i][2]",
"+ elif a == 0:",
"+ dp_small[i + 1][1] = dp_small[i][1] + 9 * dp_small[i][0]",
"+ dp_small[i + 1][2] = dp_small[i][2] + 9 * dp_small[i][1]",
"+ dp_small[i + 1][3] = dp_small[i][3] + 9 * dp_small[i][2]",
"+ dp_same[i + 1][1] = dp_same[i][1]",
"+ dp_same[i + 1][2] = dp_same[i][2]",
"+ dp_same[i + 1][3] = dp_same[i][3]",
"+L = len(n)",
"+sums = dp_small[L][k] + dp_same[L][k]",
"+print(sums)"
] | false | 0.47526 | 0.043886 | 10.829478 | [
"s656172273",
"s003417507"
] |
u761320129 | p03160 | python | s065752440 | s903500372 | 184 | 121 | 13,980 | 13,980 | Accepted | Accepted | 34.24 | N = int(eval(input()))
H = list(map(int,input().split()))
INF = float('inf')
dp = [INF] * N
dp[0] = 0
for i in range(1,N):
dp[i] = min(dp[i], dp[i-1] + abs(H[i] - H[i-1]))
if i > 1:
dp[i] = min(dp[i], dp[i-2] + abs(H[i] - H[i-2]))
print((dp[-1])) | N = int(eval(input()))
H = list(map(int,input().split()))
dp = [0]*N
dp[1] = abs(H[0] - H[1])
for i in range(2,N):
dp[i] = min(dp[i-2] + abs(H[i-2]-H[i]), dp[i-1] + abs(H[i-1]-H[i]))
print((dp[-1])) | 11 | 8 | 265 | 202 | N = int(eval(input()))
H = list(map(int, input().split()))
INF = float("inf")
dp = [INF] * N
dp[0] = 0
for i in range(1, N):
dp[i] = min(dp[i], dp[i - 1] + abs(H[i] - H[i - 1]))
if i > 1:
dp[i] = min(dp[i], dp[i - 2] + abs(H[i] - H[i - 2]))
print((dp[-1]))
| N = int(eval(input()))
H = list(map(int, input().split()))
dp = [0] * N
dp[1] = abs(H[0] - H[1])
for i in range(2, N):
dp[i] = min(dp[i - 2] + abs(H[i - 2] - H[i]), dp[i - 1] + abs(H[i - 1] - H[i]))
print((dp[-1]))
| false | 27.272727 | [
"-INF = float(\"inf\")",
"-dp = [INF] * N",
"-dp[0] = 0",
"-for i in range(1, N):",
"- dp[i] = min(dp[i], dp[i - 1] + abs(H[i] - H[i - 1]))",
"- if i > 1:",
"- dp[i] = min(dp[i], dp[i - 2] + abs(H[i] - H[i - 2]))",
"+dp = [0] * N",
"+dp[1] = abs(H[0] - H[1])",
"+for i in range(2, N):",
"+ dp[i] = min(dp[i - 2] + abs(H[i - 2] - H[i]), dp[i - 1] + abs(H[i - 1] - H[i]))"
] | false | 0.041887 | 0.150925 | 0.277535 | [
"s065752440",
"s903500372"
] |
u984276646 | p02713 | python | s191655625 | s613636542 | 1,502 | 22 | 9,484 | 9,164 | Accepted | Accepted | 98.54 | K = int(eval(input()))
def gcd(x, y):
a, b = x, y
while b != 0:
a, b = b, a % b
return a
gcds = [[0 for j in range(K)] for i in range(K)]
for i in range(K):
for j in range(K):
gcds[i][j] = gcd(i+1, j+1)
S = 0
for i in range(K):
for j in range(K):
for k in range(K):
S += gcds[gcds[j][k]-1][i]
print(S) | K = int(eval(input()))
mod = int(1e9) + 7
X = [0 for _ in range(K)]
def doubling(n, m):
y = 1
base = n
while m != 0:
if m % 2 == 1:
y *= base
y %= mod
base *= base
base %= mod
m //= 2
return y
SS = 0
for i in range(K, 0, -1):
d = K // i
S = doubling(d, 3)
if d > 1:
for j in range(2, d+1):
S -= X[j*i-1]
S %= mod
X[i-1] = S
SS += i * S
SS %= mod
print(SS) | 16 | 26 | 338 | 438 | K = int(eval(input()))
def gcd(x, y):
a, b = x, y
while b != 0:
a, b = b, a % b
return a
gcds = [[0 for j in range(K)] for i in range(K)]
for i in range(K):
for j in range(K):
gcds[i][j] = gcd(i + 1, j + 1)
S = 0
for i in range(K):
for j in range(K):
for k in range(K):
S += gcds[gcds[j][k] - 1][i]
print(S)
| K = int(eval(input()))
mod = int(1e9) + 7
X = [0 for _ in range(K)]
def doubling(n, m):
y = 1
base = n
while m != 0:
if m % 2 == 1:
y *= base
y %= mod
base *= base
base %= mod
m //= 2
return y
SS = 0
for i in range(K, 0, -1):
d = K // i
S = doubling(d, 3)
if d > 1:
for j in range(2, d + 1):
S -= X[j * i - 1]
S %= mod
X[i - 1] = S
SS += i * S
SS %= mod
print(SS)
| false | 38.461538 | [
"+mod = int(1e9) + 7",
"+X = [0 for _ in range(K)]",
"-def gcd(x, y):",
"- a, b = x, y",
"- while b != 0:",
"- a, b = b, a % b",
"- return a",
"+def doubling(n, m):",
"+ y = 1",
"+ base = n",
"+ while m != 0:",
"+ if m % 2 == 1:",
"+ y *= base",
"+ y %= mod",
"+ base *= base",
"+ base %= mod",
"+ m //= 2",
"+ return y",
"-gcds = [[0 for j in range(K)] for i in range(K)]",
"-for i in range(K):",
"- for j in range(K):",
"- gcds[i][j] = gcd(i + 1, j + 1)",
"-S = 0",
"-for i in range(K):",
"- for j in range(K):",
"- for k in range(K):",
"- S += gcds[gcds[j][k] - 1][i]",
"-print(S)",
"+SS = 0",
"+for i in range(K, 0, -1):",
"+ d = K // i",
"+ S = doubling(d, 3)",
"+ if d > 1:",
"+ for j in range(2, d + 1):",
"+ S -= X[j * i - 1]",
"+ S %= mod",
"+ X[i - 1] = S",
"+ SS += i * S",
"+ SS %= mod",
"+print(SS)"
] | false | 0.047147 | 0.048042 | 0.981369 | [
"s191655625",
"s613636542"
] |
u010090035 | p02744 | python | s502358028 | s822789122 | 360 | 176 | 25,544 | 13,988 | Accepted | Accepted | 51.11 | from collections import deque
n=int(eval(input()))
alpha=['a','b','c','d','e','f','g','h','i','j','k']
q=deque(['a'])
for i in range(n-1):
qi_ans=[]
while(len(q)>0):
qi=q.popleft()
qiword_maxind=0
for j in range(len(qi)):
qi_ans.append(qi+qi[j])
qij_ind=alpha.index(qi[j])
if(qiword_maxind<qij_ind):
qiword_maxind=qij_ind
else:
qi_ans.append(qi+alpha[qiword_maxind+1])
qi_ans=sorted(list(set(qi_ans)))
# print(qi_ans)
q.extend(qi_ans)
lenq=len(q)
for i in range(lenq):
print((q.popleft()))
| from collections import deque
n=int(eval(input()))
alpha=list('abcdefghijk')
q=deque([])
q.append(alpha[0])
for i in range(1,n):
qi=deque([])
while(len(q)>0):
qij=q.popleft()
qij_setnum=len(set(list(qij)))
for j in range(qij_setnum+1):
qi.append(qij+alpha[j])
q=qi
q=list(q)
q.sort()
for i in range(len(q)):
print((q[i])) | 26 | 23 | 630 | 393 | from collections import deque
n = int(eval(input()))
alpha = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k"]
q = deque(["a"])
for i in range(n - 1):
qi_ans = []
while len(q) > 0:
qi = q.popleft()
qiword_maxind = 0
for j in range(len(qi)):
qi_ans.append(qi + qi[j])
qij_ind = alpha.index(qi[j])
if qiword_maxind < qij_ind:
qiword_maxind = qij_ind
else:
qi_ans.append(qi + alpha[qiword_maxind + 1])
qi_ans = sorted(list(set(qi_ans)))
# print(qi_ans)
q.extend(qi_ans)
lenq = len(q)
for i in range(lenq):
print((q.popleft()))
| from collections import deque
n = int(eval(input()))
alpha = list("abcdefghijk")
q = deque([])
q.append(alpha[0])
for i in range(1, n):
qi = deque([])
while len(q) > 0:
qij = q.popleft()
qij_setnum = len(set(list(qij)))
for j in range(qij_setnum + 1):
qi.append(qij + alpha[j])
q = qi
q = list(q)
q.sort()
for i in range(len(q)):
print((q[i]))
| false | 11.538462 | [
"-alpha = [\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\"]",
"-q = deque([\"a\"])",
"-for i in range(n - 1):",
"- qi_ans = []",
"+alpha = list(\"abcdefghijk\")",
"+q = deque([])",
"+q.append(alpha[0])",
"+for i in range(1, n):",
"+ qi = deque([])",
"- qi = q.popleft()",
"- qiword_maxind = 0",
"- for j in range(len(qi)):",
"- qi_ans.append(qi + qi[j])",
"- qij_ind = alpha.index(qi[j])",
"- if qiword_maxind < qij_ind:",
"- qiword_maxind = qij_ind",
"- else:",
"- qi_ans.append(qi + alpha[qiword_maxind + 1])",
"- qi_ans = sorted(list(set(qi_ans)))",
"- # print(qi_ans)",
"- q.extend(qi_ans)",
"-lenq = len(q)",
"-for i in range(lenq):",
"- print((q.popleft()))",
"+ qij = q.popleft()",
"+ qij_setnum = len(set(list(qij)))",
"+ for j in range(qij_setnum + 1):",
"+ qi.append(qij + alpha[j])",
"+ q = qi",
"+q = list(q)",
"+q.sort()",
"+for i in range(len(q)):",
"+ print((q[i]))"
] | false | 0.038074 | 0.038674 | 0.98449 | [
"s502358028",
"s822789122"
] |
u912237403 | p00160 | python | s174449028 | s647366549 | 60 | 50 | 4,508 | 4,304 | Accepted | Accepted | 16.67 | while 1:
n = eval(input())
if n==0: break
A = []
for _ in [0]*n:
x,y,h,w = list(map(int, input().split()))
a = max(5-(160-x-y-h)/20, 0)
b = 5-(25-w)/5 if w>2 else 0
A.append(max(a, b))
print(sum([600 + e*200 for e in A if e<6])) | def f(x):
A = []
for i,e in enumerate(x): A += [i]*e
return A
A = f([61]+[20]*5)
B = f([3]*2+[5]*4)
C = list(range(600,1800,200))
while 1:
n = eval(input())
if n==0: break
s = 0
for _ in [0]*n:
x, y, h, w = list(map(int, input().split()))
size = x + y + h
if size <161 and w < 26:
s += C[max(A[size], B[w])]
print(s) | 10 | 19 | 255 | 355 | while 1:
n = eval(input())
if n == 0:
break
A = []
for _ in [0] * n:
x, y, h, w = list(map(int, input().split()))
a = max(5 - (160 - x - y - h) / 20, 0)
b = 5 - (25 - w) / 5 if w > 2 else 0
A.append(max(a, b))
print(sum([600 + e * 200 for e in A if e < 6]))
| def f(x):
A = []
for i, e in enumerate(x):
A += [i] * e
return A
A = f([61] + [20] * 5)
B = f([3] * 2 + [5] * 4)
C = list(range(600, 1800, 200))
while 1:
n = eval(input())
if n == 0:
break
s = 0
for _ in [0] * n:
x, y, h, w = list(map(int, input().split()))
size = x + y + h
if size < 161 and w < 26:
s += C[max(A[size], B[w])]
print(s)
| false | 47.368421 | [
"+def f(x):",
"+ A = []",
"+ for i, e in enumerate(x):",
"+ A += [i] * e",
"+ return A",
"+",
"+",
"+A = f([61] + [20] * 5)",
"+B = f([3] * 2 + [5] * 4)",
"+C = list(range(600, 1800, 200))",
"- A = []",
"+ s = 0",
"- a = max(5 - (160 - x - y - h) / 20, 0)",
"- b = 5 - (25 - w) / 5 if w > 2 else 0",
"- A.append(max(a, b))",
"- print(sum([600 + e * 200 for e in A if e < 6]))",
"+ size = x + y + h",
"+ if size < 161 and w < 26:",
"+ s += C[max(A[size], B[w])]",
"+ print(s)"
] | false | 0.03468 | 0.036471 | 0.950878 | [
"s174449028",
"s647366549"
] |
u530823931 | p02756 | python | s759419689 | s470584344 | 415 | 140 | 10,868 | 10,868 | Accepted | Accepted | 66.27 | from collections import deque
def main():
S = list(input().strip())
Q = int(eval(input()))
d = deque(S)
mode = True
for _ in range(Q):
query = input().split()
if query[0] == "1":
mode = not mode
elif query[0] == "2":
F, C = query[1], query[2]
if F == "1":
if mode:
d.appendleft(C)
else:
d.append(C)
elif F == "2":
if mode:
d.append(C)
else:
d.appendleft(C)
s = list(d)
if not mode:
s = s[::-1]
print((''.join(s)))
if __name__ == "__main__":
main() | from collections import deque
import sys
input = sys.stdin.readline
def main():
S = list(input().strip())
Q = int(eval(input()))
d = deque(S)
mode = True
for _ in range(Q):
query = input().split()
if query[0] == "1":
mode = not mode
elif query[0] == "2":
F, C = query[1], query[2]
if F == "1":
if mode:
d.appendleft(C)
else:
d.append(C)
elif F == "2":
if mode:
d.append(C)
else:
d.appendleft(C)
s = list(d)
if not mode:
s = s[::-1]
print((''.join(s)))
if __name__ == "__main__":
main() | 35 | 37 | 740 | 780 | from collections import deque
def main():
S = list(input().strip())
Q = int(eval(input()))
d = deque(S)
mode = True
for _ in range(Q):
query = input().split()
if query[0] == "1":
mode = not mode
elif query[0] == "2":
F, C = query[1], query[2]
if F == "1":
if mode:
d.appendleft(C)
else:
d.append(C)
elif F == "2":
if mode:
d.append(C)
else:
d.appendleft(C)
s = list(d)
if not mode:
s = s[::-1]
print(("".join(s)))
if __name__ == "__main__":
main()
| from collections import deque
import sys
input = sys.stdin.readline
def main():
S = list(input().strip())
Q = int(eval(input()))
d = deque(S)
mode = True
for _ in range(Q):
query = input().split()
if query[0] == "1":
mode = not mode
elif query[0] == "2":
F, C = query[1], query[2]
if F == "1":
if mode:
d.appendleft(C)
else:
d.append(C)
elif F == "2":
if mode:
d.append(C)
else:
d.appendleft(C)
s = list(d)
if not mode:
s = s[::-1]
print(("".join(s)))
if __name__ == "__main__":
main()
| false | 5.405405 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
] | false | 0.076879 | 0.071892 | 1.069374 | [
"s759419689",
"s470584344"
] |
u102445737 | p03128 | python | s466890078 | s194981946 | 1,030 | 197 | 69,592 | 40,816 | Accepted | Accepted | 80.87 | from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(eval(input()))
inl = lambda: list(map(int, input().split()))
inm = lambda: list(map(int, input().split()))
ins = lambda : input().strip()
DBG = True # and False
BIG = 999999999
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
DEPMAX = 5
def foo(n,dep):
if dep>DEPMAX or n<0:
ret = "-1"
elif n==0:
ret = ""
elif n%mn==0:
ret = str(mni)*(n//mn)
else:
mxs = "-1"
for x in a:
v = foo(n-cs[x],dep+1)
if v=="-1":
continue
vv = v+str(x)
if int(vv)>int(mxs):
mxs = vv
vv = str(x)+v
if int(vv)>int(mxs):
mxs = vv
ret = mxs
#ddprint(f"foo n {n} k {k} ret {ret}")
return ret
n,m = inm()
a = inl()
a.sort()
cs = [0,2,5,5,4,5,6,3,7,6]
mn = min([cs[x] for x in a])
for i in range(m-1,-1,-1):
if cs[a[i]]==mn:
mni = a[i]
break
#k = (n+mn-1)//mn
#k = (n)//mn
#ddprint(f"mn {mn} mni {mni}")
#ddprint(a)
print((foo(n,0)))
| from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(eval(input()))
inl = lambda: list(map(int, input().split()))
inm = lambda: list(map(int, input().split()))
ins = lambda : input().strip()
DBG = True # and False
BIG = 999999999
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
n,m = inm()
a = inl()
a.sort()
cs = [0,2,5,5,4,5,6,3,7,6]
dp = [-1]*(n+9)
dp[0] = 0
for i in range(n):
if dp[i]>=0:
for x in a:
c = cs[x]
dp[i+c] = max(dp[i+c], dp[i]+1)
ans = []
t = n
k = dp[n]
for j in range(k,0,-1):
for i in range(m-1,-1,-1):
x = a[i]
c = cs[x]
if t>=c and dp[t-c]==j-1:
ans.append(str(x))
t -= c
break
print((''.join(ans)))
| 53 | 38 | 1,153 | 792 | from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda: int(eval(input()))
inl = lambda: list(map(int, input().split()))
inm = lambda: list(map(int, input().split()))
ins = lambda: input().strip()
DBG = True # and False
BIG = 999999999
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
DEPMAX = 5
def foo(n, dep):
if dep > DEPMAX or n < 0:
ret = "-1"
elif n == 0:
ret = ""
elif n % mn == 0:
ret = str(mni) * (n // mn)
else:
mxs = "-1"
for x in a:
v = foo(n - cs[x], dep + 1)
if v == "-1":
continue
vv = v + str(x)
if int(vv) > int(mxs):
mxs = vv
vv = str(x) + v
if int(vv) > int(mxs):
mxs = vv
ret = mxs
# ddprint(f"foo n {n} k {k} ret {ret}")
return ret
n, m = inm()
a = inl()
a.sort()
cs = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
mn = min([cs[x] for x in a])
for i in range(m - 1, -1, -1):
if cs[a[i]] == mn:
mni = a[i]
break
# k = (n+mn-1)//mn
# k = (n)//mn
# ddprint(f"mn {mn} mni {mni}")
# ddprint(a)
print((foo(n, 0)))
| from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda: int(eval(input()))
inl = lambda: list(map(int, input().split()))
inm = lambda: list(map(int, input().split()))
ins = lambda: input().strip()
DBG = True # and False
BIG = 999999999
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
n, m = inm()
a = inl()
a.sort()
cs = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
dp = [-1] * (n + 9)
dp[0] = 0
for i in range(n):
if dp[i] >= 0:
for x in a:
c = cs[x]
dp[i + c] = max(dp[i + c], dp[i] + 1)
ans = []
t = n
k = dp[n]
for j in range(k, 0, -1):
for i in range(m - 1, -1, -1):
x = a[i]
c = cs[x]
if t >= c and dp[t - c] == j - 1:
ans.append(str(x))
t -= c
break
print(("".join(ans)))
| false | 28.301887 | [
"-DEPMAX = 5",
"-",
"-",
"-def foo(n, dep):",
"- if dep > DEPMAX or n < 0:",
"- ret = \"-1\"",
"- elif n == 0:",
"- ret = \"\"",
"- elif n % mn == 0:",
"- ret = str(mni) * (n // mn)",
"- else:",
"- mxs = \"-1\"",
"- for x in a:",
"- v = foo(n - cs[x], dep + 1)",
"- if v == \"-1\":",
"- continue",
"- vv = v + str(x)",
"- if int(vv) > int(mxs):",
"- mxs = vv",
"- vv = str(x) + v",
"- if int(vv) > int(mxs):",
"- mxs = vv",
"- ret = mxs",
"- # ddprint(f\"foo n {n} k {k} ret {ret}\")",
"- return ret",
"-",
"-",
"-mn = min([cs[x] for x in a])",
"-for i in range(m - 1, -1, -1):",
"- if cs[a[i]] == mn:",
"- mni = a[i]",
"- break",
"-# k = (n+mn-1)//mn",
"-# k = (n)//mn",
"-# ddprint(f\"mn {mn} mni {mni}\")",
"-# ddprint(a)",
"-print((foo(n, 0)))",
"+dp = [-1] * (n + 9)",
"+dp[0] = 0",
"+for i in range(n):",
"+ if dp[i] >= 0:",
"+ for x in a:",
"+ c = cs[x]",
"+ dp[i + c] = max(dp[i + c], dp[i] + 1)",
"+ans = []",
"+t = n",
"+k = dp[n]",
"+for j in range(k, 0, -1):",
"+ for i in range(m - 1, -1, -1):",
"+ x = a[i]",
"+ c = cs[x]",
"+ if t >= c and dp[t - c] == j - 1:",
"+ ans.append(str(x))",
"+ t -= c",
"+ break",
"+print((\"\".join(ans)))"
] | false | 0.036729 | 0.038931 | 0.94344 | [
"s466890078",
"s194981946"
] |
u994988729 | p03229 | python | s950220443 | s220017126 | 265 | 146 | 8,932 | 8,872 | Accepted | Accepted | 44.91 | from collections import deque
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
a.sort()
x = deque(a)
y = deque(a)
def align(a, fromLeft=1):
if fromLeft:
p = a.popleft()
else:
p = a.pop()
q = p
res = 0
fromLeft = 1 - fromLeft
while a:
p1 = a.popleft() if fromLeft else a.pop()
if a:
q1 = a.popleft() if fromLeft else a.pop()
res += abs(p - p1) + abs(q - q1)
p = p1
q = q1
else:
res += max(abs(p - p1), abs(q - p1))
fromLeft = 1 - fromLeft
return res
ans = max(align(x, 1), align(y, 0))
print(ans)
| from collections import deque
import sys
input = sys.stdin.readline
def solve(N, A, fromR=True):
res = 0
L, R = None, None
while A:
fromR = 1 - fromR
if L is None:
L = A.pop() if fromR else A.popleft()
R = L
continue
if len(A) > 1:
if fromR:
x = A.pop()
y = A.pop()
else:
x = A.popleft()
y = A.popleft()
res += abs((R + L) - (x + y))
R, L = x, y
continue
if len(A) == 1:
x = A.pop()
res += max(abs(R - x), abs(L - x))
continue
return res
if __name__ == "__main__":
N = int(eval(input()))
A = sorted([int(eval(input())) for _ in range(N)])
B = deque(A[::])
A = deque(A)
ans1 = solve(N, A, 0)
ans2 = solve(N, B, 1)
ans = max(ans1, ans2)
print(ans)
| 32 | 47 | 673 | 971 | from collections import deque
n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
a.sort()
x = deque(a)
y = deque(a)
def align(a, fromLeft=1):
if fromLeft:
p = a.popleft()
else:
p = a.pop()
q = p
res = 0
fromLeft = 1 - fromLeft
while a:
p1 = a.popleft() if fromLeft else a.pop()
if a:
q1 = a.popleft() if fromLeft else a.pop()
res += abs(p - p1) + abs(q - q1)
p = p1
q = q1
else:
res += max(abs(p - p1), abs(q - p1))
fromLeft = 1 - fromLeft
return res
ans = max(align(x, 1), align(y, 0))
print(ans)
| from collections import deque
import sys
input = sys.stdin.readline
def solve(N, A, fromR=True):
res = 0
L, R = None, None
while A:
fromR = 1 - fromR
if L is None:
L = A.pop() if fromR else A.popleft()
R = L
continue
if len(A) > 1:
if fromR:
x = A.pop()
y = A.pop()
else:
x = A.popleft()
y = A.popleft()
res += abs((R + L) - (x + y))
R, L = x, y
continue
if len(A) == 1:
x = A.pop()
res += max(abs(R - x), abs(L - x))
continue
return res
if __name__ == "__main__":
N = int(eval(input()))
A = sorted([int(eval(input())) for _ in range(N)])
B = deque(A[::])
A = deque(A)
ans1 = solve(N, A, 0)
ans2 = solve(N, B, 1)
ans = max(ans1, ans2)
print(ans)
| false | 31.914894 | [
"+import sys",
"-n = int(eval(input()))",
"-a = [int(eval(input())) for _ in range(n)]",
"-a.sort()",
"-x = deque(a)",
"-y = deque(a)",
"+input = sys.stdin.readline",
"-def align(a, fromLeft=1):",
"- if fromLeft:",
"- p = a.popleft()",
"- else:",
"- p = a.pop()",
"- q = p",
"+def solve(N, A, fromR=True):",
"- fromLeft = 1 - fromLeft",
"- while a:",
"- p1 = a.popleft() if fromLeft else a.pop()",
"- if a:",
"- q1 = a.popleft() if fromLeft else a.pop()",
"- res += abs(p - p1) + abs(q - q1)",
"- p = p1",
"- q = q1",
"- else:",
"- res += max(abs(p - p1), abs(q - p1))",
"- fromLeft = 1 - fromLeft",
"+ L, R = None, None",
"+ while A:",
"+ fromR = 1 - fromR",
"+ if L is None:",
"+ L = A.pop() if fromR else A.popleft()",
"+ R = L",
"+ continue",
"+ if len(A) > 1:",
"+ if fromR:",
"+ x = A.pop()",
"+ y = A.pop()",
"+ else:",
"+ x = A.popleft()",
"+ y = A.popleft()",
"+ res += abs((R + L) - (x + y))",
"+ R, L = x, y",
"+ continue",
"+ if len(A) == 1:",
"+ x = A.pop()",
"+ res += max(abs(R - x), abs(L - x))",
"+ continue",
"-ans = max(align(x, 1), align(y, 0))",
"-print(ans)",
"+if __name__ == \"__main__\":",
"+ N = int(eval(input()))",
"+ A = sorted([int(eval(input())) for _ in range(N)])",
"+ B = deque(A[::])",
"+ A = deque(A)",
"+ ans1 = solve(N, A, 0)",
"+ ans2 = solve(N, B, 1)",
"+ ans = max(ans1, ans2)",
"+ print(ans)"
] | false | 0.044704 | 0.037926 | 1.178719 | [
"s950220443",
"s220017126"
] |
u192154323 | p03212 | python | s168253647 | s196085624 | 493 | 113 | 3,316 | 9,316 | Accepted | Accepted | 77.08 | from collections import Counter
N = int(eval(input()))
def change_to_num(ls):
ls = list(map(str, ls))
strnum = ''.join(ls)
return int(strnum)
def dfs(num_ls):
'''
引数のnum_ls以降の753numの総数を返す
'''
if change_to_num(num_ls) > N:
return 0
tmp = 0
# 引数のnum_lsは753か？
c = Counter(num_ls)
is753 = True
for num in [7,5,3]:
if c[num] == 0:
is753 = False
if is753:
tmp += 1
# 次の状態の753総数を足す
for num in [7,5,3]:
num_ls.append(num)
tmp += dfs(num_ls)
num_ls.pop()
return tmp
print((dfs([0])))
| from collections import Counter
n = int(eval(input()))
ans = 0
def dfs(A):
if A and int(A) > n:
return
if len(A) >= 3:
c = Counter(A)
is753 = True
for i in ['7','5','3']:
if c[i] < 1:
is753 = False
if is753:
global ans
ans += 1
for nex in ['7','5','3']:
A += nex
dfs(A)
A = A[:-1]
dfs('')
print(ans) | 34 | 21 | 641 | 442 | from collections import Counter
N = int(eval(input()))
def change_to_num(ls):
ls = list(map(str, ls))
strnum = "".join(ls)
return int(strnum)
def dfs(num_ls):
"""
引数のnum_ls以降の753numの総数を返す
"""
if change_to_num(num_ls) > N:
return 0
tmp = 0
# 引数のnum_lsは753か？
c = Counter(num_ls)
is753 = True
for num in [7, 5, 3]:
if c[num] == 0:
is753 = False
if is753:
tmp += 1
# 次の状態の753総数を足す
for num in [7, 5, 3]:
num_ls.append(num)
tmp += dfs(num_ls)
num_ls.pop()
return tmp
print((dfs([0])))
| from collections import Counter
n = int(eval(input()))
ans = 0
def dfs(A):
if A and int(A) > n:
return
if len(A) >= 3:
c = Counter(A)
is753 = True
for i in ["7", "5", "3"]:
if c[i] < 1:
is753 = False
if is753:
global ans
ans += 1
for nex in ["7", "5", "3"]:
A += nex
dfs(A)
A = A[:-1]
dfs("")
print(ans)
| false | 38.235294 | [
"-N = int(eval(input()))",
"+n = int(eval(input()))",
"+ans = 0",
"-def change_to_num(ls):",
"- ls = list(map(str, ls))",
"- strnum = \"\".join(ls)",
"- return int(strnum)",
"+def dfs(A):",
"+ if A and int(A) > n:",
"+ return",
"+ if len(A) >= 3:",
"+ c = Counter(A)",
"+ is753 = True",
"+ for i in [\"7\", \"5\", \"3\"]:",
"+ if c[i] < 1:",
"+ is753 = False",
"+ if is753:",
"+ global ans",
"+ ans += 1",
"+ for nex in [\"7\", \"5\", \"3\"]:",
"+ A += nex",
"+ dfs(A)",
"+ A = A[:-1]",
"-def dfs(num_ls):",
"- \"\"\"",
"- 引数のnum_ls以降の753numの総数を返す",
"- \"\"\"",
"- if change_to_num(num_ls) > N:",
"- return 0",
"- tmp = 0",
"- # 引数のnum_lsは753か？",
"- c = Counter(num_ls)",
"- is753 = True",
"- for num in [7, 5, 3]:",
"- if c[num] == 0:",
"- is753 = False",
"- if is753:",
"- tmp += 1",
"- # 次の状態の753総数を足す",
"- for num in [7, 5, 3]:",
"- num_ls.append(num)",
"- tmp += dfs(num_ls)",
"- num_ls.pop()",
"- return tmp",
"-",
"-",
"-print((dfs([0])))",
"+dfs(\"\")",
"+print(ans)"
] | false | 0.157442 | 0.0583 | 2.700567 | [
"s168253647",
"s196085624"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.