user_id stringlengths 10 10 | problem_id stringlengths 6 6 | language stringclasses 1 value | submission_id_v0 stringlengths 10 10 | submission_id_v1 stringlengths 10 10 | cpu_time_v0 int64 10 38.3k | cpu_time_v1 int64 0 24.7k | memory_v0 int64 2.57k 1.02M | memory_v1 int64 2.57k 869k | status_v0 stringclasses 1 value | status_v1 stringclasses 1 value | improvement_frac float64 7.51 100 | input stringlengths 20 4.55k | target stringlengths 17 3.34k | code_v0_loc int64 1 148 | code_v1_loc int64 1 184 | code_v0_num_chars int64 13 4.55k | code_v1_num_chars int64 14 3.34k | code_v0_no_empty_lines stringlengths 21 6.88k | code_v1_no_empty_lines stringlengths 20 4.93k | code_same bool 1 class | relative_loc_diff_percent float64 0 79.8 | diff list | diff_only_import_comment bool 1 class | measured_runtime_v0 float64 0.01 4.45 | measured_runtime_v1 float64 0.01 4.31 | runtime_lift float64 0 359 | key list |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u017810624 | p02875 | python | s085010683 | s914029377 | 2,506 | 2,311 | 193,148 | 191,100 | Accepted | Accepted | 7.78 | n=int(eval(input()));l=[0,1];a=0;b=c=1;p=998244353
for i in range(2,n):
l+=[l[p%i]*(p-int(p/i))%p]
for i in range(n,n//2,-1):
a+=b*c%p;b=2*b%p;c=c*i*l[n+1-i]%p
print(((pow(3,n,p)-2*a+p)%p)) | n=int(eval(input()));l=[0,1];a=0;b=c=1;p=998244353
for i in range(2,n):
l+=[l[p%i]*(p-int(p/i))%p]
for i in range(n,n//2,-1):
a+=b*c%p;b=2*b%p;c=c*i*l[n+1-i]%p
print(((pow(3,n,p)-2*a)%p)) | 6 | 6 | 188 | 186 | n = int(eval(input()))
l = [0, 1]
a = 0
b = c = 1
p = 998244353
for i in range(2, n):
l += [l[p % i] * (p - int(p / i)) % p]
for i in range(n, n // 2, -1):
a += b * c % p
b = 2 * b % p
c = c * i * l[n + 1 - i] % p
print(((pow(3, n, p) - 2 * a + p) % p))
| n = int(eval(input()))
l = [0, 1]
a = 0
b = c = 1
p = 998244353
for i in range(2, n):
l += [l[p % i] * (p - int(p / i)) % p]
for i in range(n, n // 2, -1):
a += b * c % p
b = 2 * b % p
c = c * i * l[n + 1 - i] % p
print(((pow(3, n, p) - 2 * a) % p))
| false | 0 | [
"-print(((pow(3, n, p) - 2 * a + p) % p))",
"+print(((pow(3, n, p) - 2 * a) % p))"
] | false | 0.361123 | 0.545188 | 0.662382 | [
"s085010683",
"s914029377"
] |
u540631540 | p02695 | python | s025898668 | s363765445 | 1,558 | 1,018 | 12,700 | 12,696 | Accepted | Accepted | 34.66 | n, m, q = list(map(int, input().split()))
l = []
for i in range(q):
l1, l2, l3, l4 = list(map(int, input().split()))
l.append([l1, l2, l3, l4])
B = []
for a in range(1, m + 1):
for b in range(a, m + 1):
for c in range(b, m + 1):
for d in range(c, m + 1):
for e in range(d, m + 1):
for f in range(e, m + 1):
for g in range(f, m + 1):
for h in range(g, m + 1):
for i in range(h, m + 1):
for j in range(i, m + 1):
L = [a, b, c, d, e, f, g, h, i, j]
A = []
for I in range(n):
A.append(L[I])
C = 0
for k in range(q):
if A[l[k][1] - 1] - A[l[k][0] - 1] == l[k][2]:
C += l[k][3]
B.append(C)
print((max(B))) | def main():
n, m, q = list(map(int, input().split()))
l = []
for i in range(q):
l1, l2, l3, l4 = list(map(int, input().split()))
l.append([l1, l2, l3, l4])
B = []
for a in range(1, m + 1):
for b in range(a, m + 1):
for c in range(b, m + 1):
for d in range(c, m + 1):
for e in range(d, m + 1):
for f in range(e, m + 1):
for g in range(f, m + 1):
for h in range(g, m + 1):
for i in range(h, m + 1):
for j in range(i, m + 1):
L = [a, b, c, d, e, f, g, h, i, j]
A = []
for I in range(n):
A.append(L[I])
C = 0
for k in range(q):
if A[l[k][1] - 1] - A[l[k][0] - 1] == l[k][2]:
C += l[k][3]
B.append(C)
print((max(B)))
main() | 26 | 29 | 1,174 | 1,305 | n, m, q = list(map(int, input().split()))
l = []
for i in range(q):
l1, l2, l3, l4 = list(map(int, input().split()))
l.append([l1, l2, l3, l4])
B = []
for a in range(1, m + 1):
for b in range(a, m + 1):
for c in range(b, m + 1):
for d in range(c, m + 1):
for e in range(d, m + 1):
for f in range(e, m + 1):
for g in range(f, m + 1):
for h in range(g, m + 1):
for i in range(h, m + 1):
for j in range(i, m + 1):
L = [a, b, c, d, e, f, g, h, i, j]
A = []
for I in range(n):
A.append(L[I])
C = 0
for k in range(q):
if (
A[l[k][1] - 1] - A[l[k][0] - 1]
== l[k][2]
):
C += l[k][3]
B.append(C)
print((max(B)))
| def main():
n, m, q = list(map(int, input().split()))
l = []
for i in range(q):
l1, l2, l3, l4 = list(map(int, input().split()))
l.append([l1, l2, l3, l4])
B = []
for a in range(1, m + 1):
for b in range(a, m + 1):
for c in range(b, m + 1):
for d in range(c, m + 1):
for e in range(d, m + 1):
for f in range(e, m + 1):
for g in range(f, m + 1):
for h in range(g, m + 1):
for i in range(h, m + 1):
for j in range(i, m + 1):
L = [a, b, c, d, e, f, g, h, i, j]
A = []
for I in range(n):
A.append(L[I])
C = 0
for k in range(q):
if (
A[l[k][1] - 1] - A[l[k][0] - 1]
== l[k][2]
):
C += l[k][3]
B.append(C)
print((max(B)))
main()
| false | 10.344828 | [
"-n, m, q = list(map(int, input().split()))",
"-l = []",
"-for i in range(q):",
"- l1, l2, l3, l4 = list(map(int, input().split()))",
"- l.append([l1, l2, l3, l4])",
"-B = []",
"-for a in range(1, m + 1):",
"- for b in range(a, m + 1):",
"- for c in range(b, m + 1):",
"- ... | false | 0.132361 | 0.07468 | 1.772378 | [
"s025898668",
"s363765445"
] |
u528899139 | p03194 | python | s935701948 | s026336830 | 30 | 24 | 3,064 | 3,064 | Accepted | Accepted | 20 | # -*- coding: utf-8 -*-
from sys import stdin
n,x = [int(i) for i in stdin.readline().split()]
limit = int(x ** (1.0/n)) + 1
def factorize(x):
ans = 1
p = 2
if x % p == 0:
count = 1
x /= p
while x % p == 0:
count += 1
x /= p
if count >= n:
ans = ans * (p ** (count // n))
for p in range(3, limit, 2):
if x % p == 0:
count = 1
x /= p
while x % p == 0:
count += 1
x /= p
if count >= n:
ans = ans * (p ** (count // n))
if x < p * p:
break
return ans
if x == 1:
print((1))
elif n == 1:
print(x)
else:
ans = factorize(x)
print(ans) | # -*- coding: utf-8 -*-
from sys import stdin
n,x = [int(i) for i in stdin.readline().split()]
limit = int(x ** (1.0/n)) + 1
def devide_counter(x, p):
count = 1
x = x // p
while x % p == 0:
count += 1
x = x // p
return x, count
def factorize(x):
ans = 1
p = 2
if x % p == 0:
x, count = devide_counter(x, p)
if count >= n:
ans = ans * (p ** (count // n))
for p in range(3, limit, 2):
if x % p == 0:
x, count = devide_counter(x, p)
if count >= n:
ans = ans * (p ** (count // n))
if x < p * p:
break
return ans
if x == 1:
print((1))
elif n == 1:
print(x)
else:
ans = factorize(x)
print(ans) | 40 | 40 | 797 | 823 | # -*- coding: utf-8 -*-
from sys import stdin
n, x = [int(i) for i in stdin.readline().split()]
limit = int(x ** (1.0 / n)) + 1
def factorize(x):
ans = 1
p = 2
if x % p == 0:
count = 1
x /= p
while x % p == 0:
count += 1
x /= p
if count >= n:
ans = ans * (p ** (count // n))
for p in range(3, limit, 2):
if x % p == 0:
count = 1
x /= p
while x % p == 0:
count += 1
x /= p
if count >= n:
ans = ans * (p ** (count // n))
if x < p * p:
break
return ans
if x == 1:
print((1))
elif n == 1:
print(x)
else:
ans = factorize(x)
print(ans)
| # -*- coding: utf-8 -*-
from sys import stdin
n, x = [int(i) for i in stdin.readline().split()]
limit = int(x ** (1.0 / n)) + 1
def devide_counter(x, p):
count = 1
x = x // p
while x % p == 0:
count += 1
x = x // p
return x, count
def factorize(x):
ans = 1
p = 2
if x % p == 0:
x, count = devide_counter(x, p)
if count >= n:
ans = ans * (p ** (count // n))
for p in range(3, limit, 2):
if x % p == 0:
x, count = devide_counter(x, p)
if count >= n:
ans = ans * (p ** (count // n))
if x < p * p:
break
return ans
if x == 1:
print((1))
elif n == 1:
print(x)
else:
ans = factorize(x)
print(ans)
| false | 0 | [
"+def devide_counter(x, p):",
"+ count = 1",
"+ x = x // p",
"+ while x % p == 0:",
"+ count += 1",
"+ x = x // p",
"+ return x, count",
"+",
"+",
"- count = 1",
"- x /= p",
"- while x % p == 0:",
"- count += 1",
"- x /= ... | false | 0.046274 | 0.046342 | 0.998535 | [
"s935701948",
"s026336830"
] |
u872271866 | p02713 | python | s686560157 | s434529636 | 1,623 | 1,422 | 9,100 | 9,104 | Accepted | Accepted | 12.38 | from math import gcd
def main():
ans = 0
k = int(eval(input()))
for i in range(k):
for j in range(k):
for l in range(k):
ans += gcd(i+1,gcd(j+1,l+1))
print(ans)
if __name__ == "__main__":
main() | from math import gcd
def main():
ans = 0
k = int(eval(input()))
for i in range(1,1+k):
for j in range(1,1+k):
for l in range(1,1+k):
ans += gcd(i,gcd(j,l))
print(ans)
if __name__ == "__main__":
main() | 13 | 13 | 258 | 264 | from math import gcd
def main():
ans = 0
k = int(eval(input()))
for i in range(k):
for j in range(k):
for l in range(k):
ans += gcd(i + 1, gcd(j + 1, l + 1))
print(ans)
if __name__ == "__main__":
main()
| from math import gcd
def main():
ans = 0
k = int(eval(input()))
for i in range(1, 1 + k):
for j in range(1, 1 + k):
for l in range(1, 1 + k):
ans += gcd(i, gcd(j, l))
print(ans)
if __name__ == "__main__":
main()
| false | 0 | [
"- for i in range(k):",
"- for j in range(k):",
"- for l in range(k):",
"- ans += gcd(i + 1, gcd(j + 1, l + 1))",
"+ for i in range(1, 1 + k):",
"+ for j in range(1, 1 + k):",
"+ for l in range(1, 1 + k):",
"+ ans += gcd(i, gcd(j,... | false | 0.186097 | 0.043006 | 4.327215 | [
"s686560157",
"s434529636"
] |
u588341295 | p04045 | python | s711470071 | s176376815 | 118 | 108 | 3,192 | 3,064 | Accepted | Accepted | 8.47 | # -*- coding: utf-8 -*-
N,K = list(map(int, input().split()))
Dk = list(map(str, input().split()))
for i in range(N, 100000):
i = str(i)
for j in range(K):
if i.find(Dk[j]) != -1:
break
if j == K-1:
print(i)
exit() | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
N, K = MAP()
A = LIST()
i = N
while 1:
s = str(i)
for a in A:
if s.count(str(a)):
break
else:
print(i)
exit()
i += 1
| 13 | 33 | 282 | 879 | # -*- coding: utf-8 -*-
N, K = list(map(int, input().split()))
Dk = list(map(str, input().split()))
for i in range(N, 100000):
i = str(i)
for j in range(K):
if i.find(Dk[j]) != -1:
break
if j == K - 1:
print(i)
exit()
| # -*- coding: utf-8 -*-
import sys
def input():
return sys.stdin.readline().strip()
def list2d(a, b, c):
return [[c] * b for i in range(a)]
def list3d(a, b, c, d):
return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e):
return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1):
return int(-(-x // y))
def INT():
return int(eval(input()))
def MAP():
return list(map(int, input().split()))
def LIST(N=None):
return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes():
print("Yes")
def No():
print("No")
def YES():
print("YES")
def NO():
print("NO")
sys.setrecursionlimit(10**9)
INF = 10**18
MOD = 10**9 + 7
N, K = MAP()
A = LIST()
i = N
while 1:
s = str(i)
for a in A:
if s.count(str(a)):
break
else:
print(i)
exit()
i += 1
| false | 60.606061 | [
"-N, K = list(map(int, input().split()))",
"-Dk = list(map(str, input().split()))",
"-for i in range(N, 100000):",
"- i = str(i)",
"- for j in range(K):",
"- if i.find(Dk[j]) != -1:",
"+import sys",
"+",
"+",
"+def input():",
"+ return sys.stdin.readline().strip()",
"+",
"+",... | false | 0.040651 | 0.092983 | 0.437188 | [
"s711470071",
"s176376815"
] |
u968166680 | p03044 | python | s301686520 | s298249663 | 845 | 394 | 164,600 | 58,808 | Accepted | Accepted | 53.37 | import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
N = int(readline())
G = [[] for _ in range(N)]
for _ in range(N - 1):
u, v, w = map(int, readline().split())
G[u - 1].append((v - 1, w))
G[v - 1].append((u - 1, w))
color = [0] * N
def dfs(v, p, c):
color[v] = c
for nv, w in G[v]:
if nv == p:
continue
if w % 2:
dfs(nv, v, 1 - c)
else:
dfs(nv, v, c)
dfs(0, -1, 0)
print(*color, sep='\n')
return
if __name__ == '__main__':
main()
| import sys
from heapq import heappush, heappop
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *UVW = map(int, read().split())
G = [[] for _ in range(N)]
for u, v, w in zip(*[iter(UVW)] * 3):
G[u - 1].append((v - 1, w))
G[v - 1].append((u - 1, w))
dist = [INF] * N
dist[0] = 0
hq = [(0, 0)]
while hq:
d, v = heappop(hq)
if d > dist[v]:
continue
for nv, cost in G[v]:
if dist[nv] > dist[v] + cost:
dist[nv] = dist[v] + cost
heappush(hq, (dist[nv], nv))
ans = [0] * N
for i in range(N):
ans[i] = 0 if dist[i] % 2 == 0 else 1
print(*ans, sep='\n')
return
if __name__ == '__main__':
main()
| 37 | 41 | 765 | 900 | import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
def main():
N = int(readline())
G = [[] for _ in range(N)]
for _ in range(N - 1):
u, v, w = map(int, readline().split())
G[u - 1].append((v - 1, w))
G[v - 1].append((u - 1, w))
color = [0] * N
def dfs(v, p, c):
color[v] = c
for nv, w in G[v]:
if nv == p:
continue
if w % 2:
dfs(nv, v, 1 - c)
else:
dfs(nv, v, c)
dfs(0, -1, 0)
print(*color, sep="\n")
return
if __name__ == "__main__":
main()
| import sys
from heapq import heappush, heappop
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *UVW = map(int, read().split())
G = [[] for _ in range(N)]
for u, v, w in zip(*[iter(UVW)] * 3):
G[u - 1].append((v - 1, w))
G[v - 1].append((u - 1, w))
dist = [INF] * N
dist[0] = 0
hq = [(0, 0)]
while hq:
d, v = heappop(hq)
if d > dist[v]:
continue
for nv, cost in G[v]:
if dist[nv] > dist[v] + cost:
dist[nv] = dist[v] + cost
heappush(hq, (dist[nv], nv))
ans = [0] * N
for i in range(N):
ans[i] = 0 if dist[i] % 2 == 0 else 1
print(*ans, sep="\n")
return
if __name__ == "__main__":
main()
| false | 9.756098 | [
"-from collections import deque",
"+from heapq import heappush, heappop",
"+MOD = 1000000007",
"- N = int(readline())",
"+ N, *UVW = map(int, read().split())",
"- for _ in range(N - 1):",
"- u, v, w = map(int, readline().split())",
"+ for u, v, w in zip(*[iter(UVW)] * 3):",
"- ... | false | 0.08097 | 0.039427 | 2.05367 | [
"s301686520",
"s298249663"
] |
u745087332 | p03745 | python | s887192039 | s317566132 | 75 | 56 | 14,252 | 14,168 | Accepted | Accepted | 25.33 | # coding:utf-8
def inpl(): return list(map(int, input().split()))
N = int(eval(input()))
A = inpl()
ans = 1
prev = A[0]
state = 0 # 1: 増加, 0: 横ばい, -1: 減少
for i in range(1, N):
if state == 0:
if A[i] > prev:
state = 1
elif A[i] < prev:
state = -1
elif state == 1:
if A[i] < prev:
ans += 1
state = 0
else:
if A[i] > prev:
ans += 1
state = 0
prev = A[i]
print(ans)
| # coding:utf-8
import sys
# from collections import Counter, defaultdict
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
def main():
n = II()
A = LI()
# 1: 単調非減少，2: 単調非増加，0: 未定
state = 0
prev = A[0]
res = 1
for cur in A:
if state:
if state == 1 and prev > cur:
res += 1
state = 0
if state == 2 and prev < cur:
res += 1
state = 0
else:
if prev < cur:
state = 1
if prev > cur:
state = 2
prev = cur
return res
print((main()))
| 32 | 42 | 517 | 907 | # coding:utf-8
def inpl():
return list(map(int, input().split()))
N = int(eval(input()))
A = inpl()
ans = 1
prev = A[0]
state = 0 # 1: 増加, 0: 横ばい, -1: 減少
for i in range(1, N):
if state == 0:
if A[i] > prev:
state = 1
elif A[i] < prev:
state = -1
elif state == 1:
if A[i] < prev:
ans += 1
state = 0
else:
if A[i] > prev:
ans += 1
state = 0
prev = A[i]
print(ans)
| # coding:utf-8
import sys
# from collections import Counter, defaultdict
INF = float("inf")
MOD = 10**9 + 7
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def LI_():
return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS():
return sys.stdin.readline().split()
def II():
return int(sys.stdin.readline())
def SI():
return eval(input())
def main():
n = II()
A = LI()
# 1: 単調非減少，2: 単調非増加，0: 未定
state = 0
prev = A[0]
res = 1
for cur in A:
if state:
if state == 1 and prev > cur:
res += 1
state = 0
if state == 2 and prev < cur:
res += 1
state = 0
else:
if prev < cur:
state = 1
if prev > cur:
state = 2
prev = cur
return res
print((main()))
| false | 23.809524 | [
"-def inpl():",
"- return list(map(int, input().split()))",
"+import sys",
"+",
"+# from collections import Counter, defaultdict",
"+INF = float(\"inf\")",
"+MOD = 10**9 + 7",
"-N = int(eval(input()))",
"-A = inpl()",
"-ans = 1",
"-prev = A[0]",
"-state = 0 # 1: 増加, 0: 横ばい, -1: 減少",
"-fo... | false | 0.035286 | 0.058362 | 0.604607 | [
"s887192039",
"s317566132"
] |
u548545174 | p03556 | python | s746545545 | s722897948 | 55 | 27 | 4,360 | 2,940 | Accepted | Accepted | 50.91 | N = int(eval(input()))
sq = [i ** 2 for i in range(10 ** 5) if i ** 2 <= N]
print((sq[-1])) | N = int(eval(input()))
for i in range(10 ** 5):
if i ** 2 <= N:
continue
else:
print(((i - 1) ** 2))
break | 3 | 7 | 85 | 136 | N = int(eval(input()))
sq = [i**2 for i in range(10**5) if i ** 2 <= N]
print((sq[-1]))
| N = int(eval(input()))
for i in range(10**5):
if i**2 <= N:
continue
else:
print(((i - 1) ** 2))
break
| false | 57.142857 | [
"-sq = [i**2 for i in range(10**5) if i ** 2 <= N]",
"-print((sq[-1]))",
"+for i in range(10**5):",
"+ if i**2 <= N:",
"+ continue",
"+ else:",
"+ print(((i - 1) ** 2))",
"+ break"
] | false | 0.077203 | 0.073177 | 1.055017 | [
"s746545545",
"s722897948"
] |
u983918956 | p03212 | python | s851536690 | s133191940 | 293 | 139 | 31,148 | 14,996 | Accepted | Accepted | 52.56 | N = eval(input())
def rec(list1,list2,initial,time):
for e in list1:
for b in [0,1,2,3]:
if b == 0:
e_copy = e
list2.append(e_copy)
elif b == 1:
e_copy = e + "3"
list2.append(e_copy)
elif b == 2:
e_copy = e + "5"
list2.append(e_copy)
elif b == 3:
e_copy = e + "7"
list2.append(e_copy)
list1.clear()
# initial + 1 がn回目のループ
if initial + 1 >= time :
return list2
else:
return rec(list2,list1,initial + 1, time)
l1 = [""]
l2 = []
result = rec(l1,l2,0,len(N))
result = [int(e) for e in result if e.count("3")*e.count("5")*e.count("7") >= 1]
result = list(set(result))
result.sort()
count = 0
for e in result:
if int(N) < e:
break
count += 1
print(count) | N = eval(input())
def rec(list1,initial,time):
empty = []
for e in list1:
for b in [0,1,2]:
if b == 0:
e_copy = e + "3"
empty.append(e_copy)
elif b == 1:
e_copy = e + "5"
empty.append(e_copy)
elif b == 2:
e_copy = e + "7"
empty.append(e_copy)
list1 = empty[:]
# initial + 1 がn回目のループ
if initial + 1 >= time :
return list1
else:
return rec(list1,initial + 1, time)
l1 = [""]
result = rec(l1,0,3)
for i in range(len(N)-3):
result += rec(result,0,1)
result = [int(e) for e in result if e.count("3")*e.count("5")*e.count("7") >= 1]
result = list(set(result))
result.sort()
count = 0
for e in result:
if int(N) < e:
break
count += 1
print(count) | 34 | 33 | 911 | 865 | N = eval(input())
def rec(list1, list2, initial, time):
for e in list1:
for b in [0, 1, 2, 3]:
if b == 0:
e_copy = e
list2.append(e_copy)
elif b == 1:
e_copy = e + "3"
list2.append(e_copy)
elif b == 2:
e_copy = e + "5"
list2.append(e_copy)
elif b == 3:
e_copy = e + "7"
list2.append(e_copy)
list1.clear()
# initial + 1 がn回目のループ
if initial + 1 >= time:
return list2
else:
return rec(list2, list1, initial + 1, time)
l1 = [""]
l2 = []
result = rec(l1, l2, 0, len(N))
result = [int(e) for e in result if e.count("3") * e.count("5") * e.count("7") >= 1]
result = list(set(result))
result.sort()
count = 0
for e in result:
if int(N) < e:
break
count += 1
print(count)
| N = eval(input())
def rec(list1, initial, time):
empty = []
for e in list1:
for b in [0, 1, 2]:
if b == 0:
e_copy = e + "3"
empty.append(e_copy)
elif b == 1:
e_copy = e + "5"
empty.append(e_copy)
elif b == 2:
e_copy = e + "7"
empty.append(e_copy)
list1 = empty[:]
# initial + 1 がn回目のループ
if initial + 1 >= time:
return list1
else:
return rec(list1, initial + 1, time)
l1 = [""]
result = rec(l1, 0, 3)
for i in range(len(N) - 3):
result += rec(result, 0, 1)
result = [int(e) for e in result if e.count("3") * e.count("5") * e.count("7") >= 1]
result = list(set(result))
result.sort()
count = 0
for e in result:
if int(N) < e:
break
count += 1
print(count)
| false | 2.941176 | [
"-def rec(list1, list2, initial, time):",
"+def rec(list1, initial, time):",
"+ empty = []",
"- for b in [0, 1, 2, 3]:",
"+ for b in [0, 1, 2]:",
"- e_copy = e",
"- list2.append(e_copy)",
"+ e_copy = e + \"3\"",
"+ empty.ap... | false | 0.037042 | 0.038644 | 0.958541 | [
"s851536690",
"s133191940"
] |
u525065967 | p02570 | python | s260858284 | s196466963 | 33 | 30 | 9,084 | 9,164 | Accepted | Accepted | 9.09 | d, t, s = list(map(int, input().split()))
# s*t = d'
if s*t >= d: print('Yes')
else:print('No')
| d, t, s = list(map(int, input().split()))
print(('No' if s*t < d else 'Yes'))
| 6 | 2 | 97 | 71 | d, t, s = list(map(int, input().split()))
# s*t = d'
if s * t >= d:
print("Yes")
else:
print("No")
| d, t, s = list(map(int, input().split()))
print(("No" if s * t < d else "Yes"))
| false | 66.666667 | [
"-# s*t = d'",
"-if s * t >= d:",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"+print((\"No\" if s * t < d else \"Yes\"))"
] | false | 0.051279 | 0.047081 | 1.089167 | [
"s260858284",
"s196466963"
] |
u792720861 | p03126 | python | s537643609 | s425383645 | 30 | 27 | 9,092 | 9,120 | Accepted | Accepted | 10 | n, m = list(map(int, input().split()))
S = set(range(1, m+1))
for i in range(n):
k, *a = list(map(int, input().split()))
S &= set(a)
print((len(S)))
| n, m = list(map(int, input().split()))
s = set(range(1, m+1))
for i in range(n):
k, *a = list(map(int, input().split()))
s &= set(a)
print((len(s)))
| 8 | 8 | 152 | 152 | n, m = list(map(int, input().split()))
S = set(range(1, m + 1))
for i in range(n):
k, *a = list(map(int, input().split()))
S &= set(a)
print((len(S)))
| n, m = list(map(int, input().split()))
s = set(range(1, m + 1))
for i in range(n):
k, *a = list(map(int, input().split()))
s &= set(a)
print((len(s)))
| false | 0 | [
"-S = set(range(1, m + 1))",
"+s = set(range(1, m + 1))",
"- S &= set(a)",
"-print((len(S)))",
"+ s &= set(a)",
"+print((len(s)))"
] | false | 0.035328 | 0.0885 | 0.399189 | [
"s537643609",
"s425383645"
] |
u775681539 | p02803 | python | s453401421 | s816787681 | 393 | 353 | 3,316 | 3,440 | Accepted | Accepted | 10.18 | #python3
from collections import deque
INF = int(1e9)
dd = [(-1, 0), (1, 0), (0, 1), (0, -1)]
def main():
h, w = list(map(int, input().split()))
maze = [eval(input()) for _ in range(h)]
ans = -1
for i in range(h):
for j in range(w):
if maze[i][j] == '#':
continue
g = [[INF for _ in range(w)] for _ in range(h)]
q = deque()
q.append((i, j))
g[i][j] = 0
while len(q) > 0:
pi, pj = q.popleft()
for dx, dy in dd:
x = pi + dx
y = pj + dy
if (x < 0) | (y < 0) | (x >= h) | (y >= w):
continue
if maze[x][y] == '#':
continue
if g[x][y] != INF:
continue
q.append((x, y))
g[x][y] = g[pi][pj]+1
for k in range(h):
for l in range(w):
if g[k][l] == INF:
continue
ans = max(ans, g[k][l])
print(ans)
main() | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
INF = 100000
dir = ((1, 0), (-1, 0), (0, 1), (0, -1))
def main():
H, W = list(map(int, readline().split()))
maze = []
for _ in range(H):
s = readline().rstrip().decode()
maze.append(s)
def bfs(si, sj):
dq = deque()
dq.append((si, sj))
dist = [[INF for _ in range(W)] for _ in range(H)]
dist[si][sj] = 0
while len(dq)>0:
i, j = dq.popleft()
for di, dj in dir:
nxi = i+di
nxj = j+dj
if (nxi<0) or (nxj<0) or (nxi>=H) or (nxj>=W):
continue
if maze[nxi][nxj] == '#':
continue
if dist[nxi][nxj] != INF:
continue
dist[nxi][nxj] = dist[i][j]+1
dq.append((nxi, nxj))
res = 0
for i in range(H):
for j in range(W):
if dist[i][j] == INF:
continue
res = max(dist[i][j], res)
return res
ans = 0
for si in range(H):
for sj in range(W):
if maze[si][sj] == '#':
continue
ans = max(bfs(si, sj), ans)
print(ans)
if __name__ == '__main__':
main()
| 40 | 52 | 1,204 | 1,471 | # python3
from collections import deque
INF = int(1e9)
dd = [(-1, 0), (1, 0), (0, 1), (0, -1)]
def main():
h, w = list(map(int, input().split()))
maze = [eval(input()) for _ in range(h)]
ans = -1
for i in range(h):
for j in range(w):
if maze[i][j] == "#":
continue
g = [[INF for _ in range(w)] for _ in range(h)]
q = deque()
q.append((i, j))
g[i][j] = 0
while len(q) > 0:
pi, pj = q.popleft()
for dx, dy in dd:
x = pi + dx
y = pj + dy
if (x < 0) | (y < 0) | (x >= h) | (y >= w):
continue
if maze[x][y] == "#":
continue
if g[x][y] != INF:
continue
q.append((x, y))
g[x][y] = g[pi][pj] + 1
for k in range(h):
for l in range(w):
if g[k][l] == INF:
continue
ans = max(ans, g[k][l])
print(ans)
main()
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
INF = 100000
dir = ((1, 0), (-1, 0), (0, 1), (0, -1))
def main():
H, W = list(map(int, readline().split()))
maze = []
for _ in range(H):
s = readline().rstrip().decode()
maze.append(s)
def bfs(si, sj):
dq = deque()
dq.append((si, sj))
dist = [[INF for _ in range(W)] for _ in range(H)]
dist[si][sj] = 0
while len(dq) > 0:
i, j = dq.popleft()
for di, dj in dir:
nxi = i + di
nxj = j + dj
if (nxi < 0) or (nxj < 0) or (nxi >= H) or (nxj >= W):
continue
if maze[nxi][nxj] == "#":
continue
if dist[nxi][nxj] != INF:
continue
dist[nxi][nxj] = dist[i][j] + 1
dq.append((nxi, nxj))
res = 0
for i in range(H):
for j in range(W):
if dist[i][j] == INF:
continue
res = max(dist[i][j], res)
return res
ans = 0
for si in range(H):
for sj in range(W):
if maze[si][sj] == "#":
continue
ans = max(bfs(si, sj), ans)
print(ans)
if __name__ == "__main__":
main()
| false | 23.076923 | [
"-# python3",
"+import sys",
"+",
"+read = sys.stdin.buffer.read",
"+readline = sys.stdin.buffer.readline",
"+readlines = sys.stdin.buffer.readlines",
"-INF = int(1e9)",
"-dd = [(-1, 0), (1, 0), (0, 1), (0, -1)]",
"+INF = 100000",
"+dir = ((1, 0), (-1, 0), (0, 1), (0, -1))",
"- h, w = list(ma... | false | 0.043238 | 0.05738 | 0.753536 | [
"s453401421",
"s816787681"
] |
u094191970 | p02675 | python | s155726468 | s680335951 | 24 | 21 | 9,184 | 9,040 | Accepted | Accepted | 12.5 | n=list(eval(input()))
if int(n[-1]) in [2,4,5,7,9]:
print('hon')
if int(n[-1]) in [0,1,6,8]:
print('pon')
if int(n[-1])==3:
print('bon') | n=input()[-1]
if n=='3':
print('bon')
elif n in '0168':
print('pon')
else:
print('hon') | 7 | 7 | 142 | 99 | n = list(eval(input()))
if int(n[-1]) in [2, 4, 5, 7, 9]:
print("hon")
if int(n[-1]) in [0, 1, 6, 8]:
print("pon")
if int(n[-1]) == 3:
print("bon")
| n = input()[-1]
if n == "3":
print("bon")
elif n in "0168":
print("pon")
else:
print("hon")
| false | 0 | [
"-n = list(eval(input()))",
"-if int(n[-1]) in [2, 4, 5, 7, 9]:",
"+n = input()[-1]",
"+if n == \"3\":",
"+ print(\"bon\")",
"+elif n in \"0168\":",
"+ print(\"pon\")",
"+else:",
"-if int(n[-1]) in [0, 1, 6, 8]:",
"- print(\"pon\")",
"-if int(n[-1]) == 3:",
"- print(\"bon\")"
] | false | 0.150408 | 0.114416 | 1.314573 | [
"s155726468",
"s680335951"
] |
u303039933 | p02691 | python | s384476461 | s622148786 | 311 | 197 | 81,296 | 137,532 | Accepted | Accepted | 36.66 | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
from decimal import *
class Scanner():
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [Scanner.string() for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [Scanner.int() for i in range(n)]
class Math():
@staticmethod
def gcd(a, b):
if b == 0:
return a
return Math.gcd(b, a % b)
@staticmethod
def lcm(a, b):
return (a * b) // Math.gcd(a, b)
@staticmethod
def divisor(n):
res = []
i = 1
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
res.append(i)
if i != n // i:
res.append(n // i)
return res
@staticmethod
def round_up(a, b):
return -(-a // b)
@staticmethod
def is_prime(n):
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
d = int(n ** 0.5) + 1
for i in range(3, d + 1, 2):
if n % i == 0:
return False
return True
def pop_count(x):
x = x - ((x >> 1) & 0x5555555555555555)
x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f
x = x + (x >> 8)
x = x + (x >> 16)
x = x + (x >> 32)
return x & 0x0000007f
MOD = int(1e09) + 7
INF = int(1e15)
def solve():
N = Scanner.int()
A = Scanner.map_int()
L = defaultdict(int)
for i in range(N):
L[(i + 1 + A[i])] += 1
R = defaultdict(int)
for i in range(N):
R[i + 1 - A[i]] += 1
ans = 0
for k, v in list(L.items()):
ans += v * R[k]
print(ans)
def main():
# sys.stdin = open("sample.txt")
solve()
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
import decimal
class Scanner():
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [Scanner.string() for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [Scanner.int() for i in range(n)]
class Math():
@staticmethod
def gcd(a, b):
if b == 0:
return a
return Math.gcd(b, a % b)
@staticmethod
def lcm(a, b):
return (a * b) // Math.gcd(a, b)
@staticmethod
def divisor(n):
res = []
i = 1
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
res.append(i)
if i != n // i:
res.append(n // i)
return res
@staticmethod
def round_up(a, b):
return -(-a // b)
@staticmethod
def is_prime(n):
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
d = int(n ** 0.5) + 1
for i in range(3, d + 1, 2):
if n % i == 0:
return False
return True
@staticmethod
def fact(N):
res = {}
tmp = N
for i in range(2, int(N ** 0.5 + 1) + 1):
cnt = 0
while tmp % i == 0:
cnt += 1
tmp //= i
if cnt > 0:
res[i] = cnt
if tmp != 1:
res[tmp] = 1
if res == {}:
res[N] = 1
return res
def pop_count(x):
x = x - ((x >> 1) & 0x5555555555555555)
x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f
x = x + (x >> 8)
x = x + (x >> 16)
x = x + (x >> 32)
return x & 0x0000007f
MOD = int(1e09) + 7
INF = int(1e15)
def solve():
N = Scanner.int()
A = Scanner.map_int()
memo = defaultdict(int)
ans = 0
for i in range(N):
memo[A[i] + i + 1] += 1
for i in range(N):
ans += memo[-A[i] + (i + 1)]
print(ans)
def main():
# sys.stdin = open("sample.txt")
# T = Scanner.int()
# for _ in range(T):
# solve()
# print('YNeos'[not solve()::2])
solve()
if __name__ == "__main__":
main()
| 120 | 139 | 2,525 | 2,963 | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
from decimal import *
class Scanner:
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [Scanner.string() for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [Scanner.int() for i in range(n)]
class Math:
@staticmethod
def gcd(a, b):
if b == 0:
return a
return Math.gcd(b, a % b)
@staticmethod
def lcm(a, b):
return (a * b) // Math.gcd(a, b)
@staticmethod
def divisor(n):
res = []
i = 1
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
res.append(i)
if i != n // i:
res.append(n // i)
return res
@staticmethod
def round_up(a, b):
return -(-a // b)
@staticmethod
def is_prime(n):
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
d = int(n**0.5) + 1
for i in range(3, d + 1, 2):
if n % i == 0:
return False
return True
def pop_count(x):
x = x - ((x >> 1) & 0x5555555555555555)
x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
x = (x + (x >> 4)) & 0x0F0F0F0F0F0F0F0F
x = x + (x >> 8)
x = x + (x >> 16)
x = x + (x >> 32)
return x & 0x0000007F
MOD = int(1e09) + 7
INF = int(1e15)
def solve():
N = Scanner.int()
A = Scanner.map_int()
L = defaultdict(int)
for i in range(N):
L[(i + 1 + A[i])] += 1
R = defaultdict(int)
for i in range(N):
R[i + 1 - A[i]] += 1
ans = 0
for k, v in list(L.items()):
ans += v * R[k]
print(ans)
def main():
# sys.stdin = open("sample.txt")
solve()
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
import decimal
class Scanner:
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [Scanner.string() for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [Scanner.int() for i in range(n)]
class Math:
@staticmethod
def gcd(a, b):
if b == 0:
return a
return Math.gcd(b, a % b)
@staticmethod
def lcm(a, b):
return (a * b) // Math.gcd(a, b)
@staticmethod
def divisor(n):
res = []
i = 1
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
res.append(i)
if i != n // i:
res.append(n // i)
return res
@staticmethod
def round_up(a, b):
return -(-a // b)
@staticmethod
def is_prime(n):
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
d = int(n**0.5) + 1
for i in range(3, d + 1, 2):
if n % i == 0:
return False
return True
@staticmethod
def fact(N):
res = {}
tmp = N
for i in range(2, int(N**0.5 + 1) + 1):
cnt = 0
while tmp % i == 0:
cnt += 1
tmp //= i
if cnt > 0:
res[i] = cnt
if tmp != 1:
res[tmp] = 1
if res == {}:
res[N] = 1
return res
def pop_count(x):
x = x - ((x >> 1) & 0x5555555555555555)
x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
x = (x + (x >> 4)) & 0x0F0F0F0F0F0F0F0F
x = x + (x >> 8)
x = x + (x >> 16)
x = x + (x >> 32)
return x & 0x0000007F
MOD = int(1e09) + 7
INF = int(1e15)
def solve():
N = Scanner.int()
A = Scanner.map_int()
memo = defaultdict(int)
ans = 0
for i in range(N):
memo[A[i] + i + 1] += 1
for i in range(N):
ans += memo[-A[i] + (i + 1)]
print(ans)
def main():
# sys.stdin = open("sample.txt")
# T = Scanner.int()
# for _ in range(T):
# solve()
# print('YNeos'[not solve()::2])
solve()
if __name__ == "__main__":
main()
| false | 13.669065 | [
"-from decimal import *",
"+import decimal",
"+ @staticmethod",
"+ def fact(N):",
"+ res = {}",
"+ tmp = N",
"+ for i in range(2, int(N**0.5 + 1) + 1):",
"+ cnt = 0",
"+ while tmp % i == 0:",
"+ cnt += 1",
"+ tmp //= ... | false | 0.047839 | 0.041101 | 1.163922 | [
"s384476461",
"s622148786"
] |
u697559326 | p03163 | python | s429324875 | s763914203 | 1,466 | 441 | 7,668 | 118,512 | Accepted | Accepted | 69.92 | """memo
numpyでやるときは配列を一気に更新するが(numpy使いたくないのでやらない)，
このやり方は後ろの方から更新することで後の更新に影響を与えない(考え方すごい)．
(参考#9889377)
"""
import sys
input = sys.stdin.readline
def main():
#1:初期化
N,W = list(map(int,input().split()))
dp = [0]*(W+1)
#2:初期値(元からゼロなので記述無し)
#3:dp実行部(貰うDP)
for i in range(N):
w, v = list(map(int,input().split()))
for i in range(W, w-1, -1):
tmp = dp[i-w] + v
if dp[i] < tmp:
dp[i] = tmp
#print(dp,sep="\n")
#4:出力
print((max(dp)))
if __name__ == '__main__':
main() |
import sys
input = sys.stdin.readline
def main():
#1:初期化
N,W = list(map(int,input().split()))
wv = []
for _ in range(N):
wv.append(list(map(int,input().split())))
dp = [[0]*(W+1) for i in range(N+1)]
#print(dp)
#print(dp2)
#2:初期値(元からゼロなので記述無し)
#3:dp実行部(貰うDP)
for i in range(1,N+1):
for j in range(1,W+1):
if wv[i-1][0] <= j: #dpの横が重さだが，jが重さ以下ならそもそも入れられない．
dp[i][j] = max(dp[i-1][j], dp[i-1][j-wv[i-1][0]]+wv[i-1][1])
else:
dp[i][j] = dp[i-1][j]
#print(i,j)
#print(*dp,sep="\n")
#4:出力
print((dp[N][W]))
if __name__ == '__main__':
main() | 30 | 32 | 594 | 713 | """memo
numpyでやるときは配列を一気に更新するが(numpy使いたくないのでやらない)，
このやり方は後ろの方から更新することで後の更新に影響を与えない(考え方すごい)．
(参考#9889377)
"""
import sys
input = sys.stdin.readline
def main():
# 1:初期化
N, W = list(map(int, input().split()))
dp = [0] * (W + 1)
# 2:初期値(元からゼロなので記述無し)
# 3:dp実行部(貰うDP)
for i in range(N):
w, v = list(map(int, input().split()))
for i in range(W, w - 1, -1):
tmp = dp[i - w] + v
if dp[i] < tmp:
dp[i] = tmp
# print(dp,sep="\n")
# 4:出力
print((max(dp)))
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def main():
# 1:初期化
N, W = list(map(int, input().split()))
wv = []
for _ in range(N):
wv.append(list(map(int, input().split())))
dp = [[0] * (W + 1) for i in range(N + 1)]
# print(dp)
# print(dp2)
# 2:初期値(元からゼロなので記述無し)
# 3:dp実行部(貰うDP)
for i in range(1, N + 1):
for j in range(1, W + 1):
if wv[i - 1][0] <= j: # dpの横が重さだが，jが重さ以下ならそもそも入れられない．
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - wv[i - 1][0]] + wv[i - 1][1])
else:
dp[i][j] = dp[i - 1][j]
# print(i,j)
# print(*dp,sep="\n")
# 4:出力
print((dp[N][W]))
if __name__ == "__main__":
main()
| false | 6.25 | [
"-\"\"\"memo",
"- numpyでやるときは配列を一気に更新するが(numpy使いたくないのでやらない)，",
"- このやり方は後ろの方から更新することで後の更新に影響を与えない(考え方すごい)．",
"- (参考#9889377)",
"-\"\"\"",
"- dp = [0] * (W + 1)",
"+ wv = []",
"+ for _ in range(N):",
"+ wv.append(list(map(int, input().split())))",
"+ dp = [[0] * (W + 1) ... | false | 0.042726 | 0.039569 | 1.0798 | [
"s429324875",
"s763914203"
] |
u936985471 | p02788 | python | s747977301 | s102496790 | 1,259 | 906 | 66,456 | 66,456 | Accepted | Accepted | 28.04 | N,D,A=list(map(int,input().split()))
D*=2 # 爆発の長さ
X=[None]*N
for i in range(N):
X[i]=list(map(int,input().split()))
X=sorted(X,key=lambda x:x[0])
# lastX=X[-1][0] # 最後のモンスターの場所
damage=0 # 現在の爆発が与えられるダメージ
from collections import deque
bombs=deque() # 爆弾が切れるタイミング
# [位置、効力]
ans=0
for i in range(len(X)):
x=X[i][0]
h=X[i][1] # モンスターの体力
# 爆発が途切れていないかを確認
while bombs:
b=bombs.popleft()
if b[0]<x:
damage-=b[1]
else:
bombs.appendleft(b)
break
h-=damage
if h>0:
turn=((h+A-1)//A)
damage+=turn*A
ans+=turn
bombs.append([x+D,turn*A])
print(ans) | import sys
readline=sys.stdin.readline
N,D,A=list(map(int,readline().split()))
D*=2 # 爆発の長さ
X=[None]*N
for i in range(N):
X[i]=list(map(int,readline().split()))
X=sorted(X,key=lambda x:x[0])
# lastX=X[-1][0] # 最後のモンスターの場所
damage=0 # 現在の爆発が与えられるダメージ
from collections import deque
bombs=deque() # 爆弾が切れるタイミング
# [位置、効力]
ans=0
for i in range(len(X)):
x=X[i][0]
h=X[i][1] # モンスターの体力
# 爆発が途切れていないかを確認
while bombs:
b=bombs.popleft()
if b[0]<x:
damage-=b[1]
else:
bombs.appendleft(b)
break
h-=damage
if h>0:
turn=((h+A-1)//A)
damage+=turn*A
ans+=turn
bombs.append([x+D,turn*A])
print(ans)
| 31 | 34 | 620 | 670 | N, D, A = list(map(int, input().split()))
D *= 2 # 爆発の長さ
X = [None] * N
for i in range(N):
X[i] = list(map(int, input().split()))
X = sorted(X, key=lambda x: x[0])
# lastX=X[-1][0] # 最後のモンスターの場所
damage = 0 # 現在の爆発が与えられるダメージ
from collections import deque
bombs = deque() # 爆弾が切れるタイミング
# [位置、効力]
ans = 0
for i in range(len(X)):
x = X[i][0]
h = X[i][1] # モンスターの体力
# 爆発が途切れていないかを確認
while bombs:
b = bombs.popleft()
if b[0] < x:
damage -= b[1]
else:
bombs.appendleft(b)
break
h -= damage
if h > 0:
turn = (h + A - 1) // A
damage += turn * A
ans += turn
bombs.append([x + D, turn * A])
print(ans)
| import sys
readline = sys.stdin.readline
N, D, A = list(map(int, readline().split()))
D *= 2 # 爆発の長さ
X = [None] * N
for i in range(N):
X[i] = list(map(int, readline().split()))
X = sorted(X, key=lambda x: x[0])
# lastX=X[-1][0] # 最後のモンスターの場所
damage = 0 # 現在の爆発が与えられるダメージ
from collections import deque
bombs = deque() # 爆弾が切れるタイミング
# [位置、効力]
ans = 0
for i in range(len(X)):
x = X[i][0]
h = X[i][1] # モンスターの体力
# 爆発が途切れていないかを確認
while bombs:
b = bombs.popleft()
if b[0] < x:
damage -= b[1]
else:
bombs.appendleft(b)
break
h -= damage
if h > 0:
turn = (h + A - 1) // A
damage += turn * A
ans += turn
bombs.append([x + D, turn * A])
print(ans)
| false | 8.823529 | [
"-N, D, A = list(map(int, input().split()))",
"+import sys",
"+",
"+readline = sys.stdin.readline",
"+N, D, A = list(map(int, readline().split()))",
"- X[i] = list(map(int, input().split()))",
"+ X[i] = list(map(int, readline().split()))"
] | false | 0.043287 | 0.128452 | 0.336988 | [
"s747977301",
"s102496790"
] |
u197968862 | p03162 | python | s777479137 | s878771429 | 691 | 284 | 74,840 | 100,476 | Accepted | Accepted | 58.9 | n = int(eval(input()))
abc = [list(map(int,input().split())) for _ in range(n)]
dp = [[0 for _ in range(3)] for _ in range(n+1)]
for i in range(1,n+1):
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i][k] = max(dp[i][k],dp[i-1][j] + abc[i-1][k])
ans = max(dp[-1])
print(ans) | n = int(eval(input()))
abc = [list(map(int, input().split())) for _ in range(n)]
dp = [[0]*3 for _ in range(n+1)]
for i in range(n):
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i+1][j] = max(abc[i][j]+dp[i][k], dp[i+1][j])
dp[i+1][k] = max(abc[i][k]+dp[i][j], dp[i+1][k])
print((max(dp[-1]))) | 14 | 14 | 350 | 381 | n = int(eval(input()))
abc = [list(map(int, input().split())) for _ in range(n)]
dp = [[0 for _ in range(3)] for _ in range(n + 1)]
for i in range(1, n + 1):
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i][k] = max(dp[i][k], dp[i - 1][j] + abc[i - 1][k])
ans = max(dp[-1])
print(ans)
| n = int(eval(input()))
abc = [list(map(int, input().split())) for _ in range(n)]
dp = [[0] * 3 for _ in range(n + 1)]
for i in range(n):
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i + 1][j] = max(abc[i][j] + dp[i][k], dp[i + 1][j])
dp[i + 1][k] = max(abc[i][k] + dp[i][j], dp[i + 1][k])
print((max(dp[-1])))
| false | 0 | [
"-dp = [[0 for _ in range(3)] for _ in range(n + 1)]",
"-for i in range(1, n + 1):",
"+dp = [[0] * 3 for _ in range(n + 1)]",
"+for i in range(n):",
"- dp[i][k] = max(dp[i][k], dp[i - 1][j] + abc[i - 1][k])",
"-ans = max(dp[-1])",
"-print(ans)",
"+ dp[i + 1][j] = max(abc[i][j] + ... | false | 0.036309 | 0.056811 | 0.639113 | [
"s777479137",
"s878771429"
] |
u867848444 | p03160 | python | s667337726 | s807465011 | 167 | 141 | 13,980 | 13,928 | Accepted | Accepted | 15.57 | n=int(eval(input()))
h=list(map(int,input().split()))
dp=[float('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]))
#i=1の時i-2<0となるので先にここを計算する
if i>=2:
dp[i]=min(dp[i],dp[i-2]+abs(h[i]-h[i-2]))
print((dp[-1])) | #DP-A
n=int(eval(input()))
h=list(map(int,input().split()))
dp=[float('inf')]*n
dp[0]=0
for i in range(1,n):
#2パターンの遷移を考え小さいほうを保存する
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])) | 13 | 14 | 280 | 256 | n = int(eval(input()))
h = list(map(int, input().split()))
dp = [float("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]))
# i=1の時i-2<0となるので先にここを計算する
if i >= 2:
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[-1]))
| # DP-A
n = int(eval(input()))
h = list(map(int, input().split()))
dp = [float("inf")] * n
dp[0] = 0
for i in range(1, n):
# 2パターンの遷移を考え小さいほうを保存する
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]))
| false | 7.142857 | [
"+# DP-A",
"-dp[0] = 0 # 初期条件を設定",
"+dp[0] = 0",
"- dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]))",
"- # i=1の時i-2<0となるので先にここを計算する",
"- if i >= 2:",
"+ # 2パターンの遷移を考え小さいほうを保存する",
"+ dp[i] = dp[i - 1] + abs(h[i] - h[i - 1])",
"+ if i > 1:"
] | false | 0.037168 | 0.162509 | 0.228711 | [
"s667337726",
"s807465011"
] |
u620480037 | p03031 | python | s223695502 | s038352525 | 219 | 92 | 43,888 | 74,292 | Accepted | Accepted | 57.99 | N,M=list(map(int,input().split()))
S=[0 for i in range(N)]
A=[]
for x in range(M):
s=list(map(int,input().split()))
X=[]
for y in range(1,s[0]+1):
X.append(s[y])
A.append(X)
P=list(map(int,input().split()))
#print(A)
ANS=0
for i in range(2**N):
n=i
for j in range(N):
if n//(2**(N-1-j))==1:
S[j]=1
else:
S[j]=0
n%=(2**(N-1-j))
#print(S,i)
cnt=0
for a in range(M):
Y=0
for b in range(len(A[a])):
Y+=S[A[a][b]-1]
if Y%2==P[a]:
cnt+=1
#print(cnt)
if cnt==M:
ANS+=1
print(ANS)
| N,M=list(map(int,input().split()))
L=[]
for i in range(M):
m=list(map(int,input().split()))
L.append(m[1:])
#print(L)
S=list(map(int,input().split()))
ans=0
for i in range(2**N):
sw=[0 for i in range(M)]
I=i+0
for j in range(N):
if I&1==True:
for k in range(M):
if j+1 in L[k]:
sw[k]+=1
I=I>>1
#print(sw)
cnt=0
for j in range(M):
if sw[j]%2==S[j]:
cnt+=1
if cnt==M:
ans+=1
print(ans) | 37 | 30 | 679 | 539 | N, M = list(map(int, input().split()))
S = [0 for i in range(N)]
A = []
for x in range(M):
s = list(map(int, input().split()))
X = []
for y in range(1, s[0] + 1):
X.append(s[y])
A.append(X)
P = list(map(int, input().split()))
# print(A)
ANS = 0
for i in range(2**N):
n = i
for j in range(N):
if n // (2 ** (N - 1 - j)) == 1:
S[j] = 1
else:
S[j] = 0
n %= 2 ** (N - 1 - j)
# print(S,i)
cnt = 0
for a in range(M):
Y = 0
for b in range(len(A[a])):
Y += S[A[a][b] - 1]
if Y % 2 == P[a]:
cnt += 1
# print(cnt)
if cnt == M:
ANS += 1
print(ANS)
| N, M = list(map(int, input().split()))
L = []
for i in range(M):
m = list(map(int, input().split()))
L.append(m[1:])
# print(L)
S = list(map(int, input().split()))
ans = 0
for i in range(2**N):
sw = [0 for i in range(M)]
I = i + 0
for j in range(N):
if I & 1 == True:
for k in range(M):
if j + 1 in L[k]:
sw[k] += 1
I = I >> 1
# print(sw)
cnt = 0
for j in range(M):
if sw[j] % 2 == S[j]:
cnt += 1
if cnt == M:
ans += 1
print(ans)
| false | 18.918919 | [
"-S = [0 for i in range(N)]",
"-A = []",
"-for x in range(M):",
"- s = list(map(int, input().split()))",
"- X = []",
"- for y in range(1, s[0] + 1):",
"- X.append(s[y])",
"- A.append(X)",
"-P = list(map(int, input().split()))",
"-# print(A)",
"-ANS = 0",
"+L = []",
"+for i... | false | 0.05371 | 0.083803 | 0.640905 | [
"s223695502",
"s038352525"
] |
u047655753 | p02862 | python | s544875176 | s096454393 | 548 | 269 | 55,832 | 29,464 | Accepted | Accepted | 50.91 | mod = int(1e9 + 7)
def powmod(a, b):
ans = 1
while(b):
if(b&1): ans = ans*a%mod
a = a*a%mod
b >>= 1
return ans
x, y = list(map(int,input().split()))
if(2*x < y or 2*y < x or (2*x-y)%3 or (2*y-x)%3): print((0))
else:
x, y = (2*x-y)//3, (2*y-x)//3
#print(x,y)
fac = [0 for i in range(x+y+1)]
inv = [0 for i in range(x+y+1)]
fac[0] = 1
for i in range(1,x+y+1):
fac[i] = fac[i-1]*i%mod
inv[x+y] = powmod(fac[x+y],mod-2)
for i in range(x+y-1,-1,-1):
inv[i] = inv[i+1]*(i+1)%mod
ans = fac[x+y]*inv[x]*inv[y]%mod
print(ans) | mod = int(1e9 + 7)
x, y = list(map(int,input().split()))
if(2*x < y or 2*y < x or (2*x-y)%3 or (2*y-x)%3): print((0))
else:
x, y = (2*x-y)//3, (2*y-x)//3
#print(x,y)
fac = [0 for i in range(x+y+1)]
fac[0] = 1
for i in range(1,x+y+1):
fac[i] = fac[i-1]*i%mod
ans = fac[x+y]*pow(fac[x],mod-2,mod)*pow(fac[y],mod-2,mod)%mod
print(ans) | 23 | 12 | 622 | 370 | mod = int(1e9 + 7)
def powmod(a, b):
ans = 1
while b:
if b & 1:
ans = ans * a % mod
a = a * a % mod
b >>= 1
return ans
x, y = list(map(int, input().split()))
if 2 * x < y or 2 * y < x or (2 * x - y) % 3 or (2 * y - x) % 3:
print((0))
else:
x, y = (2 * x - y) // 3, (2 * y - x) // 3
# print(x,y)
fac = [0 for i in range(x + y + 1)]
inv = [0 for i in range(x + y + 1)]
fac[0] = 1
for i in range(1, x + y + 1):
fac[i] = fac[i - 1] * i % mod
inv[x + y] = powmod(fac[x + y], mod - 2)
for i in range(x + y - 1, -1, -1):
inv[i] = inv[i + 1] * (i + 1) % mod
ans = fac[x + y] * inv[x] * inv[y] % mod
print(ans)
| mod = int(1e9 + 7)
x, y = list(map(int, input().split()))
if 2 * x < y or 2 * y < x or (2 * x - y) % 3 or (2 * y - x) % 3:
print((0))
else:
x, y = (2 * x - y) // 3, (2 * y - x) // 3
# print(x,y)
fac = [0 for i in range(x + y + 1)]
fac[0] = 1
for i in range(1, x + y + 1):
fac[i] = fac[i - 1] * i % mod
ans = fac[x + y] * pow(fac[x], mod - 2, mod) * pow(fac[y], mod - 2, mod) % mod
print(ans)
| false | 47.826087 | [
"-",
"-",
"-def powmod(a, b):",
"- ans = 1",
"- while b:",
"- if b & 1:",
"- ans = ans * a % mod",
"- a = a * a % mod",
"- b >>= 1",
"- return ans",
"-",
"-",
"- inv = [0 for i in range(x + y + 1)]",
"- inv[x + y] = powmod(fac[x + y], mod - 2)... | false | 0.538853 | 0.338453 | 1.592105 | [
"s544875176",
"s096454393"
] |
u703950586 | p02863 | python | s577074221 | s398247914 | 601 | 510 | 123,992 | 113,624 | Accepted | Accepted | 15.14 | N,T = list(map(int,input().split()))
A = [[0,0] for _ in range(N+1)]
for i in range(1,N+1):
a,b = list(map(int,input().split()))
A[i][0] = a
A[i][1] = b
A.sort()
dp = [[0 for _ in range(T+1)] for _ in range(N+1)]
for i in range(1,N+1):
for j in range(T,0,-1):
if j < T:
if j < A[i][0]:
dp[i][j] = dp[i-1][j]
else:
dp[i][j] = max(dp[i-1][j],dp[i-1][j-A[i][0]]+A[i][1])
else:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - 1] + A[i][1])
print((dp[N][T]))
| import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N,T = LI()
A = [LI() for _ in range(N)]
A.sort()
dp = [[0] * (T+1) for _ in range(N+1)]
for i in range(1,N+1):
for j in range(1,T+1):
a,b = A[i-1]
if j == T:
dp[i][j] = max(dp[i-1][j],dp[i-1][j-1]+b)
continue
if j < a:
dp[i][j] = dp[i-1][j]
else:
dp[i][j] = max(dp[i-1][j],dp[i-1][j-a]+b)
print((dp[-1][T]))
if __name__ == '__main__':
main() | 20 | 29 | 557 | 773 | N, T = list(map(int, input().split()))
A = [[0, 0] for _ in range(N + 1)]
for i in range(1, N + 1):
a, b = list(map(int, input().split()))
A[i][0] = a
A[i][1] = b
A.sort()
dp = [[0 for _ in range(T + 1)] for _ in range(N + 1)]
for i in range(1, N + 1):
for j in range(T, 0, -1):
if j < T:
if j < A[i][0]:
dp[i][j] = dp[i - 1][j]
else:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - A[i][0]] + A[i][1])
else:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - 1] + A[i][1])
print((dp[N][T]))
| import sys, queue, math, copy, itertools, bisect, collections, heapq
def main():
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda: [int(x) for x in sys.stdin.readline().split()]
NI = lambda: int(sys.stdin.readline())
N, T = LI()
A = [LI() for _ in range(N)]
A.sort()
dp = [[0] * (T + 1) for _ in range(N + 1)]
for i in range(1, N + 1):
for j in range(1, T + 1):
a, b = A[i - 1]
if j == T:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - 1] + b)
continue
if j < a:
dp[i][j] = dp[i - 1][j]
else:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - a] + b)
print((dp[-1][T]))
if __name__ == "__main__":
main()
| false | 31.034483 | [
"-N, T = list(map(int, input().split()))",
"-A = [[0, 0] for _ in range(N + 1)]",
"-for i in range(1, N + 1):",
"- a, b = list(map(int, input().split()))",
"- A[i][0] = a",
"- A[i][1] = b",
"-A.sort()",
"-dp = [[0 for _ in range(T + 1)] for _ in range(N + 1)]",
"-for i in range(1, N + 1):",... | false | 0.036749 | 0.056066 | 0.655461 | [
"s577074221",
"s398247914"
] |
u445404615 | p02819 | python | s999005666 | s203531566 | 286 | 30 | 2,940 | 2,940 | Accepted | Accepted | 89.51 | x = int(eval(input()))
for i in range(x,10**5+100):
flg = 'so'
for j in range(2,x):
if i % j == 0:
flg = 'no'
if flg == 'so':
print(i)
exit() | x = int(eval(input()))
for i in range(x,10**5+100):
flg = 'so'
for j in range(2,x):
if i % j == 0:
flg = 'no'
break
if flg == 'so':
print(i)
exit() | 12 | 13 | 208 | 227 | x = int(eval(input()))
for i in range(x, 10**5 + 100):
flg = "so"
for j in range(2, x):
if i % j == 0:
flg = "no"
if flg == "so":
print(i)
exit()
| x = int(eval(input()))
for i in range(x, 10**5 + 100):
flg = "so"
for j in range(2, x):
if i % j == 0:
flg = "no"
break
if flg == "so":
print(i)
exit()
| false | 7.692308 | [
"+ break"
] | false | 0.071294 | 0.038302 | 1.861362 | [
"s999005666",
"s203531566"
] |
u017810624 | p03722 | python | s095103529 | s593434886 | 348 | 319 | 46,168 | 42,972 | Accepted | Accepted | 8.33 | n,m=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(m)]
distance=[float('inf')]*n
distance[0]=0
for i in range(n-1):
for j in range(m):
if distance[l[j][1]-1]>distance[l[j][0]-1]-l[j][2]:
distance[l[j][1]-1]=distance[l[j][0]-1]-l[j][2]
x=distance[n-1]
for i in range(n):
for j in range(m):
if distance[l[j][1]-1]>distance[l[j][0]-1]-l[j][2]:
distance[l[j][1]-1]=-float('inf')
if distance[n-1]==x:
print((-distance[n-1]))
else:
print('inf') | (n,m),*l=[list(map(int,s.split()))for s in open(0)];d=[0]*2+[9e99]*n
for i in range(n*2):
for a,b,c in l:
if d[b]>d[a]-c:d[b]=[d[a]-c,-9e99][i>n]
if i==n:x=d[n]
print(([-x,'inf'][d[n]!=x])) | 17 | 6 | 507 | 196 | n, m = list(map(int, input().split()))
l = [list(map(int, input().split())) for i in range(m)]
distance = [float("inf")] * n
distance[0] = 0
for i in range(n - 1):
for j in range(m):
if distance[l[j][1] - 1] > distance[l[j][0] - 1] - l[j][2]:
distance[l[j][1] - 1] = distance[l[j][0] - 1] - l[j][2]
x = distance[n - 1]
for i in range(n):
for j in range(m):
if distance[l[j][1] - 1] > distance[l[j][0] - 1] - l[j][2]:
distance[l[j][1] - 1] = -float("inf")
if distance[n - 1] == x:
print((-distance[n - 1]))
else:
print("inf")
| (n, m), *l = [list(map(int, s.split())) for s in open(0)]
d = [0] * 2 + [9e99] * n
for i in range(n * 2):
for a, b, c in l:
if d[b] > d[a] - c:
d[b] = [d[a] - c, -9e99][i > n]
if i == n:
x = d[n]
print(([-x, "inf"][d[n] != x]))
| false | 64.705882 | [
"-n, m = list(map(int, input().split()))",
"-l = [list(map(int, input().split())) for i in range(m)]",
"-distance = [float(\"inf\")] * n",
"-distance[0] = 0",
"-for i in range(n - 1):",
"- for j in range(m):",
"- if distance[l[j][1] - 1] > distance[l[j][0] - 1] - l[j][2]:",
"- dis... | false | 0.124587 | 0.069538 | 1.791649 | [
"s095103529",
"s593434886"
] |
u141574039 | p03161 | python | s396929321 | s401475213 | 416 | 363 | 52,448 | 52,448 | Accepted | Accepted | 12.74 | N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
DP=[0]*(N)
DP[0]=0
DP[1]=abs(H[1]-H[0])
for i in range(2,N):
DP[i]=min([abs(H[i]-H[k])+DP[k] for k in range(max(i-K,0),i)])
print((DP[N-1])) | N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
cost =10**10
DP=[0]*(N+10)
DP[0]=0
DP[1]=abs(H[1]-H[0])
for i in range(2,N):
cost=10**10
for k in range(max(i-K,0),i):
cost=min(cost,(abs(H[i]-H[k])+DP[k]))
DP[i]=cost
print((DP[N-1])) | 8 | 12 | 209 | 265 | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
DP = [0] * (N)
DP[0] = 0
DP[1] = abs(H[1] - H[0])
for i in range(2, N):
DP[i] = min([abs(H[i] - H[k]) + DP[k] for k in range(max(i - K, 0), i)])
print((DP[N - 1]))
| N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
cost = 10**10
DP = [0] * (N + 10)
DP[0] = 0
DP[1] = abs(H[1] - H[0])
for i in range(2, N):
cost = 10**10
for k in range(max(i - K, 0), i):
cost = min(cost, (abs(H[i] - H[k]) + DP[k]))
DP[i] = cost
print((DP[N - 1]))
| false | 33.333333 | [
"-DP = [0] * (N)",
"+cost = 10**10",
"+DP = [0] * (N + 10)",
"- DP[i] = min([abs(H[i] - H[k]) + DP[k] for k in range(max(i - K, 0), i)])",
"+ cost = 10**10",
"+ for k in range(max(i - K, 0), i):",
"+ cost = min(cost, (abs(H[i] - H[k]) + DP[k]))",
"+ DP[i] = cost"
] | false | 0.007991 | 0.035893 | 0.222624 | [
"s396929321",
"s401475213"
] |
u477977638 | p02730 | python | s926411182 | s726703280 | 183 | 27 | 38,384 | 8,984 | Accepted | Accepted | 85.25 | import sys
input = sys.stdin.readline
#input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
def RD(): return sys.stdin.read()
def II(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')
#import numpy as np
from collections import deque
def main():
s=input().rstrip()
ans="Yes"
n=len(s)
for i in range(n):
if s[i]!=s[-i-1]:
ans="No"
for i in range(n//2):
if s[i]!=s[n//2-i-1]:
ans="No"
print(ans)
if __name__ == "__main__":
main() | import sys
#input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,input().split()))
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode()
#import numpy as np
def main():
s=eval(input())
n=len(s)
ans="Yes"
if s!=s[::-1] or s[:(n-1)//2]!=s[:(n-1)//2][::-1] or s[(n+3)//2-1:]!=s[(n+3)//2-1:][::-1]:
ans="No"
print(ans)
if __name__ == "__main__":
main()
| 34 | 30 | 635 | 677 | import sys
input = sys.stdin.readline
# input = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**9)
def RD():
return sys.stdin.read()
def II():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
def TI():
return tuple(map(int, input().split()))
# rstrip().decode('utf-8')
# import numpy as np
from collections import deque
def main():
s = input().rstrip()
ans = "Yes"
n = len(s)
for i in range(n):
if s[i] != s[-i - 1]:
ans = "No"
for i in range(n // 2):
if s[i] != s[n // 2 - i - 1]:
ans = "No"
print(ans)
if __name__ == "__main__":
main()
| import sys
# input = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**9)
# from functools import lru_cache
def RD():
return sys.stdin.read()
def II():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def MF():
return list(map(float, input().split()))
def LI():
return list(map(int, input().split()))
def LF():
return list(map(float, input().split()))
def TI():
return tuple(map(int, input().split()))
# rstrip().decode()
# import numpy as np
def main():
s = eval(input())
n = len(s)
ans = "Yes"
if (
s != s[::-1]
or s[: (n - 1) // 2] != s[: (n - 1) // 2][::-1]
or s[(n + 3) // 2 - 1 :] != s[(n + 3) // 2 - 1 :][::-1]
):
ans = "No"
print(ans)
if __name__ == "__main__":
main()
| false | 11.764706 | [
"-input = sys.stdin.readline",
"+# from functools import lru_cache",
"+def MF():",
"+ return list(map(float, input().split()))",
"+",
"+",
"+",
"+",
"+def LF():",
"+ return list(map(float, input().split()))",
"-# rstrip().decode('utf-8')",
"+# rstrip().decode()",
"-from collections imp... | false | 0.073465 | 0.037862 | 1.940342 | [
"s926411182",
"s726703280"
] |
u464205401 | p02678 | python | s998249442 | s977596566 | 751 | 678 | 34,740 | 34,904 | Accepted | Accepted | 9.72 | from collections import deque
n,m=list(map(int,input().split()))
graph=[[] for _ in range(n)]
for _ in range(m):
a,b=list(map(int,input().split()))
graph[a-1].append(b-1)
graph[b-1].append(a-1)
#print(graph)
dist=[-1]*n
dist[0]=0
queue=deque([0])
while queue:
v=queue.popleft()
for nv in graph[v]:
if (dist[nv]!=-1):
continue
dist[nv]=v
queue.append(nv)
print("Yes")
for i in dist[1:]:
print((i+1))
| from collections import deque
n, m = map(int, input().split())
graph = [[] for _ in range(n+1)]
for i in range(m):
a, b = map(int, input().split())
graph[a].append(b)
graph[b].append(a)
#print(graph)
dist = [-1] * (n+1)
dist[0] = 0
dist[1] = 0
d = deque()
d.append(1)
while d: #dの中が空になるまで続ける
v = d.popleft()#一番最初に入れたものから探索する。
for i in graph[v]:#vから行けるところを探索。例v=1,i=2, v=2,i=1,3,4
if dist[i] != -1: #iが未訪問でなければ（=訪問済みであれば）
continue#何もしない
dist[i]=v#一個前の探索地点を入れる（一個前がほしいとき）
# dist[i] = dist[v] + 1#iのdistにv＋1したものを追加（原点からの距離がほしいとき）
d.append(i)#訪問リストにiを追加
#print(graph)
#print(dist)
print('Yes')
[print(dist[i]) for i in range(2,n+1)]
| 29 | 31 | 464 | 697 | from collections import deque
n, m = list(map(int, input().split()))
graph = [[] for _ in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
graph[a - 1].append(b - 1)
graph[b - 1].append(a - 1)
# print(graph)
dist = [-1] * n
dist[0] = 0
queue = deque([0])
while queue:
v = queue.popleft()
for nv in graph[v]:
if dist[nv] != -1:
continue
dist[nv] = v
queue.append(nv)
print("Yes")
for i in dist[1:]:
print((i + 1))
| from collections import deque
n, m = map(int, input().split())
graph = [[] for _ in range(n + 1)]
for i in range(m):
a, b = map(int, input().split())
graph[a].append(b)
graph[b].append(a)
# print(graph)
dist = [-1] * (n + 1)
dist[0] = 0
dist[1] = 0
d = deque()
d.append(1)
while d: # dの中が空になるまで続ける
v = d.popleft() # 一番最初に入れたものから探索する。
for i in graph[v]: # vから行けるところを探索。例v=1,i=2, v=2,i=1,3,4
if dist[i] != -1: # iが未訪問でなければ（=訪問済みであれば）
continue # 何もしない
dist[i] = v # 一個前の探索地点を入れる（一個前がほしいとき）
# dist[i] = dist[v] + 1#iのdistにv＋1したものを追加（原点からの距離がほしいとき）
d.append(i) # 訪問リストにiを追加
# print(graph)
# print(dist)
print("Yes")
[print(dist[i]) for i in range(2, n + 1)]
| false | 6.451613 | [
"-n, m = list(map(int, input().split()))",
"-graph = [[] for _ in range(n)]",
"-for _ in range(m):",
"- a, b = list(map(int, input().split()))",
"- graph[a - 1].append(b - 1)",
"- graph[b - 1].append(a - 1)",
"+n, m = map(int, input().split())",
"+graph = [[] for _ in range(n + 1)]",
"+for ... | false | 0.036224 | 0.036677 | 0.987632 | [
"s998249442",
"s977596566"
] |
u017810624 | p02936 | python | s185865827 | s616568384 | 1,053 | 891 | 147,420 | 148,924 | Accepted | Accepted | 15.38 | import sys
input=sys.stdin.readline
n,q=list(map(int,input().split()))
l=[]
for i in range(n-1):
l.append(list(map(int,input().split())))
l2=[]
for i in range(q):
l2.append(list(map(int,input().split())))
connection=[]
for i in range(n):
connection.append([])
for i in range(n-1):
connection[l[i][0]-1].append(l[i][1]-1)
L4=[]
for i in range(n):
L4.append(0)
for i in range(q):
L4[l2[i][0]-1]+=l2[i][1]
distance=[]
for i in range(n):
distance.append(0)
distance[0]=L4[0]
L=[0]
L2=[]
L3=[]
while len(L2)!=n and len(L)!=0:
for j in range(len(L)):
for k in range(len(connection[L[j]])):
distance[connection[L[j]][k]]=distance[L[j]]+L4[connection[L[j]][k]]
L3.append(connection[L[j]][k])
L2.append(L[j])
L=L3
L3=[]
for i in range(len(distance)):
distance[i]=str(distance[i])
print((' '.join(distance))) | import sys
input=sys.stdin.readline
n,q=list(map(int,input().split()))
l=[]
for i in range(n-1):
l.append(list(map(int,input().split())))
l2=[]
for i in range(q):
l2.append(list(map(int,input().split())))
connection=[]
for i in range(n):
connection.append([])
for i in range(n-1):
connection[l[i][0]-1].append(l[i][1]-1)
L4=[0]*n
for i in range(q):
L4[l2[i][0]-1]+=l2[i][1]
distance=[0]*n
distance[0]=L4[0]
L=[0]
L2=[]
L3=[]
while len(L2)!=n and len(L)!=0:
for j in range(len(L)):
for k in range(len(connection[L[j]])):
distance[connection[L[j]][k]]=distance[L[j]]+L4[connection[L[j]][k]]
L3.append(connection[L[j]][k])
L2.append(L[j])
L=L3
L3=[]
for i in range(len(distance)):
distance[i]=str(distance[i])
print((' '.join(distance))) | 39 | 35 | 873 | 801 | import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
l = []
for i in range(n - 1):
l.append(list(map(int, input().split())))
l2 = []
for i in range(q):
l2.append(list(map(int, input().split())))
connection = []
for i in range(n):
connection.append([])
for i in range(n - 1):
connection[l[i][0] - 1].append(l[i][1] - 1)
L4 = []
for i in range(n):
L4.append(0)
for i in range(q):
L4[l2[i][0] - 1] += l2[i][1]
distance = []
for i in range(n):
distance.append(0)
distance[0] = L4[0]
L = [0]
L2 = []
L3 = []
while len(L2) != n and len(L) != 0:
for j in range(len(L)):
for k in range(len(connection[L[j]])):
distance[connection[L[j]][k]] = distance[L[j]] + L4[connection[L[j]][k]]
L3.append(connection[L[j]][k])
L2.append(L[j])
L = L3
L3 = []
for i in range(len(distance)):
distance[i] = str(distance[i])
print((" ".join(distance)))
| import sys
input = sys.stdin.readline
n, q = list(map(int, input().split()))
l = []
for i in range(n - 1):
l.append(list(map(int, input().split())))
l2 = []
for i in range(q):
l2.append(list(map(int, input().split())))
connection = []
for i in range(n):
connection.append([])
for i in range(n - 1):
connection[l[i][0] - 1].append(l[i][1] - 1)
L4 = [0] * n
for i in range(q):
L4[l2[i][0] - 1] += l2[i][1]
distance = [0] * n
distance[0] = L4[0]
L = [0]
L2 = []
L3 = []
while len(L2) != n and len(L) != 0:
for j in range(len(L)):
for k in range(len(connection[L[j]])):
distance[connection[L[j]][k]] = distance[L[j]] + L4[connection[L[j]][k]]
L3.append(connection[L[j]][k])
L2.append(L[j])
L = L3
L3 = []
for i in range(len(distance)):
distance[i] = str(distance[i])
print((" ".join(distance)))
| false | 10.25641 | [
"-L4 = []",
"-for i in range(n):",
"- L4.append(0)",
"+L4 = [0] * n",
"-distance = []",
"-for i in range(n):",
"- distance.append(0)",
"+distance = [0] * n"
] | false | 0.036448 | 0.03533 | 1.03165 | [
"s185865827",
"s616568384"
] |
u312025627 | p03476 | python | s443051690 | s178279455 | 431 | 182 | 80,396 | 80,380 | Accepted | Accepted | 57.77 | def main():
Q = int(eval(input()))
def Eratosthenes(sup: int) -> set:
primes = [True for i in range(sup+1)]
primes[0] = False
primes[1] = False
for i in range(2, sup+1):
if sup < i*i:
break
if primes[i]:
mul = 2
while i*mul <= sup:
primes[i*mul] = False
mul += 1
return {i for i in range(sup+1) if primes[i]}
primes = Eratosthenes(10**5)
S = [0]*(10**5+1)
for a in range(2, 10**5+1):
if a in primes and (a+1)//2 in primes:
S[a] = 1
S[a] += S[a-1]
for _ in range(Q):
le, ri = (int(i) for i in input().split())
print((S[ri] - S[le-1]))
if __name__ == '__main__':
main()
| def main():
import sys
input = sys.stdin.buffer.readline
Q = int(eval(input()))
def Eratosthenes(sup: int) -> set:
primes = [True for i in range(sup+1)]
primes[0] = False
primes[1] = False
for i in range(2, sup+1):
if sup < i*i:
break
if primes[i]:
mul = 2
while i*mul <= sup:
primes[i*mul] = False
mul += 1
return {i for i in range(sup+1) if primes[i]}
primes = Eratosthenes(10**5)
S = [0]*(10**5+1)
for a in range(2, 10**5+1):
if a in primes and (a+1)//2 in primes:
S[a] = 1
S[a] += S[a-1]
for _ in range(Q):
le, ri = (int(i) for i in input().split())
print((S[ri] - S[le-1]))
if __name__ == '__main__':
main()
| 30 | 32 | 817 | 872 | def main():
Q = int(eval(input()))
def Eratosthenes(sup: int) -> set:
primes = [True for i in range(sup + 1)]
primes[0] = False
primes[1] = False
for i in range(2, sup + 1):
if sup < i * i:
break
if primes[i]:
mul = 2
while i * mul <= sup:
primes[i * mul] = False
mul += 1
return {i for i in range(sup + 1) if primes[i]}
primes = Eratosthenes(10**5)
S = [0] * (10**5 + 1)
for a in range(2, 10**5 + 1):
if a in primes and (a + 1) // 2 in primes:
S[a] = 1
S[a] += S[a - 1]
for _ in range(Q):
le, ri = (int(i) for i in input().split())
print((S[ri] - S[le - 1]))
if __name__ == "__main__":
main()
| def main():
import sys
input = sys.stdin.buffer.readline
Q = int(eval(input()))
def Eratosthenes(sup: int) -> set:
primes = [True for i in range(sup + 1)]
primes[0] = False
primes[1] = False
for i in range(2, sup + 1):
if sup < i * i:
break
if primes[i]:
mul = 2
while i * mul <= sup:
primes[i * mul] = False
mul += 1
return {i for i in range(sup + 1) if primes[i]}
primes = Eratosthenes(10**5)
S = [0] * (10**5 + 1)
for a in range(2, 10**5 + 1):
if a in primes and (a + 1) // 2 in primes:
S[a] = 1
S[a] += S[a - 1]
for _ in range(Q):
le, ri = (int(i) for i in input().split())
print((S[ri] - S[le - 1]))
if __name__ == "__main__":
main()
| false | 6.25 | [
"+ import sys",
"+",
"+ input = sys.stdin.buffer.readline"
] | false | 0.008268 | 0.196327 | 0.042116 | [
"s443051690",
"s178279455"
] |
u606878291 | p03862 | python | s176962042 | s422829680 | 180 | 152 | 14,252 | 14,060 | Accepted | Accepted | 15.56 | N, X = list(map(int, input().split(' ')))
A = list(map(int, input().split(' ')))
cost = 0
diff = max(0, sum(A[0:2]) - X)
A[0] -= max(0, diff - A[1])
A[1] -= min(A[1], diff)
cost += diff
for i in range(2, N):
diff = max(0, A[i - 1] + A[i] - X)
A[i - 1] -= max(0, diff - A[i])
A[i] -= min(A[i], diff)
cost += diff
print(cost)
| N, X = list(map(int, input().split(' ')))
A = list(map(int, input().split(' ')))
cost = max(0, A[0] + A[1] - X)
A[1] = max(0, A[1] - cost)
for i in range(2, N):
cost += max(0, A[i - 1] + A[i] - X)
A[i] = max(0, A[i] - max(0, A[i - 1] + A[i] - X))
print(cost)
| 16 | 11 | 352 | 274 | N, X = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
cost = 0
diff = max(0, sum(A[0:2]) - X)
A[0] -= max(0, diff - A[1])
A[1] -= min(A[1], diff)
cost += diff
for i in range(2, N):
diff = max(0, A[i - 1] + A[i] - X)
A[i - 1] -= max(0, diff - A[i])
A[i] -= min(A[i], diff)
cost += diff
print(cost)
| N, X = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
cost = max(0, A[0] + A[1] - X)
A[1] = max(0, A[1] - cost)
for i in range(2, N):
cost += max(0, A[i - 1] + A[i] - X)
A[i] = max(0, A[i] - max(0, A[i - 1] + A[i] - X))
print(cost)
| false | 31.25 | [
"-cost = 0",
"-diff = max(0, sum(A[0:2]) - X)",
"-A[0] -= max(0, diff - A[1])",
"-A[1] -= min(A[1], diff)",
"-cost += diff",
"+cost = max(0, A[0] + A[1] - X)",
"+A[1] = max(0, A[1] - cost)",
"- diff = max(0, A[i - 1] + A[i] - X)",
"- A[i - 1] -= max(0, diff - A[i])",
"- A[i] -= min(A[i], ... | false | 0.03362 | 0.039697 | 0.84692 | [
"s176962042",
"s422829680"
] |
u022407960 | p02378 | python | s437718220 | s082031991 | 220 | 70 | 8,396 | 8,524 | Accepted | Accepted | 68.18 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 4 6
0 0
0 2
0 3
1 1
2 1
2 3
output:
3
"""
import sys
def generate_adj_table(_edges):
for edge in _edges:
vx, vy = list(map(int, edge))
init_adj_table[vx].append(vy)
return init_adj_table
def graph_dfs(current, matching, visited):
for adj in range(y_num):
if adj in adj_table[current] and not visited[adj]:
visited[adj] = True
if matching[adj] == -1 or graph_dfs(matching[adj], matching, visited):
matching[adj] = current
return True
return False
def mbm():
matching = [-1] * y_num
res = 0
for v in range(x_num):
visited = [False] * y_num
if graph_dfs(v, matching, visited):
res += 1
# print(matching)
return res
if __name__ == '__main__':
_input = sys.stdin.readlines()
x_num, y_num, e_num = list(map(int, _input[0].split()))
edges = [x.split() for x in _input[1:]]
# v_num = x_num + y_num
init_adj_table = [[] for _ in range(x_num)]
adj_table = generate_adj_table(edges)
print((mbm())) | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 4 6
0 0
0 2
0 3
1 1
2 1
2 3
output:
3
"""
import sys
def generate_adj_table(_edges):
for edge in _edges:
vx, vy = list(map(int, edge))
init_adj_table[vx].append(vy)
return init_adj_table
def graph_dfs(current, matching, visited):
for adj in range(y_num):
if (not visited[adj]) and adj in adj_table[current]:
visited[adj] = True
if matching[adj] == -1 or graph_dfs(matching[adj], matching, visited):
matching[adj] = current
return True
return False
def mbm():
matching = [-1] * y_num
res = 0
for v in range(x_num):
visited = [False] * y_num
if graph_dfs(v, matching, visited):
res += 1
# print(matching)
return res
if __name__ == '__main__':
_input = sys.stdin.readlines()
x_num, y_num, e_num = list(map(int, _input[0].split()))
edges = [x.split() for x in _input[1:]]
init_adj_table = [[] for _ in range(x_num)]
adj_table = generate_adj_table(edges)
print((mbm())) | 58 | 57 | 1,178 | 1,151 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 4 6
0 0
0 2
0 3
1 1
2 1
2 3
output:
3
"""
import sys
def generate_adj_table(_edges):
for edge in _edges:
vx, vy = list(map(int, edge))
init_adj_table[vx].append(vy)
return init_adj_table
def graph_dfs(current, matching, visited):
for adj in range(y_num):
if adj in adj_table[current] and not visited[adj]:
visited[adj] = True
if matching[adj] == -1 or graph_dfs(matching[adj], matching, visited):
matching[adj] = current
return True
return False
def mbm():
matching = [-1] * y_num
res = 0
for v in range(x_num):
visited = [False] * y_num
if graph_dfs(v, matching, visited):
res += 1
# print(matching)
return res
if __name__ == "__main__":
_input = sys.stdin.readlines()
x_num, y_num, e_num = list(map(int, _input[0].split()))
edges = [x.split() for x in _input[1:]]
# v_num = x_num + y_num
init_adj_table = [[] for _ in range(x_num)]
adj_table = generate_adj_table(edges)
print((mbm()))
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 4 6
0 0
0 2
0 3
1 1
2 1
2 3
output:
3
"""
import sys
def generate_adj_table(_edges):
for edge in _edges:
vx, vy = list(map(int, edge))
init_adj_table[vx].append(vy)
return init_adj_table
def graph_dfs(current, matching, visited):
for adj in range(y_num):
if (not visited[adj]) and adj in adj_table[current]:
visited[adj] = True
if matching[adj] == -1 or graph_dfs(matching[adj], matching, visited):
matching[adj] = current
return True
return False
def mbm():
matching = [-1] * y_num
res = 0
for v in range(x_num):
visited = [False] * y_num
if graph_dfs(v, matching, visited):
res += 1
# print(matching)
return res
if __name__ == "__main__":
_input = sys.stdin.readlines()
x_num, y_num, e_num = list(map(int, _input[0].split()))
edges = [x.split() for x in _input[1:]]
init_adj_table = [[] for _ in range(x_num)]
adj_table = generate_adj_table(edges)
print((mbm()))
| false | 1.724138 | [
"- if adj in adj_table[current] and not visited[adj]:",
"+ if (not visited[adj]) and adj in adj_table[current]:",
"- # v_num = x_num + y_num"
] | false | 0.094556 | 0.095199 | 0.993244 | [
"s437718220",
"s082031991"
] |
u303039933 | p02984 | python | s649628191 | s806592438 | 373 | 110 | 87,444 | 22,332 | Accepted | Accepted | 70.51 | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
from decimal import *
class Scanner():
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [eval(input()) for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [int(eval(input())) for i in range(n)]
class Math():
@staticmethod
def gcd(a, b):
if b == 0:
return a
return Math.gcd(b, a % b)
@staticmethod
def lcm(a, b):
return (a * b) // Math.gcd(a, b)
@staticmethod
def divisor(n):
res = []
i = 1
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
res.append(i)
if i != n // i:
res.append(n // i)
return res
@staticmethod
def round_up(a, b):
return -(-a // b)
@staticmethod
def is_prime(n):
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
d = int(n ** 0.5) + 1
for i in range(3, d + 1, 2):
if n % i == 0:
return False
return True
def pop_count(x):
x = x - ((x >> 1) & 0x5555555555555555)
x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f
x = x + (x >> 8)
x = x + (x >> 16)
x = x + (x >> 32)
return x & 0x0000007f
MOD = int(1e09) + 7
INF = int(1e15)
def main():
# sys.stdin = open("sample.txt")
N = Scanner.int()
A = Scanner.map_int()
S = sum(A)
x0 = S
for i in range(1, N, 2):
x0 -= 2 * A[i]
ans = []
ans.append(x0)
for i in range(N - 1):
x = 2 * A[i] - ans[-1]
ans.append(x)
print((*ans))
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import decimal
class Scanner():
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [Scanner.string() for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [Scanner.int() for i in range(n)]
MOD = int(1e09) + 7
INF = int(1e15)
def solve():
N = Scanner.int()
A = Scanner.map_int()
S = sum(A)
X = [0 for _ in range(N)]
for i in range(1, N, 2):
X[0] -= 2 * A[i]
X[0] += S
for i in range(1, N):
X[i] = 2 * A[i - 1] - X[i - 1]
print((*X))
def main():
# sys.setrecursionlimit(1000000)
# sys.stdin = open("sample.txt")
# T = Scanner.int()
# for _ in range(T):
# solve()
# print('YNeos'[not solve()::2])
solve()
if __name__ == "__main__":
main()
| 116 | 75 | 2,456 | 1,483 | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
from decimal import *
class Scanner:
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [eval(input()) for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [int(eval(input())) for i in range(n)]
class Math:
@staticmethod
def gcd(a, b):
if b == 0:
return a
return Math.gcd(b, a % b)
@staticmethod
def lcm(a, b):
return (a * b) // Math.gcd(a, b)
@staticmethod
def divisor(n):
res = []
i = 1
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
res.append(i)
if i != n // i:
res.append(n // i)
return res
@staticmethod
def round_up(a, b):
return -(-a // b)
@staticmethod
def is_prime(n):
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
d = int(n**0.5) + 1
for i in range(3, d + 1, 2):
if n % i == 0:
return False
return True
def pop_count(x):
x = x - ((x >> 1) & 0x5555555555555555)
x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
x = (x + (x >> 4)) & 0x0F0F0F0F0F0F0F0F
x = x + (x >> 8)
x = x + (x >> 16)
x = x + (x >> 32)
return x & 0x0000007F
MOD = int(1e09) + 7
INF = int(1e15)
def main():
# sys.stdin = open("sample.txt")
N = Scanner.int()
A = Scanner.map_int()
S = sum(A)
x0 = S
for i in range(1, N, 2):
x0 -= 2 * A[i]
ans = []
ans.append(x0)
for i in range(N - 1):
x = 2 * A[i] - ans[-1]
ans.append(x)
print((*ans))
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import decimal
class Scanner:
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [Scanner.string() for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [Scanner.int() for i in range(n)]
MOD = int(1e09) + 7
INF = int(1e15)
def solve():
N = Scanner.int()
A = Scanner.map_int()
S = sum(A)
X = [0 for _ in range(N)]
for i in range(1, N, 2):
X[0] -= 2 * A[i]
X[0] += S
for i in range(1, N):
X[i] = 2 * A[i - 1] - X[i - 1]
print((*X))
def main():
# sys.setrecursionlimit(1000000)
# sys.stdin = open("sample.txt")
# T = Scanner.int()
# for _ in range(T):
# solve()
# print('YNeos'[not solve()::2])
solve()
if __name__ == "__main__":
main()
| false | 35.344828 | [
"+from collections import deque",
"-from decimal import *",
"+import decimal",
"- return [eval(input()) for i in range(n)]",
"+ return [Scanner.string() for i in range(n)]",
"- return [int(eval(input())) for i in range(n)]",
"-",
"-",
"-class Math:",
"- @staticmethod",
"-... | false | 0.059906 | 0.082565 | 0.725565 | [
"s649628191",
"s806592438"
] |
u186838327 | p02954 | python | s160814806 | s123638302 | 298 | 254 | 54,648 | 51,004 | Accepted | Accepted | 14.77 | s = list(str(eval(input())))
t = list(reversed(s))
#print(s)
#print(t)
n = len(s)
r = []
temp = 0
for i in range(n):
if s[i] == 'R':
temp += 1
else:
if i >=1 and s[i-1] == 'R' and s[i] == 'L':
r.append(temp)
l = []
temp = 0
for i in range(n):
if t[i] == 'L':
temp += 1
else:
if i >=1 and t[i-1] == 'L' and t[i] == 'R':
l.append(temp)
#print(r)
#print(l)
r_ = []
l_ = []
for i in range(len(r)):
if i == 0:
r_.append(r[i])
l_.append(l[i])
else:
r_.append(r[i]-r[i-1])
l_.append(l[i]-l[i-1])
l_ = list(reversed(l_))
#print(r_)
#print(l_)
ans = [0]*n
cnt = 0
for i in range(n):
if i==n-1:
continue
if s[i] == 'R' and s[i+1] == 'L':
ans[i] = l_[cnt]//2+(r_[cnt]+1)//2
ans[i+1] = (l_[cnt]+1)//2+r_[cnt]//2
cnt += 1
print((*ans))
| s = str(eval(input()))
n = len(s)
t = []
for i in range(n-1):
if s[i] == 'R' and s[i+1] == 'L':
ir = i
#il = i+1
#t.append([ir, il])
t.append(ir)
from collections import deque
t.append(10**6)
t_ = deque(t)
post = []
ans = [0]*n
for i in range(n):
ir = t_.popleft()
if i < ir:
if s[i] == 'R':
if i%2 == ir%2:
ans[ir] += 1
else:
ans[ir+1] += 1
if s[i] == 'L':
if i%2 == post[-1]%2:
ans[post[-1]] += 1
else:
ans[post[-1]+1] += 1
t_.appendleft(ir)
if i == ir:
ans[ir] += 1
post.append(ir)
print((*ans)) | 50 | 33 | 923 | 723 | s = list(str(eval(input())))
t = list(reversed(s))
# print(s)
# print(t)
n = len(s)
r = []
temp = 0
for i in range(n):
if s[i] == "R":
temp += 1
else:
if i >= 1 and s[i - 1] == "R" and s[i] == "L":
r.append(temp)
l = []
temp = 0
for i in range(n):
if t[i] == "L":
temp += 1
else:
if i >= 1 and t[i - 1] == "L" and t[i] == "R":
l.append(temp)
# print(r)
# print(l)
r_ = []
l_ = []
for i in range(len(r)):
if i == 0:
r_.append(r[i])
l_.append(l[i])
else:
r_.append(r[i] - r[i - 1])
l_.append(l[i] - l[i - 1])
l_ = list(reversed(l_))
# print(r_)
# print(l_)
ans = [0] * n
cnt = 0
for i in range(n):
if i == n - 1:
continue
if s[i] == "R" and s[i + 1] == "L":
ans[i] = l_[cnt] // 2 + (r_[cnt] + 1) // 2
ans[i + 1] = (l_[cnt] + 1) // 2 + r_[cnt] // 2
cnt += 1
print((*ans))
| s = str(eval(input()))
n = len(s)
t = []
for i in range(n - 1):
if s[i] == "R" and s[i + 1] == "L":
ir = i
# il = i+1
# t.append([ir, il])
t.append(ir)
from collections import deque
t.append(10**6)
t_ = deque(t)
post = []
ans = [0] * n
for i in range(n):
ir = t_.popleft()
if i < ir:
if s[i] == "R":
if i % 2 == ir % 2:
ans[ir] += 1
else:
ans[ir + 1] += 1
if s[i] == "L":
if i % 2 == post[-1] % 2:
ans[post[-1]] += 1
else:
ans[post[-1] + 1] += 1
t_.appendleft(ir)
if i == ir:
ans[ir] += 1
post.append(ir)
print((*ans))
| false | 34 | [
"-s = list(str(eval(input())))",
"-t = list(reversed(s))",
"-# print(s)",
"-# print(t)",
"+s = str(eval(input()))",
"-r = []",
"-temp = 0",
"+t = []",
"+for i in range(n - 1):",
"+ if s[i] == \"R\" and s[i + 1] == \"L\":",
"+ ir = i",
"+ # il = i+1",
"+ # t.append([ir... | false | 0.037081 | 0.039621 | 0.935904 | [
"s160814806",
"s123638302"
] |
u893962649 | p04019 | python | s068302684 | s671915215 | 32 | 29 | 8,816 | 9,044 | Accepted | Accepted | 9.38 | S = eval(input())
if (("N" in S and "S" in S)
or("N" not in S and "S" not in S)):
if (("E" in S and "W" in S)
or ("E" not in S and "W" not in S)):
print('Yes')
exit()
print('No') | S = eval(input())
if ((("N" in S and "S" in S)
or("N" not in S and "S" not in S))
and(("E" in S and "W" in S)
or ("E" not in S and "W" not in S))):
print('Yes')
else:
print('No') | 9 | 9 | 206 | 190 | S = eval(input())
if ("N" in S and "S" in S) or ("N" not in S and "S" not in S):
if ("E" in S and "W" in S) or ("E" not in S and "W" not in S):
print("Yes")
exit()
print("No")
| S = eval(input())
if (("N" in S and "S" in S) or ("N" not in S and "S" not in S)) and (
("E" in S and "W" in S) or ("E" not in S and "W" not in S)
):
print("Yes")
else:
print("No")
| false | 0 | [
"-if (\"N\" in S and \"S\" in S) or (\"N\" not in S and \"S\" not in S):",
"- if (\"E\" in S and \"W\" in S) or (\"E\" not in S and \"W\" not in S):",
"- print(\"Yes\")",
"- exit()",
"-print(\"No\")",
"+if ((\"N\" in S and \"S\" in S) or (\"N\" not in S and \"S\" not in S)) and (",
"+ ... | false | 0.102648 | 0.037984 | 2.702393 | [
"s068302684",
"s671915215"
] |
u046187684 | p02972 | python | s408798891 | s161460778 | 1,354 | 165 | 24,172 | 14,516 | Accepted | Accepted | 87.81 | import numpy as np
def solve(string):
n, *a = list(map(int, string.split()))
a = np.asarray([0] + a)
for i in range(n // 2, 0, -1):
a[i] = a[i::i].sum() % 2
ans = np.where(a == 1)[0]
return "0" if len(ans) == 0 else "{}\n{}".format(len(ans), " ".join(map(str, ans)))
if __name__ == '__main__':
print((solve('\n'.join([eval(input()), eval(input())]))))
| def solve(string):
n, *a = list(map(int, string.split()))
for i in range(n // 2, 0, -1):
a[i - 1] = sum(a[i - 1::i]) % 2
ans = [str(i + 1) for i, _a in enumerate(a) if _a == 1]
return "0" if len(ans) == 0 else "{}\n{}".format(len(ans), " ".join(ans))
if __name__ == '__main__':
print((solve('\n'.join([eval(input()), eval(input())]))))
| 14 | 10 | 381 | 355 | import numpy as np
def solve(string):
n, *a = list(map(int, string.split()))
a = np.asarray([0] + a)
for i in range(n // 2, 0, -1):
a[i] = a[i::i].sum() % 2
ans = np.where(a == 1)[0]
return "0" if len(ans) == 0 else "{}\n{}".format(len(ans), " ".join(map(str, ans)))
if __name__ == "__main__":
print((solve("\n".join([eval(input()), eval(input())]))))
| def solve(string):
n, *a = list(map(int, string.split()))
for i in range(n // 2, 0, -1):
a[i - 1] = sum(a[i - 1 :: i]) % 2
ans = [str(i + 1) for i, _a in enumerate(a) if _a == 1]
return "0" if len(ans) == 0 else "{}\n{}".format(len(ans), " ".join(ans))
if __name__ == "__main__":
print((solve("\n".join([eval(input()), eval(input())]))))
| false | 28.571429 | [
"-import numpy as np",
"-",
"-",
"- a = np.asarray([0] + a)",
"- a[i] = a[i::i].sum() % 2",
"- ans = np.where(a == 1)[0]",
"- return \"0\" if len(ans) == 0 else \"{}\\n{}\".format(len(ans), \" \".join(map(str, ans)))",
"+ a[i - 1] = sum(a[i - 1 :: i]) % 2",
"+ ans = [str(i ... | false | 0.160916 | 0.068988 | 2.33253 | [
"s408798891",
"s161460778"
] |
u208713671 | p03013 | python | s007700050 | s739381062 | 213 | 136 | 11,040 | 76,256 | Accepted | Accepted | 36.15 | NM = list(map(int,input().split()))
N = NM[0]
M = NM[1]
A =[]
while True:
try:
A.append(int(eval(input())))
except:
break;
countlist = [1,1,2]
if N >3:
for i in range(3,N+1):
a = countlist[i-2]+countlist[i-1]
if a>1000000007:
a = a%1000000007
countlist.append(a)
t = 0
count = 0
out = []
if N >1:
for i in range(1,N+1):
count+=1
if ((t<len(A))and(i==A[t])):
t+= 1
while ((t<len(A))and(i==A[t])):
t+=1
if count > 0:
out.append(countlist[count-1])
else:
out.append(0)
break
count = -1
if count>=0:
out.append(countlist[count])
output = 1
for i in range(len(out)):
output = output*out[i]
if output > 1000000007:
output = output%1000000007
print(output) | N,M = list(map(int,input().split()))
p=10**9+7
A = [0]*(N+1)
flag = 0
for i in range(M):
tmp = int(eval(input()))
A[tmp]=1
if A[tmp]*A[tmp-1]>0:
flag=1
break
if flag==1:
print((0))
else:
dp = [0]*(N+1)
dp[0] = 1
dp[1] = 1-A[1]
for i in range(2,N+1):
if A[i]==1:
continue
dp[i]=(dp[i-1]+dp[i-2])%p
print((dp[-1])) | 49 | 21 | 928 | 402 | NM = list(map(int, input().split()))
N = NM[0]
M = NM[1]
A = []
while True:
try:
A.append(int(eval(input())))
except:
break
countlist = [1, 1, 2]
if N > 3:
for i in range(3, N + 1):
a = countlist[i - 2] + countlist[i - 1]
if a > 1000000007:
a = a % 1000000007
countlist.append(a)
t = 0
count = 0
out = []
if N > 1:
for i in range(1, N + 1):
count += 1
if (t < len(A)) and (i == A[t]):
t += 1
while (t < len(A)) and (i == A[t]):
t += 1
if count > 0:
out.append(countlist[count - 1])
else:
out.append(0)
break
count = -1
if count >= 0:
out.append(countlist[count])
output = 1
for i in range(len(out)):
output = output * out[i]
if output > 1000000007:
output = output % 1000000007
print(output)
| N, M = list(map(int, input().split()))
p = 10**9 + 7
A = [0] * (N + 1)
flag = 0
for i in range(M):
tmp = int(eval(input()))
A[tmp] = 1
if A[tmp] * A[tmp - 1] > 0:
flag = 1
break
if flag == 1:
print((0))
else:
dp = [0] * (N + 1)
dp[0] = 1
dp[1] = 1 - A[1]
for i in range(2, N + 1):
if A[i] == 1:
continue
dp[i] = (dp[i - 1] + dp[i - 2]) % p
print((dp[-1]))
| false | 57.142857 | [
"-NM = list(map(int, input().split()))",
"-N = NM[0]",
"-M = NM[1]",
"-A = []",
"-while True:",
"- try:",
"- A.append(int(eval(input())))",
"- except:",
"+N, M = list(map(int, input().split()))",
"+p = 10**9 + 7",
"+A = [0] * (N + 1)",
"+flag = 0",
"+for i in range(M):",
"+ ... | false | 0.064507 | 0.041565 | 1.551949 | [
"s007700050",
"s739381062"
] |
u131464432 | p03687 | python | s630362279 | s145370031 | 32 | 25 | 9,404 | 8,944 | Accepted | Accepted | 21.88 | import collections
s = eval(input())
a = []
for i in range(26):
cnt = collections.Counter(s)[chr(i+97)]
if cnt == 0:
a.append(len(s))
continue
num = 0
ma = 0
for j in s:
if j == chr(i+97):
ans = num
ma = max(ma, ans)
num = 0
else:
num += 1
ans = num
ma = max(ma, ans)
a.append(ma)
print((min(a))) | s = eval(input())
a = "qwertyuiopasdfghjklzxcvbnm"
mi = 100
for i in a:
ma,cnt = 0,0
for j in s:
if j != i:
cnt += 1
else:
ma = max(ma, cnt)
cnt = 0
ma = max(ma,cnt)
mi = min(mi,ma)
print(mi) | 21 | 14 | 428 | 270 | import collections
s = eval(input())
a = []
for i in range(26):
cnt = collections.Counter(s)[chr(i + 97)]
if cnt == 0:
a.append(len(s))
continue
num = 0
ma = 0
for j in s:
if j == chr(i + 97):
ans = num
ma = max(ma, ans)
num = 0
else:
num += 1
ans = num
ma = max(ma, ans)
a.append(ma)
print((min(a)))
| s = eval(input())
a = "qwertyuiopasdfghjklzxcvbnm"
mi = 100
for i in a:
ma, cnt = 0, 0
for j in s:
if j != i:
cnt += 1
else:
ma = max(ma, cnt)
cnt = 0
ma = max(ma, cnt)
mi = min(mi, ma)
print(mi)
| false | 33.333333 | [
"-import collections",
"-",
"-a = []",
"-for i in range(26):",
"- cnt = collections.Counter(s)[chr(i + 97)]",
"- if cnt == 0:",
"- a.append(len(s))",
"- continue",
"- num = 0",
"- ma = 0",
"+a = \"qwertyuiopasdfghjklzxcvbnm\"",
"+mi = 100",
"+for i in a:",
"+ m... | false | 0.0399 | 0.041283 | 0.96652 | [
"s630362279",
"s145370031"
] |
u992910889 | p03164 | python | s705134208 | s364415753 | 1,133 | 860 | 311,888 | 300,904 | Accepted | Accepted | 24.1 | N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
V = sum(v)
# dp[i][j]:i番目までの品物から価値がj以上になるよう選んだときの重さの総和の最小値
dp = [[float("inf")] * (V + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(V + 1):
# i+1番目を選ぶ場合
if j - v[i] >= 0:
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i])
# i+1番目を選ばない場合
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
# dp[N][j]がW以下であるようなjの最大値が答えになる
ans = 0
for j in range(V + 1):
if dp[N][j] <= W:
ans = j
print(ans)
| # import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product
def resolve():
N, W = list(map(int, input().split()))
weight, value = [0] * N, [0] * N
for i in range(N):
weight[i], value[i] = list(map(int, input().split()))
# この前段階で、荷物の数N、ウェイトの上限W、
# weightの表weightとvalueの表valueは用意しておく。
def knapsack(N, W, weight, value):
V=sum(value)
# dp[i][v]はvを運べる最小のウェイトを意味する。
# 求めたいのは、dp[N][v]<=Wなるvのmax
dp = [[float('inf')] * (V + 1) for _ in range(N + 1)]
dp[0][0]=0
for i in range(N):
for v in range(V + 1):
if v >= value[i]:
dp[i + 1][v] = min(dp[i][v], dp[i][v - value[i]] + weight[i])
else:
dp[i + 1][v] = dp[i][v]
# dp[N][j]がW以下であるようなjの最大値が答えになる
ans = 0
for v in range(V + 1):
if dp[N][v] <= W:
ans = v
return ans
print((knapsack(N, W, weight, value)))
resolve() | 24 | 48 | 571 | 1,194 | N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
V = sum(v)
# dp[i][j]:i番目までの品物から価値がj以上になるよう選んだときの重さの総和の最小値
dp = [[float("inf")] * (V + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(V + 1):
# i+1番目を選ぶ場合
if j - v[i] >= 0:
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i])
# i+1番目を選ばない場合
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
# dp[N][j]がW以下であるようなjの最大値が答えになる
ans = 0
for j in range(V + 1):
if dp[N][j] <= W:
ans = j
print(ans)
| # import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product
def resolve():
N, W = list(map(int, input().split()))
weight, value = [0] * N, [0] * N
for i in range(N):
weight[i], value[i] = list(map(int, input().split()))
# この前段階で、荷物の数N、ウェイトの上限W、
# weightの表weightとvalueの表valueは用意しておく。
def knapsack(N, W, weight, value):
V = sum(value)
# dp[i][v]はvを運べる最小のウェイトを意味する。
# 求めたいのは、dp[N][v]<=Wなるvのmax
dp = [[float("inf")] * (V + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for v in range(V + 1):
if v >= value[i]:
dp[i + 1][v] = min(dp[i][v], dp[i][v - value[i]] + weight[i])
else:
dp[i + 1][v] = dp[i][v]
# dp[N][j]がW以下であるようなjの最大値が答えになる
ans = 0
for v in range(V + 1):
if dp[N][v] <= W:
ans = v
return ans
print((knapsack(N, W, weight, value)))
resolve()
| false | 50 | [
"-N, W = list(map(int, input().split()))",
"-w, v = [0] * N, [0] * N",
"-for i in range(N):",
"- w[i], v[i] = list(map(int, input().split()))",
"-V = sum(v)",
"-# dp[i][j]:i番目までの品物から価値がj以上になるよう選んだときの重さの総和の最小値",
"-dp = [[float(\"inf\")] * (V + 1) for _ in range(N + 1)]",
"-dp[0][0] = 0",
"-for i i... | false | 0.078583 | 0.038856 | 2.022428 | [
"s705134208",
"s364415753"
] |
u562016607 | p03665 | python | s625267075 | s236489612 | 24 | 19 | 3,064 | 3,064 | Accepted | Accepted | 20.83 | def C(n,m):
S=1
for i in range(1,n+1):
S=S*i
for i in range(1,m+1):
S=S//i
for i in range(1,n-m+1):
S=S//i
return S
N,P=list(map(int,input().split()))
A=[int(i) for i in input().split()]
X=0;Y=0
#X:偶数
#Y:奇数
for i in range(N):
if A[i]%2==0:
X+=1
else:
Y+=1
Z=0
for i in range(Y+1):
if i%2==P:
Z+=C(Y,i)
print((Z*2**(X)))
| '''
方針：各Aiをそれぞれ見て、いくつ偶数があっていくつ奇数があるかを数える。
以下偶数がX個、奇数がY個あるとする。(X+Y=N,0≦X,Y)
そしてこの問題は偶数の集合の中からの選ぶことと奇数の集合の中から選ぶことを独立に考えることができる。
よって（偶数の集合からの選び方）×（奇数の集合からの選び方）で求めることができる。
（偶数の集合からの選び方）については、どのように選んでも全体の合計を2で割った余りは変わらないので全事象を考えることができる。
よって2^Xである。
（奇数の集合からの選び方）についてはY個のうちk個（k≡P mod 2）である場合の数の合計なので
Σ[k:0→Y and k≡P mod 2]C(Y,k)である。
ただし、C(Y,k)は二項係数を表していて、Σ[k:0→Y and k≡P mod 2]は0≦k≦Nかつk≡P mod 2であるものすべてを足し合わせたという意味である。
'''
def C(n,m):
S=1
for i in range(1,n+1):
S=S*i
for i in range(1,m+1):
S=S//i
for i in range(1,n-m+1):
S=S//i
return S
N,P=list(map(int,input().split()))
A=[int(i) for i in input().split()]
X=0;Y=0
#X:偶数
#Y:奇数
for i in range(N):
if A[i]%2==0:
X+=1
else:
Y+=1
Z=0
for i in range(Y+1):
if i%2==P:
Z+=C(Y,i)
print((Z*2**(X)))
| 24 | 35 | 415 | 842 | def C(n, m):
S = 1
for i in range(1, n + 1):
S = S * i
for i in range(1, m + 1):
S = S // i
for i in range(1, n - m + 1):
S = S // i
return S
N, P = list(map(int, input().split()))
A = [int(i) for i in input().split()]
X = 0
Y = 0
# X:偶数
# Y:奇数
for i in range(N):
if A[i] % 2 == 0:
X += 1
else:
Y += 1
Z = 0
for i in range(Y + 1):
if i % 2 == P:
Z += C(Y, i)
print((Z * 2 ** (X)))
| """
方針：各Aiをそれぞれ見て、いくつ偶数があっていくつ奇数があるかを数える。
以下偶数がX個、奇数がY個あるとする。(X+Y=N,0≦X,Y)
そしてこの問題は偶数の集合の中からの選ぶことと奇数の集合の中から選ぶことを独立に考えることができる。
よって（偶数の集合からの選び方）×（奇数の集合からの選び方）で求めることができる。
（偶数の集合からの選び方）については、どのように選んでも全体の合計を2で割った余りは変わらないので全事象を考えることができる。
よって2^Xである。
（奇数の集合からの選び方）についてはY個のうちk個（k≡P mod 2）である場合の数の合計なので
Σ[k:0→Y and k≡P mod 2]C(Y,k)である。
ただし、C(Y,k)は二項係数を表していて、Σ[k:0→Y and k≡P mod 2]は0≦k≦Nかつk≡P mod 2であるものすべてを足し合わせたという意味である。
"""
def C(n, m):
S = 1
for i in range(1, n + 1):
S = S * i
for i in range(1, m + 1):
S = S // i
for i in range(1, n - m + 1):
S = S // i
return S
N, P = list(map(int, input().split()))
A = [int(i) for i in input().split()]
X = 0
Y = 0
# X:偶数
# Y:奇数
for i in range(N):
if A[i] % 2 == 0:
X += 1
else:
Y += 1
Z = 0
for i in range(Y + 1):
if i % 2 == P:
Z += C(Y, i)
print((Z * 2 ** (X)))
| false | 31.428571 | [
"+\"\"\"",
"+方針：各Aiをそれぞれ見て、いくつ偶数があっていくつ奇数があるかを数える。",
"+以下偶数がX個、奇数がY個あるとする。(X+Y=N,0≦X,Y)",
"+そしてこの問題は偶数の集合の中からの選ぶことと奇数の集合の中から選ぶことを独立に考えることができる。",
"+よって（偶数の集合からの選び方）×（奇数の集合からの選び方）で求めることができる。",
"+（偶数の集合からの選び方）については、どのように選んでも全体の合計を2で割った余りは変わらないので全事象を考えることができる。",
"+よって2^Xである。",
"+（奇数の集合からの選び方）についてはY個のうちk個（... | false | 0.041694 | 0.059949 | 0.695488 | [
"s625267075",
"s236489612"
] |
u410118019 | p03096 | python | s605850856 | s020761658 | 1,526 | 979 | 764,032 | 98,904 | Accepted | Accepted | 35.85 | from collections import defaultdict
MOD = 10**9+7
n = int(eval(input()))
dp = [1]
d = defaultdict(list)
cur = int(eval(input()))
d[cur].append(0)
for i in range(1,n):
pre,cur = cur,int(eval(input()))
c = dp[-1]
if pre != cur and d[cur]:
c += dp[d[cur][-1]]
dp.append(c)
d[cur].append(i)
print((dp[-1]%MOD)) | from collections import defaultdict
MOD = 10**9+7
n = int(eval(input()))
dp = [1]
d = defaultdict(list)
cur = int(eval(input()))
d[cur].append(0)
for i in range(1,n):
pre,cur = cur,int(eval(input()))
c = dp[-1]
if pre != cur and d[cur]:
c += dp[d[cur][-1]]
dp.append(c%MOD)
d[cur].append(i)
print((dp[-1])) | 15 | 15 | 314 | 314 | from collections import defaultdict
MOD = 10**9 + 7
n = int(eval(input()))
dp = [1]
d = defaultdict(list)
cur = int(eval(input()))
d[cur].append(0)
for i in range(1, n):
pre, cur = cur, int(eval(input()))
c = dp[-1]
if pre != cur and d[cur]:
c += dp[d[cur][-1]]
dp.append(c)
d[cur].append(i)
print((dp[-1] % MOD))
| from collections import defaultdict
MOD = 10**9 + 7
n = int(eval(input()))
dp = [1]
d = defaultdict(list)
cur = int(eval(input()))
d[cur].append(0)
for i in range(1, n):
pre, cur = cur, int(eval(input()))
c = dp[-1]
if pre != cur and d[cur]:
c += dp[d[cur][-1]]
dp.append(c % MOD)
d[cur].append(i)
print((dp[-1]))
| false | 0 | [
"- dp.append(c)",
"+ dp.append(c % MOD)",
"-print((dp[-1] % MOD))",
"+print((dp[-1]))"
] | false | 0.128868 | 0.038644 | 3.334712 | [
"s605850856",
"s020761658"
] |
u294485299 | p03163 | python | s192002423 | s649990765 | 520 | 109 | 218,640 | 68,740 | Accepted | Accepted | 79.04 | import math
n, w = list(map(int, input().split()))
weights = []
costs = []
for i in range(n):
a,b = list(map(int, input().split()))
weights.append(a)
costs.append(b)
dp = [[0 for i in range(w+1)] for i in range(n)]
for i in range(w+1):
if(i>= weights[0]):
dp[0][i] = costs[0]
for i in range(1, n):
for j in range(w+1):
if(j >= weights[i]):
val = max(dp[i-1][j], costs[i]+dp[i-1][j-weights[i]])
dp[i][j] = val
else:
dp[i][j] =max(dp[i][j], dp[i-1][j])
print((dp[-1][-1])) | import math
n, W = list(map(int, input().split()))
dp = [0]*(W+1)
for i in range(n):
weight, cost = list(map(int, input().split()))
for weight_already in range(W-weight, -1, -1):
dp[weight_already+weight] = max(dp[weight_already+weight], dp[weight_already]+cost)
ans = max(dp)
print(ans) | 22 | 10 | 559 | 301 | import math
n, w = list(map(int, input().split()))
weights = []
costs = []
for i in range(n):
a, b = list(map(int, input().split()))
weights.append(a)
costs.append(b)
dp = [[0 for i in range(w + 1)] for i in range(n)]
for i in range(w + 1):
if i >= weights[0]:
dp[0][i] = costs[0]
for i in range(1, n):
for j in range(w + 1):
if j >= weights[i]:
val = max(dp[i - 1][j], costs[i] + dp[i - 1][j - weights[i]])
dp[i][j] = val
else:
dp[i][j] = max(dp[i][j], dp[i - 1][j])
print((dp[-1][-1]))
| import math
n, W = list(map(int, input().split()))
dp = [0] * (W + 1)
for i in range(n):
weight, cost = list(map(int, input().split()))
for weight_already in range(W - weight, -1, -1):
dp[weight_already + weight] = max(
dp[weight_already + weight], dp[weight_already] + cost
)
ans = max(dp)
print(ans)
| false | 54.545455 | [
"-n, w = list(map(int, input().split()))",
"-weights = []",
"-costs = []",
"+n, W = list(map(int, input().split()))",
"+dp = [0] * (W + 1)",
"- a, b = list(map(int, input().split()))",
"- weights.append(a)",
"- costs.append(b)",
"-dp = [[0 for i in range(w + 1)] for i in range(n)]",
"-for... | false | 0.039915 | 0.051666 | 0.77256 | [
"s192002423",
"s649990765"
] |
u608088992 | p03141 | python | s401675983 | s588799336 | 745 | 476 | 36,388 | 36,016 | Accepted | Accepted | 36.11 | N = int(eval(input()))
Takahashi = [None] * N
Aoki = [None] * N
Used = [False] * N
for i in range(N):
a, b = list(map(int, input().split()))
Takahashi[i] = (-a-b, -a, i)
Aoki[i] = (-b-a, -b, i)
Takahashi.sort()
Aoki.sort()
TotalPoint = 0
usedDish = 0
tnum, anum = 0, 0
while usedDish < N:
if usedDish % 2 == 0:
while Used[Takahashi[tnum][2]]:
tnum += 1
TotalPoint -= Takahashi[tnum][1]
Used[Takahashi[tnum][2]] = True
usedDish += 1
else:
while Used[Aoki[anum][2]]:
anum += 1
TotalPoint += Aoki[anum][1]
Used[Aoki[anum][2]] = True
usedDish += 1
print(TotalPoint)
| import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
T, A = [None] * N, [None] * N
used = [False] * N
for i in range(N):
a, b = list(map(int, input().split()))
T[i] = (a + b, a, i)
A[i] = (a + b, b, i)
T.sort(reverse = True)
A.sort(reverse = True)
hapiness = 0
ti, ai = 0, 0
for i in range(N):
if i % 2 == 0:
while used[T[ti][2]]: ti += 1
hapiness += T[ti][1]
used[T[ti][2]] = True
ti += 1
else:
while used[A[ai][2]]: ai += 1
hapiness -= A[ai][1]
used[A[ai][2]] = True
ai += 1
print(hapiness)
return 0
if __name__ == "__main__":
solve() | 29 | 32 | 689 | 781 | N = int(eval(input()))
Takahashi = [None] * N
Aoki = [None] * N
Used = [False] * N
for i in range(N):
a, b = list(map(int, input().split()))
Takahashi[i] = (-a - b, -a, i)
Aoki[i] = (-b - a, -b, i)
Takahashi.sort()
Aoki.sort()
TotalPoint = 0
usedDish = 0
tnum, anum = 0, 0
while usedDish < N:
if usedDish % 2 == 0:
while Used[Takahashi[tnum][2]]:
tnum += 1
TotalPoint -= Takahashi[tnum][1]
Used[Takahashi[tnum][2]] = True
usedDish += 1
else:
while Used[Aoki[anum][2]]:
anum += 1
TotalPoint += Aoki[anum][1]
Used[Aoki[anum][2]] = True
usedDish += 1
print(TotalPoint)
| import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
T, A = [None] * N, [None] * N
used = [False] * N
for i in range(N):
a, b = list(map(int, input().split()))
T[i] = (a + b, a, i)
A[i] = (a + b, b, i)
T.sort(reverse=True)
A.sort(reverse=True)
hapiness = 0
ti, ai = 0, 0
for i in range(N):
if i % 2 == 0:
while used[T[ti][2]]:
ti += 1
hapiness += T[ti][1]
used[T[ti][2]] = True
ti += 1
else:
while used[A[ai][2]]:
ai += 1
hapiness -= A[ai][1]
used[A[ai][2]] = True
ai += 1
print(hapiness)
return 0
if __name__ == "__main__":
solve()
| false | 9.375 | [
"-N = int(eval(input()))",
"-Takahashi = [None] * N",
"-Aoki = [None] * N",
"-Used = [False] * N",
"-for i in range(N):",
"- a, b = list(map(int, input().split()))",
"- Takahashi[i] = (-a - b, -a, i)",
"- Aoki[i] = (-b - a, -b, i)",
"-Takahashi.sort()",
"-Aoki.sort()",
"-TotalPoint = 0"... | false | 0.109206 | 0.038632 | 2.82683 | [
"s401675983",
"s588799336"
] |
u724687935 | p02901 | python | s212729503 | s472004826 | 420 | 287 | 78,696 | 45,160 | Accepted | Accepted | 31.67 | N, M = list(map(int, input().split()))
A = [None] * M
K = [None] * M
for i in range(M):
a, b = list(map(int, input().split()))
C = list(map(int, input().split()))
A[i] = a
K[i] = sum([2 ** (i - 1) for i in C])
INF = (1 << 32) - 1
dp = [[INF] * (2 ** N) for _ in range(M + 1)]
for i in range(M + 1):
dp[i][0] = 0
for i in range(M):
k = K[i]
a = A[i]
for j in range(2 ** N):
here = dp[i][j]
dp[i + 1][j] = min(dp[i + 1][j], here)
dp[i + 1][j | k] = min(dp[i + 1][j | k], dp[i][j | k], here + a)
ans = dp[M][2 ** N - 1] if dp[M][2 ** N - 1] < INF else -1
print(ans)
| N, M = list(map(int, input().split()))
A = [None] * M
K = [None] * M
for i in range(M):
a, b = list(map(int, input().split()))
C = list(map(int, input().split()))
A[i] = a
K[i] = sum([2 ** (i - 1) for i in C])
INF = (1 << 32) - 1
dp = [INF] * (2 ** N)
dp[0] = 0
for i in range(M):
k = K[i]
a = A[i]
for j in range(2 ** N):
dp[j | k] = min(dp[j | k], dp[j] + a)
ans = dp[2 ** N - 1] if dp[2 ** N - 1] < INF else -1
print(ans)
| 25 | 22 | 629 | 468 | N, M = list(map(int, input().split()))
A = [None] * M
K = [None] * M
for i in range(M):
a, b = list(map(int, input().split()))
C = list(map(int, input().split()))
A[i] = a
K[i] = sum([2 ** (i - 1) for i in C])
INF = (1 << 32) - 1
dp = [[INF] * (2**N) for _ in range(M + 1)]
for i in range(M + 1):
dp[i][0] = 0
for i in range(M):
k = K[i]
a = A[i]
for j in range(2**N):
here = dp[i][j]
dp[i + 1][j] = min(dp[i + 1][j], here)
dp[i + 1][j | k] = min(dp[i + 1][j | k], dp[i][j | k], here + a)
ans = dp[M][2**N - 1] if dp[M][2**N - 1] < INF else -1
print(ans)
| N, M = list(map(int, input().split()))
A = [None] * M
K = [None] * M
for i in range(M):
a, b = list(map(int, input().split()))
C = list(map(int, input().split()))
A[i] = a
K[i] = sum([2 ** (i - 1) for i in C])
INF = (1 << 32) - 1
dp = [INF] * (2**N)
dp[0] = 0
for i in range(M):
k = K[i]
a = A[i]
for j in range(2**N):
dp[j | k] = min(dp[j | k], dp[j] + a)
ans = dp[2**N - 1] if dp[2**N - 1] < INF else -1
print(ans)
| false | 12 | [
"-dp = [[INF] * (2**N) for _ in range(M + 1)]",
"-for i in range(M + 1):",
"- dp[i][0] = 0",
"+dp = [INF] * (2**N)",
"+dp[0] = 0",
"- here = dp[i][j]",
"- dp[i + 1][j] = min(dp[i + 1][j], here)",
"- dp[i + 1][j | k] = min(dp[i + 1][j | k], dp[i][j | k], here + a)",
"-ans = dp... | false | 0.034253 | 0.036422 | 0.940447 | [
"s212729503",
"s472004826"
] |
u945181840 | p03464 | python | s926096236 | s649977259 | 142 | 129 | 14,092 | 14,092 | Accepted | Accepted | 9.15 | import sys
read = sys.stdin.read
readline = sys.stdin.readline
K, *A = list(map(int, read().split()))
maximum = 2
minimum = 2
for i in A[::-1]:
if i > maximum:
print((-1))
exit()
if i >= minimum:
new_minimum = i
else:
new_minimum = (minimum + i - 1) // i * i
new_maximum = maximum // i * i + i - 1
if minimum <= new_minimum <= new_maximum and maximum <= new_maximum:
minimum, maximum = new_minimum, new_maximum
else:
print((-1))
exit()
print((minimum, maximum))
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
K, *A = list(map(int, read().split()))
maximum = 2
minimum = 2
for i in A[::-1]:
if maximum // i - (minimum - 1) // i >= 1:
maximum = maximum // i * i + i - 1
minimum = (minimum + i - 1) // i * i
else:
print((-1))
exit()
print((minimum, maximum))
| 24 | 17 | 556 | 359 | import sys
read = sys.stdin.read
readline = sys.stdin.readline
K, *A = list(map(int, read().split()))
maximum = 2
minimum = 2
for i in A[::-1]:
if i > maximum:
print((-1))
exit()
if i >= minimum:
new_minimum = i
else:
new_minimum = (minimum + i - 1) // i * i
new_maximum = maximum // i * i + i - 1
if minimum <= new_minimum <= new_maximum and maximum <= new_maximum:
minimum, maximum = new_minimum, new_maximum
else:
print((-1))
exit()
print((minimum, maximum))
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
K, *A = list(map(int, read().split()))
maximum = 2
minimum = 2
for i in A[::-1]:
if maximum // i - (minimum - 1) // i >= 1:
maximum = maximum // i * i + i - 1
minimum = (minimum + i - 1) // i * i
else:
print((-1))
exit()
print((minimum, maximum))
| false | 29.166667 | [
"- if i > maximum:",
"- print((-1))",
"- exit()",
"- if i >= minimum:",
"- new_minimum = i",
"- else:",
"- new_minimum = (minimum + i - 1) // i * i",
"- new_maximum = maximum // i * i + i - 1",
"- if minimum <= new_minimum <= new_maximum and maximum <= new_... | false | 0.039205 | 0.0384 | 1.020956 | [
"s926096236",
"s649977259"
] |
u670180528 | p03297 | python | s457446253 | s450843803 | 44 | 18 | 5,432 | 3,188 | Accepted | Accepted | 59.09 | from fractions import gcd
_, *Q = list(map(int, open(0).read().split()))
for a, b, c, d in zip(*[iter(Q)] * 4):
if a < b or d < b:
print("No")
continue
if c >= b:
print("Yes")
continue
a %= b
g = gcd(b, d)
# b - g + a - g * (a // g) < b
if b - g + a - g * (a // g) > c:
print("No")
else:
print("Yes") | def gcd(x, y):
while y:
x, y = y, x % y
return x
_, *Q = list(map(int, open(0).read().split()))
for a, b, c, d in zip(*[iter(Q)] * 4):
if a < b or d < b:
print("No")
continue
if c >= b:
print("Yes")
continue
a %= b
g = gcd(b, d)
# b - g + a - g * (a // g) < b
if b - g + a - g * (a // g) > c:
print("No")
else:
print("Yes") | 16 | 20 | 328 | 360 | from fractions import gcd
_, *Q = list(map(int, open(0).read().split()))
for a, b, c, d in zip(*[iter(Q)] * 4):
if a < b or d < b:
print("No")
continue
if c >= b:
print("Yes")
continue
a %= b
g = gcd(b, d)
# b - g + a - g * (a // g) < b
if b - g + a - g * (a // g) > c:
print("No")
else:
print("Yes")
| def gcd(x, y):
while y:
x, y = y, x % y
return x
_, *Q = list(map(int, open(0).read().split()))
for a, b, c, d in zip(*[iter(Q)] * 4):
if a < b or d < b:
print("No")
continue
if c >= b:
print("Yes")
continue
a %= b
g = gcd(b, d)
# b - g + a - g * (a // g) < b
if b - g + a - g * (a // g) > c:
print("No")
else:
print("Yes")
| false | 20 | [
"-from fractions import gcd",
"+def gcd(x, y):",
"+ while y:",
"+ x, y = y, x % y",
"+ return x",
"+"
] | false | 0.121816 | 0.05436 | 2.240905 | [
"s457446253",
"s450843803"
] |
u600402037 | p02703 | python | s881803561 | s075816437 | 1,183 | 437 | 52,724 | 114,216 | Accepted | Accepted | 63.06 | # coding: utf-8
import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 同じ地点で銀貨の枚数によって別の状態として扱う（最大max(A)*(N-1))
N, M, S = lr()
UVAB = [lr() for _ in range(M)]
CD = [lr() for _ in range(N)] # 0-indexed
Amax = 0
for i in range(M):
a = UVAB[i][2]
if a > Amax:
Amax = a
limit = Amax*(N-1)
S = min(S, limit)
graph = [[] for _ in range(N+1)] # 1-indexed
for u, v, a, b in UVAB:
graph[u].append((v, a, b))
graph[v].append((u, a, b))
def dijkstra(start):
# 時間、銀貨の枚数、現在地をqueへ
INF = 10 ** 15
dist = [[INF for _ in range(limit+1)] for _ in range(N+1)]
dist[1][S] = 0
que = [(0, S, 1)]
while que:
time, silver, prev = heappop(que)
if dist[prev][silver] < time:
continue
for next, a, b in graph[prev]:
t = time + b
si = silver - a
if si < 0:
continue
if dist[next][si] > t:
dist[next][si] = t
heappush(que, (t, si, next))
c, d = CD[prev-1]
si = min(limit, silver+c)
while dist[prev][si] > time + d:
dist[prev][si] = time + d
heappush(que, (time+d, si, prev))
si += c; si = min(limit, si)
time += d
return dist
dist = dijkstra(1)
for i in range(2, N+1):
d = dist[i]
answer = min(d)
print(answer)
# 52 | # coding: utf-8
import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 銀貨を何枚持っているかの状態数、N*2501の都市, dijkstra
N, M, S = lr()
limit = 2500
S = min(S, limit)
graph = [[] for _ in range((N+1) * (limit+1))] # 1-indexed
for _ in range(M):
u, v, a, b = lr()
for x in range(a, limit+1):
graph[u*(limit+1) + x].append(((v*(limit+1)+x-a), b))
graph[v*(limit+1) + x].append(((u*(limit+1)+x-a), b))
for i in range(N):
i += 1
c, d = lr()
for x in range(limit-c+1):
graph[i*(limit+1) + x].append((i*(limit+1) + x + c, d))
def dijkstra(start):
INF = 10 ** 15
dist = [INF] * ((N+1) * (limit+1))
dist[start] = 0
que = [(0, start)]
while que:
d, prev = heappop(que)
if dist[prev] < d:
continue
for next, time in graph[prev]:
d1 = d + time
if dist[next] > d1:
dist[next] = d1
heappush(que, (d1, next))
return dist
dist = dijkstra(1*(limit+1)+S)
for i in range(2, N+1):
answer = min(dist[i*(limit+1):(i+1)*(limit+1)])
print(answer)
| 60 | 45 | 1,543 | 1,239 | # coding: utf-8
import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 同じ地点で銀貨の枚数によって別の状態として扱う（最大max(A)*(N-1))
N, M, S = lr()
UVAB = [lr() for _ in range(M)]
CD = [lr() for _ in range(N)] # 0-indexed
Amax = 0
for i in range(M):
a = UVAB[i][2]
if a > Amax:
Amax = a
limit = Amax * (N - 1)
S = min(S, limit)
graph = [[] for _ in range(N + 1)] # 1-indexed
for u, v, a, b in UVAB:
graph[u].append((v, a, b))
graph[v].append((u, a, b))
def dijkstra(start):
# 時間、銀貨の枚数、現在地をqueへ
INF = 10**15
dist = [[INF for _ in range(limit + 1)] for _ in range(N + 1)]
dist[1][S] = 0
que = [(0, S, 1)]
while que:
time, silver, prev = heappop(que)
if dist[prev][silver] < time:
continue
for next, a, b in graph[prev]:
t = time + b
si = silver - a
if si < 0:
continue
if dist[next][si] > t:
dist[next][si] = t
heappush(que, (t, si, next))
c, d = CD[prev - 1]
si = min(limit, silver + c)
while dist[prev][si] > time + d:
dist[prev][si] = time + d
heappush(que, (time + d, si, prev))
si += c
si = min(limit, si)
time += d
return dist
dist = dijkstra(1)
for i in range(2, N + 1):
d = dist[i]
answer = min(d)
print(answer)
# 52
| # coding: utf-8
import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 銀貨を何枚持っているかの状態数、N*2501の都市, dijkstra
N, M, S = lr()
limit = 2500
S = min(S, limit)
graph = [[] for _ in range((N + 1) * (limit + 1))] # 1-indexed
for _ in range(M):
u, v, a, b = lr()
for x in range(a, limit + 1):
graph[u * (limit + 1) + x].append(((v * (limit + 1) + x - a), b))
graph[v * (limit + 1) + x].append(((u * (limit + 1) + x - a), b))
for i in range(N):
i += 1
c, d = lr()
for x in range(limit - c + 1):
graph[i * (limit + 1) + x].append((i * (limit + 1) + x + c, d))
def dijkstra(start):
INF = 10**15
dist = [INF] * ((N + 1) * (limit + 1))
dist[start] = 0
que = [(0, start)]
while que:
d, prev = heappop(que)
if dist[prev] < d:
continue
for next, time in graph[prev]:
d1 = d + time
if dist[next] > d1:
dist[next] = d1
heappush(que, (d1, next))
return dist
dist = dijkstra(1 * (limit + 1) + S)
for i in range(2, N + 1):
answer = min(dist[i * (limit + 1) : (i + 1) * (limit + 1)])
print(answer)
| false | 25 | [
"-# 同じ地点で銀貨の枚数によって別の状態として扱う（最大max(A)*(N-1))",
"+# 銀貨を何枚持っているかの状態数、N*2501の都市, dijkstra",
"-UVAB = [lr() for _ in range(M)]",
"-CD = [lr() for _ in range(N)] # 0-indexed",
"-Amax = 0",
"-for i in range(M):",
"- a = UVAB[i][2]",
"- if a > Amax:",
"- Amax = a",
"-limit = Amax * (N - 1)",... | false | 0.074505 | 0.093332 | 0.798277 | [
"s881803561",
"s075816437"
] |
u845620905 | p02669 | python | s706029686 | s586817321 | 327 | 272 | 11,000 | 10,904 | Accepted | Accepted | 16.82 | T = int(eval(input()))
while(T > 0):
N, A, B, C, D = list(map(int, input().split()))
dp = {}
def d(n):
if n == 0:
return 0
if n == 1:
return D
if n in dp:
return dp[n]
ret = min(
D * n,
D * abs(n - (n // 2) * 2) + A + d(n // 2),
D * abs(n - ((n+1) // 2) * 2) + A + d((n+1) // 2),
D * abs(n - (n // 3) * 3) + B + d(n // 3),
D * abs(n - ((n + 2) // 3) * 3) + B + d((n + 2) // 3),
D * abs(n - (n // 5) * 5) + C + d(n // 5),
D * abs(n - ((n + 4) // 5) * 5) + C + d((n + 4) // 5),
)
dp[n] = ret
return ret
print((d(N)))
T -= 1 | T = int(eval(input()))
while(T > 0):
N, A, B, C, D = list(map(int, input().split()))
memo = {}
def d(n):
if n == 0:
return 0
if n == 1:
return D
if n in memo:
return memo[n]
ret = n * D
if (n % 2 == 0):
ret = min(ret, A + d(n // 2))
else:
ret = min(ret, (n%2)*D + A + d(n // 2), (2-n%2)*D + A + d((n+(2-n%2))//2))
if (n % 3 == 0):
ret = min(ret, B + d(n // 3))
else:
ret = min(ret, (n%3)*D + B + d(n // 3), (3-n%3)*D + B + d((n+(3-n%3))//3))
if (n % 5 == 0):
ret = min(ret, C + d(n // 5))
else:
ret = min(ret, (n%5)*D + C + d(n // 5), (5-n%5)*D + C + d((n+(5-n%5))//5))
memo[n] = ret
return ret
print((d(N)))
T -= 1
| 30 | 39 | 738 | 875 | T = int(eval(input()))
while T > 0:
N, A, B, C, D = list(map(int, input().split()))
dp = {}
def d(n):
if n == 0:
return 0
if n == 1:
return D
if n in dp:
return dp[n]
ret = min(
D * n,
D * abs(n - (n // 2) * 2) + A + d(n // 2),
D * abs(n - ((n + 1) // 2) * 2) + A + d((n + 1) // 2),
D * abs(n - (n // 3) * 3) + B + d(n // 3),
D * abs(n - ((n + 2) // 3) * 3) + B + d((n + 2) // 3),
D * abs(n - (n // 5) * 5) + C + d(n // 5),
D * abs(n - ((n + 4) // 5) * 5) + C + d((n + 4) // 5),
)
dp[n] = ret
return ret
print((d(N)))
T -= 1
| T = int(eval(input()))
while T > 0:
N, A, B, C, D = list(map(int, input().split()))
memo = {}
def d(n):
if n == 0:
return 0
if n == 1:
return D
if n in memo:
return memo[n]
ret = n * D
if n % 2 == 0:
ret = min(ret, A + d(n // 2))
else:
ret = min(
ret,
(n % 2) * D + A + d(n // 2),
(2 - n % 2) * D + A + d((n + (2 - n % 2)) // 2),
)
if n % 3 == 0:
ret = min(ret, B + d(n // 3))
else:
ret = min(
ret,
(n % 3) * D + B + d(n // 3),
(3 - n % 3) * D + B + d((n + (3 - n % 3)) // 3),
)
if n % 5 == 0:
ret = min(ret, C + d(n // 5))
else:
ret = min(
ret,
(n % 5) * D + C + d(n // 5),
(5 - n % 5) * D + C + d((n + (5 - n % 5)) // 5),
)
memo[n] = ret
return ret
print((d(N)))
T -= 1
| false | 23.076923 | [
"- dp = {}",
"+ memo = {}",
"- if n in dp:",
"- return dp[n]",
"- ret = min(",
"- D * n,",
"- D * abs(n - (n // 2) * 2) + A + d(n // 2),",
"- D * abs(n - ((n + 1) // 2) * 2) + A + d((n + 1) // 2),",
"- D * abs(n - (n // 3) * ... | false | 0.242667 | 0.141505 | 1.714898 | [
"s706029686",
"s586817321"
] |
u994988729 | p03733 | python | s769614445 | s189766613 | 209 | 133 | 35,704 | 22,004 | Accepted | Accepted | 36.36 | import numpy as np
N, T = list(map(int, input().split()))
t = np.array(input().split(), dtype=int)
dt = np.diff(t)
dt = np.minimum(dt, T)
print((T + dt.sum())) | import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
N, T = list(map(int, input().split()))
time = list(map(int, input().split()))
ans = T
for x, y in zip(time[:-1], time[1:]):
ans += min(T, y - x)
print(ans) | 7 | 11 | 158 | 241 | import numpy as np
N, T = list(map(int, input().split()))
t = np.array(input().split(), dtype=int)
dt = np.diff(t)
dt = np.minimum(dt, T)
print((T + dt.sum()))
| import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
N, T = list(map(int, input().split()))
time = list(map(int, input().split()))
ans = T
for x, y in zip(time[:-1], time[1:]):
ans += min(T, y - x)
print(ans)
| false | 36.363636 | [
"-import numpy as np",
"+import sys",
"+input = sys.stdin.buffer.readline",
"+sys.setrecursionlimit(10**7)",
"-t = np.array(input().split(), dtype=int)",
"-dt = np.diff(t)",
"-dt = np.minimum(dt, T)",
"-print((T + dt.sum()))",
"+time = list(map(int, input().split()))",
"+ans = T",
"+for x, y in ... | false | 0.478323 | 0.043002 | 11.1233 | [
"s769614445",
"s189766613"
] |
u347640436 | p03450 | python | s768714312 | s059756406 | 1,358 | 1,044 | 39,100 | 39,088 | Accepted | Accepted | 23.12 | # Union Find 木
from sys import setrecursionlimit
def find(parent, diff_weight, i):
t = parent[i]
if t < 0:
return i
t = find(parent, diff_weight, t)
diff_weight[i] += diff_weight[parent[i]]
parent[i] = t
return t
def weight(parent, diff_weight, i):
find(parent, diff_weight, i)
return diff_weight[i]
def unite(parent, diff_weight, i, j, d):
d -= weight(parent, diff_weight, j)
d += weight(parent, diff_weight, i)
i = find(parent, diff_weight, i)
j = find(parent, diff_weight, j)
if i == j:
return
diff_weight[j] = d
parent[i] += parent[j]
parent[j] = i
setrecursionlimit(10 ** 6)
N, M = list(map(int, input().split()))
LRD = [tuple(map(int, input().split())) for _ in range(M)]
parent = [-1] * (N + 1)
diff_weight = [0] * (N + 1)
for L, R, D in LRD:
i = find(parent, diff_weight, L)
j = find(parent, diff_weight, R)
if i != j:
unite(parent, diff_weight, L, R, D)
else:
if weight(parent, diff_weight, L) + D != weight(parent, diff_weight, R):
print('No')
exit()
print('Yes')
| # Union Find 木
from sys import setrecursionlimit, stdin
def find(parent, diff_weight, i):
t = parent[i]
if t < 0:
return i
t = find(parent, diff_weight, t)
diff_weight[i] += diff_weight[parent[i]]
parent[i] = t
return t
def weight(parent, diff_weight, i):
find(parent, diff_weight, i)
return diff_weight[i]
def unite(parent, diff_weight, i, j, d):
d -= weight(parent, diff_weight, j)
d += weight(parent, diff_weight, i)
i = find(parent, diff_weight, i)
j = find(parent, diff_weight, j)
if i == j:
return
diff_weight[j] = d
parent[i] += parent[j]
parent[j] = i
setrecursionlimit(10 ** 6)
N, M = list(map(int, stdin.readline().split()))
LRD = [tuple(map(int, stdin.readline().split())) for _ in range(M)]
parent = [-1] * (N + 1)
diff_weight = [0] * (N + 1)
for L, R, D in LRD:
i = find(parent, diff_weight, L)
j = find(parent, diff_weight, R)
if i != j:
unite(parent, diff_weight, L, R, D)
else:
if weight(parent, diff_weight, L) + D != weight(parent, diff_weight, R):
print('No')
exit()
print('Yes')
| 48 | 48 | 1,161 | 1,186 | # Union Find 木
from sys import setrecursionlimit
def find(parent, diff_weight, i):
t = parent[i]
if t < 0:
return i
t = find(parent, diff_weight, t)
diff_weight[i] += diff_weight[parent[i]]
parent[i] = t
return t
def weight(parent, diff_weight, i):
find(parent, diff_weight, i)
return diff_weight[i]
def unite(parent, diff_weight, i, j, d):
d -= weight(parent, diff_weight, j)
d += weight(parent, diff_weight, i)
i = find(parent, diff_weight, i)
j = find(parent, diff_weight, j)
if i == j:
return
diff_weight[j] = d
parent[i] += parent[j]
parent[j] = i
setrecursionlimit(10**6)
N, M = list(map(int, input().split()))
LRD = [tuple(map(int, input().split())) for _ in range(M)]
parent = [-1] * (N + 1)
diff_weight = [0] * (N + 1)
for L, R, D in LRD:
i = find(parent, diff_weight, L)
j = find(parent, diff_weight, R)
if i != j:
unite(parent, diff_weight, L, R, D)
else:
if weight(parent, diff_weight, L) + D != weight(parent, diff_weight, R):
print("No")
exit()
print("Yes")
| # Union Find 木
from sys import setrecursionlimit, stdin
def find(parent, diff_weight, i):
t = parent[i]
if t < 0:
return i
t = find(parent, diff_weight, t)
diff_weight[i] += diff_weight[parent[i]]
parent[i] = t
return t
def weight(parent, diff_weight, i):
find(parent, diff_weight, i)
return diff_weight[i]
def unite(parent, diff_weight, i, j, d):
d -= weight(parent, diff_weight, j)
d += weight(parent, diff_weight, i)
i = find(parent, diff_weight, i)
j = find(parent, diff_weight, j)
if i == j:
return
diff_weight[j] = d
parent[i] += parent[j]
parent[j] = i
setrecursionlimit(10**6)
N, M = list(map(int, stdin.readline().split()))
LRD = [tuple(map(int, stdin.readline().split())) for _ in range(M)]
parent = [-1] * (N + 1)
diff_weight = [0] * (N + 1)
for L, R, D in LRD:
i = find(parent, diff_weight, L)
j = find(parent, diff_weight, R)
if i != j:
unite(parent, diff_weight, L, R, D)
else:
if weight(parent, diff_weight, L) + D != weight(parent, diff_weight, R):
print("No")
exit()
print("Yes")
| false | 0 | [
"-from sys import setrecursionlimit",
"+from sys import setrecursionlimit, stdin",
"-N, M = list(map(int, input().split()))",
"-LRD = [tuple(map(int, input().split())) for _ in range(M)]",
"+N, M = list(map(int, stdin.readline().split()))",
"+LRD = [tuple(map(int, stdin.readline().split())) for _ in range... | false | 0.095799 | 0.114508 | 0.836616 | [
"s768714312",
"s059756406"
] |
u922449550 | p02920 | python | s298282873 | s655424517 | 1,893 | 1,434 | 32,960 | 34,676 | Accepted | Accepted | 24.25 | N = int(eval(input()))
N2 = 2**N
S = list(map(int, input().split()))
S.sort(reverse=True)
slimes = [S[0]]
S[0] = float('inf')
num = 1
min_idx = 1
for i in range(N):
slimes.sort()
n = num
idx = min_idx
is_continuous = True
while n and idx<=N2-1:
if S[idx] < slimes[n-1]:
slimes.append(S[idx])
S[idx] = float('inf')
idx += 1
n -= 1
min_idx += is_continuous
else:
if S[idx] < float('inf'):
is_continuous = False
idx += 1
min_idx += is_continuous
if n:
print('No')
quit()
num *= 2
print('Yes') | N = int(eval(input()))
N2 = 2**N
S = list(map(int, input().split()))
S.sort(reverse=True)
slimes = [S[0]]
INF = S[0] + 1
S[0] = INF
num = 1
min_idx = 1
for i in range(N):
slimes.sort()
n = num
idx = min_idx
is_continuous = True
while n and idx<=N2-1:
if S[idx] < slimes[n-1]:
slimes.append(S[idx])
S[idx] = INF
idx += 1
n -= 1
min_idx += is_continuous
else:
if S[idx] < INF:
is_continuous = False
idx += 1
min_idx += is_continuous
if n:
print('No')
quit()
num *= 2
print('Yes') | 34 | 35 | 610 | 599 | N = int(eval(input()))
N2 = 2**N
S = list(map(int, input().split()))
S.sort(reverse=True)
slimes = [S[0]]
S[0] = float("inf")
num = 1
min_idx = 1
for i in range(N):
slimes.sort()
n = num
idx = min_idx
is_continuous = True
while n and idx <= N2 - 1:
if S[idx] < slimes[n - 1]:
slimes.append(S[idx])
S[idx] = float("inf")
idx += 1
n -= 1
min_idx += is_continuous
else:
if S[idx] < float("inf"):
is_continuous = False
idx += 1
min_idx += is_continuous
if n:
print("No")
quit()
num *= 2
print("Yes")
| N = int(eval(input()))
N2 = 2**N
S = list(map(int, input().split()))
S.sort(reverse=True)
slimes = [S[0]]
INF = S[0] + 1
S[0] = INF
num = 1
min_idx = 1
for i in range(N):
slimes.sort()
n = num
idx = min_idx
is_continuous = True
while n and idx <= N2 - 1:
if S[idx] < slimes[n - 1]:
slimes.append(S[idx])
S[idx] = INF
idx += 1
n -= 1
min_idx += is_continuous
else:
if S[idx] < INF:
is_continuous = False
idx += 1
min_idx += is_continuous
if n:
print("No")
quit()
num *= 2
print("Yes")
| false | 2.857143 | [
"-S[0] = float(\"inf\")",
"+INF = S[0] + 1",
"+S[0] = INF",
"- S[idx] = float(\"inf\")",
"+ S[idx] = INF",
"- if S[idx] < float(\"inf\"):",
"+ if S[idx] < INF:"
] | false | 0.047326 | 0.008563 | 5.526905 | [
"s298282873",
"s655424517"
] |
u867848444 | p03385 | python | s411686499 | s706462004 | 20 | 17 | 3,064 | 3,064 | Accepted | Accepted | 15 | s=list(eval(input()))
s.sort()
print(('Yes' if s==['a','b','c'] else 'No')) | s = eval(input())
print(('Yes' if len(set(s)) == 3 else 'No')) | 3 | 2 | 69 | 55 | s = list(eval(input()))
s.sort()
print(("Yes" if s == ["a", "b", "c"] else "No"))
| s = eval(input())
print(("Yes" if len(set(s)) == 3 else "No"))
| false | 33.333333 | [
"-s = list(eval(input()))",
"-s.sort()",
"-print((\"Yes\" if s == [\"a\", \"b\", \"c\"] else \"No\"))",
"+s = eval(input())",
"+print((\"Yes\" if len(set(s)) == 3 else \"No\"))"
] | false | 0.051336 | 0.052235 | 0.982788 | [
"s411686499",
"s706462004"
] |
u892916452 | p02393 | python | s900107447 | s961903277 | 20 | 10 | 6,332 | 6,432 | Accepted | Accepted | 50 | s = input()
nlist = list(map(int, s.split()))
a, b, c= nlist
if a<b:
if b<c:
print('%d %d %d' %(a, b, c))
elif c<a:
print('%d %d %d' %(c, a, b))
else:
print('%d %d %d' %(a, c, b))
else:
if a<c:
print('%d %d %d' %(b, a, c))
elif c<b:
print('%d %d %d' %(c, b, a))
else:
print('%d %d %d' %(b, c, a)) | s = input()
nlist = list(map(int, s.split()))
a, b, c= nlist
#print nlist.sort()
ls = sorted(nlist)
print('%d %d %d' %(ls[0], ls[1], ls[2])) | 18 | 6 | 386 | 143 | s = input()
nlist = list(map(int, s.split()))
a, b, c = nlist
if a < b:
if b < c:
print("%d %d %d" % (a, b, c))
elif c < a:
print("%d %d %d" % (c, a, b))
else:
print("%d %d %d" % (a, c, b))
else:
if a < c:
print("%d %d %d" % (b, a, c))
elif c < b:
print("%d %d %d" % (c, b, a))
else:
print("%d %d %d" % (b, c, a))
| s = input()
nlist = list(map(int, s.split()))
a, b, c = nlist
# print nlist.sort()
ls = sorted(nlist)
print("%d %d %d" % (ls[0], ls[1], ls[2]))
| false | 66.666667 | [
"-if a < b:",
"- if b < c:",
"- print(\"%d %d %d\" % (a, b, c))",
"- elif c < a:",
"- print(\"%d %d %d\" % (c, a, b))",
"- else:",
"- print(\"%d %d %d\" % (a, c, b))",
"-else:",
"- if a < c:",
"- print(\"%d %d %d\" % (b, a, c))",
"- elif c < b:",
"- ... | false | 0.044429 | 0.047868 | 0.928148 | [
"s900107447",
"s961903277"
] |
u737758066 | p02682 | python | s157183025 | s913548050 | 23 | 20 | 9,184 | 9,096 | Accepted | Accepted | 13.04 | a, b, c, k = list(map(int, input().split()))
if k <= a:
print((k*1))
elif k <= a + b:
print((1*a))
elif k <= a + b + c:
print((1*a+(k-a-b)*-1))
else:
print((1*1+c*-1))
| a, b, c, k = list(map(int, input().split()))
if a >= k:
print(k)
else:
print((a-((k-a)-b)))
| 10 | 6 | 180 | 98 | a, b, c, k = list(map(int, input().split()))
if k <= a:
print((k * 1))
elif k <= a + b:
print((1 * a))
elif k <= a + b + c:
print((1 * a + (k - a - b) * -1))
else:
print((1 * 1 + c * -1))
| a, b, c, k = list(map(int, input().split()))
if a >= k:
print(k)
else:
print((a - ((k - a) - b)))
| false | 40 | [
"-if k <= a:",
"- print((k * 1))",
"-elif k <= a + b:",
"- print((1 * a))",
"-elif k <= a + b + c:",
"- print((1 * a + (k - a - b) * -1))",
"+if a >= k:",
"+ print(k)",
"- print((1 * 1 + c * -1))",
"+ print((a - ((k - a) - b)))"
] | false | 0.040163 | 0.043093 | 0.932022 | [
"s157183025",
"s913548050"
] |
u082657995 | p02345 | python | s081137028 | s654271858 | 1,630 | 980 | 9,052 | 29,244 | Accepted | Accepted | 39.88 | # https://atcoder.jp/contests/abc014/submissions/3935971
class SegmentTree(object):
__slots__ = ["elem_size", "tree", "default", "op"]
def __init__(self, a: list, default: int, op):
from math import ceil, log
real_size = len(a)
self.elem_size = elem_size = 1 << ceil(log(real_size, 2))
self.tree = tree = [default] * (elem_size * 2)
tree[elem_size:elem_size + real_size] = a
self.default = default
self.op = op
for i in range(elem_size - 1, 0, -1):
tree[i] = op(tree[i << 1], tree[(i << 1) + 1])
def get_value(self, x: int, y: int) -> int:
l, r = x + self.elem_size, y + self.elem_size
tree, result, op = self.tree, self.default, self.op
while l < r:
if l & 1:
result = op(tree[l], result)
l += 1
if r & 1:
r -= 1
result = op(tree[r], result)
l, r = l >> 1, r >> 1
return result
def set_value(self, i: int, value: int) -> None:
k = self.elem_size + i
self.tree[k] = value
self.update(k)
def update(self, i: int) -> None:
op, tree = self.op, self.tree
while i > 1:
i >>= 1
tree[i] = op(tree[i << 1], tree[(i << 1) + 1])
n, q = list(map(int, input().split()))
seg = SegmentTree([(1<<31)-1]*n, (1<<31)-1, min)
for _ in range(q):
c, x, y = list(map(int, input().split()))
if c == 0:
seg.set_value(x, y)
else:
print((seg.get_value(x, y+1)))
| class Rmq:
# 平方分割
# 値を変更すると元のリストの値も書き換わる
# 検証: http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=3990652#1
def __init__(self, a, sqrt_n=150, inf=(1<<31)-1):
self.sqrt_n = sqrt_n
if hasattr(a, "__iter__"):
from itertools import zip_longest
self.n = len(a)
self.layer0 = [min(values) for values in zip_longest(*[iter(a)]*sqrt_n, fillvalue=inf)]
self.layer1 = a
elif isinstance(a, int):
self.n = a
self.layer0 = [inf] * ((a - 1) // sqrt_n + 1)
self.layer1 = [inf] * a
else:
raise TypeError
def get_min(self, l, r):
sqrt_n = self.sqrt_n
parent_l, parent_r = l//sqrt_n+1, (r-1)//sqrt_n
if parent_l < parent_r:
return min(min(self.layer0[parent_l:parent_r]),
min(self.layer1[l:parent_l*sqrt_n]),
min(self.layer1[parent_r*sqrt_n:r]))
else:
return min(self.layer1[l:r])
def set_value(self, idx, val):
self.layer1[idx] = val
idx0 = idx // self.sqrt_n
idx1 = idx0 * self.sqrt_n
self.layer0[idx0] = min(self.layer1[idx1:idx1+self.sqrt_n])
def chmin(self, idx, val):
if self.layer1[idx] > val:
self.layer1[idx] = val
idx //= self.sqrt_n
self.layer0[idx] = min(self.layer0[idx], val)
def debug(self):
print(("layer0=", self.layer0))
print(("layer1=", self.layer1))
def __getitem__(self, item):
return self.layer1[item]
def __setitem__(self, key, value):
self.set_value(key, value)
def main():
N, Q, *queries = list(map(int, open(0).read().split()))
seg = Rmq(N)
Ans = []
for com, x, y in zip(*[iter(queries)]*3):
if com==0:
seg.set_value(x, y)
else:
Ans.append(seg.get_min(x, y+1))
print(("\n".join(map(str, Ans))))
main()
| 50 | 65 | 1,599 | 2,014 | # https://atcoder.jp/contests/abc014/submissions/3935971
class SegmentTree(object):
__slots__ = ["elem_size", "tree", "default", "op"]
def __init__(self, a: list, default: int, op):
from math import ceil, log
real_size = len(a)
self.elem_size = elem_size = 1 << ceil(log(real_size, 2))
self.tree = tree = [default] * (elem_size * 2)
tree[elem_size : elem_size + real_size] = a
self.default = default
self.op = op
for i in range(elem_size - 1, 0, -1):
tree[i] = op(tree[i << 1], tree[(i << 1) + 1])
def get_value(self, x: int, y: int) -> int:
l, r = x + self.elem_size, y + self.elem_size
tree, result, op = self.tree, self.default, self.op
while l < r:
if l & 1:
result = op(tree[l], result)
l += 1
if r & 1:
r -= 1
result = op(tree[r], result)
l, r = l >> 1, r >> 1
return result
def set_value(self, i: int, value: int) -> None:
k = self.elem_size + i
self.tree[k] = value
self.update(k)
def update(self, i: int) -> None:
op, tree = self.op, self.tree
while i > 1:
i >>= 1
tree[i] = op(tree[i << 1], tree[(i << 1) + 1])
n, q = list(map(int, input().split()))
seg = SegmentTree([(1 << 31) - 1] * n, (1 << 31) - 1, min)
for _ in range(q):
c, x, y = list(map(int, input().split()))
if c == 0:
seg.set_value(x, y)
else:
print((seg.get_value(x, y + 1)))
| class Rmq:
# 平方分割
# 値を変更すると元のリストの値も書き換わる
# 検証: http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=3990652#1
def __init__(self, a, sqrt_n=150, inf=(1 << 31) - 1):
self.sqrt_n = sqrt_n
if hasattr(a, "__iter__"):
from itertools import zip_longest
self.n = len(a)
self.layer0 = [
min(values)
for values in zip_longest(*[iter(a)] * sqrt_n, fillvalue=inf)
]
self.layer1 = a
elif isinstance(a, int):
self.n = a
self.layer0 = [inf] * ((a - 1) // sqrt_n + 1)
self.layer1 = [inf] * a
else:
raise TypeError
def get_min(self, l, r):
sqrt_n = self.sqrt_n
parent_l, parent_r = l // sqrt_n + 1, (r - 1) // sqrt_n
if parent_l < parent_r:
return min(
min(self.layer0[parent_l:parent_r]),
min(self.layer1[l : parent_l * sqrt_n]),
min(self.layer1[parent_r * sqrt_n : r]),
)
else:
return min(self.layer1[l:r])
def set_value(self, idx, val):
self.layer1[idx] = val
idx0 = idx // self.sqrt_n
idx1 = idx0 * self.sqrt_n
self.layer0[idx0] = min(self.layer1[idx1 : idx1 + self.sqrt_n])
def chmin(self, idx, val):
if self.layer1[idx] > val:
self.layer1[idx] = val
idx //= self.sqrt_n
self.layer0[idx] = min(self.layer0[idx], val)
def debug(self):
print(("layer0=", self.layer0))
print(("layer1=", self.layer1))
def __getitem__(self, item):
return self.layer1[item]
def __setitem__(self, key, value):
self.set_value(key, value)
def main():
N, Q, *queries = list(map(int, open(0).read().split()))
seg = Rmq(N)
Ans = []
for com, x, y in zip(*[iter(queries)] * 3):
if com == 0:
seg.set_value(x, y)
else:
Ans.append(seg.get_min(x, y + 1))
print(("\n".join(map(str, Ans))))
main()
| false | 23.076923 | [
"-# https://atcoder.jp/contests/abc014/submissions/3935971",
"-class SegmentTree(object):",
"- __slots__ = [\"elem_size\", \"tree\", \"default\", \"op\"]",
"+class Rmq:",
"+ # 平方分割",
"+ # 値を変更すると元のリストの値も書き換わる",
"+ # 検証: http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=3990652#1",
"+ ... | false | 0.045641 | 0.040684 | 1.121847 | [
"s081137028",
"s654271858"
] |
u666772276 | p02586 | python | s032582979 | s433691153 | 546 | 277 | 132,908 | 128,724 | Accepted | Accepted | 49.27 | import sys
inp = [int(x) for x in sys.stdin.read().split()]; ii = 0
rows, cols, k = inp[ii:ii+3]; ii += 3
items = [[] for _ in range(rows+1)]
best = [0]*(cols+1)
for _ in range(k):
r, c, v = inp[ii:ii+3]; ii += 3
items[r].append([c, v])
for i in range(rows+1):
items[i].sort()
ans = 0
for r in range(1, rows+1):
dp = []
best1, best2 = 0, 0
Row = items[r]
for c, v in Row:
v1 = best[c] + v
v2 = best1 + v
v3 = best2 + v
V = v1
if V < v2:
V = v2
if V < v3:
V = v3
dp.append(V)
if v1 > best1:
best1 = v1
if v2 > best2:
best2 = v2
if ans < V:
ans = V
for j in range(len(dp)):
if best[Row[j][0]] < dp[j]:
best[Row[j][0]] = dp[j]
for j in range(2, cols+1):
if best[j] < best[j-1]:
best[j] = best[j-1]
print(ans)
| import sys
inp = [int(x) for x in sys.stdin.read().split()]; ii = 0
shift = int(10**9 + 1)
rows, cols, k = inp[ii:ii+3]; ii += 3
items = [[] for _ in range(rows+1)]
best = [0]*(cols+1)
for _ in range(k):
r, c, v = inp[ii:ii+3]; ii += 3
items[r].append(c*shift+v)
for i in range(rows+1):
items[i].sort()
ans = 0
for r in range(1, rows+1):
dp = []
best1, best2 = 0, 0
Row = items[r]
for X in Row:
c, v = X//shift, X%shift
v1 = best[c] + v
v2 = best1 + v
v3 = best2 + v
V = v1
if V < v2:
V = v2
if V < v3:
V = v3
dp.append(V)
if v1 > best1:
best1 = v1
if v2 > best2:
best2 = v2
if ans < V:
ans = V
for j in range(len(dp)):
c = Row[j]//shift
if best[c] < dp[j]:
best[c] = dp[j]
for j in range(2, cols+1):
if best[j] < best[j-1]:
best[j] = best[j-1]
print(ans)
| 40 | 42 | 801 | 856 | import sys
inp = [int(x) for x in sys.stdin.read().split()]
ii = 0
rows, cols, k = inp[ii : ii + 3]
ii += 3
items = [[] for _ in range(rows + 1)]
best = [0] * (cols + 1)
for _ in range(k):
r, c, v = inp[ii : ii + 3]
ii += 3
items[r].append([c, v])
for i in range(rows + 1):
items[i].sort()
ans = 0
for r in range(1, rows + 1):
dp = []
best1, best2 = 0, 0
Row = items[r]
for c, v in Row:
v1 = best[c] + v
v2 = best1 + v
v3 = best2 + v
V = v1
if V < v2:
V = v2
if V < v3:
V = v3
dp.append(V)
if v1 > best1:
best1 = v1
if v2 > best2:
best2 = v2
if ans < V:
ans = V
for j in range(len(dp)):
if best[Row[j][0]] < dp[j]:
best[Row[j][0]] = dp[j]
for j in range(2, cols + 1):
if best[j] < best[j - 1]:
best[j] = best[j - 1]
print(ans)
| import sys
inp = [int(x) for x in sys.stdin.read().split()]
ii = 0
shift = int(10**9 + 1)
rows, cols, k = inp[ii : ii + 3]
ii += 3
items = [[] for _ in range(rows + 1)]
best = [0] * (cols + 1)
for _ in range(k):
r, c, v = inp[ii : ii + 3]
ii += 3
items[r].append(c * shift + v)
for i in range(rows + 1):
items[i].sort()
ans = 0
for r in range(1, rows + 1):
dp = []
best1, best2 = 0, 0
Row = items[r]
for X in Row:
c, v = X // shift, X % shift
v1 = best[c] + v
v2 = best1 + v
v3 = best2 + v
V = v1
if V < v2:
V = v2
if V < v3:
V = v3
dp.append(V)
if v1 > best1:
best1 = v1
if v2 > best2:
best2 = v2
if ans < V:
ans = V
for j in range(len(dp)):
c = Row[j] // shift
if best[c] < dp[j]:
best[c] = dp[j]
for j in range(2, cols + 1):
if best[j] < best[j - 1]:
best[j] = best[j - 1]
print(ans)
| false | 4.761905 | [
"+shift = int(10**9 + 1)",
"- items[r].append([c, v])",
"+ items[r].append(c * shift + v)",
"- for c, v in Row:",
"+ for X in Row:",
"+ c, v = X // shift, X % shift",
"- if best[Row[j][0]] < dp[j]:",
"- best[Row[j][0]] = dp[j]",
"+ c = Row[j] // shift",
... | false | 0.037157 | 0.033281 | 1.116454 | [
"s032582979",
"s433691153"
] |
u738898077 | p02882 | python | s158334537 | s359113463 | 20 | 18 | 3,060 | 3,060 | Accepted | Accepted | 10 | import math
a,b,x = list(map(int,input().split()))
x /= a
if x >= a*b/2:
print((math.atan(2/(a**2)*(a*b-x))/math.pi*180))
else:
print((90-(math.atan((2*x/b**2))/math.pi*180))) | import math
p = 3.14159
a,b,x = list(map(int,input().split()))
x /= a
if x >= a*b/2:
print((math.atan(2/(a**2)*(a*b-x))/p*180))
else:
print((90-(math.atan((2*x/b**2))/p*180))) | 7 | 8 | 180 | 181 | import math
a, b, x = list(map(int, input().split()))
x /= a
if x >= a * b / 2:
print((math.atan(2 / (a**2) * (a * b - x)) / math.pi * 180))
else:
print((90 - (math.atan((2 * x / b**2)) / math.pi * 180)))
| import math
p = 3.14159
a, b, x = list(map(int, input().split()))
x /= a
if x >= a * b / 2:
print((math.atan(2 / (a**2) * (a * b - x)) / p * 180))
else:
print((90 - (math.atan((2 * x / b**2)) / p * 180)))
| false | 12.5 | [
"+p = 3.14159",
"- print((math.atan(2 / (a**2) * (a * b - x)) / math.pi * 180))",
"+ print((math.atan(2 / (a**2) * (a * b - x)) / p * 180))",
"- print((90 - (math.atan((2 * x / b**2)) / math.pi * 180)))",
"+ print((90 - (math.atan((2 * x / b**2)) / p * 180)))"
] | false | 0.090012 | 0.040839 | 2.204082 | [
"s158334537",
"s359113463"
] |
u779293207 | p03456 | python | s118368092 | s369513811 | 83 | 18 | 2,940 | 2,940 | Accepted | Accepted | 78.31 | a,b=list(map(int,input().split()))
for i in range (1,100100):
if 1<=b<=9:
if 10*a+b==i**2:
print('Yes')
exit()
if 10<=b<=99:
if 100*a+b==i**2:
print('Yes')
exit()
if b==100:
if 1000*a+b==i**2:
print('Yes')
exit()
print('No')
| a,b=input().split()
c=a+b
for i in range(1,1000):
if int(c)==i**2:
print('Yes')
exit()
print('No') | 17 | 7 | 294 | 114 | a, b = list(map(int, input().split()))
for i in range(1, 100100):
if 1 <= b <= 9:
if 10 * a + b == i**2:
print("Yes")
exit()
if 10 <= b <= 99:
if 100 * a + b == i**2:
print("Yes")
exit()
if b == 100:
if 1000 * a + b == i**2:
print("Yes")
exit()
print("No")
| a, b = input().split()
c = a + b
for i in range(1, 1000):
if int(c) == i**2:
print("Yes")
exit()
print("No")
| false | 58.823529 | [
"-a, b = list(map(int, input().split()))",
"-for i in range(1, 100100):",
"- if 1 <= b <= 9:",
"- if 10 * a + b == i**2:",
"- print(\"Yes\")",
"- exit()",
"- if 10 <= b <= 99:",
"- if 100 * a + b == i**2:",
"- print(\"Yes\")",
"- exit... | false | 0.143109 | 0.036541 | 3.91635 | [
"s118368092",
"s369513811"
] |
u077291787 | p04040 | python | s006720902 | s284472014 | 1,552 | 198 | 10,868 | 18,804 | Accepted | Accepted | 87.24 | """
fast way to compute a combination using inverse factorials
O(N) to construct tables -> O(1) to compute each combination
"""
def get_factorials(limit: int, MOD: int) -> list:
"""Compute a mod table of factorials (1-indexed)."""
factorials = [0] * (limit + 1)
factorials[0] = 1
x = 1
for i in range(1, limit + 1):
x = (x * i) % MOD
factorials[i] = x
return factorials
def mod_comb_with_pow(n: int, k: int, MOD: int) -> int:
"""Compute nCr % MOD using pow()."""
return fact[n] * pow(fact[k], MOD - 2, MOD) * pow(fact[n - k], MOD - 2, MOD) % MOD
# e.g. ARC058D - いろはちゃんとマス目 / Iroha and a Grid (ABC042D)
def main():
global fact, inv
H, W, A, B = list(map(int, input().split()))
MOD = 10 ** 9 + 7
fact = get_factorials(H + W, MOD)
x, y, a = H - A - 1, W + A - 2, A - 1 # fixed variables
f = lambda i: mod_comb_with_pow(x + i, i, MOD) * mod_comb_with_pow(y - i, a, MOD)
ans = sum(f(i) for i in range(B, W)) % MOD
print(ans)
if __name__ == "__main__":
main()
| """
fast way to compute a combination using inverse factorials
O(N) to construct tables -> O(1) to compute each combination
"""
def get_fact_and_inv(limit: int, MOD: int) -> tuple:
"""Compute mod tables of factorials and inverse factorials (1-indexed)."""
factorials = [0] * (limit + 1)
factorials[0] = 1
x = 1
for i in range(1, limit + 1):
x = (x * i) % MOD
factorials[i] = x
inverse_factorials = [1] * (limit + 1)
inverse_factorials[-1] = pow(factorials[-1], MOD - 2, MOD)
x = inverse_factorials[-1]
for i in range(limit - 1, 0, -1):
x = (x * (i + 1)) % MOD
inverse_factorials[i] = x
return factorials, inverse_factorials
def mod_comb(n: int, r: int, MOD: int) -> int:
"""Compute nCr % MOD using a mod table of inverse factorials."""
return fact[n] * inv[r] * inv[n - r] % MOD
# e.g. ARC058D - いろはちゃんとマス目 / Iroha and a Grid (ABC042D)
def main():
global fact, inv
H, W, A, B = list(map(int, input().split()))
MOD = 10 ** 9 + 7
fact, inv = get_fact_and_inv(H + W, MOD)
x, y, a = H - A - 1, W + A - 2, A - 1 # fixed variables
f = lambda i: mod_comb(x + i, i, MOD) * mod_comb(y - i, a, MOD) % MOD
ans = sum(f(i) for i in range(B, W)) % MOD
print(ans)
if __name__ == "__main__":
main()
| 36 | 43 | 1,077 | 1,345 | """
fast way to compute a combination using inverse factorials
O(N) to construct tables -> O(1) to compute each combination
"""
def get_factorials(limit: int, MOD: int) -> list:
"""Compute a mod table of factorials (1-indexed)."""
factorials = [0] * (limit + 1)
factorials[0] = 1
x = 1
for i in range(1, limit + 1):
x = (x * i) % MOD
factorials[i] = x
return factorials
def mod_comb_with_pow(n: int, k: int, MOD: int) -> int:
"""Compute nCr % MOD using pow()."""
return fact[n] * pow(fact[k], MOD - 2, MOD) * pow(fact[n - k], MOD - 2, MOD) % MOD
# e.g. ARC058D - いろはちゃんとマス目 / Iroha and a Grid (ABC042D)
def main():
global fact, inv
H, W, A, B = list(map(int, input().split()))
MOD = 10**9 + 7
fact = get_factorials(H + W, MOD)
x, y, a = H - A - 1, W + A - 2, A - 1 # fixed variables
f = lambda i: mod_comb_with_pow(x + i, i, MOD) * mod_comb_with_pow(y - i, a, MOD)
ans = sum(f(i) for i in range(B, W)) % MOD
print(ans)
if __name__ == "__main__":
main()
| """
fast way to compute a combination using inverse factorials
O(N) to construct tables -> O(1) to compute each combination
"""
def get_fact_and_inv(limit: int, MOD: int) -> tuple:
"""Compute mod tables of factorials and inverse factorials (1-indexed)."""
factorials = [0] * (limit + 1)
factorials[0] = 1
x = 1
for i in range(1, limit + 1):
x = (x * i) % MOD
factorials[i] = x
inverse_factorials = [1] * (limit + 1)
inverse_factorials[-1] = pow(factorials[-1], MOD - 2, MOD)
x = inverse_factorials[-1]
for i in range(limit - 1, 0, -1):
x = (x * (i + 1)) % MOD
inverse_factorials[i] = x
return factorials, inverse_factorials
def mod_comb(n: int, r: int, MOD: int) -> int:
"""Compute nCr % MOD using a mod table of inverse factorials."""
return fact[n] * inv[r] * inv[n - r] % MOD
# e.g. ARC058D - いろはちゃんとマス目 / Iroha and a Grid (ABC042D)
def main():
global fact, inv
H, W, A, B = list(map(int, input().split()))
MOD = 10**9 + 7
fact, inv = get_fact_and_inv(H + W, MOD)
x, y, a = H - A - 1, W + A - 2, A - 1 # fixed variables
f = lambda i: mod_comb(x + i, i, MOD) * mod_comb(y - i, a, MOD) % MOD
ans = sum(f(i) for i in range(B, W)) % MOD
print(ans)
if __name__ == "__main__":
main()
| false | 16.27907 | [
"-def get_factorials(limit: int, MOD: int) -> list:",
"- \"\"\"Compute a mod table of factorials (1-indexed).\"\"\"",
"+def get_fact_and_inv(limit: int, MOD: int) -> tuple:",
"+ \"\"\"Compute mod tables of factorials and inverse factorials (1-indexed).\"\"\"",
"- return factorials",
"+ inverse... | false | 0.274588 | 0.097349 | 2.820658 | [
"s006720902",
"s284472014"
] |
u343977188 | p02630 | python | s374949188 | s213660134 | 427 | 248 | 84,620 | 28,368 | Accepted | Accepted | 41.92 | def main():
N=int(eval(input()))
A=list(map(int,input().split()))
s=sum(A)
Q=int(eval(input()))
d=[0]*(10**5 +1)#各数字の個数
for i in A:
d[i]+=1
for i in range(Q):
B,C=list(map(int,input().split()))
s += (C-B)*d[B]
print(s)
d[C]+=d[B]
d[B]=0
if __name__ == "__main__":
main() | def main():
N=int(eval(input()))
A=list(map(int,input().split()))
s=sum(A)
Q=int(eval(input()))
d=[0]*(10**5 +1)#各数字の個数
ans=[]
for i in A:
d[i]+=1
for i in range(Q):
B,C=list(map(int,input().split()))
s += (C-B)*d[B]
ans.append(s)
d[C]+=d[B]
d[B]=0
print(("\n".join(map(str, ans))))
if __name__ == "__main__":
main() | 18 | 21 | 313 | 369 | def main():
N = int(eval(input()))
A = list(map(int, input().split()))
s = sum(A)
Q = int(eval(input()))
d = [0] * (10**5 + 1) # 各数字の個数
for i in A:
d[i] += 1
for i in range(Q):
B, C = list(map(int, input().split()))
s += (C - B) * d[B]
print(s)
d[C] += d[B]
d[B] = 0
if __name__ == "__main__":
main()
| def main():
N = int(eval(input()))
A = list(map(int, input().split()))
s = sum(A)
Q = int(eval(input()))
d = [0] * (10**5 + 1) # 各数字の個数
ans = []
for i in A:
d[i] += 1
for i in range(Q):
B, C = list(map(int, input().split()))
s += (C - B) * d[B]
ans.append(s)
d[C] += d[B]
d[B] = 0
print(("\n".join(map(str, ans))))
if __name__ == "__main__":
main()
| false | 14.285714 | [
"+ ans = []",
"- print(s)",
"+ ans.append(s)",
"+ print((\"\\n\".join(map(str, ans))))"
] | false | 0.036263 | 0.092326 | 0.392773 | [
"s374949188",
"s213660134"
] |
u371467115 | p04044 | python | s483194133 | s062345097 | 21 | 17 | 3,060 | 3,060 | Accepted | Accepted | 19.05 | N,L=list(map(int,input().split()))
s=[eval(input()) for i in range(N)]
s=sorted(s)
print(("".join(s)))
| n,l=list(map(int,input().split()))
s=[eval(input()) for i in range(n)]
print(("".join(sorted(s))))
| 5 | 3 | 94 | 87 | N, L = list(map(int, input().split()))
s = [eval(input()) for i in range(N)]
s = sorted(s)
print(("".join(s)))
| n, l = list(map(int, input().split()))
s = [eval(input()) for i in range(n)]
print(("".join(sorted(s))))
| false | 40 | [
"-N, L = list(map(int, input().split()))",
"-s = [eval(input()) for i in range(N)]",
"-s = sorted(s)",
"-print((\"\".join(s)))",
"+n, l = list(map(int, input().split()))",
"+s = [eval(input()) for i in range(n)]",
"+print((\"\".join(sorted(s))))"
] | false | 0.070007 | 0.042455 | 1.648965 | [
"s483194133",
"s062345097"
] |
u745087332 | p03798 | python | s133399455 | s924110782 | 335 | 178 | 3,700 | 8,328 | Accepted | Accepted | 46.87 | # coding:utf-8
import sys
# from collections import Counter, defaultdict
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
n = II()
s = SI()
s = s[-1] + s + s[0]
P = ('00', '01', '10', '11') # 0: S, 1: W
for p in P:
for i in range(1, n):
# print(i, p[-1], s[i])
if s[i + 1] == 'o':
p += p[-2] if p[-1] == '0' else str(int(p[-2]) ^ 1)
else:
p += p[-2] if p[-1] == '1' else str(int(p[-2]) ^ 1)
else:
if s[1] == 'o':
tmp = p[1] if p[0] == '0' else str(int(p[1]) ^ 1)
else:
tmp = p[1] if p[0] == '1' else str(int(p[1]) ^ 1)
p = tmp + p
if p[1] == p[-1] and p[-2] == p[0]:
ans = ''
for a in p[1:-1]: ans += 'S' if a == '0' else 'W'
print(ans)
exit()
print((-1))
| # coding:utf-8
import sys
import itertools
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()
n = II()
S = [c == 'o' for c in SI()]
S += S[:2]
SW = {'S': 'W', 'W': 'S'}
for a1, a2 in itertools.product('SW', repeat=2):
M = [a1, a2]
for i in range(n):
if S[i + 1]:
M.append(M[-2] if M[-1] == 'S' else SW[M[-2]])
else:
M.append(M[-2] if M[-1] == 'W' else SW[M[-2]])
if M[0] == M[-2] and M[1] == M[-1]:
print(*M[:-2], sep='')
exit()
print(-1)
| 40 | 32 | 1,008 | 710 | # coding:utf-8
import sys
# from collections import Counter, defaultdict
INF = float("inf")
MOD = 10**9 + 7
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def LS():
return sys.stdin.readline().split()
def II():
return int(sys.stdin.readline())
def SI():
return eval(input())
n = II()
s = SI()
s = s[-1] + s + s[0]
P = ("00", "01", "10", "11") # 0: S, 1: W
for p in P:
for i in range(1, n):
# print(i, p[-1], s[i])
if s[i + 1] == "o":
p += p[-2] if p[-1] == "0" else str(int(p[-2]) ^ 1)
else:
p += p[-2] if p[-1] == "1" else str(int(p[-2]) ^ 1)
else:
if s[1] == "o":
tmp = p[1] if p[0] == "0" else str(int(p[1]) ^ 1)
else:
tmp = p[1] if p[0] == "1" else str(int(p[1]) ^ 1)
p = tmp + p
if p[1] == p[-1] and p[-2] == p[0]:
ans = ""
for a in p[1:-1]:
ans += "S" if a == "0" else "W"
print(ans)
exit()
print((-1))
| # coding:utf-8
import sys
import itertools
INF = float("inf")
MOD = 10**9 + 7
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def LS():
return sys.stdin.readline().split()
def II():
return int(sys.stdin.readline())
def SI():
return input()
n = II()
S = [c == "o" for c in SI()]
S += S[:2]
SW = {"S": "W", "W": "S"}
for a1, a2 in itertools.product("SW", repeat=2):
M = [a1, a2]
for i in range(n):
if S[i + 1]:
M.append(M[-2] if M[-1] == "S" else SW[M[-2]])
else:
M.append(M[-2] if M[-1] == "W" else SW[M[-2]])
if M[0] == M[-2] and M[1] == M[-1]:
print(*M[:-2], sep="")
exit()
print(-1)
| false | 20 | [
"+import itertools",
"-# from collections import Counter, defaultdict",
"- return eval(input())",
"+ return input()",
"-s = SI()",
"-s = s[-1] + s + s[0]",
"-P = (\"00\", \"01\", \"10\", \"11\") # 0: S, 1: W",
"-for p in P:",
"- for i in range(1, n):",
"- # print(i, p[-1], s[i])",... | false | 0.044868 | 0.083983 | 0.534251 | [
"s133399455",
"s924110782"
] |
u278296307 | p02707 | python | s068182813 | s551999733 | 308 | 156 | 50,560 | 24,512 | Accepted | Accepted | 49.35 | n = int(eval(input()))
a_list = list(map(int, input().split()))
nl = {str(i):0 for i in range(n)}
for a in a_list:
nl[str(a-1)] += 1
for v in list(nl.values()):
print(("{}".format(v))) | n = int(eval(input()))
a_list = list(map(int, input().split()))
nl = [0] * n
for a in a_list:
nl[a-1] += 1
for v in nl:
print(("{}".format(v))) | 7 | 7 | 178 | 143 | n = int(eval(input()))
a_list = list(map(int, input().split()))
nl = {str(i): 0 for i in range(n)}
for a in a_list:
nl[str(a - 1)] += 1
for v in list(nl.values()):
print(("{}".format(v)))
| n = int(eval(input()))
a_list = list(map(int, input().split()))
nl = [0] * n
for a in a_list:
nl[a - 1] += 1
for v in nl:
print(("{}".format(v)))
| false | 0 | [
"-nl = {str(i): 0 for i in range(n)}",
"+nl = [0] * n",
"- nl[str(a - 1)] += 1",
"-for v in list(nl.values()):",
"+ nl[a - 1] += 1",
"+for v in nl:"
] | false | 0.043296 | 0.034516 | 1.254357 | [
"s068182813",
"s551999733"
] |
u562935282 | p03241 | python | s061176138 | s169546224 | 26 | 24 | 3,060 | 3,064 | Accepted | Accepted | 7.69 | from bisect import bisect_left
n, m = list(map(int, input().split()))
st = set()
i = 1
while i * i <= m:
if m % i == 0:
st.add(i)
st.add(m // i)
i += 1
divs = tuple(sorted(st))
i = bisect_left(divs, n)
print((m // divs[i]))
| def main():
N, M = list(map(int, input().split()))
st = {1, M}
d = 2
while d * d <= M:
if M % d == 0:
st.add(d)
st.add(M // d)
d += 1
ans = 1
for d in st:
if d >= N:
e = M // d
ans = max(ans, e)
print(ans)
if __name__ == '__main__':
main()
| 15 | 21 | 257 | 362 | from bisect import bisect_left
n, m = list(map(int, input().split()))
st = set()
i = 1
while i * i <= m:
if m % i == 0:
st.add(i)
st.add(m // i)
i += 1
divs = tuple(sorted(st))
i = bisect_left(divs, n)
print((m // divs[i]))
| def main():
N, M = list(map(int, input().split()))
st = {1, M}
d = 2
while d * d <= M:
if M % d == 0:
st.add(d)
st.add(M // d)
d += 1
ans = 1
for d in st:
if d >= N:
e = M // d
ans = max(ans, e)
print(ans)
if __name__ == "__main__":
main()
| false | 28.571429 | [
"-from bisect import bisect_left",
"+def main():",
"+ N, M = list(map(int, input().split()))",
"+ st = {1, M}",
"+ d = 2",
"+ while d * d <= M:",
"+ if M % d == 0:",
"+ st.add(d)",
"+ st.add(M // d)",
"+ d += 1",
"+ ans = 1",
"+ for d in st... | false | 0.062436 | 0.12466 | 0.500852 | [
"s061176138",
"s169546224"
] |
u288948615 | p03125 | python | s249740756 | s283935879 | 20 | 18 | 2,940 | 2,940 | Accepted | Accepted | 10 | A, B = list(map(int, input().split()))
if B % A == 0:
print((A+B))
else:
print((B-A)) | A, B = list(map(int, input().split()))
print((B+A if B%A == 0 else B-A)) | 6 | 2 | 89 | 65 | A, B = list(map(int, input().split()))
if B % A == 0:
print((A + B))
else:
print((B - A))
| A, B = list(map(int, input().split()))
print((B + A if B % A == 0 else B - A))
| false | 66.666667 | [
"-if B % A == 0:",
"- print((A + B))",
"-else:",
"- print((B - A))",
"+print((B + A if B % A == 0 else B - A))"
] | false | 0.042983 | 0.043649 | 0.984747 | [
"s249740756",
"s283935879"
] |
u379562612 | p02767 | python | s130289096 | s496247303 | 22 | 17 | 3,064 | 3,060 | Accepted | Accepted | 22.73 | import sys
l = sys.stdin.readline().strip()
N = int(l)
l = sys.stdin.readline().strip()
nums = list(map(int, l.split()))
nums = sorted(nums)
start = nums[0]
end = nums[-1] + 1
mi = float("INF")
def compute_dist(p):
dist = 0
for n in nums:
dist += (n-p) ** 2
return dist
for i in range(start, end):
d = compute_dist(i)
if d < mi:
mi = d
print(mi) | import sys
l = sys.stdin.readline().strip()
N = int(l)
l = sys.stdin.readline().strip()
nums = list(map(int, l.split()))
a = sum(nums) / len(nums)
a1 = int(a)
a2 = int(a) + 1
def count(p):
d = 0
for n in nums:
d += (n-p)**2
return d
print((min(count(a1), count(a2))))
| 19 | 14 | 375 | 299 | import sys
l = sys.stdin.readline().strip()
N = int(l)
l = sys.stdin.readline().strip()
nums = list(map(int, l.split()))
nums = sorted(nums)
start = nums[0]
end = nums[-1] + 1
mi = float("INF")
def compute_dist(p):
dist = 0
for n in nums:
dist += (n - p) ** 2
return dist
for i in range(start, end):
d = compute_dist(i)
if d < mi:
mi = d
print(mi)
| import sys
l = sys.stdin.readline().strip()
N = int(l)
l = sys.stdin.readline().strip()
nums = list(map(int, l.split()))
a = sum(nums) / len(nums)
a1 = int(a)
a2 = int(a) + 1
def count(p):
d = 0
for n in nums:
d += (n - p) ** 2
return d
print((min(count(a1), count(a2))))
| false | 26.315789 | [
"-nums = sorted(nums)",
"-start = nums[0]",
"-end = nums[-1] + 1",
"-mi = float(\"INF\")",
"+a = sum(nums) / len(nums)",
"+a1 = int(a)",
"+a2 = int(a) + 1",
"-def compute_dist(p):",
"- dist = 0",
"+def count(p):",
"+ d = 0",
"- dist += (n - p) ** 2",
"- return dist",
"+ ... | false | 0.037436 | 0.03601 | 1.039595 | [
"s130289096",
"s496247303"
] |
u440566786 | p02868 | python | s831023982 | s884583238 | 1,896 | 1,678 | 294,108 | 277,268 | Accepted | Accepted | 11.5 | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
from heapq import heappop, heappush
def resolve():
n, m = list(map(int, input().split()))
N = 1 << (n - 1).bit_length()
N2, now = N << 1, N << 2
E = [[] for _ in range((N << 2) + (m << 1))]
# build range-edge graph
for i in range(N, N2):
E[i].append((i + N2, 0))
for i in range(N - 1, 0, -1):
cl, cr = i << 1, i << 1 | 1
E[i].append((cl, 0))
E[i].append((cr, 0))
E[cl + N2].append((i + N2, 0))
E[cr + N2].append((i + N2, 0))
# add range-edge
for _ in range(m):
u, v, w = list(map(int, input().split()))
u -= 1
# lower
l, r = u + N, v + N
while l < r:
if l & 1:
E[l + N2].append((now, 0))
l += 1
if r & 1:
r -= 1
E[r + N2].append((now, 0))
l >>= 1
r >>= 1
# upper
l, r = u + N, v + N
while l < r:
if l & 1:
E[now + 1].append((l, 0))
l += 1
if r & 1:
r -= 1
E[now + 1].append((r, 0))
l >>= 1
r >>= 1
# range-edge
E[now].append((now + 1, w))
now += 2
# Dijkstra (source : N, termination : N + n - 1)
dist = [INF] * now
dist[N] = 0
heap = [(0, N)]
while heap:
d, v = heappop(heap)
if dist[v] != d:
continue
for nv, w in E[v]:
if dist[nv] > d + w:
dist[nv] = d + w
heappush(heap, (d + w, nv))
ans = dist[N + n - 1]
if ans == INF:
ans = -1
print(ans)
resolve() | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
from heapq import heappop, heappush
def resolve():
n, m = list(map(int, input().split()))
N = 1 << (n - 1).bit_length()
N2, now = N * 2, N * 3
E = [[] for _ in range(N * 3 + m * 2)]
ref = lambda v : v if v < 3 * N else v - N2
# build range-edge graph
for i in range(N - 1, 0, -1):
cl, cr = i << 1, i << 1 | 1
E[i].append((cl, 0))
E[i].append((cr, 0))
E[ref(cl + N2)].append((ref(i + N2), 0))
E[ref(cr + N2)].append((ref(i + N2), 0))
# add range-edge
for _ in range(m):
u, v, w = list(map(int, input().split()))
u -= 1
# lower
l, r = u + N, v + N
while l < r:
if l & 1:
E[ref(l + N2)].append((now, 0))
l += 1
if r & 1:
r -= 1
E[ref(r + N2)].append((now, 0))
l >>= 1
r >>= 1
# upper
l, r = u + N, v + N
while l < r:
if l & 1:
E[now + 1].append((l, 0))
l += 1
if r & 1:
r -= 1
E[now + 1].append((r, 0))
l >>= 1
r >>= 1
# range-edge
E[now].append((now + 1, w))
now += 2
# Dijkstra (source : N, termination : N + n - 1)
dist = [INF] * now
dist[N] = 0
heap = [(0, N)]
while heap:
d, v = heappop(heap)
if dist[v] != d:
continue
for nv, w in E[v]:
if dist[nv] > d + w:
dist[nv] = d + w
heappush(heap, (d + w, nv))
ans = dist[N + n - 1]
if ans == INF:
ans = -1
print(ans)
resolve() | 70 | 69 | 1,863 | 1,872 | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda: sys.stdin.readline().rstrip()
from heapq import heappop, heappush
def resolve():
n, m = list(map(int, input().split()))
N = 1 << (n - 1).bit_length()
N2, now = N << 1, N << 2
E = [[] for _ in range((N << 2) + (m << 1))]
# build range-edge graph
for i in range(N, N2):
E[i].append((i + N2, 0))
for i in range(N - 1, 0, -1):
cl, cr = i << 1, i << 1 | 1
E[i].append((cl, 0))
E[i].append((cr, 0))
E[cl + N2].append((i + N2, 0))
E[cr + N2].append((i + N2, 0))
# add range-edge
for _ in range(m):
u, v, w = list(map(int, input().split()))
u -= 1
# lower
l, r = u + N, v + N
while l < r:
if l & 1:
E[l + N2].append((now, 0))
l += 1
if r & 1:
r -= 1
E[r + N2].append((now, 0))
l >>= 1
r >>= 1
# upper
l, r = u + N, v + N
while l < r:
if l & 1:
E[now + 1].append((l, 0))
l += 1
if r & 1:
r -= 1
E[now + 1].append((r, 0))
l >>= 1
r >>= 1
# range-edge
E[now].append((now + 1, w))
now += 2
# Dijkstra (source : N, termination : N + n - 1)
dist = [INF] * now
dist[N] = 0
heap = [(0, N)]
while heap:
d, v = heappop(heap)
if dist[v] != d:
continue
for nv, w in E[v]:
if dist[nv] > d + w:
dist[nv] = d + w
heappush(heap, (d + w, nv))
ans = dist[N + n - 1]
if ans == INF:
ans = -1
print(ans)
resolve()
| import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda: sys.stdin.readline().rstrip()
from heapq import heappop, heappush
def resolve():
n, m = list(map(int, input().split()))
N = 1 << (n - 1).bit_length()
N2, now = N * 2, N * 3
E = [[] for _ in range(N * 3 + m * 2)]
ref = lambda v: v if v < 3 * N else v - N2
# build range-edge graph
for i in range(N - 1, 0, -1):
cl, cr = i << 1, i << 1 | 1
E[i].append((cl, 0))
E[i].append((cr, 0))
E[ref(cl + N2)].append((ref(i + N2), 0))
E[ref(cr + N2)].append((ref(i + N2), 0))
# add range-edge
for _ in range(m):
u, v, w = list(map(int, input().split()))
u -= 1
# lower
l, r = u + N, v + N
while l < r:
if l & 1:
E[ref(l + N2)].append((now, 0))
l += 1
if r & 1:
r -= 1
E[ref(r + N2)].append((now, 0))
l >>= 1
r >>= 1
# upper
l, r = u + N, v + N
while l < r:
if l & 1:
E[now + 1].append((l, 0))
l += 1
if r & 1:
r -= 1
E[now + 1].append((r, 0))
l >>= 1
r >>= 1
# range-edge
E[now].append((now + 1, w))
now += 2
# Dijkstra (source : N, termination : N + n - 1)
dist = [INF] * now
dist[N] = 0
heap = [(0, N)]
while heap:
d, v = heappop(heap)
if dist[v] != d:
continue
for nv, w in E[v]:
if dist[nv] > d + w:
dist[nv] = d + w
heappush(heap, (d + w, nv))
ans = dist[N + n - 1]
if ans == INF:
ans = -1
print(ans)
resolve()
| false | 1.428571 | [
"- N2, now = N << 1, N << 2",
"- E = [[] for _ in range((N << 2) + (m << 1))]",
"+ N2, now = N * 2, N * 3",
"+ E = [[] for _ in range(N * 3 + m * 2)]",
"+ ref = lambda v: v if v < 3 * N else v - N2",
"- for i in range(N, N2):",
"- E[i].append((i + N2, 0))",
"- E[cl + N2... | false | 0.040531 | 0.040845 | 0.992313 | [
"s831023982",
"s884583238"
] |
u623814058 | p02707 | python | s956580532 | s924858225 | 320 | 183 | 32,156 | 32,184 | Accepted | Accepted | 42.81 | N=int(eval(input()))
*A,=sorted(map(int,input().split()))
import bisect
for i in range(1,N+1):
print((bisect.bisect_right(A,i)-bisect.bisect_left(A,i))) | N=int(eval(input()))
*A,=sorted(map(int,input().split()))
s=[0]*N
for i in A:
s[i-1]+=1
for t in s:
print(t) | 7 | 8 | 156 | 118 | N = int(eval(input()))
(*A,) = sorted(map(int, input().split()))
import bisect
for i in range(1, N + 1):
print((bisect.bisect_right(A, i) - bisect.bisect_left(A, i)))
| N = int(eval(input()))
(*A,) = sorted(map(int, input().split()))
s = [0] * N
for i in A:
s[i - 1] += 1
for t in s:
print(t)
| false | 12.5 | [
"-import bisect",
"-",
"-for i in range(1, N + 1):",
"- print((bisect.bisect_right(A, i) - bisect.bisect_left(A, i)))",
"+s = [0] * N",
"+for i in A:",
"+ s[i - 1] += 1",
"+for t in s:",
"+ print(t)"
] | false | 0.044031 | 0.04734 | 0.930108 | [
"s956580532",
"s924858225"
] |
u546338822 | p02732 | python | s182919107 | s722139573 | 470 | 269 | 24,748 | 33,256 | Accepted | Accepted | 42.77 | def main():
n = int(eval(input()))
a = list(map(int,input().split()))
import collections
c =collections.Counter(a)
ans = 0
for k in list(c.keys()):
ans += c[k]*(c[k]-1)//2
for i in range(n):
draw = c[a[i]]*(c[a[i]]-1)//2-(c[a[i]]-1)*(c[a[i]]-2)//2
print((ans-draw))
if __name__ == "__main__":
main() | def main():
n = int(eval(input()))
a = list(map(int,input().split()))
d = {}
for i in range(n):
if d.get(a[i]) == None:
d[a[i]] = 1
else:
d[a[i]] += 1
ans = 0
for k in list(d.keys()):
ans += d[k] * (d[k]-1) //2
for i in range(n):
print((ans - ((d[a[i]]*(d[a[i]]-1))//2 - (d[a[i]]-1) * (d[a[i]]-2)//2)))
if __name__ == "__main__":
main()
| 14 | 17 | 355 | 428 | def main():
n = int(eval(input()))
a = list(map(int, input().split()))
import collections
c = collections.Counter(a)
ans = 0
for k in list(c.keys()):
ans += c[k] * (c[k] - 1) // 2
for i in range(n):
draw = c[a[i]] * (c[a[i]] - 1) // 2 - (c[a[i]] - 1) * (c[a[i]] - 2) // 2
print((ans - draw))
if __name__ == "__main__":
main()
| def main():
n = int(eval(input()))
a = list(map(int, input().split()))
d = {}
for i in range(n):
if d.get(a[i]) == None:
d[a[i]] = 1
else:
d[a[i]] += 1
ans = 0
for k in list(d.keys()):
ans += d[k] * (d[k] - 1) // 2
for i in range(n):
print(
(
ans
- ((d[a[i]] * (d[a[i]] - 1)) // 2 - (d[a[i]] - 1) * (d[a[i]] - 2) // 2)
)
)
if __name__ == "__main__":
main()
| false | 17.647059 | [
"- import collections",
"-",
"- c = collections.Counter(a)",
"+ d = {}",
"+ for i in range(n):",
"+ if d.get(a[i]) == None:",
"+ d[a[i]] = 1",
"+ else:",
"+ d[a[i]] += 1",
"- for k in list(c.keys()):",
"- ans += c[k] * (c[k] - 1) // 2",
... | false | 0.040966 | 0.115927 | 0.353378 | [
"s182919107",
"s722139573"
] |
u928784113 | p03162 | python | s893165283 | s570329736 | 653 | 450 | 49,576 | 95,320 | Accepted | Accepted | 31.09 | import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush
from fractions import gcd
from copy import deepcopy
import math
import queue
#import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
def sieve_of_eratosthenes(n):
if not isinstance(n,int):
raise TypeError("n is not int")
if n<2:
raise ValueError("n is not effective")
prime = [1]*(n+1)
for i in range(2,int(math.sqrt(n))+1):
if prime[i] == 1:
for j in range(2*i,n+1):
if j%i == 0:
prime[j] = 0
res = []
for i in range(2,n+1):
if prime[i] == 1:
res.append(i)
return res
def factorial(i):
if i == 1:
return 1
else:
return i*factorial(i-1)
class UnionFind:
def __init__(self,n):
self.parent = [i for i in range(n+1)]
self.rank = [0 for i in range(n+1)]
def findroot(self,x):
if x == self.parent[x]:
return x
else:
y = self.parent[x]
y = self.findroot(self.parent[x])
return y
def union(self,x,y):
px = self.findroot(x)
py = self.findroot(y)
if px < py:
self.parent[py] = px
else:
self.parent[px] = py
def same_group_or_no(self,x,y):
return self.findroot(x) == self.findroot(y)
def main(): #startline--------------------------------------------
n = int(eval(input()))
abc = [list(map(int,input().split())) for i in range(n)]
dp = [[0]*3 for i in range(n+1)]
for i in range(n):
for j in range(3):
for k in range(3):
if j == k:continue
dp[i+1][k] = max(dp[i+1][k],dp[i][j]+abc[i][k])
print((max(dp[n])))
if __name__ == "__main__":
main() #endline===============================================
| import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush
from fractions import gcd
from copy import deepcopy
import math
import queue
#import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
def sieve_of_eratosthenes(n):
if not isinstance(n,int):
raise TypeError("n is not int")
if n<2:
raise ValueError("n is not effective")
prime = [1]*(n+1)
for i in range(2,int(math.sqrt(n))+1):
if prime[i] == 1:
for j in range(2*i,n+1):
if j%i == 0:
prime[j] = 0
res = []
for i in range(2,n+1):
if prime[i] == 1:
res.append(i)
return res
def factorial(i):
if i == 1:
return 1
else:
return i*factorial(i-1)
class UnionFind:
def __init__(self,n):
self.parent = [i for i in range(n+1)]
self.rank = [0 for i in range(n+1)]
def findroot(self,x):
if x == self.parent[x]:
return x
else:
y = self.parent[x]
y = self.findroot(self.parent[x])
return y
def union(self,x,y):
px = self.findroot(x)
py = self.findroot(y)
if px < py:
self.parent[py] = px
else:
self.parent[px] = py
def same_group_or_no(self,x,y):
return self.findroot(x) == self.findroot(y)
def main(): #startline--------------------------------------------
n = int(eval(input()))
abc = [list(map(int,input().split())) for i in range(n)]
dp = [[0]*3 for i in range(n+1)]
for i in range(n):
for j in range(3):
for k in range(3):
if j == k:continue
dp[i+1][j] = max(dp[i+1][j],dp[i][k]+abc[i][j])
print((max(dp[n])))
if __name__ == "__main__":
main() #endline===============================================
| 81 | 81 | 2,106 | 2,106 | import itertools
from collections import deque, defaultdict, Counter
from itertools import accumulate
import bisect
from heapq import heappop, heappush
from fractions import gcd
from copy import deepcopy
import math
import queue
# import numpy as np
# import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
def sieve_of_eratosthenes(n):
if not isinstance(n, int):
raise TypeError("n is not int")
if n < 2:
raise ValueError("n is not effective")
prime = [1] * (n + 1)
for i in range(2, int(math.sqrt(n)) + 1):
if prime[i] == 1:
for j in range(2 * i, n + 1):
if j % i == 0:
prime[j] = 0
res = []
for i in range(2, n + 1):
if prime[i] == 1:
res.append(i)
return res
def factorial(i):
if i == 1:
return 1
else:
return i * factorial(i - 1)
class UnionFind:
def __init__(self, n):
self.parent = [i for i in range(n + 1)]
self.rank = [0 for i in range(n + 1)]
def findroot(self, x):
if x == self.parent[x]:
return x
else:
y = self.parent[x]
y = self.findroot(self.parent[x])
return y
def union(self, x, y):
px = self.findroot(x)
py = self.findroot(y)
if px < py:
self.parent[py] = px
else:
self.parent[px] = py
def same_group_or_no(self, x, y):
return self.findroot(x) == self.findroot(y)
def main(): # startline--------------------------------------------
n = int(eval(input()))
abc = [list(map(int, input().split())) for i in range(n)]
dp = [[0] * 3 for i in range(n + 1)]
for i in range(n):
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i + 1][k] = max(dp[i + 1][k], dp[i][j] + abc[i][k])
print((max(dp[n])))
if __name__ == "__main__":
main() # endline===============================================
| import itertools
from collections import deque, defaultdict, Counter
from itertools import accumulate
import bisect
from heapq import heappop, heappush
from fractions import gcd
from copy import deepcopy
import math
import queue
# import numpy as np
# import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
def sieve_of_eratosthenes(n):
if not isinstance(n, int):
raise TypeError("n is not int")
if n < 2:
raise ValueError("n is not effective")
prime = [1] * (n + 1)
for i in range(2, int(math.sqrt(n)) + 1):
if prime[i] == 1:
for j in range(2 * i, n + 1):
if j % i == 0:
prime[j] = 0
res = []
for i in range(2, n + 1):
if prime[i] == 1:
res.append(i)
return res
def factorial(i):
if i == 1:
return 1
else:
return i * factorial(i - 1)
class UnionFind:
def __init__(self, n):
self.parent = [i for i in range(n + 1)]
self.rank = [0 for i in range(n + 1)]
def findroot(self, x):
if x == self.parent[x]:
return x
else:
y = self.parent[x]
y = self.findroot(self.parent[x])
return y
def union(self, x, y):
px = self.findroot(x)
py = self.findroot(y)
if px < py:
self.parent[py] = px
else:
self.parent[px] = py
def same_group_or_no(self, x, y):
return self.findroot(x) == self.findroot(y)
def main(): # startline--------------------------------------------
n = int(eval(input()))
abc = [list(map(int, input().split())) for i in range(n)]
dp = [[0] * 3 for i in range(n + 1)]
for i in range(n):
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i + 1][j] = max(dp[i + 1][j], dp[i][k] + abc[i][j])
print((max(dp[n])))
if __name__ == "__main__":
main() # endline===============================================
| false | 0 | [
"- dp[i + 1][k] = max(dp[i + 1][k], dp[i][j] + abc[i][k])",
"+ dp[i + 1][j] = max(dp[i + 1][j], dp[i][k] + abc[i][j])"
] | false | 0.07654 | 0.093016 | 0.822863 | [
"s893165283",
"s570329736"
] |
u095021077 | p03044 | python | s747207315 | s661105651 | 1,068 | 732 | 98,476 | 84,428 | Accepted | Accepted | 31.46 | import sys
sys.setrecursionlimit(10**5+1)
N=int(eval(input()))
uvw=[list(map(int, input().split())) for i in range(N-1)]
nodelink=[[] for i in range(N+1)]
for i in range(N-1):
nodelink[uvw[i][0]].append([uvw[i][1], uvw[i][2]])
nodelink[uvw[i][1]].append([uvw[i][0], uvw[i][2]])
color=[-1]*(N+1)
def f(nuru, iro):
color[nuru]=iro
tonari=nodelink[nuru]
for nuruyo in tonari:
if color[nuruyo[0]]<0:
if (nuruyo[1]%2)==0:
f(nuruyo[0], iro)
else:
f(nuruyo[0], 1-iro)
f(1, 0)
for i in range(1, N+1):
print((color[i])) | import sys
sys.setrecursionlimit(10**5)
def f(x):
for tmp in links[x]:
if c[tmp[0]]<0:
if tmp[1]%2==0:
c[tmp[0]]=c[x]+0
else:
c[tmp[0]]=1-c[x]
f(tmp[0])
N=int(input())
links=[[] for _ in range(N+1)]
for _ in range(N-1):
u, v, w=map(int, input().split())
links[u].append([v, w])
links[v].append([u, w])
c=[-1]*(N+1)
c[1]=0
f(1)
print(*c[1:], sep='\n')
| 26 | 24 | 584 | 425 | import sys
sys.setrecursionlimit(10**5 + 1)
N = int(eval(input()))
uvw = [list(map(int, input().split())) for i in range(N - 1)]
nodelink = [[] for i in range(N + 1)]
for i in range(N - 1):
nodelink[uvw[i][0]].append([uvw[i][1], uvw[i][2]])
nodelink[uvw[i][1]].append([uvw[i][0], uvw[i][2]])
color = [-1] * (N + 1)
def f(nuru, iro):
color[nuru] = iro
tonari = nodelink[nuru]
for nuruyo in tonari:
if color[nuruyo[0]] < 0:
if (nuruyo[1] % 2) == 0:
f(nuruyo[0], iro)
else:
f(nuruyo[0], 1 - iro)
f(1, 0)
for i in range(1, N + 1):
print((color[i]))
| import sys
sys.setrecursionlimit(10**5)
def f(x):
for tmp in links[x]:
if c[tmp[0]] < 0:
if tmp[1] % 2 == 0:
c[tmp[0]] = c[x] + 0
else:
c[tmp[0]] = 1 - c[x]
f(tmp[0])
N = int(input())
links = [[] for _ in range(N + 1)]
for _ in range(N - 1):
u, v, w = map(int, input().split())
links[u].append([v, w])
links[v].append([u, w])
c = [-1] * (N + 1)
c[1] = 0
f(1)
print(*c[1:], sep="\n")
| false | 7.692308 | [
"-sys.setrecursionlimit(10**5 + 1)",
"-N = int(eval(input()))",
"-uvw = [list(map(int, input().split())) for i in range(N - 1)]",
"-nodelink = [[] for i in range(N + 1)]",
"-for i in range(N - 1):",
"- nodelink[uvw[i][0]].append([uvw[i][1], uvw[i][2]])",
"- nodelink[uvw[i][1]].append([uvw[i][0], u... | false | 0.037359 | 0.035825 | 1.042843 | [
"s747207315",
"s661105651"
] |
u531768068 | p03198 | python | s189573461 | s805887478 | 1,763 | 424 | 34,248 | 101,532 | Accepted | Accepted | 75.95 | #
import collections, atexit, math, sys, bisect
sys.setrecursionlimit(1000000)
def getIntList():
return list(map(int, input().split()))
try :
#raise ModuleNotFoundError
import numpy
def dprint(*args, **kwargs):
#print(*args, **kwargs, file=sys.stderr)
# in python 3.4 **kwargs is invalid???
print(*args, file=sys.stderr)
dprint('debug mode')
except Exception:
def dprint(*args, **kwargs):
pass
inId = 0
outId = 0
if inId>0:
dprint('use input', inId)
sys.stdin = open('input'+ str(inId) + '.txt', 'r') #标准输出重定向至文件
if outId>0:
dprint('use output', outId)
sys.stdout = open('stdout'+ str(outId) + '.txt', 'w') #标准输出重定向至文件
atexit.register(lambda :sys.stdout.close()) #idle 中不会执行 atexit
if True:
N, = getIntList()
#print(N)
za = getIntList()
else:
N = 1000
import random
za = [random.randint(1, 1000000000) for i in range(N) ]
dprint('begin')
zleft = [0 for i in range(N+1)]
zright = [0 for i in range(N+1)]
def getwork(zr, za):
zr[0] = 0
st = []
for i in range(N):
if i%10000 ==0:
dprint('---', i)
nt = [[za[i],0], [za[i],0], 1]
st.append(nt)
nr = zr[i]
#dprint(st)
while len(st)>1:
b_2 = st[-2][1][1]
b_1 = st[-1][0][1]
bb = min(b_1,b_2)
b_1 -=bb
b_2 -=bb
b_1p = 4 ** b_1
b_2p = 4 ** b_2
t2 = st[-2][1][0] * b_2p
t1 = st[-1][0][0] * b_1p
if t2 < t1:
nr+= 2* st[-2][2]
st[-2][0][1] +=1
st[-2][1][1] +=1
elif t2 < t1 * 4:
ttt = [ st[-2][0], st[-1][1], st[-2][2] + st[-1][2] ]
st[-2] = ttt
st.pop()
else:
break
#dprint(st)
zr[i+1] = nr
#dprint(nr)
#dprint(st)
assert nr < 1000000000000000
getwork(zleft, za)
dprint('!!!!')
getwork(zright, za[::-1])
#dprint(zleft)
#dprint(zright)
r = zright[N]
for i in range(N+1):
tr = i + zleft[i] + zright[N-i]
r = min(r,tr)
print(r)
dprint('end')
| #
import collections, atexit, math, sys, bisect
sys.setrecursionlimit(1000000)
def getIntList():
return list(map(int, input().split()))
try :
#raise ModuleNotFoundError
import numpy
def dprint(*args, **kwargs):
#print(*args, **kwargs, file=sys.stderr)
# in python 3.4 **kwargs is invalid???
print(*args, file=sys.stderr)
dprint('debug mode')
except Exception:
def dprint(*args, **kwargs):
pass
inId = 0
outId = 0
if inId>0:
dprint('use input', inId)
sys.stdin = open('input'+ str(inId) + '.txt', 'r') #标准输出重定向至文件
if outId>0:
dprint('use output', outId)
sys.stdout = open('stdout'+ str(outId) + '.txt', 'w') #标准输出重定向至文件
atexit.register(lambda :sys.stdout.close()) #idle 中不会执行 atexit
if True:
N, = getIntList()
#print(N)
za = getIntList()
else:
N = 100
import random
za = [random.randint(1, 1000000000) for i in range(N) ]
dprint('begin')
zleft = [0 for i in range(N+1)]
zright = [0 for i in range(N+1)]
def getwork(zr, za):
zr[0] = 0
st = []
for i in range(N):
if i%10000 ==0:
dprint('---', i)
nt = [[za[i],0], [za[i],0], 1]
st.append(nt)
nr = zr[i]
#dprint(st)
while len(st)>1:
b_2 = st[-2][1][1]
b_1 = st[-1][0][1]
bb = min(b_1,b_2)
b_1 -=bb
b_2 -=bb
b_1p = 4 ** b_1
b_2p = 4 ** b_2
t2 = st[-2][1][0] * b_2p
t1 = st[-1][0][0] * b_1p
if t2 < t1:
nr+= 2* st[-2][2]
st[-2][0][1] +=1
st[-2][1][1] +=1
elif t2 < t1 * 4:
ttt = [ st[-2][0], st[-1][1], st[-2][2] + st[-1][2] ]
st[-2] = ttt
st.pop()
else:
break
#dprint(st)
zr[i+1] = nr
#dprint(nr)
#dprint(st)
assert nr < 1000000000000000
dprint(st)
getwork(zleft, za)
dprint('!!!!')
getwork(zright, za[::-1])
#dprint(zleft)
#dprint(zright)
r = zright[N]
for i in range(N+1):
tr = i + zleft[i] + zright[N-i]
r = min(r,tr)
print(r)
dprint('end')
| 100 | 100 | 2,294 | 2,307 | #
import collections, atexit, math, sys, bisect
sys.setrecursionlimit(1000000)
def getIntList():
return list(map(int, input().split()))
try:
# raise ModuleNotFoundError
import numpy
def dprint(*args, **kwargs):
# print(*args, **kwargs, file=sys.stderr)
# in python 3.4 **kwargs is invalid???
print(*args, file=sys.stderr)
dprint("debug mode")
except Exception:
def dprint(*args, **kwargs):
pass
inId = 0
outId = 0
if inId > 0:
dprint("use input", inId)
sys.stdin = open("input" + str(inId) + ".txt", "r") # 标准输出重定向至文件
if outId > 0:
dprint("use output", outId)
sys.stdout = open("stdout" + str(outId) + ".txt", "w") # 标准输出重定向至文件
atexit.register(lambda: sys.stdout.close()) # idle 中不会执行 atexit
if True:
(N,) = getIntList()
# print(N)
za = getIntList()
else:
N = 1000
import random
za = [random.randint(1, 1000000000) for i in range(N)]
dprint("begin")
zleft = [0 for i in range(N + 1)]
zright = [0 for i in range(N + 1)]
def getwork(zr, za):
zr[0] = 0
st = []
for i in range(N):
if i % 10000 == 0:
dprint("---", i)
nt = [[za[i], 0], [za[i], 0], 1]
st.append(nt)
nr = zr[i]
# dprint(st)
while len(st) > 1:
b_2 = st[-2][1][1]
b_1 = st[-1][0][1]
bb = min(b_1, b_2)
b_1 -= bb
b_2 -= bb
b_1p = 4**b_1
b_2p = 4**b_2
t2 = st[-2][1][0] * b_2p
t1 = st[-1][0][0] * b_1p
if t2 < t1:
nr += 2 * st[-2][2]
st[-2][0][1] += 1
st[-2][1][1] += 1
elif t2 < t1 * 4:
ttt = [st[-2][0], st[-1][1], st[-2][2] + st[-1][2]]
st[-2] = ttt
st.pop()
else:
break
# dprint(st)
zr[i + 1] = nr
# dprint(nr)
# dprint(st)
assert nr < 1000000000000000
getwork(zleft, za)
dprint("!!!!")
getwork(zright, za[::-1])
# dprint(zleft)
# dprint(zright)
r = zright[N]
for i in range(N + 1):
tr = i + zleft[i] + zright[N - i]
r = min(r, tr)
print(r)
dprint("end")
| #
import collections, atexit, math, sys, bisect
sys.setrecursionlimit(1000000)
def getIntList():
return list(map(int, input().split()))
try:
# raise ModuleNotFoundError
import numpy
def dprint(*args, **kwargs):
# print(*args, **kwargs, file=sys.stderr)
# in python 3.4 **kwargs is invalid???
print(*args, file=sys.stderr)
dprint("debug mode")
except Exception:
def dprint(*args, **kwargs):
pass
inId = 0
outId = 0
if inId > 0:
dprint("use input", inId)
sys.stdin = open("input" + str(inId) + ".txt", "r") # 标准输出重定向至文件
if outId > 0:
dprint("use output", outId)
sys.stdout = open("stdout" + str(outId) + ".txt", "w") # 标准输出重定向至文件
atexit.register(lambda: sys.stdout.close()) # idle 中不会执行 atexit
if True:
(N,) = getIntList()
# print(N)
za = getIntList()
else:
N = 100
import random
za = [random.randint(1, 1000000000) for i in range(N)]
dprint("begin")
zleft = [0 for i in range(N + 1)]
zright = [0 for i in range(N + 1)]
def getwork(zr, za):
zr[0] = 0
st = []
for i in range(N):
if i % 10000 == 0:
dprint("---", i)
nt = [[za[i], 0], [za[i], 0], 1]
st.append(nt)
nr = zr[i]
# dprint(st)
while len(st) > 1:
b_2 = st[-2][1][1]
b_1 = st[-1][0][1]
bb = min(b_1, b_2)
b_1 -= bb
b_2 -= bb
b_1p = 4**b_1
b_2p = 4**b_2
t2 = st[-2][1][0] * b_2p
t1 = st[-1][0][0] * b_1p
if t2 < t1:
nr += 2 * st[-2][2]
st[-2][0][1] += 1
st[-2][1][1] += 1
elif t2 < t1 * 4:
ttt = [st[-2][0], st[-1][1], st[-2][2] + st[-1][2]]
st[-2] = ttt
st.pop()
else:
break
# dprint(st)
zr[i + 1] = nr
# dprint(nr)
# dprint(st)
assert nr < 1000000000000000
dprint(st)
getwork(zleft, za)
dprint("!!!!")
getwork(zright, za[::-1])
# dprint(zleft)
# dprint(zright)
r = zright[N]
for i in range(N + 1):
tr = i + zleft[i] + zright[N - i]
r = min(r, tr)
print(r)
dprint("end")
| false | 0 | [
"- N = 1000",
"+ N = 100",
"+ dprint(st)"
] | false | 0.066012 | 0.047789 | 1.381335 | [
"s189573461",
"s805887478"
] |
u684120680 | p02984 | python | s030127985 | s909366694 | 143 | 98 | 14,092 | 14,092 | Accepted | Accepted | 31.47 | def main():
n, *a = list(map(int, open(0).read().split()))
b = [sum([cur_a * (-1) ** in_i for in_i, cur_a in enumerate(a)])]
for cur_a in a[:-1]:
b.append((cur_a - b[-1] // 2) * 2)
ans = b
print((*ans))
return()
if __name__ == '__main__':
main()
| def main():
n, *a = list(map(int, open(0).read().split()))
# b[0] == a[0] - a[1] + a[2] - a[3] + ...
b = [sum(a) - 2 * sum(a[1::2])]
for cur_a in a[:-1]:
b.append(cur_a * 2 - b[-1])
ans = b
print((*ans))
return()
if __name__ == '__main__':
main()
| 14 | 15 | 291 | 297 | def main():
n, *a = list(map(int, open(0).read().split()))
b = [sum([cur_a * (-1) ** in_i for in_i, cur_a in enumerate(a)])]
for cur_a in a[:-1]:
b.append((cur_a - b[-1] // 2) * 2)
ans = b
print((*ans))
return ()
if __name__ == "__main__":
main()
| def main():
n, *a = list(map(int, open(0).read().split()))
# b[0] == a[0] - a[1] + a[2] - a[3] + ...
b = [sum(a) - 2 * sum(a[1::2])]
for cur_a in a[:-1]:
b.append(cur_a * 2 - b[-1])
ans = b
print((*ans))
return ()
if __name__ == "__main__":
main()
| false | 6.666667 | [
"- b = [sum([cur_a * (-1) ** in_i for in_i, cur_a in enumerate(a)])]",
"+ # b[0] == a[0] - a[1] + a[2] - a[3] + ...",
"+ b = [sum(a) - 2 * sum(a[1::2])]",
"- b.append((cur_a - b[-1] // 2) * 2)",
"+ b.append(cur_a * 2 - b[-1])"
] | false | 0.044939 | 0.046151 | 0.973734 | [
"s030127985",
"s909366694"
] |
u664373116 | p03614 | python | s467243182 | s606318308 | 74 | 68 | 14,008 | 14,008 | Accepted | Accepted | 8.11 | n=int(eval(input()))
a=list(map(int,input().split()))
f=[True if a[i]==i+1 else False for i in range(n)]
ans=0
for i in range(n-1):
if f[i] and f[i+1]:
f[i]=False
f[i+1]=False
ans+=1
ans+=sum(f)
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
f=[True if a[i]==i+1 else False for i in range(n)]
ans=0
for i in range(n-1):
if f[i]:
f[i]=False
f[i+1]=False
ans+=1
if f[n-1]:
ans+=1
print(ans) | 12 | 13 | 239 | 239 | n = int(eval(input()))
a = list(map(int, input().split()))
f = [True if a[i] == i + 1 else False for i in range(n)]
ans = 0
for i in range(n - 1):
if f[i] and f[i + 1]:
f[i] = False
f[i + 1] = False
ans += 1
ans += sum(f)
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
f = [True if a[i] == i + 1 else False for i in range(n)]
ans = 0
for i in range(n - 1):
if f[i]:
f[i] = False
f[i + 1] = False
ans += 1
if f[n - 1]:
ans += 1
print(ans)
| false | 7.692308 | [
"- if f[i] and f[i + 1]:",
"+ if f[i]:",
"-ans += sum(f)",
"+if f[n - 1]:",
"+ ans += 1"
] | false | 0.048256 | 0.044788 | 1.077418 | [
"s467243182",
"s606318308"
] |
u885634168 | p03805 | python | s278074708 | s839337572 | 230 | 80 | 45,020 | 68,112 | Accepted | Accepted | 65.22 | N, M = list(map(int,input().split()))
graph = [[-1 for i in range(N)] for i in range(N)]
for i in range(M):
a, b = list(map(int,input().split()))
graph[a - 1][b - 1] = 1
graph[b - 1][a - 1] = 1
def dfs(node, depth):
global visited
global ans
if depth == N - 1:
if sum(visited) == N:
ans += 1
return
for i in range(1, N):
if graph[node][i] == 1 and visited[i] == -1:
visited[i] = 1
dfs(i, depth + 1)
visited[i] = -1
visited = [-1 for i in range(N)]
visited[0] = 1
ans = 0
dfs(0, 0)
print(ans) | N, M = list(map(int,input().split()))
G = [[] for _ in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
def dfs(depth, node):
global visited
global ans
visited[node] = 1
if depth == N - 1:
if sum(visited) == N: ans += 1
return
for i in G[node]:
if visited[i] == 0:
dfs(depth + 1, i)
visited[i] = 0
ans = 0
visited = [0 for _ in range(N)]
dfs(0, 0)
print(ans) | 27 | 23 | 637 | 534 | N, M = list(map(int, input().split()))
graph = [[-1 for i in range(N)] for i in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
graph[a - 1][b - 1] = 1
graph[b - 1][a - 1] = 1
def dfs(node, depth):
global visited
global ans
if depth == N - 1:
if sum(visited) == N:
ans += 1
return
for i in range(1, N):
if graph[node][i] == 1 and visited[i] == -1:
visited[i] = 1
dfs(i, depth + 1)
visited[i] = -1
visited = [-1 for i in range(N)]
visited[0] = 1
ans = 0
dfs(0, 0)
print(ans)
| N, M = list(map(int, input().split()))
G = [[] for _ in range(N)]
for i in range(M):
a, b = list(map(int, input().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
def dfs(depth, node):
global visited
global ans
visited[node] = 1
if depth == N - 1:
if sum(visited) == N:
ans += 1
return
for i in G[node]:
if visited[i] == 0:
dfs(depth + 1, i)
visited[i] = 0
ans = 0
visited = [0 for _ in range(N)]
dfs(0, 0)
print(ans)
| false | 14.814815 | [
"-graph = [[-1 for i in range(N)] for i in range(N)]",
"+G = [[] for _ in range(N)]",
"- graph[a - 1][b - 1] = 1",
"- graph[b - 1][a - 1] = 1",
"+ G[a - 1].append(b - 1)",
"+ G[b - 1].append(a - 1)",
"-def dfs(node, depth):",
"+def dfs(depth, node):",
"+ visited[node] = 1",
"- fo... | false | 0.047298 | 0.068168 | 0.693842 | [
"s278074708",
"s839337572"
] |
u063052907 | p03379 | python | s927834445 | s614509774 | 417 | 288 | 93,780 | 26,016 | Accepted | Accepted | 30.94 | n = int(eval(input()))
lst_x = list(map(int, input().split()))
lst = lst_x[:]
lst.sort()
b1 = lst[n//2 - 1]
b2 = lst[n//2]
for x in lst_x:
if x <= b1:
ans = b2
else:
ans = b1
print(ans) | n = int(eval(input()))
lst_x = list(map(int, input().split()))
lst = lst_x[:]
lst.sort()
b1 = lst[n//2 - 1]
b2 = lst[n//2]
for x in lst_x:
print((b2 if x <= b1 else b1))
| 14 | 10 | 222 | 177 | n = int(eval(input()))
lst_x = list(map(int, input().split()))
lst = lst_x[:]
lst.sort()
b1 = lst[n // 2 - 1]
b2 = lst[n // 2]
for x in lst_x:
if x <= b1:
ans = b2
else:
ans = b1
print(ans)
| n = int(eval(input()))
lst_x = list(map(int, input().split()))
lst = lst_x[:]
lst.sort()
b1 = lst[n // 2 - 1]
b2 = lst[n // 2]
for x in lst_x:
print((b2 if x <= b1 else b1))
| false | 28.571429 | [
"- if x <= b1:",
"- ans = b2",
"- else:",
"- ans = b1",
"- print(ans)",
"+ print((b2 if x <= b1 else b1))"
] | false | 0.039422 | 0.037449 | 1.052673 | [
"s927834445",
"s614509774"
] |
u899308536 | p02846 | python | s600143566 | s281422610 | 19 | 17 | 3,064 | 3,060 | Accepted | Accepted | 10.53 | T1,T2,A1,A2,B1,B2=list(map(int, open(0).read().split()))
D1,D2 = (A1-B1)*T1, (A1-B1)*T1+(A2-B2)*T2
if D1*D2 > 0: print((0))
elif D2 == 0: print("infinity")
elif -D1%D2 == 0: print((-D1//D2*2))
else: print((-D1//D2*2+1)) | T1,T2,A1,A2,B1,B2 = list(map(int, open(0).read().split()))
D1,D2 = (A1-B1)*T1, (A1-B1)*T1+(A2-B2)*T2
if D1*D2 > 0: print((0))
elif D2 == 0: print("infinity")
else: print((-D1//D2*2+1 - (-D1%D2 == 0))) | 6 | 5 | 232 | 202 | T1, T2, A1, A2, B1, B2 = list(map(int, open(0).read().split()))
D1, D2 = (A1 - B1) * T1, (A1 - B1) * T1 + (A2 - B2) * T2
if D1 * D2 > 0:
print((0))
elif D2 == 0:
print("infinity")
elif -D1 % D2 == 0:
print((-D1 // D2 * 2))
else:
print((-D1 // D2 * 2 + 1))
| T1, T2, A1, A2, B1, B2 = list(map(int, open(0).read().split()))
D1, D2 = (A1 - B1) * T1, (A1 - B1) * T1 + (A2 - B2) * T2
if D1 * D2 > 0:
print((0))
elif D2 == 0:
print("infinity")
else:
print((-D1 // D2 * 2 + 1 - (-D1 % D2 == 0)))
| false | 16.666667 | [
"-elif -D1 % D2 == 0:",
"- print((-D1 // D2 * 2))",
"- print((-D1 // D2 * 2 + 1))",
"+ print((-D1 // D2 * 2 + 1 - (-D1 % D2 == 0)))"
] | false | 0.040905 | 0.050219 | 0.814546 | [
"s600143566",
"s281422610"
] |
u167647458 | p02719 | python | s546953417 | s170622619 | 24 | 22 | 9,124 | 9,036 | Accepted | Accepted | 8.33 | n, k = list(map(int, input().split()))
def solve():
global n, k
n = n - (k * (n // k))
pre = n
while True:
n = min(n, abs(n-k))
if n == pre:
break
pre = n
return n
print((solve())) | n, k = list(map(int, input().split()))
n = n % k
print((min(abs(n - k), n))) | 14 | 4 | 243 | 72 | n, k = list(map(int, input().split()))
def solve():
global n, k
n = n - (k * (n // k))
pre = n
while True:
n = min(n, abs(n - k))
if n == pre:
break
pre = n
return n
print((solve()))
| n, k = list(map(int, input().split()))
n = n % k
print((min(abs(n - k), n)))
| false | 71.428571 | [
"-",
"-",
"-def solve():",
"- global n, k",
"- n = n - (k * (n // k))",
"- pre = n",
"- while True:",
"- n = min(n, abs(n - k))",
"- if n == pre:",
"- break",
"- pre = n",
"- return n",
"-",
"-",
"-print((solve()))",
"+n = n % k",
"+prin... | false | 0.069623 | 0.066768 | 1.04276 | [
"s546953417",
"s170622619"
] |
u017810624 | p02642 | python | s989241758 | s631316583 | 807 | 298 | 167,432 | 173,916 | Accepted | Accepted | 63.07 | n=int(eval(input()))
a=list(map(int,input().split()))
if n!=1 and len(set(a))==1:
print((0))
exit()
l=[0 for i in range(10**6+1)]
for i in range(n):
l[a[i]]+=1
if n!=1 and min(a)>max(a)/2:
ct=0
for i in range(len(l)):
if l[i]==1:
ct+=1
print(ct)
exit()
d={}
ans=0
for i in range(n):
x=a[i]
if x not in d:
if l[a[i]]==1:
flag=1
for j in range(1,int(x**0.5)+2):
if x%j==0:
if x!=j and l[j]>0:
flag=0
break
if x!=x//j and x%(x//j)==0 and l[x//j]>0:
flag=0
break
if flag==1:
ans+=1
d[x]=1
else:
d[x]=0
else:
ans+=d[x]
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
ct=[0 for i in range(10**6+1)]
check=[0 for i in range(10**6+1)]
dp=[1 for i in range(10**6+1)]
for i in range(n):
ct[a[i]]+=1
if check[a[i]]==0:
check[a[i]]=1
for j in range(2,10**6+1):
if a[i]*j<=10**6:
dp[a[i]*j]=0
else:
break
ans=0
for i in range(n):
if ct[a[i]]==1 and dp[a[i]]==1:
ans+=1
print(ans) | 38 | 20 | 715 | 426 | n = int(eval(input()))
a = list(map(int, input().split()))
if n != 1 and len(set(a)) == 1:
print((0))
exit()
l = [0 for i in range(10**6 + 1)]
for i in range(n):
l[a[i]] += 1
if n != 1 and min(a) > max(a) / 2:
ct = 0
for i in range(len(l)):
if l[i] == 1:
ct += 1
print(ct)
exit()
d = {}
ans = 0
for i in range(n):
x = a[i]
if x not in d:
if l[a[i]] == 1:
flag = 1
for j in range(1, int(x**0.5) + 2):
if x % j == 0:
if x != j and l[j] > 0:
flag = 0
break
if x != x // j and x % (x // j) == 0 and l[x // j] > 0:
flag = 0
break
if flag == 1:
ans += 1
d[x] = 1
else:
d[x] = 0
else:
ans += d[x]
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
ct = [0 for i in range(10**6 + 1)]
check = [0 for i in range(10**6 + 1)]
dp = [1 for i in range(10**6 + 1)]
for i in range(n):
ct[a[i]] += 1
if check[a[i]] == 0:
check[a[i]] = 1
for j in range(2, 10**6 + 1):
if a[i] * j <= 10**6:
dp[a[i] * j] = 0
else:
break
ans = 0
for i in range(n):
if ct[a[i]] == 1 and dp[a[i]] == 1:
ans += 1
print(ans)
| false | 47.368421 | [
"-if n != 1 and len(set(a)) == 1:",
"- print((0))",
"- exit()",
"-l = [0 for i in range(10**6 + 1)]",
"+a.sort()",
"+ct = [0 for i in range(10**6 + 1)]",
"+check = [0 for i in range(10**6 + 1)]",
"+dp = [1 for i in range(10**6 + 1)]",
"- l[a[i]] += 1",
"-if n != 1 and min(a) > max(a) / 2:... | false | 0.090513 | 1.758057 | 0.051485 | [
"s989241758",
"s631316583"
] |
u827202523 | p02691 | python | s197307594 | s694164922 | 296 | 240 | 131,448 | 120,836 | Accepted | Accepted | 18.92 | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
from collections import defaultdict, Counter
from sys import exit
import math
def main():
n = getN()
nums = getList()
den = [num - i for i, num in enumerate(nums)]
cnt = Counter(den)
ans = 0
for i in range(n-1):
k1, k2 = nums[i], nums[i+1]
su = k1 + k2
tgt = den[i+1] - su + 1
if tgt in list(cnt.keys()):
ans += cnt[tgt]
print(ans)
if __name__ == "__main__":
main() | import sys
from collections import defaultdict, deque
import math
# import copy
from bisect import bisect_left, bisect_right
# import heapq
# sys.setrecursionlimit(1000000)
# input aliases
input = sys.stdin.readline
getS = lambda: input().strip()
getN = lambda: int(eval(input()))
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]
INF = 10 ** 20
MOD = 10**9 + 7
def divide(k):
return pow(k, MOD-2, MOD)
def make_nck(n):
ret = [1]
for i in range(1, n+1):
ret.append((ret[-1] * (n + 1 - i) * divide(i)) % MOD)
# print(ret)
return ret
def make_nigojyo(n):
ret = [1]
for i in range(1, n+1):
ret.append((ret[-1] * 25) % MOD)
# print(ret)
return ret
def solve():
n = getN()
nums = getList()
agentss = [num - i for i, num in enumerate(nums)]
agents = [-num - i for i, num in enumerate(nums)]
agents.sort()
agentss.sort()
ans = 0
for ag in agentss:
ans += bisect_right(agents, ag) - bisect_left(agents,ag)
# print(ag, ans)
# bisect_left()
print(ans)
# print(agents)
# print(agentss)
def main():
n = getN()
for _ in range(n):
solve()
if __name__ == "__main__":
# main()
solve() | 27 | 70 | 608 | 1,351 | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
from collections import defaultdict, Counter
from sys import exit
import math
def main():
n = getN()
nums = getList()
den = [num - i for i, num in enumerate(nums)]
cnt = Counter(den)
ans = 0
for i in range(n - 1):
k1, k2 = nums[i], nums[i + 1]
su = k1 + k2
tgt = den[i + 1] - su + 1
if tgt in list(cnt.keys()):
ans += cnt[tgt]
print(ans)
if __name__ == "__main__":
main()
| import sys
from collections import defaultdict, deque
import math
# import copy
from bisect import bisect_left, bisect_right
# import heapq
# sys.setrecursionlimit(1000000)
# input aliases
input = sys.stdin.readline
getS = lambda: input().strip()
getN = lambda: int(eval(input()))
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]
INF = 10**20
MOD = 10**9 + 7
def divide(k):
return pow(k, MOD - 2, MOD)
def make_nck(n):
ret = [1]
for i in range(1, n + 1):
ret.append((ret[-1] * (n + 1 - i) * divide(i)) % MOD)
# print(ret)
return ret
def make_nigojyo(n):
ret = [1]
for i in range(1, n + 1):
ret.append((ret[-1] * 25) % MOD)
# print(ret)
return ret
def solve():
n = getN()
nums = getList()
agentss = [num - i for i, num in enumerate(nums)]
agents = [-num - i for i, num in enumerate(nums)]
agents.sort()
agentss.sort()
ans = 0
for ag in agentss:
ans += bisect_right(agents, ag) - bisect_left(agents, ag)
# print(ag, ans)
# bisect_left()
print(ans)
# print(agents)
# print(agentss)
def main():
n = getN()
for _ in range(n):
solve()
if __name__ == "__main__":
# main()
solve()
| false | 61.428571 | [
"-def getN():",
"- return int(eval(input()))",
"+import sys",
"+from collections import defaultdict, deque",
"+import math",
"+",
"+# import copy",
"+from bisect import bisect_left, bisect_right",
"+",
"+# import heapq",
"+# sys.setrecursionlimit(1000000)",
"+# input aliases",
"+input = s... | false | 0.048158 | 0.048213 | 0.998855 | [
"s197307594",
"s694164922"
] |
u332657092 | p03060 | python | s300278333 | s661397025 | 705 | 165 | 41,256 | 38,384 | Accepted | Accepted | 76.6 | n = int(eval(input()))
V = list(map(int, input().split()))
C = list(map(int, input().split()))
from itertools import product
max_total = 0
for lis in product((0, 1), repeat=n):
total = 0
for i, zero_one in enumerate(lis):
total += (V[i]-C[i]) * zero_one
max_total = max(max_total, total)
print(max_total) | n = int(eval(input()))
V = list(map(int, input().split()))
C = list(map(int, input().split()))
total = 0
for i in range(n):
if V[i] - C[i] > 0:
total += V[i] - C[i]
print(total) | 11 | 8 | 318 | 184 | n = int(eval(input()))
V = list(map(int, input().split()))
C = list(map(int, input().split()))
from itertools import product
max_total = 0
for lis in product((0, 1), repeat=n):
total = 0
for i, zero_one in enumerate(lis):
total += (V[i] - C[i]) * zero_one
max_total = max(max_total, total)
print(max_total)
| n = int(eval(input()))
V = list(map(int, input().split()))
C = list(map(int, input().split()))
total = 0
for i in range(n):
if V[i] - C[i] > 0:
total += V[i] - C[i]
print(total)
| false | 27.272727 | [
"-from itertools import product",
"-",
"-max_total = 0",
"-for lis in product((0, 1), repeat=n):",
"- total = 0",
"- for i, zero_one in enumerate(lis):",
"- total += (V[i] - C[i]) * zero_one",
"- max_total = max(max_total, total)",
"-print(max_total)",
"+total = 0",
"+for i in ra... | false | 0.16437 | 0.038263 | 4.295847 | [
"s300278333",
"s661397025"
] |
u585482323 | p02834 | python | s327697112 | s420264705 | 722 | 502 | 121,248 | 67,820 | Accepted | Accepted | 30.47 | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
def lca(x,y):
k = depth[x] - depth[y]
while k > 0:
x = par[x][int(math.log(k,2))]
k = depth[x] - depth[y]
k = -k
while k > 0:
y = par[y][int(math.log(k,2))]
k = depth[y] - depth[x]
if x == y:
return x
for i in range(17)[::-1]:
if par[x][i] != par[y][i]:
x = par[x][i]
y = par[y][i]
return par[x][0]
n,s,t = LI()
s -= 1
t -= 1
v = [[] for i in range(n)]
f = [0]*n
for i in range(n-1):
a,b = LI()
a -= 1
b -= 1
v[a].append(b)
v[b].append(a)
f[a] += 1
f[b] += 1
l = []
for i in range(n):
if f[i] == 1:
l.append(i)
par = [[] for i in range(n)]
par[t].append(t)
depth = [-1]*n
depth[t] = 0
q = deque([t])
while q:
x = q.popleft()
for y in v[x]:
if depth[y] < 0:
depth[y] = depth[x]+1
q.append(y)
par[y].append(x)
d = [-1]*n
d[s] = 0
q = deque([s])
while q:
x = q.popleft()
for y in v[x]:
if d[y] < 0:
d[y] = d[x]+1
q.append(y)
for i in range(16):
for x in range(n):
par[x].append(par[par[x][i]][i])
l.sort(key = lambda x:-depth[x])
for i in l:
x = lca(i,s)
if d[x] < depth[x]:
break
print((depth[i]-1))
return
#Solve
if __name__ == "__main__":
solve()
| #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
n,s,t = LI()
s -= 1
t -= 1
v = [[] for i in range(n)]
f = [0]*n
for i in range(n-1):
a,b = LI()
a -= 1
b -= 1
v[a].append(b)
v[b].append(a)
f[a] += 1
f[b] += 1
l = []
for i in range(n):
if f[i] == 1:
l.append(i)
depth = [-1]*n
depth[t] = 0
q = deque([t])
while q:
x = q.popleft()
for y in v[x]:
if depth[y] < 0:
depth[y] = depth[x]+1
q.append(y)
d = [-1]*n
d[s] = 0
q = deque([s])
while q:
x = q.popleft()
for y in v[x]:
if d[y] < 0:
d[y] = d[x]+1
q.append(y)
l.sort(key = lambda x:-depth[x])
for i in l:
if d[i] < depth[i]:
break
print((depth[i]-1))
return
#Solve
if __name__ == "__main__":
solve()
| 96 | 73 | 2,342 | 1,652 | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def I():
return int(sys.stdin.readline())
def LS():
return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
def lca(x, y):
k = depth[x] - depth[y]
while k > 0:
x = par[x][int(math.log(k, 2))]
k = depth[x] - depth[y]
k = -k
while k > 0:
y = par[y][int(math.log(k, 2))]
k = depth[y] - depth[x]
if x == y:
return x
for i in range(17)[::-1]:
if par[x][i] != par[y][i]:
x = par[x][i]
y = par[y][i]
return par[x][0]
n, s, t = LI()
s -= 1
t -= 1
v = [[] for i in range(n)]
f = [0] * n
for i in range(n - 1):
a, b = LI()
a -= 1
b -= 1
v[a].append(b)
v[b].append(a)
f[a] += 1
f[b] += 1
l = []
for i in range(n):
if f[i] == 1:
l.append(i)
par = [[] for i in range(n)]
par[t].append(t)
depth = [-1] * n
depth[t] = 0
q = deque([t])
while q:
x = q.popleft()
for y in v[x]:
if depth[y] < 0:
depth[y] = depth[x] + 1
q.append(y)
par[y].append(x)
d = [-1] * n
d[s] = 0
q = deque([s])
while q:
x = q.popleft()
for y in v[x]:
if d[y] < 0:
d[y] = d[x] + 1
q.append(y)
for i in range(16):
for x in range(n):
par[x].append(par[par[x][i]][i])
l.sort(key=lambda x: -depth[x])
for i in l:
x = lca(i, s)
if d[x] < depth[x]:
break
print((depth[i] - 1))
return
# Solve
if __name__ == "__main__":
solve()
| #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI():
return [int(x) for x in sys.stdin.readline().split()]
def I():
return int(sys.stdin.readline())
def LS():
return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
n, s, t = LI()
s -= 1
t -= 1
v = [[] for i in range(n)]
f = [0] * n
for i in range(n - 1):
a, b = LI()
a -= 1
b -= 1
v[a].append(b)
v[b].append(a)
f[a] += 1
f[b] += 1
l = []
for i in range(n):
if f[i] == 1:
l.append(i)
depth = [-1] * n
depth[t] = 0
q = deque([t])
while q:
x = q.popleft()
for y in v[x]:
if depth[y] < 0:
depth[y] = depth[x] + 1
q.append(y)
d = [-1] * n
d[s] = 0
q = deque([s])
while q:
x = q.popleft()
for y in v[x]:
if d[y] < 0:
d[y] = d[x] + 1
q.append(y)
l.sort(key=lambda x: -depth[x])
for i in l:
if d[i] < depth[i]:
break
print((depth[i] - 1))
return
# Solve
if __name__ == "__main__":
solve()
| false | 23.958333 | [
"- def lca(x, y):",
"- k = depth[x] - depth[y]",
"- while k > 0:",
"- x = par[x][int(math.log(k, 2))]",
"- k = depth[x] - depth[y]",
"- k = -k",
"- while k > 0:",
"- y = par[y][int(math.log(k, 2))]",
"- k = depth[y] - depth[x... | false | 0.061701 | 0.053582 | 1.151523 | [
"s327697112",
"s420264705"
] |
u832039789 | p03210 | python | s102281346 | s431162085 | 20 | 17 | 3,316 | 2,940 | Accepted | Accepted | 15 | x = int(eval(input()))
if x in (7,5,3):
print('YES')
else:
print('NO')
| n = int(eval(input()))
if n in (7, 5, 3):
print('YES')
else:
print('NO')
| 5 | 5 | 77 | 79 | x = int(eval(input()))
if x in (7, 5, 3):
print("YES")
else:
print("NO")
| n = int(eval(input()))
if n in (7, 5, 3):
print("YES")
else:
print("NO")
| false | 0 | [
"-x = int(eval(input()))",
"-if x in (7, 5, 3):",
"+n = int(eval(input()))",
"+if n in (7, 5, 3):"
] | false | 0.05011 | 0.049936 | 1.003487 | [
"s102281346",
"s431162085"
] |
u127499732 | p02727 | python | s019301298 | s381689378 | 402 | 265 | 31,648 | 25,536 | Accepted | Accepted | 34.08 | def main():
import sys
import numpy as np
x, y, a, b, c = list(map(int, input().split()))
p = list(map(int, sys.stdin.readline().split()))
q = list(map(int, sys.stdin.readline().split()))
r = list(map(int, sys.stdin.readline().split()))
p = sorted(p,reverse=True)
q = sorted(q,reverse=True)
r = sorted(r,reverse=True)
p = p[:x]
q = q[:y]
i = max(r)
j = sum(x > i for x in p)
k = sum(x > i for x in q)
pd = p[j:]
qd = q[k:]
m = (x-j) + (y-k)
rem = sorted(pd + qd + r,reverse=True)
ans = sum(p[:j] + q[:k]) + sum(rem[:m])
print(ans)
if __name__ == '__main__':
main()
| def main():
s = open(0).readlines()
x, y, a, b, c = list(map(int, s[0].split()))
f = lambda x: list(map(int, x.split()))
p, q, r = list(map(f, s[1:]))
p = sorted(p, reverse=True)
q = sorted(q, reverse=True)
r = sorted(r, reverse=True)
p = p[:x]
q = q[:y]
i = max(r)
j = sum(x > i for x in p)
k = sum(x > i for x in q)
pd = p[j:]
qd = q[k:]
m = (x - j) + (y - k)
rem = sorted(pd + qd + r, reverse=True)
ans = sum(p[:j] + q[:k]) + sum(rem[:m])
print(ans)
if __name__ == '__main__':
main()
| 33 | 31 | 685 | 591 | def main():
import sys
import numpy as np
x, y, a, b, c = list(map(int, input().split()))
p = list(map(int, sys.stdin.readline().split()))
q = list(map(int, sys.stdin.readline().split()))
r = list(map(int, sys.stdin.readline().split()))
p = sorted(p, reverse=True)
q = sorted(q, reverse=True)
r = sorted(r, reverse=True)
p = p[:x]
q = q[:y]
i = max(r)
j = sum(x > i for x in p)
k = sum(x > i for x in q)
pd = p[j:]
qd = q[k:]
m = (x - j) + (y - k)
rem = sorted(pd + qd + r, reverse=True)
ans = sum(p[:j] + q[:k]) + sum(rem[:m])
print(ans)
if __name__ == "__main__":
main()
| def main():
s = open(0).readlines()
x, y, a, b, c = list(map(int, s[0].split()))
f = lambda x: list(map(int, x.split()))
p, q, r = list(map(f, s[1:]))
p = sorted(p, reverse=True)
q = sorted(q, reverse=True)
r = sorted(r, reverse=True)
p = p[:x]
q = q[:y]
i = max(r)
j = sum(x > i for x in p)
k = sum(x > i for x in q)
pd = p[j:]
qd = q[k:]
m = (x - j) + (y - k)
rem = sorted(pd + qd + r, reverse=True)
ans = sum(p[:j] + q[:k]) + sum(rem[:m])
print(ans)
if __name__ == "__main__":
main()
| false | 6.060606 | [
"- import sys",
"- import numpy as np",
"-",
"- x, y, a, b, c = list(map(int, input().split()))",
"- p = list(map(int, sys.stdin.readline().split()))",
"- q = list(map(int, sys.stdin.readline().split()))",
"- r = list(map(int, sys.stdin.readline().split()))",
"+ s = open(0).readli... | false | 0.032249 | 0.036629 | 0.880421 | [
"s019301298",
"s381689378"
] |
u185896732 | p03212 | python | s737466622 | s163495604 | 316 | 62 | 50,268 | 3,060 | Accepted | Accepted | 80.38 | def dfs(s,num):
if int(s)>num:
return 0
if s.count('7')>0 and s.count('5')>0 and s.count('3')>0:
ret=1
else:
ret=0
for i in "753":
ret+=dfs(s+i,num)
return ret
n=int(eval(input()))
print((dfs('0',n))) | n=int(eval(input()))
def dfs(now):
if int(now)>n:
return 0
for i in "753":
if i not in now:
ret=0
break
else:
ret=1
for i in "753":
ret+=dfs(now+i)
return ret
print((dfs("0"))) | 12 | 15 | 255 | 259 | def dfs(s, num):
if int(s) > num:
return 0
if s.count("7") > 0 and s.count("5") > 0 and s.count("3") > 0:
ret = 1
else:
ret = 0
for i in "753":
ret += dfs(s + i, num)
return ret
n = int(eval(input()))
print((dfs("0", n)))
| n = int(eval(input()))
def dfs(now):
if int(now) > n:
return 0
for i in "753":
if i not in now:
ret = 0
break
else:
ret = 1
for i in "753":
ret += dfs(now + i)
return ret
print((dfs("0")))
| false | 20 | [
"-def dfs(s, num):",
"- if int(s) > num:",
"+n = int(eval(input()))",
"+",
"+",
"+def dfs(now):",
"+ if int(now) > n:",
"- if s.count(\"7\") > 0 and s.count(\"5\") > 0 and s.count(\"3\") > 0:",
"+ for i in \"753\":",
"+ if i not in now:",
"+ ret = 0",
"+ ... | false | 0.09091 | 0.084978 | 1.069796 | [
"s737466622",
"s163495604"
] |
u645250356 | p02838 | python | s989159845 | s537175333 | 1,568 | 1,085 | 127,084 | 127,084 | Accepted | Accepted | 30.8 | 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
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))
n = inp()
a = inpl()
a.sort()
ln = len(bin(a[-1])) - 2
bit = [defaultdict(int) for i in range(ln)]
res = 0
for i in a:
tmp = bin(i)
for _,j in enumerate(tmp[:1:-1]):
# print(_,j)
bit[_][j] += 1
# pprint.pprint(bit)
for i,j in enumerate(bit):
x = j['0']
y = j['1']
if x+y < n:
x = n - y
# print(i,x,y)
c = pow(2,i)
res += x * y * c
res %= mod
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
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))
n = inp()
a = inpl()
a.sort()
ln = len(bin(a[-1])) - 2
bit = [[0,0] for i in range(ln)]
res = 0
for i in a:
for j in range(ln):
tmp = 0
if (i>>j) % 2:
tmp += 1
bit[j][tmp] += 1
for i,j in enumerate(bit):
c = pow(2,i)
res += j[0] * j[1] * c
res %= mod
print(res) | 33 | 28 | 846 | 742 | 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
mod2 = 998244353
INF = float("inf")
def inp():
return int(sys.stdin.readline())
def inpl():
return list(map(int, sys.stdin.readline().split()))
def inpln(n):
return list(int(sys.stdin.readline()) for i in range(n))
n = inp()
a = inpl()
a.sort()
ln = len(bin(a[-1])) - 2
bit = [defaultdict(int) for i in range(ln)]
res = 0
for i in a:
tmp = bin(i)
for _, j in enumerate(tmp[:1:-1]):
# print(_,j)
bit[_][j] += 1
# pprint.pprint(bit)
for i, j in enumerate(bit):
x = j["0"]
y = j["1"]
if x + y < n:
x = n - y
# print(i,x,y)
c = pow(2, i)
res += x * y * c
res %= mod
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
mod2 = 998244353
INF = float("inf")
def inp():
return int(sys.stdin.readline())
def inpl():
return list(map(int, sys.stdin.readline().split()))
def inpln(n):
return list(int(sys.stdin.readline()) for i in range(n))
n = inp()
a = inpl()
a.sort()
ln = len(bin(a[-1])) - 2
bit = [[0, 0] for i in range(ln)]
res = 0
for i in a:
for j in range(ln):
tmp = 0
if (i >> j) % 2:
tmp += 1
bit[j][tmp] += 1
for i, j in enumerate(bit):
c = pow(2, i)
res += j[0] * j[1] * c
res %= mod
print(res)
| false | 15.151515 | [
"-bit = [defaultdict(int) for i in range(ln)]",
"+bit = [[0, 0] for i in range(ln)]",
"- tmp = bin(i)",
"- for _, j in enumerate(tmp[:1:-1]):",
"- # print(_,j)",
"- bit[_][j] += 1",
"-# pprint.pprint(bit)",
"+ for j in range(ln):",
"+ tmp = 0",
"+ if (i >> j) %... | false | 0.105698 | 0.037958 | 2.78463 | [
"s989159845",
"s537175333"
] |
u133347536 | p03212 | python | s405083863 | s979117487 | 737 | 92 | 28,020 | 76,056 | Accepted | Accepted | 87.52 | import math
n_in = int(eval(input()))
def sgs(n, a, s, s_temp):
if a == math.ceil(math.log(n, 10)):
c = 0
for i in s:
i_listed = list(map(int, list(str(i))))
if 3 in i_listed and 5 in i_listed and 7 in i_listed:
if i <= n:
c += 1
else:
a += 1
temp = []
for i in s_temp:
s.append(10 * i + 3)
s.append(10 * i + 5)
s.append(10 * i + 7)
temp.append(10 * i + 3)
temp.append(10 * i + 5)
temp.append(10 * i + 7)
s_temp = temp
c = sgs(n, a, s, s_temp)
return c
ans = sgs(n_in, -1, [3, 5, 7], [3, 5, 7])
print(ans)
| import collections
N = int(eval(input()))
def generate(n):
_list = []
queue = collections.deque([0])
while queue:
_temp = queue.popleft()
if _temp <= n and '3' in str(_temp) and '7' in str(_temp) and '5' in str(_temp):
_list.append(_temp)
if len(str(_temp)) > 9:
break
queue.append(_temp * 10 + 7)
queue.append(_temp * 10 + 5)
queue.append(_temp * 10 + 3)
return _list
_list = generate(N)
print((len(_list)))
| 29 | 21 | 732 | 513 | import math
n_in = int(eval(input()))
def sgs(n, a, s, s_temp):
if a == math.ceil(math.log(n, 10)):
c = 0
for i in s:
i_listed = list(map(int, list(str(i))))
if 3 in i_listed and 5 in i_listed and 7 in i_listed:
if i <= n:
c += 1
else:
a += 1
temp = []
for i in s_temp:
s.append(10 * i + 3)
s.append(10 * i + 5)
s.append(10 * i + 7)
temp.append(10 * i + 3)
temp.append(10 * i + 5)
temp.append(10 * i + 7)
s_temp = temp
c = sgs(n, a, s, s_temp)
return c
ans = sgs(n_in, -1, [3, 5, 7], [3, 5, 7])
print(ans)
| import collections
N = int(eval(input()))
def generate(n):
_list = []
queue = collections.deque([0])
while queue:
_temp = queue.popleft()
if _temp <= n and "3" in str(_temp) and "7" in str(_temp) and "5" in str(_temp):
_list.append(_temp)
if len(str(_temp)) > 9:
break
queue.append(_temp * 10 + 7)
queue.append(_temp * 10 + 5)
queue.append(_temp * 10 + 3)
return _list
_list = generate(N)
print((len(_list)))
| false | 27.586207 | [
"-import math",
"+import collections",
"-n_in = int(eval(input()))",
"+N = int(eval(input()))",
"-def sgs(n, a, s, s_temp):",
"- if a == math.ceil(math.log(n, 10)):",
"- c = 0",
"- for i in s:",
"- i_listed = list(map(int, list(str(i))))",
"- if 3 in i_listed... | false | 0.215404 | 0.069821 | 3.085109 | [
"s405083863",
"s979117487"
] |
u941407962 | p03185 | python | s516937874 | s509168524 | 485 | 430 | 93,900 | 94,540 | Accepted | Accepted | 11.34 | def fi(i, x):
a, b = lines[i]
return a*x+b
def find(x):
if len(lines) == 1:
return 0
def f(i):
# 0<=i<len(lines)-1
return fi(i+1,x) > fi(i,x)
mn, mx = 0, len(lines)-2
idx = (mn+mx)//2
if f(mn):
return 0
if not f(mx):
return mx+1
while mx-mn>1:
if f(idx):
mx, idx = idx, (mn + idx)//2
continue
mn, idx = idx, (mx + idx)//2
return idx+1
def remove_lines():
(x, y) = lines.pop()
a, b = x, y
(e, f) = lines[-1]
while len(lines)-1:
(c, d), (e, f) = (e, f), lines[-2]
if (c-e)*(b-d) < (d-f)*(a-c):
break
lines.pop()
lines.append((x, y))
def insert(a, b):
lines.append((a, b))
if len(lines) >= 3:
remove_lines()
N, C = list(map(int, input().split()))
hs = list(map(int, input().split()))
r = 0
lines = []
for i, h in enumerate(hs):
if i!= 0:
r = fi(find(h), h) + h**2+C
insert(-2*h, r+h**2)
print(r)
| def fi(i, x):
a, b = lines[i]
return a*x+b
def find(x):
def f(i):
return fi(i+1,x) > fi(i,x)
mn, mx = -1, len(lines)-1
idx = (mn+mx)//2
while mx-mn>1:
if f(idx):
mx, idx = idx, (mn + idx)//2
continue
mn, idx = idx, (mx + idx)//2
return fi(idx+1, x)
def insert(a, b):
(e, f) = lines[-1]
while len(lines)-1:
(c, d), (e, f) = (e, f), lines[-2]
if (c-e)*(b-d) < (d-f)*(a-c):
break
lines.pop()
lines.append((a, b))
N, C = list(map(int, input().split()))
hs = list(map(int, input().split()))
lines = [(-2*hs[0], hs[0]**2)]
for h in hs[1:]:
r = find(h) + h**2+C
insert(-2*h, r+h**2)
print(r)
| 48 | 32 | 1,041 | 745 | def fi(i, x):
a, b = lines[i]
return a * x + b
def find(x):
if len(lines) == 1:
return 0
def f(i):
# 0<=i<len(lines)-1
return fi(i + 1, x) > fi(i, x)
mn, mx = 0, len(lines) - 2
idx = (mn + mx) // 2
if f(mn):
return 0
if not f(mx):
return mx + 1
while mx - mn > 1:
if f(idx):
mx, idx = idx, (mn + idx) // 2
continue
mn, idx = idx, (mx + idx) // 2
return idx + 1
def remove_lines():
(x, y) = lines.pop()
a, b = x, y
(e, f) = lines[-1]
while len(lines) - 1:
(c, d), (e, f) = (e, f), lines[-2]
if (c - e) * (b - d) < (d - f) * (a - c):
break
lines.pop()
lines.append((x, y))
def insert(a, b):
lines.append((a, b))
if len(lines) >= 3:
remove_lines()
N, C = list(map(int, input().split()))
hs = list(map(int, input().split()))
r = 0
lines = []
for i, h in enumerate(hs):
if i != 0:
r = fi(find(h), h) + h**2 + C
insert(-2 * h, r + h**2)
print(r)
| def fi(i, x):
a, b = lines[i]
return a * x + b
def find(x):
def f(i):
return fi(i + 1, x) > fi(i, x)
mn, mx = -1, len(lines) - 1
idx = (mn + mx) // 2
while mx - mn > 1:
if f(idx):
mx, idx = idx, (mn + idx) // 2
continue
mn, idx = idx, (mx + idx) // 2
return fi(idx + 1, x)
def insert(a, b):
(e, f) = lines[-1]
while len(lines) - 1:
(c, d), (e, f) = (e, f), lines[-2]
if (c - e) * (b - d) < (d - f) * (a - c):
break
lines.pop()
lines.append((a, b))
N, C = list(map(int, input().split()))
hs = list(map(int, input().split()))
lines = [(-2 * hs[0], hs[0] ** 2)]
for h in hs[1:]:
r = find(h) + h**2 + C
insert(-2 * h, r + h**2)
print(r)
| false | 33.333333 | [
"- if len(lines) == 1:",
"- return 0",
"-",
"- # 0<=i<len(lines)-1",
"- mn, mx = 0, len(lines) - 2",
"+ mn, mx = -1, len(lines) - 1",
"- if f(mn):",
"- return 0",
"- if not f(mx):",
"- return mx + 1",
"- return idx + 1",
"+ return fi(idx + 1, x)... | false | 0.037292 | 0.049877 | 0.747694 | [
"s516937874",
"s509168524"
] |
u600402037 | p03062 | python | s719044804 | s880901197 | 504 | 183 | 23,380 | 23,384 | Accepted | Accepted | 63.69 | import numpy as np
N = int(eval(input()))
A = np.array(list(map(int, input().split())))
A2 = np.abs(A)
x = A2.min()
s = A2.sum()
A3 = A < 0
if sum(A3) % 2 == 0:
print(s)
else:
print((s-2*x))
| import numpy as np
N = int(eval(input()))
A = np.array(list(map(int, input().split())))
A2 = np.abs(A)
x = A2.min()
s = A2.sum()
A3 = A < 0
if A3.sum() % 2 == 0:
print(s)
else:
print((s-2*x))
| 14 | 14 | 207 | 208 | import numpy as np
N = int(eval(input()))
A = np.array(list(map(int, input().split())))
A2 = np.abs(A)
x = A2.min()
s = A2.sum()
A3 = A < 0
if sum(A3) % 2 == 0:
print(s)
else:
print((s - 2 * x))
| import numpy as np
N = int(eval(input()))
A = np.array(list(map(int, input().split())))
A2 = np.abs(A)
x = A2.min()
s = A2.sum()
A3 = A < 0
if A3.sum() % 2 == 0:
print(s)
else:
print((s - 2 * x))
| false | 0 | [
"-if sum(A3) % 2 == 0:",
"+if A3.sum() % 2 == 0:"
] | false | 0.40035 | 0.628115 | 0.637384 | [
"s719044804",
"s880901197"
] |
u614314290 | p03112 | python | s751950097 | s651232044 | 1,241 | 821 | 18,336 | 42,008 | Accepted | Accepted | 33.84 | import bisect
A, B, Q = list(map(int, input().split()))
S = [int(eval(input())) for _ in range(A)]
T = [int(eval(input())) for _ in range(B)]
X = [int(eval(input())) for _ in range(Q)]
"""
def bsr(a, v, lo=0, hi=None):
if None == hi:
hi = len(a) - 1
while lo <= hi:
mi = (lo + hi) // 2
if a[mi] <= v:
lo = mi + 1
else:
hi = mi - 1
return lo
"""
bsr = bisect.bisect_right
INF = 10 ** 18
s = [-INF] + S + [INF]
t = [-INF] + T + [INF]
for x in X:
sp = bsr(s, x)
tp = bsr(t, x)
cost = []
cost += [abs(s[sp - 0] - x) + abs(s[sp - 0] - t[tp - 0])]
cost += [abs(s[sp - 1] - x) + abs(s[sp - 1] - t[tp - 0])]
cost += [abs(s[sp - 0] - x) + abs(s[sp - 0] - t[tp - 1])]
cost += [abs(s[sp - 1] - x) + abs(s[sp - 1] - t[tp - 1])]
cost += [abs(t[tp - 0] - x) + abs(s[sp - 0] - t[tp - 0])]
cost += [abs(t[tp - 1] - x) + abs(s[sp - 0] - t[tp - 1])]
cost += [abs(t[tp - 0] - x) + abs(s[sp - 1] - t[tp - 0])]
cost += [abs(t[tp - 1] - x) + abs(s[sp - 1] - t[tp - 1])]
print((min(cost)))
| # お約束
INF = float("inf")
MOD = int(1e9 + 7)
def int1(n):
return int(n) - 1
def parse(args, *params):
return tuple(p(v) for p, v in zip(params, next(args).split()))
from bisect import bisect_right as bsr
# エントリーポイント
def main(args):
A, B, Q = parse(args, int, int, int)
S = list(int(next(args)) for _ in range(A))
T = list(int(next(args)) for _ in range(B))
X = tuple(int(next(args)) for _ in range(Q))
s = [-INF] + S + [INF]
t = [-INF] + T + [INF]
for x in X:
sr = bsr(s, x)
sl = sr - 1
tr = bsr(t, x)
tl = tr - 1
min_cost = INF
for st in [s[sl], s[sr]]:
for tt in [t[tl], t[tr]]:
min_cost = min(min_cost, abs(st - x) + abs(tt - st))
min_cost = min(min_cost, abs(tt - x) + abs(tt - st))
print(min_cost)
import sys
if __name__ == '__main__':
main(iter(sys.stdin.read().split("\n")))
| 37 | 34 | 1,009 | 958 | import bisect
A, B, Q = list(map(int, input().split()))
S = [int(eval(input())) for _ in range(A)]
T = [int(eval(input())) for _ in range(B)]
X = [int(eval(input())) for _ in range(Q)]
"""
def bsr(a, v, lo=0, hi=None):
if None == hi:
hi = len(a) - 1
while lo <= hi:
mi = (lo + hi) // 2
if a[mi] <= v:
lo = mi + 1
else:
hi = mi - 1
return lo
"""
bsr = bisect.bisect_right
INF = 10**18
s = [-INF] + S + [INF]
t = [-INF] + T + [INF]
for x in X:
sp = bsr(s, x)
tp = bsr(t, x)
cost = []
cost += [abs(s[sp - 0] - x) + abs(s[sp - 0] - t[tp - 0])]
cost += [abs(s[sp - 1] - x) + abs(s[sp - 1] - t[tp - 0])]
cost += [abs(s[sp - 0] - x) + abs(s[sp - 0] - t[tp - 1])]
cost += [abs(s[sp - 1] - x) + abs(s[sp - 1] - t[tp - 1])]
cost += [abs(t[tp - 0] - x) + abs(s[sp - 0] - t[tp - 0])]
cost += [abs(t[tp - 1] - x) + abs(s[sp - 0] - t[tp - 1])]
cost += [abs(t[tp - 0] - x) + abs(s[sp - 1] - t[tp - 0])]
cost += [abs(t[tp - 1] - x) + abs(s[sp - 1] - t[tp - 1])]
print((min(cost)))
| # お約束
INF = float("inf")
MOD = int(1e9 + 7)
def int1(n):
return int(n) - 1
def parse(args, *params):
return tuple(p(v) for p, v in zip(params, next(args).split()))
from bisect import bisect_right as bsr
# エントリーポイント
def main(args):
A, B, Q = parse(args, int, int, int)
S = list(int(next(args)) for _ in range(A))
T = list(int(next(args)) for _ in range(B))
X = tuple(int(next(args)) for _ in range(Q))
s = [-INF] + S + [INF]
t = [-INF] + T + [INF]
for x in X:
sr = bsr(s, x)
sl = sr - 1
tr = bsr(t, x)
tl = tr - 1
min_cost = INF
for st in [s[sl], s[sr]]:
for tt in [t[tl], t[tr]]:
min_cost = min(min_cost, abs(st - x) + abs(tt - st))
min_cost = min(min_cost, abs(tt - x) + abs(tt - st))
print(min_cost)
import sys
if __name__ == "__main__":
main(iter(sys.stdin.read().split("\n")))
| false | 8.108108 | [
"-import bisect",
"+# お約束",
"+INF = float(\"inf\")",
"+MOD = int(1e9 + 7)",
"-A, B, Q = list(map(int, input().split()))",
"-S = [int(eval(input())) for _ in range(A)]",
"-T = [int(eval(input())) for _ in range(B)]",
"-X = [int(eval(input())) for _ in range(Q)]",
"-\"\"\"",
"-def bsr(a, v, lo=0, hi... | false | 0.037764 | 0.091739 | 0.411646 | [
"s751950097",
"s651232044"
] |
u241159583 | p03680 | python | s739376616 | s183711020 | 210 | 165 | 7,852 | 13,780 | Accepted | Accepted | 21.43 | n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
A = [0]*n
i = 0
ok = False
cnt = 0
for _ in range(n):
cnt += 1
A[i] = 1
if a[i] == 2:
ok = True
break
i = a[i]-1
if A[i] == 1: break
print((cnt if ok else -1)) | n = int(eval(input()))
a = [0]+[int(eval(input())) for _ in range(n)]
check = [0] * (n+1)
now = 1
cnt = 0
while now != 2:
if check[now] == 1: break
cnt += 1
check[now] = 1
now = a[now]
print((cnt if now == 2 else -1)) | 15 | 11 | 244 | 229 | n = int(eval(input()))
a = [int(eval(input())) for _ in range(n)]
A = [0] * n
i = 0
ok = False
cnt = 0
for _ in range(n):
cnt += 1
A[i] = 1
if a[i] == 2:
ok = True
break
i = a[i] - 1
if A[i] == 1:
break
print((cnt if ok else -1))
| n = int(eval(input()))
a = [0] + [int(eval(input())) for _ in range(n)]
check = [0] * (n + 1)
now = 1
cnt = 0
while now != 2:
if check[now] == 1:
break
cnt += 1
check[now] = 1
now = a[now]
print((cnt if now == 2 else -1))
| false | 26.666667 | [
"-a = [int(eval(input())) for _ in range(n)]",
"-A = [0] * n",
"-i = 0",
"-ok = False",
"+a = [0] + [int(eval(input())) for _ in range(n)]",
"+check = [0] * (n + 1)",
"+now = 1",
"-for _ in range(n):",
"+while now != 2:",
"+ if check[now] == 1:",
"+ break",
"- A[i] = 1",
"- i... | false | 0.036743 | 0.036418 | 1.008923 | [
"s739376616",
"s183711020"
] |
u922449550 | p02889 | python | s750340438 | s541652523 | 1,500 | 1,239 | 26,956 | 17,472 | Accepted | Accepted | 17.4 | from scipy.sparse.csgraph import floyd_warshall
import numpy as np
N, M, L = list(map(int, input().split()))
D = np.ones([N, N]) * np.inf
D[np.eye(N, dtype=bool)] = 0
for _ in range(M):
A, B, C = list(map(int, input().split()))
D[A-1, B-1] = C
D[B-1, A-1] = C
D = floyd_warshall(D)
D2 = D <= L
D2 = floyd_warshall(D2)
Q = int(eval(input()))
for _ in range(Q):
s, t = list(map(int, input().split()))
r = D2[s-1, t-1] - 1
if r < np.inf:
print((int(r)))
else:
print((-1))
| from scipy.sparse.csgraph import floyd_warshall
import numpy as np
N, M, L = list(map(int, input().split()))
D = np.ones([N, N]) * np.inf
D[np.eye(N, dtype=bool)] = 0
for _ in range(M):
A, B, C = list(map(int, input().split()))
D[A-1, B-1] = C
D[B-1, A-1] = C
D = floyd_warshall(D)
D2 = (D<=L)*1.0 # boolean -> float
D2[D2==0] = np.inf
# D2 = (D <= L) + (D > L)*np.inf
D2 = floyd_warshall(D2) - 1
Q = int(eval(input()))
for _ in range(Q):
s, t = list(map(int, input().split()))
r = D2[s-1, t-1]
if r < np.inf:
print((int(r)))
else:
print((-1)) | 27 | 28 | 496 | 570 | from scipy.sparse.csgraph import floyd_warshall
import numpy as np
N, M, L = list(map(int, input().split()))
D = np.ones([N, N]) * np.inf
D[np.eye(N, dtype=bool)] = 0
for _ in range(M):
A, B, C = list(map(int, input().split()))
D[A - 1, B - 1] = C
D[B - 1, A - 1] = C
D = floyd_warshall(D)
D2 = D <= L
D2 = floyd_warshall(D2)
Q = int(eval(input()))
for _ in range(Q):
s, t = list(map(int, input().split()))
r = D2[s - 1, t - 1] - 1
if r < np.inf:
print((int(r)))
else:
print((-1))
| from scipy.sparse.csgraph import floyd_warshall
import numpy as np
N, M, L = list(map(int, input().split()))
D = np.ones([N, N]) * np.inf
D[np.eye(N, dtype=bool)] = 0
for _ in range(M):
A, B, C = list(map(int, input().split()))
D[A - 1, B - 1] = C
D[B - 1, A - 1] = C
D = floyd_warshall(D)
D2 = (D <= L) * 1.0 # boolean -> float
D2[D2 == 0] = np.inf
# D2 = (D <= L) + (D > L)*np.inf
D2 = floyd_warshall(D2) - 1
Q = int(eval(input()))
for _ in range(Q):
s, t = list(map(int, input().split()))
r = D2[s - 1, t - 1]
if r < np.inf:
print((int(r)))
else:
print((-1))
| false | 3.571429 | [
"-D2 = D <= L",
"-D2 = floyd_warshall(D2)",
"+D2 = (D <= L) * 1.0 # boolean -> float",
"+D2[D2 == 0] = np.inf",
"+# D2 = (D <= L) + (D > L)*np.inf",
"+D2 = floyd_warshall(D2) - 1",
"- r = D2[s - 1, t - 1] - 1",
"+ r = D2[s - 1, t - 1]"
] | false | 0.512017 | 0.557741 | 0.918018 | [
"s750340438",
"s541652523"
] |
u733738237 | p03612 | python | s425114473 | s259302811 | 77 | 61 | 13,880 | 13,940 | Accepted | Accepted | 20.78 | n=int(eval(input()))
p=[int(i) for i in input().split()]
cnt=0
for i in range(n-1):
if p[i]==i+1:
p[i],p[i+1]=p[i+1],p[i]
cnt+=1
if p[-1]==n:cnt+=1
print(cnt) | n,*p=list(map(int,open(0).read().split()))
i=c=0
while i<n:
if p[i]==i+1:
i+=1
c+=1
i+=1
print(c) | 9 | 8 | 165 | 104 | n = int(eval(input()))
p = [int(i) for i in input().split()]
cnt = 0
for i in range(n - 1):
if p[i] == i + 1:
p[i], p[i + 1] = p[i + 1], p[i]
cnt += 1
if p[-1] == n:
cnt += 1
print(cnt)
| n, *p = list(map(int, open(0).read().split()))
i = c = 0
while i < n:
if p[i] == i + 1:
i += 1
c += 1
i += 1
print(c)
| false | 11.111111 | [
"-n = int(eval(input()))",
"-p = [int(i) for i in input().split()]",
"-cnt = 0",
"-for i in range(n - 1):",
"+n, *p = list(map(int, open(0).read().split()))",
"+i = c = 0",
"+while i < n:",
"- p[i], p[i + 1] = p[i + 1], p[i]",
"- cnt += 1",
"-if p[-1] == n:",
"- cnt += 1",
"-p... | false | 0.042244 | 0.033952 | 1.244246 | [
"s425114473",
"s259302811"
] |
u723711163 | p03579 | python | s744075643 | s293788238 | 1,232 | 1,098 | 213,904 | 212,036 | Accepted | Accepted | 10.88 | import sys
sys.setrecursionlimit(100000)
N,M = list(map(int,input().split()))
adj_list = { i: [] for i in range(1, N+1) }
for i in range(M):
a,b = list(map(int, input().split()))
adj_list[a].append(b)
adj_list[b].append(a)
visited = [False]*(N+1)
colors = [None] * (N)
is_bipartite = True
## improved dfs ###
def dfs(node, c):
colors[node-1] = c
visited[node] = True
for nei in adj_list[node]:
if colors[nei-1] == c:
return False
if not visited[nei] and not dfs(nei, 1-c):
return False
return True
if dfs(1, 1):
black = colors.count(1)
print((black*(N-black) - M))
else:
print((N*(N-1)//2 - M)) | import sys
sys.setrecursionlimit(100000)
N,M = list(map(int,input().split()))
adj = [ [] for _ in range(N) ]
for _ in range(M):
u,v = list(map(int,input().split()))
u -= 1
v -= 1
adj[u].append(v)
adj[v].append(u)
color = [None] * N
def dfs(n, c):
color[n] = c
for nei in adj[n]:
if color[nei] is not None:
if color[nei] == c:
return False
elif not dfs(nei, 1-c):
return False
# else:
# dfs(nei, 1-c)
return True
if dfs(0,1):
print((color.count(1)*color.count(0) - M))
else:
print((N*(N-1)//2 - M))
| 32 | 30 | 655 | 574 | import sys
sys.setrecursionlimit(100000)
N, M = list(map(int, input().split()))
adj_list = {i: [] for i in range(1, N + 1)}
for i in range(M):
a, b = list(map(int, input().split()))
adj_list[a].append(b)
adj_list[b].append(a)
visited = [False] * (N + 1)
colors = [None] * (N)
is_bipartite = True
## improved dfs ###
def dfs(node, c):
colors[node - 1] = c
visited[node] = True
for nei in adj_list[node]:
if colors[nei - 1] == c:
return False
if not visited[nei] and not dfs(nei, 1 - c):
return False
return True
if dfs(1, 1):
black = colors.count(1)
print((black * (N - black) - M))
else:
print((N * (N - 1) // 2 - M))
| import sys
sys.setrecursionlimit(100000)
N, M = list(map(int, input().split()))
adj = [[] for _ in range(N)]
for _ in range(M):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
adj[u].append(v)
adj[v].append(u)
color = [None] * N
def dfs(n, c):
color[n] = c
for nei in adj[n]:
if color[nei] is not None:
if color[nei] == c:
return False
elif not dfs(nei, 1 - c):
return False
# else:
# dfs(nei, 1-c)
return True
if dfs(0, 1):
print((color.count(1) * color.count(0) - M))
else:
print((N * (N - 1) // 2 - M))
| false | 6.25 | [
"-adj_list = {i: [] for i in range(1, N + 1)}",
"-for i in range(M):",
"- a, b = list(map(int, input().split()))",
"- adj_list[a].append(b)",
"- adj_list[b].append(a)",
"-visited = [False] * (N + 1)",
"-colors = [None] * (N)",
"-is_bipartite = True",
"-## improved dfs ###",
"-def dfs(node... | false | 0.040398 | 0.103494 | 0.390337 | [
"s744075643",
"s293788238"
] |
u634079249 | p02546 | python | s447679920 | s385469627 | 40 | 32 | 9,824 | 9,656 | Accepted | Accepted | 20 | import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
lcm = lambda x, y: (x * y) // math.gcd(x, y)
MOD = 10 ** 9 + 7
INF = float('inf')
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
s = iss()
print((s + 'es' if s[-1] == 's' else s + 's'))
if __name__ == '__main__':
main()
| import sys
import os
import math
import bisect
import itertools
import collections
import heapq
import queue
import array
# 時々使う
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque
# 再帰の制限設定
sys.setrecursionlimit(10000000)
def ii(): return int(sys.stdin.buffer.readline().rstrip())
def il(): return list(map(int, sys.stdin.buffer.readline().split()))
def fl(): return list(map(float, sys.stdin.buffer.readline().split()))
def iln(n): return [int(sys.stdin.buffer.readline().rstrip())
for _ in range(n)]
def iss(): return sys.stdin.buffer.readline().decode().rstrip()
def sl(): return list(map(str, sys.stdin.buffer.readline().decode().split()))
def isn(n): return [sys.stdin.buffer.readline().decode().rstrip()
for _ in range(n)]
def lcm(x, y): return (x * y) // math.gcd(x, y)
MOD = 10 ** 9 + 7
INF = float('inf')
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
S = iss()
if S[-1] == 's':
print((S + 'es'))
else:
print((S + 's'))
if __name__ == '__main__':
main()
| 33 | 52 | 1,046 | 1,226 | import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
lcm = lambda x, y: (x * y) // math.gcd(x, y)
MOD = 10**9 + 7
INF = float("inf")
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
s = iss()
print((s + "es" if s[-1] == "s" else s + "s"))
if __name__ == "__main__":
main()
| import sys
import os
import math
import bisect
import itertools
import collections
import heapq
import queue
import array
# 時々使う
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque
# 再帰の制限設定
sys.setrecursionlimit(10000000)
def ii():
return int(sys.stdin.buffer.readline().rstrip())
def il():
return list(map(int, sys.stdin.buffer.readline().split()))
def fl():
return list(map(float, sys.stdin.buffer.readline().split()))
def iln(n):
return [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
def iss():
return sys.stdin.buffer.readline().decode().rstrip()
def sl():
return list(map(str, sys.stdin.buffer.readline().decode().split()))
def isn(n):
return [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
def lcm(x, y):
return (x * y) // math.gcd(x, y)
MOD = 10**9 + 7
INF = float("inf")
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
S = iss()
if S[-1] == "s":
print((S + "es"))
else:
print((S + "s"))
if __name__ == "__main__":
main()
| false | 36.538462 | [
"-import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array",
"+import sys",
"+import os",
"+import math",
"+import bisect",
"+import itertools",
"+import collections",
"+import heapq",
"+import queue",
"+import array",
"+# 時々使う",
"+# 再帰の制限設定",
"-ii = lambda: int(sys.st... | false | 0.106747 | 0.101834 | 1.048249 | [
"s447679920",
"s385469627"
] |
u753803401 | p03355 | python | s168147013 | s427958089 | 227 | 182 | 43,760 | 39,792 | Accepted | Accepted | 19.82 | def main():
import sys
input = sys.stdin.readline
s = str(input().rstrip('\n'))
k = int(input().rstrip('\n'))
d = []
for i in range(len(s)):
for j in range(i + 1, min(i + 1 + k, len(s) + 1)):
d.append(s[i:j])
import collections
d = sorted(collections.Counter(d).most_common())
print((d[k-1][0]))
if __name__ == '__main__':
main()
| def slove():
import sys
import collections
input = sys.stdin.readline
t = str(input().rstrip('\n'))
s = collections.Counter(t).most_common()
k = int(input().rstrip('\n'))
s.sort()
d = {}
for key, v in s:
for i in range(len(t)):
if t[i] == key:
for j in range(i + 1, i + 6):
d[t[i:j]] = 1
if len(d) >= k:
print((sorted(d.items())[k-1][0]))
exit()
if __name__ == '__main__':
slove()
| 16 | 21 | 405 | 529 | def main():
import sys
input = sys.stdin.readline
s = str(input().rstrip("\n"))
k = int(input().rstrip("\n"))
d = []
for i in range(len(s)):
for j in range(i + 1, min(i + 1 + k, len(s) + 1)):
d.append(s[i:j])
import collections
d = sorted(collections.Counter(d).most_common())
print((d[k - 1][0]))
if __name__ == "__main__":
main()
| def slove():
import sys
import collections
input = sys.stdin.readline
t = str(input().rstrip("\n"))
s = collections.Counter(t).most_common()
k = int(input().rstrip("\n"))
s.sort()
d = {}
for key, v in s:
for i in range(len(t)):
if t[i] == key:
for j in range(i + 1, i + 6):
d[t[i:j]] = 1
if len(d) >= k:
print((sorted(d.items())[k - 1][0]))
exit()
if __name__ == "__main__":
slove()
| false | 23.809524 | [
"-def main():",
"+def slove():",
"+ import collections",
"- s = str(input().rstrip(\"\\n\"))",
"+ t = str(input().rstrip(\"\\n\"))",
"+ s = collections.Counter(t).most_common()",
"- d = []",
"- for i in range(len(s)):",
"- for j in range(i + 1, min(i + 1 + k, len(s) + 1)):",... | false | 0.09187 | 0.050518 | 1.818552 | [
"s168147013",
"s427958089"
] |
u729133443 | p02559 | python | s156627613 | s407229128 | 4,403 | 3,477 | 296,496 | 174,784 | Accepted | Accepted | 21.03 | def main():
def f(i,x):
while i<=n:
b[i]+=x
i+=i&-i
def g(i):
s=0
while i:
s+=b[i]
i-=i&-i
return s
(n,q,*w),a,*t=[list(map(int,t.split()))for t in open(0)]
b=[0]*-~n
*list(map(f,list(range(1,n+1)),a)),
for q,l,r in t:
if q:w+=g(r)-g(l),
else:f(l+1,r)
print((' '.join(map(str,w))))
main() | def main():
def f(i,x):
while i<=n:
b[i]+=x
i+=i&-i
def g(i):
s=0
while i:
s+=b[i]
i-=i&-i
return s
(n,q,*w),a,*t=[[*list(map(int,t.split()))]for t in open(0)]
b=[0]*-~n
*list(map(f,list(range(1,n+1)),a)),
for q,l,r in t:
if q:w+=g(r)-g(l),
else:f(l+1,r)
print((' '.join(map(str,w))))
main() | 19 | 19 | 348 | 351 | def main():
def f(i, x):
while i <= n:
b[i] += x
i += i & -i
def g(i):
s = 0
while i:
s += b[i]
i -= i & -i
return s
(n, q, *w), a, *t = [list(map(int, t.split())) for t in open(0)]
b = [0] * -~n
*list(map(f, list(range(1, n + 1)), a)),
for q, l, r in t:
if q:
w += (g(r) - g(l),)
else:
f(l + 1, r)
print((" ".join(map(str, w))))
main()
| def main():
def f(i, x):
while i <= n:
b[i] += x
i += i & -i
def g(i):
s = 0
while i:
s += b[i]
i -= i & -i
return s
(n, q, *w), a, *t = [[*list(map(int, t.split()))] for t in open(0)]
b = [0] * -~n
*list(map(f, list(range(1, n + 1)), a)),
for q, l, r in t:
if q:
w += (g(r) - g(l),)
else:
f(l + 1, r)
print((" ".join(map(str, w))))
main()
| false | 0 | [
"- (n, q, *w), a, *t = [list(map(int, t.split())) for t in open(0)]",
"+ (n, q, *w), a, *t = [[*list(map(int, t.split()))] for t in open(0)]"
] | false | 0.042505 | 0.045275 | 0.93881 | [
"s156627613",
"s407229128"
] |
u509405951 | p02995 | python | s065943585 | s881916167 | 35 | 17 | 5,048 | 3,064 | Accepted | Accepted | 51.43 | import fractions
A, B, C, D = list(map(int, input().split()))
A -= 1
lcm=C*D // fractions.gcd(C, D)
ex = A - (A // C + A // D - A // lcm)
num = B - (B // C + B // D - B // lcm)
print((num-ex)) | import math
def gcd(a,b):
while b!=0:
a,b=b,a%b
return a
def lcm(a,b):
if a >= b:
return a*b//gcd(a,b)
else:
return a*b//gcd(b,a)
A, B, C, D = list(map(int, input().split()))
A -= 1
k1 = A // C
k2 = B // C
k3 = A // D
k4 = B // D
k5 = k2 - k1 + 1
k6 = k4 - k3 + 1
lcm_num = lcm(C, D)
k7 = A // lcm_num
k8 = B // lcm_num
k9 = k8 - k7 + 1
print((B - A + 1 - k5 - k6 + k9)) | 11 | 32 | 201 | 430 | import fractions
A, B, C, D = list(map(int, input().split()))
A -= 1
lcm = C * D // fractions.gcd(C, D)
ex = A - (A // C + A // D - A // lcm)
num = B - (B // C + B // D - B // lcm)
print((num - ex))
| import math
def gcd(a, b):
while b != 0:
a, b = b, a % b
return a
def lcm(a, b):
if a >= b:
return a * b // gcd(a, b)
else:
return a * b // gcd(b, a)
A, B, C, D = list(map(int, input().split()))
A -= 1
k1 = A // C
k2 = B // C
k3 = A // D
k4 = B // D
k5 = k2 - k1 + 1
k6 = k4 - k3 + 1
lcm_num = lcm(C, D)
k7 = A // lcm_num
k8 = B // lcm_num
k9 = k8 - k7 + 1
print((B - A + 1 - k5 - k6 + k9))
| false | 65.625 | [
"-import fractions",
"+import math",
"+",
"+",
"+def gcd(a, b):",
"+ while b != 0:",
"+ a, b = b, a % b",
"+ return a",
"+",
"+",
"+def lcm(a, b):",
"+ if a >= b:",
"+ return a * b // gcd(a, b)",
"+ else:",
"+ return a * b // gcd(b, a)",
"+",
"-lcm = ... | false | 0.048183 | 0.064709 | 0.744618 | [
"s065943585",
"s881916167"
] |
u750651325 | p03680 | python | s082110976 | s613434081 | 209 | 190 | 7,084 | 14,376 | Accepted | Accepted | 9.09 |
N = int(eval(input()))
A = []
for i in range(N):
a = int(eval(input()))
A.append(a)
aaa = 0
ans = A[0]
count = 1
for i in range(N):
if ans == 2:
aaa = 1
break
else:
ans = A[ans-1]
count += 1
if aaa == 1:
print(count)
else:
print((-1))
| import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return eval(input())
def k(): return int(eval(input()))
def S(): return input().split()
def I(): return list(map(int,input().split()))
def X(): return list(eval(input()))
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 6)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")
al = "abcdefghijklmnopqrstuvwxyz"
AL = al.upper()
N = k()
A = []
for i in range(N):
a = k()
A.append(a)
aaa = 0
ans = A[0]
count = 1
for i in range(N):
if ans == 2:
aaa = 1
break
else:
ans = A[ans-1]
count += 1
if aaa == 1:
print(count)
else:
print((-1)) | 23 | 46 | 315 | 895 | N = int(eval(input()))
A = []
for i in range(N):
a = int(eval(input()))
A.append(a)
aaa = 0
ans = A[0]
count = 1
for i in range(N):
if ans == 2:
aaa = 1
break
else:
ans = A[ans - 1]
count += 1
if aaa == 1:
print(count)
else:
print((-1))
| import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque, Counter
from decimal import Decimal
import functools
def v():
return eval(input())
def k():
return int(eval(input()))
def S():
return input().split()
def I():
return list(map(int, input().split()))
def X():
return list(eval(input()))
def L():
return list(input().split())
def l():
return list(map(int, input().split()))
def lcm(a, b):
return a * b // math.gcd(a, b)
sys.setrecursionlimit(10**6)
mod = 10**9 + 7
cnt = 0
ans = 0
inf = float("inf")
al = "abcdefghijklmnopqrstuvwxyz"
AL = al.upper()
N = k()
A = []
for i in range(N):
a = k()
A.append(a)
aaa = 0
ans = A[0]
count = 1
for i in range(N):
if ans == 2:
aaa = 1
break
else:
ans = A[ans - 1]
count += 1
if aaa == 1:
print(count)
else:
print((-1))
| false | 50 | [
"-N = int(eval(input()))",
"+import re",
"+import sys",
"+import math",
"+import itertools",
"+import bisect",
"+from copy import copy",
"+from collections import deque, Counter",
"+from decimal import Decimal",
"+import functools",
"+",
"+",
"+def v():",
"+ return eval(input())",
"+"... | false | 0.153762 | 0.040096 | 3.834823 | [
"s082110976",
"s613434081"
] |
u261103969 | p02935 | python | s543569443 | s530667387 | 150 | 64 | 11,976 | 61,652 | Accepted | Accepted | 57.33 | import sys
import math
import bisect
import numpy as np
input = sys.stdin.readline
MOD = 10**9 + 7
INF = float('INF')
def main():
n = int(eval(input()))
v = list(map(float,input().split()))
v = np.array(v)
v.sort()
for i in range(n, 1, -1):
v[:i] = v[:i] * 0.5
ans = sum(v)
print(ans)
if __name__ == '__main__':
main() | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
N = int(readline())
v = list(map(int, readline().split()))
v.sort()
cur = v[0]
for i in range(1, N):
cur += v[i]
cur /= 2
print(cur)
if __name__ == '__main__':
main()
| 23 | 23 | 379 | 361 | import sys
import math
import bisect
import numpy as np
input = sys.stdin.readline
MOD = 10**9 + 7
INF = float("INF")
def main():
n = int(eval(input()))
v = list(map(float, input().split()))
v = np.array(v)
v.sort()
for i in range(n, 1, -1):
v[:i] = v[:i] * 0.5
ans = sum(v)
print(ans)
if __name__ == "__main__":
main()
| import sys
readline = sys.stdin.readline
MOD = 10**9 + 7
INF = float("INF")
sys.setrecursionlimit(10**5)
def main():
N = int(readline())
v = list(map(int, readline().split()))
v.sort()
cur = v[0]
for i in range(1, N):
cur += v[i]
cur /= 2
print(cur)
if __name__ == "__main__":
main()
| false | 0 | [
"-import math",
"-import bisect",
"-import numpy as np",
"-input = sys.stdin.readline",
"+readline = sys.stdin.readline",
"+sys.setrecursionlimit(10**5)",
"- n = int(eval(input()))",
"- v = list(map(float, input().split()))",
"- v = np.array(v)",
"+ N = int(readline())",
"+ v = li... | false | 0.506699 | 0.007605 | 66.627564 | [
"s543569443",
"s530667387"
] |
u018679195 | p03564 | python | s778033951 | s456107586 | 17 | 10 | 2,940 | 2,568 | Accepted | Accepted | 41.18 | N = int(eval(input()))
K = int(eval(input()))
x = 1
for i in range (N):
if x*2 < x + K:
x=x*2
else:
x = x + K
print(x) | n=int(input())
k=int(input())
ip=1
for i in range(n):
if ip*2-ip<k:
ip=ip*2
else:
ip=ip+k
print(ip) | 9 | 11 | 138 | 126 | N = int(eval(input()))
K = int(eval(input()))
x = 1
for i in range(N):
if x * 2 < x + K:
x = x * 2
else:
x = x + K
print(x)
| n = int(input())
k = int(input())
ip = 1
for i in range(n):
if ip * 2 - ip < k:
ip = ip * 2
else:
ip = ip + k
print(ip)
| false | 18.181818 | [
"-N = int(eval(input()))",
"-K = int(eval(input()))",
"-x = 1",
"-for i in range(N):",
"- if x * 2 < x + K:",
"- x = x * 2",
"+n = int(input())",
"+k = int(input())",
"+ip = 1",
"+for i in range(n):",
"+ if ip * 2 - ip < k:",
"+ ip = ip * 2",
"- x = x + K",
"-pri... | false | 0.036985 | 0.071902 | 0.514374 | [
"s778033951",
"s456107586"
] |
u964998676 | p03478 | python | s773021667 | s898777487 | 37 | 34 | 3,060 | 2,940 | Accepted | Accepted | 8.11 | N, A, B = list(map(int, input('').split()))
total = 0
for x in range(1, N + 1):
num = str(x)
digit_total = 0
for y in range(len(num)):
digit_total += int(num[y])
if digit_total >= A and digit_total <= B:
total += x
print(total) | N, A, B = list(map(int, input('').split()))
answer = 0
for x in range(1, N + 1):
total = sum(int(d) for d in str(x))
if A <= total <= B:
answer += x
print(answer) | 11 | 8 | 254 | 178 | N, A, B = list(map(int, input("").split()))
total = 0
for x in range(1, N + 1):
num = str(x)
digit_total = 0
for y in range(len(num)):
digit_total += int(num[y])
if digit_total >= A and digit_total <= B:
total += x
print(total)
| N, A, B = list(map(int, input("").split()))
answer = 0
for x in range(1, N + 1):
total = sum(int(d) for d in str(x))
if A <= total <= B:
answer += x
print(answer)
| false | 27.272727 | [
"-total = 0",
"+answer = 0",
"- num = str(x)",
"- digit_total = 0",
"- for y in range(len(num)):",
"- digit_total += int(num[y])",
"- if digit_total >= A and digit_total <= B:",
"- total += x",
"-print(total)",
"+ total = sum(int(d) for d in str(x))",
"+ if A <= t... | false | 0.037521 | 0.037861 | 0.991045 | [
"s773021667",
"s898777487"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.