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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u671553883 | p02412 | python | s742022870 | s571009695 | 990 | 570 | 7,716 | 7,676 | Accepted | Accepted | 42.42 | while True:
n, x = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for s in range(1, n + 1):
for m in range(s+1, n):
for e in range(m+1, n+1):
if x == sum([s, m, e]):
count += 1
print(count) | while True:
n, x = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for s in range(1, n + 1):
for m in range(s+1, n):
for e in range(m+1, n+1):
if x == s + m + e:
count += 1
print(count) | 14 | 14 | 308 | 303 | while True:
n, x = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for s in range(1, n + 1):
for m in range(s + 1, n):
for e in range(m + 1, n + 1):
if x == sum([s, m, e]):
count += 1
print(count)
| while True:
n, x = [int(i) for i in input().split()]
if n == x == 0:
break
count = 0
for s in range(1, n + 1):
for m in range(s + 1, n):
for e in range(m + 1, n + 1):
if x == s + m + e:
count += 1
print(count)
| false | 0 | [
"- if x == sum([s, m, e]):",
"+ if x == s + m + e:"
]
| false | 0.037939 | 0.037836 | 1.002702 | [
"s742022870",
"s571009695"
]
|
u968166680 | p02630 | python | s693363388 | s835039373 | 168 | 147 | 113,604 | 36,628 | Accepted | Accepted | 12.5 | import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N = int(readline())
A = list(map(int, readline().split()))
Q, *BC = list(map(int, read().split()))
total = sum(A)
d = [0] * (10 ** 5 + 1)
for a in A:
d[a] += 1
for b, c in zip(BC[::2], BC[1::2]):
total += (c - b) * d[b]
d[c] += d[b]
d[b] = 0
print(total)
return
if __name__ == '__main__':
main()
| import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N = int(readline())
A = list(map(int, readline().split()))
Q, *BC = list(map(int, read().split()))
total = sum(A)
d = [0] * (10 ** 5 + 1)
for a in A:
d[a] += 1
for b, c in zip(*[iter(BC)] * 2):
total += (c - b) * d[b]
d[c] += d[b]
d[b] = 0
print(total)
return
if __name__ == '__main__':
main()
| 32 | 32 | 606 | 604 | import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def main():
N = int(readline())
A = list(map(int, readline().split()))
Q, *BC = list(map(int, read().split()))
total = sum(A)
d = [0] * (10**5 + 1)
for a in A:
d[a] += 1
for b, c in zip(BC[::2], BC[1::2]):
total += (c - b) * d[b]
d[c] += d[b]
d[b] = 0
print(total)
return
if __name__ == "__main__":
main()
| import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def main():
N = int(readline())
A = list(map(int, readline().split()))
Q, *BC = list(map(int, read().split()))
total = sum(A)
d = [0] * (10**5 + 1)
for a in A:
d[a] += 1
for b, c in zip(*[iter(BC)] * 2):
total += (c - b) * d[b]
d[c] += d[b]
d[b] = 0
print(total)
return
if __name__ == "__main__":
main()
| false | 0 | [
"- for b, c in zip(BC[::2], BC[1::2]):",
"+ for b, c in zip(*[iter(BC)] * 2):"
]
| false | 0.036559 | 0.036037 | 1.014488 | [
"s693363388",
"s835039373"
]
|
u054825571 | p02702 | python | s292210740 | s662168952 | 131 | 119 | 9,224 | 9,316 | Accepted | Accepted | 9.16 | S=eval(input())
ans,n=0,len(S)
dp=[0]*(2019)
s,dp[0],k=0,1,1
for i in range(1,n+1):
s=(s+int(S[-i])*k)%2019
k=(k*10)%2019
ans+=dp[s]
dp[s]+=1
print(ans) | S=eval(input())
ans,n=0,len(S)
dp=[0]*(2019)
s,dp[0],k=0,1,1
for i in S[::-1]:
s=(s+int(i)*k)%2019
k=(k*10)%2019
ans+=dp[s]
dp[s]+=1
print(ans) | 10 | 10 | 163 | 154 | S = eval(input())
ans, n = 0, len(S)
dp = [0] * (2019)
s, dp[0], k = 0, 1, 1
for i in range(1, n + 1):
s = (s + int(S[-i]) * k) % 2019
k = (k * 10) % 2019
ans += dp[s]
dp[s] += 1
print(ans)
| S = eval(input())
ans, n = 0, len(S)
dp = [0] * (2019)
s, dp[0], k = 0, 1, 1
for i in S[::-1]:
s = (s + int(i) * k) % 2019
k = (k * 10) % 2019
ans += dp[s]
dp[s] += 1
print(ans)
| false | 0 | [
"-for i in range(1, n + 1):",
"- s = (s + int(S[-i]) * k) % 2019",
"+for i in S[::-1]:",
"+ s = (s + int(i) * k) % 2019"
]
| false | 0.047024 | 0.068605 | 0.685438 | [
"s292210740",
"s662168952"
]
|
u695811449 | p03253 | python | s480012098 | s984968559 | 753 | 21 | 10,764 | 3,064 | Accepted | Accepted | 97.21 | import copy
N,M=list(map(int,input().split()))
mod=10**9+7
#x以下の素数の列挙
import math
x=math.floor(math.sqrt(10**9))
L=math.floor(math.sqrt(x))#平方根を求める
Primelist=[i for i in range(x+1)]
Primelist[1]=0#素数でないものは0にする.
for i in Primelist:
if i>L:
break
if i==0:
continue
for j in range(2*i,x+1,i):
Primelist[j]=0
Primes=[Primelist[j] for j in range(x+1) if Primelist[j]!=0]
def fact(M):#約数の列挙
if M==1:
return {1}
DICT=dict()#素因数分解
i=0
while M!=1 and i<len(Primes):
if M%Primes[i]==0:
DICT[Primes[i]]=DICT.get(Primes[i],0)+1
M=M//Primes[i]
else:
i+=1
if M!=1:
DICT[M]=1
VALUES=list(DICT.values())
KEYS=list(DICT.keys())
LIST=[1]
for i in range(len(DICT)):
NOWLIST=copy.copy(LIST)
for l in NOWLIST:
for j in range(0,VALUES[i]+1):
LIST.append(l*KEYS[i]**j)
return set(LIST)
def Combi2(a,b):#aは大きいが、bは小さいとき
if b>a:
return 0
ANS=1
for i in range(min(b,a-b)):
ANS=ANS*(a-i)%mod*pow(min(b,a-b)-i,mod-2,mod)%mod
return ANS%mod
SET=fact(M)
factor=dict()
for j in SET:
factor[j]=fact(j)
DP=dict()
defaultans=[0 for i in range(40)]
defaultans[1]=1
defaultans=tuple(defaultans)
def dp(m):
ANS=[0 for i in range(40)]
if m==1:
return defaultans
for j in factor[m]:
#print(j,factor[m])
if j==1:
continue
else:
if DP.get(m//j,-1)!=-1:
NEXT=DP[m//j]
else:
NEXT=dp(m//j)
for k in range(39):
ANS[k+1]=(ANS[k+1]+NEXT[k])%mod
#print(m//j,ANS,NEXT)
DP[m]=ANS
return ANS
LIST=dp(M)
ANS=0
for i in range(40):
if LIST[i]!=0:
ANS=ANS+Combi2(N,i-1)*LIST[i]%mod
print((ANS%mod))
| N,M=list(map(int,input().split()))
mod=10**9+7
import math
L=math.floor(math.sqrt(M))
X=dict()
for i in range(2,L+2):
while M%i==0:
X[i]=X.get(i,0)+1
M=M//i
if M!=1:
X[M]=X.get(M,0)+1
def Combi2(a,b):#aは大きいが、bは小さいとき
if b>a:
return 0
ANS=1
for i in range(min(b,a-b)):
ANS=ANS*(a-i)*pow(min(b,a-b)-i,mod-2,mod)
return ANS%mod
ANS=1
for x in list(X.values()):
ANS=(ANS*Combi2(x+N-1,x))%mod
print(ANS) | 102 | 32 | 1,983 | 491 | import copy
N, M = list(map(int, input().split()))
mod = 10**9 + 7
# x以下の素数の列挙
import math
x = math.floor(math.sqrt(10**9))
L = math.floor(math.sqrt(x)) # 平方根を求める
Primelist = [i for i in range(x + 1)]
Primelist[1] = 0 # 素数でないものは0にする.
for i in Primelist:
if i > L:
break
if i == 0:
continue
for j in range(2 * i, x + 1, i):
Primelist[j] = 0
Primes = [Primelist[j] for j in range(x + 1) if Primelist[j] != 0]
def fact(M): # 約数の列挙
if M == 1:
return {1}
DICT = dict() # 素因数分解
i = 0
while M != 1 and i < len(Primes):
if M % Primes[i] == 0:
DICT[Primes[i]] = DICT.get(Primes[i], 0) + 1
M = M // Primes[i]
else:
i += 1
if M != 1:
DICT[M] = 1
VALUES = list(DICT.values())
KEYS = list(DICT.keys())
LIST = [1]
for i in range(len(DICT)):
NOWLIST = copy.copy(LIST)
for l in NOWLIST:
for j in range(0, VALUES[i] + 1):
LIST.append(l * KEYS[i] ** j)
return set(LIST)
def Combi2(a, b): # aは大きいが、bは小さいとき
if b > a:
return 0
ANS = 1
for i in range(min(b, a - b)):
ANS = ANS * (a - i) % mod * pow(min(b, a - b) - i, mod - 2, mod) % mod
return ANS % mod
SET = fact(M)
factor = dict()
for j in SET:
factor[j] = fact(j)
DP = dict()
defaultans = [0 for i in range(40)]
defaultans[1] = 1
defaultans = tuple(defaultans)
def dp(m):
ANS = [0 for i in range(40)]
if m == 1:
return defaultans
for j in factor[m]:
# print(j,factor[m])
if j == 1:
continue
else:
if DP.get(m // j, -1) != -1:
NEXT = DP[m // j]
else:
NEXT = dp(m // j)
for k in range(39):
ANS[k + 1] = (ANS[k + 1] + NEXT[k]) % mod
# print(m//j,ANS,NEXT)
DP[m] = ANS
return ANS
LIST = dp(M)
ANS = 0
for i in range(40):
if LIST[i] != 0:
ANS = ANS + Combi2(N, i - 1) * LIST[i] % mod
print((ANS % mod))
| N, M = list(map(int, input().split()))
mod = 10**9 + 7
import math
L = math.floor(math.sqrt(M))
X = dict()
for i in range(2, L + 2):
while M % i == 0:
X[i] = X.get(i, 0) + 1
M = M // i
if M != 1:
X[M] = X.get(M, 0) + 1
def Combi2(a, b): # aは大きいが、bは小さいとき
if b > a:
return 0
ANS = 1
for i in range(min(b, a - b)):
ANS = ANS * (a - i) * pow(min(b, a - b) - i, mod - 2, mod)
return ANS % mod
ANS = 1
for x in list(X.values()):
ANS = (ANS * Combi2(x + N - 1, x)) % mod
print(ANS)
| false | 68.627451 | [
"-import copy",
"-",
"-# x以下の素数の列挙",
"-x = math.floor(math.sqrt(10**9))",
"-L = math.floor(math.sqrt(x)) # 平方根を求める",
"-Primelist = [i for i in range(x + 1)]",
"-Primelist[1] = 0 # 素数でないものは0にする.",
"-for i in Primelist:",
"- if i > L:",
"- break",
"- if i == 0:",
"- continue",
"- for j in range(2 * i, x + 1, i):",
"- Primelist[j] = 0",
"-Primes = [Primelist[j] for j in range(x + 1) if Primelist[j] != 0]",
"-",
"-",
"-def fact(M): # 約数の列挙",
"- if M == 1:",
"- return {1}",
"- DICT = dict() # 素因数分解",
"- i = 0",
"- while M != 1 and i < len(Primes):",
"- if M % Primes[i] == 0:",
"- DICT[Primes[i]] = DICT.get(Primes[i], 0) + 1",
"- M = M // Primes[i]",
"- else:",
"- i += 1",
"- if M != 1:",
"- DICT[M] = 1",
"- VALUES = list(DICT.values())",
"- KEYS = list(DICT.keys())",
"- LIST = [1]",
"- for i in range(len(DICT)):",
"- NOWLIST = copy.copy(LIST)",
"- for l in NOWLIST:",
"- for j in range(0, VALUES[i] + 1):",
"- LIST.append(l * KEYS[i] ** j)",
"- return set(LIST)",
"+L = math.floor(math.sqrt(M))",
"+X = dict()",
"+for i in range(2, L + 2):",
"+ while M % i == 0:",
"+ X[i] = X.get(i, 0) + 1",
"+ M = M // i",
"+if M != 1:",
"+ X[M] = X.get(M, 0) + 1",
"- ANS = ANS * (a - i) % mod * pow(min(b, a - b) - i, mod - 2, mod) % mod",
"+ ANS = ANS * (a - i) * pow(min(b, a - b) - i, mod - 2, mod)",
"-SET = fact(M)",
"-factor = dict()",
"-for j in SET:",
"- factor[j] = fact(j)",
"-DP = dict()",
"-defaultans = [0 for i in range(40)]",
"-defaultans[1] = 1",
"-defaultans = tuple(defaultans)",
"-",
"-",
"-def dp(m):",
"- ANS = [0 for i in range(40)]",
"- if m == 1:",
"- return defaultans",
"- for j in factor[m]:",
"- # print(j,factor[m])",
"- if j == 1:",
"- continue",
"- else:",
"- if DP.get(m // j, -1) != -1:",
"- NEXT = DP[m // j]",
"- else:",
"- NEXT = dp(m // j)",
"- for k in range(39):",
"- ANS[k + 1] = (ANS[k + 1] + NEXT[k]) % mod",
"- # print(m//j,ANS,NEXT)",
"- DP[m] = ANS",
"- return ANS",
"-",
"-",
"-LIST = dp(M)",
"-ANS = 0",
"-for i in range(40):",
"- if LIST[i] != 0:",
"- ANS = ANS + Combi2(N, i - 1) * LIST[i] % mod",
"-print((ANS % mod))",
"+ANS = 1",
"+for x in list(X.values()):",
"+ ANS = (ANS * Combi2(x + N - 1, x)) % mod",
"+print(ANS)"
]
| false | 0.204 | 0.043332 | 4.707868 | [
"s480012098",
"s984968559"
]
|
u633068244 | p00150 | python | s433862361 | s774954957 | 480 | 40 | 4,752 | 4,752 | Accepted | Accepted | 91.67 | r = 10001
sqrt = int(r**0.5)
p = [1]*r
twin = [0]*r
p[0] = 0
p[1::2] = [0 for x in range(1,r,2)]
for i in range(2,r,2):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
if p[i-2]:
twin[i] = 1
while True:
n = int(input())
if n == 0: break
i = n - twin[:n][::-1].index(1)
print(i-2,i) | r = 10001
sqrt = int(r**0.5)
p = [1]*r
twin = [0]*r
p[0] = 0
p[1::2] = [0 for x in range(1,r,2)]
for i in range(2,r,2):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
if p[i-2]:
twin[i:i+300] = [i+1 for x in range(i,i+300)]
while True:
n = int(input())
if n == 0: break
print(twin[n-1]-2,twin[n-1]) | 17 | 16 | 324 | 340 | r = 10001
sqrt = int(r**0.5)
p = [1] * r
twin = [0] * r
p[0] = 0
p[1::2] = [0 for x in range(1, r, 2)]
for i in range(2, r, 2):
if p[i]:
p[2 * i + 1 :: i + 1] = [0 for x in range(2 * i + 1, r, i + 1)]
if p[i - 2]:
twin[i] = 1
while True:
n = int(input())
if n == 0:
break
i = n - twin[:n][::-1].index(1)
print(i - 2, i)
| r = 10001
sqrt = int(r**0.5)
p = [1] * r
twin = [0] * r
p[0] = 0
p[1::2] = [0 for x in range(1, r, 2)]
for i in range(2, r, 2):
if p[i]:
p[2 * i + 1 :: i + 1] = [0 for x in range(2 * i + 1, r, i + 1)]
if p[i - 2]:
twin[i : i + 300] = [i + 1 for x in range(i, i + 300)]
while True:
n = int(input())
if n == 0:
break
print(twin[n - 1] - 2, twin[n - 1])
| false | 5.882353 | [
"- twin[i] = 1",
"+ twin[i : i + 300] = [i + 1 for x in range(i, i + 300)]",
"- i = n - twin[:n][::-1].index(1)",
"- print(i - 2, i)",
"+ print(twin[n - 1] - 2, twin[n - 1])"
]
| false | 0.048139 | 0.056276 | 0.855395 | [
"s433862361",
"s774954957"
]
|
u189023301 | p02567 | python | s534220536 | s492882207 | 764 | 652 | 116,636 | 118,132 | Accepted | Accepted | 14.66 | import sys
input = lambda: sys.stdin.readline()
def solve():
def init(init_val):
for i in range(n):
seg[i + num - 1] = init_val[i]
for i in range(num - 2, -1, -1):
seg[i] = segfunc(seg[2 * i + 1], seg[2 * i + 2])
def update(k, x):
k += num - 1
seg[k] = x
while k:
k = (k - 1) // 2
seg[k] = segfunc(seg[k * 2 + 1], seg[k * 2 + 2])
def query(p, q):
if q <= p:
return ide_ele
p += num - 1
q += num - 2
res = ide_ele
while q - p > 1:
if p & 1 == 0:
res = segfunc(res, seg[p])
if q & 1 == 1:
res = segfunc(res, seg[q])
q -= 1
p = p // 2
q = (q - 1) // 2
if p == q:
res = segfunc(res, seg[p])
else:
res = segfunc(segfunc(res, seg[p]), seg[q])
return res
n, q = list(map(int, input().split()))
a = list(map(int, input().split()))
segfunc = lambda x, y: max(x, y)
ide_ele = 0
num = 2 ** (n - 1).bit_length()
seg = [ide_ele] * 2 * num
init(a)
res = []
for _ in range(q):
t, a, b = list(map(int, input().split()))
if t == 1:
update(a - 1, b)
elif t == 2:
res.append(query(a - 1, b))
elif t == 3:
ng = a - 1
ok = n + 1
while ok > ng + 1:
mid = (ok + ng) // 2
if query(ng, mid) >= b:
ok = mid
else:
ng = mid
res.append(ok)
print(("\n".join(map(str, res))))
solve()
| import sys
input = lambda: sys.stdin.readline()
def solve():
def init(init_arr):
global num, segfunc, ide_ele, seg
segfunc = lambda x, y: max(x, y)
ide_ele = 0
num = 2 ** (n - 1).bit_length()
seg = [ide_ele] * 2 * num
for i in range(n):
seg[i + num - 1] = init_arr[i]
for i in range(num - 2, -1, -1):
seg[i] = segfunc(seg[2 * i + 1], seg[2 * i + 2])
def update(k, x):
k += num - 1
seg[k] = x
while k:
k = (k - 1) // 2
seg[k] = segfunc(seg[k * 2 + 1], seg[k * 2 + 2])
def query(p, q):
if q <= p:
return ide_ele
p += num - 1
q += num - 2
res = ide_ele
while q - p > 1:
if p & 1 == 0:
res = segfunc(res, seg[p])
if q & 1 == 1:
res = segfunc(res, seg[q])
q -= 1
p = p // 2
q = (q - 1) // 2
if p == q:
res = segfunc(res, seg[p])
else:
res = segfunc(segfunc(res, seg[p]), seg[q])
return res
n, q = list(map(int, input().split()))
a = list(map(int, input().split()))
init(a)
res = []
for _ in range(q):
t, a, b = list(map(int, input().split()))
if t == 1:
update(a - 1, b)
elif t == 2:
res.append(query(a - 1, b))
elif t == 3:
ng = a - 1
ok = n + 1
while ok > ng + 1:
mid = (ok + ng) // 2
if query(ng, mid) >= b:
ok = mid
else:
ng = mid
res.append(ok)
print(("\n".join(map(str, res))))
solve()
| 69 | 69 | 1,745 | 1,802 | import sys
input = lambda: sys.stdin.readline()
def solve():
def init(init_val):
for i in range(n):
seg[i + num - 1] = init_val[i]
for i in range(num - 2, -1, -1):
seg[i] = segfunc(seg[2 * i + 1], seg[2 * i + 2])
def update(k, x):
k += num - 1
seg[k] = x
while k:
k = (k - 1) // 2
seg[k] = segfunc(seg[k * 2 + 1], seg[k * 2 + 2])
def query(p, q):
if q <= p:
return ide_ele
p += num - 1
q += num - 2
res = ide_ele
while q - p > 1:
if p & 1 == 0:
res = segfunc(res, seg[p])
if q & 1 == 1:
res = segfunc(res, seg[q])
q -= 1
p = p // 2
q = (q - 1) // 2
if p == q:
res = segfunc(res, seg[p])
else:
res = segfunc(segfunc(res, seg[p]), seg[q])
return res
n, q = list(map(int, input().split()))
a = list(map(int, input().split()))
segfunc = lambda x, y: max(x, y)
ide_ele = 0
num = 2 ** (n - 1).bit_length()
seg = [ide_ele] * 2 * num
init(a)
res = []
for _ in range(q):
t, a, b = list(map(int, input().split()))
if t == 1:
update(a - 1, b)
elif t == 2:
res.append(query(a - 1, b))
elif t == 3:
ng = a - 1
ok = n + 1
while ok > ng + 1:
mid = (ok + ng) // 2
if query(ng, mid) >= b:
ok = mid
else:
ng = mid
res.append(ok)
print(("\n".join(map(str, res))))
solve()
| import sys
input = lambda: sys.stdin.readline()
def solve():
def init(init_arr):
global num, segfunc, ide_ele, seg
segfunc = lambda x, y: max(x, y)
ide_ele = 0
num = 2 ** (n - 1).bit_length()
seg = [ide_ele] * 2 * num
for i in range(n):
seg[i + num - 1] = init_arr[i]
for i in range(num - 2, -1, -1):
seg[i] = segfunc(seg[2 * i + 1], seg[2 * i + 2])
def update(k, x):
k += num - 1
seg[k] = x
while k:
k = (k - 1) // 2
seg[k] = segfunc(seg[k * 2 + 1], seg[k * 2 + 2])
def query(p, q):
if q <= p:
return ide_ele
p += num - 1
q += num - 2
res = ide_ele
while q - p > 1:
if p & 1 == 0:
res = segfunc(res, seg[p])
if q & 1 == 1:
res = segfunc(res, seg[q])
q -= 1
p = p // 2
q = (q - 1) // 2
if p == q:
res = segfunc(res, seg[p])
else:
res = segfunc(segfunc(res, seg[p]), seg[q])
return res
n, q = list(map(int, input().split()))
a = list(map(int, input().split()))
init(a)
res = []
for _ in range(q):
t, a, b = list(map(int, input().split()))
if t == 1:
update(a - 1, b)
elif t == 2:
res.append(query(a - 1, b))
elif t == 3:
ng = a - 1
ok = n + 1
while ok > ng + 1:
mid = (ok + ng) // 2
if query(ng, mid) >= b:
ok = mid
else:
ng = mid
res.append(ok)
print(("\n".join(map(str, res))))
solve()
| false | 0 | [
"- def init(init_val):",
"+ def init(init_arr):",
"+ global num, segfunc, ide_ele, seg",
"+ segfunc = lambda x, y: max(x, y)",
"+ ide_ele = 0",
"+ num = 2 ** (n - 1).bit_length()",
"+ seg = [ide_ele] * 2 * num",
"- seg[i + num - 1] = init_val[i]",
"+ seg[i + num - 1] = init_arr[i]",
"- segfunc = lambda x, y: max(x, y)",
"- ide_ele = 0",
"- num = 2 ** (n - 1).bit_length()",
"- seg = [ide_ele] * 2 * num"
]
| false | 0.079853 | 0.048505 | 1.646297 | [
"s534220536",
"s492882207"
]
|
u804800128 | p02580 | python | s199420601 | s338195774 | 987 | 649 | 83,424 | 83,360 | Accepted | Accepted | 34.25 | h,w,m = ( int(x) for x in input().split() )
h_array = [ 0 for i in range(h) ]
w_array = [ 0 for i in range(w) ]
ps = set()
for i in range(m):
hi,wi = ( int(x)-1 for x in input().split() )
h_array[hi] += 1
w_array[wi] += 1
ps.add( (hi,wi) )
h_great = max(h_array)
w_great = max(w_array)
h_greats = list()
w_greats = list()
for i , hi in enumerate(h_array):
if hi == h_great:
h_greats.append(i)
for i , wi in enumerate(w_array):
if wi == w_great:
w_greats.append(i)
ans = h_great + w_great
for _h in h_greats:
for _w in w_greats:
if (_h,_w) in ps:
continue
print(ans)
exit()
print((ans-1)) | import sys
input = sys.stdin.readline
h,w,m = list(map(int,input().split()))
h_array = [ 0 for i in range(h) ]
w_array = [ 0 for i in range(w) ]
ps = set()
for i in range(m):
hi,wi = [int(x) - 1 for x in input().split()]
h_array[hi] += 1
w_array[wi] += 1
ps.add( (hi,wi) )
h_great = max(h_array)
w_great = max(w_array)
h_greats = list()
w_greats = list()
for i , hi in enumerate(h_array):
if hi == h_great:
h_greats.append(i)
for i , wi in enumerate(w_array):
if wi == w_great:
w_greats.append(i)
ans = h_great + w_great
for _h in h_greats:
for _w in w_greats:
if (_h,_w) in ps:
continue
print(ans)
exit()
print((ans-1)) | 32 | 36 | 701 | 743 | h, w, m = (int(x) for x in input().split())
h_array = [0 for i in range(h)]
w_array = [0 for i in range(w)]
ps = set()
for i in range(m):
hi, wi = (int(x) - 1 for x in input().split())
h_array[hi] += 1
w_array[wi] += 1
ps.add((hi, wi))
h_great = max(h_array)
w_great = max(w_array)
h_greats = list()
w_greats = list()
for i, hi in enumerate(h_array):
if hi == h_great:
h_greats.append(i)
for i, wi in enumerate(w_array):
if wi == w_great:
w_greats.append(i)
ans = h_great + w_great
for _h in h_greats:
for _w in w_greats:
if (_h, _w) in ps:
continue
print(ans)
exit()
print((ans - 1))
| import sys
input = sys.stdin.readline
h, w, m = list(map(int, input().split()))
h_array = [0 for i in range(h)]
w_array = [0 for i in range(w)]
ps = set()
for i in range(m):
hi, wi = [int(x) - 1 for x in input().split()]
h_array[hi] += 1
w_array[wi] += 1
ps.add((hi, wi))
h_great = max(h_array)
w_great = max(w_array)
h_greats = list()
w_greats = list()
for i, hi in enumerate(h_array):
if hi == h_great:
h_greats.append(i)
for i, wi in enumerate(w_array):
if wi == w_great:
w_greats.append(i)
ans = h_great + w_great
for _h in h_greats:
for _w in w_greats:
if (_h, _w) in ps:
continue
print(ans)
exit()
print((ans - 1))
| false | 11.111111 | [
"-h, w, m = (int(x) for x in input().split())",
"+import sys",
"+",
"+input = sys.stdin.readline",
"+h, w, m = list(map(int, input().split()))",
"- hi, wi = (int(x) - 1 for x in input().split())",
"+ hi, wi = [int(x) - 1 for x in input().split()]"
]
| false | 0.038094 | 0.037439 | 1.017503 | [
"s199420601",
"s338195774"
]
|
u802963389 | p02580 | python | s350523139 | s435135228 | 1,030 | 690 | 307,184 | 225,260 | Accepted | Accepted | 33.01 | from collections import defaultdict
h, w, m = list(map(int, input().split()))
HW = [list(map(int, input().split())) for _ in range(m)]
dicHW = defaultdict(set)
for h, w in HW:
dicHW[h].add(w)
hd = defaultdict(int)
wd = defaultdict(int)
for i, j in HW:
hd[i] += 1
wd[j] += 1
hd = list(hd.items())
wd = list(wd.items())
hd.sort(key=lambda x: -x[1])
wd.sort(key=lambda x: -x[1])
kouhoh = []
kouhow = []
for i, j in hd:
if j < hd[0][1]:
break
else:
kouhoh.append(i)
for i, j in wd:
if j < wd[0][1]:
break
else:
kouhow.append(i)
for i in kouhoh:
for j in kouhow:
if j not in dicHW[i]:
ans = hd[0][1] + wd[0][1]
print(ans)
exit()
ans = hd[0][1] + wd[0][1] - 1
print(ans)
| from collections import defaultdict
H,W,M = list(map(int,input().split()))
h = [0] * H
w = [0] * W
hw = defaultdict(set)
for _ in range(M):
a,b = list(map(int,input().split()))
h[a - 1] += 1
w[b - 1] += 1
hw[a - 1].add(b - 1)
hm = max(h)
wm = max(w)
hp = [i for i, v in enumerate(h) if v == hm]
wp = [i for i, v in enumerate(w) if v == wm]
for x in hp:
for y in wp:
if y not in hw[x]:
print((hm + wm))
exit()
else:
print((hm + wm - 1))
| 46 | 28 | 771 | 526 | from collections import defaultdict
h, w, m = list(map(int, input().split()))
HW = [list(map(int, input().split())) for _ in range(m)]
dicHW = defaultdict(set)
for h, w in HW:
dicHW[h].add(w)
hd = defaultdict(int)
wd = defaultdict(int)
for i, j in HW:
hd[i] += 1
wd[j] += 1
hd = list(hd.items())
wd = list(wd.items())
hd.sort(key=lambda x: -x[1])
wd.sort(key=lambda x: -x[1])
kouhoh = []
kouhow = []
for i, j in hd:
if j < hd[0][1]:
break
else:
kouhoh.append(i)
for i, j in wd:
if j < wd[0][1]:
break
else:
kouhow.append(i)
for i in kouhoh:
for j in kouhow:
if j not in dicHW[i]:
ans = hd[0][1] + wd[0][1]
print(ans)
exit()
ans = hd[0][1] + wd[0][1] - 1
print(ans)
| from collections import defaultdict
H, W, M = list(map(int, input().split()))
h = [0] * H
w = [0] * W
hw = defaultdict(set)
for _ in range(M):
a, b = list(map(int, input().split()))
h[a - 1] += 1
w[b - 1] += 1
hw[a - 1].add(b - 1)
hm = max(h)
wm = max(w)
hp = [i for i, v in enumerate(h) if v == hm]
wp = [i for i, v in enumerate(w) if v == wm]
for x in hp:
for y in wp:
if y not in hw[x]:
print((hm + wm))
exit()
else:
print((hm + wm - 1))
| false | 39.130435 | [
"-h, w, m = list(map(int, input().split()))",
"-HW = [list(map(int, input().split())) for _ in range(m)]",
"-dicHW = defaultdict(set)",
"-for h, w in HW:",
"- dicHW[h].add(w)",
"-hd = defaultdict(int)",
"-wd = defaultdict(int)",
"-for i, j in HW:",
"- hd[i] += 1",
"- wd[j] += 1",
"-hd = list(hd.items())",
"-wd = list(wd.items())",
"-hd.sort(key=lambda x: -x[1])",
"-wd.sort(key=lambda x: -x[1])",
"-kouhoh = []",
"-kouhow = []",
"-for i, j in hd:",
"- if j < hd[0][1]:",
"- break",
"- else:",
"- kouhoh.append(i)",
"-for i, j in wd:",
"- if j < wd[0][1]:",
"- break",
"- else:",
"- kouhow.append(i)",
"-for i in kouhoh:",
"- for j in kouhow:",
"- if j not in dicHW[i]:",
"- ans = hd[0][1] + wd[0][1]",
"- print(ans)",
"+H, W, M = list(map(int, input().split()))",
"+h = [0] * H",
"+w = [0] * W",
"+hw = defaultdict(set)",
"+for _ in range(M):",
"+ a, b = list(map(int, input().split()))",
"+ h[a - 1] += 1",
"+ w[b - 1] += 1",
"+ hw[a - 1].add(b - 1)",
"+hm = max(h)",
"+wm = max(w)",
"+hp = [i for i, v in enumerate(h) if v == hm]",
"+wp = [i for i, v in enumerate(w) if v == wm]",
"+for x in hp:",
"+ for y in wp:",
"+ if y not in hw[x]:",
"+ print((hm + wm))",
"-ans = hd[0][1] + wd[0][1] - 1",
"-print(ans)",
"+else:",
"+ print((hm + wm - 1))"
]
| false | 0.042023 | 0.041072 | 1.023142 | [
"s350523139",
"s435135228"
]
|
u631299617 | p02678 | python | s550516156 | s873445679 | 757 | 692 | 34,652 | 34,688 | Accepted | Accepted | 8.59 | n,m=list(map(int,input().split()))
r=[[] for x in range(n)]
for c in range(m):
a,b=list(map(int,input().split()))
r[a-1].append(b-1)
r[b-1].append(a-1)
s=[-1]*n
u=[0]
v=[]
k=1
for c in range(10**5):
for d in u:
for e in r[d]:
if s[e]==-1:
s[e]=d
k+=1
v.append(e)
if k>n-1:
break
u=v
print('Yes')
for c in range(n-1):
print((s[c+1]+1)) | n,m=list(map(int,input().split()))
r=[[] for x in range(n)]
for c in range(m):
a,b=list(map(int,input().split()))
r[a-1].append(b-1)
r[b-1].append(a-1)
s=[-1]*n
s[0]=0
u=[0]
k=1
for c in range(10**5):
v=[]
for d in u:
for e in r[d]:
if s[e]==-1:
s[e]=d
k+=1
v.append(e)
if k>n-1:
break
u=v
print('Yes')
for c in s[1:]:
print((c+1)) | 23 | 24 | 446 | 448 | n, m = list(map(int, input().split()))
r = [[] for x in range(n)]
for c in range(m):
a, b = list(map(int, input().split()))
r[a - 1].append(b - 1)
r[b - 1].append(a - 1)
s = [-1] * n
u = [0]
v = []
k = 1
for c in range(10**5):
for d in u:
for e in r[d]:
if s[e] == -1:
s[e] = d
k += 1
v.append(e)
if k > n - 1:
break
u = v
print("Yes")
for c in range(n - 1):
print((s[c + 1] + 1))
| n, m = list(map(int, input().split()))
r = [[] for x in range(n)]
for c in range(m):
a, b = list(map(int, input().split()))
r[a - 1].append(b - 1)
r[b - 1].append(a - 1)
s = [-1] * n
s[0] = 0
u = [0]
k = 1
for c in range(10**5):
v = []
for d in u:
for e in r[d]:
if s[e] == -1:
s[e] = d
k += 1
v.append(e)
if k > n - 1:
break
u = v
print("Yes")
for c in s[1:]:
print((c + 1))
| false | 4.166667 | [
"+s[0] = 0",
"-v = []",
"+ v = []",
"-for c in range(n - 1):",
"- print((s[c + 1] + 1))",
"+for c in s[1:]:",
"+ print((c + 1))"
]
| false | 0.071169 | 0.095035 | 0.748865 | [
"s550516156",
"s873445679"
]
|
u347640436 | p02925 | python | s986190995 | s281031163 | 1,731 | 1,576 | 139,040 | 138,976 | Accepted | Accepted | 8.95 | from sys import exit, setrecursionlimit
def get_node_id(i, j, node_id_db):
if i < j:
return node_id_db[i][j]
else:
return node_id_db[j][i]
def dfs(node_id, edges, dp):
t = dp[node_id]
if t >= 0:
return t
dp[node_id] = 0
result = 0
for n in edges[node_id]:
t = dfs(n, edges, dp)
if t == 0: # looped
print((-1))
exit()
if t > result:
result = t
result += 1
dp[node_id] = result
return result
def main():
N = int(eval(input()))
A = [[int(e) - 1 for e in input().split()] for _ in range(N)]
node_id_db = [[0] * (N+1) for _ in range(N + 1)]
v = 0
for i in range(N):
for j in range(i + 1, N):
node_id_db[i][j] = v
v += 1
start_nodes = []
edges = [[] for _ in range(N * (N - 1) // 2)]
for i in range(N):
Ai = A[i]
from_id = get_node_id(i, Ai[0], node_id_db)
if i < Ai[0]:
start_nodes.append(from_id)
for j in range(1, N - 1):
to_id = get_node_id(i, Ai[j], node_id_db)
edges[from_id].append(to_id)
from_id = to_id
dp = [-1 for _ in range(N * (N - 1) // 2)]
print((max(dfs(n, edges, dp) for n in start_nodes)))
setrecursionlimit(1000000)
main()
| from sys import exit, setrecursionlimit
def get_node_id(i, j, node_id_db):
if i < j:
return node_id_db[i][j]
else:
return node_id_db[j][i]
def dfs(node_id, edges, dp):
t = dp[node_id]
if t >= 0:
return t
dp[node_id] = 0
result = 0
for n in edges[node_id]:
t = dfs(n, edges, dp)
if t == 0: # looped
print((-1))
exit()
if t > result:
result = t
result += 1
dp[node_id] = result
return result
def main():
N = int(eval(input()))
A = [[int(e) - 1 for e in input().split()] for _ in range(N)]
node_id_db = [[0] * N for _ in range(N)]
v = 0
for i in range(N):
for j in range(i + 1, N):
node_id_db[i][j] = v
v += 1
start_nodes = []
edges = [[] for _ in range(N * (N - 1) // 2)]
for i in range(N):
Ai = A[i]
from_id = get_node_id(i, Ai[0], node_id_db)
if i < Ai[0]:
start_nodes.append(from_id)
for j in range(1, N - 1):
to_id = get_node_id(i, Ai[j], node_id_db)
edges[from_id].append(to_id)
from_id = to_id
dp = [-1 for _ in range(N * (N - 1) // 2)]
print((max(dfs(n, edges, dp) for n in start_nodes)))
setrecursionlimit(1000000)
main()
| 57 | 57 | 1,370 | 1,362 | from sys import exit, setrecursionlimit
def get_node_id(i, j, node_id_db):
if i < j:
return node_id_db[i][j]
else:
return node_id_db[j][i]
def dfs(node_id, edges, dp):
t = dp[node_id]
if t >= 0:
return t
dp[node_id] = 0
result = 0
for n in edges[node_id]:
t = dfs(n, edges, dp)
if t == 0: # looped
print((-1))
exit()
if t > result:
result = t
result += 1
dp[node_id] = result
return result
def main():
N = int(eval(input()))
A = [[int(e) - 1 for e in input().split()] for _ in range(N)]
node_id_db = [[0] * (N + 1) for _ in range(N + 1)]
v = 0
for i in range(N):
for j in range(i + 1, N):
node_id_db[i][j] = v
v += 1
start_nodes = []
edges = [[] for _ in range(N * (N - 1) // 2)]
for i in range(N):
Ai = A[i]
from_id = get_node_id(i, Ai[0], node_id_db)
if i < Ai[0]:
start_nodes.append(from_id)
for j in range(1, N - 1):
to_id = get_node_id(i, Ai[j], node_id_db)
edges[from_id].append(to_id)
from_id = to_id
dp = [-1 for _ in range(N * (N - 1) // 2)]
print((max(dfs(n, edges, dp) for n in start_nodes)))
setrecursionlimit(1000000)
main()
| from sys import exit, setrecursionlimit
def get_node_id(i, j, node_id_db):
if i < j:
return node_id_db[i][j]
else:
return node_id_db[j][i]
def dfs(node_id, edges, dp):
t = dp[node_id]
if t >= 0:
return t
dp[node_id] = 0
result = 0
for n in edges[node_id]:
t = dfs(n, edges, dp)
if t == 0: # looped
print((-1))
exit()
if t > result:
result = t
result += 1
dp[node_id] = result
return result
def main():
N = int(eval(input()))
A = [[int(e) - 1 for e in input().split()] for _ in range(N)]
node_id_db = [[0] * N for _ in range(N)]
v = 0
for i in range(N):
for j in range(i + 1, N):
node_id_db[i][j] = v
v += 1
start_nodes = []
edges = [[] for _ in range(N * (N - 1) // 2)]
for i in range(N):
Ai = A[i]
from_id = get_node_id(i, Ai[0], node_id_db)
if i < Ai[0]:
start_nodes.append(from_id)
for j in range(1, N - 1):
to_id = get_node_id(i, Ai[j], node_id_db)
edges[from_id].append(to_id)
from_id = to_id
dp = [-1 for _ in range(N * (N - 1) // 2)]
print((max(dfs(n, edges, dp) for n in start_nodes)))
setrecursionlimit(1000000)
main()
| false | 0 | [
"- node_id_db = [[0] * (N + 1) for _ in range(N + 1)]",
"+ node_id_db = [[0] * N for _ in range(N)]"
]
| false | 0.157641 | 0.142391 | 1.107094 | [
"s986190995",
"s281031163"
]
|
u094191970 | p03599 | python | s458851527 | s290953549 | 1,340 | 102 | 12,456 | 12,440 | Accepted | Accepted | 92.39 | a,b,c,d,e,f=list(map(int,input().split()))
water_g=[]
for i in range(f//100+1):
for j in range(f//100+1):
# print(i,j)
w=100*a*i + 100*b*j
if w<=f:
water_g.append(w)
water_g=sorted(list(set(water_g)),reverse=True)
sugar_g=[]
for i in range(f*e//100):
for j in range(f*e//100):
s=c*i + d*j
if s<=f:
sugar_g.append(s)
sugar_g=sorted(list(set(sugar_g)),reverse=True)
#print(water_g, sugar_g)
ans_water=100*a
ans_sugar=0
for water in water_g:
if water==0:
break
for sugar in sugar_g:
if water+sugar<=f and sugar/water<=e/100:
if sugar/(sugar+water)>ans_sugar/(ans_sugar+ans_water):
ans_water=water
ans_sugar=sugar
print((ans_water+ans_sugar,ans_sugar)) | a,b,c,d,e,f=list(map(int,input().split()))
water_g=[]
for i in range(f//100+1):
for j in range(f//100+1):
# print(i,j)
w=100*a*i + 100*b*j
if w<=f:
water_g.append(w)
else:
break
water_g=sorted(list(set(water_g)),reverse=True)
sugar_g=[]
for i in range(f*e//100):
for j in range(f*e//100):
s=c*i + d*j
if s<=f:
sugar_g.append(s)
else:
break
sugar_g=sorted(list(set(sugar_g)),reverse=True)
#print(water_g, sugar_g)
ans_water=100*a
ans_sugar=0
for water in water_g:
if water==0:
break
for sugar in sugar_g:
if water+sugar<=f and sugar/water<=e/100:
if sugar/(sugar+water)>ans_sugar/(ans_sugar+ans_water):
ans_water=water
ans_sugar=sugar
print((ans_water+ans_sugar,ans_sugar)) | 32 | 36 | 744 | 792 | a, b, c, d, e, f = list(map(int, input().split()))
water_g = []
for i in range(f // 100 + 1):
for j in range(f // 100 + 1):
# print(i,j)
w = 100 * a * i + 100 * b * j
if w <= f:
water_g.append(w)
water_g = sorted(list(set(water_g)), reverse=True)
sugar_g = []
for i in range(f * e // 100):
for j in range(f * e // 100):
s = c * i + d * j
if s <= f:
sugar_g.append(s)
sugar_g = sorted(list(set(sugar_g)), reverse=True)
# print(water_g, sugar_g)
ans_water = 100 * a
ans_sugar = 0
for water in water_g:
if water == 0:
break
for sugar in sugar_g:
if water + sugar <= f and sugar / water <= e / 100:
if sugar / (sugar + water) > ans_sugar / (ans_sugar + ans_water):
ans_water = water
ans_sugar = sugar
print((ans_water + ans_sugar, ans_sugar))
| a, b, c, d, e, f = list(map(int, input().split()))
water_g = []
for i in range(f // 100 + 1):
for j in range(f // 100 + 1):
# print(i,j)
w = 100 * a * i + 100 * b * j
if w <= f:
water_g.append(w)
else:
break
water_g = sorted(list(set(water_g)), reverse=True)
sugar_g = []
for i in range(f * e // 100):
for j in range(f * e // 100):
s = c * i + d * j
if s <= f:
sugar_g.append(s)
else:
break
sugar_g = sorted(list(set(sugar_g)), reverse=True)
# print(water_g, sugar_g)
ans_water = 100 * a
ans_sugar = 0
for water in water_g:
if water == 0:
break
for sugar in sugar_g:
if water + sugar <= f and sugar / water <= e / 100:
if sugar / (sugar + water) > ans_sugar / (ans_sugar + ans_water):
ans_water = water
ans_sugar = sugar
print((ans_water + ans_sugar, ans_sugar))
| false | 11.111111 | [
"+ else:",
"+ break",
"+ else:",
"+ break"
]
| false | 0.438214 | 0.074074 | 5.915873 | [
"s458851527",
"s290953549"
]
|
u648212584 | p03033 | python | s290290583 | s543872248 | 1,522 | 1,332 | 142,136 | 97,552 | Accepted | Accepted | 12.48 | import sys
input = sys.stdin.readline
from heapq import heappop,heappush
N,Q = list(map(int,input().split()))
task = []
STX = [[int(x) for x in input().split()] for _ in range(N)]
for s,t,x in STX:
task.append((t-x,0,x))
task.append((s-x,1,x))
for i in range(Q):
d = int(eval(input()))
task.append((d,2,i))
answer = [-1]*Q
task.sort()
se = set()
se_hp = []
for a,b,c in task:
if not b:
se.remove(c)
elif b&1:
se.add(c)
heappush(se_hp,c)
else:
while se_hp and se_hp[0] not in se:
heappop(se_hp)
answer[c] = se_hp[0] if se_hp else -1
print(('\n'.join(map(str,answer))))
| import sys
input = sys.stdin.buffer.readline
import heapq
def main():
N,Q = list(map(int,input().split()))
event = []
for _ in range(N):
s,t,x = list(map(int,input().split()))
event.append((s-x,1,x))
event.append((t-x,0,x))
for i in range(Q):
a = int(eval(input()))
event.append((a,2,i))
event.sort()
ans = [-1]*Q
use = set()
stop = []
for a,b,c in event:
if b == 1:
use.add(c)
heapq.heappush(stop,c)
elif b == 0:
use.remove(c)
else:
while stop and stop[0] not in use:
heapq.heappop(stop)
ans[c] = -1 if len(stop) == 0 else stop[0]
for num in ans:
print(num)
if __name__ == "__main__":
main()
| 33 | 38 | 632 | 835 | import sys
input = sys.stdin.readline
from heapq import heappop, heappush
N, Q = list(map(int, input().split()))
task = []
STX = [[int(x) for x in input().split()] for _ in range(N)]
for s, t, x in STX:
task.append((t - x, 0, x))
task.append((s - x, 1, x))
for i in range(Q):
d = int(eval(input()))
task.append((d, 2, i))
answer = [-1] * Q
task.sort()
se = set()
se_hp = []
for a, b, c in task:
if not b:
se.remove(c)
elif b & 1:
se.add(c)
heappush(se_hp, c)
else:
while se_hp and se_hp[0] not in se:
heappop(se_hp)
answer[c] = se_hp[0] if se_hp else -1
print(("\n".join(map(str, answer))))
| import sys
input = sys.stdin.buffer.readline
import heapq
def main():
N, Q = list(map(int, input().split()))
event = []
for _ in range(N):
s, t, x = list(map(int, input().split()))
event.append((s - x, 1, x))
event.append((t - x, 0, x))
for i in range(Q):
a = int(eval(input()))
event.append((a, 2, i))
event.sort()
ans = [-1] * Q
use = set()
stop = []
for a, b, c in event:
if b == 1:
use.add(c)
heapq.heappush(stop, c)
elif b == 0:
use.remove(c)
else:
while stop and stop[0] not in use:
heapq.heappop(stop)
ans[c] = -1 if len(stop) == 0 else stop[0]
for num in ans:
print(num)
if __name__ == "__main__":
main()
| false | 13.157895 | [
"-input = sys.stdin.readline",
"-from heapq import heappop, heappush",
"+input = sys.stdin.buffer.readline",
"+import heapq",
"-N, Q = list(map(int, input().split()))",
"-task = []",
"-STX = [[int(x) for x in input().split()] for _ in range(N)]",
"-for s, t, x in STX:",
"- task.append((t - x, 0, x))",
"- task.append((s - x, 1, x))",
"-for i in range(Q):",
"- d = int(eval(input()))",
"- task.append((d, 2, i))",
"-answer = [-1] * Q",
"-task.sort()",
"-se = set()",
"-se_hp = []",
"-for a, b, c in task:",
"- if not b:",
"- se.remove(c)",
"- elif b & 1:",
"- se.add(c)",
"- heappush(se_hp, c)",
"- else:",
"- while se_hp and se_hp[0] not in se:",
"- heappop(se_hp)",
"- answer[c] = se_hp[0] if se_hp else -1",
"-print((\"\\n\".join(map(str, answer))))",
"+",
"+def main():",
"+ N, Q = list(map(int, input().split()))",
"+ event = []",
"+ for _ in range(N):",
"+ s, t, x = list(map(int, input().split()))",
"+ event.append((s - x, 1, x))",
"+ event.append((t - x, 0, x))",
"+ for i in range(Q):",
"+ a = int(eval(input()))",
"+ event.append((a, 2, i))",
"+ event.sort()",
"+ ans = [-1] * Q",
"+ use = set()",
"+ stop = []",
"+ for a, b, c in event:",
"+ if b == 1:",
"+ use.add(c)",
"+ heapq.heappush(stop, c)",
"+ elif b == 0:",
"+ use.remove(c)",
"+ else:",
"+ while stop and stop[0] not in use:",
"+ heapq.heappop(stop)",
"+ ans[c] = -1 if len(stop) == 0 else stop[0]",
"+ for num in ans:",
"+ print(num)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.041112 | 0.041187 | 0.998176 | [
"s290290583",
"s543872248"
]
|
u533039576 | p03018 | python | s606483650 | s772195915 | 114 | 57 | 3,500 | 3,500 | Accepted | Accepted | 50 | s = eval(input())
ans = 0
x = 0
index = 0
while index < len(s):
if s[index] == 'A':
x += 1
index += 1
elif s[index:index+2] == "BC":
ans += x
index += 2
else:
index += 1
x = 0
print(ans)
| s = eval(input())
s = s.replace("BC", 'D')
ans = 0
x = 0
for i in range(len(s)):
if s[i] == 'A':
x += 1
elif s[i] == 'D':
ans += x
else:
x = 0
print(ans)
| 18 | 14 | 263 | 199 | s = eval(input())
ans = 0
x = 0
index = 0
while index < len(s):
if s[index] == "A":
x += 1
index += 1
elif s[index : index + 2] == "BC":
ans += x
index += 2
else:
index += 1
x = 0
print(ans)
| s = eval(input())
s = s.replace("BC", "D")
ans = 0
x = 0
for i in range(len(s)):
if s[i] == "A":
x += 1
elif s[i] == "D":
ans += x
else:
x = 0
print(ans)
| false | 22.222222 | [
"+s = s.replace(\"BC\", \"D\")",
"-index = 0",
"-while index < len(s):",
"- if s[index] == \"A\":",
"+for i in range(len(s)):",
"+ if s[i] == \"A\":",
"- index += 1",
"- elif s[index : index + 2] == \"BC\":",
"+ elif s[i] == \"D\":",
"- index += 2",
"- index += 1"
]
| false | 0.039017 | 0.121449 | 0.321264 | [
"s606483650",
"s772195915"
]
|
u423624748 | p02597 | python | s993743718 | s815014414 | 269 | 217 | 18,532 | 26,784 | Accepted | Accepted | 19.33 | n = int(eval(input()))
c = eval(input())
w = [0]*(n+1)
r = [0]*(n+1)
for i in range(0,n):
w[i+1] = w[i]
r[n-i-1] = r[n-i]
if c[i]=='W':
w[i+1] += 1
if c[n-i-1]=='R':
r[n-i-1] += 1
ans = 1e10
for i in range(0,n+1):
ans = min(ans,w[i]+r[i]-min(w[i],r[i]))
print(ans) | n = int(eval(input()))
c = eval(input())
w = [0]*(n+1)
r = [0]*(n+1)
for i in range(0,n):
w[i+1] = w[i]
r[n-i-1] = r[n-i]
if c[i]=='W':
w[i+1] += 1
if c[n-i-1]=='R':
r[n-i-1] += 1
print((min([w[i]+r[i]-min(w[i],r[i]) for i in range(0,n+1)])))
| 17 | 14 | 288 | 260 | n = int(eval(input()))
c = eval(input())
w = [0] * (n + 1)
r = [0] * (n + 1)
for i in range(0, n):
w[i + 1] = w[i]
r[n - i - 1] = r[n - i]
if c[i] == "W":
w[i + 1] += 1
if c[n - i - 1] == "R":
r[n - i - 1] += 1
ans = 1e10
for i in range(0, n + 1):
ans = min(ans, w[i] + r[i] - min(w[i], r[i]))
print(ans)
| n = int(eval(input()))
c = eval(input())
w = [0] * (n + 1)
r = [0] * (n + 1)
for i in range(0, n):
w[i + 1] = w[i]
r[n - i - 1] = r[n - i]
if c[i] == "W":
w[i + 1] += 1
if c[n - i - 1] == "R":
r[n - i - 1] += 1
print((min([w[i] + r[i] - min(w[i], r[i]) for i in range(0, n + 1)])))
| false | 17.647059 | [
"-ans = 1e10",
"-for i in range(0, n + 1):",
"- ans = min(ans, w[i] + r[i] - min(w[i], r[i]))",
"-print(ans)",
"+print((min([w[i] + r[i] - min(w[i], r[i]) for i in range(0, n + 1)])))"
]
| false | 0.03906 | 0.043365 | 0.900721 | [
"s993743718",
"s815014414"
]
|
u867848444 | p04015 | python | s414549199 | s616065381 | 396 | 306 | 93,020 | 91,484 | Accepted | Accepted | 22.73 | n,a=list(map(int,input().split()))
x=list(map(int,input().split()))
dp=[[[0]*(a*n+1) for i in range(n+1)] for i in range(n+1)]
dp[0][0][0]=1
#dp[i番目のカード][選んだ枚数][数の合計]=何組あるか
for i in range(n):
for j in range(n):
for k in range(a*n+1):
if k+x[i]<=a*n:
#i番目を入れる場合
dp[i+1][j+1][k+x[i]]+=dp[i][j][k]
#いれない場合
dp[i+1][j][k]+=dp[i][j][k]
ans=0
cnt=0
#print(*dp,sep='\n')
for i in dp[-1]:
ans+=i[cnt*a]
cnt+=1
print((ans-1)) | n,a=list(map(int,input().split()))
x=list(map(int,input().split()))
dp=[[[0]*(n*50+1) for i in range(n+1)] for i in range(n)]
#dp[i][j][k]=i番目まででj枚のカードを選んだ時の合計がkになる組み合わせ
dp[0][0][0]=1
dp[0][1][x[0]]=1
for i in range(1,n):
for j in range(n+1):
for k in range(n*50+1):
if dp[i-1][j][k]==0:continue
#入れるとき
dp[i][j+1][k+x[i]]+=dp[i-1][j][k]
#入れない時
dp[i][j][k]+=dp[i-1][j][k]
ans=0
for j in range(1,n+1):
for k in range(n*50+1):
if a*j==k:
ans+=dp[-1][j][k]
print(ans)
#print(*dp[-1],sep='\n') | 21 | 23 | 516 | 602 | n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
dp = [[[0] * (a * n + 1) for i in range(n + 1)] for i in range(n + 1)]
dp[0][0][0] = 1
# dp[i番目のカード][選んだ枚数][数の合計]=何組あるか
for i in range(n):
for j in range(n):
for k in range(a * n + 1):
if k + x[i] <= a * n:
# i番目を入れる場合
dp[i + 1][j + 1][k + x[i]] += dp[i][j][k]
# いれない場合
dp[i + 1][j][k] += dp[i][j][k]
ans = 0
cnt = 0
# print(*dp,sep='\n')
for i in dp[-1]:
ans += i[cnt * a]
cnt += 1
print((ans - 1))
| n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
dp = [[[0] * (n * 50 + 1) for i in range(n + 1)] for i in range(n)]
# dp[i][j][k]=i番目まででj枚のカードを選んだ時の合計がkになる組み合わせ
dp[0][0][0] = 1
dp[0][1][x[0]] = 1
for i in range(1, n):
for j in range(n + 1):
for k in range(n * 50 + 1):
if dp[i - 1][j][k] == 0:
continue
# 入れるとき
dp[i][j + 1][k + x[i]] += dp[i - 1][j][k]
# 入れない時
dp[i][j][k] += dp[i - 1][j][k]
ans = 0
for j in range(1, n + 1):
for k in range(n * 50 + 1):
if a * j == k:
ans += dp[-1][j][k]
print(ans)
# print(*dp[-1],sep='\n')
| false | 8.695652 | [
"-dp = [[[0] * (a * n + 1) for i in range(n + 1)] for i in range(n + 1)]",
"+dp = [[[0] * (n * 50 + 1) for i in range(n + 1)] for i in range(n)]",
"+# dp[i][j][k]=i番目まででj枚のカードを選んだ時の合計がkになる組み合わせ",
"-# dp[i番目のカード][選んだ枚数][数の合計]=何組あるか",
"-for i in range(n):",
"- for j in range(n):",
"- for k in range(a * n + 1):",
"- if k + x[i] <= a * n:",
"- # i番目を入れる場合",
"- dp[i + 1][j + 1][k + x[i]] += dp[i][j][k]",
"- # いれない場合",
"- dp[i + 1][j][k] += dp[i][j][k]",
"+dp[0][1][x[0]] = 1",
"+for i in range(1, n):",
"+ for j in range(n + 1):",
"+ for k in range(n * 50 + 1):",
"+ if dp[i - 1][j][k] == 0:",
"+ continue",
"+ # 入れるとき",
"+ dp[i][j + 1][k + x[i]] += dp[i - 1][j][k]",
"+ # 入れない時",
"+ dp[i][j][k] += dp[i - 1][j][k]",
"-cnt = 0",
"-# print(*dp,sep='\\n')",
"-for i in dp[-1]:",
"- ans += i[cnt * a]",
"- cnt += 1",
"-print((ans - 1))",
"+for j in range(1, n + 1):",
"+ for k in range(n * 50 + 1):",
"+ if a * j == k:",
"+ ans += dp[-1][j][k]",
"+print(ans)",
"+# print(*dp[-1],sep='\\n')"
]
| false | 0.207819 | 0.207074 | 1.003597 | [
"s414549199",
"s616065381"
]
|
u695197008 | p02860 | python | s160048424 | s758091758 | 34 | 10 | 27,884 | 2,568 | Accepted | Accepted | 70.59 | import itertools
import math
N = int(input());
S = input().strip()
def good(s):
if len(s) % 2 == 1:
return False
n = len(s) / 2
return all(s[i] == s[i+n] for i in range(n))
print("Yes" if good(S) else "No")
| n = int(input())
if n % 2 > 0:
print("No")
else:
s = input().strip()
h = n/2
print("Yes" if s[:h] == s[h:] else "No") | 14 | 7 | 255 | 137 | import itertools
import math
N = int(input())
S = input().strip()
def good(s):
if len(s) % 2 == 1:
return False
n = len(s) / 2
return all(s[i] == s[i + n] for i in range(n))
print("Yes" if good(S) else "No")
| n = int(input())
if n % 2 > 0:
print("No")
else:
s = input().strip()
h = n / 2
print("Yes" if s[:h] == s[h:] else "No")
| false | 50 | [
"-import itertools",
"-import math",
"-",
"-N = int(input())",
"-S = input().strip()",
"-",
"-",
"-def good(s):",
"- if len(s) % 2 == 1:",
"- return False",
"- n = len(s) / 2",
"- return all(s[i] == s[i + n] for i in range(n))",
"-",
"-",
"-print(\"Yes\" if good(S) else \"No\")",
"+n = int(input())",
"+if n % 2 > 0:",
"+ print(\"No\")",
"+else:",
"+ s = input().strip()",
"+ h = n / 2",
"+ print(\"Yes\" if s[:h] == s[h:] else \"No\")"
]
| false | 0.052688 | 0.052085 | 1.011563 | [
"s160048424",
"s758091758"
]
|
u903005414 | p02755 | python | s581920281 | s515679196 | 31 | 17 | 2,940 | 2,940 | Accepted | Accepted | 45.16 | A, B = list(map(int, input().split()))
ans = -1
for i in range(1, 20001):
a = int(i * 1.08) - i
b = int(i * 1.1) - i
if A == a and B == b:
ans = i
break
print(ans)
| A, B= list(map(int, input().split()))
for i in range(1,1010):
if int(i*0.08)==A and int(i*0.1)==B:
print(i)
break
else:
print('-1')
| 10 | 8 | 196 | 158 | A, B = list(map(int, input().split()))
ans = -1
for i in range(1, 20001):
a = int(i * 1.08) - i
b = int(i * 1.1) - i
if A == a and B == b:
ans = i
break
print(ans)
| A, B = list(map(int, input().split()))
for i in range(1, 1010):
if int(i * 0.08) == A and int(i * 0.1) == B:
print(i)
break
else:
print("-1")
| false | 20 | [
"-ans = -1",
"-for i in range(1, 20001):",
"- a = int(i * 1.08) - i",
"- b = int(i * 1.1) - i",
"- if A == a and B == b:",
"- ans = i",
"+for i in range(1, 1010):",
"+ if int(i * 0.08) == A and int(i * 0.1) == B:",
"+ print(i)",
"-print(ans)",
"+else:",
"+ print(\"-1\")"
]
| false | 0.191245 | 0.100877 | 1.895814 | [
"s581920281",
"s515679196"
]
|
u263830634 | p02728 | python | s347748290 | s245395439 | 2,495 | 2,280 | 103,748 | 87,832 | Accepted | Accepted | 8.62 | import sys
input = sys.stdin.readline
from collections import deque
class Factorial:
def __init__(self, n, mod):
self.f = [1]
self.mod = mod
for j in range(1, n + 1):
self.f.append(self.f[-1] * j % mod)
self.i = [pow(self.f[-1], mod - 2, mod)]
for j in range(n, 0, -1):
self.i.append(self.i[-1] * j % mod)
self.i.reverse()
def factorial(self, j):
return self.f[j]
def ifactorial(self, j):
return self.i[j]
def comb(self, n, k):
return self.f[n] * self.i[n - k] % self.mod * self.i[k] % self.mod if n >= k else 0
MOD = 10 ** 9 + 7
N = int(eval(input()))
c = Factorial(N + 2, MOD)
G = [[] for _ in range(N + 1)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
G[a].append(b)
G[b].append(a)
edge_num = [len(G[i]) for i in range(N + 1)]
que = deque()
check = [0] * (N + 1)
order = []
o_append =order.append
q_pop = que.pop
q_append = que.append
q_append((1, 0))
check[1] = 1
while que:
now = q_pop()
o_append(now)
for next_ in G[now[0]]:
if check[next_] == 0:
q_append((next_, now[0]))
check[next_] = 1
# print (order)
size1 = [0] * (N + 1) #自身を頂点とする部分木のサイズ、木の根は頂点0
dp1 = [1] * (N + 1)
for child, parent in order[::-1]:
dp1[child] *= c.factorial(size1[child])
dp1[child] %= MOD
s = size1[child] + 1
size1[parent] += s
dp1[parent] *= c.ifactorial(s) * dp1[child]
dp1[parent] %= MOD
# print (size1)
# print (dp1)
size2 = [N - 2 - x for x in size1]
dp2 = [1] * (N + 1)
# print (size1)
# print (size2)
for child, parent in order[1:]:
x = dp1[parent]
x *= dp2[parent]
x *= c.ifactorial(size1[parent])
x *= c.factorial(size1[child] + 1)
x *= pow(dp1[child], MOD - 2, MOD) #割り算
x *= c.factorial(size2[child])
x *= c.ifactorial(size2[parent] + 1)
dp2[child] = x % MOD
# print (dp2)
for x1, x2, s1, s2 in zip(dp1[1:], dp2[1:], size1[1:], size2[1:]):
s2 += 1
x = x1 * x2 * c.factorial(s1 + s2) * c.ifactorial(s1) * c.ifactorial(s2) % MOD
print (x) | import sys
input = sys.stdin.readline
MOD = 10 ** 9 + 7
class Factorial:
def __init__(self, n, mod):
self.f = [1]
self.mod = mod
for j in range(1, n + 1):
self.f.append(self.f[-1] * j % mod)
self.i = [pow(self.f[-1], mod - 2, mod)]
for j in range(n, 0, -1):
self.i.append(self.i[-1] * j % mod)
self.i.reverse()
def factorial(self, j):
return self.f[j]
def ifactorial(self, j):
return self.i[j]
def comb(self, n, k):
return self.f[n] * self.i[n - k] % self.mod * self.i[k] % self.mod if n >= k else 0
N = int(input())
C = Factorial(N + 1, MOD)
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
order = []
order_append = order.append
stack = [(0, -1)]
stack_pop = stack.pop
stack_append = stack.append
while stack:
tmp = stack_pop()
order_append(tmp)
for next_ in G[tmp[0]]:
if next_ == tmp[1]:
continue
stack_append((next_, tmp[0]))
size = [1] * N
dp = [1] * N
# print (order)
for c, p in order[::-1]:
if c == 0:
break
size[p] += size[c]
for c, p in order[::-1]:
dp[c] = (dp[c] * C.factorial(size[c] - 1)) % MOD
if c == 0:
break
# dp[c] = (dp[c] * C.factorial(size[c] - 1)) % MOD
dp[p] = (dp[p] * dp[c] % MOD) * C.ifactorial(size[c]) % MOD
# print (dp)
dp2 = [0] * N
dp2[0] = dp[0]
for c, p in order[1::]:
tmp = (dp2[p] * C.factorial(N - 1 - size[c]) % MOD) * C.factorial(size[c]) % MOD
red = (tmp * C.ifactorial(N - 1) % MOD) * pow(dp[c], MOD - 2, MOD) % MOD
size_red = N - size[c]
tmp = (dp[c] * red % MOD) * C.factorial(N - 1) % MOD
dp2[c] = (tmp * C.ifactorial(size[c] - 1) % MOD) * C.ifactorial(size_red) % MOD
print (*dp2, sep = '\n')
| 91 | 80 | 2,179 | 1,948 | import sys
input = sys.stdin.readline
from collections import deque
class Factorial:
def __init__(self, n, mod):
self.f = [1]
self.mod = mod
for j in range(1, n + 1):
self.f.append(self.f[-1] * j % mod)
self.i = [pow(self.f[-1], mod - 2, mod)]
for j in range(n, 0, -1):
self.i.append(self.i[-1] * j % mod)
self.i.reverse()
def factorial(self, j):
return self.f[j]
def ifactorial(self, j):
return self.i[j]
def comb(self, n, k):
return (
self.f[n] * self.i[n - k] % self.mod * self.i[k] % self.mod if n >= k else 0
)
MOD = 10**9 + 7
N = int(eval(input()))
c = Factorial(N + 2, MOD)
G = [[] for _ in range(N + 1)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
G[a].append(b)
G[b].append(a)
edge_num = [len(G[i]) for i in range(N + 1)]
que = deque()
check = [0] * (N + 1)
order = []
o_append = order.append
q_pop = que.pop
q_append = que.append
q_append((1, 0))
check[1] = 1
while que:
now = q_pop()
o_append(now)
for next_ in G[now[0]]:
if check[next_] == 0:
q_append((next_, now[0]))
check[next_] = 1
# print (order)
size1 = [0] * (N + 1) # 自身を頂点とする部分木のサイズ、木の根は頂点0
dp1 = [1] * (N + 1)
for child, parent in order[::-1]:
dp1[child] *= c.factorial(size1[child])
dp1[child] %= MOD
s = size1[child] + 1
size1[parent] += s
dp1[parent] *= c.ifactorial(s) * dp1[child]
dp1[parent] %= MOD
# print (size1)
# print (dp1)
size2 = [N - 2 - x for x in size1]
dp2 = [1] * (N + 1)
# print (size1)
# print (size2)
for child, parent in order[1:]:
x = dp1[parent]
x *= dp2[parent]
x *= c.ifactorial(size1[parent])
x *= c.factorial(size1[child] + 1)
x *= pow(dp1[child], MOD - 2, MOD) # 割り算
x *= c.factorial(size2[child])
x *= c.ifactorial(size2[parent] + 1)
dp2[child] = x % MOD
# print (dp2)
for x1, x2, s1, s2 in zip(dp1[1:], dp2[1:], size1[1:], size2[1:]):
s2 += 1
x = x1 * x2 * c.factorial(s1 + s2) * c.ifactorial(s1) * c.ifactorial(s2) % MOD
print(x)
| import sys
input = sys.stdin.readline
MOD = 10**9 + 7
class Factorial:
def __init__(self, n, mod):
self.f = [1]
self.mod = mod
for j in range(1, n + 1):
self.f.append(self.f[-1] * j % mod)
self.i = [pow(self.f[-1], mod - 2, mod)]
for j in range(n, 0, -1):
self.i.append(self.i[-1] * j % mod)
self.i.reverse()
def factorial(self, j):
return self.f[j]
def ifactorial(self, j):
return self.i[j]
def comb(self, n, k):
return (
self.f[n] * self.i[n - k] % self.mod * self.i[k] % self.mod if n >= k else 0
)
N = int(input())
C = Factorial(N + 1, MOD)
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
order = []
order_append = order.append
stack = [(0, -1)]
stack_pop = stack.pop
stack_append = stack.append
while stack:
tmp = stack_pop()
order_append(tmp)
for next_ in G[tmp[0]]:
if next_ == tmp[1]:
continue
stack_append((next_, tmp[0]))
size = [1] * N
dp = [1] * N
# print (order)
for c, p in order[::-1]:
if c == 0:
break
size[p] += size[c]
for c, p in order[::-1]:
dp[c] = (dp[c] * C.factorial(size[c] - 1)) % MOD
if c == 0:
break
# dp[c] = (dp[c] * C.factorial(size[c] - 1)) % MOD
dp[p] = (dp[p] * dp[c] % MOD) * C.ifactorial(size[c]) % MOD
# print (dp)
dp2 = [0] * N
dp2[0] = dp[0]
for c, p in order[1::]:
tmp = (dp2[p] * C.factorial(N - 1 - size[c]) % MOD) * C.factorial(size[c]) % MOD
red = (tmp * C.ifactorial(N - 1) % MOD) * pow(dp[c], MOD - 2, MOD) % MOD
size_red = N - size[c]
tmp = (dp[c] * red % MOD) * C.factorial(N - 1) % MOD
dp2[c] = (tmp * C.ifactorial(size[c] - 1) % MOD) * C.ifactorial(size_red) % MOD
print(*dp2, sep="\n")
| false | 12.087912 | [
"-from collections import deque",
"+MOD = 10**9 + 7",
"-MOD = 10**9 + 7",
"-N = int(eval(input()))",
"-c = Factorial(N + 2, MOD)",
"-G = [[] for _ in range(N + 1)]",
"+N = int(input())",
"+C = Factorial(N + 1, MOD)",
"+G = [[] for _ in range(N)]",
"- a, b = list(map(int, input().split()))",
"+ a, b = map(int, input().split())",
"+ a -= 1",
"+ b -= 1",
"-edge_num = [len(G[i]) for i in range(N + 1)]",
"-que = deque()",
"-check = [0] * (N + 1)",
"-o_append = order.append",
"-q_pop = que.pop",
"-q_append = que.append",
"-q_append((1, 0))",
"-check[1] = 1",
"-while que:",
"- now = q_pop()",
"- o_append(now)",
"- for next_ in G[now[0]]:",
"- if check[next_] == 0:",
"- q_append((next_, now[0]))",
"- check[next_] = 1",
"+order_append = order.append",
"+stack = [(0, -1)]",
"+stack_pop = stack.pop",
"+stack_append = stack.append",
"+while stack:",
"+ tmp = stack_pop()",
"+ order_append(tmp)",
"+ for next_ in G[tmp[0]]:",
"+ if next_ == tmp[1]:",
"+ continue",
"+ stack_append((next_, tmp[0]))",
"+size = [1] * N",
"+dp = [1] * N",
"-size1 = [0] * (N + 1) # 自身を頂点とする部分木のサイズ、木の根は頂点0",
"-dp1 = [1] * (N + 1)",
"-for child, parent in order[::-1]:",
"- dp1[child] *= c.factorial(size1[child])",
"- dp1[child] %= MOD",
"- s = size1[child] + 1",
"- size1[parent] += s",
"- dp1[parent] *= c.ifactorial(s) * dp1[child]",
"- dp1[parent] %= MOD",
"-# print (size1)",
"-# print (dp1)",
"-size2 = [N - 2 - x for x in size1]",
"-dp2 = [1] * (N + 1)",
"-# print (size1)",
"-# print (size2)",
"-for child, parent in order[1:]:",
"- x = dp1[parent]",
"- x *= dp2[parent]",
"- x *= c.ifactorial(size1[parent])",
"- x *= c.factorial(size1[child] + 1)",
"- x *= pow(dp1[child], MOD - 2, MOD) # 割り算",
"- x *= c.factorial(size2[child])",
"- x *= c.ifactorial(size2[parent] + 1)",
"- dp2[child] = x % MOD",
"-# print (dp2)",
"-for x1, x2, s1, s2 in zip(dp1[1:], dp2[1:], size1[1:], size2[1:]):",
"- s2 += 1",
"- x = x1 * x2 * c.factorial(s1 + s2) * c.ifactorial(s1) * c.ifactorial(s2) % MOD",
"- print(x)",
"+for c, p in order[::-1]:",
"+ if c == 0:",
"+ break",
"+ size[p] += size[c]",
"+for c, p in order[::-1]:",
"+ dp[c] = (dp[c] * C.factorial(size[c] - 1)) % MOD",
"+ if c == 0:",
"+ break",
"+ # dp[c] = (dp[c] * C.factorial(size[c] - 1)) % MOD",
"+ dp[p] = (dp[p] * dp[c] % MOD) * C.ifactorial(size[c]) % MOD",
"+# print (dp)",
"+dp2 = [0] * N",
"+dp2[0] = dp[0]",
"+for c, p in order[1::]:",
"+ tmp = (dp2[p] * C.factorial(N - 1 - size[c]) % MOD) * C.factorial(size[c]) % MOD",
"+ red = (tmp * C.ifactorial(N - 1) % MOD) * pow(dp[c], MOD - 2, MOD) % MOD",
"+ size_red = N - size[c]",
"+ tmp = (dp[c] * red % MOD) * C.factorial(N - 1) % MOD",
"+ dp2[c] = (tmp * C.ifactorial(size[c] - 1) % MOD) * C.ifactorial(size_red) % MOD",
"+print(*dp2, sep=\"\\n\")"
]
| false | 0.052756 | 0.040102 | 1.315549 | [
"s347748290",
"s245395439"
]
|
u191874006 | p03088 | python | s684175215 | s160622674 | 129 | 42 | 3,820 | 3,312 | Accepted | Accepted | 67.44 | #!/usr/bin/env python3
#ABC122 D
#条件を満たさないものは以下の5通りで追加する文字列+3文字を見れば決まる
#ACG,GAC,AGC,A?GC,AG?C
n = int(eval(input()))
#メモ化再帰
memo = [{} for i in range(n+1)]
mod = 10**9 + 7
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i-1],t[i] = t[i],t[i-1]
if ''.join(t).count('AGC') >= 1:
return False
return True
def dfs(cur, last3):
if last3 in memo[cur]:
return memo[cur][last3]
if cur == n:
return 1
ret = 0
#AGCTを1文字ずつ追加してみる
for c in 'AGCT':
#cを追加したときにTrue(不適でない)なら
if ok(last3 + c):
#現在位置を1つ進めてcを追加した値を足す
ret = (ret + dfs(cur + 1, last3[1:] + c)) % mod
#値を格納
memo[cur][last3] = ret
return ret
print((dfs(0,'TTT')))
| #!/usr/bin/env python3
#ABC122 D
n = int(eval(input()))
mod = 10**9+7
dp = [[[[0]*4 for _ in range(4)] for _ in range(4)] for _ in range(n+1)]
#長さ0の文字列は1
#0,1,2(A,G,C)に関する制約しかないため
#Sは、TTTSと考えてもよい
dp[0][3][3][3] = 1
#swapしてAGCが発生しない文字列:=AGC,ACG,GAC,A?GC,AG?Cを含まない文字列
#A:=0,G:=1,C:=2,T:=3
#文字列の文字数
for i in range(n):
#最後から1文字目
for j in range(4):
#最後から2文字目
for k in range(4):
#条件に当てはまるものがない場合
if dp[i][j][k] == 0:
continue
#最後から3文字目
for l in range(4):
#新たに追加する文字
for a in range(4):
#ダメな5条件をカット
#AGCの場合
if a == 2 and j == 1 and k == 0:continue
#GACの場合
if a == 2 and j == 0 and k == 1:continue
#ACGの場合
if a == 1 and j == 2 and k == 0:continue
#A?GCの場合
if a == 2 and j == 1 and l == 0:continue
#AG?Cの場合
if a == 2 and k == 1 and l == 0:continue
#ダメの条件を抜けると、aを足した文字列が作れる
dp[i+1][a][j][k] += dp[i][j][k][l]
dp[i+1][a][j][k] %= mod
ans = 0
for j in range(4):
for k in range(4):
for l in range(4):
#長さnの全通り回収
ans += dp[n][j][k][l]
ans %= mod
print(ans)
| 35 | 52 | 797 | 1,441 | #!/usr/bin/env python3
# ABC122 D
# 条件を満たさないものは以下の5通りで追加する文字列+3文字を見れば決まる
# ACG,GAC,AGC,A?GC,AG?C
n = int(eval(input()))
# メモ化再帰
memo = [{} for i in range(n + 1)]
mod = 10**9 + 7
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i - 1], t[i] = t[i], t[i - 1]
if "".join(t).count("AGC") >= 1:
return False
return True
def dfs(cur, last3):
if last3 in memo[cur]:
return memo[cur][last3]
if cur == n:
return 1
ret = 0
# AGCTを1文字ずつ追加してみる
for c in "AGCT":
# cを追加したときにTrue(不適でない)なら
if ok(last3 + c):
# 現在位置を1つ進めてcを追加した値を足す
ret = (ret + dfs(cur + 1, last3[1:] + c)) % mod
# 値を格納
memo[cur][last3] = ret
return ret
print((dfs(0, "TTT")))
| #!/usr/bin/env python3
# ABC122 D
n = int(eval(input()))
mod = 10**9 + 7
dp = [[[[0] * 4 for _ in range(4)] for _ in range(4)] for _ in range(n + 1)]
# 長さ0の文字列は1
# 0,1,2(A,G,C)に関する制約しかないため
# Sは、TTTSと考えてもよい
dp[0][3][3][3] = 1
# swapしてAGCが発生しない文字列:=AGC,ACG,GAC,A?GC,AG?Cを含まない文字列
# A:=0,G:=1,C:=2,T:=3
# 文字列の文字数
for i in range(n):
# 最後から1文字目
for j in range(4):
# 最後から2文字目
for k in range(4):
# 条件に当てはまるものがない場合
if dp[i][j][k] == 0:
continue
# 最後から3文字目
for l in range(4):
# 新たに追加する文字
for a in range(4):
# ダメな5条件をカット
# AGCの場合
if a == 2 and j == 1 and k == 0:
continue
# GACの場合
if a == 2 and j == 0 and k == 1:
continue
# ACGの場合
if a == 1 and j == 2 and k == 0:
continue
# A?GCの場合
if a == 2 and j == 1 and l == 0:
continue
# AG?Cの場合
if a == 2 and k == 1 and l == 0:
continue
# ダメの条件を抜けると、aを足した文字列が作れる
dp[i + 1][a][j][k] += dp[i][j][k][l]
dp[i + 1][a][j][k] %= mod
ans = 0
for j in range(4):
for k in range(4):
for l in range(4):
# 長さnの全通り回収
ans += dp[n][j][k][l]
ans %= mod
print(ans)
| false | 32.692308 | [
"-# 条件を満たさないものは以下の5通りで追加する文字列+3文字を見れば決まる",
"-# ACG,GAC,AGC,A?GC,AG?C",
"-# メモ化再帰",
"-memo = [{} for i in range(n + 1)]",
"-",
"-",
"-def ok(last4):",
"- for i in range(4):",
"- t = list(last4)",
"- if i >= 1:",
"- t[i - 1], t[i] = t[i], t[i - 1]",
"- if \"\".join(t).count(\"AGC\") >= 1:",
"- return False",
"- return True",
"-",
"-",
"-def dfs(cur, last3):",
"- if last3 in memo[cur]:",
"- return memo[cur][last3]",
"- if cur == n:",
"- return 1",
"- ret = 0",
"- # AGCTを1文字ずつ追加してみる",
"- for c in \"AGCT\":",
"- # cを追加したときにTrue(不適でない)なら",
"- if ok(last3 + c):",
"- # 現在位置を1つ進めてcを追加した値を足す",
"- ret = (ret + dfs(cur + 1, last3[1:] + c)) % mod",
"- # 値を格納",
"- memo[cur][last3] = ret",
"- return ret",
"-",
"-",
"-print((dfs(0, \"TTT\")))",
"+dp = [[[[0] * 4 for _ in range(4)] for _ in range(4)] for _ in range(n + 1)]",
"+# 長さ0の文字列は1",
"+# 0,1,2(A,G,C)に関する制約しかないため",
"+# Sは、TTTSと考えてもよい",
"+dp[0][3][3][3] = 1",
"+# swapしてAGCが発生しない文字列:=AGC,ACG,GAC,A?GC,AG?Cを含まない文字列",
"+# A:=0,G:=1,C:=2,T:=3",
"+# 文字列の文字数",
"+for i in range(n):",
"+ # 最後から1文字目",
"+ for j in range(4):",
"+ # 最後から2文字目",
"+ for k in range(4):",
"+ # 条件に当てはまるものがない場合",
"+ if dp[i][j][k] == 0:",
"+ continue",
"+ # 最後から3文字目",
"+ for l in range(4):",
"+ # 新たに追加する文字",
"+ for a in range(4):",
"+ # ダメな5条件をカット",
"+ # AGCの場合",
"+ if a == 2 and j == 1 and k == 0:",
"+ continue",
"+ # GACの場合",
"+ if a == 2 and j == 0 and k == 1:",
"+ continue",
"+ # ACGの場合",
"+ if a == 1 and j == 2 and k == 0:",
"+ continue",
"+ # A?GCの場合",
"+ if a == 2 and j == 1 and l == 0:",
"+ continue",
"+ # AG?Cの場合",
"+ if a == 2 and k == 1 and l == 0:",
"+ continue",
"+ # ダメの条件を抜けると、aを足した文字列が作れる",
"+ dp[i + 1][a][j][k] += dp[i][j][k][l]",
"+ dp[i + 1][a][j][k] %= mod",
"+ans = 0",
"+for j in range(4):",
"+ for k in range(4):",
"+ for l in range(4):",
"+ # 長さnの全通り回収",
"+ ans += dp[n][j][k][l]",
"+ ans %= mod",
"+print(ans)"
]
| false | 0.068363 | 0.093561 | 0.73068 | [
"s684175215",
"s160622674"
]
|
u325282913 | p03147 | python | s120209186 | s958874215 | 58 | 51 | 3,064 | 3,060 | Accepted | Accepted | 12.07 | N = int(eval(input()))
h = list(map(int, input().split()))
if sum(h) == 0:
print((0))
exit()
ans = 0
flag = False
while True:
if h[0] == 0:
flag = True
for i in range(N):
if h[i] == 0 and flag == True:
continue
elif h[i] == 0 and flag == False:
break
h[i] -= 1
flag = False
ans += 1
if sum(h) == 0:
break
print(ans) | N = int(eval(input()))
array = list(map(int,input().split()))
ans = 0
while True:
if max(array) == 0:
break
flg = False
for i in range(N):
if array[i] == 0:
if flg:
break
continue
array[i] -= 1
flg = True
ans += 1
print(ans) | 21 | 16 | 423 | 321 | N = int(eval(input()))
h = list(map(int, input().split()))
if sum(h) == 0:
print((0))
exit()
ans = 0
flag = False
while True:
if h[0] == 0:
flag = True
for i in range(N):
if h[i] == 0 and flag == True:
continue
elif h[i] == 0 and flag == False:
break
h[i] -= 1
flag = False
ans += 1
if sum(h) == 0:
break
print(ans)
| N = int(eval(input()))
array = list(map(int, input().split()))
ans = 0
while True:
if max(array) == 0:
break
flg = False
for i in range(N):
if array[i] == 0:
if flg:
break
continue
array[i] -= 1
flg = True
ans += 1
print(ans)
| false | 23.809524 | [
"-h = list(map(int, input().split()))",
"-if sum(h) == 0:",
"- print((0))",
"- exit()",
"+array = list(map(int, input().split()))",
"-flag = False",
"- if h[0] == 0:",
"- flag = True",
"+ if max(array) == 0:",
"+ break",
"+ flg = False",
"- if h[i] == 0 and flag == True:",
"+ if array[i] == 0:",
"+ if flg:",
"+ break",
"- elif h[i] == 0 and flag == False:",
"- break",
"- h[i] -= 1",
"- flag = False",
"+ array[i] -= 1",
"+ flg = True",
"- if sum(h) == 0:",
"- break"
]
| false | 0.043768 | 0.0885 | 0.494553 | [
"s120209186",
"s958874215"
]
|
u698868214 | p02678 | python | s788299027 | s348958286 | 683 | 627 | 34,888 | 34,868 | Accepted | Accepted | 8.2 | from collections import deque
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
flag = [0] * N
for i in range(M):
A, B = list(map(int, input().split()))
A -= 1
B -= 1
graph[A].append(B)
graph[B].append(A)
D = deque([0])
visited = [False] * N
visited[0] = True
while D:
v = D.popleft()
for i in graph[v]:
if visited[i]:
continue
visited[i] = True
flag[i] = v
D.append(i)
print("Yes")
for i in range(1, N):
print((flag[i] + 1)) | from collections import deque
N,M = list(map(int,input().split()))
graph = [[] for _ in range(N)]
flag = [0] * N
for i in range(M):
A, B = list(map(int,input().split()))
A -= 1
B -= 1
graph[A].append(B)
graph[B].append(A)
D = deque()
D.append(0)
visited = [False] * N
visited[0] = True
while D:
v = D.popleft()
for nv in graph[v]:
if visited[nv] == True:
continue
visited[nv] = True
flag[nv] = v
D.append(nv)
print("Yes")
for i in range(1,N):
print((flag[i] + 1)) | 29 | 30 | 508 | 527 | from collections import deque
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
flag = [0] * N
for i in range(M):
A, B = list(map(int, input().split()))
A -= 1
B -= 1
graph[A].append(B)
graph[B].append(A)
D = deque([0])
visited = [False] * N
visited[0] = True
while D:
v = D.popleft()
for i in graph[v]:
if visited[i]:
continue
visited[i] = True
flag[i] = v
D.append(i)
print("Yes")
for i in range(1, N):
print((flag[i] + 1))
| from collections import deque
N, M = list(map(int, input().split()))
graph = [[] for _ in range(N)]
flag = [0] * N
for i in range(M):
A, B = list(map(int, input().split()))
A -= 1
B -= 1
graph[A].append(B)
graph[B].append(A)
D = deque()
D.append(0)
visited = [False] * N
visited[0] = True
while D:
v = D.popleft()
for nv in graph[v]:
if visited[nv] == True:
continue
visited[nv] = True
flag[nv] = v
D.append(nv)
print("Yes")
for i in range(1, N):
print((flag[i] + 1))
| false | 3.333333 | [
"-D = deque([0])",
"+D = deque()",
"+D.append(0)",
"- for i in graph[v]:",
"- if visited[i]:",
"+ for nv in graph[v]:",
"+ if visited[nv] == True:",
"- visited[i] = True",
"- flag[i] = v",
"- D.append(i)",
"+ visited[nv] = True",
"+ flag[nv] = v",
"+ D.append(nv)"
]
| false | 0.03818 | 0.037035 | 1.030916 | [
"s788299027",
"s348958286"
]
|
u588341295 | p03353 | python | s556171069 | s053316528 | 44 | 39 | 5,068 | 5,068 | Accepted | Accepted | 11.36 | # -*- coding: utf-8 -*-
instr = eval(input())
target = int(eval(input()))
# 部分文字列の一覧リストを作成
str_list = []
for i in range(len(instr)):
for j in range(i, len(instr)+1):
# targetよりも大きい文字数のものは処理しない
if j-i > target:
break
# 候補となる部分文字列の格納
if i < j:
str_list.append(instr[i:j])
j += 1
i += 1
# 重複削除
str_list = list(set(str_list))
# 昇順ソート
str_list.sort()
print((str_list[target-1])) | # -*- coding: utf-8 -*-
instr = eval(input())
target = int(eval(input()))
# 部分文字列の一覧リストを作成
str_list = []
for i in range(len(instr)):
# 開始位置はi+1以降(i > jはやる意味ない)
for j in range(i+1, len(instr)+1):
# targetよりも大きい文字数のものは処理しない
if j-i > target:
break
# 候補となる部分文字列の格納
str_list.append(instr[i:j])
j += 1
i += 1
# 重複削除
str_list = list(set(str_list))
# 昇順ソート
str_list.sort()
print((str_list[target-1])) | 28 | 28 | 414 | 431 | # -*- coding: utf-8 -*-
instr = eval(input())
target = int(eval(input()))
# 部分文字列の一覧リストを作成
str_list = []
for i in range(len(instr)):
for j in range(i, len(instr) + 1):
# targetよりも大きい文字数のものは処理しない
if j - i > target:
break
# 候補となる部分文字列の格納
if i < j:
str_list.append(instr[i:j])
j += 1
i += 1
# 重複削除
str_list = list(set(str_list))
# 昇順ソート
str_list.sort()
print((str_list[target - 1]))
| # -*- coding: utf-8 -*-
instr = eval(input())
target = int(eval(input()))
# 部分文字列の一覧リストを作成
str_list = []
for i in range(len(instr)):
# 開始位置はi+1以降(i > jはやる意味ない)
for j in range(i + 1, len(instr) + 1):
# targetよりも大きい文字数のものは処理しない
if j - i > target:
break
# 候補となる部分文字列の格納
str_list.append(instr[i:j])
j += 1
i += 1
# 重複削除
str_list = list(set(str_list))
# 昇順ソート
str_list.sort()
print((str_list[target - 1]))
| false | 0 | [
"- for j in range(i, len(instr) + 1):",
"+ # 開始位置はi+1以降(i > jはやる意味ない)",
"+ for j in range(i + 1, len(instr) + 1):",
"- if i < j:",
"- str_list.append(instr[i:j])",
"+ str_list.append(instr[i:j])"
]
| false | 0.046825 | 0.048356 | 0.968344 | [
"s556171069",
"s053316528"
]
|
u415154163 | p02947 | python | s047914386 | s651537429 | 812 | 648 | 17,848 | 66,776 | Accepted | Accepted | 20.2 | import math
N = int(eval(input()))
sorted_map = {}
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
for i in range(N):
inserted_flag = True
input_sorted = ''.join(sorted(eval(input())))
if input_sorted in list(sorted_map.keys()):
sorted_map[input_sorted] += 1
inserted_flag = False
if inserted_flag:
sorted_map[input_sorted] = 1
count = 0
for count_num in list(sorted_map.values()):
if count_num == 1:
continue
count += combinations_count(count_num, 2)
print(count) | N = int(eval(input()))
Sn = [ ''.join(sorted(eval(input()))) for _ in range(N)]
Sn_key = {}
for s in Sn:
if s not in Sn_key:
Sn_key[s] = 1
else:
Sn_key[s] += 1
cnt = 0
for v in list(Sn_key.values()):
if v >= 2:
cnt += v * (v-1) // 2
print(cnt) | 22 | 14 | 578 | 275 | import math
N = int(eval(input()))
sorted_map = {}
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
for i in range(N):
inserted_flag = True
input_sorted = "".join(sorted(eval(input())))
if input_sorted in list(sorted_map.keys()):
sorted_map[input_sorted] += 1
inserted_flag = False
if inserted_flag:
sorted_map[input_sorted] = 1
count = 0
for count_num in list(sorted_map.values()):
if count_num == 1:
continue
count += combinations_count(count_num, 2)
print(count)
| N = int(eval(input()))
Sn = ["".join(sorted(eval(input()))) for _ in range(N)]
Sn_key = {}
for s in Sn:
if s not in Sn_key:
Sn_key[s] = 1
else:
Sn_key[s] += 1
cnt = 0
for v in list(Sn_key.values()):
if v >= 2:
cnt += v * (v - 1) // 2
print(cnt)
| false | 36.363636 | [
"-import math",
"-",
"-sorted_map = {}",
"-",
"-",
"-def combinations_count(n, r):",
"- return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))",
"-",
"-",
"-for i in range(N):",
"- inserted_flag = True",
"- input_sorted = \"\".join(sorted(eval(input())))",
"- if input_sorted in list(sorted_map.keys()):",
"- sorted_map[input_sorted] += 1",
"- inserted_flag = False",
"- if inserted_flag:",
"- sorted_map[input_sorted] = 1",
"-count = 0",
"-for count_num in list(sorted_map.values()):",
"- if count_num == 1:",
"- continue",
"- count += combinations_count(count_num, 2)",
"-print(count)",
"+Sn = [\"\".join(sorted(eval(input()))) for _ in range(N)]",
"+Sn_key = {}",
"+for s in Sn:",
"+ if s not in Sn_key:",
"+ Sn_key[s] = 1",
"+ else:",
"+ Sn_key[s] += 1",
"+cnt = 0",
"+for v in list(Sn_key.values()):",
"+ if v >= 2:",
"+ cnt += v * (v - 1) // 2",
"+print(cnt)"
]
| false | 0.042322 | 0.042318 | 1.0001 | [
"s047914386",
"s651537429"
]
|
u077291787 | p03165 | python | s970179724 | s122821861 | 549 | 481 | 112,988 | 111,708 | Accepted | Accepted | 12.39 | # F - LCS
def lcs(S: str, T: str) -> str:
# dp[i][j] := the maximum length of LCS of S[:i+1] and T[:j+1]
dp = [[0] * (len(T) + 1) for _ in range(len(S) + 1)]
for i, s in enumerate(S):
for j, t in enumerate(T):
if s == t:
dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 1)
else:
dp[i][j] = max(dp[i][j], dp[i - 1][j], dp[i][j - 1])
res = ""
i, j = len(S) - 1, len(T) - 1
while i >= 0 and j >= 0:
if dp[i][j] == dp[i - 1][j]:
i -= 1
elif dp[i][j] == dp[i][j - 1]:
j -= 1
elif dp[i][j] == dp[i - 1][j - 1] + 1:
res += S[i]
i -= 1
j -= 1
return res[::-1] # dp[-1][-1]
def main():
S, T = open(0).read().split()
print((lcs(S, T)))
if __name__ == "__main__":
main()
| def get_lcs(S: str, T: str):
N, M = len(S), len(T)
dp = [[0] * (M + 1) for _ in range(N + 1)]
for i, s in enumerate(S):
for j, t in enumerate(T):
if s == t:
dp[i + 1][j + 1] = dp[i][j] + 1
else:
dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1])
reversed_lcs = ""
while N and M:
if S[N - 1] == T[M - 1]:
N -= 1
M -= 1
reversed_lcs += S[N]
continue
if dp[N - 1][M] > dp[N][M - 1]:
N -= 1
else:
M -= 1
return reversed_lcs[::-1]
def main():
S, T = open(0).read().split()
print((get_lcs(S, T)))
if __name__ == "__main__":
main()
| 32 | 31 | 878 | 754 | # F - LCS
def lcs(S: str, T: str) -> str:
# dp[i][j] := the maximum length of LCS of S[:i+1] and T[:j+1]
dp = [[0] * (len(T) + 1) for _ in range(len(S) + 1)]
for i, s in enumerate(S):
for j, t in enumerate(T):
if s == t:
dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 1)
else:
dp[i][j] = max(dp[i][j], dp[i - 1][j], dp[i][j - 1])
res = ""
i, j = len(S) - 1, len(T) - 1
while i >= 0 and j >= 0:
if dp[i][j] == dp[i - 1][j]:
i -= 1
elif dp[i][j] == dp[i][j - 1]:
j -= 1
elif dp[i][j] == dp[i - 1][j - 1] + 1:
res += S[i]
i -= 1
j -= 1
return res[::-1] # dp[-1][-1]
def main():
S, T = open(0).read().split()
print((lcs(S, T)))
if __name__ == "__main__":
main()
| def get_lcs(S: str, T: str):
N, M = len(S), len(T)
dp = [[0] * (M + 1) for _ in range(N + 1)]
for i, s in enumerate(S):
for j, t in enumerate(T):
if s == t:
dp[i + 1][j + 1] = dp[i][j] + 1
else:
dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1])
reversed_lcs = ""
while N and M:
if S[N - 1] == T[M - 1]:
N -= 1
M -= 1
reversed_lcs += S[N]
continue
if dp[N - 1][M] > dp[N][M - 1]:
N -= 1
else:
M -= 1
return reversed_lcs[::-1]
def main():
S, T = open(0).read().split()
print((get_lcs(S, T)))
if __name__ == "__main__":
main()
| false | 3.125 | [
"-# F - LCS",
"-def lcs(S: str, T: str) -> str:",
"- # dp[i][j] := the maximum length of LCS of S[:i+1] and T[:j+1]",
"- dp = [[0] * (len(T) + 1) for _ in range(len(S) + 1)]",
"+def get_lcs(S: str, T: str):",
"+ N, M = len(S), len(T)",
"+ dp = [[0] * (M + 1) for _ in range(N + 1)]",
"- dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 1)",
"+ dp[i + 1][j + 1] = dp[i][j] + 1",
"- dp[i][j] = max(dp[i][j], dp[i - 1][j], dp[i][j - 1])",
"- res = \"\"",
"- i, j = len(S) - 1, len(T) - 1",
"- while i >= 0 and j >= 0:",
"- if dp[i][j] == dp[i - 1][j]:",
"- i -= 1",
"- elif dp[i][j] == dp[i][j - 1]:",
"- j -= 1",
"- elif dp[i][j] == dp[i - 1][j - 1] + 1:",
"- res += S[i]",
"- i -= 1",
"- j -= 1",
"- return res[::-1] # dp[-1][-1]",
"+ dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1])",
"+ reversed_lcs = \"\"",
"+ while N and M:",
"+ if S[N - 1] == T[M - 1]:",
"+ N -= 1",
"+ M -= 1",
"+ reversed_lcs += S[N]",
"+ continue",
"+ if dp[N - 1][M] > dp[N][M - 1]:",
"+ N -= 1",
"+ else:",
"+ M -= 1",
"+ return reversed_lcs[::-1]",
"- print((lcs(S, T)))",
"+ print((get_lcs(S, T)))"
]
| false | 0.045611 | 0.039366 | 1.158643 | [
"s970179724",
"s122821861"
]
|
u581187895 | p02866 | python | s972652429 | s141869915 | 171 | 143 | 19,936 | 24,404 | Accepted | Accepted | 16.37 | from collections import Counter
N = int(eval(input()))
D = list(map(int, input().split()))
MOD = 998244353
# 条件をみたす木が存在するには D1 = 0 が必要
if D[0] != 0:
print((0))
exit()
# 0 == 1
ctr = Counter(D)
if ctr[0] != 1:
print((0))
exit()
ans = 1
for i in range(len(ctr)-1):
ans *= pow(ctr[i], ctr[i+1], MOD)
ans %= MOD
print(ans) |
from collections import Counter
def resolve():
MOD = 998244353
N = int(eval(input()))
D = list(map(int, input().split()))
if D[0] != 0:
print((0))
return
CNT = Counter(D)
if CNT[0] > 1: # 距離0は1個
print((0))
return
ans = 1
for i in range(1, max(D) + 1):
ans *= pow(CNT[i - 1], CNT[i], MOD)
ans %= MOD
print(ans)
if __name__ == "__main__":
resolve()
| 21 | 26 | 347 | 458 | from collections import Counter
N = int(eval(input()))
D = list(map(int, input().split()))
MOD = 998244353
# 条件をみたす木が存在するには D1 = 0 が必要
if D[0] != 0:
print((0))
exit()
# 0 == 1
ctr = Counter(D)
if ctr[0] != 1:
print((0))
exit()
ans = 1
for i in range(len(ctr) - 1):
ans *= pow(ctr[i], ctr[i + 1], MOD)
ans %= MOD
print(ans)
| from collections import Counter
def resolve():
MOD = 998244353
N = int(eval(input()))
D = list(map(int, input().split()))
if D[0] != 0:
print((0))
return
CNT = Counter(D)
if CNT[0] > 1: # 距離0は1個
print((0))
return
ans = 1
for i in range(1, max(D) + 1):
ans *= pow(CNT[i - 1], CNT[i], MOD)
ans %= MOD
print(ans)
if __name__ == "__main__":
resolve()
| false | 19.230769 | [
"-N = int(eval(input()))",
"-D = list(map(int, input().split()))",
"-MOD = 998244353",
"-# 条件をみたす木が存在するには D1 = 0 が必要",
"-if D[0] != 0:",
"- print((0))",
"- exit()",
"-# 0 == 1",
"-ctr = Counter(D)",
"-if ctr[0] != 1:",
"- print((0))",
"- exit()",
"-ans = 1",
"-for i in range(len(ctr) - 1):",
"- ans *= pow(ctr[i], ctr[i + 1], MOD)",
"- ans %= MOD",
"-print(ans)",
"+",
"+def resolve():",
"+ MOD = 998244353",
"+ N = int(eval(input()))",
"+ D = list(map(int, input().split()))",
"+ if D[0] != 0:",
"+ print((0))",
"+ return",
"+ CNT = Counter(D)",
"+ if CNT[0] > 1: # 距離0は1個",
"+ print((0))",
"+ return",
"+ ans = 1",
"+ for i in range(1, max(D) + 1):",
"+ ans *= pow(CNT[i - 1], CNT[i], MOD)",
"+ ans %= MOD",
"+ print(ans)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ resolve()"
]
| false | 0.039756 | 0.037993 | 1.046401 | [
"s972652429",
"s141869915"
]
|
u875361824 | p03289 | python | s861290684 | s345591220 | 83 | 24 | 3,892 | 3,768 | Accepted | Accepted | 71.08 | def main():
S = eval(input())
ans = f(S)
print(ans)
def f(S):
if S[0] != "A":
return "WA"
nc = S[2:-1].count("C")
if nc != 1:
return "WA"
import string
for c in S[1] + S[-1]:
if c in string.ascii_uppercase:
return "WA"
return "AC"
if __name__ == '__main__':
main()
| def main():
S = eval(input())
ans = f(S)
ans = regex(S)
print(ans)
def f(S):
if S[0] != "A":
return "WA"
nc = S[2:-1].count("C")
if nc != 1:
return "WA"
import string
for c in S[1] + S[-1]:
if c in string.ascii_uppercase:
return "WA"
return "AC"
def regex(S):
import re
r = re.compile("^A[a-z][^C]*C[^C]*[a-z]$")
if r.match(S):
return "AC"
else:
return "WA"
if __name__ == '__main__':
main()
| 25 | 37 | 367 | 546 | def main():
S = eval(input())
ans = f(S)
print(ans)
def f(S):
if S[0] != "A":
return "WA"
nc = S[2:-1].count("C")
if nc != 1:
return "WA"
import string
for c in S[1] + S[-1]:
if c in string.ascii_uppercase:
return "WA"
return "AC"
if __name__ == "__main__":
main()
| def main():
S = eval(input())
ans = f(S)
ans = regex(S)
print(ans)
def f(S):
if S[0] != "A":
return "WA"
nc = S[2:-1].count("C")
if nc != 1:
return "WA"
import string
for c in S[1] + S[-1]:
if c in string.ascii_uppercase:
return "WA"
return "AC"
def regex(S):
import re
r = re.compile("^A[a-z][^C]*C[^C]*[a-z]$")
if r.match(S):
return "AC"
else:
return "WA"
if __name__ == "__main__":
main()
| false | 32.432432 | [
"+ ans = regex(S)",
"+def regex(S):",
"+ import re",
"+",
"+ r = re.compile(\"^A[a-z][^C]*C[^C]*[a-z]$\")",
"+ if r.match(S):",
"+ return \"AC\"",
"+ else:",
"+ return \"WA\"",
"+",
"+"
]
| false | 0.042054 | 0.036873 | 1.140485 | [
"s861290684",
"s345591220"
]
|
u346812984 | p03353 | python | s176234399 | s099466830 | 43 | 30 | 4,936 | 3,564 | Accepted | Accepted | 30.23 | S = eval(input())
K = int(eval(input()))
N = len(S)
substrs = set()
for i in range(N):
cur = S[i]
if cur not in substrs:
substrs.add(cur)
for j in range(i + 1, min(N, i + 6)):
cur += S[j]
if cur not in substrs:
substrs.add(cur)
substrs = sorted(substrs)
print((substrs[K - 1]))
| import sys
from collections import defaultdict
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
S = eval(input())
N = len(S)
K = int(eval(input()))
places = defaultdict(list)
for i in range(N):
places[S[i]].append(i)
places = sorted(list(places.items()), key=lambda x: x[0])
words = set()
for k, v in places:
for start in v:
cnt = 0
for end in range(start + 1, N + 1):
words.add(S[start:end])
cnt += 1
if cnt == 5:
break
if len(words) >= 5:
break
words = sorted(words)
print((words[K - 1]))
if __name__ == "__main__":
main()
| 16 | 42 | 329 | 814 | S = eval(input())
K = int(eval(input()))
N = len(S)
substrs = set()
for i in range(N):
cur = S[i]
if cur not in substrs:
substrs.add(cur)
for j in range(i + 1, min(N, i + 6)):
cur += S[j]
if cur not in substrs:
substrs.add(cur)
substrs = sorted(substrs)
print((substrs[K - 1]))
| import sys
from collections import defaultdict
sys.setrecursionlimit(10**6)
INF = float("inf")
MOD = 10**9 + 7
def input():
return sys.stdin.readline().strip()
def main():
S = eval(input())
N = len(S)
K = int(eval(input()))
places = defaultdict(list)
for i in range(N):
places[S[i]].append(i)
places = sorted(list(places.items()), key=lambda x: x[0])
words = set()
for k, v in places:
for start in v:
cnt = 0
for end in range(start + 1, N + 1):
words.add(S[start:end])
cnt += 1
if cnt == 5:
break
if len(words) >= 5:
break
words = sorted(words)
print((words[K - 1]))
if __name__ == "__main__":
main()
| false | 61.904762 | [
"-S = eval(input())",
"-K = int(eval(input()))",
"-N = len(S)",
"-substrs = set()",
"-for i in range(N):",
"- cur = S[i]",
"- if cur not in substrs:",
"- substrs.add(cur)",
"- for j in range(i + 1, min(N, i + 6)):",
"- cur += S[j]",
"- if cur not in substrs:",
"- substrs.add(cur)",
"-substrs = sorted(substrs)",
"-print((substrs[K - 1]))",
"+import sys",
"+from collections import defaultdict",
"+",
"+sys.setrecursionlimit(10**6)",
"+INF = float(\"inf\")",
"+MOD = 10**9 + 7",
"+",
"+",
"+def input():",
"+ return sys.stdin.readline().strip()",
"+",
"+",
"+def main():",
"+ S = eval(input())",
"+ N = len(S)",
"+ K = int(eval(input()))",
"+ places = defaultdict(list)",
"+ for i in range(N):",
"+ places[S[i]].append(i)",
"+ places = sorted(list(places.items()), key=lambda x: x[0])",
"+ words = set()",
"+ for k, v in places:",
"+ for start in v:",
"+ cnt = 0",
"+ for end in range(start + 1, N + 1):",
"+ words.add(S[start:end])",
"+ cnt += 1",
"+ if cnt == 5:",
"+ break",
"+ if len(words) >= 5:",
"+ break",
"+ words = sorted(words)",
"+ print((words[K - 1]))",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.043973 | 0.038368 | 1.146084 | [
"s176234399",
"s099466830"
]
|
u537782349 | p03281 | python | s392438796 | s042647029 | 20 | 18 | 2,940 | 2,940 | Accepted | Accepted | 10 | c = int(eval(input()))
b = 0
for i in range(1, c + 1, 2):
a = 0
for j in range(1, c + 1):
if i % j == 0:
a += 1
if a == 8:
b += 1
print(b)
| a = int(eval(input()))
c = 0
for i in range(a + 1):
if i % 2 == 1:
b = 0
for j in range(1, i + 1):
if i % j == 0:
b += 1
if b == 8:
c += 1
print(c)
| 10 | 11 | 182 | 220 | c = int(eval(input()))
b = 0
for i in range(1, c + 1, 2):
a = 0
for j in range(1, c + 1):
if i % j == 0:
a += 1
if a == 8:
b += 1
print(b)
| a = int(eval(input()))
c = 0
for i in range(a + 1):
if i % 2 == 1:
b = 0
for j in range(1, i + 1):
if i % j == 0:
b += 1
if b == 8:
c += 1
print(c)
| false | 9.090909 | [
"-c = int(eval(input()))",
"-b = 0",
"-for i in range(1, c + 1, 2):",
"- a = 0",
"- for j in range(1, c + 1):",
"- if i % j == 0:",
"- a += 1",
"- if a == 8:",
"- b += 1",
"-print(b)",
"+a = int(eval(input()))",
"+c = 0",
"+for i in range(a + 1):",
"+ if i % 2 == 1:",
"+ b = 0",
"+ for j in range(1, i + 1):",
"+ if i % j == 0:",
"+ b += 1",
"+ if b == 8:",
"+ c += 1",
"+print(c)"
]
| false | 0.043871 | 0.040756 | 1.07643 | [
"s392438796",
"s042647029"
]
|
u440566786 | p02851 | python | s557115371 | s126426884 | 355 | 300 | 120,424 | 105,704 | Accepted | Accepted | 15.49 | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
from collections import defaultdict
def resolve():
n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
S=[0]*(n+1)
for i in range(n):
S[i+1]=S[i]+A[i]
for i in range(n+1):
S[i]-=i
S[i]%=k
C=defaultdict(list)
for i in range(n+1):
C[S[i]].append(i)
ans=0
C=list(C.values())
for d in range(len(C)):
n=len(C[d])
if(n<=1): continue
r=0
for l in range(n):
while(r+1<n and C[d][r+1]-C[d][l]<k):
r+=1
ans+=r-l
if(r==l): r+=1
print(ans)
resolve() | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
from collections import defaultdict
def resolve():
n,k=list(map(int,input().split()))
A=list([int(x)-1 for x in input().split()])
S=[0]*(n+1)
for i in range(n):
S[i+1]=S[i]+A[i]
S[i+1]%=k
C=defaultdict(int)
ans=0
for i in range(n+1):
if(i-k>=0):
C[S[i-k]]-=1
ans+=C[S[i]]
C[S[i]]+=1
print(ans)
resolve() | 34 | 23 | 761 | 525 | import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7
input = lambda: sys.stdin.readline().rstrip()
from collections import defaultdict
def resolve():
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
S = [0] * (n + 1)
for i in range(n):
S[i + 1] = S[i] + A[i]
for i in range(n + 1):
S[i] -= i
S[i] %= k
C = defaultdict(list)
for i in range(n + 1):
C[S[i]].append(i)
ans = 0
C = list(C.values())
for d in range(len(C)):
n = len(C[d])
if n <= 1:
continue
r = 0
for l in range(n):
while r + 1 < n and C[d][r + 1] - C[d][l] < k:
r += 1
ans += r - l
if r == l:
r += 1
print(ans)
resolve()
| import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7
input = lambda: sys.stdin.readline().rstrip()
from collections import defaultdict
def resolve():
n, k = list(map(int, input().split()))
A = list([int(x) - 1 for x in input().split()])
S = [0] * (n + 1)
for i in range(n):
S[i + 1] = S[i] + A[i]
S[i + 1] %= k
C = defaultdict(int)
ans = 0
for i in range(n + 1):
if i - k >= 0:
C[S[i - k]] -= 1
ans += C[S[i]]
C[S[i]] += 1
print(ans)
resolve()
| false | 32.352941 | [
"- A = list(map(int, input().split()))",
"+ A = list([int(x) - 1 for x in input().split()])",
"+ S[i + 1] %= k",
"+ C = defaultdict(int)",
"+ ans = 0",
"- S[i] -= i",
"- S[i] %= k",
"- C = defaultdict(list)",
"- for i in range(n + 1):",
"- C[S[i]].append(i)",
"- ans = 0",
"- C = list(C.values())",
"- for d in range(len(C)):",
"- n = len(C[d])",
"- if n <= 1:",
"- continue",
"- r = 0",
"- for l in range(n):",
"- while r + 1 < n and C[d][r + 1] - C[d][l] < k:",
"- r += 1",
"- ans += r - l",
"- if r == l:",
"- r += 1",
"+ if i - k >= 0:",
"+ C[S[i - k]] -= 1",
"+ ans += C[S[i]]",
"+ C[S[i]] += 1"
]
| false | 0.038096 | 0.047663 | 0.799283 | [
"s557115371",
"s126426884"
]
|
u777283665 | p03779 | python | s233864742 | s444998187 | 174 | 29 | 38,512 | 2,940 | Accepted | Accepted | 83.33 | x = int(eval(input()))
i = 1
temp = 0
while temp < x:
temp += i
i += 1
print((i-1)) | x = int(eval(input()))
n = 1
while True:
if ((1 + n) * n) // 2 >= x:
print(n)
break
else:
n += 1 | 10 | 8 | 95 | 129 | x = int(eval(input()))
i = 1
temp = 0
while temp < x:
temp += i
i += 1
print((i - 1))
| x = int(eval(input()))
n = 1
while True:
if ((1 + n) * n) // 2 >= x:
print(n)
break
else:
n += 1
| false | 20 | [
"-i = 1",
"-temp = 0",
"-while temp < x:",
"- temp += i",
"- i += 1",
"-print((i - 1))",
"+n = 1",
"+while True:",
"+ if ((1 + n) * n) // 2 >= x:",
"+ print(n)",
"+ break",
"+ else:",
"+ n += 1"
]
| false | 0.045072 | 0.24596 | 0.18325 | [
"s233864742",
"s444998187"
]
|
u467175809 | p02398 | python | s181406347 | s486005612 | 20 | 0 | 5,596 | 4,908 | Accepted | Accepted | 100 | a,b,c = list(map(int, input().split()))
p = 0
for j in range(a,b + 1):
if c%j==0:
p = p+1
print(p)
| a, b, c = list(map(int, input().split()))
print(sum(c % i < 1 for i in range(a, b + 1)))
| 7 | 2 | 112 | 87 | a, b, c = list(map(int, input().split()))
p = 0
for j in range(a, b + 1):
if c % j == 0:
p = p + 1
print(p)
| a, b, c = list(map(int, input().split()))
print(sum(c % i < 1 for i in range(a, b + 1)))
| false | 71.428571 | [
"-p = 0",
"-for j in range(a, b + 1):",
"- if c % j == 0:",
"- p = p + 1",
"-print(p)",
"+print(sum(c % i < 1 for i in range(a, b + 1)))"
]
| false | 0.048459 | 0.0487 | 0.995055 | [
"s181406347",
"s486005612"
]
|
u347600233 | p02947 | python | s176092606 | s125961495 | 436 | 225 | 18,148 | 23,988 | Accepted | Accepted | 48.39 | from collections import defaultdict
n = int(eval(input()))
dic_sorted_s = defaultdict(int)
count = 0
for i in range(n):
s = eval(input())
str_sorted_s = ''.join(sorted(s))
count += dic_sorted_s[str_sorted_s]
dic_sorted_s[str_sorted_s] += 1
print(count) | from collections import Counter
n = int(eval(input()))
cnt_s = Counter([''.join(sorted(eval(input()))) for i in range(n)])
print((sum(v*(v - 1)//2 for v in list(cnt_s.values())))) | 10 | 4 | 265 | 162 | from collections import defaultdict
n = int(eval(input()))
dic_sorted_s = defaultdict(int)
count = 0
for i in range(n):
s = eval(input())
str_sorted_s = "".join(sorted(s))
count += dic_sorted_s[str_sorted_s]
dic_sorted_s[str_sorted_s] += 1
print(count)
| from collections import Counter
n = int(eval(input()))
cnt_s = Counter(["".join(sorted(eval(input()))) for i in range(n)])
print((sum(v * (v - 1) // 2 for v in list(cnt_s.values()))))
| false | 60 | [
"-from collections import defaultdict",
"+from collections import Counter",
"-dic_sorted_s = defaultdict(int)",
"-count = 0",
"-for i in range(n):",
"- s = eval(input())",
"- str_sorted_s = \"\".join(sorted(s))",
"- count += dic_sorted_s[str_sorted_s]",
"- dic_sorted_s[str_sorted_s] += 1",
"-print(count)",
"+cnt_s = Counter([\"\".join(sorted(eval(input()))) for i in range(n)])",
"+print((sum(v * (v - 1) // 2 for v in list(cnt_s.values()))))"
]
| false | 0.040603 | 0.040843 | 0.994116 | [
"s176092606",
"s125961495"
]
|
u426572476 | p03162 | python | s144914440 | s808297937 | 775 | 712 | 103,380 | 51,836 | Accepted | Accepted | 8.13 | import itertools
import math
import sys
from collections import Counter
from fractions import gcd
from functools import reduce
import sys
sys.setrecursionlimit(4100000)
INF = 1 << 60
# ここから書き始める
n = int(eval(input()))
x = [[int(j) for j in input().split()] for i in range(n)]
# print(x)
dp = [[-INF for j in range(3)] for i in range(n)]
for i in range(3):
dp[0][i] = x[0][i]
for i in range(1, n):
dp[i][0] = max(dp[i][0], dp[i - 1][1] + x[i][0])
dp[i][0] = max(dp[i][0], dp[i - 1][2] + x[i][0])
dp[i][1] = max(dp[i][1], dp[i - 1][0] + x[i][1])
dp[i][1] = max(dp[i][1], dp[i - 1][2] + x[i][1])
dp[i][2] = max(dp[i][2], dp[i - 1][0] + x[i][2])
dp[i][2] = max(dp[i][2], dp[i - 1][1] + x[i][2])
print((max(dp[-1])))
| # edpc c
import itertools
from math import factorial
import sys
import heapq
from collections import Counter
from collections import deque
from fractions import gcd
from functools import reduce
sys.setrecursionlimit(4100000)
INF = 1 << 60
MOD = 10 ** 9 + 7
# ここから書き始める
n = int(eval(input()))
x = [[] for i in range(n)]
for i in range(n):
x[i] = list(map(int, input().split()))
# print(x)
dp = [[-INF for j in range(3)] for i in range(n)]
dp[0][0] = x[0][0]
dp[0][1] = x[0][1]
dp[0][2] = x[0][2]
for i in range(1, n):
a = x[i][0]
b = x[i][1]
c = x[i][2]
dp[i][0] = max(dp[i][0], dp[i - 1][1] + a, dp[i - 1][2] + a)
dp[i][1] = max(dp[i][1], dp[i - 1][0] + b, dp[i - 1][2] + b)
dp[i][2] = max(dp[i][2], dp[i - 1][0] + c, dp[i - 1][1] + c)
print((max(dp[-1][0], dp[-1][1], dp[-1][2])))
| 27 | 33 | 761 | 837 | import itertools
import math
import sys
from collections import Counter
from fractions import gcd
from functools import reduce
import sys
sys.setrecursionlimit(4100000)
INF = 1 << 60
# ここから書き始める
n = int(eval(input()))
x = [[int(j) for j in input().split()] for i in range(n)]
# print(x)
dp = [[-INF for j in range(3)] for i in range(n)]
for i in range(3):
dp[0][i] = x[0][i]
for i in range(1, n):
dp[i][0] = max(dp[i][0], dp[i - 1][1] + x[i][0])
dp[i][0] = max(dp[i][0], dp[i - 1][2] + x[i][0])
dp[i][1] = max(dp[i][1], dp[i - 1][0] + x[i][1])
dp[i][1] = max(dp[i][1], dp[i - 1][2] + x[i][1])
dp[i][2] = max(dp[i][2], dp[i - 1][0] + x[i][2])
dp[i][2] = max(dp[i][2], dp[i - 1][1] + x[i][2])
print((max(dp[-1])))
| # edpc c
import itertools
from math import factorial
import sys
import heapq
from collections import Counter
from collections import deque
from fractions import gcd
from functools import reduce
sys.setrecursionlimit(4100000)
INF = 1 << 60
MOD = 10**9 + 7
# ここから書き始める
n = int(eval(input()))
x = [[] for i in range(n)]
for i in range(n):
x[i] = list(map(int, input().split()))
# print(x)
dp = [[-INF for j in range(3)] for i in range(n)]
dp[0][0] = x[0][0]
dp[0][1] = x[0][1]
dp[0][2] = x[0][2]
for i in range(1, n):
a = x[i][0]
b = x[i][1]
c = x[i][2]
dp[i][0] = max(dp[i][0], dp[i - 1][1] + a, dp[i - 1][2] + a)
dp[i][1] = max(dp[i][1], dp[i - 1][0] + b, dp[i - 1][2] + b)
dp[i][2] = max(dp[i][2], dp[i - 1][0] + c, dp[i - 1][1] + c)
print((max(dp[-1][0], dp[-1][1], dp[-1][2])))
| false | 18.181818 | [
"+# edpc c",
"-import math",
"+from math import factorial",
"+import heapq",
"+from collections import deque",
"-import sys",
"+MOD = 10**9 + 7",
"-x = [[int(j) for j in input().split()] for i in range(n)]",
"+x = [[] for i in range(n)]",
"+for i in range(n):",
"+ x[i] = list(map(int, input().split()))",
"-for i in range(3):",
"- dp[0][i] = x[0][i]",
"+dp[0][0] = x[0][0]",
"+dp[0][1] = x[0][1]",
"+dp[0][2] = x[0][2]",
"- dp[i][0] = max(dp[i][0], dp[i - 1][1] + x[i][0])",
"- dp[i][0] = max(dp[i][0], dp[i - 1][2] + x[i][0])",
"- dp[i][1] = max(dp[i][1], dp[i - 1][0] + x[i][1])",
"- dp[i][1] = max(dp[i][1], dp[i - 1][2] + x[i][1])",
"- dp[i][2] = max(dp[i][2], dp[i - 1][0] + x[i][2])",
"- dp[i][2] = max(dp[i][2], dp[i - 1][1] + x[i][2])",
"-print((max(dp[-1])))",
"+ a = x[i][0]",
"+ b = x[i][1]",
"+ c = x[i][2]",
"+ dp[i][0] = max(dp[i][0], dp[i - 1][1] + a, dp[i - 1][2] + a)",
"+ dp[i][1] = max(dp[i][1], dp[i - 1][0] + b, dp[i - 1][2] + b)",
"+ dp[i][2] = max(dp[i][2], dp[i - 1][0] + c, dp[i - 1][1] + c)",
"+print((max(dp[-1][0], dp[-1][1], dp[-1][2])))"
]
| false | 0.0364 | 0.037189 | 0.978795 | [
"s144914440",
"s808297937"
]
|
u945181840 | p03557 | python | s253667378 | s244563685 | 517 | 297 | 33,544 | 25,472 | Accepted | Accepted | 42.55 | import numpy as np
N = int(eval(input()))
A = np.array(list(map(int, input().split())))
B = np.array(list(map(int, input().split())))
C = np.array(list(map(int, input().split())))
A.sort()
B.sort()
a = np.searchsorted(A, B, side='left')
B = sorted(B * (-1))
C = sorted(C * (-1))
c = np.searchsorted(C, B, side='left')
c = np.fliplr([c])[0]
print(((a * c).sum())) | import numpy as np
N = int(eval(input()))
A = np.array(list(map(int, input().split())))
B = np.array(list(map(int, input().split())))
C = -np.array(list(map(int, input().split())))
A.sort()
B.sort()
C.sort()
a = np.searchsorted(A, B, side='left')
c = np.searchsorted(C, -B, side='left')
print(((a * c).sum())) | 20 | 15 | 380 | 319 | import numpy as np
N = int(eval(input()))
A = np.array(list(map(int, input().split())))
B = np.array(list(map(int, input().split())))
C = np.array(list(map(int, input().split())))
A.sort()
B.sort()
a = np.searchsorted(A, B, side="left")
B = sorted(B * (-1))
C = sorted(C * (-1))
c = np.searchsorted(C, B, side="left")
c = np.fliplr([c])[0]
print(((a * c).sum()))
| import numpy as np
N = int(eval(input()))
A = np.array(list(map(int, input().split())))
B = np.array(list(map(int, input().split())))
C = -np.array(list(map(int, input().split())))
A.sort()
B.sort()
C.sort()
a = np.searchsorted(A, B, side="left")
c = np.searchsorted(C, -B, side="left")
print(((a * c).sum()))
| false | 25 | [
"-C = np.array(list(map(int, input().split())))",
"+C = -np.array(list(map(int, input().split())))",
"+C.sort()",
"-B = sorted(B * (-1))",
"-C = sorted(C * (-1))",
"-c = np.searchsorted(C, B, side=\"left\")",
"-c = np.fliplr([c])[0]",
"+c = np.searchsorted(C, -B, side=\"left\")"
]
| false | 0.184539 | 0.236048 | 0.781786 | [
"s253667378",
"s244563685"
]
|
u973108807 | p02642 | python | s496022229 | s144023217 | 464 | 413 | 32,376 | 32,048 | Accepted | Accepted | 10.99 | N = int(eval(input()))
A_list = list(map(int, input().split()))
M = max(A_list)+1
cnt = [0 for _ in range(M)]
for i in A_list:
if cnt[i] != 0:
cnt[i] = 2
continue
for j in range(i, M, i): cnt[j] += 1
ans = 0
for k in A_list:
if cnt[k] == 1: ans += 1
print(ans)
| N = int(eval(input()))
As = list(map(int, input().split()))
M = max(As)+1
cnt = [0 for _ in range(M)]
for A in As:
if cnt[A] != 0:
cnt[A] = 2
continue
for n in range(A, M, A): cnt[n] += 1
ans = 0
for A in As:
if cnt[A] == 1:
ans += 1
print(ans) | 15 | 17 | 299 | 275 | N = int(eval(input()))
A_list = list(map(int, input().split()))
M = max(A_list) + 1
cnt = [0 for _ in range(M)]
for i in A_list:
if cnt[i] != 0:
cnt[i] = 2
continue
for j in range(i, M, i):
cnt[j] += 1
ans = 0
for k in A_list:
if cnt[k] == 1:
ans += 1
print(ans)
| N = int(eval(input()))
As = list(map(int, input().split()))
M = max(As) + 1
cnt = [0 for _ in range(M)]
for A in As:
if cnt[A] != 0:
cnt[A] = 2
continue
for n in range(A, M, A):
cnt[n] += 1
ans = 0
for A in As:
if cnt[A] == 1:
ans += 1
print(ans)
| false | 11.764706 | [
"-A_list = list(map(int, input().split()))",
"-M = max(A_list) + 1",
"+As = list(map(int, input().split()))",
"+M = max(As) + 1",
"-for i in A_list:",
"- if cnt[i] != 0:",
"- cnt[i] = 2",
"+for A in As:",
"+ if cnt[A] != 0:",
"+ cnt[A] = 2",
"- for j in range(i, M, i):",
"- cnt[j] += 1",
"+ for n in range(A, M, A):",
"+ cnt[n] += 1",
"-for k in A_list:",
"- if cnt[k] == 1:",
"+for A in As:",
"+ if cnt[A] == 1:"
]
| false | 0.034332 | 0.107171 | 0.32035 | [
"s496022229",
"s144023217"
]
|
u530663965 | p02267 | python | s382483299 | s136408275 | 30 | 20 | 6,240 | 6,236 | Accepted | Accepted | 33.33 | import sys
ERROR_INPUT = 'input is invalid'
ERROR_INPUT_NOT_UNIQUE = 'input is not unique'
def main():
S = get_input1()
T = get_input2()
count = 0
for t in T:
for s in S:
if t == s:
count += 1
break
print(count)
def get_input1():
n = int(eval(input()))
if n > 10000:
print(ERROR_INPUT)
sys.exit(1)
li = []
for x in input().split(' '):
if int(x) < 0 or int(x) > 10 ** 9:
print(ERROR_INPUT)
sys.exit(1)
li.append(x)
return li
def get_input2():
n = int(eval(input()))
if n > 500:
print(ERROR_INPUT)
sys.exit(1)
li = []
for x in input().split(' '):
if int(x) < 0 or int(x) > 10 ** 9:
print(ERROR_INPUT)
sys.exit(1)
elif int(x) in li:
print(ERROR_INPUT_NOT_UNIQUE)
sys.exit(1)
li.append(x)
return li
main() | import sys
ERROR_INPUT = 'input is invalid'
ERROR_INPUT_NOT_UNIQUE = 'input is not unique'
def main():
S = get_input1()
T = get_input2()
count = 0
for t in T:
if t in S:
count += 1
print(count)
def get_input1():
n = int(eval(input()))
if n > 10000:
print(ERROR_INPUT)
sys.exit(1)
li = []
for x in input().split(' '):
if int(x) < 0 or int(x) > 10 ** 9:
print(ERROR_INPUT)
sys.exit(1)
li.append(x)
return li
def get_input2():
n = int(eval(input()))
if n > 500:
print(ERROR_INPUT)
sys.exit(1)
li = []
for x in input().split(' '):
if int(x) < 0 or int(x) > 10 ** 9:
print(ERROR_INPUT)
sys.exit(1)
elif int(x) in li:
print(ERROR_INPUT_NOT_UNIQUE)
sys.exit(1)
li.append(x)
return li
main() | 56 | 54 | 1,015 | 963 | import sys
ERROR_INPUT = "input is invalid"
ERROR_INPUT_NOT_UNIQUE = "input is not unique"
def main():
S = get_input1()
T = get_input2()
count = 0
for t in T:
for s in S:
if t == s:
count += 1
break
print(count)
def get_input1():
n = int(eval(input()))
if n > 10000:
print(ERROR_INPUT)
sys.exit(1)
li = []
for x in input().split(" "):
if int(x) < 0 or int(x) > 10**9:
print(ERROR_INPUT)
sys.exit(1)
li.append(x)
return li
def get_input2():
n = int(eval(input()))
if n > 500:
print(ERROR_INPUT)
sys.exit(1)
li = []
for x in input().split(" "):
if int(x) < 0 or int(x) > 10**9:
print(ERROR_INPUT)
sys.exit(1)
elif int(x) in li:
print(ERROR_INPUT_NOT_UNIQUE)
sys.exit(1)
li.append(x)
return li
main()
| import sys
ERROR_INPUT = "input is invalid"
ERROR_INPUT_NOT_UNIQUE = "input is not unique"
def main():
S = get_input1()
T = get_input2()
count = 0
for t in T:
if t in S:
count += 1
print(count)
def get_input1():
n = int(eval(input()))
if n > 10000:
print(ERROR_INPUT)
sys.exit(1)
li = []
for x in input().split(" "):
if int(x) < 0 or int(x) > 10**9:
print(ERROR_INPUT)
sys.exit(1)
li.append(x)
return li
def get_input2():
n = int(eval(input()))
if n > 500:
print(ERROR_INPUT)
sys.exit(1)
li = []
for x in input().split(" "):
if int(x) < 0 or int(x) > 10**9:
print(ERROR_INPUT)
sys.exit(1)
elif int(x) in li:
print(ERROR_INPUT_NOT_UNIQUE)
sys.exit(1)
li.append(x)
return li
main()
| false | 3.571429 | [
"- for s in S:",
"- if t == s:",
"- count += 1",
"- break",
"+ if t in S:",
"+ count += 1"
]
| false | 0.045503 | 0.044829 | 1.015034 | [
"s382483299",
"s136408275"
]
|
u759412327 | p03379 | python | s985332009 | s577513953 | 243 | 176 | 34,324 | 30,864 | Accepted | Accepted | 27.57 | from statistics import *
N = int(eval(input()))
X = list(map(int,input().split()))
Y = sorted(X)
m = median(X)
for x in X:
if x<=m:
print((Y[N//2]))
else:
print((Y[N//2-1])) | N = int(eval(input()))
X = list(map(int,input().split()))
Y = sorted(X)
m1 = Y[N//2-1]
m2 = Y[N//2]
for x in X:
if x<m2:
print(m2)
else:
print(m1) | 11 | 11 | 186 | 163 | from statistics import *
N = int(eval(input()))
X = list(map(int, input().split()))
Y = sorted(X)
m = median(X)
for x in X:
if x <= m:
print((Y[N // 2]))
else:
print((Y[N // 2 - 1]))
| N = int(eval(input()))
X = list(map(int, input().split()))
Y = sorted(X)
m1 = Y[N // 2 - 1]
m2 = Y[N // 2]
for x in X:
if x < m2:
print(m2)
else:
print(m1)
| false | 0 | [
"-from statistics import *",
"-",
"-m = median(X)",
"+m1 = Y[N // 2 - 1]",
"+m2 = Y[N // 2]",
"- if x <= m:",
"- print((Y[N // 2]))",
"+ if x < m2:",
"+ print(m2)",
"- print((Y[N // 2 - 1]))",
"+ print(m1)"
]
| false | 0.049595 | 0.040423 | 1.226895 | [
"s985332009",
"s577513953"
]
|
u002459665 | p03568 | python | s753387453 | s878333735 | 120 | 18 | 3,572 | 2,940 | Accepted | Accepted | 85 | N = int(eval(input()))
A = list(map(int, input().split()))
T = [None] * N
c = 0
from functools import reduce
def check():
def f(a, b):
return a * b
global c
r = reduce(f, T)
# print(T, r)
if r % 2 == 0:
c += 1
def dfs(pos):
if pos == N:
check()
return
T[pos] = A[pos] - 1
dfs(pos+1)
T[pos] = A[pos]
dfs(pos+1)
T[pos] = A[pos] + 1
dfs(pos+1)
dfs(0)
print(c) | N = int(eval(input()))
A = list(map(int, input().split()))
total = 3 ** N
ng = 1
for ai in A:
if ai % 2 == 0:
ng *= 2
print((total-ng)) | 38 | 10 | 480 | 150 | N = int(eval(input()))
A = list(map(int, input().split()))
T = [None] * N
c = 0
from functools import reduce
def check():
def f(a, b):
return a * b
global c
r = reduce(f, T)
# print(T, r)
if r % 2 == 0:
c += 1
def dfs(pos):
if pos == N:
check()
return
T[pos] = A[pos] - 1
dfs(pos + 1)
T[pos] = A[pos]
dfs(pos + 1)
T[pos] = A[pos] + 1
dfs(pos + 1)
dfs(0)
print(c)
| N = int(eval(input()))
A = list(map(int, input().split()))
total = 3**N
ng = 1
for ai in A:
if ai % 2 == 0:
ng *= 2
print((total - ng))
| false | 73.684211 | [
"-T = [None] * N",
"-c = 0",
"-from functools import reduce",
"-",
"-",
"-def check():",
"- def f(a, b):",
"- return a * b",
"-",
"- global c",
"- r = reduce(f, T)",
"- # print(T, r)",
"- if r % 2 == 0:",
"- c += 1",
"-",
"-",
"-def dfs(pos):",
"- if pos == N:",
"- check()",
"- return",
"- T[pos] = A[pos] - 1",
"- dfs(pos + 1)",
"- T[pos] = A[pos]",
"- dfs(pos + 1)",
"- T[pos] = A[pos] + 1",
"- dfs(pos + 1)",
"-",
"-",
"-dfs(0)",
"-print(c)",
"+total = 3**N",
"+ng = 1",
"+for ai in A:",
"+ if ai % 2 == 0:",
"+ ng *= 2",
"+print((total - ng))"
]
| false | 0.089062 | 0.0367 | 2.426767 | [
"s753387453",
"s878333735"
]
|
u830297276 | p03361 | python | s897872221 | s437874346 | 28 | 20 | 3,064 | 3,064 | Accepted | Accepted | 28.57 | h, w = list(map(int, input().split()))
s = [eval(input()) for i in range(h)]
up = down = right = left = '.'
for x in range(h):
for y in range(w):
if(list(s[x])[y] == '#'):
if(y != w-1):
right = list(s[x])[y+1]
if(x != h-1):
down = list(s[x+1])[y]
if(x != 0):
up = list(s[x-1])[y]
if(y != 0):
left = list(s[x])[y-1]
if(up != '#' and down != '#' and right != '#' and left != '#'):
print("No")
exit()
up = down = right = left = '.'
print("Yes")
| h, w = list(map(int, input().split()))
s = [list(eval(input())) for i in range(h)]
for x in range(h):
for y in range(w):
if(s[x][y] == '#'):
up = s[max(0, x-1)][y]
down = s[min(h-1, x+1)][y]
right = s[x][max(0, y-1)]
left = s[x][min(w-1, y+1)]
if(up == '.' and down == '.' and right == '.' and left == '.'):
print("No")
exit()
print("Yes")
| 19 | 13 | 628 | 445 | h, w = list(map(int, input().split()))
s = [eval(input()) for i in range(h)]
up = down = right = left = "."
for x in range(h):
for y in range(w):
if list(s[x])[y] == "#":
if y != w - 1:
right = list(s[x])[y + 1]
if x != h - 1:
down = list(s[x + 1])[y]
if x != 0:
up = list(s[x - 1])[y]
if y != 0:
left = list(s[x])[y - 1]
if up != "#" and down != "#" and right != "#" and left != "#":
print("No")
exit()
up = down = right = left = "."
print("Yes")
| h, w = list(map(int, input().split()))
s = [list(eval(input())) for i in range(h)]
for x in range(h):
for y in range(w):
if s[x][y] == "#":
up = s[max(0, x - 1)][y]
down = s[min(h - 1, x + 1)][y]
right = s[x][max(0, y - 1)]
left = s[x][min(w - 1, y + 1)]
if up == "." and down == "." and right == "." and left == ".":
print("No")
exit()
print("Yes")
| false | 31.578947 | [
"-s = [eval(input()) for i in range(h)]",
"-up = down = right = left = \".\"",
"+s = [list(eval(input())) for i in range(h)]",
"- if list(s[x])[y] == \"#\":",
"- if y != w - 1:",
"- right = list(s[x])[y + 1]",
"- if x != h - 1:",
"- down = list(s[x + 1])[y]",
"- if x != 0:",
"- up = list(s[x - 1])[y]",
"- if y != 0:",
"- left = list(s[x])[y - 1]",
"- if up != \"#\" and down != \"#\" and right != \"#\" and left != \"#\":",
"+ if s[x][y] == \"#\":",
"+ up = s[max(0, x - 1)][y]",
"+ down = s[min(h - 1, x + 1)][y]",
"+ right = s[x][max(0, y - 1)]",
"+ left = s[x][min(w - 1, y + 1)]",
"+ if up == \".\" and down == \".\" and right == \".\" and left == \".\":",
"- up = down = right = left = \".\""
]
| false | 0.047122 | 0.038321 | 1.229658 | [
"s897872221",
"s437874346"
]
|
u077291787 | p03160 | python | s508681868 | s361903412 | 118 | 103 | 13,928 | 14,108 | Accepted | Accepted | 12.71 | # EduDPA - Frog 1
n = int(eval(input()))
lst = list(map(int, input().rstrip().split()))
a, b = 0, abs(lst[0] - lst[1])
for i in range(2, n):
dif_1 = a + abs(lst[i] - lst[i - 2])
dif_2 = b + abs(lst[i] - lst[i - 1])
a, b = b, min(dif_1, dif_2)
print(b) | # EduDPA - Frog 1
def main():
n = int(eval(input()))
A = tuple(map(int, input().rstrip().split()))
dp = [0, abs(A[1] - A[0])] + [float("inf")] * (n - 2)
for i in range(2, n):
dif1 = dp[i - 2] + abs(A[i] - A[i - 2])
dif2 = dp[i - 1] + abs(A[i] - A[i - 1])
dp[i] = min(dif1, dif2)
print((dp[-1]))
if __name__ == "__main__":
main() | 9 | 14 | 265 | 383 | # EduDPA - Frog 1
n = int(eval(input()))
lst = list(map(int, input().rstrip().split()))
a, b = 0, abs(lst[0] - lst[1])
for i in range(2, n):
dif_1 = a + abs(lst[i] - lst[i - 2])
dif_2 = b + abs(lst[i] - lst[i - 1])
a, b = b, min(dif_1, dif_2)
print(b)
| # EduDPA - Frog 1
def main():
n = int(eval(input()))
A = tuple(map(int, input().rstrip().split()))
dp = [0, abs(A[1] - A[0])] + [float("inf")] * (n - 2)
for i in range(2, n):
dif1 = dp[i - 2] + abs(A[i] - A[i - 2])
dif2 = dp[i - 1] + abs(A[i] - A[i - 1])
dp[i] = min(dif1, dif2)
print((dp[-1]))
if __name__ == "__main__":
main()
| false | 35.714286 | [
"-n = int(eval(input()))",
"-lst = list(map(int, input().rstrip().split()))",
"-a, b = 0, abs(lst[0] - lst[1])",
"-for i in range(2, n):",
"- dif_1 = a + abs(lst[i] - lst[i - 2])",
"- dif_2 = b + abs(lst[i] - lst[i - 1])",
"- a, b = b, min(dif_1, dif_2)",
"-print(b)",
"+def main():",
"+ n = int(eval(input()))",
"+ A = tuple(map(int, input().rstrip().split()))",
"+ dp = [0, abs(A[1] - A[0])] + [float(\"inf\")] * (n - 2)",
"+ for i in range(2, n):",
"+ dif1 = dp[i - 2] + abs(A[i] - A[i - 2])",
"+ dif2 = dp[i - 1] + abs(A[i] - A[i - 1])",
"+ dp[i] = min(dif1, dif2)",
"+ print((dp[-1]))",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.037559 | 0.038013 | 0.98805 | [
"s508681868",
"s361903412"
]
|
u970308980 | p03074 | python | s144632711 | s866260294 | 387 | 253 | 20,252 | 17,876 | Accepted | Accepted | 34.63 | from itertools import groupby
from numpy import cumsum
N, K = list(map(int, input().split()))
S = input().strip()
if len(set(S)) == 1:
print(N)
exit()
G = []
if S[0] == '0':
G.append(0)
for k, v in groupby(S):
G.append(len(list(v)))
G.append(0)
cum = [0]
cum.extend(list(cumsum(G)))
cum.append(0)
ans = 0
gc = len(G)
w = min(gc, 3+(K-1)*2)
for i in range(0, gc-w+2, 2):
ans = max(ans, cum[i+w]-cum[i])
print(ans)
| from itertools import groupby
from numpy import cumsum
N, K = list(map(int, input().split()))
S = input().strip()
if len(set(S)) == 1:
print(N)
exit()
G = []
for k, v in groupby(S):
G.append(len(list(v)))
if S[0] == '0':
G.insert(0, 0)
if S[-1] == '0':
G.append(0)
cum = [0]
cum.extend(list(cumsum(G)))
cum.append(0)
ans = 0
gc = len(G)
w = min(gc, 3+(K-1)*2)
for i in range(0, gc-w+2, 2):
ans = max(ans, cum[i+w]-cum[i])
print(ans)
| 28 | 29 | 460 | 485 | from itertools import groupby
from numpy import cumsum
N, K = list(map(int, input().split()))
S = input().strip()
if len(set(S)) == 1:
print(N)
exit()
G = []
if S[0] == "0":
G.append(0)
for k, v in groupby(S):
G.append(len(list(v)))
G.append(0)
cum = [0]
cum.extend(list(cumsum(G)))
cum.append(0)
ans = 0
gc = len(G)
w = min(gc, 3 + (K - 1) * 2)
for i in range(0, gc - w + 2, 2):
ans = max(ans, cum[i + w] - cum[i])
print(ans)
| from itertools import groupby
from numpy import cumsum
N, K = list(map(int, input().split()))
S = input().strip()
if len(set(S)) == 1:
print(N)
exit()
G = []
for k, v in groupby(S):
G.append(len(list(v)))
if S[0] == "0":
G.insert(0, 0)
if S[-1] == "0":
G.append(0)
cum = [0]
cum.extend(list(cumsum(G)))
cum.append(0)
ans = 0
gc = len(G)
w = min(gc, 3 + (K - 1) * 2)
for i in range(0, gc - w + 2, 2):
ans = max(ans, cum[i + w] - cum[i])
print(ans)
| false | 3.448276 | [
"-if S[0] == \"0\":",
"- G.append(0)",
"-G.append(0)",
"+if S[0] == \"0\":",
"+ G.insert(0, 0)",
"+if S[-1] == \"0\":",
"+ G.append(0)"
]
| false | 0.289685 | 0.225768 | 1.283109 | [
"s144632711",
"s866260294"
]
|
u621935300 | p03488 | python | s669155020 | s878521078 | 1,766 | 1,296 | 330,244 | 3,480 | Accepted | Accepted | 26.61 | s=list(input().split("T"))
#print s
x,y=list(map(int,input().split()))
cx,cy=len(s[0]),0
lx=[len(_) for _ in s[2::2]]
ly=[len(_) for _ in s[1::2]]
#print lx
#print ly
memo_x=[set((cx,))]
for ind_i,i in enumerate(lx):
next_memo_x = set()
for j in memo_x[ind_i]:
next_memo_x.add(j+i)
next_memo_x.add(j-i)
memo_x.append(next_memo_x)
#print memo_x
memo_y=[set((cy,))]
for ind_i,i in enumerate(ly):
next_memo_y = set()
for j in memo_y[ind_i]:
next_memo_y.add(j+i)
next_memo_y.add(j-i)
memo_y.append(next_memo_y)
#print memo_y
if x in memo_x[-1] and y in memo_y[-1]:
print("Yes")
else:
print("No")
| s=list(input().split("T"))
x,y=list(map(int,input().split()))
lx=[len(_) for _ in s[2::2]]
ly=[len(_) for _ in s[1::2]]
dpx=set()
dpx.add(len(s[0]))
for i in lx:
tmp=set()
for j in dpx:
tmp.add(j+i)
tmp.add(j-i)
dpx=tmp
dpy=set()
dpy.add(0)
for i in ly:
tmp=set()
for j in dpy:
tmp.add(j+i)
tmp.add(j-i)
dpy=tmp
print("Yes" if x in dpx and y in dpy else "No")
| 34 | 25 | 651 | 403 | s = list(input().split("T"))
# print s
x, y = list(map(int, input().split()))
cx, cy = len(s[0]), 0
lx = [len(_) for _ in s[2::2]]
ly = [len(_) for _ in s[1::2]]
# print lx
# print ly
memo_x = [set((cx,))]
for ind_i, i in enumerate(lx):
next_memo_x = set()
for j in memo_x[ind_i]:
next_memo_x.add(j + i)
next_memo_x.add(j - i)
memo_x.append(next_memo_x)
# print memo_x
memo_y = [set((cy,))]
for ind_i, i in enumerate(ly):
next_memo_y = set()
for j in memo_y[ind_i]:
next_memo_y.add(j + i)
next_memo_y.add(j - i)
memo_y.append(next_memo_y)
# print memo_y
if x in memo_x[-1] and y in memo_y[-1]:
print("Yes")
else:
print("No")
| s = list(input().split("T"))
x, y = list(map(int, input().split()))
lx = [len(_) for _ in s[2::2]]
ly = [len(_) for _ in s[1::2]]
dpx = set()
dpx.add(len(s[0]))
for i in lx:
tmp = set()
for j in dpx:
tmp.add(j + i)
tmp.add(j - i)
dpx = tmp
dpy = set()
dpy.add(0)
for i in ly:
tmp = set()
for j in dpy:
tmp.add(j + i)
tmp.add(j - i)
dpy = tmp
print("Yes" if x in dpx and y in dpy else "No")
| false | 26.470588 | [
"-# print s",
"-cx, cy = len(s[0]), 0",
"-# print lx",
"-# print ly",
"-memo_x = [set((cx,))]",
"-for ind_i, i in enumerate(lx):",
"- next_memo_x = set()",
"- for j in memo_x[ind_i]:",
"- next_memo_x.add(j + i)",
"- next_memo_x.add(j - i)",
"- memo_x.append(next_memo_x)",
"-# print memo_x",
"-memo_y = [set((cy,))]",
"-for ind_i, i in enumerate(ly):",
"- next_memo_y = set()",
"- for j in memo_y[ind_i]:",
"- next_memo_y.add(j + i)",
"- next_memo_y.add(j - i)",
"- memo_y.append(next_memo_y)",
"-# print memo_y",
"-if x in memo_x[-1] and y in memo_y[-1]:",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"+dpx = set()",
"+dpx.add(len(s[0]))",
"+for i in lx:",
"+ tmp = set()",
"+ for j in dpx:",
"+ tmp.add(j + i)",
"+ tmp.add(j - i)",
"+ dpx = tmp",
"+dpy = set()",
"+dpy.add(0)",
"+for i in ly:",
"+ tmp = set()",
"+ for j in dpy:",
"+ tmp.add(j + i)",
"+ tmp.add(j - i)",
"+ dpy = tmp",
"+print(\"Yes\" if x in dpx and y in dpy else \"No\")"
]
| false | 0.075414 | 0.049809 | 1.514083 | [
"s669155020",
"s878521078"
]
|
u186426563 | p03673 | python | s334812936 | s094407370 | 64 | 48 | 27,204 | 24,260 | Accepted | Accepted | 25 | n = int(eval(input()))
a = list(map(str, input().split()))
b = a[::-2] + a[len(a)%2::2]
print((' '.join(b))) | n = int(eval(input()))
a = input().split()
print((' '.join(a[::-2] + a[n%2::2]))) | 4 | 3 | 103 | 75 | n = int(eval(input()))
a = list(map(str, input().split()))
b = a[::-2] + a[len(a) % 2 :: 2]
print((" ".join(b)))
| n = int(eval(input()))
a = input().split()
print((" ".join(a[::-2] + a[n % 2 :: 2])))
| false | 25 | [
"-a = list(map(str, input().split()))",
"-b = a[::-2] + a[len(a) % 2 :: 2]",
"-print((\" \".join(b)))",
"+a = input().split()",
"+print((\" \".join(a[::-2] + a[n % 2 :: 2])))"
]
| false | 0.044459 | 0.041171 | 1.079848 | [
"s334812936",
"s094407370"
]
|
u780342333 | p02385 | python | s105489459 | s680167803 | 30 | 20 | 7,832 | 5,596 | Accepted | Accepted | 33.33 | class Dice:
def __init__(self):
self.faces=[]
def rotate(self, direction):
tmp = self.faces.copy()
if direction =="N":
self.faces[5-1] = tmp[1-1]
self.faces[1-1] = tmp[2-1]
self.faces[2-1] = tmp[6-1]
self.faces[6-1] = tmp[5-1]
if direction =="S":
self.faces[5-1] = tmp[6-1]
self.faces[1-1] = tmp[5-1]
self.faces[2-1] = tmp[1-1]
self.faces[6-1] = tmp[2-1]
if direction =="W":
self.faces[4-1] = tmp[1-1]
self.faces[1-1] = tmp[3-1]
self.faces[3-1] = tmp[6-1]
self.faces[6-1] = tmp[4-1]
if direction =="E":
self.faces[3-1] = tmp[1-1]
self.faces[1-1] = tmp[4-1]
self.faces[4-1] = tmp[6-1]
self.faces[6-1] = tmp[3-1]
return 0
def spin(self):
self.faces[4-1], self.faces[2-1],self.faces[5-1],self.faces[3-1] =\
self.faces[2-1], self.faces[3-1],self.faces[4-1],self.faces[5-1]
return 0
d1 = Dice()
d2 = Dice()
d1.faces=[int(x) for x in input().split(" ")]
d2.faces=[int(x) for x in input().split(" ")]
up,front = d1.faces[0], d1.faces[1]
res = "No"
#set up side
for _ in range(3):
for _ in range(4):
for ___ in range(4):
#print("d1: {}".format(d1.faces))
#print("d2: {}".format(d2.faces))
if d1.faces == d2.faces:
res = "Yes"
break
d2.spin()
d2.rotate("W")
d2.rotate("N")
print(res)
| def roll(l, command):
'''
return rolled list
l : string list
command: string
'''
res = []
i = -1
if command =='N':
res = [l[i+2], l[i+6], l[i+3], l[i+4], l[i+1], l[i+5]]
if command =='S':
res = [l[i+5], l[i+1], l[i+3], l[i+4], l[i+6], l[i+2]]
if command =='E':
res = [l[i+4], l[i+2], l[i+1], l[i+6], l[i+5], l[i+3]]
if command =='W':
res = [l[i+3], l[i+2], l[i+6], l[i+1], l[i+5], l[i+4]]
return res
def spin(l):
'''
return right sppined list
l : string list
'''
i = -1
res = [l[i+1], l[i+3], l[i+5], l[i+2], l[i+4], l[i+6]]
return res
def has_same_faces(a, b):
'''
check if all elements of a are equel to those of b.
a : string list
b : string list
'''
return set(a) == set(b)
def is_identical_lists(a, b):
for x, y in zip(a, b):
if x != y:
return False
return True
def check_two_dice(a, b):
if not has_same_faces(a, b):
return False
orig_a = a[:]
#roll and spin to check
for i in range(6):
if 1 <= i <= 3:
a = roll(a, "N")
elif i == 4:
pass
a = orig_a[:]
a = roll(a, "W")
elif i == 5:
a = orig_a[:]
a = roll(a, "E")
# spin 4 times
for _ in range(4): #spin 3 times
a = spin(a)
if is_identical_lists(a, b):
return True
return False
if __name__ == "__main__":
a_list = input().split()
b_list = input().split()
res = check_two_dice(a_list, b_list)
print("Yes") if res else print("No")
| 56 | 82 | 1,624 | 1,753 | class Dice:
def __init__(self):
self.faces = []
def rotate(self, direction):
tmp = self.faces.copy()
if direction == "N":
self.faces[5 - 1] = tmp[1 - 1]
self.faces[1 - 1] = tmp[2 - 1]
self.faces[2 - 1] = tmp[6 - 1]
self.faces[6 - 1] = tmp[5 - 1]
if direction == "S":
self.faces[5 - 1] = tmp[6 - 1]
self.faces[1 - 1] = tmp[5 - 1]
self.faces[2 - 1] = tmp[1 - 1]
self.faces[6 - 1] = tmp[2 - 1]
if direction == "W":
self.faces[4 - 1] = tmp[1 - 1]
self.faces[1 - 1] = tmp[3 - 1]
self.faces[3 - 1] = tmp[6 - 1]
self.faces[6 - 1] = tmp[4 - 1]
if direction == "E":
self.faces[3 - 1] = tmp[1 - 1]
self.faces[1 - 1] = tmp[4 - 1]
self.faces[4 - 1] = tmp[6 - 1]
self.faces[6 - 1] = tmp[3 - 1]
return 0
def spin(self):
self.faces[4 - 1], self.faces[2 - 1], self.faces[5 - 1], self.faces[3 - 1] = (
self.faces[2 - 1],
self.faces[3 - 1],
self.faces[4 - 1],
self.faces[5 - 1],
)
return 0
d1 = Dice()
d2 = Dice()
d1.faces = [int(x) for x in input().split(" ")]
d2.faces = [int(x) for x in input().split(" ")]
up, front = d1.faces[0], d1.faces[1]
res = "No"
# set up side
for _ in range(3):
for _ in range(4):
for ___ in range(4):
# print("d1: {}".format(d1.faces))
# print("d2: {}".format(d2.faces))
if d1.faces == d2.faces:
res = "Yes"
break
d2.spin()
d2.rotate("W")
d2.rotate("N")
print(res)
| def roll(l, command):
"""
return rolled list
l : string list
command: string
"""
res = []
i = -1
if command == "N":
res = [l[i + 2], l[i + 6], l[i + 3], l[i + 4], l[i + 1], l[i + 5]]
if command == "S":
res = [l[i + 5], l[i + 1], l[i + 3], l[i + 4], l[i + 6], l[i + 2]]
if command == "E":
res = [l[i + 4], l[i + 2], l[i + 1], l[i + 6], l[i + 5], l[i + 3]]
if command == "W":
res = [l[i + 3], l[i + 2], l[i + 6], l[i + 1], l[i + 5], l[i + 4]]
return res
def spin(l):
"""
return right sppined list
l : string list
"""
i = -1
res = [l[i + 1], l[i + 3], l[i + 5], l[i + 2], l[i + 4], l[i + 6]]
return res
def has_same_faces(a, b):
"""
check if all elements of a are equel to those of b.
a : string list
b : string list
"""
return set(a) == set(b)
def is_identical_lists(a, b):
for x, y in zip(a, b):
if x != y:
return False
return True
def check_two_dice(a, b):
if not has_same_faces(a, b):
return False
orig_a = a[:]
# roll and spin to check
for i in range(6):
if 1 <= i <= 3:
a = roll(a, "N")
elif i == 4:
pass
a = orig_a[:]
a = roll(a, "W")
elif i == 5:
a = orig_a[:]
a = roll(a, "E")
# spin 4 times
for _ in range(4): # spin 3 times
a = spin(a)
if is_identical_lists(a, b):
return True
return False
if __name__ == "__main__":
a_list = input().split()
b_list = input().split()
res = check_two_dice(a_list, b_list)
print("Yes") if res else print("No")
| false | 31.707317 | [
"-class Dice:",
"- def __init__(self):",
"- self.faces = []",
"-",
"- def rotate(self, direction):",
"- tmp = self.faces.copy()",
"- if direction == \"N\":",
"- self.faces[5 - 1] = tmp[1 - 1]",
"- self.faces[1 - 1] = tmp[2 - 1]",
"- self.faces[2 - 1] = tmp[6 - 1]",
"- self.faces[6 - 1] = tmp[5 - 1]",
"- if direction == \"S\":",
"- self.faces[5 - 1] = tmp[6 - 1]",
"- self.faces[1 - 1] = tmp[5 - 1]",
"- self.faces[2 - 1] = tmp[1 - 1]",
"- self.faces[6 - 1] = tmp[2 - 1]",
"- if direction == \"W\":",
"- self.faces[4 - 1] = tmp[1 - 1]",
"- self.faces[1 - 1] = tmp[3 - 1]",
"- self.faces[3 - 1] = tmp[6 - 1]",
"- self.faces[6 - 1] = tmp[4 - 1]",
"- if direction == \"E\":",
"- self.faces[3 - 1] = tmp[1 - 1]",
"- self.faces[1 - 1] = tmp[4 - 1]",
"- self.faces[4 - 1] = tmp[6 - 1]",
"- self.faces[6 - 1] = tmp[3 - 1]",
"- return 0",
"-",
"- def spin(self):",
"- self.faces[4 - 1], self.faces[2 - 1], self.faces[5 - 1], self.faces[3 - 1] = (",
"- self.faces[2 - 1],",
"- self.faces[3 - 1],",
"- self.faces[4 - 1],",
"- self.faces[5 - 1],",
"- )",
"- return 0",
"+def roll(l, command):",
"+ \"\"\"",
"+ return rolled list",
"+ l : string list",
"+ command: string",
"+ \"\"\"",
"+ res = []",
"+ i = -1",
"+ if command == \"N\":",
"+ res = [l[i + 2], l[i + 6], l[i + 3], l[i + 4], l[i + 1], l[i + 5]]",
"+ if command == \"S\":",
"+ res = [l[i + 5], l[i + 1], l[i + 3], l[i + 4], l[i + 6], l[i + 2]]",
"+ if command == \"E\":",
"+ res = [l[i + 4], l[i + 2], l[i + 1], l[i + 6], l[i + 5], l[i + 3]]",
"+ if command == \"W\":",
"+ res = [l[i + 3], l[i + 2], l[i + 6], l[i + 1], l[i + 5], l[i + 4]]",
"+ return res",
"-d1 = Dice()",
"-d2 = Dice()",
"-d1.faces = [int(x) for x in input().split(\" \")]",
"-d2.faces = [int(x) for x in input().split(\" \")]",
"-up, front = d1.faces[0], d1.faces[1]",
"-res = \"No\"",
"-# set up side",
"-for _ in range(3):",
"- for _ in range(4):",
"- for ___ in range(4):",
"- # print(\"d1: {}\".format(d1.faces))",
"- # print(\"d2: {}\".format(d2.faces))",
"- if d1.faces == d2.faces:",
"- res = \"Yes\"",
"- break",
"- d2.spin()",
"- d2.rotate(\"W\")",
"- d2.rotate(\"N\")",
"-print(res)",
"+def spin(l):",
"+ \"\"\"",
"+ return right sppined list",
"+ l : string list",
"+ \"\"\"",
"+ i = -1",
"+ res = [l[i + 1], l[i + 3], l[i + 5], l[i + 2], l[i + 4], l[i + 6]]",
"+ return res",
"+",
"+",
"+def has_same_faces(a, b):",
"+ \"\"\"",
"+ check if all elements of a are equel to those of b.",
"+ a : string list",
"+ b : string list",
"+ \"\"\"",
"+ return set(a) == set(b)",
"+",
"+",
"+def is_identical_lists(a, b):",
"+ for x, y in zip(a, b):",
"+ if x != y:",
"+ return False",
"+ return True",
"+",
"+",
"+def check_two_dice(a, b):",
"+ if not has_same_faces(a, b):",
"+ return False",
"+ orig_a = a[:]",
"+ # roll and spin to check",
"+ for i in range(6):",
"+ if 1 <= i <= 3:",
"+ a = roll(a, \"N\")",
"+ elif i == 4:",
"+ pass",
"+ a = orig_a[:]",
"+ a = roll(a, \"W\")",
"+ elif i == 5:",
"+ a = orig_a[:]",
"+ a = roll(a, \"E\")",
"+ # spin 4 times",
"+ for _ in range(4): # spin 3 times",
"+ a = spin(a)",
"+ if is_identical_lists(a, b):",
"+ return True",
"+ return False",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ a_list = input().split()",
"+ b_list = input().split()",
"+ res = check_two_dice(a_list, b_list)",
"+ print(\"Yes\") if res else print(\"No\")"
]
| false | 0.033292 | 0.035025 | 0.950525 | [
"s105489459",
"s680167803"
]
|
u644907318 | p04019 | python | s783931320 | s776264279 | 169 | 64 | 38,384 | 62,120 | Accepted | Accepted | 62.13 | S = input().strip()
C = {"N":0,"S":0,"E":0,"W":0}
for i in range(len(S)):
C[S[i]] += 1
if (C["N"]*C["S"]>0 or (C["N"]==0 and C["S"]==0)) and (C["E"]*C["W"]>0 or (C["E"]==0 and C["W"]==0)):
print("Yes")
else:
print("No") | S = input().strip()
C = {"N":0,"S":0,"E":0,"W":0}
for i in range(len(S)):
C[S[i]] += 1
if C["N"]>0 and C["S"]>0:
if (C["E"]>0 and C["W"]>0) or (C["E"]==0 and C["W"]==0):
print("Yes")
else:
print("No")
elif C["N"]==0 and C["S"]==0:
if (C["E"]>0 and C["W"]>0) or (C["E"]==0 and C["W"]==0):
print("Yes")
else:
print("No")
else:
print("No") | 8 | 16 | 238 | 407 | S = input().strip()
C = {"N": 0, "S": 0, "E": 0, "W": 0}
for i in range(len(S)):
C[S[i]] += 1
if (C["N"] * C["S"] > 0 or (C["N"] == 0 and C["S"] == 0)) and (
C["E"] * C["W"] > 0 or (C["E"] == 0 and C["W"] == 0)
):
print("Yes")
else:
print("No")
| S = input().strip()
C = {"N": 0, "S": 0, "E": 0, "W": 0}
for i in range(len(S)):
C[S[i]] += 1
if C["N"] > 0 and C["S"] > 0:
if (C["E"] > 0 and C["W"] > 0) or (C["E"] == 0 and C["W"] == 0):
print("Yes")
else:
print("No")
elif C["N"] == 0 and C["S"] == 0:
if (C["E"] > 0 and C["W"] > 0) or (C["E"] == 0 and C["W"] == 0):
print("Yes")
else:
print("No")
else:
print("No")
| false | 50 | [
"-if (C[\"N\"] * C[\"S\"] > 0 or (C[\"N\"] == 0 and C[\"S\"] == 0)) and (",
"- C[\"E\"] * C[\"W\"] > 0 or (C[\"E\"] == 0 and C[\"W\"] == 0)",
"-):",
"- print(\"Yes\")",
"+if C[\"N\"] > 0 and C[\"S\"] > 0:",
"+ if (C[\"E\"] > 0 and C[\"W\"] > 0) or (C[\"E\"] == 0 and C[\"W\"] == 0):",
"+ print(\"Yes\")",
"+ else:",
"+ print(\"No\")",
"+elif C[\"N\"] == 0 and C[\"S\"] == 0:",
"+ if (C[\"E\"] > 0 and C[\"W\"] > 0) or (C[\"E\"] == 0 and C[\"W\"] == 0):",
"+ print(\"Yes\")",
"+ else:",
"+ print(\"No\")"
]
| false | 0.034558 | 0.154672 | 0.223426 | [
"s783931320",
"s776264279"
]
|
u396495667 | p03610 | python | s326004868 | s091376184 | 40 | 20 | 3,572 | 4,648 | Accepted | Accepted | 50 | s = eval(input())
a =[]
for i in range(len(s)):
if (i+1)%2 !=0:
a.append(s[i])
print((''.join(a))) | s = list(eval(input()))
a = list(s[::2])
print((''.join(a))) | 6 | 3 | 101 | 54 | s = eval(input())
a = []
for i in range(len(s)):
if (i + 1) % 2 != 0:
a.append(s[i])
print(("".join(a)))
| s = list(eval(input()))
a = list(s[::2])
print(("".join(a)))
| false | 50 | [
"-s = eval(input())",
"-a = []",
"-for i in range(len(s)):",
"- if (i + 1) % 2 != 0:",
"- a.append(s[i])",
"+s = list(eval(input()))",
"+a = list(s[::2])"
]
| false | 0.037605 | 0.032897 | 1.143114 | [
"s326004868",
"s091376184"
]
|
u150984829 | p02386 | python | s037878793 | s789968887 | 70 | 30 | 5,988 | 5,992 | Accepted | Accepted | 57.14 | from itertools import*
n=int(eval(input()))
a=[list(map(int,input().split()))for _ in range(n)]
def f():
for p,q in list(combinations(a,2)):
d=p[:];d[3],d[4]=d[4],d[3]
e=q[:];e[3],e[4]=e[4],e[3]
for p in([0,1,2,3,4,5],[1,5,2,0,4,3],[2,1,5,3,0,4],[3,0,2,5,4,1],[4,1,0,3,5,2],[5,1,4,3,2,0]):
f=[d[k]for k in p]
if f[0]==e[0]and f[5]==e[5]:
f=f[1:5]*2
for k in range(4):
if f[k:k+4]==e[1:5]:return'No'
return'Yes'
print((f()))
| from itertools import*
n=int(eval(input()))
a=[list(map(int,input().split()))for _ in range(n)]
for k in range(n):
b=a[k];b[3],b[4]=b[4],b[3]
def f():
for d,e in list(combinations(a,2)):
for p in([0,1,2,3,4,5],[1,5,2,0,4,3],[2,1,5,3,0,4],[3,0,2,5,4,1],[4,1,0,3,5,2],[5,1,4,3,2,0]):
f=[d[k]for k in p]
if f[0]==e[0]and f[5]==e[5]:
f=f[1:5]*2
for k in range(4):
if f[k:k+4]==e[1:5]:return'No'
return'Yes'
print((f()))
| 15 | 15 | 457 | 446 | from itertools import *
n = int(eval(input()))
a = [list(map(int, input().split())) for _ in range(n)]
def f():
for p, q in list(combinations(a, 2)):
d = p[:]
d[3], d[4] = d[4], d[3]
e = q[:]
e[3], e[4] = e[4], e[3]
for p in (
[0, 1, 2, 3, 4, 5],
[1, 5, 2, 0, 4, 3],
[2, 1, 5, 3, 0, 4],
[3, 0, 2, 5, 4, 1],
[4, 1, 0, 3, 5, 2],
[5, 1, 4, 3, 2, 0],
):
f = [d[k] for k in p]
if f[0] == e[0] and f[5] == e[5]:
f = f[1:5] * 2
for k in range(4):
if f[k : k + 4] == e[1:5]:
return "No"
return "Yes"
print((f()))
| from itertools import *
n = int(eval(input()))
a = [list(map(int, input().split())) for _ in range(n)]
for k in range(n):
b = a[k]
b[3], b[4] = b[4], b[3]
def f():
for d, e in list(combinations(a, 2)):
for p in (
[0, 1, 2, 3, 4, 5],
[1, 5, 2, 0, 4, 3],
[2, 1, 5, 3, 0, 4],
[3, 0, 2, 5, 4, 1],
[4, 1, 0, 3, 5, 2],
[5, 1, 4, 3, 2, 0],
):
f = [d[k] for k in p]
if f[0] == e[0] and f[5] == e[5]:
f = f[1:5] * 2
for k in range(4):
if f[k : k + 4] == e[1:5]:
return "No"
return "Yes"
print((f()))
| false | 0 | [
"+for k in range(n):",
"+ b = a[k]",
"+ b[3], b[4] = b[4], b[3]",
"- for p, q in list(combinations(a, 2)):",
"- d = p[:]",
"- d[3], d[4] = d[4], d[3]",
"- e = q[:]",
"- e[3], e[4] = e[4], e[3]",
"+ for d, e in list(combinations(a, 2)):"
]
| false | 0.036284 | 0.038148 | 0.951117 | [
"s037878793",
"s789968887"
]
|
u022407960 | p02376 | python | s057993463 | s671696101 | 40 | 30 | 8,168 | 8,140 | Accepted | Accepted | 25 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
4 5
0 1 2
0 2 1
1 2 1
1 3 1
2 3 2
output:
3
"""
import sys
from collections import deque
def graph_bfs(source, target, parent):
visited = [False] * v_num
queue = deque()
queue.appendleft(source)
visited[source] = True
while queue:
current = queue.popleft()
for adj, cp in list(adj_table[current].items()):
if cp and not visited[adj]:
queue.append(adj)
visited[adj] = True
parent[adj] = current
return True if visited[target] else False
def graph_FordFulkerson(source, sink):
parent = [-1] * v_num
max_flow = 0
while graph_bfs(source, sink, parent):
path_flow = float('inf')
bk_1 = sink
while bk_1 is not source:
parent_bk_1 = parent[bk_1]
assert parent_bk_1 != -1
path_flow = min(path_flow, adj_table[parent_bk_1][bk_1])
bk_1 = parent[bk_1]
max_flow += path_flow
bk_2 = sink
while bk_2 is not source:
parent_bk_2 = parent[bk_2]
assert parent_bk_2 != -1
# adj_table[parent_bk_2].setdefault(bk_2, 0)
adj_table[bk_2].setdefault(parent_bk_2, 0)
# print(bk_2, parent_bk_2, path_flow, bk_1, parent[bk_1], parent, adj_table)
adj_table[parent_bk_2][bk_2] -= path_flow
adj_table[bk_2][parent_bk_2] += path_flow
bk_2 = parent[bk_2]
return max_flow
def generate_adj_table(_edges):
for edge in _edges:
source, target, cp = list(map(int, edge))
init_adj_table[source].setdefault(target, cp)
return init_adj_table
if __name__ == '__main__':
_input = sys.stdin.readlines()
v_num, e_num = list(map(int, _input[0].split()))
edges = [x.split() for x in _input[1:]]
init_adj_table = [dict() for _ in range(v_num)]
adj_table = generate_adj_table(edges)
ans = graph_FordFulkerson(source=0, sink=v_num - 1)
print(ans) | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
4 5
0 1 2
0 2 1
1 2 1
1 3 1
2 3 2
output:
3
"""
import sys
from collections import deque
def bfs(source, target, parent):
queue = deque()
queue.appendleft(source)
visited = [False] * v_num
visited[source] = True
while queue:
current = queue.popleft()
for adj, cp in list(adj_table[current].items()):
if cp and not visited[adj]:
queue.append(adj)
visited[adj] = True
parent[adj] = current
return True if visited[target] else False
def graph_FordFulkerson(source, sink):
parent = [-1] * v_num
max_flow = 0
while bfs(source, sink, parent):
path_flow = float('inf')
bk_1 = sink
while bk_1 != source:
parent_bk_1 = parent[bk_1]
assert parent_bk_1 != -1
path_flow = min(path_flow, adj_table[parent_bk_1][bk_1])
bk_1 = parent[bk_1]
max_flow += path_flow
bk_2 = sink
while bk_2 != source:
parent_bk_2 = parent[bk_2]
assert parent_bk_2 != -1
adj_table[bk_2].setdefault(parent_bk_2, 0)
adj_table[parent_bk_2][bk_2] -= path_flow
adj_table[bk_2][parent_bk_2] += path_flow
bk_2 = parent[bk_2]
return max_flow
if __name__ == '__main__':
_input = sys.stdin.readlines()
v_num, e_num = list(map(int, _input[0].split()))
edges = [x.split() for x in _input[1:]]
adj_table = tuple(dict() for _ in range(v_num))
for edge in edges:
s, t, c = list(map(int, edge))
adj_table[s][t] = c
print((graph_FordFulkerson(source=0, sink=v_num - 1))) | 85 | 77 | 2,104 | 1,776 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
4 5
0 1 2
0 2 1
1 2 1
1 3 1
2 3 2
output:
3
"""
import sys
from collections import deque
def graph_bfs(source, target, parent):
visited = [False] * v_num
queue = deque()
queue.appendleft(source)
visited[source] = True
while queue:
current = queue.popleft()
for adj, cp in list(adj_table[current].items()):
if cp and not visited[adj]:
queue.append(adj)
visited[adj] = True
parent[adj] = current
return True if visited[target] else False
def graph_FordFulkerson(source, sink):
parent = [-1] * v_num
max_flow = 0
while graph_bfs(source, sink, parent):
path_flow = float("inf")
bk_1 = sink
while bk_1 is not source:
parent_bk_1 = parent[bk_1]
assert parent_bk_1 != -1
path_flow = min(path_flow, adj_table[parent_bk_1][bk_1])
bk_1 = parent[bk_1]
max_flow += path_flow
bk_2 = sink
while bk_2 is not source:
parent_bk_2 = parent[bk_2]
assert parent_bk_2 != -1
# adj_table[parent_bk_2].setdefault(bk_2, 0)
adj_table[bk_2].setdefault(parent_bk_2, 0)
# print(bk_2, parent_bk_2, path_flow, bk_1, parent[bk_1], parent, adj_table)
adj_table[parent_bk_2][bk_2] -= path_flow
adj_table[bk_2][parent_bk_2] += path_flow
bk_2 = parent[bk_2]
return max_flow
def generate_adj_table(_edges):
for edge in _edges:
source, target, cp = list(map(int, edge))
init_adj_table[source].setdefault(target, cp)
return init_adj_table
if __name__ == "__main__":
_input = sys.stdin.readlines()
v_num, e_num = list(map(int, _input[0].split()))
edges = [x.split() for x in _input[1:]]
init_adj_table = [dict() for _ in range(v_num)]
adj_table = generate_adj_table(edges)
ans = graph_FordFulkerson(source=0, sink=v_num - 1)
print(ans)
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
4 5
0 1 2
0 2 1
1 2 1
1 3 1
2 3 2
output:
3
"""
import sys
from collections import deque
def bfs(source, target, parent):
queue = deque()
queue.appendleft(source)
visited = [False] * v_num
visited[source] = True
while queue:
current = queue.popleft()
for adj, cp in list(adj_table[current].items()):
if cp and not visited[adj]:
queue.append(adj)
visited[adj] = True
parent[adj] = current
return True if visited[target] else False
def graph_FordFulkerson(source, sink):
parent = [-1] * v_num
max_flow = 0
while bfs(source, sink, parent):
path_flow = float("inf")
bk_1 = sink
while bk_1 != source:
parent_bk_1 = parent[bk_1]
assert parent_bk_1 != -1
path_flow = min(path_flow, adj_table[parent_bk_1][bk_1])
bk_1 = parent[bk_1]
max_flow += path_flow
bk_2 = sink
while bk_2 != source:
parent_bk_2 = parent[bk_2]
assert parent_bk_2 != -1
adj_table[bk_2].setdefault(parent_bk_2, 0)
adj_table[parent_bk_2][bk_2] -= path_flow
adj_table[bk_2][parent_bk_2] += path_flow
bk_2 = parent[bk_2]
return max_flow
if __name__ == "__main__":
_input = sys.stdin.readlines()
v_num, e_num = list(map(int, _input[0].split()))
edges = [x.split() for x in _input[1:]]
adj_table = tuple(dict() for _ in range(v_num))
for edge in edges:
s, t, c = list(map(int, edge))
adj_table[s][t] = c
print((graph_FordFulkerson(source=0, sink=v_num - 1)))
| false | 9.411765 | [
"-def graph_bfs(source, target, parent):",
"- visited = [False] * v_num",
"+def bfs(source, target, parent):",
"+ visited = [False] * v_num",
"- while graph_bfs(source, sink, parent):",
"+ while bfs(source, sink, parent):",
"- while bk_1 is not source:",
"+ while bk_1 != source:",
"- while bk_2 is not source:",
"+ while bk_2 != source:",
"- # adj_table[parent_bk_2].setdefault(bk_2, 0)",
"- # print(bk_2, parent_bk_2, path_flow, bk_1, parent[bk_1], parent, adj_table)",
"-def generate_adj_table(_edges):",
"- for edge in _edges:",
"- source, target, cp = list(map(int, edge))",
"- init_adj_table[source].setdefault(target, cp)",
"- return init_adj_table",
"-",
"-",
"- init_adj_table = [dict() for _ in range(v_num)]",
"- adj_table = generate_adj_table(edges)",
"- ans = graph_FordFulkerson(source=0, sink=v_num - 1)",
"- print(ans)",
"+ adj_table = tuple(dict() for _ in range(v_num))",
"+ for edge in edges:",
"+ s, t, c = list(map(int, edge))",
"+ adj_table[s][t] = c",
"+ print((graph_FordFulkerson(source=0, sink=v_num - 1)))"
]
| false | 0.046495 | 0.104459 | 0.445104 | [
"s057993463",
"s671696101"
]
|
u191874006 | p03127 | python | s010125810 | s395301944 | 254 | 220 | 62,912 | 58,864 | Accepted | Accepted | 13.39 | #!/usr/bin/env python3
#ABC118 C
n = int(eval(input()))
a = list(map(int,input().split()))
a.sort()
c = a.count(0)
mi = 10**9
while 1:
for i in range(c+1,n):
a[i] = a[i] % a[c]
a.sort()
c = a.count(0)
if a[-2] == 0:
break
print((a[-1]))
| #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def gcd(n,m):
if m == 0:
return n
else:
return gcd(m,n%m)
n = I()
a = LI()
g = a[0]
for i in a[1:]:
g = gcd(g,i)
print(g) | 16 | 30 | 277 | 719 | #!/usr/bin/env python3
# ABC118 C
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
c = a.count(0)
mi = 10**9
while 1:
for i in range(c + 1, n):
a[i] = a[i] % a[c]
a.sort()
c = a.count(0)
if a[-2] == 0:
break
print((a[-1]))
| #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop, heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float("inf")
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
def gcd(n, m):
if m == 0:
return n
else:
return gcd(m, n % m)
n = I()
a = LI()
g = a[0]
for i in a[1:]:
g = gcd(g, i)
print(g)
| false | 46.666667 | [
"-# ABC118 C",
"-n = int(eval(input()))",
"-a = list(map(int, input().split()))",
"-a.sort()",
"-c = a.count(0)",
"-mi = 10**9",
"-while 1:",
"- for i in range(c + 1, n):",
"- a[i] = a[i] % a[c]",
"- a.sort()",
"- c = a.count(0)",
"- if a[-2] == 0:",
"- break",
"-print((a[-1]))",
"+import sys",
"+import math",
"+from bisect import bisect_right as br",
"+from bisect import bisect_left as bl",
"+",
"+sys.setrecursionlimit(2147483647)",
"+from heapq import heappush, heappop, heappushpop",
"+from collections import defaultdict",
"+from itertools import accumulate",
"+from collections import Counter",
"+from collections import deque",
"+from operator import itemgetter",
"+from itertools import permutations",
"+",
"+mod = 10**9 + 7",
"+inf = float(\"inf\")",
"+",
"+",
"+def I():",
"+ return int(sys.stdin.readline())",
"+",
"+",
"+def LI():",
"+ return list(map(int, sys.stdin.readline().split()))",
"+",
"+",
"+def gcd(n, m):",
"+ if m == 0:",
"+ return n",
"+ else:",
"+ return gcd(m, n % m)",
"+",
"+",
"+n = I()",
"+a = LI()",
"+g = a[0]",
"+for i in a[1:]:",
"+ g = gcd(g, i)",
"+print(g)"
]
| false | 0.043113 | 0.043662 | 0.987415 | [
"s010125810",
"s395301944"
]
|
u970449052 | p02995 | python | s224079925 | s782956209 | 38 | 35 | 5,304 | 5,052 | Accepted | Accepted | 7.89 | import fractions
a,b,c,d=list(map(int,input().split()))
def lcm(x,y):
return (x*y)//fractions.gcd(x,y)
ans=(b-a+1)-(b//c)+((a-1)//c)-(b//d)+((a-1)//d)+(b//lcm(c,d))-((a-1)//lcm(c,d))
print(ans) | import fractions
a,b,c,d=list(map(int,input().split()))
a-=1
e=c*d//fractions.gcd(c,d)
print((b-a-b//c+a//c-b//d+a//d+b//e-a//e)) | 8 | 5 | 200 | 125 | import fractions
a, b, c, d = list(map(int, input().split()))
def lcm(x, y):
return (x * y) // fractions.gcd(x, y)
ans = (
(b - a + 1)
- (b // c)
+ ((a - 1) // c)
- (b // d)
+ ((a - 1) // d)
+ (b // lcm(c, d))
- ((a - 1) // lcm(c, d))
)
print(ans)
| import fractions
a, b, c, d = list(map(int, input().split()))
a -= 1
e = c * d // fractions.gcd(c, d)
print((b - a - b // c + a // c - b // d + a // d + b // e - a // e))
| false | 37.5 | [
"-",
"-",
"-def lcm(x, y):",
"- return (x * y) // fractions.gcd(x, y)",
"-",
"-",
"-ans = (",
"- (b - a + 1)",
"- - (b // c)",
"- + ((a - 1) // c)",
"- - (b // d)",
"- + ((a - 1) // d)",
"- + (b // lcm(c, d))",
"- - ((a - 1) // lcm(c, d))",
"-)",
"-print(ans)",
"+a -= 1",
"+e = c * d // fractions.gcd(c, d)",
"+print((b - a - b // c + a // c - b // d + a // d + b // e - a // e))"
]
| false | 0.0989 | 0.097889 | 1.010323 | [
"s224079925",
"s782956209"
]
|
u623819879 | p02983 | python | s393417569 | s537415397 | 1,546 | 291 | 2,940 | 40,428 | Accepted | Accepted | 81.18 | l,r=list(map(int,input().split()))
a=2019
r=min(l+a,r)
for i in range(l,r):
for j in range(l+1,r+1):
a=min(a,(i*j)%2019)
print(a)
| from collections import deque
from itertools import accumulate
import sys
sys.setrecursionlimit(10**6)
mo=10**9+7
#n=int(input())
l,r=list(map(int,input().split()))
r=min(l+2019+10,r)
ans=2018
for i in range(l,r):
for j in range(l+1,r+1):
ans=min(ans,(i*j)%2019)
#print(i,j,(i*j)%2019,ans)
print(ans)
| 8 | 19 | 138 | 338 | l, r = list(map(int, input().split()))
a = 2019
r = min(l + a, r)
for i in range(l, r):
for j in range(l + 1, r + 1):
a = min(a, (i * j) % 2019)
print(a)
| from collections import deque
from itertools import accumulate
import sys
sys.setrecursionlimit(10**6)
mo = 10**9 + 7
# n=int(input())
l, r = list(map(int, input().split()))
r = min(l + 2019 + 10, r)
ans = 2018
for i in range(l, r):
for j in range(l + 1, r + 1):
ans = min(ans, (i * j) % 2019)
# print(i,j,(i*j)%2019,ans)
print(ans)
| false | 57.894737 | [
"+from collections import deque",
"+from itertools import accumulate",
"+import sys",
"+",
"+sys.setrecursionlimit(10**6)",
"+mo = 10**9 + 7",
"+# n=int(input())",
"-a = 2019",
"-r = min(l + a, r)",
"+r = min(l + 2019 + 10, r)",
"+ans = 2018",
"- a = min(a, (i * j) % 2019)",
"-print(a)",
"+ ans = min(ans, (i * j) % 2019)",
"+ # print(i,j,(i*j)%2019,ans)",
"+print(ans)"
]
| false | 0.169042 | 0.110648 | 1.527752 | [
"s393417569",
"s537415397"
]
|
u761989513 | p03986 | python | s308501928 | s738254218 | 76 | 58 | 4,328 | 3,500 | Accepted | Accepted | 23.68 | x = eval(input())
stack = []
ans = 0
for i in range(len(x)):
if x[i] == "S":
stack.append(x[i])
elif len(stack) > 0:
stack.pop()
ans += 1
print((len(x) - ans * 2)) | x = eval(input())
count = 0
st = 0
for i in range(len(x)):
if x[i] == "S":
count += 1
elif count > 0:
count -= 1
st += 1
print((len(x) - st * 2)) | 10 | 10 | 196 | 178 | x = eval(input())
stack = []
ans = 0
for i in range(len(x)):
if x[i] == "S":
stack.append(x[i])
elif len(stack) > 0:
stack.pop()
ans += 1
print((len(x) - ans * 2))
| x = eval(input())
count = 0
st = 0
for i in range(len(x)):
if x[i] == "S":
count += 1
elif count > 0:
count -= 1
st += 1
print((len(x) - st * 2))
| false | 0 | [
"-stack = []",
"-ans = 0",
"+count = 0",
"+st = 0",
"- stack.append(x[i])",
"- elif len(stack) > 0:",
"- stack.pop()",
"- ans += 1",
"-print((len(x) - ans * 2))",
"+ count += 1",
"+ elif count > 0:",
"+ count -= 1",
"+ st += 1",
"+print((len(x) - st * 2))"
]
| false | 0.036776 | 0.037396 | 0.983404 | [
"s308501928",
"s738254218"
]
|
u419686324 | p03274 | python | s105281699 | s806021941 | 109 | 90 | 14,384 | 14,228 | Accepted | Accepted | 17.43 | N, K = list(map(int, input().split()))
X = [int(x) for x in input().split()]
import bisect
zero = bisect.bisect_left(X, 0)
left = max(zero - K, 0)
ans = float('inf')
while 1:
right = left+K-1
if left > zero + 1 or len(X) <= right: break
lv, rv = X[left], X[right]
if lv * rv > 0:
ans = min(ans, max(abs(rv), abs(lv)))
else:
ans = min(ans, min(rv*2 - lv, rv - lv*2))
left += 1
print(ans) | N, K = list(map(int, input().split()))
X = [int(x) for x in input().split()]
ans = float('inf')
for left in range(N - K + 1):
lv, rv = X[left], X[left+K-1]
if lv * rv > 0:
ans = min(ans, max(abs(rv), abs(lv)))
else:
ans = min(ans, min(rv*2 - lv, rv - lv*2))
print(ans) | 19 | 11 | 441 | 301 | N, K = list(map(int, input().split()))
X = [int(x) for x in input().split()]
import bisect
zero = bisect.bisect_left(X, 0)
left = max(zero - K, 0)
ans = float("inf")
while 1:
right = left + K - 1
if left > zero + 1 or len(X) <= right:
break
lv, rv = X[left], X[right]
if lv * rv > 0:
ans = min(ans, max(abs(rv), abs(lv)))
else:
ans = min(ans, min(rv * 2 - lv, rv - lv * 2))
left += 1
print(ans)
| N, K = list(map(int, input().split()))
X = [int(x) for x in input().split()]
ans = float("inf")
for left in range(N - K + 1):
lv, rv = X[left], X[left + K - 1]
if lv * rv > 0:
ans = min(ans, max(abs(rv), abs(lv)))
else:
ans = min(ans, min(rv * 2 - lv, rv - lv * 2))
print(ans)
| false | 42.105263 | [
"-import bisect",
"-",
"-zero = bisect.bisect_left(X, 0)",
"-left = max(zero - K, 0)",
"-while 1:",
"- right = left + K - 1",
"- if left > zero + 1 or len(X) <= right:",
"- break",
"- lv, rv = X[left], X[right]",
"+for left in range(N - K + 1):",
"+ lv, rv = X[left], X[left + K - 1]",
"- left += 1"
]
| false | 0.046081 | 0.095042 | 0.484845 | [
"s105281699",
"s806021941"
]
|
u347600233 | p02640 | python | s662469446 | s131604166 | 22 | 20 | 9,176 | 9,172 | Accepted | Accepted | 9.09 | x, y = list(map(int, input().split()))
ans = False
for c in range(x + 1):
t = x - c
if c + t == x and 2*c + 4*t == y:
ans = True
break
print(('Yes' if ans else 'No')) | x, y = list(map(int, input().split()))
ans = 'No'
for c in range(x + 1):
t = x - c
if 2*c + 4*t == y:
ans = 'Yes'
print(ans) | 8 | 7 | 189 | 140 | x, y = list(map(int, input().split()))
ans = False
for c in range(x + 1):
t = x - c
if c + t == x and 2 * c + 4 * t == y:
ans = True
break
print(("Yes" if ans else "No"))
| x, y = list(map(int, input().split()))
ans = "No"
for c in range(x + 1):
t = x - c
if 2 * c + 4 * t == y:
ans = "Yes"
print(ans)
| false | 12.5 | [
"-ans = False",
"+ans = \"No\"",
"- if c + t == x and 2 * c + 4 * t == y:",
"- ans = True",
"- break",
"-print((\"Yes\" if ans else \"No\"))",
"+ if 2 * c + 4 * t == y:",
"+ ans = \"Yes\"",
"+print(ans)"
]
| false | 0.126701 | 0.122252 | 1.036393 | [
"s662469446",
"s131604166"
]
|
u852690916 | p02598 | python | s551650607 | s494945400 | 1,722 | 196 | 104,796 | 103,772 | Accepted | Accepted | 88.62 | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
from math import ceil
def main(N, K, A):
def cut_times(longest):
return sum(a // longest for a in A if a > longest)
under = 0
r = 10**9
for i in range(100):
m = (under + r) / 2
if cut_times(m) > K: under = m
else: r = m
print((ceil(r - 10**-10)))
if __name__ == '__main__':
input = sys.stdin.readline
N, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
main(N, K, A)
| # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, K, A):
lo = 0
hi = 10**9
while hi - lo > 1:
m = (lo + hi) // 2
if sum((a + m - 1) // m - 1 for a in A) <= K: hi = m
else: lo = m
print(hi)
if __name__ == '__main__':
input = sys.stdin.readline
N, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
main(N, K, A)
| 19 | 16 | 523 | 414 | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
from math import ceil
def main(N, K, A):
def cut_times(longest):
return sum(a // longest for a in A if a > longest)
under = 0
r = 10**9
for i in range(100):
m = (under + r) / 2
if cut_times(m) > K:
under = m
else:
r = m
print((ceil(r - 10**-10)))
if __name__ == "__main__":
input = sys.stdin.readline
N, K = list(map(int, input().split()))
(*A,) = list(map(int, input().split()))
main(N, K, A)
| # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, K, A):
lo = 0
hi = 10**9
while hi - lo > 1:
m = (lo + hi) // 2
if sum((a + m - 1) // m - 1 for a in A) <= K:
hi = m
else:
lo = m
print(hi)
if __name__ == "__main__":
input = sys.stdin.readline
N, K = list(map(int, input().split()))
(*A,) = list(map(int, input().split()))
main(N, K, A)
| false | 15.789474 | [
"-from math import ceil",
"- def cut_times(longest):",
"- return sum(a // longest for a in A if a > longest)",
"-",
"- under = 0",
"- r = 10**9",
"- for i in range(100):",
"- m = (under + r) / 2",
"- if cut_times(m) > K:",
"- under = m",
"+ lo = 0",
"+ hi = 10**9",
"+ while hi - lo > 1:",
"+ m = (lo + hi) // 2",
"+ if sum((a + m - 1) // m - 1 for a in A) <= K:",
"+ hi = m",
"- r = m",
"- print((ceil(r - 10**-10)))",
"+ lo = m",
"+ print(hi)"
]
| false | 0.03805 | 0.136013 | 0.279751 | [
"s551650607",
"s494945400"
]
|
u729133443 | p02788 | python | s339464468 | s612755937 | 513 | 472 | 55,880 | 55,768 | Accepted | Accepted | 7.99 | def main():
import sys
from bisect import bisect
from operator import itemgetter
b=sys.stdin.buffer
n,d,a=list(map(int,b.readline().split()))
m=list(map(int,b.read().split()))
c=[0]*(n+1)
z=sorted(zip(m,m),key=itemgetter(0))
y=[x for x,_ in z]
s=b=0
for i,(x,h)in enumerate(z):
c[i]+=b
b=c[i]
h-=b
t=-h//a
if t<0:
b-=t*a
c[bisect(y,x+d+d)]+=t*a
s-=t
print(s)
main() | def main():
import sys
from collections import deque
from operator import itemgetter
b=sys.stdin.buffer
n,d,a=list(map(int,b.readline().split()))
m=list(map(int,b.read().split()))
p,q=deque(),deque()
f,g=p.popleft,q.popleft
s=b=0
for x,h in sorted(zip(m,m),key=itemgetter(0)):
while p and p[0]<x:
f()
b-=g()
h-=b
t=0--h//a
if t>0:
s+=t
b+=t*a
p+=x+d+d,
q+=t*a,
print(s)
main() | 22 | 23 | 498 | 534 | def main():
import sys
from bisect import bisect
from operator import itemgetter
b = sys.stdin.buffer
n, d, a = list(map(int, b.readline().split()))
m = list(map(int, b.read().split()))
c = [0] * (n + 1)
z = sorted(zip(m, m), key=itemgetter(0))
y = [x for x, _ in z]
s = b = 0
for i, (x, h) in enumerate(z):
c[i] += b
b = c[i]
h -= b
t = -h // a
if t < 0:
b -= t * a
c[bisect(y, x + d + d)] += t * a
s -= t
print(s)
main()
| def main():
import sys
from collections import deque
from operator import itemgetter
b = sys.stdin.buffer
n, d, a = list(map(int, b.readline().split()))
m = list(map(int, b.read().split()))
p, q = deque(), deque()
f, g = p.popleft, q.popleft
s = b = 0
for x, h in sorted(zip(m, m), key=itemgetter(0)):
while p and p[0] < x:
f()
b -= g()
h -= b
t = 0 - -h // a
if t > 0:
s += t
b += t * a
p += (x + d + d,)
q += (t * a,)
print(s)
main()
| false | 4.347826 | [
"- from bisect import bisect",
"+ from collections import deque",
"- c = [0] * (n + 1)",
"- z = sorted(zip(m, m), key=itemgetter(0))",
"- y = [x for x, _ in z]",
"+ p, q = deque(), deque()",
"+ f, g = p.popleft, q.popleft",
"- for i, (x, h) in enumerate(z):",
"- c[i] += b",
"- b = c[i]",
"+ for x, h in sorted(zip(m, m), key=itemgetter(0)):",
"+ while p and p[0] < x:",
"+ f()",
"+ b -= g()",
"- t = -h // a",
"- if t < 0:",
"- b -= t * a",
"- c[bisect(y, x + d + d)] += t * a",
"- s -= t",
"+ t = 0 - -h // a",
"+ if t > 0:",
"+ s += t",
"+ b += t * a",
"+ p += (x + d + d,)",
"+ q += (t * a,)"
]
| false | 0.044172 | 0.036125 | 1.222741 | [
"s339464468",
"s612755937"
]
|
u934442292 | p02888 | python | s768081081 | s673343158 | 932 | 740 | 3,188 | 9,252 | Accepted | Accepted | 20.6 | import sys
from bisect import bisect_left
input = sys.stdin.readline
def main():
N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(N - 2):
a = L[i]
for j in range(i + 1, N - 1):
k = bisect_left(L, a + L[j])
ans += (k - 1 - j)
print(ans)
if __name__ == "__main__":
main()
| import sys
import bisect
input = sys.stdin.readline
def main():
N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
ans = 0
for a in range(N - 2):
for b in range(a + 1, N - 1):
c = bisect.bisect_left(L, L[a] + L[b]) - 1
ans += c - b
print(ans)
if __name__ == "__main__":
main()
| 23 | 22 | 403 | 376 | import sys
from bisect import bisect_left
input = sys.stdin.readline
def main():
N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(N - 2):
a = L[i]
for j in range(i + 1, N - 1):
k = bisect_left(L, a + L[j])
ans += k - 1 - j
print(ans)
if __name__ == "__main__":
main()
| import sys
import bisect
input = sys.stdin.readline
def main():
N = int(eval(input()))
L = list(map(int, input().split()))
L.sort()
ans = 0
for a in range(N - 2):
for b in range(a + 1, N - 1):
c = bisect.bisect_left(L, L[a] + L[b]) - 1
ans += c - b
print(ans)
if __name__ == "__main__":
main()
| false | 4.347826 | [
"-from bisect import bisect_left",
"+import bisect",
"- for i in range(N - 2):",
"- a = L[i]",
"- for j in range(i + 1, N - 1):",
"- k = bisect_left(L, a + L[j])",
"- ans += k - 1 - j",
"+ for a in range(N - 2):",
"+ for b in range(a + 1, N - 1):",
"+ c = bisect.bisect_left(L, L[a] + L[b]) - 1",
"+ ans += c - b"
]
| false | 0.039893 | 0.045396 | 0.878782 | [
"s768081081",
"s673343158"
]
|
u761529120 | p03213 | python | s469860080 | s370882664 | 218 | 173 | 41,820 | 38,352 | Accepted | Accepted | 20.64 | # M = a ** x * b ** y * c ** z
# の約数の個数は(x + 1)*(y + 1)*(z + 1)
# なので約数が75個になるには、以下パターンが考えられる
# 75
# 25 * 3
# 15 * 5
# 5 * 5 * 3
# よって1～Nまで素因数分解して、各素因数の指数部分の値を求めて
# 計算する
import itertools
def main():
N = int(eval(input()))
d = [0] * (N+1)
for i in range(2,N+1):
cur = i
for j in range(2, i+1):
while cur % j == 0:
d[j] += 1
cur = cur // j
ans = 0
for i in d:
if i >= 74:
ans += 1
for (x, y, z) in itertools.combinations(d,3):
for a, b, c in [[4, 4, 2],[4, 2, 4],[2, 4, 4]]:
if x >= a and y >= b and z >= c:
ans += 1
for (x, y) in itertools.combinations(d,2):
for a, b in [[24,2],[14,4],[4,14],[2,24]]:
if x >= a and y >= b:
ans += 1
print(ans)
main() | from collections import defaultdict
def main():
# 75 * 1
# 25 * 3
# 15 * 5
# 5 * 5 * 3
N = int(eval(input()))
d = defaultdict(int)
for n in range(1, N+1):
for i in range(2, int(n ** 0.5) + 1):
while n % i == 0:
d[i] += 1
n = n // i
if n != 1:
d[n] += 1
d2 = 0
d4 = 0
d14 = 0
d24 = 0
d74 = 0
for i in list(d.values()):
if i >= 2:
d2 += 1
if i >= 4:
d4 += 1
if i >= 14:
d14 += 1
if i >= 24:
d24 += 1
if i >= 74:
d74 += 1
ans = d74
ans += d24 * (d2 - 1)
ans += d14 * (d4 - 1)
ans += (d4 * (d4 - 1) * (d2 - 2)) // 2
print(ans)
if __name__ == "__main__":
main() | 43 | 44 | 883 | 841 | # M = a ** x * b ** y * c ** z
# の約数の個数は(x + 1)*(y + 1)*(z + 1)
# なので約数が75個になるには、以下パターンが考えられる
# 75
# 25 * 3
# 15 * 5
# 5 * 5 * 3
# よって1～Nまで素因数分解して、各素因数の指数部分の値を求めて
# 計算する
import itertools
def main():
N = int(eval(input()))
d = [0] * (N + 1)
for i in range(2, N + 1):
cur = i
for j in range(2, i + 1):
while cur % j == 0:
d[j] += 1
cur = cur // j
ans = 0
for i in d:
if i >= 74:
ans += 1
for (x, y, z) in itertools.combinations(d, 3):
for a, b, c in [[4, 4, 2], [4, 2, 4], [2, 4, 4]]:
if x >= a and y >= b and z >= c:
ans += 1
for (x, y) in itertools.combinations(d, 2):
for a, b in [[24, 2], [14, 4], [4, 14], [2, 24]]:
if x >= a and y >= b:
ans += 1
print(ans)
main()
| from collections import defaultdict
def main():
# 75 * 1
# 25 * 3
# 15 * 5
# 5 * 5 * 3
N = int(eval(input()))
d = defaultdict(int)
for n in range(1, N + 1):
for i in range(2, int(n**0.5) + 1):
while n % i == 0:
d[i] += 1
n = n // i
if n != 1:
d[n] += 1
d2 = 0
d4 = 0
d14 = 0
d24 = 0
d74 = 0
for i in list(d.values()):
if i >= 2:
d2 += 1
if i >= 4:
d4 += 1
if i >= 14:
d14 += 1
if i >= 24:
d24 += 1
if i >= 74:
d74 += 1
ans = d74
ans += d24 * (d2 - 1)
ans += d14 * (d4 - 1)
ans += (d4 * (d4 - 1) * (d2 - 2)) // 2
print(ans)
if __name__ == "__main__":
main()
| false | 2.272727 | [
"-# M = a ** x * b ** y * c ** z",
"-# の約数の個数は(x + 1)*(y + 1)*(z + 1)",
"-# なので約数が75個になるには、以下パターンが考えられる",
"-# 75",
"-# 25 * 3",
"-# 15 * 5",
"-# 5 * 5 * 3",
"-# よって1～Nまで素因数分解して、各素因数の指数部分の値を求めて",
"-# 計算する",
"-import itertools",
"+from collections import defaultdict",
"+ # 75 * 1",
"+ # 25 * 3",
"+ # 15 * 5",
"+ # 5 * 5 * 3",
"- d = [0] * (N + 1)",
"- for i in range(2, N + 1):",
"- cur = i",
"- for j in range(2, i + 1):",
"- while cur % j == 0:",
"- d[j] += 1",
"- cur = cur // j",
"- ans = 0",
"- for i in d:",
"+ d = defaultdict(int)",
"+ for n in range(1, N + 1):",
"+ for i in range(2, int(n**0.5) + 1):",
"+ while n % i == 0:",
"+ d[i] += 1",
"+ n = n // i",
"+ if n != 1:",
"+ d[n] += 1",
"+ d2 = 0",
"+ d4 = 0",
"+ d14 = 0",
"+ d24 = 0",
"+ d74 = 0",
"+ for i in list(d.values()):",
"+ if i >= 2:",
"+ d2 += 1",
"+ if i >= 4:",
"+ d4 += 1",
"+ if i >= 14:",
"+ d14 += 1",
"+ if i >= 24:",
"+ d24 += 1",
"- ans += 1",
"- for (x, y, z) in itertools.combinations(d, 3):",
"- for a, b, c in [[4, 4, 2], [4, 2, 4], [2, 4, 4]]:",
"- if x >= a and y >= b and z >= c:",
"- ans += 1",
"- for (x, y) in itertools.combinations(d, 2):",
"- for a, b in [[24, 2], [14, 4], [4, 14], [2, 24]]:",
"- if x >= a and y >= b:",
"- ans += 1",
"+ d74 += 1",
"+ ans = d74",
"+ ans += d24 * (d2 - 1)",
"+ ans += d14 * (d4 - 1)",
"+ ans += (d4 * (d4 - 1) * (d2 - 2)) // 2",
"-main()",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.065248 | 0.035852 | 1.819904 | [
"s469860080",
"s370882664"
]
|
u102461423 | p02710 | python | s980789796 | s698670703 | 1,969 | 1,541 | 198,520 | 192,728 | Accepted | Accepted | 21.74 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
from numba import njit
def EulerTour(graph, root=1):
N = len(graph) - 1
parent = [0] * (N + 1)
stack = [-root, root]
tour = []
ind_L = [0] * (N + 1)
ind_R = [0] * (N + 1)
i = -1
while stack:
v = stack.pop()
tour.append(v)
i += 1
if v > 0:
ind_L[v] = i
p = parent[v]
for w in graph[v]:
if w == p:
continue
parent[w] = v
stack.append(-w)
stack.append(w)
else:
ind_R[-v] = i
return tour, ind_L, ind_R, parent
N = int(readline())
graph = [[] for _ in range(N + 1)]
C = np.zeros(N + 1, np.int64)
C[1:] = np.array(readline().split(), np.int64)
m = list(map(int, read().split()))
for a, b in zip(m, m):
graph[a].append(b)
graph[b].append(a)
tour, ind_L, ind_R, parent = [np.array(x, np.int64) for x in EulerTour(graph)]
@njit('i8[:](i8[:],i8[:],i8[:],i8[:],i8[:])', cache=True)
def main(C, tour, ind_L, ind_R, parent):
N = len(C) - 1
removed = np.zeros(N + 1, np.int64)
answer = np.full_like(removed, N * (N + 1) // 2)
memo = np.zeros_like(answer)
for v in tour:
if v > 0:
memo[v] = removed[C[parent[v]]]
else:
v = -v
removed[C[v]] += 1
p = parent[v]
x = (ind_R[v] - ind_L[v]) // 2 + 1 # subtree size
x -= removed[C[p]] - memo[v]
answer[C[p]] -= x * (x + 1) // 2
removed[C[p]] += x
for i, x in enumerate(removed):
x = N - x
answer[i] -= x * (x + 1) // 2
return answer
answer = main(C, tour, ind_L, ind_R, parent)
print(('\n'.join(answer[1:].astype(str))))
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
from numba import njit
def EulerTour(graph, root=1):
N = len(graph) - 1
parent = [0] * (N + 1)
stack = [-root, root]
tour = []
ind_L = [0] * (N + 1)
ind_R = [0] * (N + 1)
i = -1
while stack:
v = stack.pop()
tour.append(v)
i += 1
if v > 0:
ind_L[v] = i
p = parent[v]
for w in graph[v]:
if w == p:
continue
parent[w] = v
stack.append(-w)
stack.append(w)
else:
ind_R[-v] = i
return tour, ind_L, ind_R, parent
@njit('i8[:](i8[:],i8[:],i8[:],i8[:],i8[:])', cache=True)
def main(C, tour, ind_L, ind_R, parent):
N = len(C) - 1
removed = np.zeros(N + 1, np.int64)
answer = np.full_like(removed, N * (N + 1) // 2)
memo = np.zeros_like(answer)
for v in tour:
if v > 0:
memo[v] = removed[C[parent[v]]]
else:
v = -v
removed[C[v]] += 1
p = parent[v]
x = (ind_R[v] - ind_L[v]) // 2 + 1 # subtree size
x -= removed[C[p]] - memo[v]
answer[C[p]] -= x * (x + 1) // 2
removed[C[p]] += x
for i, x in enumerate(removed):
x = N - x
answer[i] -= x * (x + 1) // 2
return answer
N = int(readline())
graph = [[] for _ in range(N + 1)]
C = np.zeros(N + 1, np.int64)
C[1:] = np.array(readline().split(), np.int64)
m = list(map(int, read().split()))
for a, b in zip(m, m):
graph[a].append(b)
graph[b].append(a)
tour, ind_L, ind_R, parent = [np.array(x, np.int64) for x in EulerTour(graph)]
answer = main(C, tour, ind_L, ind_R, parent)
print(('\n'.join(answer[1:].astype(str))))
| 71 | 70 | 1,933 | 1,931 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
from numba import njit
def EulerTour(graph, root=1):
N = len(graph) - 1
parent = [0] * (N + 1)
stack = [-root, root]
tour = []
ind_L = [0] * (N + 1)
ind_R = [0] * (N + 1)
i = -1
while stack:
v = stack.pop()
tour.append(v)
i += 1
if v > 0:
ind_L[v] = i
p = parent[v]
for w in graph[v]:
if w == p:
continue
parent[w] = v
stack.append(-w)
stack.append(w)
else:
ind_R[-v] = i
return tour, ind_L, ind_R, parent
N = int(readline())
graph = [[] for _ in range(N + 1)]
C = np.zeros(N + 1, np.int64)
C[1:] = np.array(readline().split(), np.int64)
m = list(map(int, read().split()))
for a, b in zip(m, m):
graph[a].append(b)
graph[b].append(a)
tour, ind_L, ind_R, parent = [np.array(x, np.int64) for x in EulerTour(graph)]
@njit("i8[:](i8[:],i8[:],i8[:],i8[:],i8[:])", cache=True)
def main(C, tour, ind_L, ind_R, parent):
N = len(C) - 1
removed = np.zeros(N + 1, np.int64)
answer = np.full_like(removed, N * (N + 1) // 2)
memo = np.zeros_like(answer)
for v in tour:
if v > 0:
memo[v] = removed[C[parent[v]]]
else:
v = -v
removed[C[v]] += 1
p = parent[v]
x = (ind_R[v] - ind_L[v]) // 2 + 1 # subtree size
x -= removed[C[p]] - memo[v]
answer[C[p]] -= x * (x + 1) // 2
removed[C[p]] += x
for i, x in enumerate(removed):
x = N - x
answer[i] -= x * (x + 1) // 2
return answer
answer = main(C, tour, ind_L, ind_R, parent)
print(("\n".join(answer[1:].astype(str))))
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
from numba import njit
def EulerTour(graph, root=1):
N = len(graph) - 1
parent = [0] * (N + 1)
stack = [-root, root]
tour = []
ind_L = [0] * (N + 1)
ind_R = [0] * (N + 1)
i = -1
while stack:
v = stack.pop()
tour.append(v)
i += 1
if v > 0:
ind_L[v] = i
p = parent[v]
for w in graph[v]:
if w == p:
continue
parent[w] = v
stack.append(-w)
stack.append(w)
else:
ind_R[-v] = i
return tour, ind_L, ind_R, parent
@njit("i8[:](i8[:],i8[:],i8[:],i8[:],i8[:])", cache=True)
def main(C, tour, ind_L, ind_R, parent):
N = len(C) - 1
removed = np.zeros(N + 1, np.int64)
answer = np.full_like(removed, N * (N + 1) // 2)
memo = np.zeros_like(answer)
for v in tour:
if v > 0:
memo[v] = removed[C[parent[v]]]
else:
v = -v
removed[C[v]] += 1
p = parent[v]
x = (ind_R[v] - ind_L[v]) // 2 + 1 # subtree size
x -= removed[C[p]] - memo[v]
answer[C[p]] -= x * (x + 1) // 2
removed[C[p]] += x
for i, x in enumerate(removed):
x = N - x
answer[i] -= x * (x + 1) // 2
return answer
N = int(readline())
graph = [[] for _ in range(N + 1)]
C = np.zeros(N + 1, np.int64)
C[1:] = np.array(readline().split(), np.int64)
m = list(map(int, read().split()))
for a, b in zip(m, m):
graph[a].append(b)
graph[b].append(a)
tour, ind_L, ind_R, parent = [np.array(x, np.int64) for x in EulerTour(graph)]
answer = main(C, tour, ind_L, ind_R, parent)
print(("\n".join(answer[1:].astype(str))))
| false | 1.408451 | [
"-N = int(readline())",
"-graph = [[] for _ in range(N + 1)]",
"-C = np.zeros(N + 1, np.int64)",
"-C[1:] = np.array(readline().split(), np.int64)",
"-m = list(map(int, read().split()))",
"-for a, b in zip(m, m):",
"- graph[a].append(b)",
"- graph[b].append(a)",
"-tour, ind_L, ind_R, parent = [np.array(x, np.int64) for x in EulerTour(graph)]",
"-",
"-",
"+N = int(readline())",
"+graph = [[] for _ in range(N + 1)]",
"+C = np.zeros(N + 1, np.int64)",
"+C[1:] = np.array(readline().split(), np.int64)",
"+m = list(map(int, read().split()))",
"+for a, b in zip(m, m):",
"+ graph[a].append(b)",
"+ graph[b].append(a)",
"+tour, ind_L, ind_R, parent = [np.array(x, np.int64) for x in EulerTour(graph)]"
]
| false | 0.243736 | 0.269477 | 0.904477 | [
"s980789796",
"s698670703"
]
|
u093861603 | p02773 | python | s006437445 | s956357981 | 1,087 | 710 | 94,424 | 45,040 | Accepted | Accepted | 34.68 | n = int(eval(input()))
dic = {}
for i in range(n):
s = eval(input())
if s in dic:
dic[s] += 1
else:
dic[s] = 1
d = max(dic.values())
max_k_list = [kv[0] for kv in list(dic.items()) if kv[1] == d]
max_k_list.sort()
for s in max_k_list:
print(s)
| import collections
n=int(eval(input()))
s=[]
for i in range(n):
s.append(eval(input()))
c=collections.Counter(s).most_common()
ans=[c[0][0]]
mx=c[0][1]
for i in range(1,len(c)):
if c[i][1]==mx:
ans.append(c[i][0])
else:
break
ans.sort()
for res in ans:
print(res)
| 17 | 19 | 278 | 308 | n = int(eval(input()))
dic = {}
for i in range(n):
s = eval(input())
if s in dic:
dic[s] += 1
else:
dic[s] = 1
d = max(dic.values())
max_k_list = [kv[0] for kv in list(dic.items()) if kv[1] == d]
max_k_list.sort()
for s in max_k_list:
print(s)
| import collections
n = int(eval(input()))
s = []
for i in range(n):
s.append(eval(input()))
c = collections.Counter(s).most_common()
ans = [c[0][0]]
mx = c[0][1]
for i in range(1, len(c)):
if c[i][1] == mx:
ans.append(c[i][0])
else:
break
ans.sort()
for res in ans:
print(res)
| false | 10.526316 | [
"+import collections",
"+",
"-dic = {}",
"+s = []",
"- s = eval(input())",
"- if s in dic:",
"- dic[s] += 1",
"+ s.append(eval(input()))",
"+c = collections.Counter(s).most_common()",
"+ans = [c[0][0]]",
"+mx = c[0][1]",
"+for i in range(1, len(c)):",
"+ if c[i][1] == mx:",
"+ ans.append(c[i][0])",
"- dic[s] = 1",
"-d = max(dic.values())",
"-max_k_list = [kv[0] for kv in list(dic.items()) if kv[1] == d]",
"-max_k_list.sort()",
"-for s in max_k_list:",
"- print(s)",
"+ break",
"+ans.sort()",
"+for res in ans:",
"+ print(res)"
]
| false | 0.035498 | 0.055882 | 0.635225 | [
"s006437445",
"s956357981"
]
|
u612975321 | p02991 | python | s033039556 | s998426967 | 832 | 737 | 57,568 | 42,456 | Accepted | Accepted | 11.42 | import copy
import sys
input = sys.stdin.readline
n, m = list(map(int,input().split()))
edge = []
graph = [[] for i in range(n+1)]
for i in range(m):
edge.append(list(map(int,input().split())))
graph[edge[-1][0]].append(edge[-1][1])
s, g = list(map(int,input().split()))
INF = 10**18
ans = [[INF, INF, INF] for i in range(n+1)]
q = [s]
d = 0
while q:
nq = []
d += 1
p = d % 3
for cf in q:
for ct in graph[cf]:
if ans[ct][p] == INF:
ans[ct][p] = d
nq.append(ct)
q = copy.deepcopy(nq)
if ans[g][0] == INF:
print((-1))
else:
print((ans[g][0]//3)) | import copy
import sys
input = sys.stdin.readline
n, m = list(map(int,input().split()))
graph = [[] for i in range(n+1)]
for i in range(m):
u, v = list(map(int,input().split()))
graph[u].append(v)
s, g = list(map(int,input().split()))
INF = 10**7
ans = [[INF, INF, INF] for i in range(n+1)]
q = [s]
d = 0
while q:
nq = []
d += 1
p = d % 3
for cf in q:
for ct in graph[cf]:
if ans[ct][p] == INF:
ans[ct][p] = d
nq.append(ct)
q = copy.deepcopy(nq)
if ans[g][0] == INF:
print((-1))
else:
print((ans[g][0]//3)) | 30 | 29 | 646 | 602 | import copy
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
edge = []
graph = [[] for i in range(n + 1)]
for i in range(m):
edge.append(list(map(int, input().split())))
graph[edge[-1][0]].append(edge[-1][1])
s, g = list(map(int, input().split()))
INF = 10**18
ans = [[INF, INF, INF] for i in range(n + 1)]
q = [s]
d = 0
while q:
nq = []
d += 1
p = d % 3
for cf in q:
for ct in graph[cf]:
if ans[ct][p] == INF:
ans[ct][p] = d
nq.append(ct)
q = copy.deepcopy(nq)
if ans[g][0] == INF:
print((-1))
else:
print((ans[g][0] // 3))
| import copy
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
graph = [[] for i in range(n + 1)]
for i in range(m):
u, v = list(map(int, input().split()))
graph[u].append(v)
s, g = list(map(int, input().split()))
INF = 10**7
ans = [[INF, INF, INF] for i in range(n + 1)]
q = [s]
d = 0
while q:
nq = []
d += 1
p = d % 3
for cf in q:
for ct in graph[cf]:
if ans[ct][p] == INF:
ans[ct][p] = d
nq.append(ct)
q = copy.deepcopy(nq)
if ans[g][0] == INF:
print((-1))
else:
print((ans[g][0] // 3))
| false | 3.333333 | [
"-edge = []",
"- edge.append(list(map(int, input().split())))",
"- graph[edge[-1][0]].append(edge[-1][1])",
"+ u, v = list(map(int, input().split()))",
"+ graph[u].append(v)",
"-INF = 10**18",
"+INF = 10**7"
]
| false | 0.077839 | 0.192989 | 0.403334 | [
"s033039556",
"s998426967"
]
|
u153665391 | p02280 | python | s169034038 | s878136747 | 30 | 20 | 5,612 | 5,624 | Accepted | Accepted | 33.33 | N = int(eval(input()))
binary_tree = [{"parent": -1, "sibling": -1} for _ in range(N)]
for _ in range(N):
node_input = eval(input())
id, left, right = list(map(int, node_input.split()))
binary_tree[id]["left"] = left
binary_tree[id]["right"] = right
degree = 0
if left != -1:
degree += 1
binary_tree[left]["parent"] = id
binary_tree[left]["sibling"] = right
if right != -1:
degree += 1
binary_tree[right]["parent"] = id
binary_tree[right]["sibling"] = left
binary_tree[id]["degree"] = degree
def measure_depth_and_height(id, depth):
H[id] = max(H[id], depth)
parent_id = binary_tree[id]["parent"]
if parent_id == -1:
return depth
return measure_depth_and_height(parent_id, depth+1)
D = [0 for i in range(N)]
H = [0 for i in range(N)]
for id in range(N):
depth = measure_depth_and_height(id, 0)
D[id] = depth
def get_type(node):
if node["parent"] == -1:
return "root"
if node["degree"] == 0:
return "leaf"
if node["parent"] == -1:
return "root"
return "internal node"
for id in range(N):
node = binary_tree[id]
parent_id = node["parent"]
sibling_id = node["sibling"]
degree = node["degree"]
node_type = get_type(node)
print(("node {}: parent = {}, sibling = {}, degree = {}, depth = {}, height = {}, {}".format(id, parent_id, sibling_id, degree, D[id], H[id], node_type)))
| N = int(eval(input()))
binary_tree = [{"parent": -1, "sibling": -1} for _ in range(N)]
for _ in range(N):
node_input = eval(input())
id, left, right = list(map(int, node_input.split()))
binary_tree[id]["left"] = left
binary_tree[id]["right"] = right
if left != -1:
binary_tree[left]["parent"] = id
if right != -1:
binary_tree[right]["parent"] = id
def set_depth(id, depth):
if id == -1:
return
D[id] = depth
set_depth(binary_tree[id]["left"], depth+1)
set_depth(binary_tree[id]["right"], depth+1)
def set_height(id):
h1, h2 = 0, 0
if binary_tree[id]["left"] != -1:
h1 = set_height(binary_tree[id]["left"]) + 1
if binary_tree[id]["right"] != -1:
h2 = set_height(binary_tree[id]["right"]) + 1
H[id] = max(h1, h2)
return H[id]
D = [0 for i in range(N)]
H = [0 for i in range(N)]
for id in range(N):
if binary_tree[id]["parent"] == -1:
set_depth(id, 0)
set_height(id)
def get_sibling(id):
parent_id = node["parent"]
if parent_id == -1:
return -1
if binary_tree[parent_id]["left"] != id:
return binary_tree[parent_id]["left"]
else:
return binary_tree[parent_id]["right"]
def get_degree(node):
degree = 0
if node["left"] != -1:
degree += 1
if node["right"] != -1:
degree += 1
return degree
def get_type(node, dgree):
if node["parent"] == -1:
return "root"
if degree == 0:
return "leaf"
return "internal node"
for id in range(N):
node = binary_tree[id]
parent_id = node["parent"]
sibling_id = get_sibling(id)
degree = get_degree(node)
node_type = get_type(node, degree)
print(("node {}: parent = {}, sibling = {}, degree = {}, depth = {}, height = {}, {}".format(id, parent_id, sibling_id, degree, D[id], H[id], node_type)))
| 54 | 74 | 1,492 | 1,930 | N = int(eval(input()))
binary_tree = [{"parent": -1, "sibling": -1} for _ in range(N)]
for _ in range(N):
node_input = eval(input())
id, left, right = list(map(int, node_input.split()))
binary_tree[id]["left"] = left
binary_tree[id]["right"] = right
degree = 0
if left != -1:
degree += 1
binary_tree[left]["parent"] = id
binary_tree[left]["sibling"] = right
if right != -1:
degree += 1
binary_tree[right]["parent"] = id
binary_tree[right]["sibling"] = left
binary_tree[id]["degree"] = degree
def measure_depth_and_height(id, depth):
H[id] = max(H[id], depth)
parent_id = binary_tree[id]["parent"]
if parent_id == -1:
return depth
return measure_depth_and_height(parent_id, depth + 1)
D = [0 for i in range(N)]
H = [0 for i in range(N)]
for id in range(N):
depth = measure_depth_and_height(id, 0)
D[id] = depth
def get_type(node):
if node["parent"] == -1:
return "root"
if node["degree"] == 0:
return "leaf"
if node["parent"] == -1:
return "root"
return "internal node"
for id in range(N):
node = binary_tree[id]
parent_id = node["parent"]
sibling_id = node["sibling"]
degree = node["degree"]
node_type = get_type(node)
print(
(
"node {}: parent = {}, sibling = {}, degree = {}, depth = {}, height = {}, {}".format(
id, parent_id, sibling_id, degree, D[id], H[id], node_type
)
)
)
| N = int(eval(input()))
binary_tree = [{"parent": -1, "sibling": -1} for _ in range(N)]
for _ in range(N):
node_input = eval(input())
id, left, right = list(map(int, node_input.split()))
binary_tree[id]["left"] = left
binary_tree[id]["right"] = right
if left != -1:
binary_tree[left]["parent"] = id
if right != -1:
binary_tree[right]["parent"] = id
def set_depth(id, depth):
if id == -1:
return
D[id] = depth
set_depth(binary_tree[id]["left"], depth + 1)
set_depth(binary_tree[id]["right"], depth + 1)
def set_height(id):
h1, h2 = 0, 0
if binary_tree[id]["left"] != -1:
h1 = set_height(binary_tree[id]["left"]) + 1
if binary_tree[id]["right"] != -1:
h2 = set_height(binary_tree[id]["right"]) + 1
H[id] = max(h1, h2)
return H[id]
D = [0 for i in range(N)]
H = [0 for i in range(N)]
for id in range(N):
if binary_tree[id]["parent"] == -1:
set_depth(id, 0)
set_height(id)
def get_sibling(id):
parent_id = node["parent"]
if parent_id == -1:
return -1
if binary_tree[parent_id]["left"] != id:
return binary_tree[parent_id]["left"]
else:
return binary_tree[parent_id]["right"]
def get_degree(node):
degree = 0
if node["left"] != -1:
degree += 1
if node["right"] != -1:
degree += 1
return degree
def get_type(node, dgree):
if node["parent"] == -1:
return "root"
if degree == 0:
return "leaf"
return "internal node"
for id in range(N):
node = binary_tree[id]
parent_id = node["parent"]
sibling_id = get_sibling(id)
degree = get_degree(node)
node_type = get_type(node, degree)
print(
(
"node {}: parent = {}, sibling = {}, degree = {}, depth = {}, height = {}, {}".format(
id, parent_id, sibling_id, degree, D[id], H[id], node_type
)
)
)
| false | 27.027027 | [
"- degree = 0",
"- degree += 1",
"- binary_tree[left][\"sibling\"] = right",
"- degree += 1",
"- binary_tree[right][\"sibling\"] = left",
"- binary_tree[id][\"degree\"] = degree",
"-def measure_depth_and_height(id, depth):",
"- H[id] = max(H[id], depth)",
"- parent_id = binary_tree[id][\"parent\"]",
"- if parent_id == -1:",
"- return depth",
"- return measure_depth_and_height(parent_id, depth + 1)",
"+def set_depth(id, depth):",
"+ if id == -1:",
"+ return",
"+ D[id] = depth",
"+ set_depth(binary_tree[id][\"left\"], depth + 1)",
"+ set_depth(binary_tree[id][\"right\"], depth + 1)",
"+",
"+",
"+def set_height(id):",
"+ h1, h2 = 0, 0",
"+ if binary_tree[id][\"left\"] != -1:",
"+ h1 = set_height(binary_tree[id][\"left\"]) + 1",
"+ if binary_tree[id][\"right\"] != -1:",
"+ h2 = set_height(binary_tree[id][\"right\"]) + 1",
"+ H[id] = max(h1, h2)",
"+ return H[id]",
"- depth = measure_depth_and_height(id, 0)",
"- D[id] = depth",
"+ if binary_tree[id][\"parent\"] == -1:",
"+ set_depth(id, 0)",
"+ set_height(id)",
"-def get_type(node):",
"+def get_sibling(id):",
"+ parent_id = node[\"parent\"]",
"+ if parent_id == -1:",
"+ return -1",
"+ if binary_tree[parent_id][\"left\"] != id:",
"+ return binary_tree[parent_id][\"left\"]",
"+ else:",
"+ return binary_tree[parent_id][\"right\"]",
"+",
"+",
"+def get_degree(node):",
"+ degree = 0",
"+ if node[\"left\"] != -1:",
"+ degree += 1",
"+ if node[\"right\"] != -1:",
"+ degree += 1",
"+ return degree",
"+",
"+",
"+def get_type(node, dgree):",
"- if node[\"degree\"] == 0:",
"+ if degree == 0:",
"- if node[\"parent\"] == -1:",
"- return \"root\"",
"- sibling_id = node[\"sibling\"]",
"- degree = node[\"degree\"]",
"- node_type = get_type(node)",
"+ sibling_id = get_sibling(id)",
"+ degree = get_degree(node)",
"+ node_type = get_type(node, degree)"
]
| false | 0.080314 | 0.040208 | 1.997453 | [
"s169034038",
"s878136747"
]
|
u345966487 | p03014 | python | s762247596 | s037891851 | 981 | 695 | 155,864 | 96,472 | Accepted | Accepted | 29.15 | H,W = list(map(int, input().split()))
grid = []
for i in range(H):
grid.append(eval(input()))
horiz = [[None]*W for _ in range(H)]
horiv = [[] for _ in range(H)]
for i in range(H):
cur = 0
for j in range(W):
if grid[i][j] == '.':
horiz[i][j] = len(horiv[i])
else:
horiv[i].append(j - cur)
cur = j + 1
horiv[i].append(W-cur)
maxv = 0
for c in range(W):
cur = 0
besth = 0
for r in range(H):
if grid[r][c] == '.':
besth = max(besth, horiv[r][horiz[r][c]])
else:
maxv = max(maxv, r-cur + besth - 1)
cur = r+1
besth = 0
maxv = max(maxv, H-cur + besth - 1)
print(maxv) | H,W = list(map(int, input().split()))
grid = []
for i in range(H):
grid.append(eval(input()))
horiz = [[0]*W for _ in range(H)]
for i in range(H):
cur = 0
for j in range(W):
if grid[i][j] == '#':
for k in range(cur, j):
horiz[i][k] = j-cur
cur = j+1
for k in range(cur, W):
horiz[i][k] = W-cur
maxv = 0
for c in range(W):
cur = 0
besth = 0
for r in range(H):
if grid[r][c] == '.':
besth = max(besth, horiz[r][c])
else:
maxv = max(maxv, r-cur + besth - 1)
cur = r+1
besth = 0
maxv = max(maxv, H-cur + besth - 1)
print(maxv) | 30 | 29 | 729 | 692 | H, W = list(map(int, input().split()))
grid = []
for i in range(H):
grid.append(eval(input()))
horiz = [[None] * W for _ in range(H)]
horiv = [[] for _ in range(H)]
for i in range(H):
cur = 0
for j in range(W):
if grid[i][j] == ".":
horiz[i][j] = len(horiv[i])
else:
horiv[i].append(j - cur)
cur = j + 1
horiv[i].append(W - cur)
maxv = 0
for c in range(W):
cur = 0
besth = 0
for r in range(H):
if grid[r][c] == ".":
besth = max(besth, horiv[r][horiz[r][c]])
else:
maxv = max(maxv, r - cur + besth - 1)
cur = r + 1
besth = 0
maxv = max(maxv, H - cur + besth - 1)
print(maxv)
| H, W = list(map(int, input().split()))
grid = []
for i in range(H):
grid.append(eval(input()))
horiz = [[0] * W for _ in range(H)]
for i in range(H):
cur = 0
for j in range(W):
if grid[i][j] == "#":
for k in range(cur, j):
horiz[i][k] = j - cur
cur = j + 1
for k in range(cur, W):
horiz[i][k] = W - cur
maxv = 0
for c in range(W):
cur = 0
besth = 0
for r in range(H):
if grid[r][c] == ".":
besth = max(besth, horiz[r][c])
else:
maxv = max(maxv, r - cur + besth - 1)
cur = r + 1
besth = 0
maxv = max(maxv, H - cur + besth - 1)
print(maxv)
| false | 3.333333 | [
"-horiz = [[None] * W for _ in range(H)]",
"-horiv = [[] for _ in range(H)]",
"+horiz = [[0] * W for _ in range(H)]",
"- if grid[i][j] == \".\":",
"- horiz[i][j] = len(horiv[i])",
"- else:",
"- horiv[i].append(j - cur)",
"+ if grid[i][j] == \"#\":",
"+ for k in range(cur, j):",
"+ horiz[i][k] = j - cur",
"- horiv[i].append(W - cur)",
"+ for k in range(cur, W):",
"+ horiz[i][k] = W - cur",
"- besth = max(besth, horiv[r][horiz[r][c]])",
"+ besth = max(besth, horiz[r][c])"
]
| false | 0.036451 | 0.037654 | 0.968063 | [
"s762247596",
"s037891851"
]
|
u844813573 | p04045 | python | s905553981 | s331204546 | 192 | 67 | 2,940 | 9,100 | Accepted | Accepted | 65.1 | line1 = eval(input())
line2 = eval(input())
price, k = line1.split(" ")
num = line2.split(" ")
ans = ""
for i in range(int(price),100000):
num2 = [str(x) for x in str(i)]
# print(len(set(num)&set(num2)))
if len(set(num)&set(num2))==0:
print(i)
break
| n, k = list(map(int, input().split()))
d = set(input().split())
while True:
if not set(str(n)) & d:
print(n)
break
else:
n += 1
| 13 | 9 | 287 | 170 | line1 = eval(input())
line2 = eval(input())
price, k = line1.split(" ")
num = line2.split(" ")
ans = ""
for i in range(int(price), 100000):
num2 = [str(x) for x in str(i)]
# print(len(set(num)&set(num2)))
if len(set(num) & set(num2)) == 0:
print(i)
break
| n, k = list(map(int, input().split()))
d = set(input().split())
while True:
if not set(str(n)) & d:
print(n)
break
else:
n += 1
| false | 30.769231 | [
"-line1 = eval(input())",
"-line2 = eval(input())",
"-price, k = line1.split(\" \")",
"-num = line2.split(\" \")",
"-ans = \"\"",
"-for i in range(int(price), 100000):",
"- num2 = [str(x) for x in str(i)]",
"- # print(len(set(num)&set(num2)))",
"- if len(set(num) & set(num2)) == 0:",
"- print(i)",
"+n, k = list(map(int, input().split()))",
"+d = set(input().split())",
"+while True:",
"+ if not set(str(n)) & d:",
"+ print(n)",
"+ else:",
"+ n += 1"
]
| false | 0.042345 | 0.044944 | 0.942181 | [
"s905553981",
"s331204546"
]
|
u970197315 | p03147 | python | s688218473 | s375433637 | 153 | 22 | 12,392 | 3,060 | Accepted | Accepted | 85.62 | # ABC116 C - Grand Garden
import numpy as np
n = int(eval(input()))
h = list(map(int,input().split()))
l = [9]*n
t = 0
x = 0
if n == 1:
print((h[0]))
exit()
while max(h) > 0:
if x != 0:
for i in range(n):
h[i] -= 1
for i in range(n):
if h[i] > 0:
l[i] = 1
else:
l[i] = 0
for i in range(n-1):
if i == 0 and l[0] == 1:
t += 1
if l[i+1]-l[i] == 1:
t += 1
x += 1
print(t) | n=int(eval(input()))
h=list(map(int,input().split()))
from itertools import groupby
ans=0
for i in range(101):
c=[0]*n
for j in range(n):
if h[j]>0:c[j]=1
gr=groupby(c)
for k,v in gr:
if k>0:ans+=1
for j in range(n):
if h[j]>0:h[j]-=1
print(ans)
| 30 | 16 | 516 | 279 | # ABC116 C - Grand Garden
import numpy as np
n = int(eval(input()))
h = list(map(int, input().split()))
l = [9] * n
t = 0
x = 0
if n == 1:
print((h[0]))
exit()
while max(h) > 0:
if x != 0:
for i in range(n):
h[i] -= 1
for i in range(n):
if h[i] > 0:
l[i] = 1
else:
l[i] = 0
for i in range(n - 1):
if i == 0 and l[0] == 1:
t += 1
if l[i + 1] - l[i] == 1:
t += 1
x += 1
print(t)
| n = int(eval(input()))
h = list(map(int, input().split()))
from itertools import groupby
ans = 0
for i in range(101):
c = [0] * n
for j in range(n):
if h[j] > 0:
c[j] = 1
gr = groupby(c)
for k, v in gr:
if k > 0:
ans += 1
for j in range(n):
if h[j] > 0:
h[j] -= 1
print(ans)
| false | 46.666667 | [
"-# ABC116 C - Grand Garden",
"-import numpy as np",
"-",
"-l = [9] * n",
"-t = 0",
"-x = 0",
"-if n == 1:",
"- print((h[0]))",
"- exit()",
"-while max(h) > 0:",
"- if x != 0:",
"- for i in range(n):",
"- h[i] -= 1",
"- for i in range(n):",
"- if h[i] > 0:",
"- l[i] = 1",
"- else:",
"- l[i] = 0",
"- for i in range(n - 1):",
"- if i == 0 and l[0] == 1:",
"- t += 1",
"- if l[i + 1] - l[i] == 1:",
"- t += 1",
"- x += 1",
"-print(t)",
"+from itertools import groupby",
"+",
"+ans = 0",
"+for i in range(101):",
"+ c = [0] * n",
"+ for j in range(n):",
"+ if h[j] > 0:",
"+ c[j] = 1",
"+ gr = groupby(c)",
"+ for k, v in gr:",
"+ if k > 0:",
"+ ans += 1",
"+ for j in range(n):",
"+ if h[j] > 0:",
"+ h[j] -= 1",
"+print(ans)"
]
| false | 0.038605 | 0.041815 | 0.92325 | [
"s688218473",
"s375433637"
]
|
u298297089 | p04031 | python | s569250288 | s836977922 | 26 | 24 | 3,060 | 2,940 | Accepted | Accepted | 7.69 | N = int(eval(input()))
A = list(map(int, input().split()))
mn = 10**9
for j in range(min(A), max(A)+1):
cost = 0
for i in range(N):
cost += (A[i]-j)**2
mn = min(cost, mn)
print(mn) | n = int(eval(input()))
a = list(map(int, input().split()))
ans = float('INF')
for i in range(min(a), max(a)+1):
cost = 0
for aa in a:
cost += (i - aa)**2
if cost < ans :
ans = cost
print(ans)
| 10 | 11 | 194 | 225 | N = int(eval(input()))
A = list(map(int, input().split()))
mn = 10**9
for j in range(min(A), max(A) + 1):
cost = 0
for i in range(N):
cost += (A[i] - j) ** 2
mn = min(cost, mn)
print(mn)
| n = int(eval(input()))
a = list(map(int, input().split()))
ans = float("INF")
for i in range(min(a), max(a) + 1):
cost = 0
for aa in a:
cost += (i - aa) ** 2
if cost < ans:
ans = cost
print(ans)
| false | 9.090909 | [
"-N = int(eval(input()))",
"-A = list(map(int, input().split()))",
"-mn = 10**9",
"-for j in range(min(A), max(A) + 1):",
"+n = int(eval(input()))",
"+a = list(map(int, input().split()))",
"+ans = float(\"INF\")",
"+for i in range(min(a), max(a) + 1):",
"- for i in range(N):",
"- cost += (A[i] - j) ** 2",
"- mn = min(cost, mn)",
"-print(mn)",
"+ for aa in a:",
"+ cost += (i - aa) ** 2",
"+ if cost < ans:",
"+ ans = cost",
"+print(ans)"
]
| false | 0.036111 | 0.040263 | 0.896884 | [
"s569250288",
"s836977922"
]
|
u935984175 | p03645 | python | s457366774 | s773377727 | 531 | 431 | 99,788 | 98,764 | Accepted | Accepted | 18.83 | import sys
rl = sys.stdin.readline
def solve():
N, M = list(map(int, rl().split()))
graph = [set() for _ in range(N)]
for _ in range(M):
a, b = [int(x) - 1 for x in rl().split()]
graph[a].add(b)
graph[b].add(a)
for child in graph[0]:
if N - 1 in graph[child]:
print('POSSIBLE')
exit()
print('IMPOSSIBLE')
if __name__ == '__main__':
solve()
| import sys
rl = sys.stdin.buffer.readline
def solve():
N, M = list(map(int, rl().split()))
graph = [set() for _ in range(N)]
for _ in range(M):
a, b = [int(x) - 1 for x in rl().split()]
graph[a].add(b)
graph[b].add(a)
for child in graph[0]:
if N - 1 in graph[child]:
print('POSSIBLE')
exit()
print('IMPOSSIBLE')
if __name__ == '__main__':
solve()
| 21 | 21 | 448 | 455 | import sys
rl = sys.stdin.readline
def solve():
N, M = list(map(int, rl().split()))
graph = [set() for _ in range(N)]
for _ in range(M):
a, b = [int(x) - 1 for x in rl().split()]
graph[a].add(b)
graph[b].add(a)
for child in graph[0]:
if N - 1 in graph[child]:
print("POSSIBLE")
exit()
print("IMPOSSIBLE")
if __name__ == "__main__":
solve()
| import sys
rl = sys.stdin.buffer.readline
def solve():
N, M = list(map(int, rl().split()))
graph = [set() for _ in range(N)]
for _ in range(M):
a, b = [int(x) - 1 for x in rl().split()]
graph[a].add(b)
graph[b].add(a)
for child in graph[0]:
if N - 1 in graph[child]:
print("POSSIBLE")
exit()
print("IMPOSSIBLE")
if __name__ == "__main__":
solve()
| false | 0 | [
"-rl = sys.stdin.readline",
"+rl = sys.stdin.buffer.readline"
]
| false | 0.044481 | 0.046144 | 0.963974 | [
"s457366774",
"s773377727"
]
|
u332385682 | p04013 | python | s117113982 | s312546045 | 1,230 | 814 | 62,960 | 62,960 | Accepted | Accepted | 33.82 | N, A = list(map(int, input().split()))
x = [int(i) for i in input().split()]
# 3d DP
max_x = max(x)
dp = [[[0] * (max_x * N + 1) for j in range(N + 1)]
for i in range(N + 1)]
dp[0][0][0] = 1
for i in range(0, N):
for k in range(0, N + 1):
for y in range(max_x * N + 1):
if dp[i][k][y]:
dp[i + 1][k][y] += dp[i][k][y]
dp[i + 1][k + 1][y + x[i]] += dp[i][k][y]
cnt = 0
for k in range(1, N + 1):
for y in range(1, max_x * N + 1):
if y // k == A and y % k == 0:
cnt += dp[N][k][y]
print(cnt) | def solve():
N, A = list(map(int, input().split()))
x = [int(i) for i in input().split()]
# 3d DP
max_x = max(x)
dp = [[[0] * (max_x * N + 1) for j in range(N + 1)]
for i in range(N + 1)]
dp[0][0][0] = 1
for i in range(0, N):
for k in range(0, N + 1):
for y in range(max_x * N + 1):
if dp[i][k][y]:
dp[i + 1][k][y] += dp[i][k][y]
dp[i + 1][k + 1][y + x[i]] += dp[i][k][y]
cnt = 0
for k in range(1, N + 1):
for y in range(1, max_x * N + 1):
if y // k == A and y % k == 0:
cnt += dp[N][k][y]
print(cnt)
if __name__ == '__main__':
solve() | 25 | 29 | 624 | 779 | N, A = list(map(int, input().split()))
x = [int(i) for i in input().split()]
# 3d DP
max_x = max(x)
dp = [[[0] * (max_x * N + 1) for j in range(N + 1)] for i in range(N + 1)]
dp[0][0][0] = 1
for i in range(0, N):
for k in range(0, N + 1):
for y in range(max_x * N + 1):
if dp[i][k][y]:
dp[i + 1][k][y] += dp[i][k][y]
dp[i + 1][k + 1][y + x[i]] += dp[i][k][y]
cnt = 0
for k in range(1, N + 1):
for y in range(1, max_x * N + 1):
if y // k == A and y % k == 0:
cnt += dp[N][k][y]
print(cnt)
| def solve():
N, A = list(map(int, input().split()))
x = [int(i) for i in input().split()]
# 3d DP
max_x = max(x)
dp = [[[0] * (max_x * N + 1) for j in range(N + 1)] for i in range(N + 1)]
dp[0][0][0] = 1
for i in range(0, N):
for k in range(0, N + 1):
for y in range(max_x * N + 1):
if dp[i][k][y]:
dp[i + 1][k][y] += dp[i][k][y]
dp[i + 1][k + 1][y + x[i]] += dp[i][k][y]
cnt = 0
for k in range(1, N + 1):
for y in range(1, max_x * N + 1):
if y // k == A and y % k == 0:
cnt += dp[N][k][y]
print(cnt)
if __name__ == "__main__":
solve()
| false | 13.793103 | [
"-N, A = list(map(int, input().split()))",
"-x = [int(i) for i in input().split()]",
"-# 3d DP",
"-max_x = max(x)",
"-dp = [[[0] * (max_x * N + 1) for j in range(N + 1)] for i in range(N + 1)]",
"-dp[0][0][0] = 1",
"-for i in range(0, N):",
"- for k in range(0, N + 1):",
"- for y in range(max_x * N + 1):",
"- if dp[i][k][y]:",
"- dp[i + 1][k][y] += dp[i][k][y]",
"- dp[i + 1][k + 1][y + x[i]] += dp[i][k][y]",
"-cnt = 0",
"-for k in range(1, N + 1):",
"- for y in range(1, max_x * N + 1):",
"- if y // k == A and y % k == 0:",
"- cnt += dp[N][k][y]",
"-print(cnt)",
"+def solve():",
"+ N, A = list(map(int, input().split()))",
"+ x = [int(i) for i in input().split()]",
"+ # 3d DP",
"+ max_x = max(x)",
"+ dp = [[[0] * (max_x * N + 1) for j in range(N + 1)] for i in range(N + 1)]",
"+ dp[0][0][0] = 1",
"+ for i in range(0, N):",
"+ for k in range(0, N + 1):",
"+ for y in range(max_x * N + 1):",
"+ if dp[i][k][y]:",
"+ dp[i + 1][k][y] += dp[i][k][y]",
"+ dp[i + 1][k + 1][y + x[i]] += dp[i][k][y]",
"+ cnt = 0",
"+ for k in range(1, N + 1):",
"+ for y in range(1, max_x * N + 1):",
"+ if y // k == A and y % k == 0:",
"+ cnt += dp[N][k][y]",
"+ print(cnt)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ solve()"
]
| false | 0.063597 | 0.048604 | 1.30848 | [
"s117113982",
"s312546045"
]
|
u077291787 | p04015 | python | s067865628 | s204814999 | 786 | 23 | 62,960 | 3,188 | Accepted | Accepted | 97.07 | # ABC044C - 高橋君とカード / Tak and Cards (ARC060C)
def main():
N, A = tuple(map(int, input().split()))
X = tuple(map(int, input().split()))
# dp[i][j][k] := patterns to make k with j cards from X1, X2, ..., Xi
dp = [[[0] * (N * 50 + 1) for _ in range(N + 1)] for _ in range(N + 1)]
dp[0][0][0] = 1
for i in range(N):
for j in range(N):
for k in range(N * 50 + 1):
if dp[i][j][k]:
dp[i + 1][j][k] += dp[i][j][k]
dp[i + 1][j + 1][k + X[i]] += dp[i][j][k]
ans = sum(dp[N][i][i * A] for i in range(1, N + 1))
print(ans)
if __name__ == "__main__":
main() | # ABC044C - 高橋君とカード / Tak and Cards (ARC060C)
def main():
N, A = tuple(map(int, input().split()))
X = tuple([int(x) - A for x in input().split()])
D = {0: 1}
for i in X:
for j, k in list(D.items()):
D[i + j] = D.get(i + j, 0) + k
ans = D[0] - 1
print(ans)
if __name__ == "__main__":
main() | 19 | 14 | 676 | 357 | # ABC044C - 高橋君とカード / Tak and Cards (ARC060C)
def main():
N, A = tuple(map(int, input().split()))
X = tuple(map(int, input().split()))
# dp[i][j][k] := patterns to make k with j cards from X1, X2, ..., Xi
dp = [[[0] * (N * 50 + 1) for _ in range(N + 1)] for _ in range(N + 1)]
dp[0][0][0] = 1
for i in range(N):
for j in range(N):
for k in range(N * 50 + 1):
if dp[i][j][k]:
dp[i + 1][j][k] += dp[i][j][k]
dp[i + 1][j + 1][k + X[i]] += dp[i][j][k]
ans = sum(dp[N][i][i * A] for i in range(1, N + 1))
print(ans)
if __name__ == "__main__":
main()
| # ABC044C - 高橋君とカード / Tak and Cards (ARC060C)
def main():
N, A = tuple(map(int, input().split()))
X = tuple([int(x) - A for x in input().split()])
D = {0: 1}
for i in X:
for j, k in list(D.items()):
D[i + j] = D.get(i + j, 0) + k
ans = D[0] - 1
print(ans)
if __name__ == "__main__":
main()
| false | 26.315789 | [
"- X = tuple(map(int, input().split()))",
"- # dp[i][j][k] := patterns to make k with j cards from X1, X2, ..., Xi",
"- dp = [[[0] * (N * 50 + 1) for _ in range(N + 1)] for _ in range(N + 1)]",
"- dp[0][0][0] = 1",
"- for i in range(N):",
"- for j in range(N):",
"- for k in range(N * 50 + 1):",
"- if dp[i][j][k]:",
"- dp[i + 1][j][k] += dp[i][j][k]",
"- dp[i + 1][j + 1][k + X[i]] += dp[i][j][k]",
"- ans = sum(dp[N][i][i * A] for i in range(1, N + 1))",
"+ X = tuple([int(x) - A for x in input().split()])",
"+ D = {0: 1}",
"+ for i in X:",
"+ for j, k in list(D.items()):",
"+ D[i + j] = D.get(i + j, 0) + k",
"+ ans = D[0] - 1"
]
| false | 0.235525 | 0.036874 | 6.38726 | [
"s067865628",
"s204814999"
]
|
u867069435 | p03455 | python | s031807720 | s512939338 | 19 | 17 | 3,316 | 2,940 | Accepted | Accepted | 10.53 | a, b = list(map(int, input().split()))
if (a*b) % 2 == 0:
print("Even")
else:
print("Odd") | a, b = list(map(int, input().split()))
if (a*b) % 2:
print("Odd")
else:
print("Even") | 5 | 5 | 96 | 91 | a, b = list(map(int, input().split()))
if (a * b) % 2 == 0:
print("Even")
else:
print("Odd")
| a, b = list(map(int, input().split()))
if (a * b) % 2:
print("Odd")
else:
print("Even")
| false | 0 | [
"-if (a * b) % 2 == 0:",
"+if (a * b) % 2:",
"+ print(\"Odd\")",
"+else:",
"-else:",
"- print(\"Odd\")"
]
| false | 0.050904 | 0.043067 | 1.18198 | [
"s031807720",
"s512939338"
]
|
u373274281 | p03231 | python | s830531302 | s390299613 | 65 | 56 | 5,432 | 5,344 | Accepted | Accepted | 13.85 | import sys
import fractions
N, M = list(map(int, input().split()))
S = eval(input())
T = eval(input())
g = fractions.gcd(N, M)
L = N * M // g
ss = L // N
ts = L // M
for i in range(N):
if (i * ss) % ts == 0:
j = (i * ss) // ts
if S[i] != T[j]:
print((-1))
sys.exit()
for i in range(M):
if (i * ts) % ss == 0:
j = (i * ts) // ss
if T[i] != S[j]:
print((-1))
sys.exit()
print(L) | import sys
import fractions
N, M = list(map(int, input().split()))
S = eval(input())
T = eval(input())
g = fractions.gcd(N, M)
L = N * M // g
def check(U1, U2):
s1 = L // len(U1)
s2 = L // len(U2)
for i in range(len(U1)):
if (i * s1) % s2 == 0:
j = (i * s1) // s2
if U1[i] != U2[j]:
return False
return True
if check(S, T) and check(T, S):
print(L)
else:
print((-1)) | 26 | 23 | 427 | 407 | import sys
import fractions
N, M = list(map(int, input().split()))
S = eval(input())
T = eval(input())
g = fractions.gcd(N, M)
L = N * M // g
ss = L // N
ts = L // M
for i in range(N):
if (i * ss) % ts == 0:
j = (i * ss) // ts
if S[i] != T[j]:
print((-1))
sys.exit()
for i in range(M):
if (i * ts) % ss == 0:
j = (i * ts) // ss
if T[i] != S[j]:
print((-1))
sys.exit()
print(L)
| import sys
import fractions
N, M = list(map(int, input().split()))
S = eval(input())
T = eval(input())
g = fractions.gcd(N, M)
L = N * M // g
def check(U1, U2):
s1 = L // len(U1)
s2 = L // len(U2)
for i in range(len(U1)):
if (i * s1) % s2 == 0:
j = (i * s1) // s2
if U1[i] != U2[j]:
return False
return True
if check(S, T) and check(T, S):
print(L)
else:
print((-1))
| false | 11.538462 | [
"-ss = L // N",
"-ts = L // M",
"-for i in range(N):",
"- if (i * ss) % ts == 0:",
"- j = (i * ss) // ts",
"- if S[i] != T[j]:",
"- print((-1))",
"- sys.exit()",
"-for i in range(M):",
"- if (i * ts) % ss == 0:",
"- j = (i * ts) // ss",
"- if T[i] != S[j]:",
"- print((-1))",
"- sys.exit()",
"-print(L)",
"+",
"+",
"+def check(U1, U2):",
"+ s1 = L // len(U1)",
"+ s2 = L // len(U2)",
"+ for i in range(len(U1)):",
"+ if (i * s1) % s2 == 0:",
"+ j = (i * s1) // s2",
"+ if U1[i] != U2[j]:",
"+ return False",
"+ return True",
"+",
"+",
"+if check(S, T) and check(T, S):",
"+ print(L)",
"+else:",
"+ print((-1))"
]
| false | 0.111041 | 0.117921 | 0.941655 | [
"s830531302",
"s390299613"
]
|
u994521204 | p03207 | python | s568109493 | s257335440 | 20 | 17 | 2,940 | 2,940 | Accepted | Accepted | 15 | N=int(eval(input()))
P=[int(eval(input())) for i in range(N)]
print((round(sum(P)-1/2*max(P)))) | n=int(eval(input()))
A=[int(eval(input())) for i in range(n)]
print((sum(A)-max(A)//2)) | 3 | 3 | 83 | 75 | N = int(eval(input()))
P = [int(eval(input())) for i in range(N)]
print((round(sum(P) - 1 / 2 * max(P))))
| n = int(eval(input()))
A = [int(eval(input())) for i in range(n)]
print((sum(A) - max(A) // 2))
| false | 0 | [
"-N = int(eval(input()))",
"-P = [int(eval(input())) for i in range(N)]",
"-print((round(sum(P) - 1 / 2 * max(P))))",
"+n = int(eval(input()))",
"+A = [int(eval(input())) for i in range(n)]",
"+print((sum(A) - max(A) // 2))"
]
| false | 0.050184 | 0.050857 | 0.986759 | [
"s568109493",
"s257335440"
]
|
u357120030 | p02553 | python | s148350876 | s729114630 | 33 | 27 | 9,152 | 9,068 | Accepted | Accepted | 18.18 | def ri():
return int(eval(input()))
def rii():
return [int(v) for v in input().split()]
a, b, c, d = rii()
m = max(a * c, a * d, b * c, b * d)
print(m)
| def ri():
return int(eval(input()))
def rii():
return [int(v) for v in input().split()]
def solve(*args):
a, b, c, d = args
return max(a * c, a * d, b * c, b * d)
if __name__ == "__main__":
print((solve(*rii()))) | 11 | 15 | 168 | 244 | def ri():
return int(eval(input()))
def rii():
return [int(v) for v in input().split()]
a, b, c, d = rii()
m = max(a * c, a * d, b * c, b * d)
print(m)
| def ri():
return int(eval(input()))
def rii():
return [int(v) for v in input().split()]
def solve(*args):
a, b, c, d = args
return max(a * c, a * d, b * c, b * d)
if __name__ == "__main__":
print((solve(*rii())))
| false | 26.666667 | [
"-a, b, c, d = rii()",
"-m = max(a * c, a * d, b * c, b * d)",
"-print(m)",
"+def solve(*args):",
"+ a, b, c, d = args",
"+ return max(a * c, a * d, b * c, b * d)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ print((solve(*rii())))"
]
| false | 0.048369 | 0.049256 | 0.982 | [
"s148350876",
"s729114630"
]
|
u645250356 | p03212 | python | s914546661 | s498961431 | 267 | 61 | 45,156 | 6,236 | Accepted | Accepted | 77.15 | from collections import Counter,defaultdict,deque
from heapq import heapify,heappop,heappush
from bisect import bisect_left,bisect_right
import sys,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))
n = inp()
res = 0
def f(x):
global res
if x <= n:
l = len(str(x))
f(3*10**l+x)
f(5*10**l+x)
f(7*10**l+x)
if '3' in str(x) and '5' in str(x) and '7' in str(x):
res += 1
f(3)
f(5)
f(7)
print(res) | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))
n = inp()
s = []
for i in range(10):
for p in itertools.product(['3','5','7'],repeat=i):
if '3' in p and '5' in p and '7' in p:
s.append(int(''.join(p)))
res = 0
for i,t in enumerate(s):
if t <= n:
res += 1
print(res) | 26 | 21 | 735 | 658 | from collections import Counter, defaultdict, deque
from heapq import heapify, heappop, heappush
from bisect import bisect_left, bisect_right
import sys, math, itertools, string, queue
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
def inp():
return int(sys.stdin.readline())
def inpl():
return list(map(int, sys.stdin.readline().split()))
def inpl_str():
return list(sys.stdin.readline().split())
def inpln(n):
return list(int(sys.stdin.readline()) for i in range(n))
n = inp()
res = 0
def f(x):
global res
if x <= n:
l = len(str(x))
f(3 * 10**l + x)
f(5 * 10**l + x)
f(7 * 10**l + x)
if "3" in str(x) and "5" in str(x) and "7" in str(x):
res += 1
f(3)
f(5)
f(7)
print(res)
| from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
import sys, bisect, math, itertools, fractions, pprint
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
INF = float("inf")
def inp():
return int(sys.stdin.readline())
def inpl():
return list(map(int, sys.stdin.readline().split()))
def inpln(n):
return list(int(sys.stdin.readline()) for i in range(n))
n = inp()
s = []
for i in range(10):
for p in itertools.product(["3", "5", "7"], repeat=i):
if "3" in p and "5" in p and "7" in p:
s.append(int("".join(p)))
res = 0
for i, t in enumerate(s):
if t <= n:
res += 1
print(res)
| false | 19.230769 | [
"-from heapq import heapify, heappop, heappush",
"-from bisect import bisect_left, bisect_right",
"-import sys, math, itertools, string, queue",
"+from heapq import heappop, heappush, heapify",
"+import sys, bisect, math, itertools, fractions, pprint",
"+INF = float(\"inf\")",
"-def inpl_str():",
"- return list(sys.stdin.readline().split())",
"-",
"-",
"+s = []",
"+for i in range(10):",
"+ for p in itertools.product([\"3\", \"5\", \"7\"], repeat=i):",
"+ if \"3\" in p and \"5\" in p and \"7\" in p:",
"+ s.append(int(\"\".join(p)))",
"-",
"-",
"-def f(x):",
"- global res",
"- if x <= n:",
"- l = len(str(x))",
"- f(3 * 10**l + x)",
"- f(5 * 10**l + x)",
"- f(7 * 10**l + x)",
"- if \"3\" in str(x) and \"5\" in str(x) and \"7\" in str(x):",
"- res += 1",
"-",
"-",
"-f(3)",
"-f(5)",
"-f(7)",
"+for i, t in enumerate(s):",
"+ if t <= n:",
"+ res += 1"
]
| false | 0.051582 | 0.089212 | 0.57819 | [
"s914546661",
"s498961431"
]
|
u608088992 | p03200 | python | s834980075 | s614824175 | 64 | 45 | 3,500 | 3,500 | Accepted | Accepted | 29.69 | S = eval(input())
sumW = 0
total = 0
for i in reversed(list(range(len(S)))):
if S[i] == "W":
sumW += 1
elif S[i] == "B":
total += sumW
print(total)
| import sys
def solve():
S = eval(input())
count = 0
leftMostW = 0
for i in range(len(S)):
if S[i] == "W":
count += i - leftMostW
leftMostW += 1
print(count)
return 0
if __name__ == "__main__":
solve() | 9 | 16 | 168 | 272 | S = eval(input())
sumW = 0
total = 0
for i in reversed(list(range(len(S)))):
if S[i] == "W":
sumW += 1
elif S[i] == "B":
total += sumW
print(total)
| import sys
def solve():
S = eval(input())
count = 0
leftMostW = 0
for i in range(len(S)):
if S[i] == "W":
count += i - leftMostW
leftMostW += 1
print(count)
return 0
if __name__ == "__main__":
solve()
| false | 43.75 | [
"-S = eval(input())",
"-sumW = 0",
"-total = 0",
"-for i in reversed(list(range(len(S)))):",
"- if S[i] == \"W\":",
"- sumW += 1",
"- elif S[i] == \"B\":",
"- total += sumW",
"-print(total)",
"+import sys",
"+",
"+",
"+def solve():",
"+ S = eval(input())",
"+ count = 0",
"+ leftMostW = 0",
"+ for i in range(len(S)):",
"+ if S[i] == \"W\":",
"+ count += i - leftMostW",
"+ leftMostW += 1",
"+ print(count)",
"+ return 0",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ solve()"
]
| false | 0.043496 | 0.043503 | 0.999833 | [
"s834980075",
"s614824175"
]
|
u827885761 | p03611 | python | s161676704 | s356002487 | 105 | 86 | 30,016 | 13,964 | Accepted | Accepted | 18.1 | import collections
n = int(eval(input()))
A = [int(i) for i in input().split()]
B = [i+1 for i in A]
C = [i-1 for i in A]
print((collections.Counter(A+B+C).most_common(1)[0][1]))
| n = int(eval(input()))
a = list(map(int, input().split()))
f = [0 for i in range(10**5 + 10)]
for i in a:
f[i] += 1
f[i + 1] += 1
f[i - 1] += 1
print((max(f)))
| 8 | 9 | 180 | 173 | import collections
n = int(eval(input()))
A = [int(i) for i in input().split()]
B = [i + 1 for i in A]
C = [i - 1 for i in A]
print((collections.Counter(A + B + C).most_common(1)[0][1]))
| n = int(eval(input()))
a = list(map(int, input().split()))
f = [0 for i in range(10**5 + 10)]
for i in a:
f[i] += 1
f[i + 1] += 1
f[i - 1] += 1
print((max(f)))
| false | 11.111111 | [
"-import collections",
"-",
"-A = [int(i) for i in input().split()]",
"-B = [i + 1 for i in A]",
"-C = [i - 1 for i in A]",
"-print((collections.Counter(A + B + C).most_common(1)[0][1]))",
"+a = list(map(int, input().split()))",
"+f = [0 for i in range(10**5 + 10)]",
"+for i in a:",
"+ f[i] += 1",
"+ f[i + 1] += 1",
"+ f[i - 1] += 1",
"+print((max(f)))"
]
| false | 0.039603 | 0.050544 | 0.783535 | [
"s161676704",
"s356002487"
]
|
u970197315 | p02936 | python | s184065856 | s196469882 | 1,729 | 1,230 | 56,160 | 56,756 | Accepted | Accepted | 28.86 | n,q=list(map(int,input().split()))
G=[[] for i in range(n)]
for i in range(n-1):
a,b=list(map(int,input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
c=[0]*n
for i in range(q):
p,x=list(map(int,input().split()))
c[p-1]+=x
from collections import deque
visited=[-1]*n
q=deque()
q.append(0)
while q:
cur=q.popleft()
visited[cur]=0
for nx in G[cur]:
if visited[nx]!=-1:continue
c[nx]+=c[cur]
q.append(nx)
print((*c))
| N,Q = list(map(int,input().split()))
G = [[] for _ in range(N)]
for i in range(N-1):
a,b = list(map(int,input().split()))
G[a-1].append(b-1)
G[b-1].append(a-1)
counter = [0]*N
for i in range(Q):
p,x = list(map(int,input().split()))
counter[p-1] += x
from collections import deque
visited = [-1]*N
q = deque()
q.append(0)
while q:
cur = q.popleft()
visited[cur] = 0
for nx in G[cur]:
if visited[nx] != -1: continue
counter[nx] += counter[cur]
q.append(nx)
print((*counter))
| 22 | 31 | 447 | 548 | n, q = list(map(int, input().split()))
G = [[] for i in range(n)]
for i in range(n - 1):
a, b = list(map(int, input().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
c = [0] * n
for i in range(q):
p, x = list(map(int, input().split()))
c[p - 1] += x
from collections import deque
visited = [-1] * n
q = deque()
q.append(0)
while q:
cur = q.popleft()
visited[cur] = 0
for nx in G[cur]:
if visited[nx] != -1:
continue
c[nx] += c[cur]
q.append(nx)
print((*c))
| N, Q = list(map(int, input().split()))
G = [[] for _ in range(N)]
for i in range(N - 1):
a, b = list(map(int, input().split()))
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
counter = [0] * N
for i in range(Q):
p, x = list(map(int, input().split()))
counter[p - 1] += x
from collections import deque
visited = [-1] * N
q = deque()
q.append(0)
while q:
cur = q.popleft()
visited[cur] = 0
for nx in G[cur]:
if visited[nx] != -1:
continue
counter[nx] += counter[cur]
q.append(nx)
print((*counter))
| false | 29.032258 | [
"-n, q = list(map(int, input().split()))",
"-G = [[] for i in range(n)]",
"-for i in range(n - 1):",
"+N, Q = list(map(int, input().split()))",
"+G = [[] for _ in range(N)]",
"+for i in range(N - 1):",
"-c = [0] * n",
"-for i in range(q):",
"+counter = [0] * N",
"+for i in range(Q):",
"- c[p - 1] += x",
"+ counter[p - 1] += x",
"-visited = [-1] * n",
"+visited = [-1] * N",
"- c[nx] += c[cur]",
"+ counter[nx] += counter[cur]",
"-print((*c))",
"+print((*counter))"
]
| false | 0.037466 | 0.039304 | 0.953228 | [
"s184065856",
"s196469882"
]
|
u979362546 | p03478 | python | s234624858 | s070367969 | 36 | 32 | 3,424 | 2,940 | Accepted | Accepted | 11.11 | n, a, b = list(map(int, input().split()))
data = []
for i in range(1, n+1):
if a<= sum(list(map(int, list(str(i)))) )<=b:
data.append(i)
print((sum(data))) | n, a, b = list(map(int, input().split()))
ans = 0
for i in range(1, n+1):
if a<=sum([int(s) for s in str(i)])<=b:
ans += i
print(ans) | 6 | 6 | 164 | 141 | n, a, b = list(map(int, input().split()))
data = []
for i in range(1, n + 1):
if a <= sum(list(map(int, list(str(i))))) <= b:
data.append(i)
print((sum(data)))
| n, a, b = list(map(int, input().split()))
ans = 0
for i in range(1, n + 1):
if a <= sum([int(s) for s in str(i)]) <= b:
ans += i
print(ans)
| false | 0 | [
"-data = []",
"+ans = 0",
"- if a <= sum(list(map(int, list(str(i))))) <= b:",
"- data.append(i)",
"-print((sum(data)))",
"+ if a <= sum([int(s) for s in str(i)]) <= b:",
"+ ans += i",
"+print(ans)"
]
| false | 0.043754 | 0.042741 | 1.023702 | [
"s234624858",
"s070367969"
]
|
u173329233 | p03457 | python | s851437639 | s496193245 | 396 | 328 | 11,768 | 3,060 | Accepted | Accepted | 17.17 | N = eval(input())
N = int(N)
t_list = [0]
x_list = [0]
y_list = [0]
for i in range(N):
txy = eval(input())
t, x, y = txy.split()
t = int(t)
x = int(x)
y = int(y)
t_list.append(t)
x_list.append(x)
y_list.append(y)
for i in range(1, N+1):
t = t_list[i] - t_list[i-1]
x = abs(x_list[i] - x_list[i-1])
y = abs(y_list[i] - y_list[i-1])
xy = x+y
if t%2 == xy%2:
res = 'Yes'
elif not t%2 == xy%2:
res = 'No'
if t < xy:
res = 'No'
print(res)
| n = int(eval(input()))
for i in range(n):
t, x, y = list(map(int, input().split()))
if t < x+y or (x+y+t)%2:
print('No')
exit()
print('Yes')
| 30 | 7 | 539 | 159 | N = eval(input())
N = int(N)
t_list = [0]
x_list = [0]
y_list = [0]
for i in range(N):
txy = eval(input())
t, x, y = txy.split()
t = int(t)
x = int(x)
y = int(y)
t_list.append(t)
x_list.append(x)
y_list.append(y)
for i in range(1, N + 1):
t = t_list[i] - t_list[i - 1]
x = abs(x_list[i] - x_list[i - 1])
y = abs(y_list[i] - y_list[i - 1])
xy = x + y
if t % 2 == xy % 2:
res = "Yes"
elif not t % 2 == xy % 2:
res = "No"
if t < xy:
res = "No"
print(res)
| n = int(eval(input()))
for i in range(n):
t, x, y = list(map(int, input().split()))
if t < x + y or (x + y + t) % 2:
print("No")
exit()
print("Yes")
| false | 76.666667 | [
"-N = eval(input())",
"-N = int(N)",
"-t_list = [0]",
"-x_list = [0]",
"-y_list = [0]",
"-for i in range(N):",
"- txy = eval(input())",
"- t, x, y = txy.split()",
"- t = int(t)",
"- x = int(x)",
"- y = int(y)",
"- t_list.append(t)",
"- x_list.append(x)",
"- y_list.append(y)",
"-for i in range(1, N + 1):",
"- t = t_list[i] - t_list[i - 1]",
"- x = abs(x_list[i] - x_list[i - 1])",
"- y = abs(y_list[i] - y_list[i - 1])",
"- xy = x + y",
"- if t % 2 == xy % 2:",
"- res = \"Yes\"",
"- elif not t % 2 == xy % 2:",
"- res = \"No\"",
"- if t < xy:",
"- res = \"No\"",
"-print(res)",
"+n = int(eval(input()))",
"+for i in range(n):",
"+ t, x, y = list(map(int, input().split()))",
"+ if t < x + y or (x + y + t) % 2:",
"+ print(\"No\")",
"+ exit()",
"+print(\"Yes\")"
]
| false | 0.107629 | 0.04162 | 2.586017 | [
"s851437639",
"s496193245"
]
|
u231262424 | p03160 | python | s103439096 | s055983303 | 130 | 115 | 20,544 | 20,344 | Accepted | Accepted | 11.54 | n = int(eval(input()))
costs = list(map(int, input().split()))
if n == 2:
print((abs(costs[-1] - costs[-2])))
else:
best = [float("inf") for i in range(n)]
best[n - 1] = 0
best[n - 2] = abs(costs[n - 2] - costs[n - 1])
for i in range(n - 3, -1, -1):
best[i] = min(abs(costs[i] - costs[i + 1]) + best[i + 1], abs(costs[i] - costs[i + 2]) + best[i + 2])
print((best[0]))
| n = int(eval(input()))
costs = list(map(int, input().split()))
if n == 2:
print((abs(costs[-1] - costs[-2])))
else:
best = [abs(costs[n - 2] - costs[n - 1]), 0]
for i in range(n - 3, -1, -1):
current = min(abs(costs[i] - costs[i + 1]) + best[0], abs(costs[i] - costs[i + 2]) + best[1])
best[0], best[1] = current, best[0]
print((best[0]))
| 15 | 14 | 411 | 379 | n = int(eval(input()))
costs = list(map(int, input().split()))
if n == 2:
print((abs(costs[-1] - costs[-2])))
else:
best = [float("inf") for i in range(n)]
best[n - 1] = 0
best[n - 2] = abs(costs[n - 2] - costs[n - 1])
for i in range(n - 3, -1, -1):
best[i] = min(
abs(costs[i] - costs[i + 1]) + best[i + 1],
abs(costs[i] - costs[i + 2]) + best[i + 2],
)
print((best[0]))
| n = int(eval(input()))
costs = list(map(int, input().split()))
if n == 2:
print((abs(costs[-1] - costs[-2])))
else:
best = [abs(costs[n - 2] - costs[n - 1]), 0]
for i in range(n - 3, -1, -1):
current = min(
abs(costs[i] - costs[i + 1]) + best[0],
abs(costs[i] - costs[i + 2]) + best[1],
)
best[0], best[1] = current, best[0]
print((best[0]))
| false | 6.666667 | [
"- best = [float(\"inf\") for i in range(n)]",
"- best[n - 1] = 0",
"- best[n - 2] = abs(costs[n - 2] - costs[n - 1])",
"+ best = [abs(costs[n - 2] - costs[n - 1]), 0]",
"- best[i] = min(",
"- abs(costs[i] - costs[i + 1]) + best[i + 1],",
"- abs(costs[i] - costs[i + 2]) + best[i + 2],",
"+ current = min(",
"+ abs(costs[i] - costs[i + 1]) + best[0],",
"+ abs(costs[i] - costs[i + 2]) + best[1],",
"+ best[0], best[1] = current, best[0]"
]
| false | 0.036499 | 0.034128 | 1.069484 | [
"s103439096",
"s055983303"
]
|
u936985471 | p02888 | python | s984090306 | s602673316 | 1,050 | 904 | 9,348 | 9,308 | Accepted | Accepted | 13.9 | import sys
readline = sys.stdin.readline
N = int(readline())
L = list(map(int,readline().split()))
L = sorted(L)
# 2本固定すると、もう一本として選べるのは、2本の和より長いものだけ
# これを二分探索で数える
#print(L)
import bisect
ans = 0
for i in range(N - 1):
for j in range(i + 1,N):
limit = L[i] + L[j]
ok = bisect.bisect_left(L, limit)
# print("i",i,"j",j,"L[i]",L[i],"L[j]",L[j],"limit",limit,"ok",ok,"ok - j",ok - 1 - j)
ans += ok - 1 - j
print(ans) | import sys
readline = sys.stdin.readline
N = int(readline())
L = sorted(list(map(int,readline().split())))
# 2本固定すると、もう一本として選べるのは、2本の和より長いものだけ
# これを二分探索で数える
import bisect
ans = 0
for i in range(N - 1):
for j in range(i + 1,N):
ans += bisect.bisect_left(L, L[i] + L[j]) - 1 - j
print(ans) | 21 | 16 | 461 | 320 | import sys
readline = sys.stdin.readline
N = int(readline())
L = list(map(int, readline().split()))
L = sorted(L)
# 2本固定すると、もう一本として選べるのは、2本の和より長いものだけ
# これを二分探索で数える
# print(L)
import bisect
ans = 0
for i in range(N - 1):
for j in range(i + 1, N):
limit = L[i] + L[j]
ok = bisect.bisect_left(L, limit)
# print("i",i,"j",j,"L[i]",L[i],"L[j]",L[j],"limit",limit,"ok",ok,"ok - j",ok - 1 - j)
ans += ok - 1 - j
print(ans)
| import sys
readline = sys.stdin.readline
N = int(readline())
L = sorted(list(map(int, readline().split())))
# 2本固定すると、もう一本として選べるのは、2本の和より長いものだけ
# これを二分探索で数える
import bisect
ans = 0
for i in range(N - 1):
for j in range(i + 1, N):
ans += bisect.bisect_left(L, L[i] + L[j]) - 1 - j
print(ans)
| false | 23.809524 | [
"-L = list(map(int, readline().split()))",
"-L = sorted(L)",
"+L = sorted(list(map(int, readline().split())))",
"-# print(L)",
"- limit = L[i] + L[j]",
"- ok = bisect.bisect_left(L, limit)",
"- # print(\"i\",i,\"j\",j,\"L[i]\",L[i],\"L[j]\",L[j],\"limit\",limit,\"ok\",ok,\"ok - j\",ok - 1 - j)",
"- ans += ok - 1 - j",
"+ ans += bisect.bisect_left(L, L[i] + L[j]) - 1 - j"
]
| false | 0.085339 | 0.080048 | 1.066105 | [
"s984090306",
"s602673316"
]
|
u072717685 | p03805 | python | s750161081 | s314652218 | 82 | 51 | 3,828 | 3,064 | Accepted | Accepted | 37.8 | n, m = list(map(int, input().split()))
a = [tuple(map(int, input().split())) for _ in range(m)]
sum_n = sum([i for i in range(n + 1)])
all_route = []
def dfs(i, r, o):
route = r
o_v = o
route.append(i)
o_v.append(i)
v_num = [v[1] for v in a if v[0] == i and v[1] not in o_v]
v_num += [v[0] for v in a if v[1] == i and v[0] not in o_v]
if len(v_num) == 0:
all_route.append(route[:])
else:
for v in v_num:
dfs(v, route[:],o_v[:])
dfs(1, [], [])
all_route_scores = [sum(route) for route in all_route]
r = all_route_scores.count(sum_n)
print(r)
| from itertools import permutations
def main():
n, m = list(map(int, input().split()))
path = []
for _ in range(m):
path.append(tuple(map(int, input().split())))
nodes = [i for i in range(2, n + 1)]
routes = permutations(nodes, n-1)
r = 0
for route in routes:
route = list(route)
route.insert(0,1)
for i1 in range(n-1):
if (route[i1], route[i1+1]) not in path:
if (route[i1+1], route[i1]) not in path:
break
else:
r += 1
print(r)
if __name__ == '__main__':
main()
| 26 | 24 | 605 | 619 | n, m = list(map(int, input().split()))
a = [tuple(map(int, input().split())) for _ in range(m)]
sum_n = sum([i for i in range(n + 1)])
all_route = []
def dfs(i, r, o):
route = r
o_v = o
route.append(i)
o_v.append(i)
v_num = [v[1] for v in a if v[0] == i and v[1] not in o_v]
v_num += [v[0] for v in a if v[1] == i and v[0] not in o_v]
if len(v_num) == 0:
all_route.append(route[:])
else:
for v in v_num:
dfs(v, route[:], o_v[:])
dfs(1, [], [])
all_route_scores = [sum(route) for route in all_route]
r = all_route_scores.count(sum_n)
print(r)
| from itertools import permutations
def main():
n, m = list(map(int, input().split()))
path = []
for _ in range(m):
path.append(tuple(map(int, input().split())))
nodes = [i for i in range(2, n + 1)]
routes = permutations(nodes, n - 1)
r = 0
for route in routes:
route = list(route)
route.insert(0, 1)
for i1 in range(n - 1):
if (route[i1], route[i1 + 1]) not in path:
if (route[i1 + 1], route[i1]) not in path:
break
else:
r += 1
print(r)
if __name__ == "__main__":
main()
| false | 7.692308 | [
"-n, m = list(map(int, input().split()))",
"-a = [tuple(map(int, input().split())) for _ in range(m)]",
"-sum_n = sum([i for i in range(n + 1)])",
"-all_route = []",
"+from itertools import permutations",
"-def dfs(i, r, o):",
"- route = r",
"- o_v = o",
"- route.append(i)",
"- o_v.append(i)",
"- v_num = [v[1] for v in a if v[0] == i and v[1] not in o_v]",
"- v_num += [v[0] for v in a if v[1] == i and v[0] not in o_v]",
"- if len(v_num) == 0:",
"- all_route.append(route[:])",
"- else:",
"- for v in v_num:",
"- dfs(v, route[:], o_v[:])",
"+def main():",
"+ n, m = list(map(int, input().split()))",
"+ path = []",
"+ for _ in range(m):",
"+ path.append(tuple(map(int, input().split())))",
"+ nodes = [i for i in range(2, n + 1)]",
"+ routes = permutations(nodes, n - 1)",
"+ r = 0",
"+ for route in routes:",
"+ route = list(route)",
"+ route.insert(0, 1)",
"+ for i1 in range(n - 1):",
"+ if (route[i1], route[i1 + 1]) not in path:",
"+ if (route[i1 + 1], route[i1]) not in path:",
"+ break",
"+ else:",
"+ r += 1",
"+ print(r)",
"-dfs(1, [], [])",
"-all_route_scores = [sum(route) for route in all_route]",
"-r = all_route_scores.count(sum_n)",
"-print(r)",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.040509 | 0.046883 | 0.864056 | [
"s750161081",
"s314652218"
]
|
u260036763 | p03636 | python | s788579641 | s113782761 | 19 | 17 | 3,064 | 2,940 | Accepted | Accepted | 10.53 | s = eval(input())
print((s[0] + str(len(s)-2) + s[-1])) | s = eval(input())
x = len(s) - 2
print((s[0]+str(x)+s[-1])) | 2 | 3 | 48 | 53 | s = eval(input())
print((s[0] + str(len(s) - 2) + s[-1]))
| s = eval(input())
x = len(s) - 2
print((s[0] + str(x) + s[-1]))
| false | 33.333333 | [
"-print((s[0] + str(len(s) - 2) + s[-1]))",
"+x = len(s) - 2",
"+print((s[0] + str(x) + s[-1]))"
]
| false | 0.051293 | 0.050869 | 1.008353 | [
"s788579641",
"s113782761"
]
|
u440566786 | p03221 | python | s328372607 | s718314873 | 1,305 | 1,114 | 105,628 | 80,980 | Accepted | Accepted | 14.64 | n,m = list(map(int,input().split()))
C = [[i]+list(map(int,input().split())) for i in range(m)]
C.sort(key=lambda c:c[1:])
prev = 0
count = 0
for c in C:
if prev==c[1]: count+=1
else: count=1
c.append(format(c[1],'0>6')+format(count,'0>6'))
prev=c[1]
for c in sorted(C, key=lambda c:c[0]):
print((c[3])) | #%%
import collections
import bisect
#%%
n,m=list(map(int,input().split()))
p=[[int(j) for j in input().split()] for i in range(m)]
a=collections.defaultdict(list)
for x,y in sorted(p): # p自体を変えないことで、市の順番は保っておく
a[x]+=[y] # 各県に対し、存在する生誕年を昇順でリスト化する。最初の1つはdefaultdictよりOK
for x,y in p: # 各市を1つずつ取得
z=bisect.bisect(a[x],y) # bisectでindexを探索。bisect_rightに注意。
print(("%06d%06d"%(x,z)))
| 13 | 12 | 328 | 395 | n, m = list(map(int, input().split()))
C = [[i] + list(map(int, input().split())) for i in range(m)]
C.sort(key=lambda c: c[1:])
prev = 0
count = 0
for c in C:
if prev == c[1]:
count += 1
else:
count = 1
c.append(format(c[1], "0>6") + format(count, "0>6"))
prev = c[1]
for c in sorted(C, key=lambda c: c[0]):
print((c[3]))
| #%%
import collections
import bisect
#%%
n, m = list(map(int, input().split()))
p = [[int(j) for j in input().split()] for i in range(m)]
a = collections.defaultdict(list)
for x, y in sorted(p): # p自体を変えないことで、市の順番は保っておく
a[x] += [y] # 各県に対し、存在する生誕年を昇順でリスト化する。最初の1つはdefaultdictよりOK
for x, y in p: # 各市を1つずつ取得
z = bisect.bisect(a[x], y) # bisectでindexを探索。bisect_rightに注意。
print(("%06d%06d" % (x, z)))
| false | 7.692308 | [
"+#%%",
"+import collections",
"+import bisect",
"+",
"+#%%",
"-C = [[i] + list(map(int, input().split())) for i in range(m)]",
"-C.sort(key=lambda c: c[1:])",
"-prev = 0",
"-count = 0",
"-for c in C:",
"- if prev == c[1]:",
"- count += 1",
"- else:",
"- count = 1",
"- c.append(format(c[1], \"0>6\") + format(count, \"0>6\"))",
"- prev = c[1]",
"-for c in sorted(C, key=lambda c: c[0]):",
"- print((c[3]))",
"+p = [[int(j) for j in input().split()] for i in range(m)]",
"+a = collections.defaultdict(list)",
"+for x, y in sorted(p): # p自体を変えないことで、市の順番は保っておく",
"+ a[x] += [y] # 各県に対し、存在する生誕年を昇順でリスト化する。最初の1つはdefaultdictよりOK",
"+for x, y in p: # 各市を1つずつ取得",
"+ z = bisect.bisect(a[x], y) # bisectでindexを探索。bisect_rightに注意。",
"+ print((\"%06d%06d\" % (x, z)))"
]
| false | 0.038382 | 0.040929 | 0.937763 | [
"s328372607",
"s718314873"
]
|
u280978334 | p03043 | python | s723859806 | s929047612 | 44 | 34 | 3,828 | 3,188 | Accepted | Accepted | 22.73 | n,k = list(map(int,input().split()))
X = [0]*(n+1)
import math as ma
ans = 0
for i in range(1,n+1):
temp = ma.ceil(ma.log2(k/i)) if k > i else 0
ans += (1/n)*(0.5**temp)
print(ans) | from math import log2,ceil
def main():
N,K = list(map(int,input().split()))
ans = 0
for i in range(1,N + 1):
digit = ceil(log2(K) - log2(i)) if K > i else 0
ans += (1/N)*(0.5**digit)
print(ans)
return
if __name__ == "__main__":
main() | 8 | 13 | 191 | 283 | n, k = list(map(int, input().split()))
X = [0] * (n + 1)
import math as ma
ans = 0
for i in range(1, n + 1):
temp = ma.ceil(ma.log2(k / i)) if k > i else 0
ans += (1 / n) * (0.5**temp)
print(ans)
| from math import log2, ceil
def main():
N, K = list(map(int, input().split()))
ans = 0
for i in range(1, N + 1):
digit = ceil(log2(K) - log2(i)) if K > i else 0
ans += (1 / N) * (0.5**digit)
print(ans)
return
if __name__ == "__main__":
main()
| false | 38.461538 | [
"-n, k = list(map(int, input().split()))",
"-X = [0] * (n + 1)",
"-import math as ma",
"+from math import log2, ceil",
"-ans = 0",
"-for i in range(1, n + 1):",
"- temp = ma.ceil(ma.log2(k / i)) if k > i else 0",
"- ans += (1 / n) * (0.5**temp)",
"-print(ans)",
"+",
"+def main():",
"+ N, K = list(map(int, input().split()))",
"+ ans = 0",
"+ for i in range(1, N + 1):",
"+ digit = ceil(log2(K) - log2(i)) if K > i else 0",
"+ ans += (1 / N) * (0.5**digit)",
"+ print(ans)",
"+ return",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.075365 | 0.098061 | 0.768553 | [
"s723859806",
"s929047612"
]
|
u654470292 | p02886 | python | s131805551 | s143369835 | 180 | 78 | 39,024 | 69,876 | Accepted | Accepted | 56.67 | import sys
def input():
return sys.stdin.readline()[:-1]
n=int(eval(input()))
d=list(map(int,input().split()))
ans=0
for i in range(n):
for j in range(i+1,n):
ans+=d[i]*d[j]
print(ans) | import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
sys.setrecursionlimit(500000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]
n=int(eval(input()))
d=list(map(int,input().split()))
ans=0
for i in range(n):
for j in range(i+1,n):
# print(i,j)
ans+=d[i]*d[j]
print(ans) | 10 | 26 | 203 | 602 | import sys
def input():
return sys.stdin.readline()[:-1]
n = int(eval(input()))
d = list(map(int, input().split()))
ans = 0
for i in range(n):
for j in range(i + 1, n):
ans += d[i] * d[j]
print(ans)
| import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0] + list(accumulate(lst))
sys.setrecursionlimit(500000)
mod = pow(10, 9) + 7
al = [chr(ord("a") + i) for i in range(26)]
direction = [[1, 0], [0, 1], [-1, 0], [0, -1]]
n = int(eval(input()))
d = list(map(int, input().split()))
ans = 0
for i in range(n):
for j in range(i + 1, n):
# print(i,j)
ans += d[i] * d[j]
print(ans)
| false | 61.538462 | [
"+import bisect",
"+import copy",
"+import heapq",
"+import math",
"+from collections import *",
"+from functools import lru_cache",
"+from itertools import accumulate, combinations, permutations, product",
"+def ruiseki(lst):",
"+ return [0] + list(accumulate(lst))",
"+",
"+",
"+sys.setrecursionlimit(500000)",
"+mod = pow(10, 9) + 7",
"+al = [chr(ord(\"a\") + i) for i in range(26)]",
"+direction = [[1, 0], [0, 1], [-1, 0], [0, -1]]",
"+ # print(i,j)"
]
| false | 0.035528 | 0.129755 | 0.273811 | [
"s131805551",
"s143369835"
]
|
u352394527 | p01334 | python | s720757067 | s251580576 | 160 | 120 | 8,400 | 6,672 | Accepted | Accepted | 25 | while True:
n = int(eval(input()))
if n == 0:break
to = []
fr = [[] for _ in range(n * n)]
for i in range(n):
line = list(map(int, input().split()))
for j in range(n):
x, y = line[2 * j:2 * j + 2]
to.append(y * n + x)
fr[y * n + x].append(i * n + j)
order = []
used = [False] * (n * n)
def dfs(x):
if used[x]:return
used[x] = True
dfs(to[x])
order.append(x)
for i in range(n * n):
dfs(i)
order.reverse()
def dfs2(x, used, group):
if used[x]:return False
if x in group:return True
group.append(x)
ret = False
ret = ret or dfs2(to[x], used, group)
return ret
used = [False] * (n * n)
ans = 0
for i in order:
group = []
if not used[i]:
if dfs2(i, used, group):ans += 1
for g in group:used[g] = True
print(ans)
| while True:
n = int(eval(input()))
if n == 0:break
to = []
for i in range(n):
line = list(map(int, input().split()))
for j in range(n):
x, y = line[2 * j:2 * j + 2]
to.append(y * n + x)
order = []
used = [False] * (n * n)
def dfs(x):
if used[x]:return
used[x] = True
dfs(to[x])
order.append(x)
for i in range(n * n):
dfs(i)
order.reverse()
def dfs2(x, used, group):
if used[x]:return False
if x in group:return True
group.add(x)
return dfs2(to[x], used, group)
used = [False] * (n * n)
ans = 0
for i in order:
group = set()
if not used[i]:
if dfs2(i, used, group):ans += 1
for g in group:used[g] = True
print(ans)
| 41 | 37 | 874 | 761 | while True:
n = int(eval(input()))
if n == 0:
break
to = []
fr = [[] for _ in range(n * n)]
for i in range(n):
line = list(map(int, input().split()))
for j in range(n):
x, y = line[2 * j : 2 * j + 2]
to.append(y * n + x)
fr[y * n + x].append(i * n + j)
order = []
used = [False] * (n * n)
def dfs(x):
if used[x]:
return
used[x] = True
dfs(to[x])
order.append(x)
for i in range(n * n):
dfs(i)
order.reverse()
def dfs2(x, used, group):
if used[x]:
return False
if x in group:
return True
group.append(x)
ret = False
ret = ret or dfs2(to[x], used, group)
return ret
used = [False] * (n * n)
ans = 0
for i in order:
group = []
if not used[i]:
if dfs2(i, used, group):
ans += 1
for g in group:
used[g] = True
print(ans)
| while True:
n = int(eval(input()))
if n == 0:
break
to = []
for i in range(n):
line = list(map(int, input().split()))
for j in range(n):
x, y = line[2 * j : 2 * j + 2]
to.append(y * n + x)
order = []
used = [False] * (n * n)
def dfs(x):
if used[x]:
return
used[x] = True
dfs(to[x])
order.append(x)
for i in range(n * n):
dfs(i)
order.reverse()
def dfs2(x, used, group):
if used[x]:
return False
if x in group:
return True
group.add(x)
return dfs2(to[x], used, group)
used = [False] * (n * n)
ans = 0
for i in order:
group = set()
if not used[i]:
if dfs2(i, used, group):
ans += 1
for g in group:
used[g] = True
print(ans)
| false | 9.756098 | [
"- fr = [[] for _ in range(n * n)]",
"- fr[y * n + x].append(i * n + j)",
"- group.append(x)",
"- ret = False",
"- ret = ret or dfs2(to[x], used, group)",
"- return ret",
"+ group.add(x)",
"+ return dfs2(to[x], used, group)",
"- group = []",
"+ group = set()"
]
| false | 0.164452 | 0.128509 | 1.279695 | [
"s720757067",
"s251580576"
]
|
u522293645 | p02623 | python | s273757652 | s557435660 | 351 | 284 | 47,524 | 47,552 | Accepted | Accepted | 19.09 | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
lia = [0]
lib = [0]
tmp = M
ans = 0
for i in range(N):
lia.append(lia[i]+A[i])
for i in range(M):
lib.append(lib[i]+B[i])
for i in range(N+1):
kari = 0
t = K - lia[i]
kari += i
if t<0:
break
elif t==0:
ans = max(ans, i)
break
else:
pass
for j in range(tmp,-1,-1):
if t<lib[j]:
continue
else:
tmp = j
kari += j
ans = max(ans, kari)
break
print(ans) | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
lia = [0]
lib = [0]
j = M
ans = 0
for i in range(N):
lia.append(lia[i]+A[i])
for i in range(M):
lib.append(lib[i]+B[i])
for i in range(N+1):
if lia[i] > K:
break
while lib[j] > K-lia[i]:
j -= 1
ans = max(ans, i+j)
print(ans) | 37 | 23 | 641 | 395 | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
lia = [0]
lib = [0]
tmp = M
ans = 0
for i in range(N):
lia.append(lia[i] + A[i])
for i in range(M):
lib.append(lib[i] + B[i])
for i in range(N + 1):
kari = 0
t = K - lia[i]
kari += i
if t < 0:
break
elif t == 0:
ans = max(ans, i)
break
else:
pass
for j in range(tmp, -1, -1):
if t < lib[j]:
continue
else:
tmp = j
kari += j
ans = max(ans, kari)
break
print(ans)
| N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
lia = [0]
lib = [0]
j = M
ans = 0
for i in range(N):
lia.append(lia[i] + A[i])
for i in range(M):
lib.append(lib[i] + B[i])
for i in range(N + 1):
if lia[i] > K:
break
while lib[j] > K - lia[i]:
j -= 1
ans = max(ans, i + j)
print(ans)
| false | 37.837838 | [
"-tmp = M",
"+j = M",
"- kari = 0",
"- t = K - lia[i]",
"- kari += i",
"- if t < 0:",
"+ if lia[i] > K:",
"- elif t == 0:",
"- ans = max(ans, i)",
"- break",
"- else:",
"- pass",
"- for j in range(tmp, -1, -1):",
"- if t < lib[j]:",
"- continue",
"- else:",
"- tmp = j",
"- kari += j",
"- ans = max(ans, kari)",
"- break",
"+ while lib[j] > K - lia[i]:",
"+ j -= 1",
"+ ans = max(ans, i + j)"
]
| false | 0.133268 | 0.134513 | 0.990749 | [
"s273757652",
"s557435660"
]
|
u562935282 | p03212 | python | s227712300 | s145032352 | 155 | 77 | 2,940 | 2,940 | Accepted | Accepted | 50.32 | # 解説放送
def check(var):
in_range = var <= N
all_num_in = all(c in str(var) for c in '753')
return in_range and all_num_in
def dfs(x):
res = 0
if check(x):
res += 1
if x <= N:
res += dfs(10 * x + 3)
res += dfs(10 * x + 5)
res += dfs(10 * x + 7)
return res
N = int(eval(input()))
print((dfs(0)))
| # 解説放送
def dfs(x):
if x > N: return 0
res = 1 if all(c in str(x) for c in '753') else 0
for v in 3, 5, 7:
res += dfs(10 * x + v)
return res
N = int(eval(input()))
print((dfs(0)))
| 20 | 11 | 368 | 207 | # 解説放送
def check(var):
in_range = var <= N
all_num_in = all(c in str(var) for c in "753")
return in_range and all_num_in
def dfs(x):
res = 0
if check(x):
res += 1
if x <= N:
res += dfs(10 * x + 3)
res += dfs(10 * x + 5)
res += dfs(10 * x + 7)
return res
N = int(eval(input()))
print((dfs(0)))
| # 解説放送
def dfs(x):
if x > N:
return 0
res = 1 if all(c in str(x) for c in "753") else 0
for v in 3, 5, 7:
res += dfs(10 * x + v)
return res
N = int(eval(input()))
print((dfs(0)))
| false | 45 | [
"-def check(var):",
"- in_range = var <= N",
"- all_num_in = all(c in str(var) for c in \"753\")",
"- return in_range and all_num_in",
"-",
"-",
"- res = 0",
"- if check(x):",
"- res += 1",
"- if x <= N:",
"- res += dfs(10 * x + 3)",
"- res += dfs(10 * x + 5)",
"- res += dfs(10 * x + 7)",
"+ if x > N:",
"+ return 0",
"+ res = 1 if all(c in str(x) for c in \"753\") else 0",
"+ for v in 3, 5, 7:",
"+ res += dfs(10 * x + v)"
]
| false | 0.091563 | 0.073307 | 1.249039 | [
"s227712300",
"s145032352"
]
|
u759412327 | p03273 | python | s572228414 | s637393470 | 33 | 27 | 9,184 | 9,260 | Accepted | Accepted | 18.18 | H,W = map(int, input().split())
A = [input() for h in range(H)]
row = H*[False]
col = W*[False]
for h in range(H):
for w in range(W):
if A[h][w]=="#":
row[h] = True
col[w] = True
for h in range(H):
if row[h]:
for w in range(W):
if col[w]:
print(A[h][w],end="")
print()
| H,W = list(map(int,input().split()))
A = [eval(input()) for _ in range(H)]
A = list([a for a in A if any(x=='#' for x in a)])
A = list([a for a in zip(*A) if any(x=='#' for x in a)])
for a in zip(*A):
print(("".join(a))) | 17 | 7 | 328 | 222 | H, W = map(int, input().split())
A = [input() for h in range(H)]
row = H * [False]
col = W * [False]
for h in range(H):
for w in range(W):
if A[h][w] == "#":
row[h] = True
col[w] = True
for h in range(H):
if row[h]:
for w in range(W):
if col[w]:
print(A[h][w], end="")
print()
| H, W = list(map(int, input().split()))
A = [eval(input()) for _ in range(H)]
A = list([a for a in A if any(x == "#" for x in a)])
A = list([a for a in zip(*A) if any(x == "#" for x in a)])
for a in zip(*A):
print(("".join(a)))
| false | 58.823529 | [
"-H, W = map(int, input().split())",
"-A = [input() for h in range(H)]",
"-row = H * [False]",
"-col = W * [False]",
"-for h in range(H):",
"- for w in range(W):",
"- if A[h][w] == \"#\":",
"- row[h] = True",
"- col[w] = True",
"-for h in range(H):",
"- if row[h]:",
"- for w in range(W):",
"- if col[w]:",
"- print(A[h][w], end=\"\")",
"- print()",
"+H, W = list(map(int, input().split()))",
"+A = [eval(input()) for _ in range(H)]",
"+A = list([a for a in A if any(x == \"#\" for x in a)])",
"+A = list([a for a in zip(*A) if any(x == \"#\" for x in a)])",
"+for a in zip(*A):",
"+ print((\"\".join(a)))"
]
| false | 0.048687 | 0.048607 | 1.001635 | [
"s572228414",
"s637393470"
]
|
u987164499 | p02771 | python | s387083519 | s509320562 | 19 | 17 | 3,060 | 2,940 | Accepted | Accepted | 10.53 | from sys import stdin
a,b,c = list(map(int,stdin.readline().rstrip().split()))
if a == b and b != c:
print("Yes")
elif a == c and b != c:
print("Yes")
elif b == c and a != c:
print("Yes")
else:
print("No") | #解法その１
a,b,c = list(map(int,input().split()))
if a == b != c:
print("Yes")
elif a == c != b:
print("Yes")
elif b == c != a:
print("Yes")
else:
print("No") | 10 | 10 | 224 | 173 | from sys import stdin
a, b, c = list(map(int, stdin.readline().rstrip().split()))
if a == b and b != c:
print("Yes")
elif a == c and b != c:
print("Yes")
elif b == c and a != c:
print("Yes")
else:
print("No")
| # 解法その１
a, b, c = list(map(int, input().split()))
if a == b != c:
print("Yes")
elif a == c != b:
print("Yes")
elif b == c != a:
print("Yes")
else:
print("No")
| false | 0 | [
"-from sys import stdin",
"-",
"-a, b, c = list(map(int, stdin.readline().rstrip().split()))",
"-if a == b and b != c:",
"+# 解法その１",
"+a, b, c = list(map(int, input().split()))",
"+if a == b != c:",
"-elif a == c and b != c:",
"+elif a == c != b:",
"-elif b == c and a != c:",
"+elif b == c != a:"
]
| false | 0.047584 | 0.049188 | 0.967374 | [
"s387083519",
"s509320562"
]
|
u282228874 | p03078 | python | s083411804 | s057725232 | 114 | 35 | 8,708 | 4,980 | Accepted | Accepted | 69.3 | x,y,z,k = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
res = []
for p in range(x):
for q in range(y):
if (p+1)*(q+1) > k:
break
for r in range(z):
if (p+1)*(q+1)*(r+1) > k:
break
res.append(A[p]+B[q]+C[r])
res.sort(reverse=True)
for i in res[:k]:
print(i) | from heapq import heappop,heappush
x,y,z,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort(reverse=True)
B = list(map(int,input().split()))
B.sort(reverse=True)
C = list(map(int,input().split()))
C.sort(reverse=True)
Q=[]
heappush(Q,(-(A[0]+B[0]+C[0]),0,0,0))
S=set()
for n in range(K):
p,i,j,k = heappop(Q)
print((-p))
if i+1 < x and ((i+1,j,k) not in S):
S.add((i+1,j,k))
heappush(Q,(-(A[i+1]+B[j]+C[k]),i+1,j,k))
if j+1 < y and ((i,j+1,k) not in S):
S.add((i,j+1,k))
heappush(Q,(-(A[i]+B[j+1]+C[k]),i,j+1,k))
if k+1 < z and ((i,j,k+1) not in S):
S.add((i,j,k+1))
heappush(Q,(-(A[i]+B[j]+C[k+1]),i,j,k+1)) | 19 | 26 | 440 | 672 | x, y, z, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
res = []
for p in range(x):
for q in range(y):
if (p + 1) * (q + 1) > k:
break
for r in range(z):
if (p + 1) * (q + 1) * (r + 1) > k:
break
res.append(A[p] + B[q] + C[r])
res.sort(reverse=True)
for i in res[:k]:
print(i)
| from heapq import heappop, heappush
x, y, z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
B = list(map(int, input().split()))
B.sort(reverse=True)
C = list(map(int, input().split()))
C.sort(reverse=True)
Q = []
heappush(Q, (-(A[0] + B[0] + C[0]), 0, 0, 0))
S = set()
for n in range(K):
p, i, j, k = heappop(Q)
print((-p))
if i + 1 < x and ((i + 1, j, k) not in S):
S.add((i + 1, j, k))
heappush(Q, (-(A[i + 1] + B[j] + C[k]), i + 1, j, k))
if j + 1 < y and ((i, j + 1, k) not in S):
S.add((i, j + 1, k))
heappush(Q, (-(A[i] + B[j + 1] + C[k]), i, j + 1, k))
if k + 1 < z and ((i, j, k + 1) not in S):
S.add((i, j, k + 1))
heappush(Q, (-(A[i] + B[j] + C[k + 1]), i, j, k + 1))
| false | 26.923077 | [
"-x, y, z, k = list(map(int, input().split()))",
"+from heapq import heappop, heappush",
"+",
"+x, y, z, K = list(map(int, input().split()))",
"+A.sort(reverse=True)",
"+B.sort(reverse=True)",
"-A.sort(reverse=True)",
"-B.sort(reverse=True)",
"-res = []",
"-for p in range(x):",
"- for q in range(y):",
"- if (p + 1) * (q + 1) > k:",
"- break",
"- for r in range(z):",
"- if (p + 1) * (q + 1) * (r + 1) > k:",
"- break",
"- res.append(A[p] + B[q] + C[r])",
"-res.sort(reverse=True)",
"-for i in res[:k]:",
"- print(i)",
"+Q = []",
"+heappush(Q, (-(A[0] + B[0] + C[0]), 0, 0, 0))",
"+S = set()",
"+for n in range(K):",
"+ p, i, j, k = heappop(Q)",
"+ print((-p))",
"+ if i + 1 < x and ((i + 1, j, k) not in S):",
"+ S.add((i + 1, j, k))",
"+ heappush(Q, (-(A[i + 1] + B[j] + C[k]), i + 1, j, k))",
"+ if j + 1 < y and ((i, j + 1, k) not in S):",
"+ S.add((i, j + 1, k))",
"+ heappush(Q, (-(A[i] + B[j + 1] + C[k]), i, j + 1, k))",
"+ if k + 1 < z and ((i, j, k + 1) not in S):",
"+ S.add((i, j, k + 1))",
"+ heappush(Q, (-(A[i] + B[j] + C[k + 1]), i, j, k + 1))"
]
| false | 0.078505 | 0.040057 | 1.959854 | [
"s083411804",
"s057725232"
]
|
u512212329 | p02660 | python | s462220013 | s427472443 | 271 | 190 | 9,160 | 9,320 | Accepted | Accepted | 29.89 | def main():
n = int(eval(input()))
ans = 0
e = 1
def facs():
yield 2
for x in range(10 ** 6):
yield x * 2 + 3
for fac in facs():
while n % (div := pow(fac, e)) == 0:
n //= div
ans += 1
e += 1
while n % fac == 0:
n //= fac
if fac * fac > n:
break
e = 1
if n != 1:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| from itertools import accumulate
from collections import defaultdict
def main():
n = int(eval(input()))
prime_counter = defaultdict(int)
acc = tuple(accumulate(list(range(1, 42)))) # 10^12 < 2^39
def facs():
yield 2
for x in range(10 ** 6):
yield x * 2 + 3
for fac in facs():
while fac * fac <= n:
if n % fac == 0:
n //= fac
prime_counter[fac] += 1
else:
break
if n != 1:
prime_counter[n] += 1
ans = 0
for c in list(prime_counter.values()):
for i, x in enumerate(acc):
if c < x:
tmp = i
break
ans += tmp
print(ans)
if __name__ == '__main__':
main()
| 29 | 36 | 505 | 790 | def main():
n = int(eval(input()))
ans = 0
e = 1
def facs():
yield 2
for x in range(10**6):
yield x * 2 + 3
for fac in facs():
while n % (div := pow(fac, e)) == 0:
n //= div
ans += 1
e += 1
while n % fac == 0:
n //= fac
if fac * fac > n:
break
e = 1
if n != 1:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| from itertools import accumulate
from collections import defaultdict
def main():
n = int(eval(input()))
prime_counter = defaultdict(int)
acc = tuple(accumulate(list(range(1, 42)))) # 10^12 < 2^39
def facs():
yield 2
for x in range(10**6):
yield x * 2 + 3
for fac in facs():
while fac * fac <= n:
if n % fac == 0:
n //= fac
prime_counter[fac] += 1
else:
break
if n != 1:
prime_counter[n] += 1
ans = 0
for c in list(prime_counter.values()):
for i, x in enumerate(acc):
if c < x:
tmp = i
break
ans += tmp
print(ans)
if __name__ == "__main__":
main()
| false | 19.444444 | [
"+from itertools import accumulate",
"+from collections import defaultdict",
"+",
"+",
"- ans = 0",
"- e = 1",
"+ prime_counter = defaultdict(int)",
"+ acc = tuple(accumulate(list(range(1, 42)))) # 10^12 < 2^39",
"- while n % (div := pow(fac, e)) == 0:",
"- n //= div",
"- ans += 1",
"- e += 1",
"- while n % fac == 0:",
"- n //= fac",
"- if fac * fac > n:",
"- break",
"- e = 1",
"+ while fac * fac <= n:",
"+ if n % fac == 0:",
"+ n //= fac",
"+ prime_counter[fac] += 1",
"+ else:",
"+ break",
"- ans += 1",
"+ prime_counter[n] += 1",
"+ ans = 0",
"+ for c in list(prime_counter.values()):",
"+ for i, x in enumerate(acc):",
"+ if c < x:",
"+ tmp = i",
"+ break",
"+ ans += tmp"
]
| false | 0.041967 | 0.271702 | 0.15446 | [
"s462220013",
"s427472443"
]
|
u644907318 | p03504 | python | s364093656 | s986918417 | 1,000 | 759 | 134,060 | 118,088 | Accepted | Accepted | 24.1 | N,C = list(map(int,input().split()))
ch = {}
for _ in range(N):
s,t,c = list(map(int,input().split()))
if c not in ch:
ch[c] = [0 for _ in range(2*10**5+2)]
for i in range(2*s-1,2*t):
ch[c][i]=1
cmax = 0
for i in range(2*10**5+2):
cnt = 0
for c in ch:
if ch[c][i]==1:
cnt += 1
cmax = max(cmax,cnt)
print(cmax) | N,C = list(map(int,input().split()))
G = {i:[0 for _ in range(10**5+1)] for i in range(1,C+1)}
for i in range(N):
s,t,c = list(map(int,input().split()))
G[c][s] += 1
G[c][t] -= 1
F = [0 for _ in range(2*(10**5)+1)]
for c in range(1,C+1):
for i in range(10**5+1):
if G[c][i]==1:
F[2*i-1] += 1
elif G[c][i]==-1:
F[2*i] -= 1
H = [0 for _ in range(2*(10**5)+1)]
for i in range(1,2*(10**5)+1):
H[i] = H[i-1]+F[i]
print((max(H))) | 16 | 17 | 372 | 485 | N, C = list(map(int, input().split()))
ch = {}
for _ in range(N):
s, t, c = list(map(int, input().split()))
if c not in ch:
ch[c] = [0 for _ in range(2 * 10**5 + 2)]
for i in range(2 * s - 1, 2 * t):
ch[c][i] = 1
cmax = 0
for i in range(2 * 10**5 + 2):
cnt = 0
for c in ch:
if ch[c][i] == 1:
cnt += 1
cmax = max(cmax, cnt)
print(cmax)
| N, C = list(map(int, input().split()))
G = {i: [0 for _ in range(10**5 + 1)] for i in range(1, C + 1)}
for i in range(N):
s, t, c = list(map(int, input().split()))
G[c][s] += 1
G[c][t] -= 1
F = [0 for _ in range(2 * (10**5) + 1)]
for c in range(1, C + 1):
for i in range(10**5 + 1):
if G[c][i] == 1:
F[2 * i - 1] += 1
elif G[c][i] == -1:
F[2 * i] -= 1
H = [0 for _ in range(2 * (10**5) + 1)]
for i in range(1, 2 * (10**5) + 1):
H[i] = H[i - 1] + F[i]
print((max(H)))
| false | 5.882353 | [
"-ch = {}",
"-for _ in range(N):",
"+G = {i: [0 for _ in range(10**5 + 1)] for i in range(1, C + 1)}",
"+for i in range(N):",
"- if c not in ch:",
"- ch[c] = [0 for _ in range(2 * 10**5 + 2)]",
"- for i in range(2 * s - 1, 2 * t):",
"- ch[c][i] = 1",
"-cmax = 0",
"-for i in range(2 * 10**5 + 2):",
"- cnt = 0",
"- for c in ch:",
"- if ch[c][i] == 1:",
"- cnt += 1",
"- cmax = max(cmax, cnt)",
"-print(cmax)",
"+ G[c][s] += 1",
"+ G[c][t] -= 1",
"+F = [0 for _ in range(2 * (10**5) + 1)]",
"+for c in range(1, C + 1):",
"+ for i in range(10**5 + 1):",
"+ if G[c][i] == 1:",
"+ F[2 * i - 1] += 1",
"+ elif G[c][i] == -1:",
"+ F[2 * i] -= 1",
"+H = [0 for _ in range(2 * (10**5) + 1)]",
"+for i in range(1, 2 * (10**5) + 1):",
"+ H[i] = H[i - 1] + F[i]",
"+print((max(H)))"
]
| false | 0.28071 | 0.342586 | 0.819386 | [
"s364093656",
"s986918417"
]
|
u661290476 | p00042 | python | s751822112 | s427614149 | 600 | 550 | 7,692 | 7,704 | Accepted | Accepted | 8.33 | cnt=0
while True:
cnt+=1
W=int(eval(input()))
if W==0:
break
n=int(eval(input()))
dp=[0]*(W+1)
for i in range(n):
v,w=list(map(int,input().split(',')))
for j in range(W,w-1,-1):
dp[j]=max(dp[j],dp[j-w]+v)
wgt=0
for i in range(W+1):
if max(dp)==dp[i]:
wgt=i
break
print(("Case {0}:".format(cnt)))
print((max(dp)))
print(wgt) | cnt=0
while True:
cnt+=1
W=int(eval(input()))
if W==0:
break
n=int(eval(input()))
dp=[0]*(W+1)
for i in range(n):
v,w=list(map(int,input().split(',')))
for j in range(W,w-1,-1):
dp[j]=max(dp[j],dp[j-w]+v)
wgt=0
md=max(dp)
for i in range(W+1):
if md==dp[i]:
wgt=i
break
print(("Case {0}:".format(cnt)))
print(md)
print(wgt) | 20 | 21 | 432 | 438 | cnt = 0
while True:
cnt += 1
W = int(eval(input()))
if W == 0:
break
n = int(eval(input()))
dp = [0] * (W + 1)
for i in range(n):
v, w = list(map(int, input().split(",")))
for j in range(W, w - 1, -1):
dp[j] = max(dp[j], dp[j - w] + v)
wgt = 0
for i in range(W + 1):
if max(dp) == dp[i]:
wgt = i
break
print(("Case {0}:".format(cnt)))
print((max(dp)))
print(wgt)
| cnt = 0
while True:
cnt += 1
W = int(eval(input()))
if W == 0:
break
n = int(eval(input()))
dp = [0] * (W + 1)
for i in range(n):
v, w = list(map(int, input().split(",")))
for j in range(W, w - 1, -1):
dp[j] = max(dp[j], dp[j - w] + v)
wgt = 0
md = max(dp)
for i in range(W + 1):
if md == dp[i]:
wgt = i
break
print(("Case {0}:".format(cnt)))
print(md)
print(wgt)
| false | 4.761905 | [
"+ md = max(dp)",
"- if max(dp) == dp[i]:",
"+ if md == dp[i]:",
"- print((max(dp)))",
"+ print(md)"
]
| false | 0.036469 | 0.036315 | 1.00424 | [
"s751822112",
"s427614149"
]
|
u790710233 | p03945 | python | s373110287 | s604387539 | 315 | 35 | 4,972 | 3,188 | Accepted | Accepted | 88.89 | S = eval(input())
last = ""
ls = []
for s in S:
if s != last:
last = s
ls.append(s)
else:
ls[-1] += s
print((len(ls)-1)) | s = eval(input())
prev = ans = -1
for c in s:
if prev != c:
prev = c
ans += 1
print(ans) | 12 | 7 | 157 | 108 | S = eval(input())
last = ""
ls = []
for s in S:
if s != last:
last = s
ls.append(s)
else:
ls[-1] += s
print((len(ls) - 1))
| s = eval(input())
prev = ans = -1
for c in s:
if prev != c:
prev = c
ans += 1
print(ans)
| false | 41.666667 | [
"-S = eval(input())",
"-last = \"\"",
"-ls = []",
"-for s in S:",
"- if s != last:",
"- last = s",
"- ls.append(s)",
"- else:",
"- ls[-1] += s",
"-print((len(ls) - 1))",
"+s = eval(input())",
"+prev = ans = -1",
"+for c in s:",
"+ if prev != c:",
"+ prev = c",
"+ ans += 1",
"+print(ans)"
]
| false | 0.053161 | 0.038399 | 1.384434 | [
"s373110287",
"s604387539"
]
|
u408071652 | p02913 | python | s997129329 | s350486452 | 266 | 210 | 73,532 | 73,612 | Accepted | Accepted | 21.05 | import sys
# \n
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
S = list(eval(input()))
ans =0
for k in range(1,N):
i=0
count =0
while i<N-k:
if S[i]==S[i+k]:
count+=1
ans =max(ans,min(count,k))
else:
count=0
i+=1
print(ans)
if __name__ == "__main__":
main()
| import sys
# \n
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
S = list(eval(input()))
ans =0
for k in range(N+1,0,-1):
i=0
count =0
while i<N-k:
if S[i]==S[i+k]:
count+=1
ans =max(ans,min(count,k))
else:
count=0
i+=1
print(ans)
if __name__ == "__main__":
main()
| 39 | 39 | 476 | 481 | import sys
# \n
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
S = list(eval(input()))
ans = 0
for k in range(1, N):
i = 0
count = 0
while i < N - k:
if S[i] == S[i + k]:
count += 1
ans = max(ans, min(count, k))
else:
count = 0
i += 1
print(ans)
if __name__ == "__main__":
main()
| import sys
# \n
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
S = list(eval(input()))
ans = 0
for k in range(N + 1, 0, -1):
i = 0
count = 0
while i < N - k:
if S[i] == S[i + k]:
count += 1
ans = max(ans, min(count, k))
else:
count = 0
i += 1
print(ans)
if __name__ == "__main__":
main()
| false | 0 | [
"- for k in range(1, N):",
"+ for k in range(N + 1, 0, -1):"
]
| false | 0.037221 | 0.039001 | 0.954354 | [
"s997129329",
"s350486452"
]
|
u761320129 | p03424 | python | s339324607 | s213564130 | 21 | 17 | 3,316 | 2,940 | Accepted | Accepted | 19.05 | N = int(eval(input()))
print(('Four' if 'Y' in input().split() else 'Three'))
| N = int(eval(input()))
src = input().split()
print(('Three' if len(set(src)) == 3 else 'Four')) | 2 | 3 | 71 | 89 | N = int(eval(input()))
print(("Four" if "Y" in input().split() else "Three"))
| N = int(eval(input()))
src = input().split()
print(("Three" if len(set(src)) == 3 else "Four"))
| false | 33.333333 | [
"-print((\"Four\" if \"Y\" in input().split() else \"Three\"))",
"+src = input().split()",
"+print((\"Three\" if len(set(src)) == 3 else \"Four\"))"
]
| false | 0.043916 | 0.102769 | 0.427326 | [
"s339324607",
"s213564130"
]
|
u091051505 | p03127 | python | s058675784 | s699129584 | 123 | 112 | 14,252 | 14,252 | Accepted | Accepted | 8.94 | n = int(eval(input()))
a = [int(i) for i in input().split()]
def euclid(a, b):
c,d = sorted([a, b])
r = 1
while (r > 0):
r = d % c
c,d = r,c
return d
for i in range(n-1):
if i == 0:
ans = a[0]
ans = euclid(ans, a[i+1])
print(ans) | def euclid(n, a_list):
a1, a2 = a_list[0:2]
gcd_ = gcd(a1, a2)
for i in range(2, n):
gcd_ = gcd(gcd_, a_list[i])
return gcd_
def gcd(a1, a2):
r = 1
while (r > 0):
r = a1 % a2
a1, a2 = a2, r
return a1
n = int(eval(input()))
a_list = [int(i) for i in input().split()]
a_list = sorted(a_list)
ans = euclid(n, a_list)
print(ans) | 16 | 20 | 288 | 392 | n = int(eval(input()))
a = [int(i) for i in input().split()]
def euclid(a, b):
c, d = sorted([a, b])
r = 1
while r > 0:
r = d % c
c, d = r, c
return d
for i in range(n - 1):
if i == 0:
ans = a[0]
ans = euclid(ans, a[i + 1])
print(ans)
| def euclid(n, a_list):
a1, a2 = a_list[0:2]
gcd_ = gcd(a1, a2)
for i in range(2, n):
gcd_ = gcd(gcd_, a_list[i])
return gcd_
def gcd(a1, a2):
r = 1
while r > 0:
r = a1 % a2
a1, a2 = a2, r
return a1
n = int(eval(input()))
a_list = [int(i) for i in input().split()]
a_list = sorted(a_list)
ans = euclid(n, a_list)
print(ans)
| false | 20 | [
"-n = int(eval(input()))",
"-a = [int(i) for i in input().split()]",
"+def euclid(n, a_list):",
"+ a1, a2 = a_list[0:2]",
"+ gcd_ = gcd(a1, a2)",
"+ for i in range(2, n):",
"+ gcd_ = gcd(gcd_, a_list[i])",
"+ return gcd_",
"-def euclid(a, b):",
"- c, d = sorted([a, b])",
"+def gcd(a1, a2):",
"- r = d % c",
"- c, d = r, c",
"- return d",
"+ r = a1 % a2",
"+ a1, a2 = a2, r",
"+ return a1",
"-for i in range(n - 1):",
"- if i == 0:",
"- ans = a[0]",
"- ans = euclid(ans, a[i + 1])",
"+n = int(eval(input()))",
"+a_list = [int(i) for i in input().split()]",
"+a_list = sorted(a_list)",
"+ans = euclid(n, a_list)"
]
| false | 0.058841 | 0.044139 | 1.333077 | [
"s058675784",
"s699129584"
]
|
u380524497 | p03037 | python | s303992412 | s113479590 | 320 | 171 | 3,828 | 3,064 | Accepted | Accepted | 46.56 | n, m = list(map(int, input().split()))
S = [None]*m
L = 0
R = n
for i in range(m):
l, r = list(map(int, input().split()))
L = max(l, L)
R = min(r, R)
ans = R-L+1
if ans < 0:
ans = 0
print(ans) | import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
L, R = 0, n
for i in range(m):
l, r = list(map(int, input().split()))
L = max(l, L)
R = min(r, R)
ans = max(R-L+1, 0)
print(ans) | 14 | 13 | 211 | 220 | n, m = list(map(int, input().split()))
S = [None] * m
L = 0
R = n
for i in range(m):
l, r = list(map(int, input().split()))
L = max(l, L)
R = min(r, R)
ans = R - L + 1
if ans < 0:
ans = 0
print(ans)
| import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
L, R = 0, n
for i in range(m):
l, r = list(map(int, input().split()))
L = max(l, L)
R = min(r, R)
ans = max(R - L + 1, 0)
print(ans)
| false | 7.142857 | [
"+import sys",
"+",
"+input = sys.stdin.readline",
"-S = [None] * m",
"-L = 0",
"-R = n",
"+L, R = 0, n",
"-ans = R - L + 1",
"-if ans < 0:",
"- ans = 0",
"+ans = max(R - L + 1, 0)"
]
| false | 0.086412 | 0.086451 | 0.999543 | [
"s303992412",
"s113479590"
]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.