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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u627803856 | p02594 | python | s524875282 | s530436894 | 86 | 64 | 61,516 | 61,768 | Accepted | Accepted | 25.58 | x = int(eval(input()))
if x >= 30:
print('Yes')
else:
print('No') | x = int(input())
print('Yes') if x >= 30 else print('No')
| 6 | 2 | 73 | 58 | x = int(eval(input()))
if x >= 30:
print("Yes")
else:
print("No")
| x = int(input())
print("Yes") if x >= 30 else print("No")
| false | 66.666667 | [
"-x = int(eval(input()))",
"-if x >= 30:",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"+x = int(input())",
"+print(\"Yes\") if x >= 30 else print(\"No\")"
]
| false | 0.037568 | 0.038342 | 0.979802 | [
"s524875282",
"s530436894"
]
|
u633068244 | p00179 | python | s095322411 | s903376574 | 2,010 | 950 | 6,764 | 6,216 | Accepted | Accepted | 52.74 | rgb = set(["r","g","b"])
while 1:
worm = input()
if worm == "0": break
n = len(worm)
L = 1
cnt = flag = 0
queset = set([worm])
ref = set()
while 1:
que = list(queset)
queset = set()
for Worm in que:
if len(set(Worm)) == 1:
flag = 1
break
for i in range(n-1):
if Worm[i] != Worm[i+1]:
nextclr = list(rgb-set(Worm[i:i+2]))[0]
worm = Worm[:i] + 2*nextclr + Worm[i+2:]
queset.add(worm)
queset = queset - ref
ref = ref|queset
L = len(queset)
if flag: break
cnt += 1
if cnt > 15: break
print(cnt if flag else "NA") | dic = {"r":1,"g":2,"b":3}
rgb = ["r","g","b"]
while 1:
worm = input()
if worm == "0": break
n = len(worm)
ref = ["r"*n,"g"*n,"b"*n]
cnt = flag = 0
queset = set([worm])
done = set()
while 1:
que = list(queset)
queset = set()
for Worm in que:
if Worm in ref:
flag = 1
break
for i in range(n-1):
if Worm[i] != Worm[i+1]:
nextclr = rgb[5-dic[Worm[i]]-dic[Worm[i+1]]]
queset.add(Worm[:i] + 2*nextclr + Worm[i+2:])
if flag or cnt > 14: break
cnt += 1
queset -= done
done |= queset
print(cnt if flag else "NA") | 28 | 26 | 598 | 582 | rgb = set(["r", "g", "b"])
while 1:
worm = input()
if worm == "0":
break
n = len(worm)
L = 1
cnt = flag = 0
queset = set([worm])
ref = set()
while 1:
que = list(queset)
queset = set()
for Worm in que:
if len(set(Worm)) == 1:
flag = 1
break
for i in range(n - 1):
if Worm[i] != Worm[i + 1]:
nextclr = list(rgb - set(Worm[i : i + 2]))[0]
worm = Worm[:i] + 2 * nextclr + Worm[i + 2 :]
queset.add(worm)
queset = queset - ref
ref = ref | queset
L = len(queset)
if flag:
break
cnt += 1
if cnt > 15:
break
print(cnt if flag else "NA")
| dic = {"r": 1, "g": 2, "b": 3}
rgb = ["r", "g", "b"]
while 1:
worm = input()
if worm == "0":
break
n = len(worm)
ref = ["r" * n, "g" * n, "b" * n]
cnt = flag = 0
queset = set([worm])
done = set()
while 1:
que = list(queset)
queset = set()
for Worm in que:
if Worm in ref:
flag = 1
break
for i in range(n - 1):
if Worm[i] != Worm[i + 1]:
nextclr = rgb[5 - dic[Worm[i]] - dic[Worm[i + 1]]]
queset.add(Worm[:i] + 2 * nextclr + Worm[i + 2 :])
if flag or cnt > 14:
break
cnt += 1
queset -= done
done |= queset
print(cnt if flag else "NA")
| false | 7.142857 | [
"-rgb = set([\"r\", \"g\", \"b\"])",
"+dic = {\"r\": 1, \"g\": 2, \"b\": 3}",
"+rgb = [\"r\", \"g\", \"b\"]",
"- L = 1",
"+ ref = [\"r\" * n, \"g\" * n, \"b\" * n]",
"- ref = set()",
"+ done = set()",
"- if len(set(Worm)) == 1:",
"+ if Worm in ref:",
"- nextclr = list(rgb - set(Worm[i : i + 2]))[0]",
"- worm = Worm[:i] + 2 * nextclr + Worm[i + 2 :]",
"- queset.add(worm)",
"- queset = queset - ref",
"- ref = ref | queset",
"- L = len(queset)",
"- if flag:",
"+ nextclr = rgb[5 - dic[Worm[i]] - dic[Worm[i + 1]]]",
"+ queset.add(Worm[:i] + 2 * nextclr + Worm[i + 2 :])",
"+ if flag or cnt > 14:",
"- if cnt > 15:",
"- break",
"+ queset -= done",
"+ done |= queset"
]
| false | 0.254494 | 0.106316 | 2.393759 | [
"s095322411",
"s903376574"
]
|
u994307795 | p02779 | python | s822685904 | s566612284 | 139 | 82 | 44,336 | 25,172 | Accepted | Accepted | 41.01 | n = int(eval(input()))
a = list(map(int, input().split()))
d = {}
for i in a:
if i in d:
print("NO")
exit()
d[i] = i
print("YES") | n = int(eval(input()))
a = list(map(int, input().split()))
print(('YES' if len(a) == len(set(a)) else 'NO')) | 11 | 3 | 135 | 102 | n = int(eval(input()))
a = list(map(int, input().split()))
d = {}
for i in a:
if i in d:
print("NO")
exit()
d[i] = i
print("YES")
| n = int(eval(input()))
a = list(map(int, input().split()))
print(("YES" if len(a) == len(set(a)) else "NO"))
| false | 72.727273 | [
"-d = {}",
"-for i in a:",
"- if i in d:",
"- print(\"NO\")",
"- exit()",
"- d[i] = i",
"-print(\"YES\")",
"+print((\"YES\" if len(a) == len(set(a)) else \"NO\"))"
]
| false | 0.036887 | 0.036658 | 1.006244 | [
"s822685904",
"s566612284"
]
|
u982594421 | p03830 | python | s623902454 | s608217091 | 295 | 111 | 3,316 | 3,316 | Accepted | Accepted | 62.37 | from math import factorial
from collections import Counter
def primes(n):
a = [0] * (n + 1)
a[0] = 1
a[1] = 1
i = 2
while n // i >= i:
if a[i] != 0:
i += 1
continue
j = 2 * i
while j <= n:
a[j] = 1
j += i
i += 1
for i, ai in enumerate(a):
if ai == 0:
yield i
n = int(eval(input()))
f = factorial(n)
counter = Counter()
while f > 1:
for p in primes(n):
if f % p == 0:
counter[p] += 1
f = f // p
ans = 1
for val in list(counter.values()):
ans *= (val + 1)
print((ans % (10**9 + 7))) | from math import factorial
from collections import Counter
def prime(n):
a = [0] * (n + 1)
a[0] = 1
a[1] = 1
i = 2
while n // i >= i:
if a[i] != 0:
i += 1
continue
j = 2 * i
while j <= n:
a[j] = 1
j += i
i += 1
return [i for i, ai in enumerate(a) if ai == 0]
n = int(eval(input()))
f = factorial(n)
primes = prime(n)
counter = Counter()
while f > 1:
for p in primes:
if f % p == 0:
counter[p] += 1
f = f // p
ans = 1
for val in list(counter.values()):
ans *= (val + 1)
print((ans % (10**9 + 7))) | 37 | 36 | 672 | 666 | from math import factorial
from collections import Counter
def primes(n):
a = [0] * (n + 1)
a[0] = 1
a[1] = 1
i = 2
while n // i >= i:
if a[i] != 0:
i += 1
continue
j = 2 * i
while j <= n:
a[j] = 1
j += i
i += 1
for i, ai in enumerate(a):
if ai == 0:
yield i
n = int(eval(input()))
f = factorial(n)
counter = Counter()
while f > 1:
for p in primes(n):
if f % p == 0:
counter[p] += 1
f = f // p
ans = 1
for val in list(counter.values()):
ans *= val + 1
print((ans % (10**9 + 7)))
| from math import factorial
from collections import Counter
def prime(n):
a = [0] * (n + 1)
a[0] = 1
a[1] = 1
i = 2
while n // i >= i:
if a[i] != 0:
i += 1
continue
j = 2 * i
while j <= n:
a[j] = 1
j += i
i += 1
return [i for i, ai in enumerate(a) if ai == 0]
n = int(eval(input()))
f = factorial(n)
primes = prime(n)
counter = Counter()
while f > 1:
for p in primes:
if f % p == 0:
counter[p] += 1
f = f // p
ans = 1
for val in list(counter.values()):
ans *= val + 1
print((ans % (10**9 + 7)))
| false | 2.702703 | [
"-def primes(n):",
"+def prime(n):",
"- for i, ai in enumerate(a):",
"- if ai == 0:",
"- yield i",
"+ return [i for i, ai in enumerate(a) if ai == 0]",
"+primes = prime(n)",
"- for p in primes(n):",
"+ for p in primes:"
]
| false | 0.085666 | 0.165728 | 0.516906 | [
"s623902454",
"s608217091"
]
|
u823885866 | p02881 | python | s403389073 | s088990063 | 400 | 296 | 12,584 | 21,244 | Accepted | Accepted | 26 | import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
rr = lambda: sys.stdin.buffer.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.buffer.readline())
rm = lambda: list(map(int, sys.stdin.buffer.readline().split()))
rl = lambda: list(map(int, sys.stdin.buffer.readline().split()))
m = float('inf')
n = ri()
for i in range(1, int(n**0.5) + 1):
a = n//i
if a*i == n:
if m > a+i:
m = a+i
else:
print((m-2))
| import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
rr = lambda: sys.stdin.buffer.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.buffer.readline())
rm = lambda: list(map(int, sys.stdin.buffer.readline().split()))
rl = lambda: list(map(int, sys.stdin.buffer.readline().split()))
n = ri()
for i in range(int(n**0.5), 0, -1):
if not n%i:
print((n//i + i - 2))
exit()
| 25 | 21 | 535 | 498 | import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
rr = lambda: sys.stdin.buffer.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.buffer.readline())
rm = lambda: list(map(int, sys.stdin.buffer.readline().split()))
rl = lambda: list(map(int, sys.stdin.buffer.readline().split()))
m = float("inf")
n = ri()
for i in range(1, int(n**0.5) + 1):
a = n // i
if a * i == n:
if m > a + i:
m = a + i
else:
print((m - 2))
| import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
rr = lambda: sys.stdin.buffer.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.buffer.readline())
rm = lambda: list(map(int, sys.stdin.buffer.readline().split()))
rl = lambda: list(map(int, sys.stdin.buffer.readline().split()))
n = ri()
for i in range(int(n**0.5), 0, -1):
if not n % i:
print((n // i + i - 2))
exit()
| false | 16 | [
"-m = float(\"inf\")",
"-for i in range(1, int(n**0.5) + 1):",
"- a = n // i",
"- if a * i == n:",
"- if m > a + i:",
"- m = a + i",
"-else:",
"- print((m - 2))",
"+for i in range(int(n**0.5), 0, -1):",
"+ if not n % i:",
"+ print((n // i + i - 2))",
"+ exit()"
]
| false | 0.056986 | 0.052843 | 1.078406 | [
"s403389073",
"s088990063"
]
|
u204842730 | p02613 | python | s341955058 | s991444401 | 147 | 49 | 16,224 | 17,504 | Accepted | Accepted | 66.67 | import collections
n=int(eval(input()))
s=[None]*n
for i in range(n):
s[i]=eval(input())
c=collections.Counter(s)
print(("AC x " + str(c["AC"])))
print(("WA x " + str(c["WA"])))
print(("TLE x " + str(c["TLE"])))
print(("RE x " + str(c["RE"]))) | import collections
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
n=int(readline())
s=read().decode().splitlines()
c=collections.Counter(s)
print(("AC x " + str(c["AC"])))
print(("WA x " + str(c["WA"])))
print(("TLE x " + str(c["TLE"])))
print(("RE x " + str(c["RE"]))) | 10 | 11 | 236 | 301 | import collections
n = int(eval(input()))
s = [None] * n
for i in range(n):
s[i] = eval(input())
c = collections.Counter(s)
print(("AC x " + str(c["AC"])))
print(("WA x " + str(c["WA"])))
print(("TLE x " + str(c["TLE"])))
print(("RE x " + str(c["RE"])))
| import collections
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
n = int(readline())
s = read().decode().splitlines()
c = collections.Counter(s)
print(("AC x " + str(c["AC"])))
print(("WA x " + str(c["WA"])))
print(("TLE x " + str(c["TLE"])))
print(("RE x " + str(c["RE"])))
| false | 9.090909 | [
"+import sys",
"-n = int(eval(input()))",
"-s = [None] * n",
"-for i in range(n):",
"- s[i] = eval(input())",
"+read = sys.stdin.buffer.read",
"+readline = sys.stdin.buffer.readline",
"+n = int(readline())",
"+s = read().decode().splitlines()"
]
| false | 0.035135 | 0.039242 | 0.895345 | [
"s341955058",
"s991444401"
]
|
u281303342 | p04014 | python | s616880027 | s950951884 | 587 | 475 | 3,064 | 3,064 | Accepted | Accepted | 19.08 | N = int(eval(input()))
S = int(eval(input()))
def f(b,n):
if n//b==0:
return n
else:
return n%b + f(b,n//b)
ans = -1
if S==N:
ans = N+1
else:
for b in range(2,int(N**.5)+1):
if f(b,N)==S:
ans = b
break
if ans == -1:
for i in range(int(N**.5)+1,0,-1):
b = (N-S)//i + 1
if b>1:
if f(b,N)==S:
ans = b
break
print(ans) | # python3 (3.4.3)
import sys
input = sys.stdin.readline
# main
N = int(eval(input()))
S = int(eval(input()))
def f(b,n):
if n < b:
return n
else:
return f(b, n//b) + n%b
ans = -1
if S==N:
ans = N+1
else:
# bをN^(1/2)まで全探索
for b in range(2, int(N**.5)+1):
if f(b,N)==S:
ans = b
break
# まだ答えが見つからなければ
if ans == -1:
# bがN^(1/2)より大きい可能性が残っており、b進数で表すと2桁
# 1 <= p < b, N = pb+q <= pb < p^2, p > N^(1/2) なので pで全探索
# p+q = S より b = (N-S)/p+1
for p in range(int(N**.5)+1,0,-1):
b = (N-S)//p + 1
# bが1のときは対象外にしないと無限ループ！
if b >= 2 and f(b,N)==S:
ans = b
break
print(ans)
| 27 | 37 | 460 | 720 | N = int(eval(input()))
S = int(eval(input()))
def f(b, n):
if n // b == 0:
return n
else:
return n % b + f(b, n // b)
ans = -1
if S == N:
ans = N + 1
else:
for b in range(2, int(N**0.5) + 1):
if f(b, N) == S:
ans = b
break
if ans == -1:
for i in range(int(N**0.5) + 1, 0, -1):
b = (N - S) // i + 1
if b > 1:
if f(b, N) == S:
ans = b
break
print(ans)
| # python3 (3.4.3)
import sys
input = sys.stdin.readline
# main
N = int(eval(input()))
S = int(eval(input()))
def f(b, n):
if n < b:
return n
else:
return f(b, n // b) + n % b
ans = -1
if S == N:
ans = N + 1
else:
# bをN^(1/2)まで全探索
for b in range(2, int(N**0.5) + 1):
if f(b, N) == S:
ans = b
break
# まだ答えが見つからなければ
if ans == -1:
# bがN^(1/2)より大きい可能性が残っており、b進数で表すと2桁
# 1 <= p < b, N = pb+q <= pb < p^2, p > N^(1/2) なので pで全探索
# p+q = S より b = (N-S)/p+1
for p in range(int(N**0.5) + 1, 0, -1):
b = (N - S) // p + 1
# bが1のときは対象外にしないと無限ループ！
if b >= 2 and f(b, N) == S:
ans = b
break
print(ans)
| false | 27.027027 | [
"+# python3 (3.4.3)",
"+import sys",
"+",
"+input = sys.stdin.readline",
"+# main",
"- if n // b == 0:",
"+ if n < b:",
"- return n % b + f(b, n // b)",
"+ return f(b, n // b) + n % b",
"+ # bをN^(1/2)まで全探索",
"+# まだ答えが見つからなければ",
"- for i in range(int(N**0.5) + 1, 0, -1):",
"- b = (N - S) // i + 1",
"- if b > 1:",
"- if f(b, N) == S:",
"- ans = b",
"- break",
"+ # bがN^(1/2)より大きい可能性が残っており、b進数で表すと2桁",
"+ # 1 <= p < b, N = pb+q <= pb < p^2, p > N^(1/2) なので pで全探索",
"+ # p+q = S より b = (N-S)/p+1",
"+ for p in range(int(N**0.5) + 1, 0, -1):",
"+ b = (N - S) // p + 1",
"+ # bが1のときは対象外にしないと無限ループ！",
"+ if b >= 2 and f(b, N) == S:",
"+ ans = b",
"+ break"
]
| false | 0.102359 | 0.348887 | 0.293389 | [
"s616880027",
"s950951884"
]
|
u260980560 | p02373 | python | s607379843 | s604336117 | 2,150 | 1,300 | 49,660 | 70,388 | Accepted | Accepted | 39.53 | from collections import deque
n = eval(input())
C = [None]*n
P = [None]*n
for i in range(n):
ipt = list(map(int, input().split()))
C[i] = ipt[1:]
for c in C[i]:
P[c] = i
LEV = (n+1).bit_length()
parent = [[None]*(LEV + 1) for i in range(n)]
for i in range(n):
parent[i][0] = P[i]
for k in range(LEV):
for i in range(n):
if parent[i][k] is None:
parent[i][k+1] = None
else:
parent[i][k+1] = parent[parent[i][k]][k]
depth = [None]*n
deq = deque()
deq.append(0)
depth[0] = 0
while deq:
v = deq.popleft()
for c in C[v]:
deq.append(c)
depth[c] = depth[v] + 1
q = eval(input())
for t in range(q):
u, v = list(map(int, input().split()))
if not depth[u] < depth[v]:
u, v = v, u
for k in range(LEV+1):
if ((depth[v] - depth[u]) >> k) & 1:
v = parent[v][k]
if u == v:
print(u)
continue
for k in range(LEV, -1, -1):
if parent[u][k] != parent[v][k]:
u = parent[u][k]
v = parent[v][k]
print(parent[u][0]) | import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
write = sys.stdout.write
N = int(readline())
G = [None]*N
for v in range(N):
k, *G[v] = list(map(int, readline().split()))
S = []
FS = [0]*N
depth = [0]*N
*it, = list(map(iter, G))
P = [-1]*N
stk = [0]
depth[0] = 0
FS[0] = 0
while stk:
v = stk[-1]
p = P[v]
S.append(v)
w = next(it[v], -1)
while w != -1:
if w != p:
P[w] = v
depth[w] = len(stk)
FS[w] = len(S)
stk.append(w)
break
w = next(it[v], -1)
else:
stk.pop()
L = len(S)
lg = [0]*(L + 1)
for i in range(2, L+1):
lg[i] = lg[i >> 1] + 1
st = [None]*(lg[L] + 1)
st0 = st[0] = S
b = 1
for i in range(lg[L]):
st0 = st[i+1] = [p if depth[p] <= depth[q] else q for p, q in zip(st0, st0[b:])]
b <<= 1
def query(u, v):
x = FS[u]; y = FS[v]
if x > y:
x, y = y, x
l = lg[y - x + 1]
px = st[l][x]; py = st[l][y - (1 << l) + 1]
return px if depth[px] <= depth[py] else py
Q = int(readline())
ans = []
for q in range(Q):
u, v = list(map(int, readline().split()))
ans.append(query(u, v))
write("\n".join(map(str, ans)))
write("\n")
| 47 | 65 | 1,122 | 1,258 | from collections import deque
n = eval(input())
C = [None] * n
P = [None] * n
for i in range(n):
ipt = list(map(int, input().split()))
C[i] = ipt[1:]
for c in C[i]:
P[c] = i
LEV = (n + 1).bit_length()
parent = [[None] * (LEV + 1) for i in range(n)]
for i in range(n):
parent[i][0] = P[i]
for k in range(LEV):
for i in range(n):
if parent[i][k] is None:
parent[i][k + 1] = None
else:
parent[i][k + 1] = parent[parent[i][k]][k]
depth = [None] * n
deq = deque()
deq.append(0)
depth[0] = 0
while deq:
v = deq.popleft()
for c in C[v]:
deq.append(c)
depth[c] = depth[v] + 1
q = eval(input())
for t in range(q):
u, v = list(map(int, input().split()))
if not depth[u] < depth[v]:
u, v = v, u
for k in range(LEV + 1):
if ((depth[v] - depth[u]) >> k) & 1:
v = parent[v][k]
if u == v:
print(u)
continue
for k in range(LEV, -1, -1):
if parent[u][k] != parent[v][k]:
u = parent[u][k]
v = parent[v][k]
print(parent[u][0])
| import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
write = sys.stdout.write
N = int(readline())
G = [None] * N
for v in range(N):
k, *G[v] = list(map(int, readline().split()))
S = []
FS = [0] * N
depth = [0] * N
(*it,) = list(map(iter, G))
P = [-1] * N
stk = [0]
depth[0] = 0
FS[0] = 0
while stk:
v = stk[-1]
p = P[v]
S.append(v)
w = next(it[v], -1)
while w != -1:
if w != p:
P[w] = v
depth[w] = len(stk)
FS[w] = len(S)
stk.append(w)
break
w = next(it[v], -1)
else:
stk.pop()
L = len(S)
lg = [0] * (L + 1)
for i in range(2, L + 1):
lg[i] = lg[i >> 1] + 1
st = [None] * (lg[L] + 1)
st0 = st[0] = S
b = 1
for i in range(lg[L]):
st0 = st[i + 1] = [p if depth[p] <= depth[q] else q for p, q in zip(st0, st0[b:])]
b <<= 1
def query(u, v):
x = FS[u]
y = FS[v]
if x > y:
x, y = y, x
l = lg[y - x + 1]
px = st[l][x]
py = st[l][y - (1 << l) + 1]
return px if depth[px] <= depth[py] else py
Q = int(readline())
ans = []
for q in range(Q):
u, v = list(map(int, readline().split()))
ans.append(query(u, v))
write("\n".join(map(str, ans)))
write("\n")
| false | 27.692308 | [
"-from collections import deque",
"+import sys",
"-n = eval(input())",
"-C = [None] * n",
"-P = [None] * n",
"-for i in range(n):",
"- ipt = list(map(int, input().split()))",
"- C[i] = ipt[1:]",
"- for c in C[i]:",
"- P[c] = i",
"-LEV = (n + 1).bit_length()",
"-parent = [[None] * (LEV + 1) for i in range(n)]",
"-for i in range(n):",
"- parent[i][0] = P[i]",
"-for k in range(LEV):",
"- for i in range(n):",
"- if parent[i][k] is None:",
"- parent[i][k + 1] = None",
"- else:",
"- parent[i][k + 1] = parent[parent[i][k]][k]",
"-depth = [None] * n",
"-deq = deque()",
"-deq.append(0)",
"+sys.setrecursionlimit(10**6)",
"+readline = sys.stdin.readline",
"+write = sys.stdout.write",
"+N = int(readline())",
"+G = [None] * N",
"+for v in range(N):",
"+ k, *G[v] = list(map(int, readline().split()))",
"+S = []",
"+FS = [0] * N",
"+depth = [0] * N",
"+(*it,) = list(map(iter, G))",
"+P = [-1] * N",
"+stk = [0]",
"-while deq:",
"- v = deq.popleft()",
"- for c in C[v]:",
"- deq.append(c)",
"- depth[c] = depth[v] + 1",
"-q = eval(input())",
"-for t in range(q):",
"- u, v = list(map(int, input().split()))",
"- if not depth[u] < depth[v]:",
"- u, v = v, u",
"- for k in range(LEV + 1):",
"- if ((depth[v] - depth[u]) >> k) & 1:",
"- v = parent[v][k]",
"- if u == v:",
"- print(u)",
"- continue",
"- for k in range(LEV, -1, -1):",
"- if parent[u][k] != parent[v][k]:",
"- u = parent[u][k]",
"- v = parent[v][k]",
"- print(parent[u][0])",
"+FS[0] = 0",
"+while stk:",
"+ v = stk[-1]",
"+ p = P[v]",
"+ S.append(v)",
"+ w = next(it[v], -1)",
"+ while w != -1:",
"+ if w != p:",
"+ P[w] = v",
"+ depth[w] = len(stk)",
"+ FS[w] = len(S)",
"+ stk.append(w)",
"+ break",
"+ w = next(it[v], -1)",
"+ else:",
"+ stk.pop()",
"+L = len(S)",
"+lg = [0] * (L + 1)",
"+for i in range(2, L + 1):",
"+ lg[i] = lg[i >> 1] + 1",
"+st = [None] * (lg[L] + 1)",
"+st0 = st[0] = S",
"+b = 1",
"+for i in range(lg[L]):",
"+ st0 = st[i + 1] = [p if depth[p] <= depth[q] else q for p, q in zip(st0, st0[b:])]",
"+ b <<= 1",
"+",
"+",
"+def query(u, v):",
"+ x = FS[u]",
"+ y = FS[v]",
"+ if x > y:",
"+ x, y = y, x",
"+ l = lg[y - x + 1]",
"+ px = st[l][x]",
"+ py = st[l][y - (1 << l) + 1]",
"+ return px if depth[px] <= depth[py] else py",
"+",
"+",
"+Q = int(readline())",
"+ans = []",
"+for q in range(Q):",
"+ u, v = list(map(int, readline().split()))",
"+ ans.append(query(u, v))",
"+write(\"\\n\".join(map(str, ans)))",
"+write(\"\\n\")"
]
| false | 0.042199 | 0.007318 | 5.76652 | [
"s607379843",
"s604336117"
]
|
u441175813 | p02946 | python | s750100884 | s652217337 | 65 | 59 | 62,304 | 62,268 | Accepted | Accepted | 9.23 | k, x = map(int, input().split())
ans = [x]
for sign in [-1, 1]:
for i in range(1, k):
ans.append(x + sign*i)
ans.sort()
for i in range(len(ans)):
print(ans[i], end=" ")
| k, x = map(int, input().split())
for i in range(x-k+1, x+k):
print(i, end=" ")
| 9 | 4 | 193 | 86 | k, x = map(int, input().split())
ans = [x]
for sign in [-1, 1]:
for i in range(1, k):
ans.append(x + sign * i)
ans.sort()
for i in range(len(ans)):
print(ans[i], end=" ")
| k, x = map(int, input().split())
for i in range(x - k + 1, x + k):
print(i, end=" ")
| false | 55.555556 | [
"-ans = [x]",
"-for sign in [-1, 1]:",
"- for i in range(1, k):",
"- ans.append(x + sign * i)",
"-ans.sort()",
"-for i in range(len(ans)):",
"- print(ans[i], end=\" \")",
"+for i in range(x - k + 1, x + k):",
"+ print(i, end=\" \")"
]
| false | 0.035879 | 0.030961 | 1.158853 | [
"s750100884",
"s652217337"
]
|
u426534722 | p02290 | python | s710495913 | s748480352 | 30 | 20 | 7,984 | 7,968 | Accepted | Accepted | 33.33 | import sys
from itertools import starmap
readline = sys.stdin.readline
p0, p1 = starmap(complex, list(zip(*[list(map(int, readline().split()))] * 2)))
n = int(readline())
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def norm(base):
return base.real * base.real + base.imag * base.imag
def project(p0, p1, p2):
base = p0 - p1
r = dot(p2 - p0, base) / norm(base)
return p0 + base * r
for _ in [0] * n:
p2 = complex(*[int(i) for i in readline().split()])
ap = project(p0, p1, p2)
print((ap.real, ap.imag)) | import sys
from itertools import starmap
readline = sys.stdin.readline
class Segment(object):
__slots__ = ('fi', 'se')
def __init__(self, fi, se):
self.fi = fi
self.se = se
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def norm(base):
return abs(base) ** 2
def project(s, p2):
base = s.fi - s.se
r = dot(p2 - s.fi, base) / norm(base)
return s.fi + base * r
s = Segment(*list(starmap(complex, list(zip(*[list(map(int, readline().split()))] * 2)))))
n = int(readline())
for _ in [0] * n:
p2 = complex(*[int(i) for i in readline().split()])
ap = project(s, p2)
print((ap.real, ap.imag)) | 19 | 24 | 611 | 720 | import sys
from itertools import starmap
readline = sys.stdin.readline
p0, p1 = starmap(complex, list(zip(*[list(map(int, readline().split()))] * 2)))
n = int(readline())
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def norm(base):
return base.real * base.real + base.imag * base.imag
def project(p0, p1, p2):
base = p0 - p1
r = dot(p2 - p0, base) / norm(base)
return p0 + base * r
for _ in [0] * n:
p2 = complex(*[int(i) for i in readline().split()])
ap = project(p0, p1, p2)
print((ap.real, ap.imag))
| import sys
from itertools import starmap
readline = sys.stdin.readline
class Segment(object):
__slots__ = ("fi", "se")
def __init__(self, fi, se):
self.fi = fi
self.se = se
def cross(a, b):
return a.real * b.imag - a.imag * b.real
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def norm(base):
return abs(base) ** 2
def project(s, p2):
base = s.fi - s.se
r = dot(p2 - s.fi, base) / norm(base)
return s.fi + base * r
s = Segment(
*list(starmap(complex, list(zip(*[list(map(int, readline().split()))] * 2))))
)
n = int(readline())
for _ in [0] * n:
p2 = complex(*[int(i) for i in readline().split()])
ap = project(s, p2)
print((ap.real, ap.imag))
| false | 20.833333 | [
"-p0, p1 = starmap(complex, list(zip(*[list(map(int, readline().split()))] * 2)))",
"-n = int(readline())",
"+",
"+",
"+class Segment(object):",
"+ __slots__ = (\"fi\", \"se\")",
"+",
"+ def __init__(self, fi, se):",
"+ self.fi = fi",
"+ self.se = se",
"- return base.real * base.real + base.imag * base.imag",
"+ return abs(base) ** 2",
"-def project(p0, p1, p2):",
"- base = p0 - p1",
"- r = dot(p2 - p0, base) / norm(base)",
"- return p0 + base * r",
"+def project(s, p2):",
"+ base = s.fi - s.se",
"+ r = dot(p2 - s.fi, base) / norm(base)",
"+ return s.fi + base * r",
"+s = Segment(",
"+ *list(starmap(complex, list(zip(*[list(map(int, readline().split()))] * 2))))",
"+)",
"+n = int(readline())",
"- ap = project(p0, p1, p2)",
"+ ap = project(s, p2)"
]
| false | 0.045395 | 0.042439 | 1.069668 | [
"s710495913",
"s748480352"
]
|
u819048695 | p03816 | python | s193204536 | s326280409 | 101 | 44 | 14,396 | 14,564 | Accepted | Accepted | 56.44 | n=int(eval(input()))
a=list(map(int,input().split()))
a.sort()
k=1
lst=[]
for i in range(1,n):
if a[i]==a[i-1]:
k+=1
else:
lst.append(k)
k=1
lst.append(k)
m=len(lst)
count=0
for i in range(m):
if lst[i]%2==0:
lst[i]=2
count+=1
else:
lst[i]=1
if count%2==0:
print(m)
else:
print((m-1)) | n=int(eval(input()))
a=list(map(int,input().split()))
a=len(set(a))
if a%2==0:
print((a-1))
else:
print(a) | 24 | 7 | 371 | 112 | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
k = 1
lst = []
for i in range(1, n):
if a[i] == a[i - 1]:
k += 1
else:
lst.append(k)
k = 1
lst.append(k)
m = len(lst)
count = 0
for i in range(m):
if lst[i] % 2 == 0:
lst[i] = 2
count += 1
else:
lst[i] = 1
if count % 2 == 0:
print(m)
else:
print((m - 1))
| n = int(eval(input()))
a = list(map(int, input().split()))
a = len(set(a))
if a % 2 == 0:
print((a - 1))
else:
print(a)
| false | 70.833333 | [
"-a.sort()",
"-k = 1",
"-lst = []",
"-for i in range(1, n):",
"- if a[i] == a[i - 1]:",
"- k += 1",
"- else:",
"- lst.append(k)",
"- k = 1",
"-lst.append(k)",
"-m = len(lst)",
"-count = 0",
"-for i in range(m):",
"- if lst[i] % 2 == 0:",
"- lst[i] = 2",
"- count += 1",
"- else:",
"- lst[i] = 1",
"-if count % 2 == 0:",
"- print(m)",
"+a = len(set(a))",
"+if a % 2 == 0:",
"+ print((a - 1))",
"- print((m - 1))",
"+ print(a)"
]
| false | 0.037292 | 0.062264 | 0.59894 | [
"s193204536",
"s326280409"
]
|
u225388820 | p02913 | python | s612001270 | s987730676 | 478 | 377 | 270,188 | 264,852 | Accepted | Accepted | 21.13 | n, s = int(eval(input())), eval(input())
dp = [[0] * (n + 1) for i in range(n + 1)]
for i in range(n):
for j in range(i + 1, n):
if s[i] == s[j]:
dp[i + 1][j + 1] = min(dp[i][j] + 1, j - i)
from itertools import chain
print((max(i for i in chain.from_iterable(dp))))
| n, s = int(eval(input())), eval(input())
dp = [[0] * (n + 1) for i in range(n + 1)]
for i in range(n):
for j in range(i + 1, n):
if s[i] == s[j]:
dp[i + 1][j + 1] = min(dp[i][j] + 1, j - i)
from itertools import chain
# max(i for i in chain.from_iterable(dp))
print((max(chain.from_iterable(dp))))
| 8 | 9 | 284 | 316 | n, s = int(eval(input())), eval(input())
dp = [[0] * (n + 1) for i in range(n + 1)]
for i in range(n):
for j in range(i + 1, n):
if s[i] == s[j]:
dp[i + 1][j + 1] = min(dp[i][j] + 1, j - i)
from itertools import chain
print((max(i for i in chain.from_iterable(dp))))
| n, s = int(eval(input())), eval(input())
dp = [[0] * (n + 1) for i in range(n + 1)]
for i in range(n):
for j in range(i + 1, n):
if s[i] == s[j]:
dp[i + 1][j + 1] = min(dp[i][j] + 1, j - i)
from itertools import chain
# max(i for i in chain.from_iterable(dp))
print((max(chain.from_iterable(dp))))
| false | 11.111111 | [
"-print((max(i for i in chain.from_iterable(dp))))",
"+# max(i for i in chain.from_iterable(dp))",
"+print((max(chain.from_iterable(dp))))"
]
| false | 0.04305 | 0.048387 | 0.889705 | [
"s612001270",
"s987730676"
]
|
u498487134 | p02779 | python | s553010102 | s347914407 | 286 | 134 | 86,100 | 103,556 | Accepted | Accepted | 53.15 | N=int(eval(input()))
A=list(map(int,input().split()))
A.sort()
flag=1
for i in range(N-1):
if A[i+1]==A[i]:
flag=0
break
if flag==1:
print("YES")
else:
print("NO") | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N=I()
A=LI()
A.sort()
flag=1
for i in range(N-1):
if A[i]==A[i+1]:
flag=0
break
if flag:
print("YES")
else:
print("NO")
main()
| 14 | 24 | 208 | 425 | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
flag = 1
for i in range(N - 1):
if A[i + 1] == A[i]:
flag = 0
break
if flag == 1:
print("YES")
else:
print("NO")
| import sys
input = sys.stdin.readline
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
def main():
mod = 10**9 + 7
N = I()
A = LI()
A.sort()
flag = 1
for i in range(N - 1):
if A[i] == A[i + 1]:
flag = 0
break
if flag:
print("YES")
else:
print("NO")
main()
| false | 41.666667 | [
"-N = int(eval(input()))",
"-A = list(map(int, input().split()))",
"-A.sort()",
"-flag = 1",
"-for i in range(N - 1):",
"- if A[i + 1] == A[i]:",
"- flag = 0",
"- break",
"-if flag == 1:",
"- print(\"YES\")",
"-else:",
"- print(\"NO\")",
"+import sys",
"+",
"+input = sys.stdin.readline",
"+",
"+",
"+def I():",
"+ return int(eval(input()))",
"+",
"+",
"+def MI():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def LI():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def main():",
"+ mod = 10**9 + 7",
"+ N = I()",
"+ A = LI()",
"+ A.sort()",
"+ flag = 1",
"+ for i in range(N - 1):",
"+ if A[i] == A[i + 1]:",
"+ flag = 0",
"+ break",
"+ if flag:",
"+ print(\"YES\")",
"+ else:",
"+ print(\"NO\")",
"+",
"+",
"+main()"
]
| false | 0.045333 | 0.048327 | 0.938038 | [
"s553010102",
"s347914407"
]
|
u638282348 | p03379 | python | s725866558 | s732805157 | 1,360 | 1,131 | 35,708 | 35,712 | Accepted | Accepted | 16.84 | import numpy as np
N = int(eval(input()))
X = np.array(input().split(), dtype=np.int64)
argsort = X.argsort()
argsort_argsort = argsort.argsort()
X_sorted = X[argsort]
m1, m2 = N // 2 - 1, N // 2
for idx in argsort_argsort:
if idx <= m1:
print((X_sorted[m2]))
else:
print((X_sorted[m1]))
| import numpy as np
N = int(eval(input()))
X = np.array(input().split(), dtype=np.int64)
argsort = X.argsort()
argsort_argsort = argsort.argsort()
X_sorted = X[argsort]
m1, m2 = N // 2 - 1, N // 2
print(("\n".join(str(X_sorted[m2]) if idx <= m1 else str(X_sorted[m1]) for idx in argsort_argsort)))
| 12 | 8 | 313 | 296 | import numpy as np
N = int(eval(input()))
X = np.array(input().split(), dtype=np.int64)
argsort = X.argsort()
argsort_argsort = argsort.argsort()
X_sorted = X[argsort]
m1, m2 = N // 2 - 1, N // 2
for idx in argsort_argsort:
if idx <= m1:
print((X_sorted[m2]))
else:
print((X_sorted[m1]))
| import numpy as np
N = int(eval(input()))
X = np.array(input().split(), dtype=np.int64)
argsort = X.argsort()
argsort_argsort = argsort.argsort()
X_sorted = X[argsort]
m1, m2 = N // 2 - 1, N // 2
print(
(
"\n".join(
str(X_sorted[m2]) if idx <= m1 else str(X_sorted[m1])
for idx in argsort_argsort
)
)
)
| false | 33.333333 | [
"-for idx in argsort_argsort:",
"- if idx <= m1:",
"- print((X_sorted[m2]))",
"- else:",
"- print((X_sorted[m1]))",
"+print(",
"+ (",
"+ \"\\n\".join(",
"+ str(X_sorted[m2]) if idx <= m1 else str(X_sorted[m1])",
"+ for idx in argsort_argsort",
"+ )",
"+ )",
"+)"
]
| false | 0.18345 | 0.229963 | 0.797736 | [
"s725866558",
"s732805157"
]
|
u796942881 | p02923 | python | s533899294 | s527866147 | 63 | 54 | 14,092 | 14,092 | Accepted | Accepted | 14.29 | def main():
H = [int(i) for i in open(0).read().split()[1:]]
ans = 0
tmp = 0
for h1, h2 in zip(H[:-1], H[1:]):
if h1 >= h2:
tmp += 1
else:
ans = max(ans, tmp)
tmp = 0
ans = max(ans, tmp)
print(ans)
return
main()
| def main():
H = [int(i) for i in open(0).read().split()[1:]]
ans = 0
tmp = 0
for h1, h2 in zip(H[:-1], H[1:]):
if h1 >= h2:
tmp += 1
else:
if ans < tmp:
ans = tmp
tmp = 0
if ans < tmp:
ans = tmp
print(ans)
return
main()
| 16 | 18 | 309 | 343 | def main():
H = [int(i) for i in open(0).read().split()[1:]]
ans = 0
tmp = 0
for h1, h2 in zip(H[:-1], H[1:]):
if h1 >= h2:
tmp += 1
else:
ans = max(ans, tmp)
tmp = 0
ans = max(ans, tmp)
print(ans)
return
main()
| def main():
H = [int(i) for i in open(0).read().split()[1:]]
ans = 0
tmp = 0
for h1, h2 in zip(H[:-1], H[1:]):
if h1 >= h2:
tmp += 1
else:
if ans < tmp:
ans = tmp
tmp = 0
if ans < tmp:
ans = tmp
print(ans)
return
main()
| false | 11.111111 | [
"- ans = max(ans, tmp)",
"+ if ans < tmp:",
"+ ans = tmp",
"- ans = max(ans, tmp)",
"+ if ans < tmp:",
"+ ans = tmp"
]
| false | 0.114895 | 0.066326 | 1.732277 | [
"s533899294",
"s527866147"
]
|
u020390084 | p03013 | python | s747419278 | s057682473 | 520 | 217 | 460,020 | 7,848 | Accepted | Accepted | 58.27 | n, m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
dp = [float("inf")] * (n+1)
dp[0] = 1
dp[1] = 1
for i in a:
dp[i] = 0
for i in range(2, n+1):
dp[i] = min(dp[i], (dp[i-1] + dp[i-2]))
print((dp[n] % 1000000007)) | n, m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
dp = [float("inf")] * (n+1)
dp[0] = 1
dp[1] = 1
for i in a:
dp[i] = 0
for i in range(2, n+1):
dp[i] = min(dp[i], (dp[i-1] + dp[i-2])%(10**9+7))
print((dp[n]))
| 10 | 10 | 245 | 243 | n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
dp = [float("inf")] * (n + 1)
dp[0] = 1
dp[1] = 1
for i in a:
dp[i] = 0
for i in range(2, n + 1):
dp[i] = min(dp[i], (dp[i - 1] + dp[i - 2]))
print((dp[n] % 1000000007))
| n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
dp = [float("inf")] * (n + 1)
dp[0] = 1
dp[1] = 1
for i in a:
dp[i] = 0
for i in range(2, n + 1):
dp[i] = min(dp[i], (dp[i - 1] + dp[i - 2]) % (10**9 + 7))
print((dp[n]))
| false | 0 | [
"- dp[i] = min(dp[i], (dp[i - 1] + dp[i - 2]))",
"-print((dp[n] % 1000000007))",
"+ dp[i] = min(dp[i], (dp[i - 1] + dp[i - 2]) % (10**9 + 7))",
"+print((dp[n]))"
]
| false | 0.221812 | 0.043577 | 5.090131 | [
"s747419278",
"s057682473"
]
|
u701644092 | p03212 | python | s921570589 | s148735269 | 58 | 51 | 3,064 | 9,176 | Accepted | Accepted | 12.07 | import sys
sys.setrecursionlimit(10 ** 5)
N = int(eval(input()))
def check(p):
return ("3" in p and "5" in p and "7" in p)
cnt = 0
def dfs(n):
if int(n) > N:
return
global cnt
if check(n):
cnt += 1
for c in ("3","5","7"):
dfs(n + c)
dfs("0")
print(cnt) | N = eval(input())
digit = len(N)
N = int(N)
import itertools
ans = 0
for i in range(1, digit + 1):
for prod in itertools.product(("3","5","7"), repeat = i):
if int("".join(prod)) <= N and len(set(prod)) == 3:
ans += 1
print(ans) | 20 | 14 | 293 | 251 | import sys
sys.setrecursionlimit(10**5)
N = int(eval(input()))
def check(p):
return "3" in p and "5" in p and "7" in p
cnt = 0
def dfs(n):
if int(n) > N:
return
global cnt
if check(n):
cnt += 1
for c in ("3", "5", "7"):
dfs(n + c)
dfs("0")
print(cnt)
| N = eval(input())
digit = len(N)
N = int(N)
import itertools
ans = 0
for i in range(1, digit + 1):
for prod in itertools.product(("3", "5", "7"), repeat=i):
if int("".join(prod)) <= N and len(set(prod)) == 3:
ans += 1
print(ans)
| false | 30 | [
"-import sys",
"+N = eval(input())",
"+digit = len(N)",
"+N = int(N)",
"+import itertools",
"-sys.setrecursionlimit(10**5)",
"-N = int(eval(input()))",
"-",
"-",
"-def check(p):",
"- return \"3\" in p and \"5\" in p and \"7\" in p",
"-",
"-",
"-cnt = 0",
"-",
"-",
"-def dfs(n):",
"- if int(n) > N:",
"- return",
"- global cnt",
"- if check(n):",
"- cnt += 1",
"- for c in (\"3\", \"5\", \"7\"):",
"- dfs(n + c)",
"-",
"-",
"-dfs(\"0\")",
"-print(cnt)",
"+ans = 0",
"+for i in range(1, digit + 1):",
"+ for prod in itertools.product((\"3\", \"5\", \"7\"), repeat=i):",
"+ if int(\"\".join(prod)) <= N and len(set(prod)) == 3:",
"+ ans += 1",
"+print(ans)"
]
| false | 0.05205 | 0.042292 | 1.230719 | [
"s921570589",
"s148735269"
]
|
u391731808 | p03959 | python | s409781473 | s889358327 | 227 | 163 | 18,756 | 18,624 | Accepted | Accepted | 28.19 | N=int(eval(input()))
*T, = list(map(int,input().split()))
*A, = list(map(int,input().split()))
mod = 10**9+7
mT = [T[0]]*N
MT = [T[0]]*N
for i,t in enumerate(T[1:],1):
if t>T[i-1]:
mT[i] = t
MT[i] = t
else:
mT[i] = 1
MT[i] = t
mA = [A[-1]]*N
MA = [A[-1]]*N
for i,a in enumerate(A[-2::-1],2):
if a>A[-i+1]:
mA[-i] = a
MA[-i] = a
else:
mA[-i] = 1
MA[-i] = a
m = [max(a,t) for a,t in zip(mA,mT)]
M = [min(a,t) for a,t in zip(MA,MT)]
ans = 1
for a,b in zip(m,M):
ans *= max(0,b-a+1)
ans %= mod
print(ans) | N=int(eval(input()))
*T, = [0] + list(map(int,input().split())) + [0]
*A, = [0] + list(map(int,input().split())) + [0]
mod = 10**9+7
M = list(map(min,list(zip(A,T))))[1:-1]
m = [max(T[i] if T[i]>T[i-1] else 1, A[i] if A[i]>A[i+1] else 1) for i in range(1,N+1)]
ans = 1
for a,b in zip(m,M): ans = ans * max(0,b-a+1) % mod
print(ans) | 30 | 9 | 600 | 327 | N = int(eval(input()))
(*T,) = list(map(int, input().split()))
(*A,) = list(map(int, input().split()))
mod = 10**9 + 7
mT = [T[0]] * N
MT = [T[0]] * N
for i, t in enumerate(T[1:], 1):
if t > T[i - 1]:
mT[i] = t
MT[i] = t
else:
mT[i] = 1
MT[i] = t
mA = [A[-1]] * N
MA = [A[-1]] * N
for i, a in enumerate(A[-2::-1], 2):
if a > A[-i + 1]:
mA[-i] = a
MA[-i] = a
else:
mA[-i] = 1
MA[-i] = a
m = [max(a, t) for a, t in zip(mA, mT)]
M = [min(a, t) for a, t in zip(MA, MT)]
ans = 1
for a, b in zip(m, M):
ans *= max(0, b - a + 1)
ans %= mod
print(ans)
| N = int(eval(input()))
(*T,) = [0] + list(map(int, input().split())) + [0]
(*A,) = [0] + list(map(int, input().split())) + [0]
mod = 10**9 + 7
M = list(map(min, list(zip(A, T))))[1:-1]
m = [
max(T[i] if T[i] > T[i - 1] else 1, A[i] if A[i] > A[i + 1] else 1)
for i in range(1, N + 1)
]
ans = 1
for a, b in zip(m, M):
ans = ans * max(0, b - a + 1) % mod
print(ans)
| false | 70 | [
"-(*T,) = list(map(int, input().split()))",
"-(*A,) = list(map(int, input().split()))",
"+(*T,) = [0] + list(map(int, input().split())) + [0]",
"+(*A,) = [0] + list(map(int, input().split())) + [0]",
"-mT = [T[0]] * N",
"-MT = [T[0]] * N",
"-for i, t in enumerate(T[1:], 1):",
"- if t > T[i - 1]:",
"- mT[i] = t",
"- MT[i] = t",
"- else:",
"- mT[i] = 1",
"- MT[i] = t",
"-mA = [A[-1]] * N",
"-MA = [A[-1]] * N",
"-for i, a in enumerate(A[-2::-1], 2):",
"- if a > A[-i + 1]:",
"- mA[-i] = a",
"- MA[-i] = a",
"- else:",
"- mA[-i] = 1",
"- MA[-i] = a",
"-m = [max(a, t) for a, t in zip(mA, mT)]",
"-M = [min(a, t) for a, t in zip(MA, MT)]",
"+M = list(map(min, list(zip(A, T))))[1:-1]",
"+m = [",
"+ max(T[i] if T[i] > T[i - 1] else 1, A[i] if A[i] > A[i + 1] else 1)",
"+ for i in range(1, N + 1)",
"+]",
"- ans *= max(0, b - a + 1)",
"- ans %= mod",
"+ ans = ans * max(0, b - a + 1) % mod"
]
| false | 0.086558 | 0.048427 | 1.78741 | [
"s409781473",
"s889358327"
]
|
u273345915 | p02689 | python | s933323805 | s970014286 | 298 | 258 | 31,856 | 20,152 | Accepted | Accepted | 13.42 | N,M=list(map(int,input().split()))
H=list(map(int,input().split()))
HL=[1]*N
ML=[list(map(int, input().split())) for _ in range(M)]
for m in ML:
a=m[0]
b=m[1]
ah=H[a-1]
bh=H[b-1]
if ah > bh:
HL[b-1]=0
elif bh > ah:
HL[a-1]=0
else:
HL[a-1]=0
HL[b-1]=0
print((HL.count(1))) | N,M=list(map(int,input().split()))
H=list(map(int,input().split()))
OK=[True]*N
for m in range(M):
a,b=list(map(int, input().split()))
if H[a-1] <= H[b-1]: OK[a-1] = False
if H[b-1] <= H[a-1]: OK[b-1] = False
print((OK.count(True))) | 17 | 8 | 339 | 237 | N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
HL = [1] * N
ML = [list(map(int, input().split())) for _ in range(M)]
for m in ML:
a = m[0]
b = m[1]
ah = H[a - 1]
bh = H[b - 1]
if ah > bh:
HL[b - 1] = 0
elif bh > ah:
HL[a - 1] = 0
else:
HL[a - 1] = 0
HL[b - 1] = 0
print((HL.count(1)))
| N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
OK = [True] * N
for m in range(M):
a, b = list(map(int, input().split()))
if H[a - 1] <= H[b - 1]:
OK[a - 1] = False
if H[b - 1] <= H[a - 1]:
OK[b - 1] = False
print((OK.count(True)))
| false | 52.941176 | [
"-HL = [1] * N",
"-ML = [list(map(int, input().split())) for _ in range(M)]",
"-for m in ML:",
"- a = m[0]",
"- b = m[1]",
"- ah = H[a - 1]",
"- bh = H[b - 1]",
"- if ah > bh:",
"- HL[b - 1] = 0",
"- elif bh > ah:",
"- HL[a - 1] = 0",
"- else:",
"- HL[a - 1] = 0",
"- HL[b - 1] = 0",
"-print((HL.count(1)))",
"+OK = [True] * N",
"+for m in range(M):",
"+ a, b = list(map(int, input().split()))",
"+ if H[a - 1] <= H[b - 1]:",
"+ OK[a - 1] = False",
"+ if H[b - 1] <= H[a - 1]:",
"+ OK[b - 1] = False",
"+print((OK.count(True)))"
]
| false | 0.045417 | 0.045148 | 1.005958 | [
"s933323805",
"s970014286"
]
|
u185424824 | p03627 | python | s724159412 | s642896231 | 190 | 98 | 21,412 | 14,672 | Accepted | Accepted | 48.42 | import collections
s = set()
N = int(eval(input()))
count = []*(10**9+1)
ma1 = 0
ma2 = 0
A = list(map(int,input().split()))
a = collections.Counter(A)
b = sorted(list(a.items()),reverse = True)
for i in b:
if ma1 == 0 and i[1] > 1:
ma1 = i[0]
if i[1] > 3:
ma2 = i[0]
elif ma1 != 0 and i[1] > 1:
ma2 = i[0]
if ma1 > 0 and ma2 > 0:
break
print((ma1*ma2))
| N = int(eval(input()))
ma1 = 0
ma2 = 0
A = list(map(int,input().split()))
A.append(0)
a = sorted(A,reverse = True)
hold = 0
count = 0
for i in a:
if i == hold:
count += 1
else:
if count > 3 and ma1 == 0:
ma1 = hold
ma2 = hold
elif count > 1:
if ma1 == 0:
ma1 = hold
elif ma2 == 0:
ma2 = hold
hold = i
count = 1
if ma1 != 0 and ma2 != 0:
break
print((ma1*ma2))
| 22 | 30 | 396 | 468 | import collections
s = set()
N = int(eval(input()))
count = [] * (10**9 + 1)
ma1 = 0
ma2 = 0
A = list(map(int, input().split()))
a = collections.Counter(A)
b = sorted(list(a.items()), reverse=True)
for i in b:
if ma1 == 0 and i[1] > 1:
ma1 = i[0]
if i[1] > 3:
ma2 = i[0]
elif ma1 != 0 and i[1] > 1:
ma2 = i[0]
if ma1 > 0 and ma2 > 0:
break
print((ma1 * ma2))
| N = int(eval(input()))
ma1 = 0
ma2 = 0
A = list(map(int, input().split()))
A.append(0)
a = sorted(A, reverse=True)
hold = 0
count = 0
for i in a:
if i == hold:
count += 1
else:
if count > 3 and ma1 == 0:
ma1 = hold
ma2 = hold
elif count > 1:
if ma1 == 0:
ma1 = hold
elif ma2 == 0:
ma2 = hold
hold = i
count = 1
if ma1 != 0 and ma2 != 0:
break
print((ma1 * ma2))
| false | 26.666667 | [
"-import collections",
"-",
"-s = set()",
"-count = [] * (10**9 + 1)",
"-a = collections.Counter(A)",
"-b = sorted(list(a.items()), reverse=True)",
"-for i in b:",
"- if ma1 == 0 and i[1] > 1:",
"- ma1 = i[0]",
"- if i[1] > 3:",
"- ma2 = i[0]",
"- elif ma1 != 0 and i[1] > 1:",
"- ma2 = i[0]",
"- if ma1 > 0 and ma2 > 0:",
"- break",
"+A.append(0)",
"+a = sorted(A, reverse=True)",
"+hold = 0",
"+count = 0",
"+for i in a:",
"+ if i == hold:",
"+ count += 1",
"+ else:",
"+ if count > 3 and ma1 == 0:",
"+ ma1 = hold",
"+ ma2 = hold",
"+ elif count > 1:",
"+ if ma1 == 0:",
"+ ma1 = hold",
"+ elif ma2 == 0:",
"+ ma2 = hold",
"+ hold = i",
"+ count = 1",
"+ if ma1 != 0 and ma2 != 0:",
"+ break"
]
| false | 0.043708 | 0.081308 | 0.537558 | [
"s724159412",
"s642896231"
]
|
u347640436 | p03806 | python | s786606956 | s691346894 | 1,233 | 1,065 | 59,472 | 4,844 | Accepted | Accepted | 13.63 | nmax, abmax, inf = 40, 10, 1000000
dp = [[[inf] * (nmax * abmax + 1) for _ in range(nmax * abmax + 1)] for _ in range(nmax + 1)]
n, ma, mb = list(map(int, input().split()))
dp[0][0][0] = 0
for i in range(n):
a, b, c = list(map(int, input().split()))
dpi = dp[i]
dpi1 = dp[i + 1]
for ca in range(0, 401):
for cb in range(0, 401):
if dpi[ca][cb] == inf:
continue
dpi1[ca][cb] = min(dpi1[ca][cb], dpi[ca][cb])
dpi1[ca + a][cb + b] = min(dpi1[ca + a][cb + b], dpi[ca][cb] + c)
ans = inf
dpn = dp[n]
for ca in range(1, 401):
for cb in range(1, 401):
if ca * mb == cb * ma:
ans = min(ans, dpn[ca][cb])
if ans == inf:
ans = -1
print(ans)
| INF = float('inf')
n, ma, mb = list(map(int, input().split()))
t = [[INF] * 401 for _ in range(401)]
t[0][0] = 0
for _ in range(n):
a, b, c = list(map(int, input().split()))
for aa in range(400, -1, -1):
for bb in range(400, -1, -1):
if t[aa][bb] == INF:
continue
if t[a + aa][b + bb] > t[aa][bb] + c:
t[a + aa][b + bb] = t[aa][bb] + c
result = INF
for a in range(400, 0, -1):
for b in range(400, 0, -1):
if a * mb == b * ma and t[a][b] < result:
result = t[a][b]
if result == INF:
result = -1
print(result)
| 30 | 20 | 707 | 565 | nmax, abmax, inf = 40, 10, 1000000
dp = [
[[inf] * (nmax * abmax + 1) for _ in range(nmax * abmax + 1)]
for _ in range(nmax + 1)
]
n, ma, mb = list(map(int, input().split()))
dp[0][0][0] = 0
for i in range(n):
a, b, c = list(map(int, input().split()))
dpi = dp[i]
dpi1 = dp[i + 1]
for ca in range(0, 401):
for cb in range(0, 401):
if dpi[ca][cb] == inf:
continue
dpi1[ca][cb] = min(dpi1[ca][cb], dpi[ca][cb])
dpi1[ca + a][cb + b] = min(dpi1[ca + a][cb + b], dpi[ca][cb] + c)
ans = inf
dpn = dp[n]
for ca in range(1, 401):
for cb in range(1, 401):
if ca * mb == cb * ma:
ans = min(ans, dpn[ca][cb])
if ans == inf:
ans = -1
print(ans)
| INF = float("inf")
n, ma, mb = list(map(int, input().split()))
t = [[INF] * 401 for _ in range(401)]
t[0][0] = 0
for _ in range(n):
a, b, c = list(map(int, input().split()))
for aa in range(400, -1, -1):
for bb in range(400, -1, -1):
if t[aa][bb] == INF:
continue
if t[a + aa][b + bb] > t[aa][bb] + c:
t[a + aa][b + bb] = t[aa][bb] + c
result = INF
for a in range(400, 0, -1):
for b in range(400, 0, -1):
if a * mb == b * ma and t[a][b] < result:
result = t[a][b]
if result == INF:
result = -1
print(result)
| false | 33.333333 | [
"-nmax, abmax, inf = 40, 10, 1000000",
"-dp = [",
"- [[inf] * (nmax * abmax + 1) for _ in range(nmax * abmax + 1)]",
"- for _ in range(nmax + 1)",
"-]",
"+INF = float(\"inf\")",
"-dp[0][0][0] = 0",
"-for i in range(n):",
"+t = [[INF] * 401 for _ in range(401)]",
"+t[0][0] = 0",
"+for _ in range(n):",
"- dpi = dp[i]",
"- dpi1 = dp[i + 1]",
"- for ca in range(0, 401):",
"- for cb in range(0, 401):",
"- if dpi[ca][cb] == inf:",
"+ for aa in range(400, -1, -1):",
"+ for bb in range(400, -1, -1):",
"+ if t[aa][bb] == INF:",
"- dpi1[ca][cb] = min(dpi1[ca][cb], dpi[ca][cb])",
"- dpi1[ca + a][cb + b] = min(dpi1[ca + a][cb + b], dpi[ca][cb] + c)",
"-ans = inf",
"-dpn = dp[n]",
"-for ca in range(1, 401):",
"- for cb in range(1, 401):",
"- if ca * mb == cb * ma:",
"- ans = min(ans, dpn[ca][cb])",
"-if ans == inf:",
"- ans = -1",
"-print(ans)",
"+ if t[a + aa][b + bb] > t[aa][bb] + c:",
"+ t[a + aa][b + bb] = t[aa][bb] + c",
"+result = INF",
"+for a in range(400, 0, -1):",
"+ for b in range(400, 0, -1):",
"+ if a * mb == b * ma and t[a][b] < result:",
"+ result = t[a][b]",
"+if result == INF:",
"+ result = -1",
"+print(result)"
]
| false | 0.378789 | 0.151921 | 2.493325 | [
"s786606956",
"s691346894"
]
|
u489959379 | p03282 | python | s261029076 | s054761114 | 183 | 17 | 38,384 | 3,064 | Accepted | Accepted | 90.71 | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
s = eval(input())
k = int(eval(input()))
for i in range(k):
if s[i] != "1":
res = s[i]
break
else:
print((1))
exit()
print(res)
if __name__ == '__main__':
resolve()
| import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
s = eval(input())
k = int(eval(input()))
if k >= len(s):
for i in range(len(s)):
if s[i] != "1":
print((s[i]))
break
else:
print((1))
else:
for i in range(k):
if s[i] != "1":
print((s[i]))
break
else:
print((1))
if __name__ == '__main__':
resolve()
| 24 | 28 | 349 | 521 | import sys
sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7
def resolve():
s = eval(input())
k = int(eval(input()))
for i in range(k):
if s[i] != "1":
res = s[i]
break
else:
print((1))
exit()
print(res)
if __name__ == "__main__":
resolve()
| import sys
sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7
def resolve():
s = eval(input())
k = int(eval(input()))
if k >= len(s):
for i in range(len(s)):
if s[i] != "1":
print((s[i]))
break
else:
print((1))
else:
for i in range(k):
if s[i] != "1":
print((s[i]))
break
else:
print((1))
if __name__ == "__main__":
resolve()
| false | 14.285714 | [
"- for i in range(k):",
"- if s[i] != \"1\":",
"- res = s[i]",
"- break",
"+ if k >= len(s):",
"+ for i in range(len(s)):",
"+ if s[i] != \"1\":",
"+ print((s[i]))",
"+ break",
"+ else:",
"+ print((1))",
"- print((1))",
"- exit()",
"- print(res)",
"+ for i in range(k):",
"+ if s[i] != \"1\":",
"+ print((s[i]))",
"+ break",
"+ else:",
"+ print((1))"
]
| false | 0.035795 | 0.058915 | 0.607572 | [
"s261029076",
"s054761114"
]
|
u488401358 | p02649 | python | s238936379 | s231020544 | 2,153 | 688 | 70,856 | 76,468 | Accepted | Accepted | 68.04 | def cmb(n, r, mod):#コンビネーションの高速計算
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return (g1[n] * g2[r] * g2[n-r])%mod
mod = 10**18+7 #出力の制限
N = 50
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
N,K,T,S=list(map(int,input().split()))
a=list(map(int,input().split()))
must0=[i for i in range(18) if S>>i &1==0]
must1=[i for i in range(18) if T>>i &1==1]
A=[]
for val in a:
check=True
for j in must0:
check=check&(val>>j &1==0)
for j in must1:
check=check&(val>>j &1==1)
if check:
A.append(val)
if not A:
print((0))
exit()
bit=[]
for i in range(18):
if i not in must0 and i not in must1:
bit.append(i)
for i in range(len(A)):
temp=0
for j in range(len(bit)):
temp+=(A[i]>>bit[j] &1==1)*2**j
A[i]=temp
ans=0
n=len(bit)
for i in range(2**n):
dic={}
for a in A:
val=a&i
if val not in dic:
dic[val]=0
dic[val]+=1
temp=0
for val in dic:
for j in range(1,min(K,dic[val])+1):
temp+=cmb(dic[val],j,mod)
popcount=0
for j in range(n):
popcount+=(i>>j &1)
ans+=temp*(-1)**popcount
print((ans%mod)) | def popcount(x):
x = x - ((x >> 1) & 0x55555555)
x = (x & 0x33333333) + ((x >> 2) & 0x33333333)
x = (x + (x >> 4)) & 0x0f0f0f0f
x = x + (x >> 8)
x = x + (x >> 16)
return x & 0x0000007f
cmb=[[0 for i in range(51)] for j in range(51)]
cmb[0][0]=1
for i in range(51):
for j in range(51):
if i!=50 and j!=50:
cmb[i+1][j+1]+=cmb[i][j]
if i!=50:
cmb[i+1][j]+=cmb[i][j]
for i in range(1,51):
for j in range(2,51):
cmb[i][j]+=cmb[i][j-1]
N,K,T,S=list(map(int,input().split()))
a=list(map(int,input().split()))
must0=[i for i in range(18) if S>>i &1==0]
must1=[i for i in range(18) if T>>i &1==1]
A=[]
for val in a:
check=True
for j in must0:
check=check&(val>>j &1==0)
for j in must1:
check=check&(val>>j &1==1)
if check:
A.append(val)
if not A:
print((0))
exit()
bit=[]
for i in range(18):
if i not in must0 and i not in must1:
bit.append(i)
for i in range(len(A)):
temp=0
for j in range(len(bit)):
temp+=(A[i]>>bit[j] &1==1)*2**j
A[i]=temp
ans=0
n=len(bit)
data=[0]*(2**n)
for i in range(2**n):
t=set([])
for a in A:
data[a&i]+=1
t.add(a&i)
temp=0
for val in t:
temp+=cmb[data[val]][min(K,data[val])]
ans+=temp*(-1)**popcount(i)
for val in t:
data[val]=0
print(ans)
| 67 | 68 | 1,437 | 1,445 | def cmb(n, r, mod): # コンビネーションの高速計算
if r < 0 or r > n:
return 0
r = min(r, n - r)
return (g1[n] * g2[r] * g2[n - r]) % mod
mod = 10**18 + 7 # 出力の制限
N = 50
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inverse = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, N + 1):
g1.append((g1[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod // i)) % mod)
g2.append((g2[-1] * inverse[-1]) % mod)
N, K, T, S = list(map(int, input().split()))
a = list(map(int, input().split()))
must0 = [i for i in range(18) if S >> i & 1 == 0]
must1 = [i for i in range(18) if T >> i & 1 == 1]
A = []
for val in a:
check = True
for j in must0:
check = check & (val >> j & 1 == 0)
for j in must1:
check = check & (val >> j & 1 == 1)
if check:
A.append(val)
if not A:
print((0))
exit()
bit = []
for i in range(18):
if i not in must0 and i not in must1:
bit.append(i)
for i in range(len(A)):
temp = 0
for j in range(len(bit)):
temp += (A[i] >> bit[j] & 1 == 1) * 2**j
A[i] = temp
ans = 0
n = len(bit)
for i in range(2**n):
dic = {}
for a in A:
val = a & i
if val not in dic:
dic[val] = 0
dic[val] += 1
temp = 0
for val in dic:
for j in range(1, min(K, dic[val]) + 1):
temp += cmb(dic[val], j, mod)
popcount = 0
for j in range(n):
popcount += i >> j & 1
ans += temp * (-1) ** popcount
print((ans % mod))
| def popcount(x):
x = x - ((x >> 1) & 0x55555555)
x = (x & 0x33333333) + ((x >> 2) & 0x33333333)
x = (x + (x >> 4)) & 0x0F0F0F0F
x = x + (x >> 8)
x = x + (x >> 16)
return x & 0x0000007F
cmb = [[0 for i in range(51)] for j in range(51)]
cmb[0][0] = 1
for i in range(51):
for j in range(51):
if i != 50 and j != 50:
cmb[i + 1][j + 1] += cmb[i][j]
if i != 50:
cmb[i + 1][j] += cmb[i][j]
for i in range(1, 51):
for j in range(2, 51):
cmb[i][j] += cmb[i][j - 1]
N, K, T, S = list(map(int, input().split()))
a = list(map(int, input().split()))
must0 = [i for i in range(18) if S >> i & 1 == 0]
must1 = [i for i in range(18) if T >> i & 1 == 1]
A = []
for val in a:
check = True
for j in must0:
check = check & (val >> j & 1 == 0)
for j in must1:
check = check & (val >> j & 1 == 1)
if check:
A.append(val)
if not A:
print((0))
exit()
bit = []
for i in range(18):
if i not in must0 and i not in must1:
bit.append(i)
for i in range(len(A)):
temp = 0
for j in range(len(bit)):
temp += (A[i] >> bit[j] & 1 == 1) * 2**j
A[i] = temp
ans = 0
n = len(bit)
data = [0] * (2**n)
for i in range(2**n):
t = set([])
for a in A:
data[a & i] += 1
t.add(a & i)
temp = 0
for val in t:
temp += cmb[data[val]][min(K, data[val])]
ans += temp * (-1) ** popcount(i)
for val in t:
data[val] = 0
print(ans)
| false | 1.470588 | [
"-def cmb(n, r, mod): # コンビネーションの高速計算",
"- if r < 0 or r > n:",
"- return 0",
"- r = min(r, n - r)",
"- return (g1[n] * g2[r] * g2[n - r]) % mod",
"+def popcount(x):",
"+ x = x - ((x >> 1) & 0x55555555)",
"+ x = (x & 0x33333333) + ((x >> 2) & 0x33333333)",
"+ x = (x + (x >> 4)) & 0x0F0F0F0F",
"+ x = x + (x >> 8)",
"+ x = x + (x >> 16)",
"+ return x & 0x0000007F",
"-mod = 10**18 + 7 # 出力の制限",
"-N = 50",
"-g1 = [1, 1] # 元テーブル",
"-g2 = [1, 1] # 逆元テーブル",
"-inverse = [0, 1] # 逆元テーブル計算用テーブル",
"-for i in range(2, N + 1):",
"- g1.append((g1[-1] * i) % mod)",
"- inverse.append((-inverse[mod % i] * (mod // i)) % mod)",
"- g2.append((g2[-1] * inverse[-1]) % mod)",
"+cmb = [[0 for i in range(51)] for j in range(51)]",
"+cmb[0][0] = 1",
"+for i in range(51):",
"+ for j in range(51):",
"+ if i != 50 and j != 50:",
"+ cmb[i + 1][j + 1] += cmb[i][j]",
"+ if i != 50:",
"+ cmb[i + 1][j] += cmb[i][j]",
"+for i in range(1, 51):",
"+ for j in range(2, 51):",
"+ cmb[i][j] += cmb[i][j - 1]",
"+data = [0] * (2**n)",
"- dic = {}",
"+ t = set([])",
"- val = a & i",
"- if val not in dic:",
"- dic[val] = 0",
"- dic[val] += 1",
"+ data[a & i] += 1",
"+ t.add(a & i)",
"- for val in dic:",
"- for j in range(1, min(K, dic[val]) + 1):",
"- temp += cmb(dic[val], j, mod)",
"- popcount = 0",
"- for j in range(n):",
"- popcount += i >> j & 1",
"- ans += temp * (-1) ** popcount",
"-print((ans % mod))",
"+ for val in t:",
"+ temp += cmb[data[val]][min(K, data[val])]",
"+ ans += temp * (-1) ** popcount(i)",
"+ for val in t:",
"+ data[val] = 0",
"+print(ans)"
]
| false | 0.039175 | 0.042122 | 0.930044 | [
"s238936379",
"s231020544"
]
|
u969850098 | p03816 | python | s886242225 | s771170858 | 68 | 60 | 18,648 | 18,656 | Accepted | Accepted | 11.76 | import sys
readline = sys.stdin.readline
from collections import Counter
def main():
N = int(readline())
A = list(map(int, readline().rstrip().split()))
c = Counter(A)
for key, val in list(c.items()):
if val > 2:
if val % 2 == 0:
c[key] = 2
else:
c[key] = 1
if len([val for key, val in list(c.items()) if c[key] == 2]) % 2 == 0:
print((len(c)))
else:
print((len(c) - 1))
if __name__ == '__main__':
main() | import sys
readline = sys.stdin.readline
from collections import Counter
def main():
N = int(readline())
A = list(map(int, readline().rstrip().split()))
c = Counter(A)
cnt = 0
for key, val in list(c.items()):
if val > 2:
if val % 2 == 0:
c[key] = 2
cnt += 1
else:
c[key] = 1
elif val == 2:
cnt += 1
if cnt % 2 == 0:
print((len(c)))
else:
print((len(c) - 1))
if __name__ == '__main__':
main() | 23 | 27 | 526 | 563 | import sys
readline = sys.stdin.readline
from collections import Counter
def main():
N = int(readline())
A = list(map(int, readline().rstrip().split()))
c = Counter(A)
for key, val in list(c.items()):
if val > 2:
if val % 2 == 0:
c[key] = 2
else:
c[key] = 1
if len([val for key, val in list(c.items()) if c[key] == 2]) % 2 == 0:
print((len(c)))
else:
print((len(c) - 1))
if __name__ == "__main__":
main()
| import sys
readline = sys.stdin.readline
from collections import Counter
def main():
N = int(readline())
A = list(map(int, readline().rstrip().split()))
c = Counter(A)
cnt = 0
for key, val in list(c.items()):
if val > 2:
if val % 2 == 0:
c[key] = 2
cnt += 1
else:
c[key] = 1
elif val == 2:
cnt += 1
if cnt % 2 == 0:
print((len(c)))
else:
print((len(c) - 1))
if __name__ == "__main__":
main()
| false | 14.814815 | [
"+ cnt = 0",
"+ cnt += 1",
"- if len([val for key, val in list(c.items()) if c[key] == 2]) % 2 == 0:",
"+ elif val == 2:",
"+ cnt += 1",
"+ if cnt % 2 == 0:"
]
| false | 0.233845 | 0.090986 | 2.570109 | [
"s886242225",
"s771170858"
]
|
u923279197 | p03059 | python | s096117297 | s191119563 | 173 | 17 | 38,384 | 2,940 | Accepted | Accepted | 90.17 | a,b,t = list(map(int,input().split()))
print((b*(t//a))) | a,b,t = list(map(int,input().split()))
ans = t//a*b
print(ans) | 2 | 4 | 49 | 60 | a, b, t = list(map(int, input().split()))
print((b * (t // a)))
| a, b, t = list(map(int, input().split()))
ans = t // a * b
print(ans)
| false | 50 | [
"-print((b * (t // a)))",
"+ans = t // a * b",
"+print(ans)"
]
| false | 0.099543 | 0.033127 | 3.004851 | [
"s096117297",
"s191119563"
]
|
u401452016 | p02780 | python | s160866879 | s492729303 | 217 | 134 | 25,632 | 24,404 | Accepted | Accepted | 38.25 | #ABC154D
import sys
N, K = list(map(int, sys.stdin.readline().split()))
P = list(map(int, sys.stdin.readline().split()))
#print(P)
#期待値L
L = [0 for _ in range(N)]
for i in range(N):
L[i] = (1+P[i])/2
#print(L)
#累積和S
S = [0 for i in range(N)]
S[0] = L[0]
for i in range(1, N):
S[i] = S[i-1] + L[i]
#print(S)
total = S[K-1]
for i in range(N-K):
tmp = S[i+K]-S[i]
if total < tmp:
total = tmp
print(total) | #ABC154D
def main():
import sys
N, K = list(map(int, sys.stdin.readline().split()))
P = list(map(int, sys.stdin.readline().split()))
L =[0 for _ in range(N)]
#期待値 (初項+末項)/2
for i in range(N):
L[i]=(1 +P[i])/2
#print(L)
#累積和
for i in range(N-1):
L[i+1] +=L[i]
#print(L)
ans = L[K-1]
for i in range(N-K):
s = L[i+K]-L[i]
if ans < s:
ans = s
print(ans)
if __name__=='__main__':
main() | 27 | 23 | 450 | 498 | # ABC154D
import sys
N, K = list(map(int, sys.stdin.readline().split()))
P = list(map(int, sys.stdin.readline().split()))
# print(P)
# 期待値L
L = [0 for _ in range(N)]
for i in range(N):
L[i] = (1 + P[i]) / 2
# print(L)
# 累積和S
S = [0 for i in range(N)]
S[0] = L[0]
for i in range(1, N):
S[i] = S[i - 1] + L[i]
# print(S)
total = S[K - 1]
for i in range(N - K):
tmp = S[i + K] - S[i]
if total < tmp:
total = tmp
print(total)
| # ABC154D
def main():
import sys
N, K = list(map(int, sys.stdin.readline().split()))
P = list(map(int, sys.stdin.readline().split()))
L = [0 for _ in range(N)]
# 期待値 (初項+末項)/2
for i in range(N):
L[i] = (1 + P[i]) / 2
# print(L)
# 累積和
for i in range(N - 1):
L[i + 1] += L[i]
# print(L)
ans = L[K - 1]
for i in range(N - K):
s = L[i + K] - L[i]
if ans < s:
ans = s
print(ans)
if __name__ == "__main__":
main()
| false | 14.814815 | [
"-import sys",
"+def main():",
"+ import sys",
"-N, K = list(map(int, sys.stdin.readline().split()))",
"-P = list(map(int, sys.stdin.readline().split()))",
"-# print(P)",
"-# 期待値L",
"-L = [0 for _ in range(N)]",
"-for i in range(N):",
"- L[i] = (1 + P[i]) / 2",
"-# print(L)",
"-# 累積和S",
"-S = [0 for i in range(N)]",
"-S[0] = L[0]",
"-for i in range(1, N):",
"- S[i] = S[i - 1] + L[i]",
"-# print(S)",
"-total = S[K - 1]",
"-for i in range(N - K):",
"- tmp = S[i + K] - S[i]",
"- if total < tmp:",
"- total = tmp",
"-print(total)",
"+ N, K = list(map(int, sys.stdin.readline().split()))",
"+ P = list(map(int, sys.stdin.readline().split()))",
"+ L = [0 for _ in range(N)]",
"+ # 期待値 (初項+末項)/2",
"+ for i in range(N):",
"+ L[i] = (1 + P[i]) / 2",
"+ # print(L)",
"+ # 累積和",
"+ for i in range(N - 1):",
"+ L[i + 1] += L[i]",
"+ # print(L)",
"+ ans = L[K - 1]",
"+ for i in range(N - K):",
"+ s = L[i + K] - L[i]",
"+ if ans < s:",
"+ ans = s",
"+ print(ans)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.036721 | 0.067176 | 0.546642 | [
"s160866879",
"s492729303"
]
|
u416011173 | p03752 | python | s318161173 | s474306261 | 54 | 36 | 9,196 | 9,240 | Accepted | Accepted | 33.33 | # -*- coding: utf-8 -*-
# モジュールのインポート
import sys
import itertools
# 標準入力を取得
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
# 求解処理
ans = sys.maxsize
for buildings in itertools.combinations(list(range(N)), K):
cost = 0
highest = a[0] - 1
for n in range(N):
a_n = a[n]
built = 0
if n in buildings:
built = max(highest - a_n + 1, 0)
cost += built
highest = max(highest, a_n + built)
ans = min(ans, cost)
# 結果出力
print(ans)
| # -*- coding: utf-8 -*-
# モジュールのインポート
import sys
import itertools
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力
"""
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
return N, K, a
def main(N: int, K: int, a: list) -> None:
"""
メイン処理.
Args:\n
N (int): 建物の個数(1 <= N <= 15)
K (int): 色の数(1 <= K <= N)
a (list): 高さ(1 <= a_i <= 10**9)
"""
# 求解処理
ans = sys.maxsize
for buildings in itertools.combinations(list(range(N)), K):
cost = 0
highest = a[0] - 1
for n in range(N):
a_n = a[n]
built = 0
if n in buildings:
built = max(highest - a_n + 1, 0)
cost += built
highest = max(highest, a_n + built)
ans = min(ans, cost)
# 結果出力
print(ans)
if __name__ == "__main__":
# 標準入力を取得
N, K, a = get_input()
# メイン処理
main(N, K, a)
| 25 | 52 | 539 | 1,033 | # -*- coding: utf-8 -*-
# モジュールのインポート
import sys
import itertools
# 標準入力を取得
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
# 求解処理
ans = sys.maxsize
for buildings in itertools.combinations(list(range(N)), K):
cost = 0
highest = a[0] - 1
for n in range(N):
a_n = a[n]
built = 0
if n in buildings:
built = max(highest - a_n + 1, 0)
cost += built
highest = max(highest, a_n + built)
ans = min(ans, cost)
# 結果出力
print(ans)
| # -*- coding: utf-8 -*-
# モジュールのインポート
import sys
import itertools
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力
"""
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
return N, K, a
def main(N: int, K: int, a: list) -> None:
"""
メイン処理.
Args:\n
N (int): 建物の個数(1 <= N <= 15)
K (int): 色の数(1 <= K <= N)
a (list): 高さ(1 <= a_i <= 10**9)
"""
# 求解処理
ans = sys.maxsize
for buildings in itertools.combinations(list(range(N)), K):
cost = 0
highest = a[0] - 1
for n in range(N):
a_n = a[n]
built = 0
if n in buildings:
built = max(highest - a_n + 1, 0)
cost += built
highest = max(highest, a_n + built)
ans = min(ans, cost)
# 結果出力
print(ans)
if __name__ == "__main__":
# 標準入力を取得
N, K, a = get_input()
# メイン処理
main(N, K, a)
| false | 51.923077 | [
"-# 標準入力を取得",
"-N, K = list(map(int, input().split()))",
"-a = list(map(int, input().split()))",
"-# 求解処理",
"-ans = sys.maxsize",
"-for buildings in itertools.combinations(list(range(N)), K):",
"- cost = 0",
"- highest = a[0] - 1",
"- for n in range(N):",
"- a_n = a[n]",
"- built = 0",
"- if n in buildings:",
"- built = max(highest - a_n + 1, 0)",
"- cost += built",
"- highest = max(highest, a_n + built)",
"- ans = min(ans, cost)",
"-# 結果出力",
"-print(ans)",
"+",
"+def get_input() -> tuple:",
"+ \"\"\"",
"+ 標準入力を取得する.",
"+ Returns:\\n",
"+ tuple: 標準入力",
"+ \"\"\"",
"+ N, K = list(map(int, input().split()))",
"+ a = list(map(int, input().split()))",
"+ return N, K, a",
"+",
"+",
"+def main(N: int, K: int, a: list) -> None:",
"+ \"\"\"",
"+ メイン処理.",
"+ Args:\\n",
"+ N (int): 建物の個数(1 <= N <= 15)",
"+ K (int): 色の数(1 <= K <= N)",
"+ a (list): 高さ(1 <= a_i <= 10**9)",
"+ \"\"\"",
"+ # 求解処理",
"+ ans = sys.maxsize",
"+ for buildings in itertools.combinations(list(range(N)), K):",
"+ cost = 0",
"+ highest = a[0] - 1",
"+ for n in range(N):",
"+ a_n = a[n]",
"+ built = 0",
"+ if n in buildings:",
"+ built = max(highest - a_n + 1, 0)",
"+ cost += built",
"+ highest = max(highest, a_n + built)",
"+ ans = min(ans, cost)",
"+ # 結果出力",
"+ print(ans)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ # 標準入力を取得",
"+ N, K, a = get_input()",
"+ # メイン処理",
"+ main(N, K, a)"
]
| false | 0.045318 | 0.046903 | 0.966203 | [
"s318161173",
"s474306261"
]
|
u144980750 | p02975 | python | s032395276 | s710394870 | 79 | 65 | 14,212 | 14,116 | Accepted | Accepted | 17.72 | n=int(eval(input()))
a=[int(i) for i in input().split()]
a.sort()
ans=a[0]
for i in range(1,n):
ans=ans^a[i]
if ans==0:
print("Yes")
else:
print("No") | n=int(eval(input()))
A=[int(i) for i in input().split()]
A.sort()
if n%3==0:
n=int(n/3)
if A[0]==A[n-1] and A[n]==A[2*n-1] and A[2*n]==A[3*n-1] and A[0]^A[n]^A[2*n]==0:
ans=1
else:
ans=0
else:
if(A[n-1]==0):
ans=1
else:
ans=0
print(("Yes" if ans==1 else "No"))
| 10 | 15 | 165 | 319 | n = int(eval(input()))
a = [int(i) for i in input().split()]
a.sort()
ans = a[0]
for i in range(1, n):
ans = ans ^ a[i]
if ans == 0:
print("Yes")
else:
print("No")
| n = int(eval(input()))
A = [int(i) for i in input().split()]
A.sort()
if n % 3 == 0:
n = int(n / 3)
if (
A[0] == A[n - 1]
and A[n] == A[2 * n - 1]
and A[2 * n] == A[3 * n - 1]
and A[0] ^ A[n] ^ A[2 * n] == 0
):
ans = 1
else:
ans = 0
else:
if A[n - 1] == 0:
ans = 1
else:
ans = 0
print(("Yes" if ans == 1 else "No"))
| false | 33.333333 | [
"-a = [int(i) for i in input().split()]",
"-a.sort()",
"-ans = a[0]",
"-for i in range(1, n):",
"- ans = ans ^ a[i]",
"-if ans == 0:",
"- print(\"Yes\")",
"+A = [int(i) for i in input().split()]",
"+A.sort()",
"+if n % 3 == 0:",
"+ n = int(n / 3)",
"+ if (",
"+ A[0] == A[n - 1]",
"+ and A[n] == A[2 * n - 1]",
"+ and A[2 * n] == A[3 * n - 1]",
"+ and A[0] ^ A[n] ^ A[2 * n] == 0",
"+ ):",
"+ ans = 1",
"+ else:",
"+ ans = 0",
"- print(\"No\")",
"+ if A[n - 1] == 0:",
"+ ans = 1",
"+ else:",
"+ ans = 0",
"+print((\"Yes\" if ans == 1 else \"No\"))"
]
| false | 0.039247 | 0.039974 | 0.981792 | [
"s032395276",
"s710394870"
]
|
u441175813 | p02754 | python | s290219583 | s639339359 | 72 | 66 | 61,276 | 61,544 | Accepted | Accepted | 8.33 | n, a, b = list(map(int, input().split()))
ans = n//(a+b) * a
n %= (a+b)
if n >= a:
print((ans + a))
else:
print((ans + n)) | n, a, b = list(map(int, input().split()))
ans = n//(a+b) * a
n %= (a+b)
print((ans + min([a, n]))) | 8 | 5 | 128 | 95 | n, a, b = list(map(int, input().split()))
ans = n // (a + b) * a
n %= a + b
if n >= a:
print((ans + a))
else:
print((ans + n))
| n, a, b = list(map(int, input().split()))
ans = n // (a + b) * a
n %= a + b
print((ans + min([a, n])))
| false | 37.5 | [
"-if n >= a:",
"- print((ans + a))",
"-else:",
"- print((ans + n))",
"+print((ans + min([a, n])))"
]
| false | 0.042738 | 0.04869 | 0.877755 | [
"s290219583",
"s639339359"
]
|
u681444474 | p03475 | python | s085941058 | s795077738 | 137 | 98 | 3,188 | 9,104 | Accepted | Accepted | 28.47 | # coding: utf-8
import math
N = int(eval(input()))
sta_info = []
for i in range(N-1):
l = list(map(int,input().split()))
sta_info.append(l)
for i in range(N-1):
start = i
t = 0
ans = 0
for j in range(i,N-1):
c, s, f = sta_info[j][0], sta_info[j][1], sta_info[j][2]
#print('到着時 ' + str(t))
if t <= s:
t = s
#print('!!!')
else:
n = math.ceil((t - s) / f)
t += s + n * f - t
#print('発車時 ' + str(t))
t += c
print(t)
print((0))
| #coding: utf-8
import math
N = int(eval(input()))
L = []
for i in range(N-1):
l = list(map(int,input().split()))
L.append(l)
for i in range(N-1):
t = 0
for j in range(i,N-1):
l = L[j]
c = l[0]
s = l[1]
f = l[2]
if t <= s:
t = s+c
else:
n = math.ceil((t-s)/f)
t = s+n*f+c
print(t)
print((0)) | 26 | 23 | 574 | 410 | # coding: utf-8
import math
N = int(eval(input()))
sta_info = []
for i in range(N - 1):
l = list(map(int, input().split()))
sta_info.append(l)
for i in range(N - 1):
start = i
t = 0
ans = 0
for j in range(i, N - 1):
c, s, f = sta_info[j][0], sta_info[j][1], sta_info[j][2]
# print('到着時 ' + str(t))
if t <= s:
t = s
# print('!!!')
else:
n = math.ceil((t - s) / f)
t += s + n * f - t
# print('発車時 ' + str(t))
t += c
print(t)
print((0))
| # coding: utf-8
import math
N = int(eval(input()))
L = []
for i in range(N - 1):
l = list(map(int, input().split()))
L.append(l)
for i in range(N - 1):
t = 0
for j in range(i, N - 1):
l = L[j]
c = l[0]
s = l[1]
f = l[2]
if t <= s:
t = s + c
else:
n = math.ceil((t - s) / f)
t = s + n * f + c
print(t)
print((0))
| false | 11.538462 | [
"-sta_info = []",
"+L = []",
"- sta_info.append(l)",
"+ L.append(l)",
"- start = i",
"- ans = 0",
"- c, s, f = sta_info[j][0], sta_info[j][1], sta_info[j][2]",
"- # print('到着時 ' + str(t))",
"+ l = L[j]",
"+ c = l[0]",
"+ s = l[1]",
"+ f = l[2]",
"- t = s",
"- # print('!!!')",
"+ t = s + c",
"- t += s + n * f - t",
"- # print('発車時 ' + str(t))",
"- t += c",
"+ t = s + n * f + c"
]
| false | 0.081035 | 0.063469 | 1.276748 | [
"s085941058",
"s795077738"
]
|
u254871849 | p03495 | python | s947537872 | s287756503 | 176 | 99 | 40,336 | 33,556 | Accepted | Accepted | 43.75 | import sys
from collections import Counter
n, k, *a = list(map(int, sys.stdin.read().split()))
def main():
c = Counter(a)
l = len(c)
if l <= k:
return 0
c = sorted(list(c.items()), key=lambda x: x[1])
res = 0
for i in range(l - k):
res += c[i][1]
return res
if __name__ == '__main__':
ans = main()
print(ans) | import sys
from collections import Counter
n, k, *a = list(map(int, sys.stdin.read().split()))
def main():
c = Counter(a)
res = sum(sorted(c.values())[:-k])
print(res)
if __name__ == '__main__':
main() | 21 | 12 | 373 | 226 | import sys
from collections import Counter
n, k, *a = list(map(int, sys.stdin.read().split()))
def main():
c = Counter(a)
l = len(c)
if l <= k:
return 0
c = sorted(list(c.items()), key=lambda x: x[1])
res = 0
for i in range(l - k):
res += c[i][1]
return res
if __name__ == "__main__":
ans = main()
print(ans)
| import sys
from collections import Counter
n, k, *a = list(map(int, sys.stdin.read().split()))
def main():
c = Counter(a)
res = sum(sorted(c.values())[:-k])
print(res)
if __name__ == "__main__":
main()
| false | 42.857143 | [
"- l = len(c)",
"- if l <= k:",
"- return 0",
"- c = sorted(list(c.items()), key=lambda x: x[1])",
"- res = 0",
"- for i in range(l - k):",
"- res += c[i][1]",
"- return res",
"+ res = sum(sorted(c.values())[:-k])",
"+ print(res)",
"- ans = main()",
"- print(ans)",
"+ main()"
]
| false | 0.045082 | 0.045639 | 0.987808 | [
"s947537872",
"s287756503"
]
|
u425317134 | p02678 | python | s654898240 | s571237805 | 704 | 537 | 36,864 | 36,916 | Accepted | Accepted | 23.72 | from collections import deque
def main():
n,m = list(map(int,input().split()))
ab = [[] for i in range(n)]
for _ in range(m):
a,b = list(map(int,input().split()))
ab[a-1].append(b-1)
ab[b-1].append(a-1)
q = deque()
q.append(0)
ans = [-1] * n
ans[0] = 0
while q:
now = q.popleft()
for i, next in enumerate(ab[now]):
if ans[next] == -1:
ans[next] = now+1
q.append(next)
if len(q) == 0:
break
print('Yes')
for i in range(1,n):
print((ans[i]))
if __name__=='__main__':
main()
| from collections import deque
def main():
n,m = list(map(int,input().split()))
arr = [[] for i in range(n)]
for _ in range(m):
a,b = list(map(int,input().split()))
arr[a-1].append(b-1)
arr[b-1].append(a-1)
q = deque()
q.append(0)
ans = [-1] * n
ans[0] = 0
while q:
now = q.popleft()
for i in arr[now]:
if ans[i] == -1:
ans[i] = now+1
q.append(i)
if len(q) == 0:
break
print('Yes')
for i in range(1,n):
print((ans[i]))
if __name__=='__main__':
main()
| 29 | 29 | 646 | 624 | from collections import deque
def main():
n, m = list(map(int, input().split()))
ab = [[] for i in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
ab[a - 1].append(b - 1)
ab[b - 1].append(a - 1)
q = deque()
q.append(0)
ans = [-1] * n
ans[0] = 0
while q:
now = q.popleft()
for i, next in enumerate(ab[now]):
if ans[next] == -1:
ans[next] = now + 1
q.append(next)
if len(q) == 0:
break
print("Yes")
for i in range(1, n):
print((ans[i]))
if __name__ == "__main__":
main()
| from collections import deque
def main():
n, m = list(map(int, input().split()))
arr = [[] for i in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
arr[a - 1].append(b - 1)
arr[b - 1].append(a - 1)
q = deque()
q.append(0)
ans = [-1] * n
ans[0] = 0
while q:
now = q.popleft()
for i in arr[now]:
if ans[i] == -1:
ans[i] = now + 1
q.append(i)
if len(q) == 0:
break
print("Yes")
for i in range(1, n):
print((ans[i]))
if __name__ == "__main__":
main()
| false | 0 | [
"- ab = [[] for i in range(n)]",
"+ arr = [[] for i in range(n)]",
"- ab[a - 1].append(b - 1)",
"- ab[b - 1].append(a - 1)",
"+ arr[a - 1].append(b - 1)",
"+ arr[b - 1].append(a - 1)",
"- for i, next in enumerate(ab[now]):",
"- if ans[next] == -1:",
"- ans[next] = now + 1",
"- q.append(next)",
"+ for i in arr[now]:",
"+ if ans[i] == -1:",
"+ ans[i] = now + 1",
"+ q.append(i)"
]
| false | 0.04157 | 0.041111 | 1.011167 | [
"s654898240",
"s571237805"
]
|
u840310460 | p03644 | python | s989779807 | s134950649 | 172 | 17 | 38,384 | 2,940 | Accepted | Accepted | 90.12 | n = int(eval(input()))
list_n = [2 ** i for i in range(1, 8)]
bag =[1]
for i in list_n:
if n >= i:
bag.append(i)
print((max(bag))) | N = int(eval(input()))
x=1
cou=0
while x <= N:
x *= 2
cou += 1
print((2**(cou-1))) | 7 | 8 | 140 | 94 | n = int(eval(input()))
list_n = [2**i for i in range(1, 8)]
bag = [1]
for i in list_n:
if n >= i:
bag.append(i)
print((max(bag)))
| N = int(eval(input()))
x = 1
cou = 0
while x <= N:
x *= 2
cou += 1
print((2 ** (cou - 1)))
| false | 12.5 | [
"-n = int(eval(input()))",
"-list_n = [2**i for i in range(1, 8)]",
"-bag = [1]",
"-for i in list_n:",
"- if n >= i:",
"- bag.append(i)",
"-print((max(bag)))",
"+N = int(eval(input()))",
"+x = 1",
"+cou = 0",
"+while x <= N:",
"+ x *= 2",
"+ cou += 1",
"+print((2 ** (cou - 1)))"
]
| false | 0.040285 | 0.04027 | 1.000389 | [
"s989779807",
"s134950649"
]
|
u571969099 | p02983 | python | s597163153 | s067629693 | 805 | 221 | 3,060 | 40,812 | Accepted | Accepted | 72.55 | l,r=[int(i) for i in input().split()]
l2,r2=l%2019,r%2019
if l//2019<r//2019:
print((0))
else:
k=2019*2019
for i in range(l,r):
for j in range(i+1,r+1):
k=min(k,i*j%2019)
print(k) | l, r = [int(i) for i in input().split()]
if r - l > 2019:
print((0))
else:
ans = 10 ** 9
for i in range(l, r + 1):
for j in range(i + 1, r + 1):
ans = min(ans, i * j % 2019)
print(ans)
| 10 | 9 | 204 | 227 | l, r = [int(i) for i in input().split()]
l2, r2 = l % 2019, r % 2019
if l // 2019 < r // 2019:
print((0))
else:
k = 2019 * 2019
for i in range(l, r):
for j in range(i + 1, r + 1):
k = min(k, i * j % 2019)
print(k)
| l, r = [int(i) for i in input().split()]
if r - l > 2019:
print((0))
else:
ans = 10**9
for i in range(l, r + 1):
for j in range(i + 1, r + 1):
ans = min(ans, i * j % 2019)
print(ans)
| false | 10 | [
"-l2, r2 = l % 2019, r % 2019",
"-if l // 2019 < r // 2019:",
"+if r - l > 2019:",
"- k = 2019 * 2019",
"- for i in range(l, r):",
"+ ans = 10**9",
"+ for i in range(l, r + 1):",
"- k = min(k, i * j % 2019)",
"- print(k)",
"+ ans = min(ans, i * j % 2019)",
"+ print(ans)"
]
| false | 0.038116 | 0.041423 | 0.920151 | [
"s597163153",
"s067629693"
]
|
u858748695 | p02939 | python | s893156520 | s908329396 | 1,552 | 1,192 | 90,092 | 36,392 | Accepted | Accepted | 23.2 | #!/usr/bin/env python3
s = eval(input())
n = len(s)
dp = {}
dp[(0, 1)] = 1
dp[(0, 2)] = 1
dp[(1, 2)] = dp[(0, 1)] + (s[0] != s[1])
dp[(1, 3)] = dp[(0, 1)] + 1
for i in range(2, n):
for j in [1, 2]:
dp[(i, i + j)] = 0
for k in [1, 2]:
now = s[i - k:i]
nxt = s[i:i + j]
dp[(i, i + j)] = max(dp[(i, i + j)], dp[(i - k, i)] + (now != nxt))
print((dp[(n - 1, n)]))
| #!/usr/bin/env python3
s = eval(input())
n = len(s)
dp = [[0] * 2 for _ in range(n)]
dp[0][0] = 1
dp[0][1] = 1
dp[1][0] = dp[0][1] + (s[0] != s[1])
dp[1][1] = dp[0][1] + 1
for i in range(2, n):
for j in range(2):
for k in range(2):
now = s[i - k - 1:i]
nxt = s[i:i + j + 1]
dp[i][j] = max(dp[i][j], dp[i - k - 1][k] + (now != nxt))
print((max(dp[n - 1])))
| 16 | 15 | 423 | 410 | #!/usr/bin/env python3
s = eval(input())
n = len(s)
dp = {}
dp[(0, 1)] = 1
dp[(0, 2)] = 1
dp[(1, 2)] = dp[(0, 1)] + (s[0] != s[1])
dp[(1, 3)] = dp[(0, 1)] + 1
for i in range(2, n):
for j in [1, 2]:
dp[(i, i + j)] = 0
for k in [1, 2]:
now = s[i - k : i]
nxt = s[i : i + j]
dp[(i, i + j)] = max(dp[(i, i + j)], dp[(i - k, i)] + (now != nxt))
print((dp[(n - 1, n)]))
| #!/usr/bin/env python3
s = eval(input())
n = len(s)
dp = [[0] * 2 for _ in range(n)]
dp[0][0] = 1
dp[0][1] = 1
dp[1][0] = dp[0][1] + (s[0] != s[1])
dp[1][1] = dp[0][1] + 1
for i in range(2, n):
for j in range(2):
for k in range(2):
now = s[i - k - 1 : i]
nxt = s[i : i + j + 1]
dp[i][j] = max(dp[i][j], dp[i - k - 1][k] + (now != nxt))
print((max(dp[n - 1])))
| false | 6.25 | [
"-dp = {}",
"-dp[(0, 1)] = 1",
"-dp[(0, 2)] = 1",
"-dp[(1, 2)] = dp[(0, 1)] + (s[0] != s[1])",
"-dp[(1, 3)] = dp[(0, 1)] + 1",
"+dp = [[0] * 2 for _ in range(n)]",
"+dp[0][0] = 1",
"+dp[0][1] = 1",
"+dp[1][0] = dp[0][1] + (s[0] != s[1])",
"+dp[1][1] = dp[0][1] + 1",
"- for j in [1, 2]:",
"- dp[(i, i + j)] = 0",
"- for k in [1, 2]:",
"- now = s[i - k : i]",
"- nxt = s[i : i + j]",
"- dp[(i, i + j)] = max(dp[(i, i + j)], dp[(i - k, i)] + (now != nxt))",
"-print((dp[(n - 1, n)]))",
"+ for j in range(2):",
"+ for k in range(2):",
"+ now = s[i - k - 1 : i]",
"+ nxt = s[i : i + j + 1]",
"+ dp[i][j] = max(dp[i][j], dp[i - k - 1][k] + (now != nxt))",
"+print((max(dp[n - 1])))"
]
| false | 0.043136 | 0.04401 | 0.980149 | [
"s893156520",
"s908329396"
]
|
u820839927 | p03038 | python | s720406818 | s386757204 | 881 | 546 | 87,380 | 32,952 | Accepted | Accepted | 38.02 | import os, sys, re, math, heapq
N, M = [int(s) for s in input().split(' ')]
dic = {}
cards = [int(s) for s in input().split(' ')]
for c in cards:
if c in dic:
dic[c] += 1
else:
dic[c] = 1
for i in range(M):
b,c = [int(s) for s in input().split(' ')]
if c in dic:
dic[c] += b
else:
dic[c] = b
keys = sorted(list(dic.keys()), reverse=True)
ret = 0
for k in keys:
ret += min(N, dic[k]) * k
N = N - dic[k]
if N <= 0:
break
print(ret)
| import os, sys, re, math, queue
N,M = list(map(int,input().split(' ')))
A = list(map(int,input().split(' ')))
memo = {}
for a in A:
if a in memo:
memo[a] += 1
else:
memo[a] = 1
for _ in range(M):
B,C = list(map(int,input().split(' ')))
if C in memo:
memo[C] += B
else:
memo[C] = B
ret = 0
cnt = 0
key_ary = sorted(list(memo.keys()),reverse=True)
for k in key_ary:
tmp = memo[k]
if cnt + tmp <= N:
ret += k * tmp
cnt += tmp
if cnt >= N:
break
else:
ret += k * (N - cnt)
break
print(ret) | 29 | 35 | 537 | 549 | import os, sys, re, math, heapq
N, M = [int(s) for s in input().split(" ")]
dic = {}
cards = [int(s) for s in input().split(" ")]
for c in cards:
if c in dic:
dic[c] += 1
else:
dic[c] = 1
for i in range(M):
b, c = [int(s) for s in input().split(" ")]
if c in dic:
dic[c] += b
else:
dic[c] = b
keys = sorted(list(dic.keys()), reverse=True)
ret = 0
for k in keys:
ret += min(N, dic[k]) * k
N = N - dic[k]
if N <= 0:
break
print(ret)
| import os, sys, re, math, queue
N, M = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
memo = {}
for a in A:
if a in memo:
memo[a] += 1
else:
memo[a] = 1
for _ in range(M):
B, C = list(map(int, input().split(" ")))
if C in memo:
memo[C] += B
else:
memo[C] = B
ret = 0
cnt = 0
key_ary = sorted(list(memo.keys()), reverse=True)
for k in key_ary:
tmp = memo[k]
if cnt + tmp <= N:
ret += k * tmp
cnt += tmp
if cnt >= N:
break
else:
ret += k * (N - cnt)
break
print(ret)
| false | 17.142857 | [
"-import os, sys, re, math, heapq",
"+import os, sys, re, math, queue",
"-N, M = [int(s) for s in input().split(\" \")]",
"-dic = {}",
"-cards = [int(s) for s in input().split(\" \")]",
"-for c in cards:",
"- if c in dic:",
"- dic[c] += 1",
"+N, M = list(map(int, input().split(\" \")))",
"+A = list(map(int, input().split(\" \")))",
"+memo = {}",
"+for a in A:",
"+ if a in memo:",
"+ memo[a] += 1",
"- dic[c] = 1",
"-for i in range(M):",
"- b, c = [int(s) for s in input().split(\" \")]",
"- if c in dic:",
"- dic[c] += b",
"+ memo[a] = 1",
"+for _ in range(M):",
"+ B, C = list(map(int, input().split(\" \")))",
"+ if C in memo:",
"+ memo[C] += B",
"- dic[c] = b",
"-keys = sorted(list(dic.keys()), reverse=True)",
"+ memo[C] = B",
"-for k in keys:",
"- ret += min(N, dic[k]) * k",
"- N = N - dic[k]",
"- if N <= 0:",
"+cnt = 0",
"+key_ary = sorted(list(memo.keys()), reverse=True)",
"+for k in key_ary:",
"+ tmp = memo[k]",
"+ if cnt + tmp <= N:",
"+ ret += k * tmp",
"+ cnt += tmp",
"+ if cnt >= N:",
"+ break",
"+ else:",
"+ ret += k * (N - cnt)"
]
| false | 0.03846 | 0.038322 | 1.003603 | [
"s720406818",
"s386757204"
]
|
u609061751 | p02947 | python | s366892577 | s234215509 | 685 | 375 | 64,344 | 58,844 | Accepted | Accepted | 45.26 | N=int(eval(input()))
dic={}
cnt=0
for i in range(N):
temp=' '.join(sorted(eval(input())))
if temp in dic:
dic[temp]+=1
else:
dic[temp]=1
for j in list(dic.values()):
cnt+=j*(j-1)//2
print(cnt)
| import sys
input = sys.stdin.readline
n = int(eval(input()))
from collections import defaultdict
d = defaultdict(int)
for i in range(n):
s = list(input().rstrip())
s.sort()
d["".join(s)] += 1
ans = 0
for i in list(d.keys()):
ans += d[i]*(d[i] - 1)//2
print(ans) | 12 | 20 | 218 | 291 | N = int(eval(input()))
dic = {}
cnt = 0
for i in range(N):
temp = " ".join(sorted(eval(input())))
if temp in dic:
dic[temp] += 1
else:
dic[temp] = 1
for j in list(dic.values()):
cnt += j * (j - 1) // 2
print(cnt)
| import sys
input = sys.stdin.readline
n = int(eval(input()))
from collections import defaultdict
d = defaultdict(int)
for i in range(n):
s = list(input().rstrip())
s.sort()
d["".join(s)] += 1
ans = 0
for i in list(d.keys()):
ans += d[i] * (d[i] - 1) // 2
print(ans)
| false | 40 | [
"-N = int(eval(input()))",
"-dic = {}",
"-cnt = 0",
"-for i in range(N):",
"- temp = \" \".join(sorted(eval(input())))",
"- if temp in dic:",
"- dic[temp] += 1",
"- else:",
"- dic[temp] = 1",
"-for j in list(dic.values()):",
"- cnt += j * (j - 1) // 2",
"-print(cnt)",
"+import sys",
"+",
"+input = sys.stdin.readline",
"+n = int(eval(input()))",
"+from collections import defaultdict",
"+",
"+d = defaultdict(int)",
"+for i in range(n):",
"+ s = list(input().rstrip())",
"+ s.sort()",
"+ d[\"\".join(s)] += 1",
"+ans = 0",
"+for i in list(d.keys()):",
"+ ans += d[i] * (d[i] - 1) // 2",
"+print(ans)"
]
| false | 0.164121 | 0.110831 | 1.48083 | [
"s366892577",
"s234215509"
]
|
u163501259 | p03835 | python | s361215653 | s196115169 | 1,516 | 921 | 2,940 | 8,864 | Accepted | Accepted | 39.25 | k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
for y in range(k+1):
z = s-x-y
if k >= z >= 0:
ans += 1
print(ans) | import sys
input = sys.stdin.readline
def main():
K, S = list(map(int, input().split()))
CNT = 0
for x in range(K+1):
for y in range(K+1):
if S - x -y >= 0 and S - x -y <= K:
CNT += 1
print(CNT)
if __name__ == '__main__':
main() | 8 | 13 | 167 | 303 | k, s = list(map(int, input().split()))
ans = 0
for x in range(k + 1):
for y in range(k + 1):
z = s - x - y
if k >= z >= 0:
ans += 1
print(ans)
| import sys
input = sys.stdin.readline
def main():
K, S = list(map(int, input().split()))
CNT = 0
for x in range(K + 1):
for y in range(K + 1):
if S - x - y >= 0 and S - x - y <= K:
CNT += 1
print(CNT)
if __name__ == "__main__":
main()
| false | 38.461538 | [
"-k, s = list(map(int, input().split()))",
"-ans = 0",
"-for x in range(k + 1):",
"- for y in range(k + 1):",
"- z = s - x - y",
"- if k >= z >= 0:",
"- ans += 1",
"-print(ans)",
"+import sys",
"+",
"+input = sys.stdin.readline",
"+",
"+",
"+def main():",
"+ K, S = list(map(int, input().split()))",
"+ CNT = 0",
"+ for x in range(K + 1):",
"+ for y in range(K + 1):",
"+ if S - x - y >= 0 and S - x - y <= K:",
"+ CNT += 1",
"+ print(CNT)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.037573 | 0.075069 | 0.500512 | [
"s361215653",
"s196115169"
]
|
u790710233 | p02862 | python | s822468800 | s752106512 | 230 | 128 | 3,064 | 3,064 | Accepted | Accepted | 44.35 | MOD = 10**9+7
X, Y = list(map(int, input().split()))
x, y = X, Y
while 0 <= y:
if x == 2*y:
break
x += 1
y -= 1
else:
print((0))
exit()
def com(n, r):
X = Y = 1
if r < 0 or n < r:
return 0
if n-r < r:
r = n-r
for i in range(1, r+1):
Y = Y*i % MOD
X = X*(n-i+1) % MOD
Y = pow(Y, MOD-2, MOD)
return X*Y
print((com(x//2, x-X) % MOD))
| MOD = 10**9+7
x, y = list(map(int, input().split()))
n, r1 = divmod(2*y-x, 3)
m, r2 = divmod(2*x-y, 3)
def com(n, r):
X = Y = 1
if r < 0 or n < r:
return 0
if n-r < r:
r = n-r
for i in range(1, r+1):
Y = Y*i % MOD
X = X*(n-i+1) % MOD
Y = pow(Y, MOD-2, MOD)
return X*Y
if r1 or r2:
print((0))
else:
print((com(n+m, n) % MOD)) | 27 | 23 | 435 | 404 | MOD = 10**9 + 7
X, Y = list(map(int, input().split()))
x, y = X, Y
while 0 <= y:
if x == 2 * y:
break
x += 1
y -= 1
else:
print((0))
exit()
def com(n, r):
X = Y = 1
if r < 0 or n < r:
return 0
if n - r < r:
r = n - r
for i in range(1, r + 1):
Y = Y * i % MOD
X = X * (n - i + 1) % MOD
Y = pow(Y, MOD - 2, MOD)
return X * Y
print((com(x // 2, x - X) % MOD))
| MOD = 10**9 + 7
x, y = list(map(int, input().split()))
n, r1 = divmod(2 * y - x, 3)
m, r2 = divmod(2 * x - y, 3)
def com(n, r):
X = Y = 1
if r < 0 or n < r:
return 0
if n - r < r:
r = n - r
for i in range(1, r + 1):
Y = Y * i % MOD
X = X * (n - i + 1) % MOD
Y = pow(Y, MOD - 2, MOD)
return X * Y
if r1 or r2:
print((0))
else:
print((com(n + m, n) % MOD))
| false | 14.814815 | [
"-X, Y = list(map(int, input().split()))",
"-x, y = X, Y",
"-while 0 <= y:",
"- if x == 2 * y:",
"- break",
"- x += 1",
"- y -= 1",
"-else:",
"- print((0))",
"- exit()",
"+x, y = list(map(int, input().split()))",
"+n, r1 = divmod(2 * y - x, 3)",
"+m, r2 = divmod(2 * x - y, 3)",
"-print((com(x // 2, x - X) % MOD))",
"+if r1 or r2:",
"+ print((0))",
"+else:",
"+ print((com(n + m, n) % MOD))"
]
| false | 0.08771 | 0.053194 | 1.648882 | [
"s822468800",
"s752106512"
]
|
u054825571 | p03077 | python | s033231397 | s598841294 | 31 | 28 | 9,180 | 9,052 | Accepted | Accepted | 9.68 | import math
N=int(eval(input()))
A=[int(eval(input())) for _ in range(5)]
n=min(A)
for i in range(5):
if n==A[i]:
p=i
break
k=math.ceil(N/n)
print((k+4)) | import math
N=int(eval(input()))
A=[int(eval(input())) for _ in range(5)]
print((math.ceil(N/min(A))+4))
| 11 | 5 | 160 | 96 | import math
N = int(eval(input()))
A = [int(eval(input())) for _ in range(5)]
n = min(A)
for i in range(5):
if n == A[i]:
p = i
break
k = math.ceil(N / n)
print((k + 4))
| import math
N = int(eval(input()))
A = [int(eval(input())) for _ in range(5)]
print((math.ceil(N / min(A)) + 4))
| false | 54.545455 | [
"-n = min(A)",
"-for i in range(5):",
"- if n == A[i]:",
"- p = i",
"- break",
"-k = math.ceil(N / n)",
"-print((k + 4))",
"+print((math.ceil(N / min(A)) + 4))"
]
| false | 0.155876 | 0.119082 | 1.30898 | [
"s033231397",
"s598841294"
]
|
u600402037 | p02888 | python | s021725017 | s136582700 | 1,743 | 883 | 51,548 | 3,188 | Accepted | Accepted | 49.34 | from bisect import bisect_left
N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
answer = 0
for i in range(N):
for j in range(i+1, N):
answer += bisect_left(L[j+1:], L[i]+L[j])
print(answer)
| N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
answer = 0
for i in range(N-1, 1, -1): # iは辺の最大値
s = 0 # aは1番短い辺
l = i-1
while l > s:
if L[s] + L[l] > L[i]:
answer += l - s
l -= 1
else:
s += 1
print(answer)
| 10 | 14 | 225 | 298 | from bisect import bisect_left
N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
answer = 0
for i in range(N):
for j in range(i + 1, N):
answer += bisect_left(L[j + 1 :], L[i] + L[j])
print(answer)
| N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
answer = 0
for i in range(N - 1, 1, -1): # iは辺の最大値
s = 0 # aは1番短い辺
l = i - 1
while l > s:
if L[s] + L[l] > L[i]:
answer += l - s
l -= 1
else:
s += 1
print(answer)
| false | 28.571429 | [
"-from bisect import bisect_left",
"-",
"-for i in range(N):",
"- for j in range(i + 1, N):",
"- answer += bisect_left(L[j + 1 :], L[i] + L[j])",
"+for i in range(N - 1, 1, -1): # iは辺の最大値",
"+ s = 0 # aは1番短い辺",
"+ l = i - 1",
"+ while l > s:",
"+ if L[s] + L[l] > L[i]:",
"+ answer += l - s",
"+ l -= 1",
"+ else:",
"+ s += 1"
]
| false | 0.036244 | 0.035156 | 1.030946 | [
"s021725017",
"s136582700"
]
|
u761320129 | p03320 | python | s457760282 | s909480443 | 437 | 57 | 9,128 | 3,696 | Accepted | Accepted | 86.96 | K = int(input())
S = lambda n: sum(map(int,str(n)))
R = lambda n: n/S(n)
arr = []
for i in range(1,10000):
for j in range(1,15):
arr.append(int(str(i) + '9'*j))
arr.sort(reverse=True)
min_r = arr[0]
snukes = []
for a in arr:
r = R(a)
if r < min_r:
min_r = r
snukes.append(a)
for i in range(min(9,K)):
print(i+1)
if K <= 9:
exit()
K -= 9
print(*snukes[:-K-1:-1],sep='\n')
| K = int(input())
S = lambda n: sum(map(int,str(n)))
R = lambda n: n/S(n)
arr = []
for i in range(1,1000):
for j in range(1,15):
arr.append(int(str(i) + '9'*j))
arr.sort(reverse=True)
min_r = arr[0]
snukes = []
for a in arr:
r = R(a)
if r < min_r:
min_r = r
snukes.append(a)
for i in range(min(9,K)):
print(i+1)
if K <= 9:
exit()
K -= 9
print(*snukes[:-K-1:-1],sep='\n')
| 25 | 25 | 442 | 441 | K = int(input())
S = lambda n: sum(map(int, str(n)))
R = lambda n: n / S(n)
arr = []
for i in range(1, 10000):
for j in range(1, 15):
arr.append(int(str(i) + "9" * j))
arr.sort(reverse=True)
min_r = arr[0]
snukes = []
for a in arr:
r = R(a)
if r < min_r:
min_r = r
snukes.append(a)
for i in range(min(9, K)):
print(i + 1)
if K <= 9:
exit()
K -= 9
print(*snukes[: -K - 1 : -1], sep="\n")
| K = int(input())
S = lambda n: sum(map(int, str(n)))
R = lambda n: n / S(n)
arr = []
for i in range(1, 1000):
for j in range(1, 15):
arr.append(int(str(i) + "9" * j))
arr.sort(reverse=True)
min_r = arr[0]
snukes = []
for a in arr:
r = R(a)
if r < min_r:
min_r = r
snukes.append(a)
for i in range(min(9, K)):
print(i + 1)
if K <= 9:
exit()
K -= 9
print(*snukes[: -K - 1 : -1], sep="\n")
| false | 0 | [
"-for i in range(1, 10000):",
"+for i in range(1, 1000):"
]
| false | 3.637729 | 0.084512 | 43.044056 | [
"s457760282",
"s909480443"
]
|
u108617242 | p02935 | python | s958223605 | s171989787 | 190 | 170 | 38,256 | 38,512 | Accepted | Accepted | 10.53 | N = int(eval(input()))
V = list(map(int, input().split()))
V = sorted(V)
merged_v = (V[0]+ V[1]) / 2
for i in range(2, N):
merged_v = (merged_v + V[i]) / 2
print(merged_v)
| N = int(eval(input()))
v = list(map(int, input().split()))
sort_v = sorted(v)
ans = sort_v[0]
for i in range(1, N):
ans = (ans + sort_v[i]) / 2
print(ans) | 7 | 7 | 176 | 158 | N = int(eval(input()))
V = list(map(int, input().split()))
V = sorted(V)
merged_v = (V[0] + V[1]) / 2
for i in range(2, N):
merged_v = (merged_v + V[i]) / 2
print(merged_v)
| N = int(eval(input()))
v = list(map(int, input().split()))
sort_v = sorted(v)
ans = sort_v[0]
for i in range(1, N):
ans = (ans + sort_v[i]) / 2
print(ans)
| false | 0 | [
"-V = list(map(int, input().split()))",
"-V = sorted(V)",
"-merged_v = (V[0] + V[1]) / 2",
"-for i in range(2, N):",
"- merged_v = (merged_v + V[i]) / 2",
"-print(merged_v)",
"+v = list(map(int, input().split()))",
"+sort_v = sorted(v)",
"+ans = sort_v[0]",
"+for i in range(1, N):",
"+ ans = (ans + sort_v[i]) / 2",
"+print(ans)"
]
| false | 0.051201 | 0.053823 | 0.951279 | [
"s958223605",
"s171989787"
]
|
u576917603 | p03244 | python | s860883891 | s406072582 | 87 | 78 | 20,360 | 19,040 | Accepted | Accepted | 10.34 | n=int(eval(input()))
a=list(map(int,input().split()))
a1=a[::2]
a2=a[1::2]
if a1==a2 and len(set(a1))==1:
print((n//2))
exit()
import collections as c
c1=c.Counter(a1)
c2=c.Counter(a2)
c1=c1.most_common()
c2=c2.most_common()
ans=0
if c1[0][0]==c2[0][0]:
ans=min((n//2-c1[0][1])+(n//2-c2[1][1]),(n//2-c1[1][1])+(n//2-c2[0][1]))
else:
ans=(n//2-c1[0][1])+(n//2-c2[0][1])
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
a1=a[::2]
a2=a[1::2]
import collections
c1=collections.Counter(a1)
c2=collections.Counter(a2)
c1=c1.most_common(2)
c2=c2.most_common(2)
if a1==a2 and len(c1)==1 and len(c2)==1:
print((len(a1)))
exit()
if len(c1)==1 and len(c2)==1 and c1[0][0]!=c2[0][0]:
print((0))
exit()
ans=0
if c1[0][0]!=c2[0][0]:
ans+=n-c1[0][1]-c2[0][1]
else:
if len(c1)==1:
ans+=len(a2)-c2[1][1]
elif len(c2)==1:
ans+=len(a1)-c1[1][1]
else :
ans=min(len(a1)-c1[0][1]+len(a2)-c2[1][1],len(a1)-c1[1][1]+len(a2)-c2[0][1])
print(ans) | 18 | 26 | 404 | 599 | n = int(eval(input()))
a = list(map(int, input().split()))
a1 = a[::2]
a2 = a[1::2]
if a1 == a2 and len(set(a1)) == 1:
print((n // 2))
exit()
import collections as c
c1 = c.Counter(a1)
c2 = c.Counter(a2)
c1 = c1.most_common()
c2 = c2.most_common()
ans = 0
if c1[0][0] == c2[0][0]:
ans = min(
(n // 2 - c1[0][1]) + (n // 2 - c2[1][1]),
(n // 2 - c1[1][1]) + (n // 2 - c2[0][1]),
)
else:
ans = (n // 2 - c1[0][1]) + (n // 2 - c2[0][1])
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
a1 = a[::2]
a2 = a[1::2]
import collections
c1 = collections.Counter(a1)
c2 = collections.Counter(a2)
c1 = c1.most_common(2)
c2 = c2.most_common(2)
if a1 == a2 and len(c1) == 1 and len(c2) == 1:
print((len(a1)))
exit()
if len(c1) == 1 and len(c2) == 1 and c1[0][0] != c2[0][0]:
print((0))
exit()
ans = 0
if c1[0][0] != c2[0][0]:
ans += n - c1[0][1] - c2[0][1]
else:
if len(c1) == 1:
ans += len(a2) - c2[1][1]
elif len(c2) == 1:
ans += len(a1) - c1[1][1]
else:
ans = min(
len(a1) - c1[0][1] + len(a2) - c2[1][1],
len(a1) - c1[1][1] + len(a2) - c2[0][1],
)
print(ans)
| false | 30.769231 | [
"-if a1 == a2 and len(set(a1)) == 1:",
"- print((n // 2))",
"+import collections",
"+",
"+c1 = collections.Counter(a1)",
"+c2 = collections.Counter(a2)",
"+c1 = c1.most_common(2)",
"+c2 = c2.most_common(2)",
"+if a1 == a2 and len(c1) == 1 and len(c2) == 1:",
"+ print((len(a1)))",
"-import collections as c",
"-",
"-c1 = c.Counter(a1)",
"-c2 = c.Counter(a2)",
"-c1 = c1.most_common()",
"-c2 = c2.most_common()",
"+if len(c1) == 1 and len(c2) == 1 and c1[0][0] != c2[0][0]:",
"+ print((0))",
"+ exit()",
"-if c1[0][0] == c2[0][0]:",
"- ans = min(",
"- (n // 2 - c1[0][1]) + (n // 2 - c2[1][1]),",
"- (n // 2 - c1[1][1]) + (n // 2 - c2[0][1]),",
"- )",
"+if c1[0][0] != c2[0][0]:",
"+ ans += n - c1[0][1] - c2[0][1]",
"- ans = (n // 2 - c1[0][1]) + (n // 2 - c2[0][1])",
"+ if len(c1) == 1:",
"+ ans += len(a2) - c2[1][1]",
"+ elif len(c2) == 1:",
"+ ans += len(a1) - c1[1][1]",
"+ else:",
"+ ans = min(",
"+ len(a1) - c1[0][1] + len(a2) - c2[1][1],",
"+ len(a1) - c1[1][1] + len(a2) - c2[0][1],",
"+ )"
]
| false | 0.039674 | 0.037573 | 1.055915 | [
"s860883891",
"s406072582"
]
|
u119148115 | p02889 | python | s580154334 | s918407580 | 1,235 | 666 | 83,292 | 78,636 | Accepted | Accepted | 46.07 | import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
N,M,L = MI()
class WarshallFloyd():
def __init__(self,N): # Nは頂点の個数
self.N = N
self.d = [[float('inf')]*N for i in range(N)] # d[i][j] = iからjへの最短距離,0-indexed
def add(self,u,v,c,directed = False):
if directed is False: # 無向グラフの場合
self.d[u][v] = c
self.d[v][u] = c
else: # 有向グラフの場合
self.d[u][v] = c
def WarshallFloyd_search(self):
for k in range(self.N):
for i in range(self.N):
for j in range(self.N):
self.d[i][j] = min(self.d[i][j],self.d[i][k] + self.d[k][j])
return self.d
W = WarshallFloyd(N)
for i in range(M):
a,b,c = MI()
W.add(a-1,b-1,c,directed=False)
d = W.WarshallFloyd_search()
d2 = [[float('inf')]*N for _ in range(N)]
for i in range(N):
for j in range(N):
if d[i][j] <= L:
d2[i][j] = 1
for k in range(N):
for i in range(N):
for j in range(N):
d2[i][j] = min(d2[i][j],d2[i][k]+d2[k][j])
Q = I()
for i in range(Q):
s,t = MI()
if d2[s-1][t-1] == float('inf'):
print((-1))
continue
print((d2[s-1][t-1]-1))
| # ABC143-E
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,M,L = MI()
inf = 10**12
cost = [[inf]*(N+1) for _ in range(N+1)] # cost[i][j] = 町iから町jへ移動するのにかかる燃料の総和
# WarshallFloyd法
for i in range(M):
a,b,c = MI()
cost[a][b] = c
cost[b][a] = c
for k in range(N+1):
for i in range(N+1):
for j in range(N+1):
cost[i][j] = min(cost[i][j],cost[i][k]+cost[k][j])
ans = [[inf]*(N+1) for _ in range(N+1)] # ans[i][j] = 町iから町jへ移動するために必要な燃料補給の回数+1
# WarshallFloyd法、再び
for i in range(N+1):
for j in range(N+1):
if cost[i][j] <= L:
ans[i][j] = 1
for k in range(N+1):
for i in range(N+1):
for j in range(N+1):
ans[i][j] = min(ans[i][j],ans[i][k]+ans[k][j])
Q = I()
for i in range(Q):
s,t = MI()
if ans[s][t] == inf:
print((-1))
continue
print((ans[s][t]-1))
| 57 | 45 | 1,687 | 988 | import sys
sys.setrecursionlimit(10**7)
def I():
return int(sys.stdin.readline().rstrip())
def MI():
return list(map(int, sys.stdin.readline().rstrip().split()))
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
def LI2():
return list(map(int, sys.stdin.readline().rstrip())) # 空白なし
def S():
return sys.stdin.readline().rstrip()
def LS():
return list(sys.stdin.readline().rstrip().split()) # 空白あり
def LS2():
return list(sys.stdin.readline().rstrip()) # 空白なし
N, M, L = MI()
class WarshallFloyd:
def __init__(self, N): # Nは頂点の個数
self.N = N
self.d = [
[float("inf")] * N for i in range(N)
] # d[i][j] = iからjへの最短距離,0-indexed
def add(self, u, v, c, directed=False):
if directed is False: # 無向グラフの場合
self.d[u][v] = c
self.d[v][u] = c
else: # 有向グラフの場合
self.d[u][v] = c
def WarshallFloyd_search(self):
for k in range(self.N):
for i in range(self.N):
for j in range(self.N):
self.d[i][j] = min(self.d[i][j], self.d[i][k] + self.d[k][j])
return self.d
W = WarshallFloyd(N)
for i in range(M):
a, b, c = MI()
W.add(a - 1, b - 1, c, directed=False)
d = W.WarshallFloyd_search()
d2 = [[float("inf")] * N for _ in range(N)]
for i in range(N):
for j in range(N):
if d[i][j] <= L:
d2[i][j] = 1
for k in range(N):
for i in range(N):
for j in range(N):
d2[i][j] = min(d2[i][j], d2[i][k] + d2[k][j])
Q = I()
for i in range(Q):
s, t = MI()
if d2[s - 1][t - 1] == float("inf"):
print((-1))
continue
print((d2[s - 1][t - 1] - 1))
| # ABC143-E
import sys
def I():
return int(sys.stdin.readline().rstrip())
def MI():
return list(map(int, sys.stdin.readline().rstrip().split()))
N, M, L = MI()
inf = 10**12
cost = [[inf] * (N + 1) for _ in range(N + 1)] # cost[i][j] = 町iから町jへ移動するのにかかる燃料の総和
# WarshallFloyd法
for i in range(M):
a, b, c = MI()
cost[a][b] = c
cost[b][a] = c
for k in range(N + 1):
for i in range(N + 1):
for j in range(N + 1):
cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j])
ans = [[inf] * (N + 1) for _ in range(N + 1)] # ans[i][j] = 町iから町jへ移動するために必要な燃料補給の回数+1
# WarshallFloyd法、再び
for i in range(N + 1):
for j in range(N + 1):
if cost[i][j] <= L:
ans[i][j] = 1
for k in range(N + 1):
for i in range(N + 1):
for j in range(N + 1):
ans[i][j] = min(ans[i][j], ans[i][k] + ans[k][j])
Q = I()
for i in range(Q):
s, t = MI()
if ans[s][t] == inf:
print((-1))
continue
print((ans[s][t] - 1))
| false | 21.052632 | [
"+# ABC143-E",
"-",
"-sys.setrecursionlimit(10**7)",
"-def LI():",
"- return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり",
"-",
"-",
"-def LI2():",
"- return list(map(int, sys.stdin.readline().rstrip())) # 空白なし",
"-",
"-",
"-def S():",
"- return sys.stdin.readline().rstrip()",
"-",
"-",
"-def LS():",
"- return list(sys.stdin.readline().rstrip().split()) # 空白あり",
"-",
"-",
"-def LS2():",
"- return list(sys.stdin.readline().rstrip()) # 空白なし",
"-",
"-",
"-",
"-",
"-class WarshallFloyd:",
"- def __init__(self, N): # Nは頂点の個数",
"- self.N = N",
"- self.d = [",
"- [float(\"inf\")] * N for i in range(N)",
"- ] # d[i][j] = iからjへの最短距離,0-indexed",
"-",
"- def add(self, u, v, c, directed=False):",
"- if directed is False: # 無向グラフの場合",
"- self.d[u][v] = c",
"- self.d[v][u] = c",
"- else: # 有向グラフの場合",
"- self.d[u][v] = c",
"-",
"- def WarshallFloyd_search(self):",
"- for k in range(self.N):",
"- for i in range(self.N):",
"- for j in range(self.N):",
"- self.d[i][j] = min(self.d[i][j], self.d[i][k] + self.d[k][j])",
"- return self.d",
"-",
"-",
"-W = WarshallFloyd(N)",
"+inf = 10**12",
"+cost = [[inf] * (N + 1) for _ in range(N + 1)] # cost[i][j] = 町iから町jへ移動するのにかかる燃料の総和",
"+# WarshallFloyd法",
"- W.add(a - 1, b - 1, c, directed=False)",
"-d = W.WarshallFloyd_search()",
"-d2 = [[float(\"inf\")] * N for _ in range(N)]",
"-for i in range(N):",
"- for j in range(N):",
"- if d[i][j] <= L:",
"- d2[i][j] = 1",
"-for k in range(N):",
"- for i in range(N):",
"- for j in range(N):",
"- d2[i][j] = min(d2[i][j], d2[i][k] + d2[k][j])",
"+ cost[a][b] = c",
"+ cost[b][a] = c",
"+for k in range(N + 1):",
"+ for i in range(N + 1):",
"+ for j in range(N + 1):",
"+ cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j])",
"+ans = [[inf] * (N + 1) for _ in range(N + 1)] # ans[i][j] = 町iから町jへ移動するために必要な燃料補給の回数+1",
"+# WarshallFloyd法、再び",
"+for i in range(N + 1):",
"+ for j in range(N + 1):",
"+ if cost[i][j] <= L:",
"+ ans[i][j] = 1",
"+for k in range(N + 1):",
"+ for i in range(N + 1):",
"+ for j in range(N + 1):",
"+ ans[i][j] = min(ans[i][j], ans[i][k] + ans[k][j])",
"- if d2[s - 1][t - 1] == float(\"inf\"):",
"+ if ans[s][t] == inf:",
"- print((d2[s - 1][t - 1] - 1))",
"+ print((ans[s][t] - 1))"
]
| false | 0.047785 | 0.038521 | 1.240475 | [
"s580154334",
"s918407580"
]
|
u401686269 | p02763 | python | s361875223 | s265308095 | 1,069 | 861 | 373,504 | 526,348 | Accepted | Accepted | 19.46 | class SegTree:
""" segment tree with point modification and range product. """
# # https://yukicoder.me/submissions/452850
def __init__(self, N, data_f = min, data_unit=1<<30):
self.N = N
self.data_f = data_f
self.data_unit = data_unit
self.data = [self.data_unit] * (N + N)
def build(self, raw_data):
data = self.data
f = self.data_f
N = self.N
data[N:] = raw_data[:]
for i in range(N - 1, 0, -1):
data[i] = f(data[i << 1], data[i << 1 | 1])
def set_val(self, i, x):
data = self.data
f = self.data_f
i += self.N
data[i] = x
while i > 1:
data[i >> 1] = f(data[i], data[i ^ 1])
i >>= 1
def fold(self, L, R):
""" compute for [L, R) """
vL = vR = self.data_unit
data = self.data
f = self.data_f
L += self.N
R += self.N
while L < R:
if L & 1:
vL = f(vL, data[L])
L += 1
if R & 1:
R -= 1
vR = f(data[R], vR)
L >>= 1
R >>= 1
return f(vL, vR)
N=int(eval(input()))
S=eval(input())
seg = SegTree(N,set.union,set())
S = [set(S[i]) for i in range(N)]
seg.build(S)
Q=int(eval(input()))
for i in range(Q):
*q, = input().split()
if q[0] == '1':
i, c = q[1:]
seg.set_val(int(i)-1,set(c))
else:
l,r = list(map(int,q[1:]))
print((len(seg.fold(l-1,r))))
| class SegTree:
""" segment tree with point modification and range product. """
# # https://yukicoder.me/submissions/452850
def __init__(self, N, data_f = min, data_unit=1<<30):
self.N = N
self.data_f = data_f
self.data_unit = data_unit
self.data = [self.data_unit] * (N + N)
def build(self, raw_data):
data = self.data
f = self.data_f
N = self.N
data[N:] = raw_data[:]
for i in range(N - 1, 0, -1):
data[i] = f(data[i << 1], data[i << 1 | 1])
def set_val(self, i, x):
data = self.data
f = self.data_f
i += self.N
data[i] = x
while i > 1:
data[i >> 1] = f(data[i], data[i ^ 1])
i >>= 1
def fold(self, L, R):
""" compute for [L, R) """
vL = vR = self.data_unit
data = self.data
f = self.data_f
L += self.N
R += self.N
while L < R:
if L & 1:
vL = f(vL, data[L])
L += 1
if R & 1:
R -= 1
vR = f(data[R], vR)
L >>= 1
R >>= 1
return f(vL, vR)
N=int(eval(input()))
S=eval(input())
data = [[0]*N for _ in range(26)]
di = {}
for i in range(N):
data[ord(S[i])-97][i] = 1
di[i] = S[i]
seg = [SegTree(N,max,0) for _ in range(26)]
for i in range(26):
seg[i].build(data[i])
Q=int(eval(input()))
for i in range(Q):
*q, = input().split()
if q[0] == '1':
i, c = q[1:]
i = int(i)-1
c_old = di[i]
di[i] = c
seg[ord(c_old)-97].set_val(i,0)
seg[ord(c)-97].set_val(i,1)
else:
l,r = list(map(int,q[1:]))
ans=0
for i in range(26):
ans += seg[i].fold(l-1,r)
print(ans) | 58 | 71 | 1,549 | 1,805 | class SegTree:
"""segment tree with point modification and range product."""
# # https://yukicoder.me/submissions/452850
def __init__(self, N, data_f=min, data_unit=1 << 30):
self.N = N
self.data_f = data_f
self.data_unit = data_unit
self.data = [self.data_unit] * (N + N)
def build(self, raw_data):
data = self.data
f = self.data_f
N = self.N
data[N:] = raw_data[:]
for i in range(N - 1, 0, -1):
data[i] = f(data[i << 1], data[i << 1 | 1])
def set_val(self, i, x):
data = self.data
f = self.data_f
i += self.N
data[i] = x
while i > 1:
data[i >> 1] = f(data[i], data[i ^ 1])
i >>= 1
def fold(self, L, R):
"""compute for [L, R)"""
vL = vR = self.data_unit
data = self.data
f = self.data_f
L += self.N
R += self.N
while L < R:
if L & 1:
vL = f(vL, data[L])
L += 1
if R & 1:
R -= 1
vR = f(data[R], vR)
L >>= 1
R >>= 1
return f(vL, vR)
N = int(eval(input()))
S = eval(input())
seg = SegTree(N, set.union, set())
S = [set(S[i]) for i in range(N)]
seg.build(S)
Q = int(eval(input()))
for i in range(Q):
(*q,) = input().split()
if q[0] == "1":
i, c = q[1:]
seg.set_val(int(i) - 1, set(c))
else:
l, r = list(map(int, q[1:]))
print((len(seg.fold(l - 1, r))))
| class SegTree:
"""segment tree with point modification and range product."""
# # https://yukicoder.me/submissions/452850
def __init__(self, N, data_f=min, data_unit=1 << 30):
self.N = N
self.data_f = data_f
self.data_unit = data_unit
self.data = [self.data_unit] * (N + N)
def build(self, raw_data):
data = self.data
f = self.data_f
N = self.N
data[N:] = raw_data[:]
for i in range(N - 1, 0, -1):
data[i] = f(data[i << 1], data[i << 1 | 1])
def set_val(self, i, x):
data = self.data
f = self.data_f
i += self.N
data[i] = x
while i > 1:
data[i >> 1] = f(data[i], data[i ^ 1])
i >>= 1
def fold(self, L, R):
"""compute for [L, R)"""
vL = vR = self.data_unit
data = self.data
f = self.data_f
L += self.N
R += self.N
while L < R:
if L & 1:
vL = f(vL, data[L])
L += 1
if R & 1:
R -= 1
vR = f(data[R], vR)
L >>= 1
R >>= 1
return f(vL, vR)
N = int(eval(input()))
S = eval(input())
data = [[0] * N for _ in range(26)]
di = {}
for i in range(N):
data[ord(S[i]) - 97][i] = 1
di[i] = S[i]
seg = [SegTree(N, max, 0) for _ in range(26)]
for i in range(26):
seg[i].build(data[i])
Q = int(eval(input()))
for i in range(Q):
(*q,) = input().split()
if q[0] == "1":
i, c = q[1:]
i = int(i) - 1
c_old = di[i]
di[i] = c
seg[ord(c_old) - 97].set_val(i, 0)
seg[ord(c) - 97].set_val(i, 1)
else:
l, r = list(map(int, q[1:]))
ans = 0
for i in range(26):
ans += seg[i].fold(l - 1, r)
print(ans)
| false | 18.309859 | [
"-seg = SegTree(N, set.union, set())",
"-S = [set(S[i]) for i in range(N)]",
"-seg.build(S)",
"+data = [[0] * N for _ in range(26)]",
"+di = {}",
"+for i in range(N):",
"+ data[ord(S[i]) - 97][i] = 1",
"+ di[i] = S[i]",
"+seg = [SegTree(N, max, 0) for _ in range(26)]",
"+for i in range(26):",
"+ seg[i].build(data[i])",
"- seg.set_val(int(i) - 1, set(c))",
"+ i = int(i) - 1",
"+ c_old = di[i]",
"+ di[i] = c",
"+ seg[ord(c_old) - 97].set_val(i, 0)",
"+ seg[ord(c) - 97].set_val(i, 1)",
"- print((len(seg.fold(l - 1, r))))",
"+ ans = 0",
"+ for i in range(26):",
"+ ans += seg[i].fold(l - 1, r)",
"+ print(ans)"
]
| false | 0.05048 | 0.035792 | 1.410368 | [
"s361875223",
"s265308095"
]
|
u251515715 | p03013 | python | s079609868 | s928783152 | 378 | 186 | 460,020 | 13,192 | Accepted | Accepted | 50.79 | n,m=list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
broken = set(a)
dp=[0]*(n+1)
mod = 10**9 + 7
for i in range(n,-1,-1):
if i in broken:
continue
else:
if i==n or i==n-1:
dp[i]=1
else:
dp[i]=dp[i+1]+dp[i+2]
print((dp[0]%mod)) | n,m=list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
broken = set(a)
dp=[0]*(n+1)
mod = 10**9 + 7
for i in range(n,-1,-1):
if i in broken:
continue
elif i==n or i==n-1:
dp[i]=1
else:
dp[i]=dp[i+1]+dp[i+2]
dp[i]%=mod
print((dp[0])) | 14 | 15 | 279 | 278 | n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
broken = set(a)
dp = [0] * (n + 1)
mod = 10**9 + 7
for i in range(n, -1, -1):
if i in broken:
continue
else:
if i == n or i == n - 1:
dp[i] = 1
else:
dp[i] = dp[i + 1] + dp[i + 2]
print((dp[0] % mod))
| n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
broken = set(a)
dp = [0] * (n + 1)
mod = 10**9 + 7
for i in range(n, -1, -1):
if i in broken:
continue
elif i == n or i == n - 1:
dp[i] = 1
else:
dp[i] = dp[i + 1] + dp[i + 2]
dp[i] %= mod
print((dp[0]))
| false | 6.666667 | [
"+ elif i == n or i == n - 1:",
"+ dp[i] = 1",
"- if i == n or i == n - 1:",
"- dp[i] = 1",
"- else:",
"- dp[i] = dp[i + 1] + dp[i + 2]",
"-print((dp[0] % mod))",
"+ dp[i] = dp[i + 1] + dp[i + 2]",
"+ dp[i] %= mod",
"+print((dp[0]))"
]
| false | 0.036691 | 0.042583 | 0.861629 | [
"s079609868",
"s928783152"
]
|
u413165887 | p03848 | python | s904867037 | s005804371 | 105 | 92 | 14,008 | 14,008 | Accepted | Accepted | 12.38 | import sys
n = int(eval(input()))
a = list(map(int, input().split(' ')))
a.sort()
if n%2 == 0:
for i in range(n-1):
if i%2 == 0:
if a[i] == a[i+1]:
continue
else:
print((0))
sys.exit()
else:
if a[i]+2 == a[i+1]:
continue
else:
print((0))
sys.exit()
result = 2 ** (n//2)
print((result % (10**9+7)))
else:
if a[0] == 0:
for i in range(1, n-1):
if i%2 == 1:
if a[i] == a[i+1]:
continue
else:
print((0))
sys.exit()
else:
if a[i]+2 == a[i+1]:
continue
else:
print((0))
sys.exit()
result = 2**((n-1)//2)
print((result %(10**9+7)))
else:
print((0))
sys.exit() | def main():
import sys
n = int(eval(input()))
a = list(map(int, input().split(' ')))
if n%2 == 1:
a.append(0)
a.sort()
for i in range(n-1):
if i%2 == 0:
if a[i] == a[i+1]:
continue
else:
print((0))
sys.exit()
else:
if a[i]+2 == a[i+1]:
continue
else:
print((0))
sys.exit()
result = 2 ** (n//2)
print((result % (10**9+7)))
if __name__ == '__main__':
main() | 41 | 24 | 1,001 | 570 | import sys
n = int(eval(input()))
a = list(map(int, input().split(" ")))
a.sort()
if n % 2 == 0:
for i in range(n - 1):
if i % 2 == 0:
if a[i] == a[i + 1]:
continue
else:
print((0))
sys.exit()
else:
if a[i] + 2 == a[i + 1]:
continue
else:
print((0))
sys.exit()
result = 2 ** (n // 2)
print((result % (10**9 + 7)))
else:
if a[0] == 0:
for i in range(1, n - 1):
if i % 2 == 1:
if a[i] == a[i + 1]:
continue
else:
print((0))
sys.exit()
else:
if a[i] + 2 == a[i + 1]:
continue
else:
print((0))
sys.exit()
result = 2 ** ((n - 1) // 2)
print((result % (10**9 + 7)))
else:
print((0))
sys.exit()
| def main():
import sys
n = int(eval(input()))
a = list(map(int, input().split(" ")))
if n % 2 == 1:
a.append(0)
a.sort()
for i in range(n - 1):
if i % 2 == 0:
if a[i] == a[i + 1]:
continue
else:
print((0))
sys.exit()
else:
if a[i] + 2 == a[i + 1]:
continue
else:
print((0))
sys.exit()
result = 2 ** (n // 2)
print((result % (10**9 + 7)))
if __name__ == "__main__":
main()
| false | 41.463415 | [
"-import sys",
"+def main():",
"+ import sys",
"-n = int(eval(input()))",
"-a = list(map(int, input().split(\" \")))",
"-a.sort()",
"-if n % 2 == 0:",
"+ n = int(eval(input()))",
"+ a = list(map(int, input().split(\" \")))",
"+ if n % 2 == 1:",
"+ a.append(0)",
"+ a.sort()",
"-else:",
"- if a[0] == 0:",
"- for i in range(1, n - 1):",
"- if i % 2 == 1:",
"- if a[i] == a[i + 1]:",
"- continue",
"- else:",
"- print((0))",
"- sys.exit()",
"- else:",
"- if a[i] + 2 == a[i + 1]:",
"- continue",
"- else:",
"- print((0))",
"- sys.exit()",
"- result = 2 ** ((n - 1) // 2)",
"- print((result % (10**9 + 7)))",
"- else:",
"- print((0))",
"- sys.exit()",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.04116 | 0.040045 | 1.027834 | [
"s904867037",
"s005804371"
]
|
u380524497 | p03222 | python | s382218903 | s855236229 | 328 | 34 | 49,900 | 3,064 | Accepted | Accepted | 89.63 | import itertools
h, w, k = list(map(int, input().split()))
if w == 1:
print((1))
exit()
mod = 10**9 + 7
path = [[i, i+1] for i in range(w-1)]
DP = [[0]*(h+1) for _ in range(w)]
DP[0][0] = 1
for height in range(h):
for pos in range(w):
down_unable = {pos}
left_unable = {pos-1, pos}
right_unable = {pos, pos+1}
down_count = 1
left_count = 1
right_count = 1
for pick in range(1, 1 + w//2):
all_pattern = list(itertools.combinations(path, pick))
for pattern in all_pattern:
check = set()
possible = True
for a, b in pattern:
if check & {a, b}:
possible = False
break
check |= {a, b}
if not possible:
continue
if not check & down_unable:
down_count += 1
if not check & left_unable:
left_count += 1
if not check & right_unable:
right_count += 1
if pos == 0:
DP[pos][height+1] += DP[pos][height] * down_count % mod
DP[pos+1][height+1] += DP[pos][height] * right_count % mod
elif pos == w-1:
DP[pos][height+1] += DP[pos][height] * down_count % mod
DP[pos-1][height+1] += DP[pos][height] * left_count % mod
else:
DP[pos][height+1] += DP[pos][height] * down_count % mod
DP[pos+1][height+1] += DP[pos][height] * right_count % mod
DP[pos-1][height+1] += DP[pos][height] * left_count % mod
print((DP[k-1][h] % mod))
| import itertools
h, w, k = list(map(int, input().split()))
DP = [0] * w
DP[0] = 1
mod = 10**9 + 7
patterns = []
for line_count in range(w):
candidates = itertools.combinations(list(range(w-1)), line_count)
for pattern in candidates:
usable = True
prev = 10
for num in pattern:
if num == prev + 1:
usable = False
break
else:
prev = num
if usable:
patterns.append(pattern)
for i in range(h):
next_DP = [0] * w
for pattern in patterns:
straight = set(range(w))
for line in pattern:
next_DP[line] += DP[line+1]
next_DP[line] %= mod
next_DP[line+1] += DP[line]
next_DP[line+1] % mod
straight.discard(line)
straight.discard(line+1)
for line in straight:
next_DP[line] += DP[line]
next_DP[line] %= mod
DP = next_DP.copy()
ans = DP[k-1]
print((ans%mod)) | 56 | 49 | 1,739 | 1,048 | import itertools
h, w, k = list(map(int, input().split()))
if w == 1:
print((1))
exit()
mod = 10**9 + 7
path = [[i, i + 1] for i in range(w - 1)]
DP = [[0] * (h + 1) for _ in range(w)]
DP[0][0] = 1
for height in range(h):
for pos in range(w):
down_unable = {pos}
left_unable = {pos - 1, pos}
right_unable = {pos, pos + 1}
down_count = 1
left_count = 1
right_count = 1
for pick in range(1, 1 + w // 2):
all_pattern = list(itertools.combinations(path, pick))
for pattern in all_pattern:
check = set()
possible = True
for a, b in pattern:
if check & {a, b}:
possible = False
break
check |= {a, b}
if not possible:
continue
if not check & down_unable:
down_count += 1
if not check & left_unable:
left_count += 1
if not check & right_unable:
right_count += 1
if pos == 0:
DP[pos][height + 1] += DP[pos][height] * down_count % mod
DP[pos + 1][height + 1] += DP[pos][height] * right_count % mod
elif pos == w - 1:
DP[pos][height + 1] += DP[pos][height] * down_count % mod
DP[pos - 1][height + 1] += DP[pos][height] * left_count % mod
else:
DP[pos][height + 1] += DP[pos][height] * down_count % mod
DP[pos + 1][height + 1] += DP[pos][height] * right_count % mod
DP[pos - 1][height + 1] += DP[pos][height] * left_count % mod
print((DP[k - 1][h] % mod))
| import itertools
h, w, k = list(map(int, input().split()))
DP = [0] * w
DP[0] = 1
mod = 10**9 + 7
patterns = []
for line_count in range(w):
candidates = itertools.combinations(list(range(w - 1)), line_count)
for pattern in candidates:
usable = True
prev = 10
for num in pattern:
if num == prev + 1:
usable = False
break
else:
prev = num
if usable:
patterns.append(pattern)
for i in range(h):
next_DP = [0] * w
for pattern in patterns:
straight = set(range(w))
for line in pattern:
next_DP[line] += DP[line + 1]
next_DP[line] %= mod
next_DP[line + 1] += DP[line]
next_DP[line + 1] % mod
straight.discard(line)
straight.discard(line + 1)
for line in straight:
next_DP[line] += DP[line]
next_DP[line] %= mod
DP = next_DP.copy()
ans = DP[k - 1]
print((ans % mod))
| false | 12.5 | [
"-if w == 1:",
"- print((1))",
"- exit()",
"+DP = [0] * w",
"+DP[0] = 1",
"-path = [[i, i + 1] for i in range(w - 1)]",
"-DP = [[0] * (h + 1) for _ in range(w)]",
"-DP[0][0] = 1",
"-for height in range(h):",
"- for pos in range(w):",
"- down_unable = {pos}",
"- left_unable = {pos - 1, pos}",
"- right_unable = {pos, pos + 1}",
"- down_count = 1",
"- left_count = 1",
"- right_count = 1",
"- for pick in range(1, 1 + w // 2):",
"- all_pattern = list(itertools.combinations(path, pick))",
"- for pattern in all_pattern:",
"- check = set()",
"- possible = True",
"- for a, b in pattern:",
"- if check & {a, b}:",
"- possible = False",
"- break",
"- check |= {a, b}",
"- if not possible:",
"- continue",
"- if not check & down_unable:",
"- down_count += 1",
"- if not check & left_unable:",
"- left_count += 1",
"- if not check & right_unable:",
"- right_count += 1",
"- if pos == 0:",
"- DP[pos][height + 1] += DP[pos][height] * down_count % mod",
"- DP[pos + 1][height + 1] += DP[pos][height] * right_count % mod",
"- elif pos == w - 1:",
"- DP[pos][height + 1] += DP[pos][height] * down_count % mod",
"- DP[pos - 1][height + 1] += DP[pos][height] * left_count % mod",
"- else:",
"- DP[pos][height + 1] += DP[pos][height] * down_count % mod",
"- DP[pos + 1][height + 1] += DP[pos][height] * right_count % mod",
"- DP[pos - 1][height + 1] += DP[pos][height] * left_count % mod",
"-print((DP[k - 1][h] % mod))",
"+patterns = []",
"+for line_count in range(w):",
"+ candidates = itertools.combinations(list(range(w - 1)), line_count)",
"+ for pattern in candidates:",
"+ usable = True",
"+ prev = 10",
"+ for num in pattern:",
"+ if num == prev + 1:",
"+ usable = False",
"+ break",
"+ else:",
"+ prev = num",
"+ if usable:",
"+ patterns.append(pattern)",
"+for i in range(h):",
"+ next_DP = [0] * w",
"+ for pattern in patterns:",
"+ straight = set(range(w))",
"+ for line in pattern:",
"+ next_DP[line] += DP[line + 1]",
"+ next_DP[line] %= mod",
"+ next_DP[line + 1] += DP[line]",
"+ next_DP[line + 1] % mod",
"+ straight.discard(line)",
"+ straight.discard(line + 1)",
"+ for line in straight:",
"+ next_DP[line] += DP[line]",
"+ next_DP[line] %= mod",
"+ DP = next_DP.copy()",
"+ans = DP[k - 1]",
"+print((ans % mod))"
]
| false | 0.125885 | 0.086751 | 1.45111 | [
"s382218903",
"s855236229"
]
|
u462329577 | p03635 | python | s621195269 | s760377056 | 171 | 17 | 38,256 | 2,940 | Accepted | Accepted | 90.06 | a,b = list(map(int,input().split()))
print(((a-1)*(b-1)))
| #!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a,b = list(map(int,input().split()))
print(((a-1)*(b-1))) | 2 | 7 | 52 | 194 | a, b = list(map(int, input().split()))
print(((a - 1) * (b - 1)))
| #!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a, b = list(map(int, input().split()))
print(((a - 1) * (b - 1)))
| false | 71.428571 | [
"+#!/usr/bin/env python3",
"+import sys",
"+",
"+read = sys.stdin.buffer.read",
"+readline = sys.stdin.buffer.readline",
"+readlines = sys.stdin.buffer.readlines"
]
| false | 0.038479 | 0.071784 | 0.536036 | [
"s621195269",
"s760377056"
]
|
u260216890 | p02574 | python | s487701573 | s941349029 | 1,692 | 782 | 270,480 | 231,560 | Accepted | Accepted | 53.78 | n = int(eval(input()))
*a,=list(map(int, input().split()))
mapa=[0]*(10**6+1)
from bisect import bisect_left
n0 = 10**6
primes = set(range(2, n0+1))
for i in range(2, int(n0**0.5+1)):
primes.difference_update(list(range(i*2, n0+1, i)))
primeind=[0]*(10**6+1)
for p in primes:
primeind[p]=1
def isPrime(m):
return primeind[m]==1
def func(m):
for i in range(2,int(m**0.5)+1):
if isPrime(m):
break
if m%i==0:
mapa[i]+=1
while m%i==0:
m//=i
if m<i:
break
if m>1:
mapa[m]+=1
for ai in a:
func(ai)
tmp=max(mapa)
#print(mapa[:20])
if tmp==n:
print('not coprime')
elif tmp>1:
print('setwise coprime')
else:
print('pairwise coprime') | n = int(eval(input()))
*a,=list(map(int, input().split()))
mapa=[0]*(10**6+1)
n0 = 10**6
primes = [0]*(n0+1)
for i in range(2, n0+1):
if primes[i]==0:
x=i
multi=1
while x<=n0:
if primes[x]==0:
primes[x]=i
x//=multi
multi+=1
x*=multi
def func(m):
while m>1:
mapa[primes[m]]+=1
pm=primes[m]
while m>1 and m%pm==0:
m//=pm
for ai in a:
func(ai)
tmp=max(mapa)
if tmp==n:
print('not coprime')
elif tmp>1:
print('setwise coprime')
else:
print('pairwise coprime') | 41 | 35 | 776 | 630 | n = int(eval(input()))
(*a,) = list(map(int, input().split()))
mapa = [0] * (10**6 + 1)
from bisect import bisect_left
n0 = 10**6
primes = set(range(2, n0 + 1))
for i in range(2, int(n0**0.5 + 1)):
primes.difference_update(list(range(i * 2, n0 + 1, i)))
primeind = [0] * (10**6 + 1)
for p in primes:
primeind[p] = 1
def isPrime(m):
return primeind[m] == 1
def func(m):
for i in range(2, int(m**0.5) + 1):
if isPrime(m):
break
if m % i == 0:
mapa[i] += 1
while m % i == 0:
m //= i
if m < i:
break
if m > 1:
mapa[m] += 1
for ai in a:
func(ai)
tmp = max(mapa)
# print(mapa[:20])
if tmp == n:
print("not coprime")
elif tmp > 1:
print("setwise coprime")
else:
print("pairwise coprime")
| n = int(eval(input()))
(*a,) = list(map(int, input().split()))
mapa = [0] * (10**6 + 1)
n0 = 10**6
primes = [0] * (n0 + 1)
for i in range(2, n0 + 1):
if primes[i] == 0:
x = i
multi = 1
while x <= n0:
if primes[x] == 0:
primes[x] = i
x //= multi
multi += 1
x *= multi
def func(m):
while m > 1:
mapa[primes[m]] += 1
pm = primes[m]
while m > 1 and m % pm == 0:
m //= pm
for ai in a:
func(ai)
tmp = max(mapa)
if tmp == n:
print("not coprime")
elif tmp > 1:
print("setwise coprime")
else:
print("pairwise coprime")
| false | 14.634146 | [
"-from bisect import bisect_left",
"-",
"-primes = set(range(2, n0 + 1))",
"-for i in range(2, int(n0**0.5 + 1)):",
"- primes.difference_update(list(range(i * 2, n0 + 1, i)))",
"-primeind = [0] * (10**6 + 1)",
"-for p in primes:",
"- primeind[p] = 1",
"-",
"-",
"-def isPrime(m):",
"- return primeind[m] == 1",
"+primes = [0] * (n0 + 1)",
"+for i in range(2, n0 + 1):",
"+ if primes[i] == 0:",
"+ x = i",
"+ multi = 1",
"+ while x <= n0:",
"+ if primes[x] == 0:",
"+ primes[x] = i",
"+ x //= multi",
"+ multi += 1",
"+ x *= multi",
"- for i in range(2, int(m**0.5) + 1):",
"- if isPrime(m):",
"- break",
"- if m % i == 0:",
"- mapa[i] += 1",
"- while m % i == 0:",
"- m //= i",
"- if m < i:",
"- break",
"- if m > 1:",
"- mapa[m] += 1",
"+ while m > 1:",
"+ mapa[primes[m]] += 1",
"+ pm = primes[m]",
"+ while m > 1 and m % pm == 0:",
"+ m //= pm",
"-# print(mapa[:20])"
]
| false | 2.696457 | 1.41406 | 1.90689 | [
"s487701573",
"s941349029"
]
|
u215329188 | p03855 | python | s540037750 | s926373208 | 1,515 | 1,282 | 63,636 | 66,712 | Accepted | Accepted | 15.38 | import sys
sys.setrecursionlimit(10000)
N,K,L = list(map(int, input().split()))
#print(N,K,L,D,T)
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
#self.rank = [0] * (n+1)
# 検索
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
# 併合
def union(self, x, y):
x = self.find(x)
y = self.find(y)
#if self.rank[x] < self.rank[y]:
# self.par[x] = y
#else:
# self.par[y] = x
# if self.rank[x] == self.rank[y]:
# self.rank[x] += 1
self.par[x] = y
# 同じ集合に属するか判定
#def same_check(self, x, y):
# return self.find(x) == self.find(y)
def execOne(num, uf):
for _ in range(num):
d0, d1 = list(map(int, input().split()))
d0 = d0 - 1
d1 = d1 - 1
uf.union(d0, d1)
uf_D = UnionFind(N)
uf_T = UnionFind(N)
execOne(K, uf_D)
execOne(L, uf_T)
pairs = []
for i in range(N):
pairs.append((uf_D.find(i), uf_T.find(i)))
pairs_count = {}
for p in pairs:
if not p in pairs_count:
pairs_count[p] = 1
else:
pairs_count[p] += 1
res = [0] * N
for i in range(N):
res[i] = pairs_count[pairs[i]]
#print(*(res[i] for i in range(N)))
print((" ".join([str(i) for i in res]))) | import sys
sys.setrecursionlimit(10000)
N,K,L = list(map(int, input().split()))
#print(N,K,L,D,T)
class UnionFind:
def __init__(self, n: int) -> None:
self.par = [i for i in range(n)]
self.rank = [0] * n
def find(self, x: int) -> int:
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def unite(self, x: int, y: int) -> None:
x = self.find(x)
y = self.find(y)
if self.rank[x] < self.rank[y]:
self.par[x] = y
else:
self.par[y] = x
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
# 同じ集合に属するか判定
#def same_check(self, x, y):
# return self.find(x) == self.find(y)
def uniteOne(num, uf):
for _ in range(num):
d0, d1 = list(map(int, input().split()))
d0 = d0 - 1
d1 = d1 - 1
uf.unite(d0, d1)
uf_D = UnionFind(N)
uf_T = UnionFind(N)
uniteOne(K, uf_D)
uniteOne(L, uf_T)
pairs = []
for i in range(N):
pairs.append((uf_D.find(i), uf_T.find(i)))
pairs_count = {}
for p in pairs:
if not p in pairs_count:
pairs_count[p] = 1
else:
pairs_count[p] += 1
res = [0] * N
for i in range(N):
res[i] = pairs_count[pairs[i]]
#print(*(res[i] for i in range(N)))
print((" ".join([str(i) for i in res]))) | 67 | 64 | 1,453 | 1,441 | import sys
sys.setrecursionlimit(10000)
N, K, L = list(map(int, input().split()))
# print(N,K,L,D,T)
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n + 1)]
# self.rank = [0] * (n+1)
# 検索
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
# 併合
def union(self, x, y):
x = self.find(x)
y = self.find(y)
# if self.rank[x] < self.rank[y]:
# self.par[x] = y
# else:
# self.par[y] = x
# if self.rank[x] == self.rank[y]:
# self.rank[x] += 1
self.par[x] = y
# 同じ集合に属するか判定
# def same_check(self, x, y):
# return self.find(x) == self.find(y)
def execOne(num, uf):
for _ in range(num):
d0, d1 = list(map(int, input().split()))
d0 = d0 - 1
d1 = d1 - 1
uf.union(d0, d1)
uf_D = UnionFind(N)
uf_T = UnionFind(N)
execOne(K, uf_D)
execOne(L, uf_T)
pairs = []
for i in range(N):
pairs.append((uf_D.find(i), uf_T.find(i)))
pairs_count = {}
for p in pairs:
if not p in pairs_count:
pairs_count[p] = 1
else:
pairs_count[p] += 1
res = [0] * N
for i in range(N):
res[i] = pairs_count[pairs[i]]
# print(*(res[i] for i in range(N)))
print((" ".join([str(i) for i in res])))
| import sys
sys.setrecursionlimit(10000)
N, K, L = list(map(int, input().split()))
# print(N,K,L,D,T)
class UnionFind:
def __init__(self, n: int) -> None:
self.par = [i for i in range(n)]
self.rank = [0] * n
def find(self, x: int) -> int:
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def unite(self, x: int, y: int) -> None:
x = self.find(x)
y = self.find(y)
if self.rank[x] < self.rank[y]:
self.par[x] = y
else:
self.par[y] = x
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
# 同じ集合に属するか判定
# def same_check(self, x, y):
# return self.find(x) == self.find(y)
def uniteOne(num, uf):
for _ in range(num):
d0, d1 = list(map(int, input().split()))
d0 = d0 - 1
d1 = d1 - 1
uf.unite(d0, d1)
uf_D = UnionFind(N)
uf_T = UnionFind(N)
uniteOne(K, uf_D)
uniteOne(L, uf_T)
pairs = []
for i in range(N):
pairs.append((uf_D.find(i), uf_T.find(i)))
pairs_count = {}
for p in pairs:
if not p in pairs_count:
pairs_count[p] = 1
else:
pairs_count[p] += 1
res = [0] * N
for i in range(N):
res[i] = pairs_count[pairs[i]]
# print(*(res[i] for i in range(N)))
print((" ".join([str(i) for i in res])))
| false | 4.477612 | [
"- def __init__(self, n):",
"- self.par = [i for i in range(n + 1)]",
"- # self.rank = [0] * (n+1)",
"+ def __init__(self, n: int) -> None:",
"+ self.par = [i for i in range(n)]",
"+ self.rank = [0] * n",
"- # 検索",
"- def find(self, x):",
"+ def find(self, x: int) -> int:",
"- # 併合",
"- def union(self, x, y):",
"+ def unite(self, x: int, y: int) -> None:",
"- # if self.rank[x] < self.rank[y]:",
"- # self.par[x] = y",
"- # else:",
"- # self.par[y] = x",
"- # if self.rank[x] == self.rank[y]:",
"- # self.rank[x] += 1",
"- self.par[x] = y",
"+ if self.rank[x] < self.rank[y]:",
"+ self.par[x] = y",
"+ else:",
"+ self.par[y] = x",
"+ if self.rank[x] == self.rank[y]:",
"+ self.rank[x] += 1",
"-def execOne(num, uf):",
"+def uniteOne(num, uf):",
"- uf.union(d0, d1)",
"+ uf.unite(d0, d1)",
"-execOne(K, uf_D)",
"-execOne(L, uf_T)",
"+uniteOne(K, uf_D)",
"+uniteOne(L, uf_T)"
]
| false | 0.041199 | 0.041614 | 0.990028 | [
"s540037750",
"s926373208"
]
|
u746428948 | p02693 | python | s537030175 | s095488752 | 23 | 20 | 9,172 | 9,176 | Accepted | Accepted | 13.04 | k = int(eval(input()))
a,b = list(map(int,input().split()))
ok = False
for i in range(a,b+1):
if i % k == 0: ok = True
if ok == 0: print("NG")
else : print("OK") | k = int(eval(input()))
a,b = list(map(int,input().split()))
r = (b // k) * k
if a <= r: print('OK')
else: print('NG') | 7 | 5 | 159 | 109 | k = int(eval(input()))
a, b = list(map(int, input().split()))
ok = False
for i in range(a, b + 1):
if i % k == 0:
ok = True
if ok == 0:
print("NG")
else:
print("OK")
| k = int(eval(input()))
a, b = list(map(int, input().split()))
r = (b // k) * k
if a <= r:
print("OK")
else:
print("NG")
| false | 28.571429 | [
"-ok = False",
"-for i in range(a, b + 1):",
"- if i % k == 0:",
"- ok = True",
"-if ok == 0:",
"+r = (b // k) * k",
"+if a <= r:",
"+ print(\"OK\")",
"+else:",
"-else:",
"- print(\"OK\")"
]
| false | 0.037082 | 0.038204 | 0.970641 | [
"s537030175",
"s095488752"
]
|
u048238198 | p03853 | python | s071946019 | s282038265 | 42 | 17 | 4,596 | 3,060 | Accepted | Accepted | 59.52 | h,w = map(int,input().split())
m = list(list(input()) for i in range(h))
portrait = []
for i in range(2*h):
for j in range(w):
print(m[int(i/2)][j], end='')
print()
| h,w = list(map(int,input().split()))
for i in range(h):
s = eval(input())
print((s + "\n" + s + "\n"))
| 9 | 5 | 191 | 103 | h, w = map(int, input().split())
m = list(list(input()) for i in range(h))
portrait = []
for i in range(2 * h):
for j in range(w):
print(m[int(i / 2)][j], end="")
print()
| h, w = list(map(int, input().split()))
for i in range(h):
s = eval(input())
print((s + "\n" + s + "\n"))
| false | 44.444444 | [
"-h, w = map(int, input().split())",
"-m = list(list(input()) for i in range(h))",
"-portrait = []",
"-for i in range(2 * h):",
"- for j in range(w):",
"- print(m[int(i / 2)][j], end=\"\")",
"- print()",
"+h, w = list(map(int, input().split()))",
"+for i in range(h):",
"+ s = eval(input())",
"+ print((s + \"\\n\" + s + \"\\n\"))"
]
| false | 0.091854 | 0.037364 | 2.458374 | [
"s071946019",
"s282038265"
]
|
u261696185 | p02657 | python | s022212947 | s139604318 | 30 | 27 | 9,136 | 9,112 | Accepted | Accepted | 10 | # 169A
# A × B を整数として出力せよ
# 1.入力をプログラムで扱えるように受け取ること
a, b = list(map(int, input().split()))
# print(a, b)
# 2.受け取った入力値を使って、適切に処理(計算)すること
answer = a * b;
# 3.計算した結果を出力すること
print(answer) | a, b = list(map(int, input().split()))
print((a * b)) | 12 | 3 | 191 | 48 | # 169A
# A × B を整数として出力せよ
# 1.入力をプログラムで扱えるように受け取ること
a, b = list(map(int, input().split()))
# print(a, b)
# 2.受け取った入力値を使って、適切に処理(計算)すること
answer = a * b
# 3.計算した結果を出力すること
print(answer)
| a, b = list(map(int, input().split()))
print((a * b))
| false | 75 | [
"-# 169A",
"-# A × B を整数として出力せよ",
"-# 1.入力をプログラムで扱えるように受け取ること",
"-# print(a, b)",
"-# 2.受け取った入力値を使って、適切に処理(計算)すること",
"-answer = a * b",
"-# 3.計算した結果を出力すること",
"-print(answer)",
"+print((a * b))"
]
| false | 0.007194 | 0.038091 | 0.188858 | [
"s022212947",
"s139604318"
]
|
u368249389 | p02954 | python | s481194826 | s297452390 | 427 | 346 | 62,172 | 61,276 | Accepted | Accepted | 18.97 | # Porblem D - Gathering Children
import re
# input process
S = input()
# initialization
ans_list = []
in_list = re.findall(r"R+L+", S)
# ["RRL", "RL"]
# part of list process
for p in in_list:
p_r = re.findall(r"R+", p)[0]
p_l = re.findall(r"L+", p)[0]
l_count = 0
r_count = 0
# R to L process
for i in range(1, len(p_r)+1):
if i%2==0:
l_count = l_count + 1
else:
r_count = r_count + 1
# L to R process
for i in range(1, len(p_l)+1):
if i%2==0:
r_count = r_count + 1
else:
l_count = l_count + 1
# output prcess R
for i in range(len(p_r)-1):
ans_list.append(0)
ans_list.append(r_count)
# output process L
ans_list.append(l_count)
for i in range(len(p_l)-1):
ans_list.append(0)
# output process
for a in ans_list:
print(a, end=" ")
| # Problem D - Gathering Children
import re
# input
S = eval(input())
# initialization
rl_list = re.findall(r'R+L+', S)
ans_list = []
# count
for rl in rl_list:
right_count = 0
left_count = 0
right = re.findall(r'R+', rl)[0]
left = re.findall(r'L+', rl)[0]
# right count
for i in range(1, len(right)+1):
if i%2==0:
left_count += 1
else:
right_count += 1
# left count
for i in range(1, len(left)+1):
if i%2==0:
right_count += 1
else:
left_count += 1
# answer decision
for i in range(len(right)-1):
ans_list.append(0)
ans_list.append(right_count)
ans_list.append(left_count)
for i in range(len(left)-1):
ans_list.append(0)
# output
ans_list = list(map(str, ans_list))
print((" ".join(ans_list)))
| 45 | 44 | 937 | 885 | # Porblem D - Gathering Children
import re
# input process
S = input()
# initialization
ans_list = []
in_list = re.findall(r"R+L+", S)
# ["RRL", "RL"]
# part of list process
for p in in_list:
p_r = re.findall(r"R+", p)[0]
p_l = re.findall(r"L+", p)[0]
l_count = 0
r_count = 0
# R to L process
for i in range(1, len(p_r) + 1):
if i % 2 == 0:
l_count = l_count + 1
else:
r_count = r_count + 1
# L to R process
for i in range(1, len(p_l) + 1):
if i % 2 == 0:
r_count = r_count + 1
else:
l_count = l_count + 1
# output prcess R
for i in range(len(p_r) - 1):
ans_list.append(0)
ans_list.append(r_count)
# output process L
ans_list.append(l_count)
for i in range(len(p_l) - 1):
ans_list.append(0)
# output process
for a in ans_list:
print(a, end=" ")
| # Problem D - Gathering Children
import re
# input
S = eval(input())
# initialization
rl_list = re.findall(r"R+L+", S)
ans_list = []
# count
for rl in rl_list:
right_count = 0
left_count = 0
right = re.findall(r"R+", rl)[0]
left = re.findall(r"L+", rl)[0]
# right count
for i in range(1, len(right) + 1):
if i % 2 == 0:
left_count += 1
else:
right_count += 1
# left count
for i in range(1, len(left) + 1):
if i % 2 == 0:
right_count += 1
else:
left_count += 1
# answer decision
for i in range(len(right) - 1):
ans_list.append(0)
ans_list.append(right_count)
ans_list.append(left_count)
for i in range(len(left) - 1):
ans_list.append(0)
# output
ans_list = list(map(str, ans_list))
print((" ".join(ans_list)))
| false | 2.222222 | [
"-# Porblem D - Gathering Children",
"+# Problem D - Gathering Children",
"-# input process",
"-S = input()",
"+# input",
"+S = eval(input())",
"+rl_list = re.findall(r\"R+L+\", S)",
"-in_list = re.findall(r\"R+L+\", S)",
"-# [\"RRL\", \"RL\"]",
"-# part of list process",
"-for p in in_list:",
"- p_r = re.findall(r\"R+\", p)[0]",
"- p_l = re.findall(r\"L+\", p)[0]",
"- l_count = 0",
"- r_count = 0",
"- # R to L process",
"- for i in range(1, len(p_r) + 1):",
"+# count",
"+for rl in rl_list:",
"+ right_count = 0",
"+ left_count = 0",
"+ right = re.findall(r\"R+\", rl)[0]",
"+ left = re.findall(r\"L+\", rl)[0]",
"+ # right count",
"+ for i in range(1, len(right) + 1):",
"- l_count = l_count + 1",
"+ left_count += 1",
"- r_count = r_count + 1",
"- # L to R process",
"- for i in range(1, len(p_l) + 1):",
"+ right_count += 1",
"+ # left count",
"+ for i in range(1, len(left) + 1):",
"- r_count = r_count + 1",
"+ right_count += 1",
"- l_count = l_count + 1",
"- # output prcess R",
"- for i in range(len(p_r) - 1):",
"+ left_count += 1",
"+ # answer decision",
"+ for i in range(len(right) - 1):",
"- ans_list.append(r_count)",
"- # output process L",
"- ans_list.append(l_count)",
"- for i in range(len(p_l) - 1):",
"+ ans_list.append(right_count)",
"+ ans_list.append(left_count)",
"+ for i in range(len(left) - 1):",
"-# output process",
"-for a in ans_list:",
"- print(a, end=\" \")",
"+# output",
"+ans_list = list(map(str, ans_list))",
"+print((\" \".join(ans_list)))"
]
| false | 0.041417 | 0.041047 | 1.009002 | [
"s481194826",
"s297452390"
]
|
u098012509 | p02898 | python | s263169249 | s536804646 | 59 | 52 | 18,528 | 16,476 | Accepted | Accepted | 11.86 | N, K = [int(x) for x in input().split()]
H = [int(x) for x in input().split()]
ans = 0
for h in H:
if h >= K:
ans += 1
print(ans)
| A, K = [int(x) for x in input().split()]
print((sum(int(x) >= K for x in input().split())))
| 9 | 3 | 152 | 93 | N, K = [int(x) for x in input().split()]
H = [int(x) for x in input().split()]
ans = 0
for h in H:
if h >= K:
ans += 1
print(ans)
| A, K = [int(x) for x in input().split()]
print((sum(int(x) >= K for x in input().split())))
| false | 66.666667 | [
"-N, K = [int(x) for x in input().split()]",
"-H = [int(x) for x in input().split()]",
"-ans = 0",
"-for h in H:",
"- if h >= K:",
"- ans += 1",
"-print(ans)",
"+A, K = [int(x) for x in input().split()]",
"+print((sum(int(x) >= K for x in input().split())))"
]
| false | 0.036871 | 0.035125 | 1.049717 | [
"s263169249",
"s536804646"
]
|
u657913472 | p03177 | python | s224338051 | s708509016 | 1,488 | 561 | 16,136 | 10,672 | Accepted | Accepted | 62.3 | from numpy import*
M=10**9+7
m=lambda*z:list(map(int,input().split()))
n,k=m()
b=eye(n,n,0,'O')
a=matrix(list(map(m,b)),'O')
while k:b=[b,b*a][k&1];a=a*a%M;k/=2
print(sum(b)%M) | from numpy import*
M=10**9+7
m=lambda*z:list(map(int,input().split()))
n,k=m()
b=[1]*n
a=matrix(list(map(m,b)),'O')
while k:b*=[1,a][k&1];a=a*a%M;k/=2
print(sum(b)%M) | 8 | 8 | 174 | 164 | from numpy import *
M = 10**9 + 7
m = lambda *z: list(map(int, input().split()))
n, k = m()
b = eye(n, n, 0, "O")
a = matrix(list(map(m, b)), "O")
while k:
b = [b, b * a][k & 1]
a = a * a % M
k /= 2
print(sum(b) % M)
| from numpy import *
M = 10**9 + 7
m = lambda *z: list(map(int, input().split()))
n, k = m()
b = [1] * n
a = matrix(list(map(m, b)), "O")
while k:
b *= [1, a][k & 1]
a = a * a % M
k /= 2
print(sum(b) % M)
| false | 0 | [
"-b = eye(n, n, 0, \"O\")",
"+b = [1] * n",
"- b = [b, b * a][k & 1]",
"+ b *= [1, a][k & 1]"
]
| false | 0.171562 | 0.171559 | 1.000015 | [
"s224338051",
"s708509016"
]
|
u604774382 | p02264 | python | s464677842 | s910817329 | 2,220 | 1,330 | 13,216 | 16,132 | Accepted | Accepted | 40.09 | from queue import Queue
n, q = [ int( val ) for val in input( ).split( " " ) ]
names = Queue( )
times = Queue( )
for i in range( n ):
name, time = input( ).split( " " )
names.put( name )
times.put( int( time ) )
qsum = 0
output = []
while not times.empty( ):
name = names.get( )
time = times.get( )
if time <= q:
qsum += time
output.append( "{:s} {:d}".format( name, qsum ) )
else:
times.put( time - q )
names.put( name )
qsum += q
print(( "\n".join( output ) )) | from queue import Queue
n, q = [ int( val ) for val in input( ).split( " " ) ]
processes = Queue( )
for i in range( n ):
name, time = input( ).split( " " )
processes.put( ( name, int( time ) ) )
qsum = 0
output = []
while not processes.empty( ):
process = processes.get( )
if process[1] <= q:
qsum += process[1]
output.append( "{:s} {:d}".format( process[0], qsum ) )
else:
processes.put( ( process[0], process[1]- q ) )
qsum += q
print(( "\n".join( output ) )) | 24 | 20 | 512 | 545 | from queue import Queue
n, q = [int(val) for val in input().split(" ")]
names = Queue()
times = Queue()
for i in range(n):
name, time = input().split(" ")
names.put(name)
times.put(int(time))
qsum = 0
output = []
while not times.empty():
name = names.get()
time = times.get()
if time <= q:
qsum += time
output.append("{:s} {:d}".format(name, qsum))
else:
times.put(time - q)
names.put(name)
qsum += q
print(("\n".join(output)))
| from queue import Queue
n, q = [int(val) for val in input().split(" ")]
processes = Queue()
for i in range(n):
name, time = input().split(" ")
processes.put((name, int(time)))
qsum = 0
output = []
while not processes.empty():
process = processes.get()
if process[1] <= q:
qsum += process[1]
output.append("{:s} {:d}".format(process[0], qsum))
else:
processes.put((process[0], process[1] - q))
qsum += q
print(("\n".join(output)))
| false | 16.666667 | [
"-names = Queue()",
"-times = Queue()",
"+processes = Queue()",
"- names.put(name)",
"- times.put(int(time))",
"+ processes.put((name, int(time)))",
"-while not times.empty():",
"- name = names.get()",
"- time = times.get()",
"- if time <= q:",
"- qsum += time",
"- output.append(\"{:s} {:d}\".format(name, qsum))",
"+while not processes.empty():",
"+ process = processes.get()",
"+ if process[1] <= q:",
"+ qsum += process[1]",
"+ output.append(\"{:s} {:d}\".format(process[0], qsum))",
"- times.put(time - q)",
"- names.put(name)",
"+ processes.put((process[0], process[1] - q))"
]
| false | 0.049706 | 0.049138 | 1.011552 | [
"s464677842",
"s910817329"
]
|
u047796752 | p03229 | python | s645350344 | s586536508 | 529 | 119 | 53,568 | 83,024 | Accepted | Accepted | 77.5 | def calc(A):
res = 0
for i in range(N-1):
res += abs(A[i+1]-A[i])
return res
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
A.sort()
if N%2==0:
l1 = A[:N//2]
l2 = A[N//2:]
l1.reverse()
l2.reverse()
B = [-1]*N
for i in range(N):
if i%2==0:
B[i] = l1[i//2]
else:
B[i] = l2[i//2]
ans = calc(B)
print(ans)
else:
l1 = A[:N//2]
l2 = A[N//2:]
B = [-1]*N
B[0] = l2[0]
B[-1] = l2[1]
for i in range(1, N-1):
if i%2==0:
B[i] = l2[i//2+1]
else:
B[i] = l1[i//2]
l1 = A[:N//2+1]
l2 = A[N//2+1:]
C = [-1]*N
C[0] = l1[-1]
C[-1] = l1[-2]
for i in range(1, N-1):
if i%2==0:
C[i] = l1[i//2-1]
else:
C[i] = l2[i//2]
ans = max(calc(B), calc(C))
print(ans) | import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
coef1, coef2 = [], []
for i in range(N):
p = 1 if i in [0, N-1] else 2
coef1.append(p*(1 if i%2==0 else -1))
coef2.append(p*(-1 if i%2==0 else 1))
A.sort()
coef1.sort()
coef2.sort()
ans = max(sum(Ai*p for Ai, p in zip(A, coef1)), sum(Ai*p for Ai, p in zip(A, coef2)))
print(ans) | 54 | 17 | 971 | 401 | def calc(A):
res = 0
for i in range(N - 1):
res += abs(A[i + 1] - A[i])
return res
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
A.sort()
if N % 2 == 0:
l1 = A[: N // 2]
l2 = A[N // 2 :]
l1.reverse()
l2.reverse()
B = [-1] * N
for i in range(N):
if i % 2 == 0:
B[i] = l1[i // 2]
else:
B[i] = l2[i // 2]
ans = calc(B)
print(ans)
else:
l1 = A[: N // 2]
l2 = A[N // 2 :]
B = [-1] * N
B[0] = l2[0]
B[-1] = l2[1]
for i in range(1, N - 1):
if i % 2 == 0:
B[i] = l2[i // 2 + 1]
else:
B[i] = l1[i // 2]
l1 = A[: N // 2 + 1]
l2 = A[N // 2 + 1 :]
C = [-1] * N
C[0] = l1[-1]
C[-1] = l1[-2]
for i in range(1, N - 1):
if i % 2 == 0:
C[i] = l1[i // 2 - 1]
else:
C[i] = l2[i // 2]
ans = max(calc(B), calc(C))
print(ans)
| import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
coef1, coef2 = [], []
for i in range(N):
p = 1 if i in [0, N - 1] else 2
coef1.append(p * (1 if i % 2 == 0 else -1))
coef2.append(p * (-1 if i % 2 == 0 else 1))
A.sort()
coef1.sort()
coef2.sort()
ans = max(
sum(Ai * p for Ai, p in zip(A, coef1)), sum(Ai * p for Ai, p in zip(A, coef2))
)
print(ans)
| false | 68.518519 | [
"-def calc(A):",
"- res = 0",
"- for i in range(N - 1):",
"- res += abs(A[i + 1] - A[i])",
"- return res",
"+import sys",
"-",
"+input = sys.stdin.readline",
"+coef1, coef2 = [], []",
"+for i in range(N):",
"+ p = 1 if i in [0, N - 1] else 2",
"+ coef1.append(p * (1 if i % 2 == 0 else -1))",
"+ coef2.append(p * (-1 if i % 2 == 0 else 1))",
"-if N % 2 == 0:",
"- l1 = A[: N // 2]",
"- l2 = A[N // 2 :]",
"- l1.reverse()",
"- l2.reverse()",
"- B = [-1] * N",
"- for i in range(N):",
"- if i % 2 == 0:",
"- B[i] = l1[i // 2]",
"- else:",
"- B[i] = l2[i // 2]",
"- ans = calc(B)",
"- print(ans)",
"-else:",
"- l1 = A[: N // 2]",
"- l2 = A[N // 2 :]",
"- B = [-1] * N",
"- B[0] = l2[0]",
"- B[-1] = l2[1]",
"- for i in range(1, N - 1):",
"- if i % 2 == 0:",
"- B[i] = l2[i // 2 + 1]",
"- else:",
"- B[i] = l1[i // 2]",
"- l1 = A[: N // 2 + 1]",
"- l2 = A[N // 2 + 1 :]",
"- C = [-1] * N",
"- C[0] = l1[-1]",
"- C[-1] = l1[-2]",
"- for i in range(1, N - 1):",
"- if i % 2 == 0:",
"- C[i] = l1[i // 2 - 1]",
"- else:",
"- C[i] = l2[i // 2]",
"- ans = max(calc(B), calc(C))",
"- print(ans)",
"+coef1.sort()",
"+coef2.sort()",
"+ans = max(",
"+ sum(Ai * p for Ai, p in zip(A, coef1)), sum(Ai * p for Ai, p in zip(A, coef2))",
"+)",
"+print(ans)"
]
| false | 0.035413 | 0.034945 | 1.013399 | [
"s645350344",
"s586536508"
]
|
u057109575 | p02775 | python | s889452028 | s406857433 | 585 | 265 | 150,452 | 189,924 | Accepted | Accepted | 54.7 | N = [int(n) for n in eval(input())]
dp = [[0] * 2 for _ in range(len(N) + 1)]
dp[0][1] = 1
for i, n in enumerate(N):
dp[i + 1][0] = min(dp[i][0] + n, dp[i][1] + (10 - n))
dp[i + 1][1] = min(dp[i][0] + (n + 1), dp[i][1] + (10 - (n + 1)))
print((dp[-1][0]))
|
N = eval(input())
dp = [[0] * 2 for _ in range(len(N) + 1)]
dp[0][1] = 1
for i in range(len(N)):
n = int(N[i])
dp[i + 1][0] = min(dp[i][0] + n, dp[i][1] + 10 - n)
dp[i + 1][1] = min(dp[i][0] + n + 1, dp[i][1] + 10 - (n + 1))
print((dp[-1][0]))
| 10 | 11 | 272 | 261 | N = [int(n) for n in eval(input())]
dp = [[0] * 2 for _ in range(len(N) + 1)]
dp[0][1] = 1
for i, n in enumerate(N):
dp[i + 1][0] = min(dp[i][0] + n, dp[i][1] + (10 - n))
dp[i + 1][1] = min(dp[i][0] + (n + 1), dp[i][1] + (10 - (n + 1)))
print((dp[-1][0]))
| N = eval(input())
dp = [[0] * 2 for _ in range(len(N) + 1)]
dp[0][1] = 1
for i in range(len(N)):
n = int(N[i])
dp[i + 1][0] = min(dp[i][0] + n, dp[i][1] + 10 - n)
dp[i + 1][1] = min(dp[i][0] + n + 1, dp[i][1] + 10 - (n + 1))
print((dp[-1][0]))
| false | 9.090909 | [
"-N = [int(n) for n in eval(input())]",
"+N = eval(input())",
"-for i, n in enumerate(N):",
"- dp[i + 1][0] = min(dp[i][0] + n, dp[i][1] + (10 - n))",
"- dp[i + 1][1] = min(dp[i][0] + (n + 1), dp[i][1] + (10 - (n + 1)))",
"+for i in range(len(N)):",
"+ n = int(N[i])",
"+ dp[i + 1][0] = min(dp[i][0] + n, dp[i][1] + 10 - n)",
"+ dp[i + 1][1] = min(dp[i][0] + n + 1, dp[i][1] + 10 - (n + 1))"
]
| false | 0.036036 | 0.085001 | 0.423954 | [
"s889452028",
"s406857433"
]
|
u883621917 | p02695 | python | s480807211 | s402723287 | 1,244 | 312 | 68,212 | 79,940 | Accepted | Accepted | 74.92 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m, q = list(map(int, input().split()))
pairs = [0] * q
for i in range(q):
pairs[i] = list(map(int, input().split()))
from collections import deque
def dfs(min_val, length):
if length == 0:
return list([deque()])
if min_val == m:
return list([deque([m]) * length])
ans = list()
for i in range(min_val, m+1):
remain = dfs(i, length-1)
for j in remain:
j.appendleft(i)
ans.extend(remain)
return ans
ans = 0
for i in dfs(1, n):
tmp = 0
for a, b, c, d in pairs:
if (i[b-1] - i[a-1]) == c:
tmp += d
ans = max(ans, tmp)
print(ans)
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m, q = list(map(int, input().split()))
abcd = [0] * q
for i in range(q):
abcd[i] = list(map(int, input().split()))
def dfs(seq):
if len(seq) == n:
yield tuple(seq)
return
if len(seq) == 0:
start = 1
else:
start = seq[-1]
for i in range(start, m+1):
new_seq = seq.copy()
new_seq.append(i)
yield from dfs(new_seq)
ans = 0
for s in dfs([]):
tmp_ans = 0
for a, b, c, d in abcd:
if s[b-1] - s[a-1] == c:
tmp_ans += d
ans = max(ans, tmp_ans)
print(ans)
| 33 | 30 | 735 | 653 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n, m, q = list(map(int, input().split()))
pairs = [0] * q
for i in range(q):
pairs[i] = list(map(int, input().split()))
from collections import deque
def dfs(min_val, length):
if length == 0:
return list([deque()])
if min_val == m:
return list([deque([m]) * length])
ans = list()
for i in range(min_val, m + 1):
remain = dfs(i, length - 1)
for j in remain:
j.appendleft(i)
ans.extend(remain)
return ans
ans = 0
for i in dfs(1, n):
tmp = 0
for a, b, c, d in pairs:
if (i[b - 1] - i[a - 1]) == c:
tmp += d
ans = max(ans, tmp)
print(ans)
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n, m, q = list(map(int, input().split()))
abcd = [0] * q
for i in range(q):
abcd[i] = list(map(int, input().split()))
def dfs(seq):
if len(seq) == n:
yield tuple(seq)
return
if len(seq) == 0:
start = 1
else:
start = seq[-1]
for i in range(start, m + 1):
new_seq = seq.copy()
new_seq.append(i)
yield from dfs(new_seq)
ans = 0
for s in dfs([]):
tmp_ans = 0
for a, b, c, d in abcd:
if s[b - 1] - s[a - 1] == c:
tmp_ans += d
ans = max(ans, tmp_ans)
print(ans)
| false | 9.090909 | [
"-pairs = [0] * q",
"+abcd = [0] * q",
"- pairs[i] = list(map(int, input().split()))",
"-from collections import deque",
"+ abcd[i] = list(map(int, input().split()))",
"-def dfs(min_val, length):",
"- if length == 0:",
"- return list([deque()])",
"- if min_val == m:",
"- return list([deque([m]) * length])",
"- ans = list()",
"- for i in range(min_val, m + 1):",
"- remain = dfs(i, length - 1)",
"- for j in remain:",
"- j.appendleft(i)",
"- ans.extend(remain)",
"- return ans",
"+def dfs(seq):",
"+ if len(seq) == n:",
"+ yield tuple(seq)",
"+ return",
"+ if len(seq) == 0:",
"+ start = 1",
"+ else:",
"+ start = seq[-1]",
"+ for i in range(start, m + 1):",
"+ new_seq = seq.copy()",
"+ new_seq.append(i)",
"+ yield from dfs(new_seq)",
"-for i in dfs(1, n):",
"- tmp = 0",
"- for a, b, c, d in pairs:",
"- if (i[b - 1] - i[a - 1]) == c:",
"- tmp += d",
"- ans = max(ans, tmp)",
"+for s in dfs([]):",
"+ tmp_ans = 0",
"+ for a, b, c, d in abcd:",
"+ if s[b - 1] - s[a - 1] == c:",
"+ tmp_ans += d",
"+ ans = max(ans, tmp_ans)"
]
| false | 0.072368 | 0.06319 | 1.145232 | [
"s480807211",
"s402723287"
]
|
u334712262 | p02816 | python | s482987073 | s152478031 | 1,815 | 655 | 277,572 | 125,712 | Accepted | Accepted | 63.91 | # -*- coding: utf-8 -*-
# import time
import sys
from collections import Counter, defaultdict
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
gpw = None
class RH():
def __init__(self, s, base, mod):
self.base = base
self.mod = mod
l = len(s)
self.h = h = [0]*(l+1)
tmp = 0
for i in range(l):
tmp = (tmp*base + s[i]) % mod
h[i+1] = tmp
global gpw
if gpw is None:
self.pw = pw = [1]*(len(s)+1)
v = 1
for i in range(l):
pw[i+1] = v = v * base % mod
gpw = pw
else:
self.pw = gpw
def calc(self, l, r):
return (self.h[r] - self.h[l] * self.pw[r-l]) % self.mod
def slv(N, A, B):
L = max(max(A), max(B)).bit_length()
ah = []
bh = []
bnh = []
for i in range(L):
ta = []
tb = []
tbn = []
for a, b in zip(A, B):
ta.append(a >> i & 1)
tb.append(b >> i & 1)
tbn.append(tb[-1] ^ 1)
ah.append(RH(ta, 641, 10**9+7))
bh.append(RH(tb, 641, 10**9+7))
bnh.append(RH(tbn, 641, 10**9+7))
x = [0] * N
for i in range(L):
for k in range(N):
l = ah[i].calc(k, N)
r = ah[i].calc(0, k)
if x[k] is None:
continue
if l == bnh[i].calc(0, N-k) and r == bnh[i].calc(N-k, N):
x[k] += 1 << i
elif l == bh[i].calc(0, N-k) and r == bh[i].calc(N-k, N):
pass
else:
x[k] = None
ans = []
for k, xx in enumerate(x):
if xx is not None:
ans.append('%d %d' % (k, xx))
return ans
def main():
N = read_int()
A = read_int_n()
B = read_int_n()
print(*slv(N, A, B), sep='\n')
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import sys
from collections import Counter, defaultdict
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
class RollingHash():
"""
Original code is https://tjkendev.github.io/procon-library/python/string/rolling_hash.html
"""
class RH():
def __init__(self, s, base, mod):
self.base = base
self.mod = mod
self.rev = pow(base, mod-2, mod)
l = len(s)
self.h = h = [0]*(l+1)
tmp = 0
for i in range(l):
num = s[i]
tmp = (tmp*base + num) % mod
h[i+1] = tmp
self.pw = pw = [1]*(len(s)+1)
v = 1
for i in range(l):
pw[i+1] = v = v * base % mod
def calc(self, l, r):
return (self.h[r] - self.h[l] * self.pw[r-l]) % self.mod
@staticmethod
def gen(a, b, num):
result = set()
while 1:
import random
import math
random.seed()
while 1:
v = random.randint(a, b)//2*2+1
if v not in result:
break
for x in range(3, int(math.sqrt(v))+1, 2):
if v % x == 0:
break
else:
result.add(v)
if len(result) == num:
break
return result
def __init__(self, s, rand=False, num=5):
if rand:
bases = RollingHash.gen(2, 10**3, num)
else:
assert num <= 10
bases = [641, 103, 661, 293, 547, 311, 29, 457, 613, 599][:num]
MOD = 10**9+7
self.rhs = [self.RH(s, b, MOD) for b in bases]
def calc(self, l, r):
return tuple(rh.calc(l, r) for rh in self.rhs)
def slv(N, A, B):
a = []
for i in range(N):
a.append(A[i]^A[i-1])
b = []
for i in range(N):
b.append(B[i]^B[i-1])
b = b[:] + b[:]
ah = RollingHash(a)
bh = RollingHash(b)
h = ah.calc(0, N)
ans = []
for k in range(N):
if bh.calc(N-k, N-k+N) == h:
ans.append('%d %d' % (k, A[0]^B[(N-k)%N]))
return ans
def main():
N = read_int()
A = read_int_n()
B = read_int_n()
print(*slv(N, A, B), sep='\n')
if __name__ == '__main__':
main()
| 93 | 106 | 2,117 | 2,585 | # -*- coding: utf-8 -*-
# import time
import sys
from collections import Counter, defaultdict
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
gpw = None
class RH:
def __init__(self, s, base, mod):
self.base = base
self.mod = mod
l = len(s)
self.h = h = [0] * (l + 1)
tmp = 0
for i in range(l):
tmp = (tmp * base + s[i]) % mod
h[i + 1] = tmp
global gpw
if gpw is None:
self.pw = pw = [1] * (len(s) + 1)
v = 1
for i in range(l):
pw[i + 1] = v = v * base % mod
gpw = pw
else:
self.pw = gpw
def calc(self, l, r):
return (self.h[r] - self.h[l] * self.pw[r - l]) % self.mod
def slv(N, A, B):
L = max(max(A), max(B)).bit_length()
ah = []
bh = []
bnh = []
for i in range(L):
ta = []
tb = []
tbn = []
for a, b in zip(A, B):
ta.append(a >> i & 1)
tb.append(b >> i & 1)
tbn.append(tb[-1] ^ 1)
ah.append(RH(ta, 641, 10**9 + 7))
bh.append(RH(tb, 641, 10**9 + 7))
bnh.append(RH(tbn, 641, 10**9 + 7))
x = [0] * N
for i in range(L):
for k in range(N):
l = ah[i].calc(k, N)
r = ah[i].calc(0, k)
if x[k] is None:
continue
if l == bnh[i].calc(0, N - k) and r == bnh[i].calc(N - k, N):
x[k] += 1 << i
elif l == bh[i].calc(0, N - k) and r == bh[i].calc(N - k, N):
pass
else:
x[k] = None
ans = []
for k, xx in enumerate(x):
if xx is not None:
ans.append("%d %d" % (k, xx))
return ans
def main():
N = read_int()
A = read_int_n()
B = read_int_n()
print(*slv(N, A, B), sep="\n")
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
import sys
from collections import Counter, defaultdict
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
class RollingHash:
"""
Original code is https://tjkendev.github.io/procon-library/python/string/rolling_hash.html
"""
class RH:
def __init__(self, s, base, mod):
self.base = base
self.mod = mod
self.rev = pow(base, mod - 2, mod)
l = len(s)
self.h = h = [0] * (l + 1)
tmp = 0
for i in range(l):
num = s[i]
tmp = (tmp * base + num) % mod
h[i + 1] = tmp
self.pw = pw = [1] * (len(s) + 1)
v = 1
for i in range(l):
pw[i + 1] = v = v * base % mod
def calc(self, l, r):
return (self.h[r] - self.h[l] * self.pw[r - l]) % self.mod
@staticmethod
def gen(a, b, num):
result = set()
while 1:
import random
import math
random.seed()
while 1:
v = random.randint(a, b) // 2 * 2 + 1
if v not in result:
break
for x in range(3, int(math.sqrt(v)) + 1, 2):
if v % x == 0:
break
else:
result.add(v)
if len(result) == num:
break
return result
def __init__(self, s, rand=False, num=5):
if rand:
bases = RollingHash.gen(2, 10**3, num)
else:
assert num <= 10
bases = [641, 103, 661, 293, 547, 311, 29, 457, 613, 599][:num]
MOD = 10**9 + 7
self.rhs = [self.RH(s, b, MOD) for b in bases]
def calc(self, l, r):
return tuple(rh.calc(l, r) for rh in self.rhs)
def slv(N, A, B):
a = []
for i in range(N):
a.append(A[i] ^ A[i - 1])
b = []
for i in range(N):
b.append(B[i] ^ B[i - 1])
b = b[:] + b[:]
ah = RollingHash(a)
bh = RollingHash(b)
h = ah.calc(0, N)
ans = []
for k in range(N):
if bh.calc(N - k, N - k + N) == h:
ans.append("%d %d" % (k, A[0] ^ B[(N - k) % N]))
return ans
def main():
N = read_int()
A = read_int_n()
B = read_int_n()
print(*slv(N, A, B), sep="\n")
if __name__ == "__main__":
main()
| false | 12.264151 | [
"-# import time",
"-gpw = None",
"+class RollingHash:",
"+ \"\"\"",
"+ Original code is https://tjkendev.github.io/procon-library/python/string/rolling_hash.html",
"+ \"\"\"",
"-",
"-class RH:",
"- def __init__(self, s, base, mod):",
"- self.base = base",
"- self.mod = mod",
"- l = len(s)",
"- self.h = h = [0] * (l + 1)",
"- tmp = 0",
"- for i in range(l):",
"- tmp = (tmp * base + s[i]) % mod",
"- h[i + 1] = tmp",
"- global gpw",
"- if gpw is None:",
"+ class RH:",
"+ def __init__(self, s, base, mod):",
"+ self.base = base",
"+ self.mod = mod",
"+ self.rev = pow(base, mod - 2, mod)",
"+ l = len(s)",
"+ self.h = h = [0] * (l + 1)",
"+ tmp = 0",
"+ for i in range(l):",
"+ num = s[i]",
"+ tmp = (tmp * base + num) % mod",
"+ h[i + 1] = tmp",
"- gpw = pw",
"+",
"+ def calc(self, l, r):",
"+ return (self.h[r] - self.h[l] * self.pw[r - l]) % self.mod",
"+",
"+ @staticmethod",
"+ def gen(a, b, num):",
"+ result = set()",
"+ while 1:",
"+ import random",
"+ import math",
"+",
"+ random.seed()",
"+ while 1:",
"+ v = random.randint(a, b) // 2 * 2 + 1",
"+ if v not in result:",
"+ break",
"+ for x in range(3, int(math.sqrt(v)) + 1, 2):",
"+ if v % x == 0:",
"+ break",
"+ else:",
"+ result.add(v)",
"+ if len(result) == num:",
"+ break",
"+ return result",
"+",
"+ def __init__(self, s, rand=False, num=5):",
"+ if rand:",
"+ bases = RollingHash.gen(2, 10**3, num)",
"- self.pw = gpw",
"+ assert num <= 10",
"+ bases = [641, 103, 661, 293, 547, 311, 29, 457, 613, 599][:num]",
"+ MOD = 10**9 + 7",
"+ self.rhs = [self.RH(s, b, MOD) for b in bases]",
"- return (self.h[r] - self.h[l] * self.pw[r - l]) % self.mod",
"+ return tuple(rh.calc(l, r) for rh in self.rhs)",
"- L = max(max(A), max(B)).bit_length()",
"- ah = []",
"- bh = []",
"- bnh = []",
"- for i in range(L):",
"- ta = []",
"- tb = []",
"- tbn = []",
"- for a, b in zip(A, B):",
"- ta.append(a >> i & 1)",
"- tb.append(b >> i & 1)",
"- tbn.append(tb[-1] ^ 1)",
"- ah.append(RH(ta, 641, 10**9 + 7))",
"- bh.append(RH(tb, 641, 10**9 + 7))",
"- bnh.append(RH(tbn, 641, 10**9 + 7))",
"- x = [0] * N",
"- for i in range(L):",
"- for k in range(N):",
"- l = ah[i].calc(k, N)",
"- r = ah[i].calc(0, k)",
"- if x[k] is None:",
"- continue",
"- if l == bnh[i].calc(0, N - k) and r == bnh[i].calc(N - k, N):",
"- x[k] += 1 << i",
"- elif l == bh[i].calc(0, N - k) and r == bh[i].calc(N - k, N):",
"- pass",
"- else:",
"- x[k] = None",
"+ a = []",
"+ for i in range(N):",
"+ a.append(A[i] ^ A[i - 1])",
"+ b = []",
"+ for i in range(N):",
"+ b.append(B[i] ^ B[i - 1])",
"+ b = b[:] + b[:]",
"+ ah = RollingHash(a)",
"+ bh = RollingHash(b)",
"+ h = ah.calc(0, N)",
"- for k, xx in enumerate(x):",
"- if xx is not None:",
"- ans.append(\"%d %d\" % (k, xx))",
"+ for k in range(N):",
"+ if bh.calc(N - k, N - k + N) == h:",
"+ ans.append(\"%d %d\" % (k, A[0] ^ B[(N - k) % N]))"
]
| false | 0.037817 | 0.044915 | 0.841979 | [
"s482987073",
"s152478031"
]
|
u811169796 | p03816 | python | s159013334 | s943214261 | 81 | 44 | 14,396 | 14,564 | Accepted | Accepted | 45.68 | n = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
m = 0
cnt = 0
for i in A:
if(m != i):
m = i
cnt += 1
if(cnt % 2 == 0):
cnt -= 1
print(cnt)
| n = eval(input())
A = list(map(int,input().split()))
l = len(set(A))
if(l % 2 == 0):
l -= 1
print(l) | 15 | 6 | 185 | 101 | n = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
m = 0
cnt = 0
for i in A:
if m != i:
m = i
cnt += 1
if cnt % 2 == 0:
cnt -= 1
print(cnt)
| n = eval(input())
A = list(map(int, input().split()))
l = len(set(A))
if l % 2 == 0:
l -= 1
print(l)
| false | 60 | [
"-n = int(eval(input()))",
"+n = eval(input())",
"-A.sort()",
"-m = 0",
"-cnt = 0",
"-for i in A:",
"- if m != i:",
"- m = i",
"- cnt += 1",
"-if cnt % 2 == 0:",
"- cnt -= 1",
"-print(cnt)",
"+l = len(set(A))",
"+if l % 2 == 0:",
"+ l -= 1",
"+print(l)"
]
| false | 0.037844 | 0.080011 | 0.472984 | [
"s159013334",
"s943214261"
]
|
u563588763 | p03485 | python | s244133086 | s966395451 | 20 | 18 | 2,940 | 2,940 | Accepted | Accepted | 10 | a,b = list(map(int,input().split()))
if (a + b) % 2 == 0:
print((int((a +b)/2)))
else:
print((int(((a + b)/2) +1))) | a,b = list(map(int,input().split()))
if int((a + b)%2) == 0:
print((int((a + b)//2)))
else:
print((int((a + b) // 2 + 1)))
| 5 | 5 | 117 | 125 | a, b = list(map(int, input().split()))
if (a + b) % 2 == 0:
print((int((a + b) / 2)))
else:
print((int(((a + b) / 2) + 1)))
| a, b = list(map(int, input().split()))
if int((a + b) % 2) == 0:
print((int((a + b) // 2)))
else:
print((int((a + b) // 2 + 1)))
| false | 0 | [
"-if (a + b) % 2 == 0:",
"- print((int((a + b) / 2)))",
"+if int((a + b) % 2) == 0:",
"+ print((int((a + b) // 2)))",
"- print((int(((a + b) / 2) + 1)))",
"+ print((int((a + b) // 2 + 1)))"
]
| false | 0.036373 | 0.046142 | 0.788295 | [
"s244133086",
"s966395451"
]
|
u608088992 | p03363 | python | s738819718 | s931389564 | 270 | 171 | 48,128 | 38,852 | Accepted | Accepted | 36.67 | from collections import defaultdict
N = int(eval(input()))
A = [int(a) for a in input().split()]
series = [0] * (N + 1)
for i in range(1, N+1):
series[i] = series[i-1] + i
sumDict = defaultdict(int)
sumDict[0] = 1
sum = 0
for a in A:
sum += a
sumDict[sum] += 1
total = 0
for key in sumDict:
total += series[sumDict[key] - 1]
print(total) | import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [int(a) for a in input().split()]
sumDict = dict()
sumA = 0
sumDict[0] = 1
for i, a in enumerate(A):
sumA += a
if sumA in sumDict: sumDict[sumA] += 1
else: sumDict[sumA] = 1
ans = 0
for key in sumDict: ans += sumDict[key] * (sumDict[key] - 1) // 2
print(ans)
return 0
if __name__ == "__main__":
solve() | 18 | 21 | 366 | 469 | from collections import defaultdict
N = int(eval(input()))
A = [int(a) for a in input().split()]
series = [0] * (N + 1)
for i in range(1, N + 1):
series[i] = series[i - 1] + i
sumDict = defaultdict(int)
sumDict[0] = 1
sum = 0
for a in A:
sum += a
sumDict[sum] += 1
total = 0
for key in sumDict:
total += series[sumDict[key] - 1]
print(total)
| import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [int(a) for a in input().split()]
sumDict = dict()
sumA = 0
sumDict[0] = 1
for i, a in enumerate(A):
sumA += a
if sumA in sumDict:
sumDict[sumA] += 1
else:
sumDict[sumA] = 1
ans = 0
for key in sumDict:
ans += sumDict[key] * (sumDict[key] - 1) // 2
print(ans)
return 0
if __name__ == "__main__":
solve()
| false | 14.285714 | [
"-from collections import defaultdict",
"+import sys",
"-N = int(eval(input()))",
"-A = [int(a) for a in input().split()]",
"-series = [0] * (N + 1)",
"-for i in range(1, N + 1):",
"- series[i] = series[i - 1] + i",
"-sumDict = defaultdict(int)",
"-sumDict[0] = 1",
"-sum = 0",
"-for a in A:",
"- sum += a",
"- sumDict[sum] += 1",
"-total = 0",
"-for key in sumDict:",
"- total += series[sumDict[key] - 1]",
"-print(total)",
"+",
"+def solve():",
"+ input = sys.stdin.readline",
"+ N = int(eval(input()))",
"+ A = [int(a) for a in input().split()]",
"+ sumDict = dict()",
"+ sumA = 0",
"+ sumDict[0] = 1",
"+ for i, a in enumerate(A):",
"+ sumA += a",
"+ if sumA in sumDict:",
"+ sumDict[sumA] += 1",
"+ else:",
"+ sumDict[sumA] = 1",
"+ ans = 0",
"+ for key in sumDict:",
"+ ans += sumDict[key] * (sumDict[key] - 1) // 2",
"+ print(ans)",
"+ return 0",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ solve()"
]
| false | 0.033063 | 0.077468 | 0.426788 | [
"s738819718",
"s931389564"
]
|
u255317651 | p02264 | python | s770021619 | s231022932 | 750 | 460 | 10,912 | 15,668 | Accepted | Accepted | 38.67 | # -*- coding: utf-8 -*-
"""
Created on Sun Apr 29 14:42:43 2018
@author: maezawa
"""
def print_array(g):
ans = str(g[0])
if len(g) > 1:
for i in range(1,len(g)):
ans += ' '+str(g[i])
print(ans)
name=[]
time=[]
current_time = 0
n, q = list(map(int, input().split()))
for i in range(n):
s = input().split()
name.append(s[0])
time.append(int(s[1]))
# =============================================================================
# print(n,q)
# print(name)
# print(time)
# =============================================================================
finished = []
fin_time = []
i=0
remain = n
while True:
if time[i] <= q:
current_time += time.pop(i)
finished.append(name.pop(i))
fin_time.append(current_time)
remain -= 1
if remain == 0:
break
i = i%remain
else:
time[i] -= q
current_time += q
i = (i+1)%remain
for i in range(n):
print(("{} {}".format(finished[i], fin_time[i])))
| # -*- coding: utf-8 -*-
"""
Created on Sun Apr 29 18:04:22 2018
ALDS1_3b_r リングバッファによる実装
@author: maezawa
"""
def fifo_enque(data):
global tail
global fifo
fifo[tail] = data
tail = (tail+1)%fifo_size
def fifo_deque():
global head
global fifo
data = fifo[head]
head = (head+1)%fifo_size
return data
fifo_size = 100000
fifo = [0 for _ in range(fifo_size)]
head = 0
tail = 0
n, q = list(map(int, input().split()))
for i in range(n):
s = input().split()
data = [s[0], int(s[1])]
fifo_enque(data)
current_time = 0
finished = []
fin_time = []
while True:
data = fifo_deque()
if data[1] > q:
current_time += q
data[1] -= q
fifo_enque(data)
else:
current_time += data[1]
finished.append(data[0])
fin_time.append(current_time)
if head == tail:
break
for i in range(n):
print(("{} {}".format(finished[i], fin_time[i])))
| 50 | 53 | 1,089 | 1,009 | # -*- coding: utf-8 -*-
"""
Created on Sun Apr 29 14:42:43 2018
@author: maezawa
"""
def print_array(g):
ans = str(g[0])
if len(g) > 1:
for i in range(1, len(g)):
ans += " " + str(g[i])
print(ans)
name = []
time = []
current_time = 0
n, q = list(map(int, input().split()))
for i in range(n):
s = input().split()
name.append(s[0])
time.append(int(s[1]))
# =============================================================================
# print(n,q)
# print(name)
# print(time)
# =============================================================================
finished = []
fin_time = []
i = 0
remain = n
while True:
if time[i] <= q:
current_time += time.pop(i)
finished.append(name.pop(i))
fin_time.append(current_time)
remain -= 1
if remain == 0:
break
i = i % remain
else:
time[i] -= q
current_time += q
i = (i + 1) % remain
for i in range(n):
print(("{} {}".format(finished[i], fin_time[i])))
| # -*- coding: utf-8 -*-
"""
Created on Sun Apr 29 18:04:22 2018
ALDS1_3b_r リングバッファによる実装
@author: maezawa
"""
def fifo_enque(data):
global tail
global fifo
fifo[tail] = data
tail = (tail + 1) % fifo_size
def fifo_deque():
global head
global fifo
data = fifo[head]
head = (head + 1) % fifo_size
return data
fifo_size = 100000
fifo = [0 for _ in range(fifo_size)]
head = 0
tail = 0
n, q = list(map(int, input().split()))
for i in range(n):
s = input().split()
data = [s[0], int(s[1])]
fifo_enque(data)
current_time = 0
finished = []
fin_time = []
while True:
data = fifo_deque()
if data[1] > q:
current_time += q
data[1] -= q
fifo_enque(data)
else:
current_time += data[1]
finished.append(data[0])
fin_time.append(current_time)
if head == tail:
break
for i in range(n):
print(("{} {}".format(finished[i], fin_time[i])))
| false | 5.660377 | [
"-Created on Sun Apr 29 14:42:43 2018",
"+Created on Sun Apr 29 18:04:22 2018",
"+ALDS1_3b_r リングバッファによる実装",
"-def print_array(g):",
"- ans = str(g[0])",
"- if len(g) > 1:",
"- for i in range(1, len(g)):",
"- ans += \" \" + str(g[i])",
"- print(ans)",
"+def fifo_enque(data):",
"+ global tail",
"+ global fifo",
"+ fifo[tail] = data",
"+ tail = (tail + 1) % fifo_size",
"-name = []",
"-time = []",
"-current_time = 0",
"+def fifo_deque():",
"+ global head",
"+ global fifo",
"+ data = fifo[head]",
"+ head = (head + 1) % fifo_size",
"+ return data",
"+",
"+",
"+fifo_size = 100000",
"+fifo = [0 for _ in range(fifo_size)]",
"+head = 0",
"+tail = 0",
"- name.append(s[0])",
"- time.append(int(s[1]))",
"-# =============================================================================",
"-# print(n,q)",
"-# print(name)",
"-# print(time)",
"-# =============================================================================",
"+ data = [s[0], int(s[1])]",
"+ fifo_enque(data)",
"+current_time = 0",
"-i = 0",
"-remain = n",
"- if time[i] <= q:",
"- current_time += time.pop(i)",
"- finished.append(name.pop(i))",
"+ data = fifo_deque()",
"+ if data[1] > q:",
"+ current_time += q",
"+ data[1] -= q",
"+ fifo_enque(data)",
"+ else:",
"+ current_time += data[1]",
"+ finished.append(data[0])",
"- remain -= 1",
"- if remain == 0:",
"- break",
"- i = i % remain",
"- else:",
"- time[i] -= q",
"- current_time += q",
"- i = (i + 1) % remain",
"+ if head == tail:",
"+ break"
]
| false | 0.036695 | 0.04202 | 0.873285 | [
"s770021619",
"s231022932"
]
|
u813387707 | p02887 | python | s758690404 | s726482882 | 42 | 32 | 3,316 | 3,316 | Accepted | Accepted | 23.81 | n = int(eval(input()))
s = eval(input())
ans = 1
for i in range(n - 1):
if s[i] != s[i + 1]:
ans += 1
print(ans) | n = int(eval(input()))
s = eval(input())
ans = 1
temp = s[0]
for c in s:
if c != temp:
ans += 1
temp = c
print(ans) | 8 | 10 | 120 | 129 | n = int(eval(input()))
s = eval(input())
ans = 1
for i in range(n - 1):
if s[i] != s[i + 1]:
ans += 1
print(ans)
| n = int(eval(input()))
s = eval(input())
ans = 1
temp = s[0]
for c in s:
if c != temp:
ans += 1
temp = c
print(ans)
| false | 20 | [
"-for i in range(n - 1):",
"- if s[i] != s[i + 1]:",
"+temp = s[0]",
"+for c in s:",
"+ if c != temp:",
"+ temp = c"
]
| false | 0.04092 | 0.034919 | 1.171865 | [
"s758690404",
"s726482882"
]
|
u683968848 | p00474 | python | s242438200 | s418966810 | 220 | 190 | 10,860 | 10,832 | Accepted | Accepted | 13.64 | import sys
sys.setrecursionlimit(100000000)
line = input().rstrip().split()
N, L = list(map(int, line))
def solve2(trr, hour=0):
N = len(trr)
if sum(trr) == 0:
return hour
elif N == 1:
trr[0] += 1
elif N == 2:
if trr[0] > trr[1]:
trr[0] += 1
else:
trr[1] += 1
elif N > 2:
if trr[0] > trr[1]:
trr[0] += 1
if trr[N-1] > trr[N-2]:
trr[N-1] += 1
for i in range(1, N-1):
if N > 2 and trr[i-1] < trr[i] > trr[i+1]:
trr[i] += 1
return solve([0 if t == L else t for t in trr], hour+1)
def solve(trr, N):
# print trr
if N == 1:
return L - trr[0]
elif N == 2:
return (L - trr[0]) + (L - trr[1])
best_hour = -1
peaks = []
if trr[0] > trr[1]:
peaks.append(0)
if trr[N-1] > trr[N-2]:
peaks.append(N-1)
peaks += [i for i in range(1, N-1) if trr[i-1] < trr[i] > trr[i+1]]
# print peaks
for i, p in enumerate(peaks):
hour1 = hour2 = L - trr[p]
p_tm1 = p
while p_tm1+1 < N and trr[p_tm1] > trr[p_tm1+1]:
hour1 += L - trr[p_tm1+1]
p_tm1 += 1
p_tm2 = p
# print '%d %d' % (p, trr[p_tm2-1])
while p_tm2-1 > -1 and trr[p_tm2] > trr[p_tm2-1]:
hour2 += L - trr[p_tm2-1]
# print hour2
p_tm2 -= 1
# print hour2
if best_hour < hour1:
best_hour = hour1
if best_hour < hour2:
best_hour = hour2
return best_hour
print(solve([int(input().rstrip()) for _ in range(N)], N)) | import sys
sys.setrecursionlimit(100000000)
line = input().rstrip().split()
N, L = list(map(int, line))
def solve(trr, N):
if N == 1:
return L - trr[0]
elif N == 2:
return (L - trr[0]) + (L - trr[1])
best_hour = -1
peaks = []
if trr[0] > trr[1]:
peaks.append(0)
if trr[N-1] > trr[N-2]:
peaks.append(N-1)
peaks += [i for i in range(1, N-1) if trr[i-1] < trr[i] > trr[i+1]]
for i, p in enumerate(peaks):
hour1 = hour2 = L - trr[p]
p_tm1 = p
while p_tm1+1 < N and trr[p_tm1] > trr[p_tm1+1]:
hour1 += L - trr[p_tm1+1]
p_tm1 += 1
p_tm2 = p
while p_tm2-1 > -1 and trr[p_tm2] > trr[p_tm2-1]:
hour2 += L - trr[p_tm2-1]
p_tm2 -= 1
if best_hour < hour1:
best_hour = hour1
if best_hour < hour2:
best_hour = hour2
return best_hour
print(solve([int(input().rstrip()) for _ in range(N)], N)) | 63 | 36 | 1,704 | 1,015 | import sys
sys.setrecursionlimit(100000000)
line = input().rstrip().split()
N, L = list(map(int, line))
def solve2(trr, hour=0):
N = len(trr)
if sum(trr) == 0:
return hour
elif N == 1:
trr[0] += 1
elif N == 2:
if trr[0] > trr[1]:
trr[0] += 1
else:
trr[1] += 1
elif N > 2:
if trr[0] > trr[1]:
trr[0] += 1
if trr[N - 1] > trr[N - 2]:
trr[N - 1] += 1
for i in range(1, N - 1):
if N > 2 and trr[i - 1] < trr[i] > trr[i + 1]:
trr[i] += 1
return solve([0 if t == L else t for t in trr], hour + 1)
def solve(trr, N):
# print trr
if N == 1:
return L - trr[0]
elif N == 2:
return (L - trr[0]) + (L - trr[1])
best_hour = -1
peaks = []
if trr[0] > trr[1]:
peaks.append(0)
if trr[N - 1] > trr[N - 2]:
peaks.append(N - 1)
peaks += [i for i in range(1, N - 1) if trr[i - 1] < trr[i] > trr[i + 1]]
# print peaks
for i, p in enumerate(peaks):
hour1 = hour2 = L - trr[p]
p_tm1 = p
while p_tm1 + 1 < N and trr[p_tm1] > trr[p_tm1 + 1]:
hour1 += L - trr[p_tm1 + 1]
p_tm1 += 1
p_tm2 = p
# print '%d %d' % (p, trr[p_tm2-1])
while p_tm2 - 1 > -1 and trr[p_tm2] > trr[p_tm2 - 1]:
hour2 += L - trr[p_tm2 - 1]
# print hour2
p_tm2 -= 1
# print hour2
if best_hour < hour1:
best_hour = hour1
if best_hour < hour2:
best_hour = hour2
return best_hour
print(solve([int(input().rstrip()) for _ in range(N)], N))
| import sys
sys.setrecursionlimit(100000000)
line = input().rstrip().split()
N, L = list(map(int, line))
def solve(trr, N):
if N == 1:
return L - trr[0]
elif N == 2:
return (L - trr[0]) + (L - trr[1])
best_hour = -1
peaks = []
if trr[0] > trr[1]:
peaks.append(0)
if trr[N - 1] > trr[N - 2]:
peaks.append(N - 1)
peaks += [i for i in range(1, N - 1) if trr[i - 1] < trr[i] > trr[i + 1]]
for i, p in enumerate(peaks):
hour1 = hour2 = L - trr[p]
p_tm1 = p
while p_tm1 + 1 < N and trr[p_tm1] > trr[p_tm1 + 1]:
hour1 += L - trr[p_tm1 + 1]
p_tm1 += 1
p_tm2 = p
while p_tm2 - 1 > -1 and trr[p_tm2] > trr[p_tm2 - 1]:
hour2 += L - trr[p_tm2 - 1]
p_tm2 -= 1
if best_hour < hour1:
best_hour = hour1
if best_hour < hour2:
best_hour = hour2
return best_hour
print(solve([int(input().rstrip()) for _ in range(N)], N))
| false | 42.857143 | [
"-def solve2(trr, hour=0):",
"- N = len(trr)",
"- if sum(trr) == 0:",
"- return hour",
"- elif N == 1:",
"- trr[0] += 1",
"- elif N == 2:",
"- if trr[0] > trr[1]:",
"- trr[0] += 1",
"- else:",
"- trr[1] += 1",
"- elif N > 2:",
"- if trr[0] > trr[1]:",
"- trr[0] += 1",
"- if trr[N - 1] > trr[N - 2]:",
"- trr[N - 1] += 1",
"- for i in range(1, N - 1):",
"- if N > 2 and trr[i - 1] < trr[i] > trr[i + 1]:",
"- trr[i] += 1",
"- return solve([0 if t == L else t for t in trr], hour + 1)",
"-",
"-",
"- # print trr",
"- # print peaks",
"- # print '%d %d' % (p, trr[p_tm2-1])",
"- # print hour2",
"- # print hour2"
]
| false | 0.044996 | 0.044837 | 1.00356 | [
"s242438200",
"s418966810"
]
|
u910632349 | p03163 | python | s951961950 | s865156075 | 641 | 528 | 218,132 | 217,792 | Accepted | Accepted | 17.63 | n,w=list(map(int,input().split()))
a=[list(map(int,input().split())) for _ in range(n)]
dp=[[0 for _ in range(w+1)] for _ in range(n+1)]
for i in range(n):
for j in range(w+1):
weight,value=a[i]
dp[i+1][j]=max(dp[i][j],dp[i+1][j])
if j+weight<=w:
dp[i+1][j+weight]=max(dp[i][j+weight],dp[i][j]+value)
print((dp[-1][-1])) | n,W=list(map(int,input().split()))
a=[list(map(int,input().split())) for _ in range(n)]
dp=[[0 for _ in range(W+1)] for _ in range(n+1)]
for i in range(n):
weight,value=a[i]
for j in range(W+1):
dp[i+1][j]=max(dp[i][j],dp[i+1][j])
if j+weight<=W:
dp[i+1][j+weight]=max(dp[i][j+weight],dp[i][j]+value)
print((dp[-1][-1])) | 10 | 10 | 361 | 357 | n, w = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(n)]
dp = [[0 for _ in range(w + 1)] for _ in range(n + 1)]
for i in range(n):
for j in range(w + 1):
weight, value = a[i]
dp[i + 1][j] = max(dp[i][j], dp[i + 1][j])
if j + weight <= w:
dp[i + 1][j + weight] = max(dp[i][j + weight], dp[i][j] + value)
print((dp[-1][-1]))
| n, W = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(n)]
dp = [[0 for _ in range(W + 1)] for _ in range(n + 1)]
for i in range(n):
weight, value = a[i]
for j in range(W + 1):
dp[i + 1][j] = max(dp[i][j], dp[i + 1][j])
if j + weight <= W:
dp[i + 1][j + weight] = max(dp[i][j + weight], dp[i][j] + value)
print((dp[-1][-1]))
| false | 0 | [
"-n, w = list(map(int, input().split()))",
"+n, W = list(map(int, input().split()))",
"-dp = [[0 for _ in range(w + 1)] for _ in range(n + 1)]",
"+dp = [[0 for _ in range(W + 1)] for _ in range(n + 1)]",
"- for j in range(w + 1):",
"- weight, value = a[i]",
"+ weight, value = a[i]",
"+ for j in range(W + 1):",
"- if j + weight <= w:",
"+ if j + weight <= W:"
]
| false | 0.037129 | 0.12285 | 0.302228 | [
"s951961950",
"s865156075"
]
|
u368796742 | p02614 | python | s329695592 | s515596924 | 147 | 64 | 9,340 | 9,240 | Accepted | Accepted | 56.46 | import copy
h,w,k = list(map(int,input().split()))
c = [list(eval(input())) for i in range(h)]
count = 0
for i in range(2**h):
for j in range(2**w):
d = copy.deepcopy(c)
for t in range(h):
if (i >> t) & 1:
for q in range(w):
d[t][q] = "x"
for t in range(w):
if (j >> t) & 1:
for q in range(h):
d[q][t] = "x"
ci = 0
for m in d:
ci += m.count("#")
if ci == k:
count += 1
print(count)
| H,W,K = list(map(int,input().split()))
C = [list(eval(input())) for i in range(H)]
ans = 0
for i in range(1<<H):
for j in range(1<<W):
count = 0
for h in range(H):
for w in range(W):
if ((i>>h)& 1) or ((j>>w)& 1) or C[h][w] == ".":
continue
count += 1
if count == K:
ans += 1
print(ans) | 22 | 15 | 566 | 393 | import copy
h, w, k = list(map(int, input().split()))
c = [list(eval(input())) for i in range(h)]
count = 0
for i in range(2**h):
for j in range(2**w):
d = copy.deepcopy(c)
for t in range(h):
if (i >> t) & 1:
for q in range(w):
d[t][q] = "x"
for t in range(w):
if (j >> t) & 1:
for q in range(h):
d[q][t] = "x"
ci = 0
for m in d:
ci += m.count("#")
if ci == k:
count += 1
print(count)
| H, W, K = list(map(int, input().split()))
C = [list(eval(input())) for i in range(H)]
ans = 0
for i in range(1 << H):
for j in range(1 << W):
count = 0
for h in range(H):
for w in range(W):
if ((i >> h) & 1) or ((j >> w) & 1) or C[h][w] == ".":
continue
count += 1
if count == K:
ans += 1
print(ans)
| false | 31.818182 | [
"-import copy",
"-",
"-h, w, k = list(map(int, input().split()))",
"-c = [list(eval(input())) for i in range(h)]",
"-count = 0",
"-for i in range(2**h):",
"- for j in range(2**w):",
"- d = copy.deepcopy(c)",
"- for t in range(h):",
"- if (i >> t) & 1:",
"- for q in range(w):",
"- d[t][q] = \"x\"",
"- for t in range(w):",
"- if (j >> t) & 1:",
"- for q in range(h):",
"- d[q][t] = \"x\"",
"- ci = 0",
"- for m in d:",
"- ci += m.count(\"#\")",
"- if ci == k:",
"- count += 1",
"-print(count)",
"+H, W, K = list(map(int, input().split()))",
"+C = [list(eval(input())) for i in range(H)]",
"+ans = 0",
"+for i in range(1 << H):",
"+ for j in range(1 << W):",
"+ count = 0",
"+ for h in range(H):",
"+ for w in range(W):",
"+ if ((i >> h) & 1) or ((j >> w) & 1) or C[h][w] == \".\":",
"+ continue",
"+ count += 1",
"+ if count == K:",
"+ ans += 1",
"+print(ans)"
]
| false | 0.078613 | 0.0402 | 1.955551 | [
"s329695592",
"s515596924"
]
|
u761989513 | p03845 | python | s751791053 | s141746950 | 23 | 18 | 3,444 | 2,940 | Accepted | Accepted | 21.74 | import copy
n = int(eval(input()))
t = list(map(int, input().split()))
m = int(eval(input()))
a = copy.copy(t)
for i in range(m):
p, x = list(map(int, input().split()))
a[p - 1] = x
print((sum(a)))
a = copy.copy(t) | n = int(eval(input()))
t = list(map(int, input().split()))
m = int(eval(input()))
s = sum(t)
for i in range(m):
p, x = list(map(int, input().split()))
print((s - t[p - 1] + x))
| 10 | 7 | 211 | 167 | import copy
n = int(eval(input()))
t = list(map(int, input().split()))
m = int(eval(input()))
a = copy.copy(t)
for i in range(m):
p, x = list(map(int, input().split()))
a[p - 1] = x
print((sum(a)))
a = copy.copy(t)
| n = int(eval(input()))
t = list(map(int, input().split()))
m = int(eval(input()))
s = sum(t)
for i in range(m):
p, x = list(map(int, input().split()))
print((s - t[p - 1] + x))
| false | 30 | [
"-import copy",
"-",
"-a = copy.copy(t)",
"+s = sum(t)",
"- a[p - 1] = x",
"- print((sum(a)))",
"- a = copy.copy(t)",
"+ print((s - t[p - 1] + x))"
]
| false | 0.043681 | 0.036027 | 1.212472 | [
"s751791053",
"s141746950"
]
|
u489959379 | p02861 | python | s594676339 | s141846386 | 467 | 417 | 3,064 | 3,188 | Accepted | Accepted | 10.71 | from itertools import permutations
n = int(eval(input()))
xy = [list(map(int, input().split())) for _ in range(n)]
dist = 0
cnt = 0
for pattern in permutations(xy):
cnt += 1
for i in range(n - 1):
x1, y1 = pattern[i]
x2, y2 = pattern[i + 1]
dist += pow(pow(x1 - x2, 2) + pow(y1 - y2, 2), 1 / 2)
res = dist / cnt
print(res) | import sys
from itertools import permutations
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
XY = [list(map(int, input().split())) for _ in range(n)]
def calc(x1, y1, x2, y2):
return pow(pow(x1 - x2, 2) + pow(y1 - y2, 2), 0.5)
dist = 0
cnt = 0
for pattern in permutations(list(range(n))):
cnt += 1
for i in range(1, n):
x1, y1 = XY[pattern[i - 1]]
x2, y2 = XY[pattern[i]]
dist += calc(x1, y1, x2, y2)
print((dist / cnt))
if __name__ == '__main__':
resolve()
| 15 | 29 | 364 | 639 | from itertools import permutations
n = int(eval(input()))
xy = [list(map(int, input().split())) for _ in range(n)]
dist = 0
cnt = 0
for pattern in permutations(xy):
cnt += 1
for i in range(n - 1):
x1, y1 = pattern[i]
x2, y2 = pattern[i + 1]
dist += pow(pow(x1 - x2, 2) + pow(y1 - y2, 2), 1 / 2)
res = dist / cnt
print(res)
| import sys
from itertools import permutations
sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7
def resolve():
n = int(eval(input()))
XY = [list(map(int, input().split())) for _ in range(n)]
def calc(x1, y1, x2, y2):
return pow(pow(x1 - x2, 2) + pow(y1 - y2, 2), 0.5)
dist = 0
cnt = 0
for pattern in permutations(list(range(n))):
cnt += 1
for i in range(1, n):
x1, y1 = XY[pattern[i - 1]]
x2, y2 = XY[pattern[i]]
dist += calc(x1, y1, x2, y2)
print((dist / cnt))
if __name__ == "__main__":
resolve()
| false | 48.275862 | [
"+import sys",
"-n = int(eval(input()))",
"-xy = [list(map(int, input().split())) for _ in range(n)]",
"-dist = 0",
"-cnt = 0",
"-for pattern in permutations(xy):",
"- cnt += 1",
"- for i in range(n - 1):",
"- x1, y1 = pattern[i]",
"- x2, y2 = pattern[i + 1]",
"- dist += pow(pow(x1 - x2, 2) + pow(y1 - y2, 2), 1 / 2)",
"-res = dist / cnt",
"-print(res)",
"+sys.setrecursionlimit(10**7)",
"+f_inf = float(\"inf\")",
"+mod = 10**9 + 7",
"+",
"+",
"+def resolve():",
"+ n = int(eval(input()))",
"+ XY = [list(map(int, input().split())) for _ in range(n)]",
"+",
"+ def calc(x1, y1, x2, y2):",
"+ return pow(pow(x1 - x2, 2) + pow(y1 - y2, 2), 0.5)",
"+",
"+ dist = 0",
"+ cnt = 0",
"+ for pattern in permutations(list(range(n))):",
"+ cnt += 1",
"+ for i in range(1, n):",
"+ x1, y1 = XY[pattern[i - 1]]",
"+ x2, y2 = XY[pattern[i]]",
"+ dist += calc(x1, y1, x2, y2)",
"+ print((dist / cnt))",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ resolve()"
]
| false | 0.07661 | 0.066024 | 1.160331 | [
"s594676339",
"s141846386"
]
|
u631277801 | p03295 | python | s183060474 | s507487090 | 311 | 263 | 18,200 | 18,200 | Accepted | Accepted | 15.43 | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())
n,m = li()
ab = []
for _ in range(m):
a,b = li_()
ab.append(tuple([a,b]))
ab.sort(key=lambda x:x[1])
ans = 0
cur = -1
for a,b in ab:
if a >= cur:
ans += 1
cur = b
print(ans) | # Input
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())
n,m = li()
ab = []
for _ in range(m):
ai, bi = li_()
ab.append((ai, bi))
ab.sort(key=lambda x: x[1])
ans = 0
cur = -1
for ai, bi in ab:
if ai >= cur:
ans += 1
cur = bi
print(ans)
| 30 | 33 | 673 | 684 | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li():
return list(map(int, stdin.readline().split()))
def li_():
return [int(x) - 1 for x in stdin.readline().split()]
def lf():
return list(map(float, stdin.readline().split()))
def ls():
return stdin.readline().split()
def ns():
return stdin.readline().rstrip()
def lc():
return list(ns())
def ni():
return int(stdin.readline())
def nf():
return float(stdin.readline())
n, m = li()
ab = []
for _ in range(m):
a, b = li_()
ab.append(tuple([a, b]))
ab.sort(key=lambda x: x[1])
ans = 0
cur = -1
for a, b in ab:
if a >= cur:
ans += 1
cur = b
print(ans)
| # Input
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**7)
def li():
return list(map(int, stdin.readline().split()))
def li_():
return [int(x) - 1 for x in stdin.readline().split()]
def lf():
return list(map(float, stdin.readline().split()))
def ls():
return stdin.readline().split()
def ns():
return stdin.readline().rstrip()
def lc():
return list(ns())
def ni():
return int(stdin.readline())
def nf():
return float(stdin.readline())
n, m = li()
ab = []
for _ in range(m):
ai, bi = li_()
ab.append((ai, bi))
ab.sort(key=lambda x: x[1])
ans = 0
cur = -1
for ai, bi in ab:
if ai >= cur:
ans += 1
cur = bi
print(ans)
| false | 9.090909 | [
"+# Input",
"-sys.setrecursionlimit(10**5)",
"+sys.setrecursionlimit(10**7)",
"- a, b = li_()",
"- ab.append(tuple([a, b]))",
"+ ai, bi = li_()",
"+ ab.append((ai, bi))",
"-for a, b in ab:",
"- if a >= cur:",
"+for ai, bi in ab:",
"+ if ai >= cur:",
"- cur = b",
"+ cur = bi"
]
| false | 0.038277 | 0.044501 | 0.860137 | [
"s183060474",
"s507487090"
]
|
u819048695 | p03806 | python | s288344143 | s599103270 | 1,268 | 207 | 121,436 | 17,540 | Accepted | Accepted | 83.68 | import copy
n,ma,mb=list(map(int,input().split()))
abc=[list(map(int,input().split())) for i in range(n)]
l=10*n
inf=float("inf")
data=[[inf]*(l+1) for i in range(l+1)]
data[0][0]=0
for u in abc:
a,b,c=u
h=copy.deepcopy(data)
for i in range(l-a+1):
for j in range(l-b+1):
if data[i][j]!=inf:
h[i+a][j+b]=min(h[i+a][j+b],data[i][j]+c)
data=h
k=1
ans=inf
while ma*k<=l and mb*k<=l:
if data[ma*k][mb*k]!=inf:
ans=min(ans,data[ma*k][mb*k])
k+=1
if ans!=inf:
print(ans)
else:
print((-1)) | import numpy as np
n,ma,mb=list(map(int,input().split()))
L=10*n
dp=np.zeros((L+1,L+1),dtype="int64")
dq=np.zeros((L+1,L+1),dtype="int64")
inf=10**18
dp+=inf
dp[0][0]=0
for i in range(n):
a,b,c=list(map(int,input().split()))
dq=dp.copy()
dq[a:,b:]=np.minimum(dq[a:,b:],dp[:-a,:-b]+c)
dp=dq
ans=inf
for i in range(1,401):
if ma*i > L or mb*i > L:
break
ans=min(ans,dp[ma*i][mb*i])
if ans==inf:
print((-1))
else:
print(ans) | 25 | 27 | 574 | 482 | import copy
n, ma, mb = list(map(int, input().split()))
abc = [list(map(int, input().split())) for i in range(n)]
l = 10 * n
inf = float("inf")
data = [[inf] * (l + 1) for i in range(l + 1)]
data[0][0] = 0
for u in abc:
a, b, c = u
h = copy.deepcopy(data)
for i in range(l - a + 1):
for j in range(l - b + 1):
if data[i][j] != inf:
h[i + a][j + b] = min(h[i + a][j + b], data[i][j] + c)
data = h
k = 1
ans = inf
while ma * k <= l and mb * k <= l:
if data[ma * k][mb * k] != inf:
ans = min(ans, data[ma * k][mb * k])
k += 1
if ans != inf:
print(ans)
else:
print((-1))
| import numpy as np
n, ma, mb = list(map(int, input().split()))
L = 10 * n
dp = np.zeros((L + 1, L + 1), dtype="int64")
dq = np.zeros((L + 1, L + 1), dtype="int64")
inf = 10**18
dp += inf
dp[0][0] = 0
for i in range(n):
a, b, c = list(map(int, input().split()))
dq = dp.copy()
dq[a:, b:] = np.minimum(dq[a:, b:], dp[:-a, :-b] + c)
dp = dq
ans = inf
for i in range(1, 401):
if ma * i > L or mb * i > L:
break
ans = min(ans, dp[ma * i][mb * i])
if ans == inf:
print((-1))
else:
print(ans)
| false | 7.407407 | [
"-import copy",
"+import numpy as np",
"-abc = [list(map(int, input().split())) for i in range(n)]",
"-l = 10 * n",
"-inf = float(\"inf\")",
"-data = [[inf] * (l + 1) for i in range(l + 1)]",
"-data[0][0] = 0",
"-for u in abc:",
"- a, b, c = u",
"- h = copy.deepcopy(data)",
"- for i in range(l - a + 1):",
"- for j in range(l - b + 1):",
"- if data[i][j] != inf:",
"- h[i + a][j + b] = min(h[i + a][j + b], data[i][j] + c)",
"- data = h",
"-k = 1",
"+L = 10 * n",
"+dp = np.zeros((L + 1, L + 1), dtype=\"int64\")",
"+dq = np.zeros((L + 1, L + 1), dtype=\"int64\")",
"+inf = 10**18",
"+dp += inf",
"+dp[0][0] = 0",
"+for i in range(n):",
"+ a, b, c = list(map(int, input().split()))",
"+ dq = dp.copy()",
"+ dq[a:, b:] = np.minimum(dq[a:, b:], dp[:-a, :-b] + c)",
"+ dp = dq",
"-while ma * k <= l and mb * k <= l:",
"- if data[ma * k][mb * k] != inf:",
"- ans = min(ans, data[ma * k][mb * k])",
"- k += 1",
"-if ans != inf:",
"+for i in range(1, 401):",
"+ if ma * i > L or mb * i > L:",
"+ break",
"+ ans = min(ans, dp[ma * i][mb * i])",
"+if ans == inf:",
"+ print((-1))",
"+else:",
"-else:",
"- print((-1))"
]
| false | 0.140017 | 0.213658 | 0.65533 | [
"s288344143",
"s599103270"
]
|
u367701763 | p02973 | python | s860951005 | s562988260 | 134 | 103 | 79,404 | 83,716 | Accepted | Accepted | 23.13 | def LIS(A):
dp = deque([A[0]])
for a in A[1:]:
if a <= dp[0]:
dp.appendleft(a)
else:
dp[bisect_left(dp, a)-1] = a
return len(dp)
##################################################################################################################
import sys
input = sys.stdin.readline
from collections import deque
from bisect import bisect_left
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
print((LIS(A))) | def LIS(A):
dp = [-A[0]]
for a in A[1:]:
if -a >= dp[-1]:
dp.append(-a)
else:
dp[bisect_right(dp, -a)] = -a
return len(dp)
##################################################################################################################
import sys
input = sys.stdin.readline
from bisect import *
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
print((LIS(A))) | 21 | 20 | 487 | 440 | def LIS(A):
dp = deque([A[0]])
for a in A[1:]:
if a <= dp[0]:
dp.appendleft(a)
else:
dp[bisect_left(dp, a) - 1] = a
return len(dp)
##################################################################################################################
import sys
input = sys.stdin.readline
from collections import deque
from bisect import bisect_left
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
print((LIS(A)))
| def LIS(A):
dp = [-A[0]]
for a in A[1:]:
if -a >= dp[-1]:
dp.append(-a)
else:
dp[bisect_right(dp, -a)] = -a
return len(dp)
##################################################################################################################
import sys
input = sys.stdin.readline
from bisect import *
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
print((LIS(A)))
| false | 4.761905 | [
"- dp = deque([A[0]])",
"+ dp = [-A[0]]",
"- if a <= dp[0]:",
"- dp.appendleft(a)",
"+ if -a >= dp[-1]:",
"+ dp.append(-a)",
"- dp[bisect_left(dp, a) - 1] = a",
"+ dp[bisect_right(dp, -a)] = -a",
"-from collections import deque",
"-from bisect import bisect_left",
"+from bisect import *"
]
| false | 0.036541 | 0.07299 | 0.500624 | [
"s860951005",
"s562988260"
]
|
u814265211 | p02783 | python | s908815633 | s726542861 | 19 | 17 | 2,940 | 2,940 | Accepted | Accepted | 10.53 | H, A = list(map(int, input().split()))
cnt = 0
while H > 0:
H -= A
cnt += 1
print(cnt)
| import math
H, A = list(map(int, input().split()))
print((math.ceil(H / A)))
| 8 | 4 | 98 | 73 | H, A = list(map(int, input().split()))
cnt = 0
while H > 0:
H -= A
cnt += 1
print(cnt)
| import math
H, A = list(map(int, input().split()))
print((math.ceil(H / A)))
| false | 50 | [
"+import math",
"+",
"-cnt = 0",
"-while H > 0:",
"- H -= A",
"- cnt += 1",
"-print(cnt)",
"+print((math.ceil(H / A)))"
]
| false | 0.045008 | 0.087015 | 0.51725 | [
"s908815633",
"s726542861"
]
|
u892251744 | p03491 | python | s245667426 | s435919789 | 669 | 243 | 135,008 | 59,612 | Accepted | Accepted | 63.68 | def main():
import sys
from collections import defaultdict
input = sys.stdin.readline
mod = 10**10+7
mod2 = 10**10+9
mod3 = 998244353
N, L = list(map(int, input().split()))
dic = defaultdict(int)
dic2 = defaultdict(int)
dic3 = defaultdict(int)
h_list = []
h2_list = []
h3_list = []
pair = {}
pair2 = {}
pair3 = {}
M = 0
for _ in range(N):
s = input().rstrip('\n')
h = 0
h2 = 0
h3 = 0
for i in range(len(s)):
M += 1
h = (h*1007 + int(s[i]) + 1) % mod
pair[h] = (h + 1)%mod if s[i] == '0' else (h-1)%mod
h2 = (h2 * 2009 + int(s[i]) + 1) % mod2
pair2[h2] = (h2 + 1)%mod2 if s[i] == '0' else (h2-1)%mod2
h3 = (h3 * 3001 + int(s[i]) + 1) % mod3
pair3[h3] = (h3 + 1) % mod3 if s[i] == '0' else (h3 - 1) % mod3
dic[h] = i+1
dic2[h2] = i+1
dic[h3] = i+1
h_list.append(h)
h2_list.append(h2)
h3_list.append(h3)
g = 0
seen = defaultdict(int)
seen2 = defaultdict(int)
seen3 = defaultdict(int)
for i in range(M):
s, s2, s3 = h_list[i], h2_list[i], h3_list[i]
if seen[s] and seen2[s2] and seen3[s3]:
continue
t = pair[s]
t2 = pair2[s2]
t3 = pair3[s3]
if dic[t] == 0 or dic2[t2] == 0 or dic3[t3] == 0:
p = [dic[s], dic2[s2], dic3[s3]]
p.sort()
tmp = L - p[1] + 1
'''
if not seen[s]:
tmp = L - dic[s] + 1
elif not seen[s2]:
tmp = L - dic2[s2] + 1
else:
tmp = L - dic3[s3] + 1
'''
cnt = 0
while tmp % 2 == 0:
tmp //= 2
cnt += 1
g ^= (2**cnt)
#print(g, s, s2, t, t2, dic[t], dic2[t2])
seen[s] = 1
seen2[s2] = 1
seen3[s3] = 1
if g:
print('Alice')
else:
print('Bob')
if __name__ == '__main__':
main()
| def main():
import sys
input = sys.stdin.readline
class TreiNode:
def __init__(self, char_num, depth):
self.end = False
self.child = [None] * char_num
self.depth = depth
def __setitem__(self, i, x):
self.child[i] = x
def __getitem__(self, i):
return self.child[i]
class Trei:
def __init__(self, char_num):
self.root = TreiNode(char_num, 0)
self.char_num = char_num
def add(self, S):
v = self.root
for s in S:
if v[s] is None:
v[s] = TreiNode(self.char_num, v.depth + 1)
v = v[s]
v.end = True
def exist(self, S):
v = self.root
for s in S:
if v[s] is None:
return False
v = v[s]
if v.end:
return True
else:
return False
N, L = list(map(int, input().split()))
T = Trei(2)
for _ in range(N):
S = input().rstrip('\n')
S = [int(s) for s in S]
T.add(S)
g = 0
st = [T.root]
while st:
v = st.pop()
for i in range(2):
if v[i] is None:
d = L - v.depth
g ^= d & -d
else:
st.append(v[i])
if g:
print('Alice')
else:
print('Bob')
if __name__ == '__main__':
main()
| 80 | 65 | 2,183 | 1,549 | def main():
import sys
from collections import defaultdict
input = sys.stdin.readline
mod = 10**10 + 7
mod2 = 10**10 + 9
mod3 = 998244353
N, L = list(map(int, input().split()))
dic = defaultdict(int)
dic2 = defaultdict(int)
dic3 = defaultdict(int)
h_list = []
h2_list = []
h3_list = []
pair = {}
pair2 = {}
pair3 = {}
M = 0
for _ in range(N):
s = input().rstrip("\n")
h = 0
h2 = 0
h3 = 0
for i in range(len(s)):
M += 1
h = (h * 1007 + int(s[i]) + 1) % mod
pair[h] = (h + 1) % mod if s[i] == "0" else (h - 1) % mod
h2 = (h2 * 2009 + int(s[i]) + 1) % mod2
pair2[h2] = (h2 + 1) % mod2 if s[i] == "0" else (h2 - 1) % mod2
h3 = (h3 * 3001 + int(s[i]) + 1) % mod3
pair3[h3] = (h3 + 1) % mod3 if s[i] == "0" else (h3 - 1) % mod3
dic[h] = i + 1
dic2[h2] = i + 1
dic[h3] = i + 1
h_list.append(h)
h2_list.append(h2)
h3_list.append(h3)
g = 0
seen = defaultdict(int)
seen2 = defaultdict(int)
seen3 = defaultdict(int)
for i in range(M):
s, s2, s3 = h_list[i], h2_list[i], h3_list[i]
if seen[s] and seen2[s2] and seen3[s3]:
continue
t = pair[s]
t2 = pair2[s2]
t3 = pair3[s3]
if dic[t] == 0 or dic2[t2] == 0 or dic3[t3] == 0:
p = [dic[s], dic2[s2], dic3[s3]]
p.sort()
tmp = L - p[1] + 1
"""
if not seen[s]:
tmp = L - dic[s] + 1
elif not seen[s2]:
tmp = L - dic2[s2] + 1
else:
tmp = L - dic3[s3] + 1
"""
cnt = 0
while tmp % 2 == 0:
tmp //= 2
cnt += 1
g ^= 2**cnt
# print(g, s, s2, t, t2, dic[t], dic2[t2])
seen[s] = 1
seen2[s2] = 1
seen3[s3] = 1
if g:
print("Alice")
else:
print("Bob")
if __name__ == "__main__":
main()
| def main():
import sys
input = sys.stdin.readline
class TreiNode:
def __init__(self, char_num, depth):
self.end = False
self.child = [None] * char_num
self.depth = depth
def __setitem__(self, i, x):
self.child[i] = x
def __getitem__(self, i):
return self.child[i]
class Trei:
def __init__(self, char_num):
self.root = TreiNode(char_num, 0)
self.char_num = char_num
def add(self, S):
v = self.root
for s in S:
if v[s] is None:
v[s] = TreiNode(self.char_num, v.depth + 1)
v = v[s]
v.end = True
def exist(self, S):
v = self.root
for s in S:
if v[s] is None:
return False
v = v[s]
if v.end:
return True
else:
return False
N, L = list(map(int, input().split()))
T = Trei(2)
for _ in range(N):
S = input().rstrip("\n")
S = [int(s) for s in S]
T.add(S)
g = 0
st = [T.root]
while st:
v = st.pop()
for i in range(2):
if v[i] is None:
d = L - v.depth
g ^= d & -d
else:
st.append(v[i])
if g:
print("Alice")
else:
print("Bob")
if __name__ == "__main__":
main()
| false | 18.75 | [
"- from collections import defaultdict",
"- mod = 10**10 + 7",
"- mod2 = 10**10 + 9",
"- mod3 = 998244353",
"+",
"+ class TreiNode:",
"+ def __init__(self, char_num, depth):",
"+ self.end = False",
"+ self.child = [None] * char_num",
"+ self.depth = depth",
"+",
"+ def __setitem__(self, i, x):",
"+ self.child[i] = x",
"+",
"+ def __getitem__(self, i):",
"+ return self.child[i]",
"+",
"+ class Trei:",
"+ def __init__(self, char_num):",
"+ self.root = TreiNode(char_num, 0)",
"+ self.char_num = char_num",
"+",
"+ def add(self, S):",
"+ v = self.root",
"+ for s in S:",
"+ if v[s] is None:",
"+ v[s] = TreiNode(self.char_num, v.depth + 1)",
"+ v = v[s]",
"+ v.end = True",
"+",
"+ def exist(self, S):",
"+ v = self.root",
"+ for s in S:",
"+ if v[s] is None:",
"+ return False",
"+ v = v[s]",
"+ if v.end:",
"+ return True",
"+ else:",
"+ return False",
"+",
"- dic = defaultdict(int)",
"- dic2 = defaultdict(int)",
"- dic3 = defaultdict(int)",
"- h_list = []",
"- h2_list = []",
"- h3_list = []",
"- pair = {}",
"- pair2 = {}",
"- pair3 = {}",
"- M = 0",
"+ T = Trei(2)",
"- s = input().rstrip(\"\\n\")",
"- h = 0",
"- h2 = 0",
"- h3 = 0",
"- for i in range(len(s)):",
"- M += 1",
"- h = (h * 1007 + int(s[i]) + 1) % mod",
"- pair[h] = (h + 1) % mod if s[i] == \"0\" else (h - 1) % mod",
"- h2 = (h2 * 2009 + int(s[i]) + 1) % mod2",
"- pair2[h2] = (h2 + 1) % mod2 if s[i] == \"0\" else (h2 - 1) % mod2",
"- h3 = (h3 * 3001 + int(s[i]) + 1) % mod3",
"- pair3[h3] = (h3 + 1) % mod3 if s[i] == \"0\" else (h3 - 1) % mod3",
"- dic[h] = i + 1",
"- dic2[h2] = i + 1",
"- dic[h3] = i + 1",
"- h_list.append(h)",
"- h2_list.append(h2)",
"- h3_list.append(h3)",
"+ S = input().rstrip(\"\\n\")",
"+ S = [int(s) for s in S]",
"+ T.add(S)",
"- seen = defaultdict(int)",
"- seen2 = defaultdict(int)",
"- seen3 = defaultdict(int)",
"- for i in range(M):",
"- s, s2, s3 = h_list[i], h2_list[i], h3_list[i]",
"- if seen[s] and seen2[s2] and seen3[s3]:",
"- continue",
"- t = pair[s]",
"- t2 = pair2[s2]",
"- t3 = pair3[s3]",
"- if dic[t] == 0 or dic2[t2] == 0 or dic3[t3] == 0:",
"- p = [dic[s], dic2[s2], dic3[s3]]",
"- p.sort()",
"- tmp = L - p[1] + 1",
"- \"\"\"",
"- if not seen[s]:",
"- tmp = L - dic[s] + 1",
"- elif not seen[s2]:",
"- tmp = L - dic2[s2] + 1",
"+ st = [T.root]",
"+ while st:",
"+ v = st.pop()",
"+ for i in range(2):",
"+ if v[i] is None:",
"+ d = L - v.depth",
"+ g ^= d & -d",
"- tmp = L - dic3[s3] + 1",
"- \"\"\"",
"- cnt = 0",
"- while tmp % 2 == 0:",
"- tmp //= 2",
"- cnt += 1",
"- g ^= 2**cnt",
"- # print(g, s, s2, t, t2, dic[t], dic2[t2])",
"- seen[s] = 1",
"- seen2[s2] = 1",
"- seen3[s3] = 1",
"+ st.append(v[i])"
]
| false | 0.046658 | 0.036751 | 1.269563 | [
"s245667426",
"s435919789"
]
|
u268698968 | p03447 | python | s132970182 | s118834422 | 19 | 17 | 3,060 | 2,940 | Accepted | Accepted | 10.53 | import math
X = int(eval(input()))
price = [int(eval(input())) for i in range(2)]
haveMoney = X
haveMoney = X - price[0]
numDonuts = math.floor(haveMoney/price[1])
haveMoney = haveMoney - price[1] * numDonuts
print(haveMoney) | X = int(eval(input()))
price = [int(eval(input())) for i in range(2)]
print(((X-price[0])%price[1])) | 11 | 3 | 226 | 88 | import math
X = int(eval(input()))
price = [int(eval(input())) for i in range(2)]
haveMoney = X
haveMoney = X - price[0]
numDonuts = math.floor(haveMoney / price[1])
haveMoney = haveMoney - price[1] * numDonuts
print(haveMoney)
| X = int(eval(input()))
price = [int(eval(input())) for i in range(2)]
print(((X - price[0]) % price[1]))
| false | 72.727273 | [
"-import math",
"-",
"-haveMoney = X",
"-haveMoney = X - price[0]",
"-numDonuts = math.floor(haveMoney / price[1])",
"-haveMoney = haveMoney - price[1] * numDonuts",
"-print(haveMoney)",
"+print(((X - price[0]) % price[1]))"
]
| false | 0.161912 | 0.157695 | 1.026737 | [
"s132970182",
"s118834422"
]
|
u652656291 | p02702 | python | s722761094 | s979393144 | 352 | 112 | 9,200 | 11,972 | Accepted | Accepted | 68.18 | s,l = (eval(input()),2019)
m,a,r = ([1]+[0]*l,0,0)
for i,e in enumerate(s[::-1]):
a += int(e)*pow(10,i,l)
r += m[a%l]
m[a%l] += 1
print(r)
| s = list(map(int,list(eval(input()))))[::-1]
n = len(s)
chk = [0]*2019
chk[0] = 1
t,m,ans = 1,0,0
for i in s:
m = (m+t*i)%2019
ans += chk[m]
chk[m] += 1
t = t*10%2019
print(ans)
| 7 | 11 | 151 | 198 | s, l = (eval(input()), 2019)
m, a, r = ([1] + [0] * l, 0, 0)
for i, e in enumerate(s[::-1]):
a += int(e) * pow(10, i, l)
r += m[a % l]
m[a % l] += 1
print(r)
| s = list(map(int, list(eval(input()))))[::-1]
n = len(s)
chk = [0] * 2019
chk[0] = 1
t, m, ans = 1, 0, 0
for i in s:
m = (m + t * i) % 2019
ans += chk[m]
chk[m] += 1
t = t * 10 % 2019
print(ans)
| false | 36.363636 | [
"-s, l = (eval(input()), 2019)",
"-m, a, r = ([1] + [0] * l, 0, 0)",
"-for i, e in enumerate(s[::-1]):",
"- a += int(e) * pow(10, i, l)",
"- r += m[a % l]",
"- m[a % l] += 1",
"-print(r)",
"+s = list(map(int, list(eval(input()))))[::-1]",
"+n = len(s)",
"+chk = [0] * 2019",
"+chk[0] = 1",
"+t, m, ans = 1, 0, 0",
"+for i in s:",
"+ m = (m + t * i) % 2019",
"+ ans += chk[m]",
"+ chk[m] += 1",
"+ t = t * 10 % 2019",
"+print(ans)"
]
| false | 0.038958 | 0.079349 | 0.490979 | [
"s722761094",
"s979393144"
]
|
u391589398 | p02574 | python | s520416159 | s210219152 | 772 | 376 | 220,364 | 224,668 | Accepted | Accepted | 51.3 | N = int(eval(input()))
A = tuple(map(int, input().split()))
def p(n):
""" """
min_facts = [0] * (n+1)
is_prime = [True] * (n+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n+1):
if not is_prime[i]:
continue
min_facts[i] = i
for j in range(i*2, n+1, i):
is_prime[j] = False
if min_facts[j] == 0:
min_facts[j] = i
return min_facts
min_facts = p(max(A))
fact_counts = dict()
for a in A:
appeared = set()
while min_facts[a] > 0:
f = min_facts[a]
if not f in appeared:
fact_counts.setdefault(f, 0)
fact_counts[f] += 1
appeared.add(f)
a //= f
pairwise = True
for c in list(fact_counts.values()):
if c > 1:
pairwise = False
break
if pairwise:
print('pairwise coprime')
else:
if max(fact_counts.values()) == N:
print('not coprime')
else:
print('setwise coprime')
| n = int(eval(input()))
A = tuple(map(int, input().split()))
maxa = max(A)
cnt = [0] * (maxa + 1)
for a in A:
cnt[a] += 1
from math import gcd
from functools import reduce
if reduce(gcd, A) != 1:
print('not coprime')
else:
for i in range(2, maxa+1):
if sum(cnt[i::i]) > 1:
print('setwise coprime')
break
else:
print('pairwise coprime')
| 44 | 18 | 1,032 | 403 | N = int(eval(input()))
A = tuple(map(int, input().split()))
def p(n):
""" """
min_facts = [0] * (n + 1)
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
if not is_prime[i]:
continue
min_facts[i] = i
for j in range(i * 2, n + 1, i):
is_prime[j] = False
if min_facts[j] == 0:
min_facts[j] = i
return min_facts
min_facts = p(max(A))
fact_counts = dict()
for a in A:
appeared = set()
while min_facts[a] > 0:
f = min_facts[a]
if not f in appeared:
fact_counts.setdefault(f, 0)
fact_counts[f] += 1
appeared.add(f)
a //= f
pairwise = True
for c in list(fact_counts.values()):
if c > 1:
pairwise = False
break
if pairwise:
print("pairwise coprime")
else:
if max(fact_counts.values()) == N:
print("not coprime")
else:
print("setwise coprime")
| n = int(eval(input()))
A = tuple(map(int, input().split()))
maxa = max(A)
cnt = [0] * (maxa + 1)
for a in A:
cnt[a] += 1
from math import gcd
from functools import reduce
if reduce(gcd, A) != 1:
print("not coprime")
else:
for i in range(2, maxa + 1):
if sum(cnt[i::i]) > 1:
print("setwise coprime")
break
else:
print("pairwise coprime")
| false | 59.090909 | [
"-N = int(eval(input()))",
"+n = int(eval(input()))",
"+maxa = max(A)",
"+cnt = [0] * (maxa + 1)",
"+for a in A:",
"+ cnt[a] += 1",
"+from math import gcd",
"+from functools import reduce",
"-",
"-def p(n):",
"- \"\"\" \"\"\"",
"- min_facts = [0] * (n + 1)",
"- is_prime = [True] * (n + 1)",
"- is_prime[0] = False",
"- is_prime[1] = False",
"- for i in range(2, n + 1):",
"- if not is_prime[i]:",
"- continue",
"- min_facts[i] = i",
"- for j in range(i * 2, n + 1, i):",
"- is_prime[j] = False",
"- if min_facts[j] == 0:",
"- min_facts[j] = i",
"- return min_facts",
"-",
"-",
"-min_facts = p(max(A))",
"-fact_counts = dict()",
"-for a in A:",
"- appeared = set()",
"- while min_facts[a] > 0:",
"- f = min_facts[a]",
"- if not f in appeared:",
"- fact_counts.setdefault(f, 0)",
"- fact_counts[f] += 1",
"- appeared.add(f)",
"- a //= f",
"-pairwise = True",
"-for c in list(fact_counts.values()):",
"- if c > 1:",
"- pairwise = False",
"- break",
"-if pairwise:",
"- print(\"pairwise coprime\")",
"+if reduce(gcd, A) != 1:",
"+ print(\"not coprime\")",
"- if max(fact_counts.values()) == N:",
"- print(\"not coprime\")",
"+ for i in range(2, maxa + 1):",
"+ if sum(cnt[i::i]) > 1:",
"+ print(\"setwise coprime\")",
"+ break",
"- print(\"setwise coprime\")",
"+ print(\"pairwise coprime\")"
]
| false | 0.100498 | 0.046283 | 2.17141 | [
"s520416159",
"s210219152"
]
|
u340781749 | p03576 | python | s325277183 | s022712892 | 206 | 26 | 3,064 | 3,064 | Accepted | Accepted | 87.38 | n, k = list(map(int, input().split()))
sx, sy = [], []
for i in range(n):
x, y = list(map(int, input().split()))
sx.append((x, i))
sy.append((y, i))
sx.sort()
sy.sort()
px = [[0] for _ in range(n)]
for cx, (x, i) in enumerate(sx):
px[i] = cx
acm = [[0] * (n + 1) for _ in range(n + 1)]
for cy, (y, i) in enumerate(sy):
for cx in range(n):
acm[cx][cy] = acm[cx - 1][cy] + acm[cx][cy - 1] - acm[cx - 1][cy - 1] + int(px[i] == cx)
ans = 5e18
for lcx in range(n - k + 1):
for lcy in range(n - k + 1):
acm_l = acm[lcx - 1][lcy - 1]
for ucx in range(lcx + k - 1, n):
for ucy in range(lcy + k - 1, n):
if acm[ucx][ucy] - acm[ucx][lcy - 1] - acm[lcx - 1][ucy] + acm_l >= k:
ans = min(ans, (sx[ucx][0] - sx[lcx][0]) * (sy[ucy][0] - sy[lcy][0]))
break
print(ans)
| n, k = list(map(int, input().split()))
ps = [tuple(map(int, input().split())) for i in range(n)]
sx = sorted(ps)
nx = list(enumerate(sx))
ans = 5e18
for l, (x1, y1) in nx[:n - k + 1]:
for r, (x2, y2) in nx[l + k - 1:]:
dx = x2 - x1
sy = sorted(y for x, y in sx[l:r + 1])
for y3, y4 in zip(sy, sy[k - 1:]):
if y3 <= y1 and y2 <= y4:
ans = min(ans, dx * (y4 - y3))
print(ans)
| 27 | 14 | 885 | 438 | n, k = list(map(int, input().split()))
sx, sy = [], []
for i in range(n):
x, y = list(map(int, input().split()))
sx.append((x, i))
sy.append((y, i))
sx.sort()
sy.sort()
px = [[0] for _ in range(n)]
for cx, (x, i) in enumerate(sx):
px[i] = cx
acm = [[0] * (n + 1) for _ in range(n + 1)]
for cy, (y, i) in enumerate(sy):
for cx in range(n):
acm[cx][cy] = (
acm[cx - 1][cy] + acm[cx][cy - 1] - acm[cx - 1][cy - 1] + int(px[i] == cx)
)
ans = 5e18
for lcx in range(n - k + 1):
for lcy in range(n - k + 1):
acm_l = acm[lcx - 1][lcy - 1]
for ucx in range(lcx + k - 1, n):
for ucy in range(lcy + k - 1, n):
if acm[ucx][ucy] - acm[ucx][lcy - 1] - acm[lcx - 1][ucy] + acm_l >= k:
ans = min(
ans, (sx[ucx][0] - sx[lcx][0]) * (sy[ucy][0] - sy[lcy][0])
)
break
print(ans)
| n, k = list(map(int, input().split()))
ps = [tuple(map(int, input().split())) for i in range(n)]
sx = sorted(ps)
nx = list(enumerate(sx))
ans = 5e18
for l, (x1, y1) in nx[: n - k + 1]:
for r, (x2, y2) in nx[l + k - 1 :]:
dx = x2 - x1
sy = sorted(y for x, y in sx[l : r + 1])
for y3, y4 in zip(sy, sy[k - 1 :]):
if y3 <= y1 and y2 <= y4:
ans = min(ans, dx * (y4 - y3))
print(ans)
| false | 48.148148 | [
"-sx, sy = [], []",
"-for i in range(n):",
"- x, y = list(map(int, input().split()))",
"- sx.append((x, i))",
"- sy.append((y, i))",
"-sx.sort()",
"-sy.sort()",
"-px = [[0] for _ in range(n)]",
"-for cx, (x, i) in enumerate(sx):",
"- px[i] = cx",
"-acm = [[0] * (n + 1) for _ in range(n + 1)]",
"-for cy, (y, i) in enumerate(sy):",
"- for cx in range(n):",
"- acm[cx][cy] = (",
"- acm[cx - 1][cy] + acm[cx][cy - 1] - acm[cx - 1][cy - 1] + int(px[i] == cx)",
"- )",
"+ps = [tuple(map(int, input().split())) for i in range(n)]",
"+sx = sorted(ps)",
"+nx = list(enumerate(sx))",
"-for lcx in range(n - k + 1):",
"- for lcy in range(n - k + 1):",
"- acm_l = acm[lcx - 1][lcy - 1]",
"- for ucx in range(lcx + k - 1, n):",
"- for ucy in range(lcy + k - 1, n):",
"- if acm[ucx][ucy] - acm[ucx][lcy - 1] - acm[lcx - 1][ucy] + acm_l >= k:",
"- ans = min(",
"- ans, (sx[ucx][0] - sx[lcx][0]) * (sy[ucy][0] - sy[lcy][0])",
"- )",
"- break",
"+for l, (x1, y1) in nx[: n - k + 1]:",
"+ for r, (x2, y2) in nx[l + k - 1 :]:",
"+ dx = x2 - x1",
"+ sy = sorted(y for x, y in sx[l : r + 1])",
"+ for y3, y4 in zip(sy, sy[k - 1 :]):",
"+ if y3 <= y1 and y2 <= y4:",
"+ ans = min(ans, dx * (y4 - y3))"
]
| false | 0.046211 | 0.03824 | 1.208466 | [
"s325277183",
"s022712892"
]
|
u620084012 | p04025 | python | s228601044 | s527087212 | 178 | 25 | 39,024 | 2,940 | Accepted | Accepted | 85.96 | import sys
def main():
def input():
return sys.stdin.readline()[:-1]
N = int(eval(input()))
a = list(map(int,input().split()))
ans = 1000000
for k in range(-100,101):
t = 0
for e in a:
t += (e-k)**2
ans = min(ans,t)
print(ans)
if __name__ == '__main__':
main()
| N = int(eval(input()))
a = list(map(int,input().split()))
ans = 10**12
for k in range(-100,101):
temp = 0
for e in a:
temp += (k-e)**2
ans = min(ans,temp)
print(ans)
| 16 | 9 | 343 | 188 | import sys
def main():
def input():
return sys.stdin.readline()[:-1]
N = int(eval(input()))
a = list(map(int, input().split()))
ans = 1000000
for k in range(-100, 101):
t = 0
for e in a:
t += (e - k) ** 2
ans = min(ans, t)
print(ans)
if __name__ == "__main__":
main()
| N = int(eval(input()))
a = list(map(int, input().split()))
ans = 10**12
for k in range(-100, 101):
temp = 0
for e in a:
temp += (k - e) ** 2
ans = min(ans, temp)
print(ans)
| false | 43.75 | [
"-import sys",
"-",
"-",
"-def main():",
"- def input():",
"- return sys.stdin.readline()[:-1]",
"-",
"- N = int(eval(input()))",
"- a = list(map(int, input().split()))",
"- ans = 1000000",
"- for k in range(-100, 101):",
"- t = 0",
"- for e in a:",
"- t += (e - k) ** 2",
"- ans = min(ans, t)",
"- print(ans)",
"-",
"-",
"-if __name__ == \"__main__\":",
"- main()",
"+N = int(eval(input()))",
"+a = list(map(int, input().split()))",
"+ans = 10**12",
"+for k in range(-100, 101):",
"+ temp = 0",
"+ for e in a:",
"+ temp += (k - e) ** 2",
"+ ans = min(ans, temp)",
"+print(ans)"
]
| false | 0.044974 | 0.115975 | 0.387788 | [
"s228601044",
"s527087212"
]
|
u393512980 | p03295 | python | s317907778 | s009018285 | 1,986 | 1,614 | 64,260 | 60,064 | Accepted | Accepted | 18.73 | def main():
N, M = list(map(int, input().split()))
a_b = sorted([list(map(int, input().split())) for _ in range(M)])
used = [0] * M
ans = 0
for i in range(M):
k = M - i - 1
if used[k]:
continue
used[k], c = 1, a_b[k][0]
for j in range(k):
if a_b[j][0] <= c < a_b[j][1]:
used[j] = 1
ans += 1
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def main():
N, M = list(map(int, input().split()))
a_b = sorted([list(map(int, input().split())) for _ in range(M)])
used = [0] * M
ans = 0
for i in range(M):
k = M - i - 1
if used[k]:
continue
used[k], c = 1, a_b[k][0]
for j in range(k):
if a_b[j][0] <= c < a_b[j][1]:
used[j] = 1
ans += 1
print(ans)
if __name__ == "__main__":
main() | 18 | 21 | 456 | 497 | def main():
N, M = list(map(int, input().split()))
a_b = sorted([list(map(int, input().split())) for _ in range(M)])
used = [0] * M
ans = 0
for i in range(M):
k = M - i - 1
if used[k]:
continue
used[k], c = 1, a_b[k][0]
for j in range(k):
if a_b[j][0] <= c < a_b[j][1]:
used[j] = 1
ans += 1
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def main():
N, M = list(map(int, input().split()))
a_b = sorted([list(map(int, input().split())) for _ in range(M)])
used = [0] * M
ans = 0
for i in range(M):
k = M - i - 1
if used[k]:
continue
used[k], c = 1, a_b[k][0]
for j in range(k):
if a_b[j][0] <= c < a_b[j][1]:
used[j] = 1
ans += 1
print(ans)
if __name__ == "__main__":
main()
| false | 14.285714 | [
"+import sys",
"+",
"+input = sys.stdin.readline",
"+",
"+"
]
| false | 0.039291 | 0.037931 | 1.035844 | [
"s317907778",
"s009018285"
]
|
u071680334 | p02821 | python | s122406031 | s343444401 | 1,198 | 819 | 14,268 | 20,560 | Accepted | Accepted | 31.64 | from bisect import bisect_left
def main():
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
b = [0]*(n+1)
for i in range(n):
b[i+1] = a[i] + b[i]
ok = 0; ng = 2 * 10**5 + 5
while ok+1 < ng:
mid = (ok + 1 + ng) // 2
buf = 0
for i in range(n):
p = mid - a[i]
buf += n - bisect_left(a, p)
if buf >= m:
ok = mid
else:
ng = mid
ans = 0
num = 0
tot = 0
for i in range(n):
p = ok - a[i]
index = bisect_left(a, p)
num += n - index
tot += b[n] - b[index]
tot += a[i] * (n-index)
ans = tot - (num - m) * ok
print(ans)
if __name__ == "__main__":
main() | from bisect import bisect_left
def main():
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
L, R = 0, 2 * 10**5 + 1
while L+1 < R:
P = (L+R)//2
cnt = 0
for v in a:
x = P - v
cnt += n - bisect_left(a, x)
if cnt >= m:
L = P
else:
R = P
csum = [0]
for v in a:
csum.append(v)
for i in range(n):
csum[i+1] += csum[i]
ans = 0
cnt = 0
for v in a:
x = L - v
idx = bisect_left(a, x)
cnt += n-idx
ans += csum[-1] - csum[idx]
ans += v * (n - idx)
ans -= (cnt - m) * L
print(ans)
if __name__ == "__main__":
main() | 33 | 35 | 795 | 766 | from bisect import bisect_left
def main():
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
b = [0] * (n + 1)
for i in range(n):
b[i + 1] = a[i] + b[i]
ok = 0
ng = 2 * 10**5 + 5
while ok + 1 < ng:
mid = (ok + 1 + ng) // 2
buf = 0
for i in range(n):
p = mid - a[i]
buf += n - bisect_left(a, p)
if buf >= m:
ok = mid
else:
ng = mid
ans = 0
num = 0
tot = 0
for i in range(n):
p = ok - a[i]
index = bisect_left(a, p)
num += n - index
tot += b[n] - b[index]
tot += a[i] * (n - index)
ans = tot - (num - m) * ok
print(ans)
if __name__ == "__main__":
main()
| from bisect import bisect_left
def main():
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
L, R = 0, 2 * 10**5 + 1
while L + 1 < R:
P = (L + R) // 2
cnt = 0
for v in a:
x = P - v
cnt += n - bisect_left(a, x)
if cnt >= m:
L = P
else:
R = P
csum = [0]
for v in a:
csum.append(v)
for i in range(n):
csum[i + 1] += csum[i]
ans = 0
cnt = 0
for v in a:
x = L - v
idx = bisect_left(a, x)
cnt += n - idx
ans += csum[-1] - csum[idx]
ans += v * (n - idx)
ans -= (cnt - m) * L
print(ans)
if __name__ == "__main__":
main()
| false | 5.714286 | [
"- b = [0] * (n + 1)",
"+ L, R = 0, 2 * 10**5 + 1",
"+ while L + 1 < R:",
"+ P = (L + R) // 2",
"+ cnt = 0",
"+ for v in a:",
"+ x = P - v",
"+ cnt += n - bisect_left(a, x)",
"+ if cnt >= m:",
"+ L = P",
"+ else:",
"+ R = P",
"+ csum = [0]",
"+ for v in a:",
"+ csum.append(v)",
"- b[i + 1] = a[i] + b[i]",
"- ok = 0",
"- ng = 2 * 10**5 + 5",
"- while ok + 1 < ng:",
"- mid = (ok + 1 + ng) // 2",
"- buf = 0",
"- for i in range(n):",
"- p = mid - a[i]",
"- buf += n - bisect_left(a, p)",
"- if buf >= m:",
"- ok = mid",
"- else:",
"- ng = mid",
"+ csum[i + 1] += csum[i]",
"- num = 0",
"- tot = 0",
"- for i in range(n):",
"- p = ok - a[i]",
"- index = bisect_left(a, p)",
"- num += n - index",
"- tot += b[n] - b[index]",
"- tot += a[i] * (n - index)",
"- ans = tot - (num - m) * ok",
"+ cnt = 0",
"+ for v in a:",
"+ x = L - v",
"+ idx = bisect_left(a, x)",
"+ cnt += n - idx",
"+ ans += csum[-1] - csum[idx]",
"+ ans += v * (n - idx)",
"+ ans -= (cnt - m) * L"
]
| false | 0.035674 | 0.042537 | 0.83865 | [
"s122406031",
"s343444401"
]
|
u077291787 | p03761 | python | s863449199 | s018483954 | 29 | 25 | 3,768 | 3,768 | Accepted | Accepted | 13.79 | # ABC058C - 怪文書 / Dubious Document (ARC071C)
import sys
input = sys.stdin.readline
from collections import OrderedDict
from string import ascii_lowercase
def main():
n = int(eval(input()))
lst = [input().rstrip() for _ in range(n)]
cnt = OrderedDict.fromkeys(ascii_lowercase, 0)
for i in lst[0]:
cnt[i] += 1
for i in lst[1:]:
tmp = OrderedDict.fromkeys(ascii_lowercase, 0)
for j in i:
tmp[j] += 1
for i in list(cnt.keys()):
cnt[i] = min(cnt[i], tmp[i])
ans = ""
for i, j in list(cnt.items()):
ans += i * j
print(ans)
if __name__ == "__main__":
main() | # ABC058C - 怪文書 / Dubious Document (ARC071C)
from collections import Counter
from string import ascii_lowercase
def main():
N = int(eval(input()))
D = tuple(Counter(eval(input())) for _ in range(N))
ans = ""
for s in ascii_lowercase:
if all(s in d for d in D):
ans += s * min(d[s] for d in D)
print(ans)
if __name__ == "__main__":
main() | 30 | 17 | 668 | 389 | # ABC058C - 怪文書 / Dubious Document (ARC071C)
import sys
input = sys.stdin.readline
from collections import OrderedDict
from string import ascii_lowercase
def main():
n = int(eval(input()))
lst = [input().rstrip() for _ in range(n)]
cnt = OrderedDict.fromkeys(ascii_lowercase, 0)
for i in lst[0]:
cnt[i] += 1
for i in lst[1:]:
tmp = OrderedDict.fromkeys(ascii_lowercase, 0)
for j in i:
tmp[j] += 1
for i in list(cnt.keys()):
cnt[i] = min(cnt[i], tmp[i])
ans = ""
for i, j in list(cnt.items()):
ans += i * j
print(ans)
if __name__ == "__main__":
main()
| # ABC058C - 怪文書 / Dubious Document (ARC071C)
from collections import Counter
from string import ascii_lowercase
def main():
N = int(eval(input()))
D = tuple(Counter(eval(input())) for _ in range(N))
ans = ""
for s in ascii_lowercase:
if all(s in d for d in D):
ans += s * min(d[s] for d in D)
print(ans)
if __name__ == "__main__":
main()
| false | 43.333333 | [
"-import sys",
"-",
"-input = sys.stdin.readline",
"-from collections import OrderedDict",
"+from collections import Counter",
"- n = int(eval(input()))",
"- lst = [input().rstrip() for _ in range(n)]",
"- cnt = OrderedDict.fromkeys(ascii_lowercase, 0)",
"- for i in lst[0]:",
"- cnt[i] += 1",
"- for i in lst[1:]:",
"- tmp = OrderedDict.fromkeys(ascii_lowercase, 0)",
"- for j in i:",
"- tmp[j] += 1",
"- for i in list(cnt.keys()):",
"- cnt[i] = min(cnt[i], tmp[i])",
"+ N = int(eval(input()))",
"+ D = tuple(Counter(eval(input())) for _ in range(N))",
"- for i, j in list(cnt.items()):",
"- ans += i * j",
"+ for s in ascii_lowercase:",
"+ if all(s in d for d in D):",
"+ ans += s * min(d[s] for d in D)"
]
| false | 0.098757 | 0.050101 | 1.971171 | [
"s863449199",
"s018483954"
]
|
u389910364 | p03290 | python | s636265444 | s915615833 | 467 | 160 | 15,660 | 12,532 | Accepted | Accepted | 65.74 | import bisect
import heapq
import itertools
import math
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter
import numpy as np
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
D, G = list(map(int, sys.stdin.readline().split()))
P, C = list(zip(*[list(map(int, sys.stdin.readline().split())) for _ in range(D)]))
P = np.array(P, dtype=int)
C = np.array(C, dtype=int)
A = np.arange(1, D + 1, dtype=int) * 100 # 1問のスコア
comp_scores = P * A + C
ans = P.sum()
for i in range(D):
# i: 途中まで解く
# comp: True ならその問題は全部解く
for comp in itertools.product([True, False], repeat=D):
comp = np.array(comp)
comp[i] = False
cnt = P[comp].sum()
score = comp_scores[comp].sum()
add_cnt = max(0, min(P[i] - 1, math.ceil((G - score) / A[i])))
add_score = A[i] * add_cnt
if score + add_score >= G:
ans = min(ans, cnt + add_cnt)
print(ans)
| import itertools
import os
import sys
import numpy as np
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
D, G = list(map(int, sys.stdin.readline().split()))
P, C = list(zip(*[list(map(int, sys.stdin.readline().split())) for _ in range(D)]))
P = np.array(P, dtype=int)
C = np.array(C, dtype=int)
A = np.arange(1, D + 1, dtype=int) * 100 # 1問のスコア
comp_scores = P * A + C
# ans = P.sum()
# for i in range(D):
# # i: 途中まで解く
# # comp: True ならその問題は全部解く
# for comp in itertools.product([True, False], repeat=D):
# comp = np.array(comp)
# comp[i] = False
# cnt = P[comp].sum()
# score = comp_scores[comp].sum()
# add_cnt = max(0, min(P[i] - 1, math.ceil((G - score) / A[i])))
# add_score = A[i] * add_cnt
# if score + add_score >= G:
# ans = min(ans, cnt + add_cnt)
# print(ans)
ans = P.sum()
for i in range(D):
# i: 途中まで解く
# True なら全部解く、False なら 1 問も説かない
patterns = np.array(list(itertools.product([True, False], repeat=D)))
patterns[:, i] = False
cnt = np.dot(patterns, P)
score = np.dot(patterns, comp_scores)
add_cnt = np.maximum(0, np.minimum(P[i] - 1, np.ceil((G - score) / A[i])))
add_score = A[i] * add_cnt
ok = score + add_score >= G
if any(ok):
ans = min(ans, ((cnt + add_cnt)[ok]).min())
print((int(ans)))
| 46 | 52 | 1,209 | 1,488 | import bisect
import heapq
import itertools
import math
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter
import numpy as np
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10**18
MOD = 10**9 + 7
D, G = list(map(int, sys.stdin.readline().split()))
P, C = list(zip(*[list(map(int, sys.stdin.readline().split())) for _ in range(D)]))
P = np.array(P, dtype=int)
C = np.array(C, dtype=int)
A = np.arange(1, D + 1, dtype=int) * 100 # 1問のスコア
comp_scores = P * A + C
ans = P.sum()
for i in range(D):
# i: 途中まで解く
# comp: True ならその問題は全部解く
for comp in itertools.product([True, False], repeat=D):
comp = np.array(comp)
comp[i] = False
cnt = P[comp].sum()
score = comp_scores[comp].sum()
add_cnt = max(0, min(P[i] - 1, math.ceil((G - score) / A[i])))
add_score = A[i] * add_cnt
if score + add_score >= G:
ans = min(ans, cnt + add_cnt)
print(ans)
| import itertools
import os
import sys
import numpy as np
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10**18
MOD = 10**9 + 7
D, G = list(map(int, sys.stdin.readline().split()))
P, C = list(zip(*[list(map(int, sys.stdin.readline().split())) for _ in range(D)]))
P = np.array(P, dtype=int)
C = np.array(C, dtype=int)
A = np.arange(1, D + 1, dtype=int) * 100 # 1問のスコア
comp_scores = P * A + C
# ans = P.sum()
# for i in range(D):
# # i: 途中まで解く
# # comp: True ならその問題は全部解く
# for comp in itertools.product([True, False], repeat=D):
# comp = np.array(comp)
# comp[i] = False
# cnt = P[comp].sum()
# score = comp_scores[comp].sum()
# add_cnt = max(0, min(P[i] - 1, math.ceil((G - score) / A[i])))
# add_score = A[i] * add_cnt
# if score + add_score >= G:
# ans = min(ans, cnt + add_cnt)
# print(ans)
ans = P.sum()
for i in range(D):
# i: 途中まで解く
# True なら全部解く、False なら 1 問も説かない
patterns = np.array(list(itertools.product([True, False], repeat=D)))
patterns[:, i] = False
cnt = np.dot(patterns, P)
score = np.dot(patterns, comp_scores)
add_cnt = np.maximum(0, np.minimum(P[i] - 1, np.ceil((G - score) / A[i])))
add_score = A[i] * add_cnt
ok = score + add_score >= G
if any(ok):
ans = min(ans, ((cnt + add_cnt)[ok]).min())
print((int(ans)))
| false | 11.538462 | [
"-import bisect",
"-import heapq",
"-import math",
"-import re",
"-import string",
"-from collections import Counter, deque, defaultdict",
"-from decimal import Decimal",
"-from fractions import gcd",
"-from functools import lru_cache, reduce",
"-from operator import itemgetter",
"+# ans = P.sum()",
"+# for i in range(D):",
"+# # i: 途中まで解く",
"+# # comp: True ならその問題は全部解く",
"+# for comp in itertools.product([True, False], repeat=D):",
"+# comp = np.array(comp)",
"+# comp[i] = False",
"+# cnt = P[comp].sum()",
"+# score = comp_scores[comp].sum()",
"+# add_cnt = max(0, min(P[i] - 1, math.ceil((G - score) / A[i])))",
"+# add_score = A[i] * add_cnt",
"+# if score + add_score >= G:",
"+# ans = min(ans, cnt + add_cnt)",
"+# print(ans)",
"- # comp: True ならその問題は全部解く",
"- for comp in itertools.product([True, False], repeat=D):",
"- comp = np.array(comp)",
"- comp[i] = False",
"- cnt = P[comp].sum()",
"- score = comp_scores[comp].sum()",
"- add_cnt = max(0, min(P[i] - 1, math.ceil((G - score) / A[i])))",
"- add_score = A[i] * add_cnt",
"- if score + add_score >= G:",
"- ans = min(ans, cnt + add_cnt)",
"-print(ans)",
"+ # True なら全部解く、False なら 1 問も説かない",
"+ patterns = np.array(list(itertools.product([True, False], repeat=D)))",
"+ patterns[:, i] = False",
"+ cnt = np.dot(patterns, P)",
"+ score = np.dot(patterns, comp_scores)",
"+ add_cnt = np.maximum(0, np.minimum(P[i] - 1, np.ceil((G - score) / A[i])))",
"+ add_score = A[i] * add_cnt",
"+ ok = score + add_score >= G",
"+ if any(ok):",
"+ ans = min(ans, ((cnt + add_cnt)[ok]).min())",
"+print((int(ans)))"
]
| false | 0.251863 | 0.240221 | 1.048462 | [
"s636265444",
"s915615833"
]
|
u294922877 | p02381 | python | s496051290 | s847487171 | 50 | 20 | 7,096 | 5,708 | Accepted | Accepted | 60 | from math import sqrt
from statistics import mean
def standard_deviate(numbers):
m = mean(numbers)
b = sum([(n - m)**2 for n in numbers])
return sqrt(b/len(numbers))
if __name__ == '__main__':
while True:
n = int(eval(input()))
if n == 0:
break
students = list(map(int, input().split()))[0:n]
print((standard_deviate(students)))
| from math import sqrt
def standard_deviate(numbers):
m = sum(numbers) / len(numbers)
d = sqrt(sum([(n - m)**2 for n in numbers]) / len(numbers))
return d
if __name__ == '__main__':
while eval(input()) != '0':
students = list(map(int, input().split()))
print((standard_deviate(students)))
| 16 | 12 | 399 | 326 | from math import sqrt
from statistics import mean
def standard_deviate(numbers):
m = mean(numbers)
b = sum([(n - m) ** 2 for n in numbers])
return sqrt(b / len(numbers))
if __name__ == "__main__":
while True:
n = int(eval(input()))
if n == 0:
break
students = list(map(int, input().split()))[0:n]
print((standard_deviate(students)))
| from math import sqrt
def standard_deviate(numbers):
m = sum(numbers) / len(numbers)
d = sqrt(sum([(n - m) ** 2 for n in numbers]) / len(numbers))
return d
if __name__ == "__main__":
while eval(input()) != "0":
students = list(map(int, input().split()))
print((standard_deviate(students)))
| false | 25 | [
"-from statistics import mean",
"- m = mean(numbers)",
"- b = sum([(n - m) ** 2 for n in numbers])",
"- return sqrt(b / len(numbers))",
"+ m = sum(numbers) / len(numbers)",
"+ d = sqrt(sum([(n - m) ** 2 for n in numbers]) / len(numbers))",
"+ return d",
"- while True:",
"- n = int(eval(input()))",
"- if n == 0:",
"- break",
"- students = list(map(int, input().split()))[0:n]",
"+ while eval(input()) != \"0\":",
"+ students = list(map(int, input().split()))"
]
| false | 0.062942 | 0.0399 | 1.577501 | [
"s496051290",
"s847487171"
]
|
u729133443 | p02552 | python | s111066993 | s415753795 | 32 | 26 | 9,204 | 9,152 | Accepted | Accepted | 18.75 | print((1-int(eval(input())))) | print((+(eval(input())<'1'))) | 1 | 1 | 21 | 21 | print((1 - int(eval(input()))))
| print((+(eval(input()) < "1")))
| false | 0 | [
"-print((1 - int(eval(input()))))",
"+print((+(eval(input()) < \"1\")))"
]
| false | 0.113472 | 0.117234 | 0.967913 | [
"s111066993",
"s415753795"
]
|
u659712937 | p03281 | python | s753141897 | s406742098 | 168 | 66 | 38,384 | 61,892 | Accepted | Accepted | 60.71 | n=int(eval(input()))
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
ans=0
for i in range(1,n+1):
if i % 2 == 1:
l=make_divisors(i)
if len(l)==8:
ans+=1
print(ans) | n=int(eval(input()))
def count_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return len(lower_divisors + upper_divisors[::-1])
ans=0
for i in range(1,n+1):
if i%2==1:
c=count_divisors(i)
if c==8:
ans+=1
#print(i)
print(ans) | 22 | 22 | 443 | 478 | n = int(eval(input()))
def make_divisors(n):
lower_divisors, upper_divisors = [], []
i = 1
while i * i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n // i)
i += 1
return lower_divisors + upper_divisors[::-1]
ans = 0
for i in range(1, n + 1):
if i % 2 == 1:
l = make_divisors(i)
if len(l) == 8:
ans += 1
print(ans)
| n = int(eval(input()))
def count_divisors(n):
lower_divisors, upper_divisors = [], []
i = 1
while i * i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n // i)
i += 1
return len(lower_divisors + upper_divisors[::-1])
ans = 0
for i in range(1, n + 1):
if i % 2 == 1:
c = count_divisors(i)
if c == 8:
ans += 1
# print(i)
print(ans)
| false | 0 | [
"-def make_divisors(n):",
"+def count_divisors(n):",
"- return lower_divisors + upper_divisors[::-1]",
"+ return len(lower_divisors + upper_divisors[::-1])",
"- l = make_divisors(i)",
"- if len(l) == 8:",
"+ c = count_divisors(i)",
"+ if c == 8:",
"+ # print(i)"
]
| false | 0.068435 | 0.085048 | 0.804667 | [
"s753141897",
"s406742098"
]
|
u711539583 | p02936 | python | s364152547 | s691174622 | 1,889 | 790 | 237,732 | 128,376 | Accepted | Accepted | 58.18 | import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
n, q = list(map(int, input().split()))
d = [[] for _ in range(n)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
d[a].append(b)
d[b].append(a)
d2 = [0] * n
for _ in range(q):
p, x = list(map(int, input().split()))
d2[p-1] += x
ans = [0] * n
def dfs(cur, pre, point):
point += d2[cur]
ans[cur] = point
for e in d[cur]:
if e != pre:
dfs(e, cur, point)
dfs(0, -1, 0)
print((" ".join(map(str, ans))))
| import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
n, q = list(map(int, input().split()))
d = [[] for _ in range(n)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
d[a].append(b)
d[b].append(a)
d2 = [0] * n
for _ in range(q):
p, x = list(map(int, input().split()))
d2[p-1] += x
ans = [0] * n
from collections import deque
def dfs(cur, pre, point):
stack = deque([[cur, pre, point]])
while stack:
cur, pre, point = stack.pop()
point += d2[cur]
ans[cur] = point
for e in d[cur]:
if e != pre:
stack.append([e, cur, point])
dfs(0, -1, 0)
print((" ".join(map(str, ans))))
| 26 | 32 | 558 | 721 | import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
n, q = list(map(int, input().split()))
d = [[] for _ in range(n)]
for _ in range(n - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
d[a].append(b)
d[b].append(a)
d2 = [0] * n
for _ in range(q):
p, x = list(map(int, input().split()))
d2[p - 1] += x
ans = [0] * n
def dfs(cur, pre, point):
point += d2[cur]
ans[cur] = point
for e in d[cur]:
if e != pre:
dfs(e, cur, point)
dfs(0, -1, 0)
print((" ".join(map(str, ans))))
| import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
n, q = list(map(int, input().split()))
d = [[] for _ in range(n)]
for _ in range(n - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
d[a].append(b)
d[b].append(a)
d2 = [0] * n
for _ in range(q):
p, x = list(map(int, input().split()))
d2[p - 1] += x
ans = [0] * n
from collections import deque
def dfs(cur, pre, point):
stack = deque([[cur, pre, point]])
while stack:
cur, pre, point = stack.pop()
point += d2[cur]
ans[cur] = point
for e in d[cur]:
if e != pre:
stack.append([e, cur, point])
dfs(0, -1, 0)
print((" ".join(map(str, ans))))
| false | 18.75 | [
"+from collections import deque",
"- point += d2[cur]",
"- ans[cur] = point",
"- for e in d[cur]:",
"- if e != pre:",
"- dfs(e, cur, point)",
"+ stack = deque([[cur, pre, point]])",
"+ while stack:",
"+ cur, pre, point = stack.pop()",
"+ point += d2[cur]",
"+ ans[cur] = point",
"+ for e in d[cur]:",
"+ if e != pre:",
"+ stack.append([e, cur, point])"
]
| false | 0.038203 | 0.038538 | 0.991308 | [
"s364152547",
"s691174622"
]
|
u513081876 | p04012 | python | s947937697 | s002372400 | 20 | 17 | 3,316 | 2,940 | Accepted | Accepted | 15 | import collections
w = eval(input())
W = list(collections.Counter(w).values())
for i in W:
if i % 2 != 0:
print('No')
break
else:
print('Yes') | w = eval(input())
s = set([i for i in w])
for i in s:
if w.count(i) % 2 != 0:
print('No')
break
else:
print('Yes')
| 11 | 9 | 166 | 142 | import collections
w = eval(input())
W = list(collections.Counter(w).values())
for i in W:
if i % 2 != 0:
print("No")
break
else:
print("Yes")
| w = eval(input())
s = set([i for i in w])
for i in s:
if w.count(i) % 2 != 0:
print("No")
break
else:
print("Yes")
| false | 18.181818 | [
"-import collections",
"-",
"-W = list(collections.Counter(w).values())",
"-for i in W:",
"- if i % 2 != 0:",
"+s = set([i for i in w])",
"+for i in s:",
"+ if w.count(i) % 2 != 0:"
]
| false | 0.05435 | 0.043621 | 1.245952 | [
"s947937697",
"s002372400"
]
|
u894258749 | p03329 | python | s614728863 | s565675849 | 392 | 21 | 6,184 | 3,064 | Accepted | Accepted | 94.64 | N = int(eval(input()))
memo = [N]*(N+1)
unit = [1]
for b in [6,9]:
u = b
while u <= N:
unit.append(u)
u *= b
unit.sort()
cur = set({0})
for i in range(1,N+1):
prev = cur
cur = set()
for p in prev:
for u in unit:
c = p + u
if c == N:
print(i)
exit()
elif c > N:
break
elif memo[c] > i:
cur.add(c)
memo[c] = i | from bisect import bisect_right
N = int(eval(input()))
unit = [1]
for b in [6,9]:
u = b
while u <= N:
unit.append(u)
u *= b
unit.sort()
Nu = len(unit)
ans = N
state_pool = [(0, 0, Nu-1)]
while state_pool:
n, i, pk = state_pool.pop()
if N - n >= (ans-i)*unit[pk]:
continue
sk = bisect_right(unit, N-n, 0, pk+1)
for k in range(sk):
u = unit[k]
c = n + u
if c == N:
if i + 1 < ans:
ans = i + 1
else:
state_pool.append((c, i+1, k))
print(ans) | 24 | 27 | 496 | 579 | N = int(eval(input()))
memo = [N] * (N + 1)
unit = [1]
for b in [6, 9]:
u = b
while u <= N:
unit.append(u)
u *= b
unit.sort()
cur = set({0})
for i in range(1, N + 1):
prev = cur
cur = set()
for p in prev:
for u in unit:
c = p + u
if c == N:
print(i)
exit()
elif c > N:
break
elif memo[c] > i:
cur.add(c)
memo[c] = i
| from bisect import bisect_right
N = int(eval(input()))
unit = [1]
for b in [6, 9]:
u = b
while u <= N:
unit.append(u)
u *= b
unit.sort()
Nu = len(unit)
ans = N
state_pool = [(0, 0, Nu - 1)]
while state_pool:
n, i, pk = state_pool.pop()
if N - n >= (ans - i) * unit[pk]:
continue
sk = bisect_right(unit, N - n, 0, pk + 1)
for k in range(sk):
u = unit[k]
c = n + u
if c == N:
if i + 1 < ans:
ans = i + 1
else:
state_pool.append((c, i + 1, k))
print(ans)
| false | 11.111111 | [
"+from bisect import bisect_right",
"+",
"-memo = [N] * (N + 1)",
"-cur = set({0})",
"-for i in range(1, N + 1):",
"- prev = cur",
"- cur = set()",
"- for p in prev:",
"- for u in unit:",
"- c = p + u",
"- if c == N:",
"- print(i)",
"- exit()",
"- elif c > N:",
"- break",
"- elif memo[c] > i:",
"- cur.add(c)",
"- memo[c] = i",
"+Nu = len(unit)",
"+ans = N",
"+state_pool = [(0, 0, Nu - 1)]",
"+while state_pool:",
"+ n, i, pk = state_pool.pop()",
"+ if N - n >= (ans - i) * unit[pk]:",
"+ continue",
"+ sk = bisect_right(unit, N - n, 0, pk + 1)",
"+ for k in range(sk):",
"+ u = unit[k]",
"+ c = n + u",
"+ if c == N:",
"+ if i + 1 < ans:",
"+ ans = i + 1",
"+ else:",
"+ state_pool.append((c, i + 1, k))",
"+print(ans)"
]
| false | 0.14114 | 0.0379 | 3.724006 | [
"s614728863",
"s565675849"
]
|
u875291233 | p02564 | python | s317106328 | s097131683 | 2,324 | 1,535 | 324,360 | 237,316 | Accepted | Accepted | 33.95 | def StrongConnectedComponent(g,S):
from collections import deque
S = deque() #逆辺で帰りがけが遅い順にpopされるスタック
#まず逆辺でDFS、帰りがけに S に積む
q = deque()
n = len(g)
gp = [1]*n # 1 -> 0 -> -1
for i in range(n):
if gp[i] == 1:
q.append(i)
while q:
v = q.pop()
#帰りがけ
if v < 0:
if gp[~v] == 0:
gp[~v] = -1
S.append(~v)
#未処理
elif gp[v] == 1:
q.append(~v)
gp[v] = 0
for c in rg[v]:
# 子が未処理
if gp[c] == 1:
q.append(c)
q = deque()
gp = [-1]*n
# Sのpop順にDFS
#この段階で gp = [-1]*n（使いまわす）
g_scc = []
cnt = 0
while S:
v = S.pop()
if gp[v] == -1:
q.append(v)
gp[v] = cnt
sv = set()
while q:
w = q.pop()
for c in g[w]:
if gp[c] == -1:
q.append(c)
gp[c] = gp[w]
elif gp[c] != cnt:
sv.add(gp[c])
cnt += 1
g_scc.append(sv)
return gp, g_scc
###########################################################################
###########################################################################
# coding: utf-8
# Your code here!
import sys
readline = sys.stdin.readline
read = sys.stdin.read
#n,*w = [int(i) for i in read().split()]
n,m = [int(i) for i in readline().split()]
g = [[] for _ in range(n)]
rg = [[] for _ in range(n)]
for _ in range(m):
a,b = map(int, readline().split())
g[a].append(b)
rg[b].append(a)
gp, scc = StrongConnectedComponent(g,rg)
#print(gp)
#print(scc)
v = max(gp)+1
ans = [[] for _ in range(v)]
for i, gpi in enumerate(gp):
ans[gpi].append(i)
print(v)
for lst in ans[::-1]:
print(len(lst), end=" ")
print(*lst)
| def SCC_Tarjan(g):
def dfs(v):
nonlocal idx
used[v] = 1
pre[v] = low[v] = idx
idx += 1
S.append(v)
onS[v] = 1
for c in g[v]:
if not used[c]:
dfs(c)
low[v] = min(low[v], low[c])
elif onS[c]:
low[v] = min(low[v], pre[c])
used[v] = 2
if low[v] == pre[v]:
cc = []
while True:
w = S.pop()
onS[w] = 0
cc.append(w)
if w==v: break
scc.append(cc)
n = len(g)
used = [0]*n # 0 -> 1 -> 2
pre = [0]*n
low = [0]*n
onS = [0]*n
idx = 0
S = []
scc = []
for i in range(n):
if not used[i]:
dfs(i)
#print(g)
#print("idx",pre)
#print("low",low)
#print(scc)
return scc
###########################################################################
###########################################################################
# coding: utf-8
# Your code here!
import sys
readline = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10**6)
#n,*w = [int(i) for i in read().split()]
n,m = [int(i) for i in readline().split()]
g = [[] for _ in range(n)]
for _ in range(m):
a,b = list(map(int, readline().split()))
g[a].append(b)
gp = SCC_Tarjan(g)
print((len(gp)))
for lst in gp[::-1]:
print((*([len(lst)]+lst)))
| 87 | 67 | 2,175 | 1,557 | def StrongConnectedComponent(g, S):
from collections import deque
S = deque() # 逆辺で帰りがけが遅い順にpopされるスタック
# まず逆辺でDFS、帰りがけに S に積む
q = deque()
n = len(g)
gp = [1] * n # 1 -> 0 -> -1
for i in range(n):
if gp[i] == 1:
q.append(i)
while q:
v = q.pop()
# 帰りがけ
if v < 0:
if gp[~v] == 0:
gp[~v] = -1
S.append(~v)
# 未処理
elif gp[v] == 1:
q.append(~v)
gp[v] = 0
for c in rg[v]:
# 子が未処理
if gp[c] == 1:
q.append(c)
q = deque()
gp = [-1] * n
# Sのpop順にDFS
# この段階で gp = [-1]*n（使いまわす）
g_scc = []
cnt = 0
while S:
v = S.pop()
if gp[v] == -1:
q.append(v)
gp[v] = cnt
sv = set()
while q:
w = q.pop()
for c in g[w]:
if gp[c] == -1:
q.append(c)
gp[c] = gp[w]
elif gp[c] != cnt:
sv.add(gp[c])
cnt += 1
g_scc.append(sv)
return gp, g_scc
###########################################################################
###########################################################################
# coding: utf-8
# Your code here!
import sys
readline = sys.stdin.readline
read = sys.stdin.read
# n,*w = [int(i) for i in read().split()]
n, m = [int(i) for i in readline().split()]
g = [[] for _ in range(n)]
rg = [[] for _ in range(n)]
for _ in range(m):
a, b = map(int, readline().split())
g[a].append(b)
rg[b].append(a)
gp, scc = StrongConnectedComponent(g, rg)
# print(gp)
# print(scc)
v = max(gp) + 1
ans = [[] for _ in range(v)]
for i, gpi in enumerate(gp):
ans[gpi].append(i)
print(v)
for lst in ans[::-1]:
print(len(lst), end=" ")
print(*lst)
| def SCC_Tarjan(g):
def dfs(v):
nonlocal idx
used[v] = 1
pre[v] = low[v] = idx
idx += 1
S.append(v)
onS[v] = 1
for c in g[v]:
if not used[c]:
dfs(c)
low[v] = min(low[v], low[c])
elif onS[c]:
low[v] = min(low[v], pre[c])
used[v] = 2
if low[v] == pre[v]:
cc = []
while True:
w = S.pop()
onS[w] = 0
cc.append(w)
if w == v:
break
scc.append(cc)
n = len(g)
used = [0] * n # 0 -> 1 -> 2
pre = [0] * n
low = [0] * n
onS = [0] * n
idx = 0
S = []
scc = []
for i in range(n):
if not used[i]:
dfs(i)
# print(g)
# print("idx",pre)
# print("low",low)
# print(scc)
return scc
###########################################################################
###########################################################################
# coding: utf-8
# Your code here!
import sys
readline = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10**6)
# n,*w = [int(i) for i in read().split()]
n, m = [int(i) for i in readline().split()]
g = [[] for _ in range(n)]
for _ in range(m):
a, b = list(map(int, readline().split()))
g[a].append(b)
gp = SCC_Tarjan(g)
print((len(gp)))
for lst in gp[::-1]:
print((*([len(lst)] + lst)))
| false | 22.988506 | [
"-def StrongConnectedComponent(g, S):",
"- from collections import deque",
"+def SCC_Tarjan(g):",
"+ def dfs(v):",
"+ nonlocal idx",
"+ used[v] = 1",
"+ pre[v] = low[v] = idx",
"+ idx += 1",
"+ S.append(v)",
"+ onS[v] = 1",
"+ for c in g[v]:",
"+ if not used[c]:",
"+ dfs(c)",
"+ low[v] = min(low[v], low[c])",
"+ elif onS[c]:",
"+ low[v] = min(low[v], pre[c])",
"+ used[v] = 2",
"+ if low[v] == pre[v]:",
"+ cc = []",
"+ while True:",
"+ w = S.pop()",
"+ onS[w] = 0",
"+ cc.append(w)",
"+ if w == v:",
"+ break",
"+ scc.append(cc)",
"- S = deque() # 逆辺で帰りがけが遅い順にpopされるスタック",
"- # まず逆辺でDFS、帰りがけに S に積む",
"- q = deque()",
"- gp = [1] * n # 1 -> 0 -> -1",
"+ used = [0] * n # 0 -> 1 -> 2",
"+ pre = [0] * n",
"+ low = [0] * n",
"+ onS = [0] * n",
"+ idx = 0",
"+ S = []",
"+ scc = []",
"- if gp[i] == 1:",
"- q.append(i)",
"- while q:",
"- v = q.pop()",
"- # 帰りがけ",
"- if v < 0:",
"- if gp[~v] == 0:",
"- gp[~v] = -1",
"- S.append(~v)",
"- # 未処理",
"- elif gp[v] == 1:",
"- q.append(~v)",
"- gp[v] = 0",
"- for c in rg[v]:",
"- # 子が未処理",
"- if gp[c] == 1:",
"- q.append(c)",
"- q = deque()",
"- gp = [-1] * n",
"- # Sのpop順にDFS",
"- # この段階で gp = [-1]*n（使いまわす）",
"- g_scc = []",
"- cnt = 0",
"- while S:",
"- v = S.pop()",
"- if gp[v] == -1:",
"- q.append(v)",
"- gp[v] = cnt",
"- sv = set()",
"- while q:",
"- w = q.pop()",
"- for c in g[w]:",
"- if gp[c] == -1:",
"- q.append(c)",
"- gp[c] = gp[w]",
"- elif gp[c] != cnt:",
"- sv.add(gp[c])",
"- cnt += 1",
"- g_scc.append(sv)",
"- return gp, g_scc",
"+ if not used[i]:",
"+ dfs(i)",
"+ # print(g)",
"+ # print(\"idx\",pre)",
"+ # print(\"low\",low)",
"+ # print(scc)",
"+ return scc",
"+sys.setrecursionlimit(10**6)",
"-rg = [[] for _ in range(n)]",
"- a, b = map(int, readline().split())",
"+ a, b = list(map(int, readline().split()))",
"- rg[b].append(a)",
"-gp, scc = StrongConnectedComponent(g, rg)",
"-# print(gp)",
"-# print(scc)",
"-v = max(gp) + 1",
"-ans = [[] for _ in range(v)]",
"-for i, gpi in enumerate(gp):",
"- ans[gpi].append(i)",
"-print(v)",
"-for lst in ans[::-1]:",
"- print(len(lst), end=\" \")",
"- print(*lst)",
"+gp = SCC_Tarjan(g)",
"+print((len(gp)))",
"+for lst in gp[::-1]:",
"+ print((*([len(lst)] + lst)))"
]
| false | 0.048891 | 0.048215 | 1.014033 | [
"s317106328",
"s097131683"
]
|
u828706986 | p03450 | python | s735561556 | s395051601 | 606 | 489 | 77,472 | 125,496 | Accepted | Accepted | 19.31 | import sys
def main():
n, m = list(map(int, sys.stdin.readline().split()))
g = [[] for i in range(n)]
for i in range(m):
l, r, d = list(map(int, sys.stdin.readline().split()))
g[l - 1].append((r - 1, d))
g[r - 1].append((l - 1, -d))
dis = [0] * n
visited = [False] * n
for i in range(n):
if visited[i]:
continue
stack = list([i])
visited[i] = True
while len(stack):
v = stack[-1]
stack.pop()
for u, d in g[v]:
if not visited[u]:
dis[u] = dis[v] + d
stack.append(u)
visited[u] = True
for v in range(n):
for u, d in g[v]:
if dis[v] + d != dis[u]:
print('No')
return
print('Yes')
if __name__ == '__main__':
main()
| import sys
def main():
n, m = list(map(int, sys.stdin.readline().split()))
g = [[] for i in range(n)]
deg = [0] * n
lines = sys.stdin.read().splitlines()
for line in lines:
l, r, d = list(map(int, line.split()))
g[l - 1].append((r - 1, d))
deg[r - 1] += 1
dis = [-1] * n
for i in range(n):
if deg[i]:
continue
stack = list([i])
dis[i] = 0
while len(stack):
v = stack[-1]
stack.pop()
for u, d in g[v]:
if dis[u] == -1:
dis[u] = dis[v] + d
stack.append(u)
for v in range(n):
for u, d in g[v]:
if dis[v] + d != dis[u]:
print('No')
return
print('Yes')
if __name__ == '__main__':
main()
| 35 | 35 | 905 | 860 | import sys
def main():
n, m = list(map(int, sys.stdin.readline().split()))
g = [[] for i in range(n)]
for i in range(m):
l, r, d = list(map(int, sys.stdin.readline().split()))
g[l - 1].append((r - 1, d))
g[r - 1].append((l - 1, -d))
dis = [0] * n
visited = [False] * n
for i in range(n):
if visited[i]:
continue
stack = list([i])
visited[i] = True
while len(stack):
v = stack[-1]
stack.pop()
for u, d in g[v]:
if not visited[u]:
dis[u] = dis[v] + d
stack.append(u)
visited[u] = True
for v in range(n):
for u, d in g[v]:
if dis[v] + d != dis[u]:
print("No")
return
print("Yes")
if __name__ == "__main__":
main()
| import sys
def main():
n, m = list(map(int, sys.stdin.readline().split()))
g = [[] for i in range(n)]
deg = [0] * n
lines = sys.stdin.read().splitlines()
for line in lines:
l, r, d = list(map(int, line.split()))
g[l - 1].append((r - 1, d))
deg[r - 1] += 1
dis = [-1] * n
for i in range(n):
if deg[i]:
continue
stack = list([i])
dis[i] = 0
while len(stack):
v = stack[-1]
stack.pop()
for u, d in g[v]:
if dis[u] == -1:
dis[u] = dis[v] + d
stack.append(u)
for v in range(n):
for u, d in g[v]:
if dis[v] + d != dis[u]:
print("No")
return
print("Yes")
if __name__ == "__main__":
main()
| false | 0 | [
"- for i in range(m):",
"- l, r, d = list(map(int, sys.stdin.readline().split()))",
"+ deg = [0] * n",
"+ lines = sys.stdin.read().splitlines()",
"+ for line in lines:",
"+ l, r, d = list(map(int, line.split()))",
"- g[r - 1].append((l - 1, -d))",
"- dis = [0] * n",
"- visited = [False] * n",
"+ deg[r - 1] += 1",
"+ dis = [-1] * n",
"- if visited[i]:",
"+ if deg[i]:",
"- visited[i] = True",
"+ dis[i] = 0",
"- if not visited[u]:",
"+ if dis[u] == -1:",
"- visited[u] = True"
]
| false | 0.111444 | 0.041454 | 2.688355 | [
"s735561556",
"s395051601"
]
|
u102461423 | p02941 | python | s751060057 | s704898958 | 1,138 | 583 | 110,932 | 121,280 | Accepted | Accepted | 48.77 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
from heapq import heappop, heappush
N = int(eval(input()))
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
q = []
push = lambda x,i: heappush(q, (-x<<30)+i)
for i,x in enumerate(B):
push(x,i)
answer = 0
mask = (1<<30)-1
while q:
i = heappop(q)&mask
x = B[i]
dx = x-A[i]
if dx < 0:
answer = -1
break
if dx == 0:
continue
left = i-1 if i >= 1 else N-1
right = i+1 if i < N-1 else 0
nbd = B[left] + B[right]
t = dx // nbd
if t == 0:
answer = -1
break
B[i] -= nbd * t
answer += t
push(B[i],i)
print(answer) | import sys
import numpy as np
import numba
from numba import njit, b1, i4, i8, f8
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
@njit((i8[:], i8[:]), cache=True)
def main(A, B):
N = len(A)
st, p = np.arange(1 << 20), N
ans = 0
while p:
i, p = st[p - 1], p - 1
i %= N
a, b, c = B[i - 1], B[i], B[(i + 1) % N]
if b < a + c:
continue
if b == A[i]:
continue
k = (B[i] - A[i]) // (a + c)
ans += k
B[i] -= (a + c) * k
st[p], p = i - 1, p + 1
st[p], p = i + 1, p + 1
return ans if np.all(A == B) else -1
N = int(readline())
A = np.array(readline().split(), np.int64)
B = np.array(readline().split(), np.int64)
print((main(A, B))) | 38 | 34 | 731 | 840 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from heapq import heappop, heappush
N = int(eval(input()))
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
q = []
push = lambda x, i: heappush(q, (-x << 30) + i)
for i, x in enumerate(B):
push(x, i)
answer = 0
mask = (1 << 30) - 1
while q:
i = heappop(q) & mask
x = B[i]
dx = x - A[i]
if dx < 0:
answer = -1
break
if dx == 0:
continue
left = i - 1 if i >= 1 else N - 1
right = i + 1 if i < N - 1 else 0
nbd = B[left] + B[right]
t = dx // nbd
if t == 0:
answer = -1
break
B[i] -= nbd * t
answer += t
push(B[i], i)
print(answer)
| import sys
import numpy as np
import numba
from numba import njit, b1, i4, i8, f8
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
@njit((i8[:], i8[:]), cache=True)
def main(A, B):
N = len(A)
st, p = np.arange(1 << 20), N
ans = 0
while p:
i, p = st[p - 1], p - 1
i %= N
a, b, c = B[i - 1], B[i], B[(i + 1) % N]
if b < a + c:
continue
if b == A[i]:
continue
k = (B[i] - A[i]) // (a + c)
ans += k
B[i] -= (a + c) * k
st[p], p = i - 1, p + 1
st[p], p = i + 1, p + 1
return ans if np.all(A == B) else -1
N = int(readline())
A = np.array(readline().split(), np.int64)
B = np.array(readline().split(), np.int64)
print((main(A, B)))
| false | 10.526316 | [
"+import numpy as np",
"+import numba",
"+from numba import njit, b1, i4, i8, f8",
"-input = sys.stdin.readline",
"-sys.setrecursionlimit(10**7)",
"-from heapq import heappop, heappush",
"+read = sys.stdin.buffer.read",
"+readline = sys.stdin.buffer.readline",
"+readlines = sys.stdin.buffer.readlines",
"-N = int(eval(input()))",
"-A = [int(x) for x in input().split()]",
"-B = [int(x) for x in input().split()]",
"-q = []",
"-push = lambda x, i: heappush(q, (-x << 30) + i)",
"-for i, x in enumerate(B):",
"- push(x, i)",
"-answer = 0",
"-mask = (1 << 30) - 1",
"-while q:",
"- i = heappop(q) & mask",
"- x = B[i]",
"- dx = x - A[i]",
"- if dx < 0:",
"- answer = -1",
"- break",
"- if dx == 0:",
"- continue",
"- left = i - 1 if i >= 1 else N - 1",
"- right = i + 1 if i < N - 1 else 0",
"- nbd = B[left] + B[right]",
"- t = dx // nbd",
"- if t == 0:",
"- answer = -1",
"- break",
"- B[i] -= nbd * t",
"- answer += t",
"- push(B[i], i)",
"-print(answer)",
"+",
"+@njit((i8[:], i8[:]), cache=True)",
"+def main(A, B):",
"+ N = len(A)",
"+ st, p = np.arange(1 << 20), N",
"+ ans = 0",
"+ while p:",
"+ i, p = st[p - 1], p - 1",
"+ i %= N",
"+ a, b, c = B[i - 1], B[i], B[(i + 1) % N]",
"+ if b < a + c:",
"+ continue",
"+ if b == A[i]:",
"+ continue",
"+ k = (B[i] - A[i]) // (a + c)",
"+ ans += k",
"+ B[i] -= (a + c) * k",
"+ st[p], p = i - 1, p + 1",
"+ st[p], p = i + 1, p + 1",
"+ return ans if np.all(A == B) else -1",
"+",
"+",
"+N = int(readline())",
"+A = np.array(readline().split(), np.int64)",
"+B = np.array(readline().split(), np.int64)",
"+print((main(A, B)))"
]
| false | 0.091405 | 0.207756 | 0.439966 | [
"s751060057",
"s704898958"
]
|
u147801965 | p00201 | python | s089242371 | s576543664 | 20 | 10 | 4,260 | 4,260 | Accepted | Accepted | 50 | while True:
things = {}
count = eval(input())
if count == 0: break
for i in range(count):
fuga = input().split()
things[fuga[0]] = int(fuga[1])
for i in range(eval(input())):
fuga = input().split()
money =0
for j in range(int(fuga[1])):
hoge = things[fuga[j+2]] if fuga[j+2] in things else 0
money+= hoge
things[fuga[0]] = things[fuga[0]] if money > things[fuga[0]] else money
ans = input()
fin = things[ans] if ans in things else 0
print(fin) | while True:
things = {}
count = eval(input())
if count == 0: break
for i in range(count):
fuga = input().split()
things[fuga[0]] = int(fuga[1])
for i in range(eval(input())):
fuga = input().split()
money =0
for j in range(int(fuga[1])):
hoge = things[fuga[j+2]] if fuga[j+2] in things else 0
money+= hoge
things[fuga[0]] = things[fuga[0]] if money > things[fuga[0]] else money
ans = input()
print("%s"%(things[ans] if ans in things else "0")) | 17 | 16 | 562 | 556 | while True:
things = {}
count = eval(input())
if count == 0:
break
for i in range(count):
fuga = input().split()
things[fuga[0]] = int(fuga[1])
for i in range(eval(input())):
fuga = input().split()
money = 0
for j in range(int(fuga[1])):
hoge = things[fuga[j + 2]] if fuga[j + 2] in things else 0
money += hoge
things[fuga[0]] = things[fuga[0]] if money > things[fuga[0]] else money
ans = input()
fin = things[ans] if ans in things else 0
print(fin)
| while True:
things = {}
count = eval(input())
if count == 0:
break
for i in range(count):
fuga = input().split()
things[fuga[0]] = int(fuga[1])
for i in range(eval(input())):
fuga = input().split()
money = 0
for j in range(int(fuga[1])):
hoge = things[fuga[j + 2]] if fuga[j + 2] in things else 0
money += hoge
things[fuga[0]] = things[fuga[0]] if money > things[fuga[0]] else money
ans = input()
print("%s" % (things[ans] if ans in things else "0"))
| false | 5.882353 | [
"- fin = things[ans] if ans in things else 0",
"- print(fin)",
"+ print(\"%s\" % (things[ans] if ans in things else \"0\"))"
]
| false | 0.046902 | 0.047018 | 0.997545 | [
"s089242371",
"s576543664"
]
|
u137038354 | p02608 | python | s197723014 | s677792421 | 1,487 | 854 | 9,180 | 9,368 | Accepted | Accepted | 42.57 | N = int(eval(input()))
ls = [0]*(N+2)
for i in range(1,151):
for j in range(1,151):
for k in range(1,151):
t = i*i + j*j + k*k + i*j + j*k + k*i
if t <= N :
ls[t] += 1
for p in range(1,N+1):
print((ls[p])) | N = int(eval(input()))
ls = [0]*(N+2)
for i in range(1,100):
for j in range(1,100):
for k in range(1,100):
t = i**2 + j**2 + k**2 + i*j + j*k + k*i
if t <= N :
ls[t] += 1
for p in range(1,N+1):
print((ls[p])) | 12 | 12 | 267 | 270 | N = int(eval(input()))
ls = [0] * (N + 2)
for i in range(1, 151):
for j in range(1, 151):
for k in range(1, 151):
t = i * i + j * j + k * k + i * j + j * k + k * i
if t <= N:
ls[t] += 1
for p in range(1, N + 1):
print((ls[p]))
| N = int(eval(input()))
ls = [0] * (N + 2)
for i in range(1, 100):
for j in range(1, 100):
for k in range(1, 100):
t = i**2 + j**2 + k**2 + i * j + j * k + k * i
if t <= N:
ls[t] += 1
for p in range(1, N + 1):
print((ls[p]))
| false | 0 | [
"-for i in range(1, 151):",
"- for j in range(1, 151):",
"- for k in range(1, 151):",
"- t = i * i + j * j + k * k + i * j + j * k + k * i",
"+for i in range(1, 100):",
"+ for j in range(1, 100):",
"+ for k in range(1, 100):",
"+ t = i**2 + j**2 + k**2 + i * j + j * k + k * i"
]
| false | 2.344625 | 1.252834 | 1.871457 | [
"s197723014",
"s677792421"
]
|
u660106942 | p02762 | python | s079545870 | s144107052 | 1,991 | 1,786 | 124,064 | 112,336 | Accepted | Accepted | 10.3 |
class UnionFind(object):
"https://www.kumilog.net/entry/union-find"
def __init__(self, n=1):
self.par = [i for i in range(n)]
self.rank = [0 for _ in range(n)]
self.size = [1 for _ in range(n)]
def find(self, x):
"""
x が属するグループを探索
"""
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def union(self, x, y):
"""
x と y のグループを結合
"""
x = self.find(x)
y = self.find(y)
if x != y:
if self.rank[x] < self.rank[y]:
x, y = y, x
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
self.par[y] = x
self.size[x] += self.size[y]
def is_same(self, x, y):
"""
x と y が同じグループか否か
"""
return self.find(x) == self.find(y)
def get_size(self, x):
"""
x が属するグループの要素数
"""
x = self.find(x)
return self.size[x]
N, M, K = list(map(int, input().split(" ")))
uf = UnionFind(N)
fr = {}
for _ in range(M):
a, b = list(map(int, input().split(" ")))
a -= 1
b -= 1
uf.union(a, b)
if fr.get(a) is not None:
fr[a] += 1
else:
fr[a] = 1
if fr.get(b) is not None:
fr[b] += 1
else:
fr[b] = 1
bl = {}
for _ in range(K):
c, d = list(map(int, input().split(" ")))
c -= 1
d -= 1
if not uf.is_same(c, d):
continue
if bl.get(c) is not None:
bl[c] += 1
else:
bl[c] = 1
if bl.get(d) is not None:
bl[d] += 1
else:
bl[d] = 1
for i in range(N):
s = uf.get_size(i) - 1
s -= bl.get(i, 0)
s -= fr.get(i, 0)
print(s) | class UnionFind:
"https://www.kumilog.net/entry/union-find"
def __init__(self, n=1):
self.par = [i for i in range(n)]
self.rank = [0 for _ in range(n)]
self.size = [1 for _ in range(n)]
def find(self, x):
"""
x が属するグループを探索
"""
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def union(self, x, y):
"""
x と y のグループを結合
"""
x = self.find(x)
y = self.find(y)
if x != y:
if self.rank[x] < self.rank[y]:
x, y = y, x
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
self.par[y] = x
self.size[x] += self.size[y]
def is_same(self, x, y):
"""
x と y が同じグループか否か
"""
return self.find(x) == self.find(y)
def get_size(self, x):
"""
x が属するグループの要素数
"""
x = self.find(x)
return self.size[x]
N, M, K = list(map(int, input().split(" ")))
uf = UnionFind(N)
fr = {}
for _ in range(M):
a, b = list(map(int, input().split(" ")))
a -= 1
b -= 1
uf.union(a, b)
fr[a] = fr.get(a, 0) + 1
fr[b] = fr.get(b, 0) + 1
bl = {}
for _ in range(K):
c, d = list(map(int, input().split(" ")))
c -= 1
d -= 1
if not uf.is_same(c, d):
continue
fr[c] = fr.get(c, 0) + 1
fr[d] = fr.get(d, 0) + 1
for i in range(N):
s = uf.get_size(i) - 1
s -= bl.get(i, 0)
s -= fr.get(i, 0)
print(s) | 89 | 76 | 1,863 | 1,653 | class UnionFind(object):
"https://www.kumilog.net/entry/union-find"
def __init__(self, n=1):
self.par = [i for i in range(n)]
self.rank = [0 for _ in range(n)]
self.size = [1 for _ in range(n)]
def find(self, x):
"""
x が属するグループを探索
"""
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def union(self, x, y):
"""
x と y のグループを結合
"""
x = self.find(x)
y = self.find(y)
if x != y:
if self.rank[x] < self.rank[y]:
x, y = y, x
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
self.par[y] = x
self.size[x] += self.size[y]
def is_same(self, x, y):
"""
x と y が同じグループか否か
"""
return self.find(x) == self.find(y)
def get_size(self, x):
"""
x が属するグループの要素数
"""
x = self.find(x)
return self.size[x]
N, M, K = list(map(int, input().split(" ")))
uf = UnionFind(N)
fr = {}
for _ in range(M):
a, b = list(map(int, input().split(" ")))
a -= 1
b -= 1
uf.union(a, b)
if fr.get(a) is not None:
fr[a] += 1
else:
fr[a] = 1
if fr.get(b) is not None:
fr[b] += 1
else:
fr[b] = 1
bl = {}
for _ in range(K):
c, d = list(map(int, input().split(" ")))
c -= 1
d -= 1
if not uf.is_same(c, d):
continue
if bl.get(c) is not None:
bl[c] += 1
else:
bl[c] = 1
if bl.get(d) is not None:
bl[d] += 1
else:
bl[d] = 1
for i in range(N):
s = uf.get_size(i) - 1
s -= bl.get(i, 0)
s -= fr.get(i, 0)
print(s)
| class UnionFind:
"https://www.kumilog.net/entry/union-find"
def __init__(self, n=1):
self.par = [i for i in range(n)]
self.rank = [0 for _ in range(n)]
self.size = [1 for _ in range(n)]
def find(self, x):
"""
x が属するグループを探索
"""
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def union(self, x, y):
"""
x と y のグループを結合
"""
x = self.find(x)
y = self.find(y)
if x != y:
if self.rank[x] < self.rank[y]:
x, y = y, x
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
self.par[y] = x
self.size[x] += self.size[y]
def is_same(self, x, y):
"""
x と y が同じグループか否か
"""
return self.find(x) == self.find(y)
def get_size(self, x):
"""
x が属するグループの要素数
"""
x = self.find(x)
return self.size[x]
N, M, K = list(map(int, input().split(" ")))
uf = UnionFind(N)
fr = {}
for _ in range(M):
a, b = list(map(int, input().split(" ")))
a -= 1
b -= 1
uf.union(a, b)
fr[a] = fr.get(a, 0) + 1
fr[b] = fr.get(b, 0) + 1
bl = {}
for _ in range(K):
c, d = list(map(int, input().split(" ")))
c -= 1
d -= 1
if not uf.is_same(c, d):
continue
fr[c] = fr.get(c, 0) + 1
fr[d] = fr.get(d, 0) + 1
for i in range(N):
s = uf.get_size(i) - 1
s -= bl.get(i, 0)
s -= fr.get(i, 0)
print(s)
| false | 14.606742 | [
"-class UnionFind(object):",
"+class UnionFind:",
"- if fr.get(a) is not None:",
"- fr[a] += 1",
"- else:",
"- fr[a] = 1",
"- if fr.get(b) is not None:",
"- fr[b] += 1",
"- else:",
"- fr[b] = 1",
"+ fr[a] = fr.get(a, 0) + 1",
"+ fr[b] = fr.get(b, 0) + 1",
"- if bl.get(c) is not None:",
"- bl[c] += 1",
"- else:",
"- bl[c] = 1",
"- if bl.get(d) is not None:",
"- bl[d] += 1",
"- else:",
"- bl[d] = 1",
"+ fr[c] = fr.get(c, 0) + 1",
"+ fr[d] = fr.get(d, 0) + 1"
]
| false | 0.051581 | 0.008247 | 6.254385 | [
"s079545870",
"s144107052"
]
|
u912862653 | p03608 | python | s742117616 | s291782874 | 495 | 414 | 59,480 | 55,388 | Accepted | Accepted | 16.36 | import itertools
def warshall_floyd(D, n):
for k in range(n):
for i in range(n):
for j in range(n):
D[i][j] = min(D[i][j], D[i][k]+D[k][j])
N, M, R = list(map(int, input().split()))
r = list(map(int, input().split()))
D = [[float('inf')]*N for _ in range(N)]
for i in range(N):
D[i][i] = 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
warshall_floyd(D, N)
ans = float('inf')
for P in itertools.permutations(r):
cost = 0
for i in range(R-1):
cost += D[P[i]-1][P[i+1]-1]
ans = min(ans, cost)
print(ans) | import itertools
import sys
input = sys.stdin.readline
def warshall_floyd(D, n):
for k in range(n):
for i in range(n):
for j in range(n):
D[i][j] = min(D[i][j], D[i][k]+D[k][j])
def main():
N, M, R = list(map(int, input().split()))
r = list(map(int, input().split()))
D = [[float('inf')]*N for _ in range(N)]
for i in range(N):
D[i][i] = 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
warshall_floyd(D, N)
ans = float('inf')
for P in itertools.permutations(r):
cost = 0
for i in range(R-1):
cost += D[P[i]-1][P[i+1]-1]
ans = min(ans, cost)
print(ans)
if __name__ == '__main__':
main() | 29 | 35 | 646 | 825 | import itertools
def warshall_floyd(D, n):
for k in range(n):
for i in range(n):
for j in range(n):
D[i][j] = min(D[i][j], D[i][k] + D[k][j])
N, M, R = list(map(int, input().split()))
r = list(map(int, input().split()))
D = [[float("inf")] * N for _ in range(N)]
for i in range(N):
D[i][i] = 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
warshall_floyd(D, N)
ans = float("inf")
for P in itertools.permutations(r):
cost = 0
for i in range(R - 1):
cost += D[P[i] - 1][P[i + 1] - 1]
ans = min(ans, cost)
print(ans)
| import itertools
import sys
input = sys.stdin.readline
def warshall_floyd(D, n):
for k in range(n):
for i in range(n):
for j in range(n):
D[i][j] = min(D[i][j], D[i][k] + D[k][j])
def main():
N, M, R = list(map(int, input().split()))
r = list(map(int, input().split()))
D = [[float("inf")] * N for _ in range(N)]
for i in range(N):
D[i][i] = 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
warshall_floyd(D, N)
ans = float("inf")
for P in itertools.permutations(r):
cost = 0
for i in range(R - 1):
cost += D[P[i] - 1][P[i + 1] - 1]
ans = min(ans, cost)
print(ans)
if __name__ == "__main__":
main()
| false | 17.142857 | [
"+import sys",
"+",
"+input = sys.stdin.readline",
"-N, M, R = list(map(int, input().split()))",
"-r = list(map(int, input().split()))",
"-D = [[float(\"inf\")] * N for _ in range(N)]",
"-for i in range(N):",
"- D[i][i] = 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",
"-warshall_floyd(D, N)",
"-ans = float(\"inf\")",
"-for P in itertools.permutations(r):",
"- cost = 0",
"- for i in range(R - 1):",
"- cost += D[P[i] - 1][P[i + 1] - 1]",
"- ans = min(ans, cost)",
"-print(ans)",
"+def main():",
"+ N, M, R = list(map(int, input().split()))",
"+ r = list(map(int, input().split()))",
"+ D = [[float(\"inf\")] * N for _ in range(N)]",
"+ for i in range(N):",
"+ D[i][i] = 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",
"+ warshall_floyd(D, N)",
"+ ans = float(\"inf\")",
"+ for P in itertools.permutations(r):",
"+ cost = 0",
"+ for i in range(R - 1):",
"+ cost += D[P[i] - 1][P[i + 1] - 1]",
"+ ans = min(ans, cost)",
"+ print(ans)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.12791 | 0.048612 | 2.631269 | [
"s742117616",
"s291782874"
]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.