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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u457901067 | p02996 | python | s131572638 | s728943036 | 1,199 | 992 | 87,384 | 53,656 | Accepted | Accepted | 17.26 | from operator import itemgetter
N = int(eval(input()))
A = []
for i in range(N):
A.append(list(map(int, input().split())))
A.sort(key=itemgetter(1))
now = 0
for a in A:
now += a[0]
if now > a[1]:
print('No')
exit(0)
print('Yes') | from operator import itemgetter
N = int(eval(input()))
A = [[0] * 2 for i in range(N)]
for i in range(N):
A[i] = list(map(int, input().split()))
A.sort(key=itemgetter(1))
now = 0
for a in A:
now += a[0]
if now > a[1]:
print('No')
exit(0)
print('Yes') | 17 | 17 | 262 | 284 | from operator import itemgetter
N = int(eval(input()))
A = []
for i in range(N):
A.append(list(map(int, input().split())))
A.sort(key=itemgetter(1))
now = 0
for a in A:
now += a[0]
if now > a[1]:
print("No")
exit(0)
print("Yes")
| from operator import itemgetter
N = int(eval(input()))
A = [[0] * 2 for i in range(N)]
for i in range(N):
A[i] = list(map(int, input().split()))
A.sort(key=itemgetter(1))
now = 0
for a in A:
now += a[0]
if now > a[1]:
print("No")
exit(0)
print("Yes")
| false | 0 | [
"-A = []",
"+A = [[0] * 2 for i in range(N)]",
"- A.append(list(map(int, input().split())))",
"+ A[i] = list(map(int, input().split()))"
] | false | 0.041701 | 0.038503 | 1.083071 | [
"s131572638",
"s728943036"
] |
u667084803 | p02574 | python | s121273664 | s224727002 | 1,337 | 940 | 127,544 | 134,612 | Accepted | Accepted | 29.69 | from functools import reduce
N = int(eval(input()))
A = list(map(int, input().split()))
# number_to_prime[i]: i の最小の素因数, iが素数ならば0
number_to_prime = [0] * (10**6 + 1)
# preprocess
for i in range(2, 10**6+1):
if not number_to_prime[i]:
j = 1
while j*i <= 10**6:
number_to_prime[j*i] = i
j += 1
def is_pair_copr(A):
import numpy as np
U = 1 << 20
div_p = np.arange(U)
for p in range(2, U):
if div_p[p] != p:
continue
div_p[p::p] = p
used = np.zeros(U, np.bool_)
for x in A:
while x > 1:
p = div_p[x]
while x % p == 0:
x //= p
if used[p]:
return False
used[p] = True
return True
def is_pairwise():
used_primes = set()
pairwise_flag = 1
for a in A:
curr_primes = set()
while a > 1:
prime = number_to_prime[a]
curr_primes.add(prime)
a //= prime
if used_primes & curr_primes:
pairwise_flag = 0
break
else:
used_primes = used_primes | curr_primes
return pairwise_flag
def is_setwise(*A):
import math
from functools import reduce
return reduce(math.gcd, A) == 1
if is_pair_copr(A):
print("pairwise coprime")
elif is_setwise(*A):
print("setwise coprime")
else:
print("not coprime") | from functools import reduce
N = int(eval(input()))
A = list(map(int, input().split()))
# number_to_prime[i]: i の最小の素因数, iが素数ならば0
number_to_prime = [0] * (10**6 + 1)
# preprocess
for i in range(2, 10**6+1):
if not number_to_prime[i]:
j = 1
while j*i <= 10**6:
number_to_prime[j*i] = i
j += 1
def is_pairwise():
used_primes = [False] * (10**6 + 1)
pairwise_flag = 1
for a in A:
curr_primes = set()
while a > 1:
prime = number_to_prime[a]
while a % prime == 0:
a //= prime
if used_primes[prime]:
return False
used_primes[prime] = 1
return True
def is_setwise(*A):
import math
from functools import reduce
return reduce(math.gcd, A) == 1
if is_pairwise():
print("pairwise coprime")
elif is_setwise(*A):
print("setwise coprime")
else:
print("not coprime") | 63 | 41 | 1,440 | 943 | from functools import reduce
N = int(eval(input()))
A = list(map(int, input().split()))
# number_to_prime[i]: i の最小の素因数, iが素数ならば0
number_to_prime = [0] * (10**6 + 1)
# preprocess
for i in range(2, 10**6 + 1):
if not number_to_prime[i]:
j = 1
while j * i <= 10**6:
number_to_prime[j * i] = i
j += 1
def is_pair_copr(A):
import numpy as np
U = 1 << 20
div_p = np.arange(U)
for p in range(2, U):
if div_p[p] != p:
continue
div_p[p::p] = p
used = np.zeros(U, np.bool_)
for x in A:
while x > 1:
p = div_p[x]
while x % p == 0:
x //= p
if used[p]:
return False
used[p] = True
return True
def is_pairwise():
used_primes = set()
pairwise_flag = 1
for a in A:
curr_primes = set()
while a > 1:
prime = number_to_prime[a]
curr_primes.add(prime)
a //= prime
if used_primes & curr_primes:
pairwise_flag = 0
break
else:
used_primes = used_primes | curr_primes
return pairwise_flag
def is_setwise(*A):
import math
from functools import reduce
return reduce(math.gcd, A) == 1
if is_pair_copr(A):
print("pairwise coprime")
elif is_setwise(*A):
print("setwise coprime")
else:
print("not coprime")
| from functools import reduce
N = int(eval(input()))
A = list(map(int, input().split()))
# number_to_prime[i]: i の最小の素因数, iが素数ならば0
number_to_prime = [0] * (10**6 + 1)
# preprocess
for i in range(2, 10**6 + 1):
if not number_to_prime[i]:
j = 1
while j * i <= 10**6:
number_to_prime[j * i] = i
j += 1
def is_pairwise():
used_primes = [False] * (10**6 + 1)
pairwise_flag = 1
for a in A:
curr_primes = set()
while a > 1:
prime = number_to_prime[a]
while a % prime == 0:
a //= prime
if used_primes[prime]:
return False
used_primes[prime] = 1
return True
def is_setwise(*A):
import math
from functools import reduce
return reduce(math.gcd, A) == 1
if is_pairwise():
print("pairwise coprime")
elif is_setwise(*A):
print("setwise coprime")
else:
print("not coprime")
| false | 34.920635 | [
"-def is_pair_copr(A):",
"- import numpy as np",
"-",
"- U = 1 << 20",
"- div_p = np.arange(U)",
"- for p in range(2, U):",
"- if div_p[p] != p:",
"- continue",
"- div_p[p::p] = p",
"- used = np.zeros(U, np.bool_)",
"- for x in A:",
"- while x ... | false | 2.409979 | 1.78714 | 1.348511 | [
"s121273664",
"s224727002"
] |
u033272694 | p02695 | python | s981761864 | s675152444 | 200 | 158 | 69,572 | 70,252 | Accepted | Accepted | 21 | import itertools
N,M,Q = list(map(int,input().split()))
list1 = [None for i in range(Q)]
for i in range(Q):
list1[i] = list(map(int,input().split()))
ans = 0
for x in itertools.combinations_with_replacement(list(range(1,M+1)),N):
score = 0
x1 = sorted(x)
score = sum(y[3] for y in list1 if x1[y[1]-1]-x1[y[0]-1] == y[2])
if score > ans:
ans = score
print(ans) | N,M,Q = list(map(int,input().split()))
list1 = [None for i in range(Q)]
for i in range(Q):
list1[i] = list(map(int,input().split()))
ans = [0]
def dfs(x,n2,m1):
if len(x) == n2:
score = sum(x1[3] for x1 in list1 if x[x1[1]-1]-x[x1[0]-1] == x1[2])
if score > ans[0]:
ans[0] = score
else:
for i in range(1,m1+1,1):
if i >= x[-1]:
dfs(x+[i],n2,m1)
dfs([1],N,M)
print((ans[0])) | 15 | 19 | 383 | 430 | import itertools
N, M, Q = list(map(int, input().split()))
list1 = [None for i in range(Q)]
for i in range(Q):
list1[i] = list(map(int, input().split()))
ans = 0
for x in itertools.combinations_with_replacement(list(range(1, M + 1)), N):
score = 0
x1 = sorted(x)
score = sum(y[3] for y in list1 if x1[y[1] - 1] - x1[y[0] - 1] == y[2])
if score > ans:
ans = score
print(ans)
| N, M, Q = list(map(int, input().split()))
list1 = [None for i in range(Q)]
for i in range(Q):
list1[i] = list(map(int, input().split()))
ans = [0]
def dfs(x, n2, m1):
if len(x) == n2:
score = sum(x1[3] for x1 in list1 if x[x1[1] - 1] - x[x1[0] - 1] == x1[2])
if score > ans[0]:
ans[0] = score
else:
for i in range(1, m1 + 1, 1):
if i >= x[-1]:
dfs(x + [i], n2, m1)
dfs([1], N, M)
print((ans[0]))
| false | 21.052632 | [
"-import itertools",
"-",
"-ans = 0",
"-for x in itertools.combinations_with_replacement(list(range(1, M + 1)), N):",
"- score = 0",
"- x1 = sorted(x)",
"- score = sum(y[3] for y in list1 if x1[y[1] - 1] - x1[y[0] - 1] == y[2])",
"- if score > ans:",
"- ans = score",
"-print(ans... | false | 0.067899 | 0.049608 | 1.368712 | [
"s981761864",
"s675152444"
] |
u017810624 | p03700 | python | s898021069 | s081834185 | 1,985 | 572 | 7,112 | 50,904 | Accepted | Accepted | 71.18 | n,a,b=list(map(int,input().split()))
h=[int(eval(input())) for i in range(n)]
l=1;r=max(h)//b+1
while l!=r:
x=(l+r)//2
ct=0
for i in range(n):
ct+=((a-b-1)+max(0,h[i]-b*x))//(a-b)
if ct>x:
l=x+1
else:
r=x
print(l) | n,a,b=list(map(int,input().split()))
h=[int(eval(input())) for i in range(n)]
l=0;r=max(h)//b+1
while abs(l-r)>1:
x=(l+r)//2
ct=0
for i in range(n):
ct+=((a-b-1)+max(0,h[i]-b*x))//(a-b)
if ct<=x:
r=x
else:
l=x
print(r) | 13 | 13 | 235 | 240 | n, a, b = list(map(int, input().split()))
h = [int(eval(input())) for i in range(n)]
l = 1
r = max(h) // b + 1
while l != r:
x = (l + r) // 2
ct = 0
for i in range(n):
ct += ((a - b - 1) + max(0, h[i] - b * x)) // (a - b)
if ct > x:
l = x + 1
else:
r = x
print(l)
| n, a, b = list(map(int, input().split()))
h = [int(eval(input())) for i in range(n)]
l = 0
r = max(h) // b + 1
while abs(l - r) > 1:
x = (l + r) // 2
ct = 0
for i in range(n):
ct += ((a - b - 1) + max(0, h[i] - b * x)) // (a - b)
if ct <= x:
r = x
else:
l = x
print(r)
| false | 0 | [
"-l = 1",
"+l = 0",
"-while l != r:",
"+while abs(l - r) > 1:",
"- if ct > x:",
"- l = x + 1",
"+ if ct <= x:",
"+ r = x",
"- r = x",
"-print(l)",
"+ l = x",
"+print(r)"
] | false | 0.041016 | 0.052664 | 0.77882 | [
"s898021069",
"s081834185"
] |
u888737393 | p02400 | python | s797580966 | s751614611 | 30 | 20 | 7,456 | 7,556 | Accepted | Accepted | 33.33 | import math
r = float(eval(input()))
s = r*r*math.pi
v = 2*math.pi*r
print(("{:f} {:f}".format(s, v))) | import math
r = float(eval(input()))
s = r**2*math.pi
v = 2*math.pi*r
print(("{:f} {:f}".format(s, v))) | 8 | 8 | 104 | 105 | import math
r = float(eval(input()))
s = r * r * math.pi
v = 2 * math.pi * r
print(("{:f} {:f}".format(s, v)))
| import math
r = float(eval(input()))
s = r**2 * math.pi
v = 2 * math.pi * r
print(("{:f} {:f}".format(s, v)))
| false | 0 | [
"-s = r * r * math.pi",
"+s = r**2 * math.pi"
] | false | 0.067513 | 0.150535 | 0.448489 | [
"s797580966",
"s751614611"
] |
u348805958 | p02632 | python | s119657705 | s174629917 | 916 | 302 | 106,176 | 106,904 | Accepted | Accepted | 67.03 | #!python3
import sys
iim = lambda: list(map(int, sys.stdin.readline().rstrip().split()))
def _cmb(N, mod):
N1 = N + 1
fact = [1] * N1
inv = [1] * N1
for i in range(2, N1):
fact[i] = fact[i-1] * i % mod
inv[N] = pow(fact[N], mod-2, mod)
for i in range(N-1, 1, -1):
inv[i] = inv[i+1]*(i+1) % mod
def cmb(a, b):
return fact[a] * inv[b] * inv[a-b] % mod
return cmb
def resolve():
K = int(eval(input()))
s = eval(input())
ls = len(s) - 1
mod = 10**9+7
cmb = _cmb(ls+K, mod)
ans = 0
for i in range(K+1):
ans += cmb(ls+i, ls) * pow(25, i, mod) * pow(26, K - i, mod)
ans %= mod
print(ans)
if __name__ == "__main__":
resolve()
| #!python3
import sys
iim = lambda: list(map(int, sys.stdin.readline().rstrip().split()))
def _cmb(N, mod):
N1 = N + 1
fact = [1] * N1
inv = [1] * N1
for i in range(2, N1):
fact[i] = fact[i-1] * i % mod
inv[N] = pow(fact[N], mod-2, mod)
for i in range(N-1, 1, -1):
inv[i] = inv[i+1]*(i+1) % mod
def cmb(a, b):
return fact[a] * inv[b] * inv[a-b] % mod
return cmb
def resolve():
K = int(eval(input()))
s = eval(input())
ls = len(s) - 1
mod = 10**9+7
cmb = _cmb(ls+K, mod)
ans = 0
p25 = 1
p26 = pow(26, K, mod)
p26inv = pow(26, mod-2, mod)
for i in range(K+1):
ans += cmb(ls+i, ls) * p25 * p26
ans %= mod
p25 = p25 * 25 % mod
p26 = p26 * p26inv % mod
print(ans)
if __name__ == "__main__":
resolve()
| 37 | 42 | 753 | 864 | #!python3
import sys
iim = lambda: list(map(int, sys.stdin.readline().rstrip().split()))
def _cmb(N, mod):
N1 = N + 1
fact = [1] * N1
inv = [1] * N1
for i in range(2, N1):
fact[i] = fact[i - 1] * i % mod
inv[N] = pow(fact[N], mod - 2, mod)
for i in range(N - 1, 1, -1):
inv[i] = inv[i + 1] * (i + 1) % mod
def cmb(a, b):
return fact[a] * inv[b] * inv[a - b] % mod
return cmb
def resolve():
K = int(eval(input()))
s = eval(input())
ls = len(s) - 1
mod = 10**9 + 7
cmb = _cmb(ls + K, mod)
ans = 0
for i in range(K + 1):
ans += cmb(ls + i, ls) * pow(25, i, mod) * pow(26, K - i, mod)
ans %= mod
print(ans)
if __name__ == "__main__":
resolve()
| #!python3
import sys
iim = lambda: list(map(int, sys.stdin.readline().rstrip().split()))
def _cmb(N, mod):
N1 = N + 1
fact = [1] * N1
inv = [1] * N1
for i in range(2, N1):
fact[i] = fact[i - 1] * i % mod
inv[N] = pow(fact[N], mod - 2, mod)
for i in range(N - 1, 1, -1):
inv[i] = inv[i + 1] * (i + 1) % mod
def cmb(a, b):
return fact[a] * inv[b] * inv[a - b] % mod
return cmb
def resolve():
K = int(eval(input()))
s = eval(input())
ls = len(s) - 1
mod = 10**9 + 7
cmb = _cmb(ls + K, mod)
ans = 0
p25 = 1
p26 = pow(26, K, mod)
p26inv = pow(26, mod - 2, mod)
for i in range(K + 1):
ans += cmb(ls + i, ls) * p25 * p26
ans %= mod
p25 = p25 * 25 % mod
p26 = p26 * p26inv % mod
print(ans)
if __name__ == "__main__":
resolve()
| false | 11.904762 | [
"+ p25 = 1",
"+ p26 = pow(26, K, mod)",
"+ p26inv = pow(26, mod - 2, mod)",
"- ans += cmb(ls + i, ls) * pow(25, i, mod) * pow(26, K - i, mod)",
"+ ans += cmb(ls + i, ls) * p25 * p26",
"+ p25 = p25 * 25 % mod",
"+ p26 = p26 * p26inv % mod"
] | false | 0.134479 | 0.037634 | 3.573361 | [
"s119657705",
"s174629917"
] |
u595375942 | p02766 | python | s661479891 | s206430795 | 25 | 17 | 3,772 | 2,940 | Accepted | Accepted | 32 | import string
n,k=list(map(int,input().split()))
numbers="0123456789"
alphabets=string.ascii_letters
characters=numbers+alphabets
def base_cvt(value, n=2):
tmp=int(value)
result = ''
while tmp >= n:
idx = tmp%n
result = characters[idx] + result
tmp = int(tmp / n)
idx = tmp%n
result = characters[idx] + result
return result
print((len(base_cvt(str(n),k)))) | import math
k, n = list(map(int,input().split()))
ans = math.log(k,n)
if ans == 0:
ans = 1
print((math.ceil(ans))) | 17 | 6 | 413 | 115 | import string
n, k = list(map(int, input().split()))
numbers = "0123456789"
alphabets = string.ascii_letters
characters = numbers + alphabets
def base_cvt(value, n=2):
tmp = int(value)
result = ""
while tmp >= n:
idx = tmp % n
result = characters[idx] + result
tmp = int(tmp / n)
idx = tmp % n
result = characters[idx] + result
return result
print((len(base_cvt(str(n), k))))
| import math
k, n = list(map(int, input().split()))
ans = math.log(k, n)
if ans == 0:
ans = 1
print((math.ceil(ans)))
| false | 64.705882 | [
"-import string",
"+import math",
"-n, k = list(map(int, input().split()))",
"-numbers = \"0123456789\"",
"-alphabets = string.ascii_letters",
"-characters = numbers + alphabets",
"-",
"-",
"-def base_cvt(value, n=2):",
"- tmp = int(value)",
"- result = \"\"",
"- while tmp >= n:",
"... | false | 0.039484 | 0.036542 | 1.080495 | [
"s661479891",
"s206430795"
] |
u919633157 | p03329 | python | s869957008 | s436435254 | 512 | 195 | 6,900 | 41,836 | Accepted | Accepted | 61.91 | n=int(eval(input()))
dp=list(range(n+1))
C=[]
i=1
while n>=6**i:
C.append(6**i)
i+=1
i=1
while n>=9**i:
C.append(9**i)
i+=1
C.sort()
for c in C:
for i in range(n+1):
if i-c<0:continue
dp[i]=min(dp[i],dp[i-c]+1)
print((dp[-1]))
| n=int(eval(input()))
dp=list(range(n+1))
C=[]
i=1
while n>=6**i:
C.append(6**i)
C.append(9**i)
i+=1
i=1
while n>=9**i:
C.append(9**i)
i+=1
C.sort()
for c in C:
for i in range(n+1):
if i-c<0:continue
dp[i]=min(dp[i],dp[i-c]+1)
print((dp[-1]))
| 19 | 20 | 275 | 295 | n = int(eval(input()))
dp = list(range(n + 1))
C = []
i = 1
while n >= 6**i:
C.append(6**i)
i += 1
i = 1
while n >= 9**i:
C.append(9**i)
i += 1
C.sort()
for c in C:
for i in range(n + 1):
if i - c < 0:
continue
dp[i] = min(dp[i], dp[i - c] + 1)
print((dp[-1]))
| n = int(eval(input()))
dp = list(range(n + 1))
C = []
i = 1
while n >= 6**i:
C.append(6**i)
C.append(9**i)
i += 1
i = 1
while n >= 9**i:
C.append(9**i)
i += 1
C.sort()
for c in C:
for i in range(n + 1):
if i - c < 0:
continue
dp[i] = min(dp[i], dp[i - c] + 1)
print((dp[-1]))
| false | 5 | [
"+ C.append(9**i)"
] | false | 0.091465 | 0.228111 | 0.400969 | [
"s869957008",
"s436435254"
] |
u766684188 | p03168 | python | s068058017 | s812953478 | 776 | 325 | 254,472 | 113,116 | Accepted | Accepted | 58.12 | import sys
input=sys.stdin.readline
n=int(eval(input()))
P=tuple(map(float,input().split()))
DP=[[0]*(n+1) for _ in range(n+1)]
DP[0][0]=1
for i in range(1,n+1):
for j in range(i+1):
DP[i][j]=DP[i-1][j]*(1-P[i-1])
if j:
DP[i][j]+=DP[i-1][j-1]*P[i-1]
ans=0
for i in range(n//2+1,n+1):
ans+=DP[-1][i]
print(ans) | import sys
input=sys.stdin.readline
n=int(eval(input()))
P=tuple(map(float,input().split()))
DP=[[0.0]*(n+1) for _ in range(n+1)]
DP[0][0]=1.0
for i in range(1,n+1):
for j in range(i+1):
DP[i][j]=DP[i-1][j]*(1-P[i-1])
if j:
DP[i][j]+=DP[i-1][j-1]*P[i-1]
ans=0.0
for i in range(n//2+1,n+1):
ans+=DP[-1][i]
print(ans) | 15 | 15 | 353 | 359 | import sys
input = sys.stdin.readline
n = int(eval(input()))
P = tuple(map(float, input().split()))
DP = [[0] * (n + 1) for _ in range(n + 1)]
DP[0][0] = 1
for i in range(1, n + 1):
for j in range(i + 1):
DP[i][j] = DP[i - 1][j] * (1 - P[i - 1])
if j:
DP[i][j] += DP[i - 1][j - 1] * P[i - 1]
ans = 0
for i in range(n // 2 + 1, n + 1):
ans += DP[-1][i]
print(ans)
| import sys
input = sys.stdin.readline
n = int(eval(input()))
P = tuple(map(float, input().split()))
DP = [[0.0] * (n + 1) for _ in range(n + 1)]
DP[0][0] = 1.0
for i in range(1, n + 1):
for j in range(i + 1):
DP[i][j] = DP[i - 1][j] * (1 - P[i - 1])
if j:
DP[i][j] += DP[i - 1][j - 1] * P[i - 1]
ans = 0.0
for i in range(n // 2 + 1, n + 1):
ans += DP[-1][i]
print(ans)
| false | 0 | [
"-DP = [[0] * (n + 1) for _ in range(n + 1)]",
"-DP[0][0] = 1",
"+DP = [[0.0] * (n + 1) for _ in range(n + 1)]",
"+DP[0][0] = 1.0",
"-ans = 0",
"+ans = 0.0"
] | false | 0.041213 | 0.039846 | 1.034308 | [
"s068058017",
"s812953478"
] |
u784022244 | p02551 | python | s641194820 | s819866671 | 601 | 551 | 91,048 | 92,944 | Accepted | Accepted | 8.32 | N,Q=list(map(int, input().split()))
class SegmentTree:
def __init__(self, init_value: list, segfunc, ide_ele):
n = len(init_value)
self.N0 = 1 << (n - 1).bit_length()
self.ide_ele = ide_ele
self.data = [ide_ele] * (2 * self.N0)
self.segfunc = segfunc
for i, x in enumerate(init_value):
self.data[i + self.N0 - 1] = x
for i in range(self.N0 - 2, -1, -1):
self.data[i] = self.segfunc(self.data[2 * i + 1], self.data[2 * i + 2])
# k: index , x: value
def update(self, k: int, x):
k += self.N0 - 1
############################
self.data[k] = x
###########################
while k:
k = (k - 1) // 2
self.data[k] = self.segfunc(self.data[k * 2 + 1], self.data[k * 2 + 2])
def get(self, k):
return self.query(k,k+1)
# rightは開区間 l<=x<r
def query(self, left: int, right: int):
L = left + self.N0
R = right + self.N0
res = self.ide_ele
##########################
a, b = [], []
while L < R:
if L & 1:
a.append(L - 1)
L += 1
if R & 1:
R -= 1
b.append(R - 1)
L >>= 1
R >>= 1
for i in a + b[::-1]:
res = self.segfunc(res, self.data[i])
##########################
return res
"""
.
####.
####.
####.
####.
......
"""
#到達したところまでをxに変える
segW=SegmentTree([N-2]*N, min, 10**18)
segH=SegmentTree([N-2]*N, min, 10**18)
ans=(N-2)**2
for i in range(Q):
q,x=list(map(int, input().split()))
if q==1:
res=segW.query(x-1,N)
#now=segH.get(res-1)
segH.update(res, min(x-2, segH.query(res,N)))
ans-=res
else:
res=segH.query(x-1,N)
now=segW.get(res-1)
segW.update(res, min(x-2, segW.query(res,N)))
ans-=res
#print(res, ans, res-1, x-1, q[0])
print(ans) | N,Q=list(map(int, input().split()))
class SegmentTree:
def __init__(self, init_value: list, segfunc, ide_ele):
n = len(init_value)
self.N0 = 1 << (n - 1).bit_length()
self.ide_ele = ide_ele
self.data = [ide_ele] * (2 * self.N0)
self.segfunc = segfunc
for i, x in enumerate(init_value):
self.data[i + self.N0 - 1] = x
for i in range(self.N0 - 2, -1, -1):
self.data[i] = self.segfunc(self.data[2 * i + 1], self.data[2 * i + 2])
# k: index , x: value
def update(self, k: int, x):
k += self.N0 - 1
############################
self.data[k] = x
###########################
while k:
k = (k - 1) // 2
self.data[k] = self.segfunc(self.data[k * 2 + 1], self.data[k * 2 + 2])
def get(self, k):
return self.query(k,k+1)
# rightは開区間 l<=x<r
def query(self, left: int, right: int):
L = left + self.N0
R = right + self.N0
res = self.ide_ele
##########################
a, b = [], []
while L < R:
if L & 1:
a.append(L - 1)
L += 1
if R & 1:
R -= 1
b.append(R - 1)
L >>= 1
R >>= 1
for i in a + b[::-1]:
res = self.segfunc(res, self.data[i])
##########################
return res
"""
.
####.
####.
####.
####.
......
"""
#到達したところまでをxに変える
segW=SegmentTree([N-1]*N, min, float("INF"))
segH=SegmentTree([N-1]*N, min, float("INF"))
ans=(N-2)**2
for i in range(Q):
q,x=list(map(int, input().split()))
if q==1:
res=segW.query(x-1,N)
now=segH.get(res-1)
segH.update(res-1, min(x-1, now))
ans-=max(res-1,0)
else:
res=segH.query(x-1,N)
now=segW.get(res-1)
segW.update(res-1, min(x-1, now))
ans-=max(res-1,0)
#print(res, ans, res-1, x-1, q[0])
print(ans) | 82 | 82 | 2,079 | 2,084 | N, Q = list(map(int, input().split()))
class SegmentTree:
def __init__(self, init_value: list, segfunc, ide_ele):
n = len(init_value)
self.N0 = 1 << (n - 1).bit_length()
self.ide_ele = ide_ele
self.data = [ide_ele] * (2 * self.N0)
self.segfunc = segfunc
for i, x in enumerate(init_value):
self.data[i + self.N0 - 1] = x
for i in range(self.N0 - 2, -1, -1):
self.data[i] = self.segfunc(self.data[2 * i + 1], self.data[2 * i + 2])
# k: index , x: value
def update(self, k: int, x):
k += self.N0 - 1
############################
self.data[k] = x
###########################
while k:
k = (k - 1) // 2
self.data[k] = self.segfunc(self.data[k * 2 + 1], self.data[k * 2 + 2])
def get(self, k):
return self.query(k, k + 1)
# rightは開区間 l<=x<r
def query(self, left: int, right: int):
L = left + self.N0
R = right + self.N0
res = self.ide_ele
##########################
a, b = [], []
while L < R:
if L & 1:
a.append(L - 1)
L += 1
if R & 1:
R -= 1
b.append(R - 1)
L >>= 1
R >>= 1
for i in a + b[::-1]:
res = self.segfunc(res, self.data[i])
##########################
return res
"""
.
####.
####.
####.
####.
......
"""
# 到達したところまでをxに変える
segW = SegmentTree([N - 2] * N, min, 10**18)
segH = SegmentTree([N - 2] * N, min, 10**18)
ans = (N - 2) ** 2
for i in range(Q):
q, x = list(map(int, input().split()))
if q == 1:
res = segW.query(x - 1, N)
# now=segH.get(res-1)
segH.update(res, min(x - 2, segH.query(res, N)))
ans -= res
else:
res = segH.query(x - 1, N)
now = segW.get(res - 1)
segW.update(res, min(x - 2, segW.query(res, N)))
ans -= res
# print(res, ans, res-1, x-1, q[0])
print(ans)
| N, Q = list(map(int, input().split()))
class SegmentTree:
def __init__(self, init_value: list, segfunc, ide_ele):
n = len(init_value)
self.N0 = 1 << (n - 1).bit_length()
self.ide_ele = ide_ele
self.data = [ide_ele] * (2 * self.N0)
self.segfunc = segfunc
for i, x in enumerate(init_value):
self.data[i + self.N0 - 1] = x
for i in range(self.N0 - 2, -1, -1):
self.data[i] = self.segfunc(self.data[2 * i + 1], self.data[2 * i + 2])
# k: index , x: value
def update(self, k: int, x):
k += self.N0 - 1
############################
self.data[k] = x
###########################
while k:
k = (k - 1) // 2
self.data[k] = self.segfunc(self.data[k * 2 + 1], self.data[k * 2 + 2])
def get(self, k):
return self.query(k, k + 1)
# rightは開区間 l<=x<r
def query(self, left: int, right: int):
L = left + self.N0
R = right + self.N0
res = self.ide_ele
##########################
a, b = [], []
while L < R:
if L & 1:
a.append(L - 1)
L += 1
if R & 1:
R -= 1
b.append(R - 1)
L >>= 1
R >>= 1
for i in a + b[::-1]:
res = self.segfunc(res, self.data[i])
##########################
return res
"""
.
####.
####.
####.
####.
......
"""
# 到達したところまでをxに変える
segW = SegmentTree([N - 1] * N, min, float("INF"))
segH = SegmentTree([N - 1] * N, min, float("INF"))
ans = (N - 2) ** 2
for i in range(Q):
q, x = list(map(int, input().split()))
if q == 1:
res = segW.query(x - 1, N)
now = segH.get(res - 1)
segH.update(res - 1, min(x - 1, now))
ans -= max(res - 1, 0)
else:
res = segH.query(x - 1, N)
now = segW.get(res - 1)
segW.update(res - 1, min(x - 1, now))
ans -= max(res - 1, 0)
# print(res, ans, res-1, x-1, q[0])
print(ans)
| false | 0 | [
"-segW = SegmentTree([N - 2] * N, min, 10**18)",
"-segH = SegmentTree([N - 2] * N, min, 10**18)",
"+segW = SegmentTree([N - 1] * N, min, float(\"INF\"))",
"+segH = SegmentTree([N - 1] * N, min, float(\"INF\"))",
"- # now=segH.get(res-1)",
"- segH.update(res, min(x - 2, segH.query(res, N)))",... | false | 0.49726 | 0.467698 | 1.063207 | [
"s641194820",
"s819866671"
] |
u564902833 | p03127 | python | s443499052 | s114223691 | 1,850 | 1,052 | 15,192 | 83,356 | Accepted | Accepted | 43.14 | from queue import PriorityQueue
N = int(eval(input()))
A = list(map(int, input().split()))
q = PriorityQueue()
for a in A:
q.put(-a)
x = -q.get()
while not q.empty():
y = -q.get()
if y == 0:
break
q.put(-(x % y))
x = y
print(x) | from queue import PriorityQueue
N = int(eval(input()))
A = list(map(int, input().split()))
q = PriorityQueue()
for a in A:
q.put(a)
x = q.get()
while not q.empty():
y=q.get()
if y == 0:
continue
q.put(x % y)
x = y
print(x) | 14 | 14 | 256 | 237 | from queue import PriorityQueue
N = int(eval(input()))
A = list(map(int, input().split()))
q = PriorityQueue()
for a in A:
q.put(-a)
x = -q.get()
while not q.empty():
y = -q.get()
if y == 0:
break
q.put(-(x % y))
x = y
print(x)
| from queue import PriorityQueue
N = int(eval(input()))
A = list(map(int, input().split()))
q = PriorityQueue()
for a in A:
q.put(a)
x = q.get()
while not q.empty():
y = q.get()
if y == 0:
continue
q.put(x % y)
x = y
print(x)
| false | 0 | [
"- q.put(-a)",
"-x = -q.get()",
"+ q.put(a)",
"+x = q.get()",
"- y = -q.get()",
"+ y = q.get()",
"- break",
"- q.put(-(x % y))",
"+ continue",
"+ q.put(x % y)"
] | false | 0.048671 | 0.040071 | 1.214618 | [
"s443499052",
"s114223691"
] |
u033606236 | p03834 | python | s589973939 | s523776711 | 165 | 17 | 38,384 | 2,940 | Accepted | Accepted | 89.7 | s = list(input().split(','))
print((" ".join(s))) | print((*input().replace(","," ").split())) | 2 | 1 | 48 | 40 | s = list(input().split(","))
print((" ".join(s)))
| print((*input().replace(",", " ").split()))
| false | 50 | [
"-s = list(input().split(\",\"))",
"-print((\" \".join(s)))",
"+print((*input().replace(\",\", \" \").split()))"
] | false | 0.156299 | 0.045487 | 3.436101 | [
"s589973939",
"s523776711"
] |
u062147869 | p03252 | python | s102673507 | s864258666 | 285 | 184 | 82,876 | 41,968 | Accepted | Accepted | 35.44 | import sys
S=eval(input())
T=eval(input())
N=len(S)
L=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
Ss=[]
Ts=[]
for x in L:
A=set()
B=set()
for i in range(N):
if S[i]==x:
A.add(i)
if T[i]==x:
B.add(i)
Ss.append(A)
Ts.append(B)
for A in Ss:
flag=True
for B in Ts:
if A==B:
flag=False
if flag:
print('No')
sys.exit()
print('Yes') | import sys
S=eval(input())
T=eval(input())
N=len(S)
a=ord('a')
R=[-1]*26
Q=[-1]*26
for i in range(N):
s=ord(S[i])-a
t=ord(T[i])-a
if R[s]!=-1:
if Q[t]!=R[s]:
print('No')
sys.exit()
if Q[t]!=-1:
if R[s]!=Q[t]:
print('No')
sys.exit()
if R[s]==-1:
R[s]=i
if Q[t]==-1:
Q[t]=i
print('Yes') | 26 | 23 | 508 | 400 | import sys
S = eval(input())
T = eval(input())
N = len(S)
L = [
"a",
"b",
"c",
"d",
"e",
"f",
"g",
"h",
"i",
"j",
"k",
"l",
"m",
"n",
"o",
"p",
"q",
"r",
"s",
"t",
"u",
"v",
"w",
"x",
"y",
"z",
]
Ss = []
Ts = []
for x in L:
A = set()
B = set()
for i in range(N):
if S[i] == x:
A.add(i)
if T[i] == x:
B.add(i)
Ss.append(A)
Ts.append(B)
for A in Ss:
flag = True
for B in Ts:
if A == B:
flag = False
if flag:
print("No")
sys.exit()
print("Yes")
| import sys
S = eval(input())
T = eval(input())
N = len(S)
a = ord("a")
R = [-1] * 26
Q = [-1] * 26
for i in range(N):
s = ord(S[i]) - a
t = ord(T[i]) - a
if R[s] != -1:
if Q[t] != R[s]:
print("No")
sys.exit()
if Q[t] != -1:
if R[s] != Q[t]:
print("No")
sys.exit()
if R[s] == -1:
R[s] = i
if Q[t] == -1:
Q[t] = i
print("Yes")
| false | 11.538462 | [
"-L = [",
"- \"a\",",
"- \"b\",",
"- \"c\",",
"- \"d\",",
"- \"e\",",
"- \"f\",",
"- \"g\",",
"- \"h\",",
"- \"i\",",
"- \"j\",",
"- \"k\",",
"- \"l\",",
"- \"m\",",
"- \"n\",",
"- \"o\",",
"- \"p\",",
"- \"q\",",
"- \"r\",",
... | false | 0.036482 | 0.036444 | 1.001063 | [
"s102673507",
"s864258666"
] |
u624475441 | p03291 | python | s120174294 | s570257818 | 102 | 94 | 3,188 | 3,188 | Accepted | Accepted | 7.84 | M = 10**9 + 7
N, A, AB, ABC = 1, 0, 0, 0
idx = {'A': 1, 'B': 2, 'C': 3}
for c in eval(input()):
if c == '?':
N, A, AB, ABC = (N * 3) % M, (A * 3 + N) % M, (AB * 3 + A) % M, (ABC * 3 + AB) % M
else:
dp = [N, A, AB, ABC]
dp[idx[c]] += dp[idx[c] - 1]
N, A, AB, ABC = dp
print((ABC % M)) | M = 10**9 + 7
N, A, AB, ABC = 1, 0, 0, 0
idx = {'A': 1, 'B': 2, 'C': 3}
for c in eval(input()):
if c == '?':
N, A, AB, ABC = (N * 3) % M, (A * 3 + N) % M, (AB * 3 + A) % M, (ABC * 3 + AB) % M
elif c == 'A':
A += N
elif c == 'B':
AB += A
else:
ABC += AB
print((ABC % M)) | 11 | 13 | 325 | 321 | M = 10**9 + 7
N, A, AB, ABC = 1, 0, 0, 0
idx = {"A": 1, "B": 2, "C": 3}
for c in eval(input()):
if c == "?":
N, A, AB, ABC = (
(N * 3) % M,
(A * 3 + N) % M,
(AB * 3 + A) % M,
(ABC * 3 + AB) % M,
)
else:
dp = [N, A, AB, ABC]
dp[idx[c]] += dp[idx[c] - 1]
N, A, AB, ABC = dp
print((ABC % M))
| M = 10**9 + 7
N, A, AB, ABC = 1, 0, 0, 0
idx = {"A": 1, "B": 2, "C": 3}
for c in eval(input()):
if c == "?":
N, A, AB, ABC = (
(N * 3) % M,
(A * 3 + N) % M,
(AB * 3 + A) % M,
(ABC * 3 + AB) % M,
)
elif c == "A":
A += N
elif c == "B":
AB += A
else:
ABC += AB
print((ABC % M))
| false | 15.384615 | [
"+ elif c == \"A\":",
"+ A += N",
"+ elif c == \"B\":",
"+ AB += A",
"- dp = [N, A, AB, ABC]",
"- dp[idx[c]] += dp[idx[c] - 1]",
"- N, A, AB, ABC = dp",
"+ ABC += AB"
] | false | 0.041029 | 0.036558 | 1.122302 | [
"s120174294",
"s570257818"
] |
u297089927 | p02761 | python | s843560723 | s382040835 | 31 | 26 | 9,224 | 9,180 | Accepted | Accepted | 16.13 | n,m=list(map(int,input().split()))
li=[]
if n==1:
score="0"
else:
score="1"+"0"*(n-1)
for i in range(m):
s,c=list(map(int,input().split()))
if n!=1 and s==1 and c==0:
print("-1")
quit()
li.append([s,c])
for j in range(len(li)):
if li[j][0]==s and li[j][1]!=c:
print("-1")
quit()
score=score[:s-1]+str(c)+score[s:]
print((int(score))) | n,m=list(map(int,input().split()))
li=[]
if n==1:
score="0"
else:
score="1"+"0"*(n-1)
for i in range(m):
s,c=list(map(int,input().split()))
if n!=1 and (s,c)==(1,0):
print("-1")
quit()
li.append([s,c])
for j in range(len(li)):
if li[j][0]==s and li[j][1]!=c:
print("-1")
quit()
score=score[:s-1]+str(c)+score[s:]
print((int(score)))
| 18 | 18 | 412 | 412 | n, m = list(map(int, input().split()))
li = []
if n == 1:
score = "0"
else:
score = "1" + "0" * (n - 1)
for i in range(m):
s, c = list(map(int, input().split()))
if n != 1 and s == 1 and c == 0:
print("-1")
quit()
li.append([s, c])
for j in range(len(li)):
if li[j][0] == s and li[j][1] != c:
print("-1")
quit()
score = score[: s - 1] + str(c) + score[s:]
print((int(score)))
| n, m = list(map(int, input().split()))
li = []
if n == 1:
score = "0"
else:
score = "1" + "0" * (n - 1)
for i in range(m):
s, c = list(map(int, input().split()))
if n != 1 and (s, c) == (1, 0):
print("-1")
quit()
li.append([s, c])
for j in range(len(li)):
if li[j][0] == s and li[j][1] != c:
print("-1")
quit()
score = score[: s - 1] + str(c) + score[s:]
print((int(score)))
| false | 0 | [
"- if n != 1 and s == 1 and c == 0:",
"+ if n != 1 and (s, c) == (1, 0):"
] | false | 0.048404 | 0.040775 | 1.1871 | [
"s843560723",
"s382040835"
] |
u564589929 | p03818 | python | s155374351 | s370548247 | 79 | 68 | 22,140 | 22,088 | Accepted | Accepted | 13.92 | import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(eval(input()))
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print((k.join(list(map(str, lst)))))
INF = float('inf')
# from math import ceil, floor, log2
from collections import deque, defaultdict
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np # cumsum
# from bisect import bisect_left, bisect_right
def solve():
N = II()
A = LI()
counter = defaultdict(int)
for a in A:
counter[a] += 1
# print(counter)
odd = 0
ans = N
for key, val in list(counter.items()):
if val > 1:
c = val - 1
# print(val, c, c // 2)
if c % 2 == 1:
odd += 1
ans -= (c // 2) * 2
# print(ans, odd)
ans = ans - (odd // 2) * 2 - (odd % 2) * 2
print(ans)
if __name__ == '__main__':
solve()
| import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(eval(input()))
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print((k.join(list(map(str, lst)))))
INF = float('inf')
# from math import ceil, floor, log2
from collections import deque, defaultdict
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np # cumsum
# from bisect import bisect_left, bisect_right
def solve():
N = II()
A = LI()
counter = defaultdict(int)
for a in A:
counter[a] += 1
# print(counter)
odd = 0
ans = N
for key, val in list(counter.items()):
if val > 1:
c = val - 1
# print(val, c, c // 2)
if c % 2 == 1:
odd += 1
ans -= (c - c % 2)
# print(ans, odd)
ans = ans - (odd // 2) * 2 - (odd % 2) * 2
print(ans)
if __name__ == '__main__':
solve()
| 50 | 50 | 1,481 | 1,480 | import sys
sys.setrecursionlimit(10**9)
# input = sys.stdin.readline ####
def int1(x):
return int(x) - 1
def II():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def MI1():
return list(map(int1, input().split()))
def LI():
return list(map(int, input().split()))
def LI1():
return list(map(int1, input().split()))
def LLI(rows_number):
return [LI() for _ in range(rows_number)]
def MS():
return input().split()
def LS():
return list(eval(input()))
def LLS(rows_number):
return [LS() for _ in range(rows_number)]
def printlist(lst, k=" "):
print((k.join(list(map(str, lst)))))
INF = float("inf")
# from math import ceil, floor, log2
from collections import deque, defaultdict
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np # cumsum
# from bisect import bisect_left, bisect_right
def solve():
N = II()
A = LI()
counter = defaultdict(int)
for a in A:
counter[a] += 1
# print(counter)
odd = 0
ans = N
for key, val in list(counter.items()):
if val > 1:
c = val - 1
# print(val, c, c // 2)
if c % 2 == 1:
odd += 1
ans -= (c // 2) * 2
# print(ans, odd)
ans = ans - (odd // 2) * 2 - (odd % 2) * 2
print(ans)
if __name__ == "__main__":
solve()
| import sys
sys.setrecursionlimit(10**9)
# input = sys.stdin.readline ####
def int1(x):
return int(x) - 1
def II():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def MI1():
return list(map(int1, input().split()))
def LI():
return list(map(int, input().split()))
def LI1():
return list(map(int1, input().split()))
def LLI(rows_number):
return [LI() for _ in range(rows_number)]
def MS():
return input().split()
def LS():
return list(eval(input()))
def LLS(rows_number):
return [LS() for _ in range(rows_number)]
def printlist(lst, k=" "):
print((k.join(list(map(str, lst)))))
INF = float("inf")
# from math import ceil, floor, log2
from collections import deque, defaultdict
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np # cumsum
# from bisect import bisect_left, bisect_right
def solve():
N = II()
A = LI()
counter = defaultdict(int)
for a in A:
counter[a] += 1
# print(counter)
odd = 0
ans = N
for key, val in list(counter.items()):
if val > 1:
c = val - 1
# print(val, c, c // 2)
if c % 2 == 1:
odd += 1
ans -= c - c % 2
# print(ans, odd)
ans = ans - (odd // 2) * 2 - (odd % 2) * 2
print(ans)
if __name__ == "__main__":
solve()
| false | 0 | [
"- ans -= (c // 2) * 2",
"+ ans -= c - c % 2"
] | false | 0.126512 | 0.007396 | 17.106411 | [
"s155374351",
"s370548247"
] |
u934442292 | p02624 | python | s971656604 | s135091626 | 1,522 | 613 | 9,184 | 109,404 | Accepted | Accepted | 59.72 | import sys
#import numba as nb
input = sys.stdin.readline
#@nb.njit("i8(i8)")
def solve(n):
ans = 0
for i in range(1, n + 1):
m = n // i
ans += i * m * (m + 1) // 2
return ans
def main():
N = int(eval(input()))
ans = solve(N)
print(ans)
if __name__ == "__main__":
main()
| import sys
import numba as nb
input = sys.stdin.readline
@nb.njit("i8(i8)")
def g(n):
return n * (n + 1) // 2
@nb.njit("i8(i8)")
def solve(n):
ans = 0
for i in range(1, n + 1):
ans += i * g(n // i)
return ans
def main():
N = int(eval(input()))
ans = solve(N)
print(ans)
if __name__ == "__main__":
main()
| 26 | 30 | 344 | 379 | import sys
# import numba as nb
input = sys.stdin.readline
# @nb.njit("i8(i8)")
def solve(n):
ans = 0
for i in range(1, n + 1):
m = n // i
ans += i * m * (m + 1) // 2
return ans
def main():
N = int(eval(input()))
ans = solve(N)
print(ans)
if __name__ == "__main__":
main()
| import sys
import numba as nb
input = sys.stdin.readline
@nb.njit("i8(i8)")
def g(n):
return n * (n + 1) // 2
@nb.njit("i8(i8)")
def solve(n):
ans = 0
for i in range(1, n + 1):
ans += i * g(n // i)
return ans
def main():
N = int(eval(input()))
ans = solve(N)
print(ans)
if __name__ == "__main__":
main()
| false | 13.333333 | [
"+import numba as nb",
"-# import numba as nb",
"-# @nb.njit(\"i8(i8)\")",
"+",
"+",
"+@nb.njit(\"i8(i8)\")",
"+def g(n):",
"+ return n * (n + 1) // 2",
"+",
"+",
"+@nb.njit(\"i8(i8)\")",
"- m = n // i",
"- ans += i * m * (m + 1) // 2",
"+ ans += i * g(n // i)"
] | false | 0.965127 | 0.042054 | 22.949565 | [
"s971656604",
"s135091626"
] |
u316268279 | p00773 | python | s473072745 | s416582232 | 18,780 | 14,260 | 6,724 | 6,724 | Accepted | Accepted | 24.07 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
while True:
x,y,s = list(map(int,input().split()))
if (x,y,s) == (0,0,0):
break
ans = 0
for i in range(1,s-1):
for j in range(1,s-i + 1):
if i*(100+x)//100 + j*(100+x)//100== s:
ans = max(ans,i*(100+y)//100 + j*(100+y)//100)
print(ans) | #!/usr/bin/env python
# -*- coding: utf-8 -*-
while True:
x,y,s = list(map(int,input().split()))
if (x,y,s) == (0,0,0):
break
ans = 0
for i in range(1,s//2 + 1):
for j in range(1,s-i + 1):
if i*(100+x)//100 + j*(100+x)//100== s:
ans = max(ans,i*(100+y)//100 + j*(100+y)//100)
print(ans) | 13 | 13 | 352 | 357 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
while True:
x, y, s = list(map(int, input().split()))
if (x, y, s) == (0, 0, 0):
break
ans = 0
for i in range(1, s - 1):
for j in range(1, s - i + 1):
if i * (100 + x) // 100 + j * (100 + x) // 100 == s:
ans = max(ans, i * (100 + y) // 100 + j * (100 + y) // 100)
print(ans)
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
while True:
x, y, s = list(map(int, input().split()))
if (x, y, s) == (0, 0, 0):
break
ans = 0
for i in range(1, s // 2 + 1):
for j in range(1, s - i + 1):
if i * (100 + x) // 100 + j * (100 + x) // 100 == s:
ans = max(ans, i * (100 + y) // 100 + j * (100 + y) // 100)
print(ans)
| false | 0 | [
"- for i in range(1, s - 1):",
"+ for i in range(1, s // 2 + 1):"
] | false | 0.769926 | 0.576235 | 1.336131 | [
"s473072745",
"s416582232"
] |
u644907318 | p02767 | python | s459580282 | s873256562 | 169 | 73 | 38,896 | 63,776 | Accepted | Accepted | 56.8 | N = int(eval(input()))
X = list(map(int,input().split()))
cmin = 10**6
for i in range(101):
cnt = 0
for x in X:
cnt += (x-i)**2
cmin = min(cmin,cnt)
print(cmin) | N = int(eval(input()))
X = list(map(int,input().split()))
cmin = 10**6
for i in range(1,101):
cnt = 0
for j in range(N):
cnt += (i-X[j])**2
cmin = min(cmin,cnt)
print(cmin) | 9 | 9 | 182 | 194 | N = int(eval(input()))
X = list(map(int, input().split()))
cmin = 10**6
for i in range(101):
cnt = 0
for x in X:
cnt += (x - i) ** 2
cmin = min(cmin, cnt)
print(cmin)
| N = int(eval(input()))
X = list(map(int, input().split()))
cmin = 10**6
for i in range(1, 101):
cnt = 0
for j in range(N):
cnt += (i - X[j]) ** 2
cmin = min(cmin, cnt)
print(cmin)
| false | 0 | [
"-for i in range(101):",
"+for i in range(1, 101):",
"- for x in X:",
"- cnt += (x - i) ** 2",
"+ for j in range(N):",
"+ cnt += (i - X[j]) ** 2"
] | false | 0.035964 | 0.040874 | 0.879867 | [
"s459580282",
"s873256562"
] |
u488127128 | p03221 | python | s071889874 | s292310775 | 998 | 675 | 54,748 | 31,908 | Accepted | Accepted | 32.36 | n,m = list(map(int,input().split()))
A = [[i,list(map(int,input().split()))] for i in range(m)]
B = []
i = 0
x = 0
for a in sorted(A,key=lambda l:(l[1][0],l[1][1])):
if i==a[1][0]:
x += 1
B.append([a[0],str(a[1][0]).zfill(6)+str(x).zfill(6)])
else:
x = 1
B.append([a[0],str(a[1][0]).zfill(6)+str(x).zfill(6)])
i = a[1][0]
for b in sorted(B):
print((b[1])) | n, m = list(map(int, input().split()))
A = []
B = [''] * m
for i in range(m):
p, y = list(map(int, input().split()))
A.append([p,y,i])
A.sort()
count = 0
i, x = 1, 1
for a in A:
if a[0] == i:
B[a[2]] = '{:06}{:06}'.format(a[0], x)
else:
i, x = a[0], 1
B[a[2]] = '{:06}{:06}'.format(a[0], x)
x += 1
for b in B:
print(b) | 15 | 18 | 413 | 371 | n, m = list(map(int, input().split()))
A = [[i, list(map(int, input().split()))] for i in range(m)]
B = []
i = 0
x = 0
for a in sorted(A, key=lambda l: (l[1][0], l[1][1])):
if i == a[1][0]:
x += 1
B.append([a[0], str(a[1][0]).zfill(6) + str(x).zfill(6)])
else:
x = 1
B.append([a[0], str(a[1][0]).zfill(6) + str(x).zfill(6)])
i = a[1][0]
for b in sorted(B):
print((b[1]))
| n, m = list(map(int, input().split()))
A = []
B = [""] * m
for i in range(m):
p, y = list(map(int, input().split()))
A.append([p, y, i])
A.sort()
count = 0
i, x = 1, 1
for a in A:
if a[0] == i:
B[a[2]] = "{:06}{:06}".format(a[0], x)
else:
i, x = a[0], 1
B[a[2]] = "{:06}{:06}".format(a[0], x)
x += 1
for b in B:
print(b)
| false | 16.666667 | [
"-A = [[i, list(map(int, input().split()))] for i in range(m)]",
"-B = []",
"-i = 0",
"-x = 0",
"-for a in sorted(A, key=lambda l: (l[1][0], l[1][1])):",
"- if i == a[1][0]:",
"- x += 1",
"- B.append([a[0], str(a[1][0]).zfill(6) + str(x).zfill(6)])",
"+A = []",
"+B = [\"\"] * m",
... | false | 0.093664 | 0.05448 | 1.719236 | [
"s071889874",
"s292310775"
] |
u313089641 | p02261 | python | s649515830 | s761365775 | 30 | 20 | 5,612 | 5,612 | Accepted | Accepted | 33.33 | class Card():
def __init__(self, card):
self.card = card
self.mark = card[0]
self.number = card[1]
def __lt__(self, other):
if not isinstance(other, Card):
return NotImplemented
return self.number < other.number
def __eq__(self, other):
if not isinstance(other, Card):
return NotImplemented
return self.mark == other.mark and self.number == other.number
def __repr__(self):
return '{}{}'.format(self.mark, self.number)
def BubbleSort(target):
ls = target.copy()
flag = 1
while flag:
flag = 0
for i in range(len(ls)-1, 0, -1):
if ls[i] < ls[i-1]:
ls[i], ls[i-1] = ls[i-1], ls[i]
flag = 1
print((' '.join(map(str, ls))))
return sorted(ls)
def SelectSort(target):
ls = target.copy()
for i in range(len(ls)):
minj = i
for j in range(i+1, len(ls)):
if ls[j] < ls[minj]:
minj = j
if ls[i] != ls[minj]:
ls[i], ls[minj] = ls[minj], ls[i]
print((' '.join(map(str, ls))))
return sorted(ls)
def judge(original, sorted_list):
if original == sorted_list:
print('Stable')
else:
print('Not stable')
_ = int(eval(input()))
l2 = [Card(i) for i in input().split()]
l2_sort = sorted(l2)
bubble = BubbleSort(l2)
judge(l2_sort, bubble)
select = SelectSort(l2)
judge(l2_sort, select)
| class Card():
def __init__(self, card):
self.card = card
self.mark = card[0]
self.number = card[1]
def __lt__(self, other):
if not isinstance(other, Card):
return NotImplemented
return self.number < other.number
def __repr__(self):
return '{}{}'.format(self.mark, self.number)
def BubbleSort(target):
ls = target.copy()
flag = 1
while flag:
flag = 0
for i in range(len(ls)-1, 0, -1):
if ls[i] < ls[i-1]:
ls[i], ls[i-1] = ls[i-1], ls[i]
flag = 1
print((' '.join(map(str, ls))))
return sorted(ls)
def SelectSort(target):
ls = target.copy()
for i in range(len(ls)):
minj = i
for j in range(i+1, len(ls)):
if ls[j] < ls[minj]:
minj = j
if ls[i] != ls[minj]:
ls[i], ls[minj] = ls[minj], ls[i]
print((' '.join(map(str, ls))))
return sorted(ls)
def judge(original, sorted_list):
if original == sorted_list:
print('Stable')
else:
print('Not stable')
_ = int(eval(input()))
l2 = [Card(i) for i in input().split()]
l2_sort = sorted(l2)
bubble = BubbleSort(l2)
judge(l2_sort, bubble)
select = SelectSort(l2)
judge(l2_sort, select)
| 63 | 58 | 1,541 | 1,357 | class Card:
def __init__(self, card):
self.card = card
self.mark = card[0]
self.number = card[1]
def __lt__(self, other):
if not isinstance(other, Card):
return NotImplemented
return self.number < other.number
def __eq__(self, other):
if not isinstance(other, Card):
return NotImplemented
return self.mark == other.mark and self.number == other.number
def __repr__(self):
return "{}{}".format(self.mark, self.number)
def BubbleSort(target):
ls = target.copy()
flag = 1
while flag:
flag = 0
for i in range(len(ls) - 1, 0, -1):
if ls[i] < ls[i - 1]:
ls[i], ls[i - 1] = ls[i - 1], ls[i]
flag = 1
print((" ".join(map(str, ls))))
return sorted(ls)
def SelectSort(target):
ls = target.copy()
for i in range(len(ls)):
minj = i
for j in range(i + 1, len(ls)):
if ls[j] < ls[minj]:
minj = j
if ls[i] != ls[minj]:
ls[i], ls[minj] = ls[minj], ls[i]
print((" ".join(map(str, ls))))
return sorted(ls)
def judge(original, sorted_list):
if original == sorted_list:
print("Stable")
else:
print("Not stable")
_ = int(eval(input()))
l2 = [Card(i) for i in input().split()]
l2_sort = sorted(l2)
bubble = BubbleSort(l2)
judge(l2_sort, bubble)
select = SelectSort(l2)
judge(l2_sort, select)
| class Card:
def __init__(self, card):
self.card = card
self.mark = card[0]
self.number = card[1]
def __lt__(self, other):
if not isinstance(other, Card):
return NotImplemented
return self.number < other.number
def __repr__(self):
return "{}{}".format(self.mark, self.number)
def BubbleSort(target):
ls = target.copy()
flag = 1
while flag:
flag = 0
for i in range(len(ls) - 1, 0, -1):
if ls[i] < ls[i - 1]:
ls[i], ls[i - 1] = ls[i - 1], ls[i]
flag = 1
print((" ".join(map(str, ls))))
return sorted(ls)
def SelectSort(target):
ls = target.copy()
for i in range(len(ls)):
minj = i
for j in range(i + 1, len(ls)):
if ls[j] < ls[minj]:
minj = j
if ls[i] != ls[minj]:
ls[i], ls[minj] = ls[minj], ls[i]
print((" ".join(map(str, ls))))
return sorted(ls)
def judge(original, sorted_list):
if original == sorted_list:
print("Stable")
else:
print("Not stable")
_ = int(eval(input()))
l2 = [Card(i) for i in input().split()]
l2_sort = sorted(l2)
bubble = BubbleSort(l2)
judge(l2_sort, bubble)
select = SelectSort(l2)
judge(l2_sort, select)
| false | 7.936508 | [
"-",
"- def __eq__(self, other):",
"- if not isinstance(other, Card):",
"- return NotImplemented",
"- return self.mark == other.mark and self.number == other.number"
] | false | 0.037015 | 0.033421 | 1.107518 | [
"s649515830",
"s761365775"
] |
u227438830 | p02389 | python | s020543339 | s437255667 | 30 | 20 | 7,608 | 5,584 | Accepted | Accepted | 33.33 | z = eval(input())
a,b = z.split()
print((int(a)*int(b) ,2*(int(a)+int(b)))) | a, b = list(map(int, input().split()))
print((str(a * b) + " " + str(2 * a + 2 * b)))
| 5 | 2 | 73 | 79 | z = eval(input())
a, b = z.split()
print((int(a) * int(b), 2 * (int(a) + int(b))))
| a, b = list(map(int, input().split()))
print((str(a * b) + " " + str(2 * a + 2 * b)))
| false | 60 | [
"-z = eval(input())",
"-a, b = z.split()",
"-print((int(a) * int(b), 2 * (int(a) + int(b))))",
"+a, b = list(map(int, input().split()))",
"+print((str(a * b) + \" \" + str(2 * a + 2 * b)))"
] | false | 0.051349 | 0.050204 | 1.022801 | [
"s020543339",
"s437255667"
] |
u804711544 | p02683 | python | s972984835 | s114925454 | 124 | 88 | 9,236 | 9,208 | Accepted | Accepted | 29.03 | n, m, x = list(map(int, input().split()))
l = []
for _ in range(n):
temp = list(map(int, input().split()))
l.append(temp)
ans = 99999999
for i in range(2 ** n):
bag = []
for j in range(n): # bit全探索
if (i >> j) & 1:
bag.append(l[j])
skill = [0] * m
enough = [0] * m # 各スキルにつき、xを超えているかどうかを判断
cost = 0
for sub in bag:
cost += sub[0]
for kk in range(1, m+1):
skill[kk - 1] += sub[kk]
if skill[kk - 1] >= x:
enough[kk - 1] += 1
if 0 not in enough: # すべてのスキルがxを超えていたら価格を計算
if ans > cost:
ans = cost # 最低価格を下回っていたら更新
if ans == 99999999: # 初期値からの変更がなければ-1を、そうでなければ最低価格を出力
print((-1))
else:
print(ans) | n, m, x = list(map(int, input().split()))
books = [0] * n
for _ in range(n):
books[_] = list(map(int, input().split()))
ans = -1
ans_list = []
for i in range(1<<n):
money = 0
cleared = 0
level = [0]*m
for j in range(n):
if i>>j & 1:
money += books[j][0]
for book in range(m):
level[book] += books[j][book+1]
level.sort()
if level[0] >= x:
ans_list.append(money)
if len(ans_list) > 0:
ans = min(ans_list)
print(ans) | 29 | 26 | 759 | 526 | n, m, x = list(map(int, input().split()))
l = []
for _ in range(n):
temp = list(map(int, input().split()))
l.append(temp)
ans = 99999999
for i in range(2**n):
bag = []
for j in range(n): # bit全探索
if (i >> j) & 1:
bag.append(l[j])
skill = [0] * m
enough = [0] * m # 各スキルにつき、xを超えているかどうかを判断
cost = 0
for sub in bag:
cost += sub[0]
for kk in range(1, m + 1):
skill[kk - 1] += sub[kk]
if skill[kk - 1] >= x:
enough[kk - 1] += 1
if 0 not in enough: # すべてのスキルがxを超えていたら価格を計算
if ans > cost:
ans = cost # 最低価格を下回っていたら更新
if ans == 99999999: # 初期値からの変更がなければ-1を、そうでなければ最低価格を出力
print((-1))
else:
print(ans)
| n, m, x = list(map(int, input().split()))
books = [0] * n
for _ in range(n):
books[_] = list(map(int, input().split()))
ans = -1
ans_list = []
for i in range(1 << n):
money = 0
cleared = 0
level = [0] * m
for j in range(n):
if i >> j & 1:
money += books[j][0]
for book in range(m):
level[book] += books[j][book + 1]
level.sort()
if level[0] >= x:
ans_list.append(money)
if len(ans_list) > 0:
ans = min(ans_list)
print(ans)
| false | 10.344828 | [
"-l = []",
"+books = [0] * n",
"- temp = list(map(int, input().split()))",
"- l.append(temp)",
"-ans = 99999999",
"-for i in range(2**n):",
"- bag = []",
"- for j in range(n): # bit全探索",
"- if (i >> j) & 1:",
"- bag.append(l[j])",
"- skill = [0] * m",
"- en... | false | 0.039762 | 0.049307 | 0.806412 | [
"s972984835",
"s114925454"
] |
u334712262 | p04017 | python | s859201082 | s517799473 | 1,816 | 1,447 | 96,568 | 96,440 | Accepted | Accepted | 20.32 | # -*- coding: utf-8 -*-
from functools import lru_cache
import sys
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
class Bisect:
def __init__(self, func):
self.__func = func
def bisect_left(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if self.__func(mid) < x:
lo = mid+1
else:
hi = mid
return lo
def bisect_right(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if x < self.__func(mid):
hi = mid
else:
lo = mid+1
return lo
class Doubling():
def __init__(self, N, a0):
self.N = N
self.nt = [[None] * N for i in range(N.bit_length())]
for i, a in enumerate(a0):
self.nt[0][i] = a
for i in range(1, len(self.nt)):
for j in range(N):
if self.nt[i-1][j] is None:
self.nt[i][j] = None
else:
self.nt[i][j] = self.nt[i-1][self.nt[i-1][j]]
def apply(self, i, n):
j = i
for k in range(n.bit_length()):
m = 1 << k
if m & n:
j = self.nt[k][j]
if j is None:
break
return j
def slv(N, X, L, Q, AB):
r = [0]
for x in X:
t = -1
for j in range(r[-1], len(X)):
if X[j] - x <= L:
t = j
else:
break
r.append(t)
r.pop(0)
d = Doubling(N, r)
ans = []
for a, b in AB:
if a > b:
a, b = b, a
a -= 1
b -= 1
bisect = Bisect(lambda x: d.apply(a, x))
i = bisect.bisect_left(b, 0, len(X)+1)
ans.append(i)
return ans
def main():
N = read_int()
X = read_int_n()
L = read_int()
Q = read_int()
AB = [read_int_n() for _ in range(Q)]
print(*slv(N, X, L, Q, AB), sep='\n')
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import sys
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
class Bisect:
def __init__(self, func):
self.__func = func
def bisect_left(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if self.__func(mid) < x:
lo = mid+1
else:
hi = mid
return lo
def bisect_right(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if x < self.__func(mid):
hi = mid
else:
lo = mid+1
return lo
class Doubling():
def __init__(self, N, a0):
self.N = N
self.nt = [[None] * N for i in range(N.bit_length())]
for i, a in enumerate(a0):
self.nt[0][i] = a
for i in range(1, len(self.nt)):
for j in range(N):
if self.nt[i-1][j] is None:
self.nt[i][j] = None
else:
self.nt[i][j] = self.nt[i-1][self.nt[i-1][j]]
def apply(self, i, n):
j = i
for k in range(n.bit_length()):
m = 1 << k
if m & n:
j = self.nt[k][j]
if j is None:
break
return j
def slv(N, X, L, Q, AB):
r = [0]
for x in X:
t = -1
for j in range(r[-1], len(X)):
if X[j] - x <= L:
t = j
else:
break
r.append(t)
r.pop(0)
d = Doubling(N, r)
ans = []
for a, b in AB:
if a > b:
a, b = b, a
a -= 1
b -= 1
bisect = Bisect(lambda x: d.apply(a, x))
i = bisect.bisect_left(b, 0, len(X)+1)
ans.append(i)
return ans
def main():
N = read_int()
X = read_int_n()
L = read_int()
Q = read_int()
AB = [read_int_n() for _ in range(Q)]
print(*slv(N, X, L, Q, AB), sep='\n')
if __name__ == '__main__':
main()
| 102 | 100 | 2,251 | 2,216 | # -*- coding: utf-8 -*-
from functools import lru_cache
import sys
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
class Bisect:
def __init__(self, func):
self.__func = func
def bisect_left(self, x, lo, hi):
while lo < hi:
mid = (lo + hi) // 2
if self.__func(mid) < x:
lo = mid + 1
else:
hi = mid
return lo
def bisect_right(self, x, lo, hi):
while lo < hi:
mid = (lo + hi) // 2
if x < self.__func(mid):
hi = mid
else:
lo = mid + 1
return lo
class Doubling:
def __init__(self, N, a0):
self.N = N
self.nt = [[None] * N for i in range(N.bit_length())]
for i, a in enumerate(a0):
self.nt[0][i] = a
for i in range(1, len(self.nt)):
for j in range(N):
if self.nt[i - 1][j] is None:
self.nt[i][j] = None
else:
self.nt[i][j] = self.nt[i - 1][self.nt[i - 1][j]]
def apply(self, i, n):
j = i
for k in range(n.bit_length()):
m = 1 << k
if m & n:
j = self.nt[k][j]
if j is None:
break
return j
def slv(N, X, L, Q, AB):
r = [0]
for x in X:
t = -1
for j in range(r[-1], len(X)):
if X[j] - x <= L:
t = j
else:
break
r.append(t)
r.pop(0)
d = Doubling(N, r)
ans = []
for a, b in AB:
if a > b:
a, b = b, a
a -= 1
b -= 1
bisect = Bisect(lambda x: d.apply(a, x))
i = bisect.bisect_left(b, 0, len(X) + 1)
ans.append(i)
return ans
def main():
N = read_int()
X = read_int_n()
L = read_int()
Q = read_int()
AB = [read_int_n() for _ in range(Q)]
print(*slv(N, X, L, Q, AB), sep="\n")
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
import sys
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
class Bisect:
def __init__(self, func):
self.__func = func
def bisect_left(self, x, lo, hi):
while lo < hi:
mid = (lo + hi) // 2
if self.__func(mid) < x:
lo = mid + 1
else:
hi = mid
return lo
def bisect_right(self, x, lo, hi):
while lo < hi:
mid = (lo + hi) // 2
if x < self.__func(mid):
hi = mid
else:
lo = mid + 1
return lo
class Doubling:
def __init__(self, N, a0):
self.N = N
self.nt = [[None] * N for i in range(N.bit_length())]
for i, a in enumerate(a0):
self.nt[0][i] = a
for i in range(1, len(self.nt)):
for j in range(N):
if self.nt[i - 1][j] is None:
self.nt[i][j] = None
else:
self.nt[i][j] = self.nt[i - 1][self.nt[i - 1][j]]
def apply(self, i, n):
j = i
for k in range(n.bit_length()):
m = 1 << k
if m & n:
j = self.nt[k][j]
if j is None:
break
return j
def slv(N, X, L, Q, AB):
r = [0]
for x in X:
t = -1
for j in range(r[-1], len(X)):
if X[j] - x <= L:
t = j
else:
break
r.append(t)
r.pop(0)
d = Doubling(N, r)
ans = []
for a, b in AB:
if a > b:
a, b = b, a
a -= 1
b -= 1
bisect = Bisect(lambda x: d.apply(a, x))
i = bisect.bisect_left(b, 0, len(X) + 1)
ans.append(i)
return ans
def main():
N = read_int()
X = read_int_n()
L = read_int()
Q = read_int()
AB = [read_int_n() for _ in range(Q)]
print(*slv(N, X, L, Q, AB), sep="\n")
if __name__ == "__main__":
main()
| false | 1.960784 | [
"-from functools import lru_cache"
] | false | 0.040816 | 0.041423 | 0.985347 | [
"s859201082",
"s517799473"
] |
u077291787 | p03160 | python | s361903412 | s702172749 | 103 | 85 | 14,108 | 14,184 | Accepted | Accepted | 17.48 | # 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() | # dpA - Frog 1
def main():
n = int(eval(input()))
A = tuple(map(int, input().rstrip().split()))
x, y = 0, abs(A[1] - A[0])
for i in range(2, n):
dif1 = x + abs(A[i] - A[i - 2])
dif2 = y + abs(A[i] - A[i - 1])
x, y = y, min(dif1, dif2)
print(y)
if __name__ == "__main__":
main() | 14 | 14 | 383 | 334 | # 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()
| # dpA - Frog 1
def main():
n = int(eval(input()))
A = tuple(map(int, input().rstrip().split()))
x, y = 0, abs(A[1] - A[0])
for i in range(2, n):
dif1 = x + abs(A[i] - A[i - 2])
dif2 = y + abs(A[i] - A[i - 1])
x, y = y, min(dif1, dif2)
print(y)
if __name__ == "__main__":
main()
| false | 0 | [
"-# EduDPA - Frog 1",
"+# dpA - Frog 1",
"- dp = [0, abs(A[1] - A[0])] + [float(\"inf\")] * (n - 2)",
"+ x, y = 0, abs(A[1] - A[0])",
"- 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]))"... | false | 0.038013 | 0.084626 | 0.449192 | [
"s361903412",
"s702172749"
] |
u488127128 | p03474 | python | s950617185 | s607065956 | 22 | 17 | 3,316 | 2,940 | Accepted | Accepted | 22.73 | import re
a,b = list(map(int, input().split()))
s = input().split('-')
print(('Yes' if len(s)==2 and len(s[0])==a else 'No')) | a,b = list(map(int, input().split()))
s = input().split('-')
print(('Yes' if len(s)==2 and len(s[0])==a else 'No')) | 4 | 3 | 120 | 109 | import re
a, b = list(map(int, input().split()))
s = input().split("-")
print(("Yes" if len(s) == 2 and len(s[0]) == a else "No"))
| a, b = list(map(int, input().split()))
s = input().split("-")
print(("Yes" if len(s) == 2 and len(s[0]) == a else "No"))
| false | 25 | [
"-import re",
"-"
] | false | 0.103206 | 0.039199 | 2.63287 | [
"s950617185",
"s607065956"
] |
u923279197 | p02862 | python | s608805488 | s858989219 | 435 | 216 | 38,768 | 54,384 | Accepted | Accepted | 50.34 | def combination_modp(n, r, p): # nCr modpを求める
r = min(n-r, r)
result = 1
for i in range(n, n-r, -1):
result *= i
result %=p
for i in range(1, r+1):
result *= pow(i,p-2,p)
result %= p
return result
x,y = list(map(int,input().split()))
mod = 10**9 + 7
if (x+y)%3 != 0 or 2*y-x <0 or 2*x-y<0:
print((0))
exit()
a = (2*y-x)//3
b = (2*x-y)//3
ans = combination_modp(a+b,a,mod)
print(ans) | def factorial(N,MOD,r=True):
fact = [1]*(N+1)
rfact = [1]*(N+1)
r = 1
for i in range(1,N+1):
fact[i] = r = r * i % MOD
rfact[N] = r = pow(fact[N],MOD-2,MOD)
for i in range(N, 0, -1):
rfact[i-1] = r = r * i % MOD
if r:
return fact,rfact
else:
return fact
mod = 10**9 + 7
fact,rfact = factorial(10**6,mod)
def perm(n,k): #上のfactorialと併用
return fact[n]*rfact[n-k]%mod
def comb(n,k): #上のfactorialと併用
return fact[n]*rfact[k]*rfact[n-k]%mod
x,y = list(map(int,input().split()))
if (x+y)%3:
print((0))
exit()
a = (-x+2*y)//3
b = (2*x-y)//3
print((comb(a+b,a) if a >= 0 and b >= 0 else 0)) | 23 | 29 | 460 | 682 | def combination_modp(n, r, p): # nCr modpを求める
r = min(n - r, r)
result = 1
for i in range(n, n - r, -1):
result *= i
result %= p
for i in range(1, r + 1):
result *= pow(i, p - 2, p)
result %= p
return result
x, y = list(map(int, input().split()))
mod = 10**9 + 7
if (x + y) % 3 != 0 or 2 * y - x < 0 or 2 * x - y < 0:
print((0))
exit()
a = (2 * y - x) // 3
b = (2 * x - y) // 3
ans = combination_modp(a + b, a, mod)
print(ans)
| def factorial(N, MOD, r=True):
fact = [1] * (N + 1)
rfact = [1] * (N + 1)
r = 1
for i in range(1, N + 1):
fact[i] = r = r * i % MOD
rfact[N] = r = pow(fact[N], MOD - 2, MOD)
for i in range(N, 0, -1):
rfact[i - 1] = r = r * i % MOD
if r:
return fact, rfact
else:
return fact
mod = 10**9 + 7
fact, rfact = factorial(10**6, mod)
def perm(n, k): # 上のfactorialと併用
return fact[n] * rfact[n - k] % mod
def comb(n, k): # 上のfactorialと併用
return fact[n] * rfact[k] * rfact[n - k] % mod
x, y = list(map(int, input().split()))
if (x + y) % 3:
print((0))
exit()
a = (-x + 2 * y) // 3
b = (2 * x - y) // 3
print((comb(a + b, a) if a >= 0 and b >= 0 else 0))
| false | 20.689655 | [
"-def combination_modp(n, r, p): # nCr modpを求める",
"- r = min(n - r, r)",
"- result = 1",
"- for i in range(n, n - r, -1):",
"- result *= i",
"- result %= p",
"- for i in range(1, r + 1):",
"- result *= pow(i, p - 2, p)",
"- result %= p",
"- return result... | false | 0.285553 | 4.311658 | 0.066228 | [
"s608805488",
"s858989219"
] |
u526094365 | p02693 | python | s921849915 | s376130230 | 23 | 20 | 9,112 | 9,152 | Accepted | Accepted | 13.04 | K = int(eval(input()))
A, B = list(map(int, input().split()))
cnt = 1
while cnt <= 1000:
if K * cnt >= A and K * cnt <= B:
print('OK')
exit()
cnt += 1
print('NG')
| K = int(eval(input()))
A, B = list(map(int, input().split()))
if A <= (B // K)*K:
print('OK')
else:
print('NG')
| 10 | 7 | 185 | 115 | K = int(eval(input()))
A, B = list(map(int, input().split()))
cnt = 1
while cnt <= 1000:
if K * cnt >= A and K * cnt <= B:
print("OK")
exit()
cnt += 1
print("NG")
| K = int(eval(input()))
A, B = list(map(int, input().split()))
if A <= (B // K) * K:
print("OK")
else:
print("NG")
| false | 30 | [
"-cnt = 1",
"-while cnt <= 1000:",
"- if K * cnt >= A and K * cnt <= B:",
"- print(\"OK\")",
"- exit()",
"- cnt += 1",
"-print(\"NG\")",
"+if A <= (B // K) * K:",
"+ print(\"OK\")",
"+else:",
"+ print(\"NG\")"
] | false | 0.042593 | 0.057039 | 0.746735 | [
"s921849915",
"s376130230"
] |
u670180528 | p03525 | python | s686305317 | s021236485 | 172 | 18 | 38,384 | 3,060 | Accepted | Accepted | 89.53 | n,*d=list(map(int,open(0).read().split()));s=sorted
l=[0]+s([x if i%2 else 24-x for i,x in enumerate(s(d))])+[24]
print((min(j-i for i,j in zip(l,l[1:])))) | _,d=open(0);s=sorted;l=[0]+s([x if i%2else 24-x for i,x in enumerate(s(list(map(int,d.split()))))])+[24];print((min(j-i for i,j in zip(l,l[1:])))) | 3 | 1 | 149 | 138 | n, *d = list(map(int, open(0).read().split()))
s = sorted
l = [0] + s([x if i % 2 else 24 - x for i, x in enumerate(s(d))]) + [24]
print((min(j - i for i, j in zip(l, l[1:]))))
| _, d = open(0)
s = sorted
l = (
[0]
+ s([x if i % 2 else 24 - x for i, x in enumerate(s(list(map(int, d.split()))))])
+ [24]
)
print((min(j - i for i, j in zip(l, l[1:]))))
| false | 66.666667 | [
"-n, *d = list(map(int, open(0).read().split()))",
"+_, d = open(0)",
"-l = [0] + s([x if i % 2 else 24 - x for i, x in enumerate(s(d))]) + [24]",
"+l = (",
"+ [0]",
"+ + s([x if i % 2 else 24 - x for i, x in enumerate(s(list(map(int, d.split()))))])",
"+ + [24]",
"+)"
] | false | 0.121792 | 0.040577 | 3.00146 | [
"s686305317",
"s021236485"
] |
u883621917 | p02695 | python | s001948546 | s536385064 | 1,127 | 301 | 9,128 | 83,820 | Accepted | Accepted | 73.29 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m, q = list(map(int, input().split()))
abcd = [0] * q
for i in range(q):
abcd[i] = list(map(int, input().split()))
def dfs(seq):
if len(seq) == n:
yield seq
return
if len(seq) == 0:
_max = 1
else:
_max = seq[-1]
for i in range(_max, m+1):
new_seq = seq.copy()
new_seq.append(i)
yield from dfs(new_seq)
ans = 0
for s in dfs([]):
tmp_ans = 0
for a, b, c, d in abcd:
if (s[b-1] - s[a-1]) == c:
tmp_ans += d
ans = max(ans, tmp_ans)
print(ans)
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m, q = list(map(int, input().split()))
abcd = [0] * q
for i in range(q):
abcd[i] = list(map(int, input().split()))
def dfs(seq):
if len(seq) == n:
yield seq
return
else:
if not seq:
last = 1
else:
last = seq[-1]
for i in range(last, m+1):
new_seq = seq.copy()
new_seq.append(i)
yield from dfs(new_seq)
ans = 0
for s in dfs([]):
tmp_ans = 0
for a, b, c, d in abcd:
if s[b-1] - s[a-1] == c:
tmp_ans += d
ans = max(ans, tmp_ans)
print(ans)
| 30 | 31 | 645 | 664 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n, m, q = list(map(int, input().split()))
abcd = [0] * q
for i in range(q):
abcd[i] = list(map(int, input().split()))
def dfs(seq):
if len(seq) == n:
yield seq
return
if len(seq) == 0:
_max = 1
else:
_max = seq[-1]
for i in range(_max, m + 1):
new_seq = seq.copy()
new_seq.append(i)
yield from dfs(new_seq)
ans = 0
for s in dfs([]):
tmp_ans = 0
for a, b, c, d in abcd:
if (s[b - 1] - s[a - 1]) == c:
tmp_ans += d
ans = max(ans, tmp_ans)
print(ans)
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n, m, q = list(map(int, input().split()))
abcd = [0] * q
for i in range(q):
abcd[i] = list(map(int, input().split()))
def dfs(seq):
if len(seq) == n:
yield seq
return
else:
if not seq:
last = 1
else:
last = seq[-1]
for i in range(last, m + 1):
new_seq = seq.copy()
new_seq.append(i)
yield from dfs(new_seq)
ans = 0
for s in dfs([]):
tmp_ans = 0
for a, b, c, d in abcd:
if s[b - 1] - s[a - 1] == c:
tmp_ans += d
ans = max(ans, tmp_ans)
print(ans)
| false | 3.225806 | [
"- if len(seq) == 0:",
"- _max = 1",
"- _max = seq[-1]",
"- for i in range(_max, m + 1):",
"+ if not seq:",
"+ last = 1",
"+ else:",
"+ last = seq[-1]",
"+ for i in range(last, m + 1):",
"- if (s[b - 1] - s[a - 1]) == c:",
"+ ... | false | 0.08625 | 0.061218 | 1.408896 | [
"s001948546",
"s536385064"
] |
u970197315 | p03103 | python | s831657393 | s319175684 | 520 | 272 | 20,064 | 28,348 | Accepted | Accepted | 47.69 | n,m=list(map(int,input().split()))
ab=[]
ans=0
for i in range(n):
a,b=list(map(int,input().split()))
ab.append([a,b])
ab.sort()
for a,b in ab:
t=min(b,m)
ans+=t*a
m-=t
print(ans) | n,m=list(map(int,input().split()))
ab=[list(map(int,input().split())) for _ in range(n)]
ab.sort(key=lambda x: x[0])
ans=0
for a,b in ab:
if m>=b:
m-=b
ans+=b*a
else:
ans+=a*m
break
print(ans)
| 12 | 12 | 187 | 218 | n, m = list(map(int, input().split()))
ab = []
ans = 0
for i in range(n):
a, b = list(map(int, input().split()))
ab.append([a, b])
ab.sort()
for a, b in ab:
t = min(b, m)
ans += t * a
m -= t
print(ans)
| n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
ab.sort(key=lambda x: x[0])
ans = 0
for a, b in ab:
if m >= b:
m -= b
ans += b * a
else:
ans += a * m
break
print(ans)
| false | 0 | [
"-ab = []",
"+ab = [list(map(int, input().split())) for _ in range(n)]",
"+ab.sort(key=lambda x: x[0])",
"-for i in range(n):",
"- a, b = list(map(int, input().split()))",
"- ab.append([a, b])",
"-ab.sort()",
"- t = min(b, m)",
"- ans += t * a",
"- m -= t",
"+ if m >= b:",
"+... | false | 0.037622 | 0.037776 | 0.995913 | [
"s831657393",
"s319175684"
] |
u930705402 | p03045 | python | s373796122 | s632328876 | 953 | 695 | 123,640 | 110,208 | Accepted | Accepted | 27.07 | import sys
sys.setrecursionlimit(10**7)
def update(v):
for nv in con[v]:
if seen[nv]:
continue
seen[nv]=1
update(nv)
N,M=list(map(int,input().split()))
seen=[0]*N
con=[[] for i in range(N)]
cnt=[[i,0] for i in range(N)]
for i in range(M):
X,Y,Z=list(map(int,input().split()))
X,Y=X-1,Y-1
con[X].append(Y)
con[Y].append(X)
cnt[X][1]+=1
cnt[Y][1]+=1
cnt.sort(key=lambda x:x[1],reverse=True)
ans=0
for i,a in cnt:
if(seen[i]):
continue
ans+=1
seen[i]=1
update(i)
print(ans) | import sys
sys.setrecursionlimit(10**7)
def update(v):
for nv in G[v]:
if seen[nv]:
continue
seen[nv]=1
update(nv)
N,M=list(map(int,input().split()))
seen=[0]*N
G=[[] for i in range(N)]
for i in range(M):
X,Y,Z=list(map(int,input().split()))
X,Y=X-1,Y-1
G[X].append(Y)
G[Y].append(X)
ans=0
for i in range(N):
if(seen[i]):
continue
ans+=1
seen[i]=1
update(i)
print(ans) | 30 | 26 | 577 | 463 | import sys
sys.setrecursionlimit(10**7)
def update(v):
for nv in con[v]:
if seen[nv]:
continue
seen[nv] = 1
update(nv)
N, M = list(map(int, input().split()))
seen = [0] * N
con = [[] for i in range(N)]
cnt = [[i, 0] for i in range(N)]
for i in range(M):
X, Y, Z = list(map(int, input().split()))
X, Y = X - 1, Y - 1
con[X].append(Y)
con[Y].append(X)
cnt[X][1] += 1
cnt[Y][1] += 1
cnt.sort(key=lambda x: x[1], reverse=True)
ans = 0
for i, a in cnt:
if seen[i]:
continue
ans += 1
seen[i] = 1
update(i)
print(ans)
| import sys
sys.setrecursionlimit(10**7)
def update(v):
for nv in G[v]:
if seen[nv]:
continue
seen[nv] = 1
update(nv)
N, M = list(map(int, input().split()))
seen = [0] * N
G = [[] for i in range(N)]
for i in range(M):
X, Y, Z = list(map(int, input().split()))
X, Y = X - 1, Y - 1
G[X].append(Y)
G[Y].append(X)
ans = 0
for i in range(N):
if seen[i]:
continue
ans += 1
seen[i] = 1
update(i)
print(ans)
| false | 13.333333 | [
"- for nv in con[v]:",
"+ for nv in G[v]:",
"-con = [[] for i in range(N)]",
"-cnt = [[i, 0] for i in range(N)]",
"+G = [[] for i in range(N)]",
"- con[X].append(Y)",
"- con[Y].append(X)",
"- cnt[X][1] += 1",
"- cnt[Y][1] += 1",
"-cnt.sort(key=lambda x: x[1], reverse=True)",
"+... | false | 0.048491 | 0.040216 | 1.205766 | [
"s373796122",
"s632328876"
] |
u956530786 | p02781 | python | s384010475 | s838064554 | 183 | 163 | 38,384 | 38,384 | Accepted | Accepted | 10.93 | s=eval(input())*2;n=len(s)//2;X=[(0,0)]*4
for j in range(n+1):
for k in range(3,-1,-1):
a=int(s[n-j])
X[k]=(X[k][0]+9*X[k-1][0]if k else 1,(X[k][0]+(a-1)*X[k-1][0]+X[k-1][1]if k else 1)if a else X[k][1])
print((X[int(eval(input()))][1])) | s=eval(input())*2;n=len(s)//2;X=[(0,0)]*4
for j in range(n+1):
for k in range(3,-1,-1):
a=int(s[n-j])
X[k]=(X[k][0]+9*X[k-1][0],X[k][0]+(a-1)*X[k-1][0]+X[k-1][1]if a else X[k][1])if k else(1,1)
print((X[int(eval(input()))][1])) | 6 | 6 | 233 | 223 | s = eval(input()) * 2
n = len(s) // 2
X = [(0, 0)] * 4
for j in range(n + 1):
for k in range(3, -1, -1):
a = int(s[n - j])
X[k] = (
X[k][0] + 9 * X[k - 1][0] if k else 1,
(X[k][0] + (a - 1) * X[k - 1][0] + X[k - 1][1] if k else 1)
if a
else X[k][1],
)
print((X[int(eval(input()))][1]))
| s = eval(input()) * 2
n = len(s) // 2
X = [(0, 0)] * 4
for j in range(n + 1):
for k in range(3, -1, -1):
a = int(s[n - j])
X[k] = (
(
X[k][0] + 9 * X[k - 1][0],
X[k][0] + (a - 1) * X[k - 1][0] + X[k - 1][1] if a else X[k][1],
)
if k
else (1, 1)
)
print((X[int(eval(input()))][1]))
| false | 0 | [
"- X[k][0] + 9 * X[k - 1][0] if k else 1,",
"- (X[k][0] + (a - 1) * X[k - 1][0] + X[k - 1][1] if k else 1)",
"- if a",
"- else X[k][1],",
"+ (",
"+ X[k][0] + 9 * X[k - 1][0],",
"+ X[k][0] + (a - 1) * X[k - 1][0] + X[k -... | false | 0.092229 | 0.044926 | 2.052931 | [
"s384010475",
"s838064554"
] |
u037430802 | p02892 | python | s818149285 | s832525468 | 254 | 229 | 41,708 | 42,220 | Accepted | Accepted | 9.84 | """
AtCoder Grand Contest 039 B - Graph Partition /
（１）ある集合V_iに含まれるノードから伸びる辺について、その先の集合がV_i-1かV_i+1になるように分ける
（２）その時の集合の個数の最大値を求める
（１）を言い換えると、あるノードが偶数番の集合に属しているとき、それと繋がっているノードが奇数番号の集合かつ差が１である
→二部グラフ
（２）V_1とV_kがあるとき、少なくともそれらはk本の辺をたどらなければ繋がれないはずなので、最も距離の長い辺（直径）を探す
"""
from collections import deque
N = int(eval(input()))
es = [[] for _ in range(N)]
for i in range(N):
S = eval(input())
for j in range(N):
if S[j] == "1":
es[i].append(j)
q = deque()
q.append(0)
checked = [0] * N
checked[0] = 1
while q:
curr = q.popleft()
for nxt in es[curr]:
# 未探索なので、currと別の集合に設定
if checked[nxt] == 0:
checked[nxt] = checked[curr] * -1
q.append(nxt)
else:
# 探索済みなので、別の集合に属しているか確認し、同じであれば条件を満たさない
if checked[nxt] == checked[curr]:
print((-1))
exit()
# グラフの直径を求める。それぞれのノードをスタート地点として、全ノード間の距離を求めたときの最大距離が直径
ans = 0
for i in range(N):
q = deque()
q.append(i)
dist = [0] * N
# 距離＋１が答えなので、起点を１としておく
dist[i] = 1
while q:
curr = q.popleft()
for nxt in es[curr]:
if dist[nxt] == 0:
dist[nxt] = dist[curr] + 1
q.append(nxt)
ans = max(ans, max(dist))
print(ans) | """
問題の理解が困難
ノードi,jを結ぶ辺があるとき、ノードiは集合aに、ノードjは集合k+1（あるいは逆）に含まれるようにノードを集合に分ける。
その条件を満たす最大の集合の数を求める
1->2
2->3
2->4
みたいなのがあるときに、
・1と2は別の集合（1を集合１、２を集合とする）
・２と３は別の集合（２が集合２なので、３は集合１か３。できるだけ集合の数を多くとりたいので、３とする）
・２と４は別の集合（２が集合２なので、４は集合１か３。上に同じく３とする）
みたいな感じか。
なので、
あるノードから等距離にあるノードを同じ集合にする
という戦略をとれば、集合の数を最大化できる。
で、同じ集合に属するやつらの間に辺がある場合、辺を挟んだノードは別の集合にならなければならないので矛盾するからNG
↑から、木の直径＋１が最大の集合数になるので、double sweepだったか？何かでもとめればよいか？
"""
import heapq
from collections import deque
N = int(eval(input()))
S = [eval(input()) for _ in range(N)]
es = [[] for _ in range(N)]
for i in range(N):
for j in range(i+1,N):
if S[i][j] == "1":
es[i].append(j)
es[j].append(i)
INF = float("inf")
dist = [INF] * N
dist[0] = 0
union = [[] for _ in range(N+1)]
union[0].append(0)
q = []
heapq.heappush(q, (0, 0))
while q:
cost, curr = heapq.heappop(q)
for nxt in es[curr]:
if dist[nxt] <= cost + 1:
continue
dist[nxt] = cost + 1
union[cost+1].append(nxt)
heapq.heappush(q, (dist[nxt], nxt))
for u in union:
if len(u) >= 2:
for i in u:
for j in u:
# 同じ集合なのに辺があると矛盾するのでNG
if S[i][j] == "1":
print((-1))
exit()
ans = 0
for i in range(N):
q = deque()
q.append(i)
dist = [0] * N
# 距離＋１が答えなので、起点を１としておく
dist[i] = 1
while q:
curr = q.popleft()
for nxt in es[curr]:
if dist[nxt] == 0:
dist[nxt] = dist[curr] + 1
q.append(nxt)
ans = max(ans, max(dist))
print(ans) | 61 | 85 | 1,323 | 1,677 | """
AtCoder Grand Contest 039 B - Graph Partition /
（１）ある集合V_iに含まれるノードから伸びる辺について、その先の集合がV_i-1かV_i+1になるように分ける
（２）その時の集合の個数の最大値を求める
（１）を言い換えると、あるノードが偶数番の集合に属しているとき、それと繋がっているノードが奇数番号の集合かつ差が１である
→二部グラフ
（２）V_1とV_kがあるとき、少なくともそれらはk本の辺をたどらなければ繋がれないはずなので、最も距離の長い辺（直径）を探す
"""
from collections import deque
N = int(eval(input()))
es = [[] for _ in range(N)]
for i in range(N):
S = eval(input())
for j in range(N):
if S[j] == "1":
es[i].append(j)
q = deque()
q.append(0)
checked = [0] * N
checked[0] = 1
while q:
curr = q.popleft()
for nxt in es[curr]:
# 未探索なので、currと別の集合に設定
if checked[nxt] == 0:
checked[nxt] = checked[curr] * -1
q.append(nxt)
else:
# 探索済みなので、別の集合に属しているか確認し、同じであれば条件を満たさない
if checked[nxt] == checked[curr]:
print((-1))
exit()
# グラフの直径を求める。それぞれのノードをスタート地点として、全ノード間の距離を求めたときの最大距離が直径
ans = 0
for i in range(N):
q = deque()
q.append(i)
dist = [0] * N
# 距離＋１が答えなので、起点を１としておく
dist[i] = 1
while q:
curr = q.popleft()
for nxt in es[curr]:
if dist[nxt] == 0:
dist[nxt] = dist[curr] + 1
q.append(nxt)
ans = max(ans, max(dist))
print(ans)
| """
問題の理解が困難
ノードi,jを結ぶ辺があるとき、ノードiは集合aに、ノードjは集合k+1（あるいは逆）に含まれるようにノードを集合に分ける。
その条件を満たす最大の集合の数を求める
1->2
2->3
2->4
みたいなのがあるときに、
・1と2は別の集合（1を集合１、２を集合とする）
・２と３は別の集合（２が集合２なので、３は集合１か３。できるだけ集合の数を多くとりたいので、３とする）
・２と４は別の集合（２が集合２なので、４は集合１か３。上に同じく３とする）
みたいな感じか。
なので、
あるノードから等距離にあるノードを同じ集合にする
という戦略をとれば、集合の数を最大化できる。
で、同じ集合に属するやつらの間に辺がある場合、辺を挟んだノードは別の集合にならなければならないので矛盾するからNG
↑から、木の直径＋１が最大の集合数になるので、double sweepだったか？何かでもとめればよいか？
"""
import heapq
from collections import deque
N = int(eval(input()))
S = [eval(input()) for _ in range(N)]
es = [[] for _ in range(N)]
for i in range(N):
for j in range(i + 1, N):
if S[i][j] == "1":
es[i].append(j)
es[j].append(i)
INF = float("inf")
dist = [INF] * N
dist[0] = 0
union = [[] for _ in range(N + 1)]
union[0].append(0)
q = []
heapq.heappush(q, (0, 0))
while q:
cost, curr = heapq.heappop(q)
for nxt in es[curr]:
if dist[nxt] <= cost + 1:
continue
dist[nxt] = cost + 1
union[cost + 1].append(nxt)
heapq.heappush(q, (dist[nxt], nxt))
for u in union:
if len(u) >= 2:
for i in u:
for j in u:
# 同じ集合なのに辺があると矛盾するのでNG
if S[i][j] == "1":
print((-1))
exit()
ans = 0
for i in range(N):
q = deque()
q.append(i)
dist = [0] * N
# 距離＋１が答えなので、起点を１としておく
dist[i] = 1
while q:
curr = q.popleft()
for nxt in es[curr]:
if dist[nxt] == 0:
dist[nxt] = dist[curr] + 1
q.append(nxt)
ans = max(ans, max(dist))
print(ans)
| false | 28.235294 | [
"-AtCoder Grand Contest 039 B - Graph Partition /",
"-（１）ある集合V_iに含まれるノードから伸びる辺について、その先の集合がV_i-1かV_i+1になるように分ける",
"-（２）その時の集合の個数の最大値を求める",
"-（１）を言い換えると、あるノードが偶数番の集合に属しているとき、それと繋がっているノードが奇数番号の集合かつ差が１である",
"- →二部グラフ",
"-（２）V_1とV_kがあるとき、少なくともそれらはk本の辺をたどらなければ繋がれないはずなので、最も距離の長い辺（直径）を探す",
"+問題の理解が困難",
"+ノード... | false | 0.037925 | 0.064519 | 0.587811 | [
"s818149285",
"s832525468"
] |
u504836877 | p03208 | python | s624204512 | s413268606 | 275 | 240 | 11,288 | 7,384 | Accepted | Accepted | 12.73 | N,K = list(map(int, input().split()))
List = []
for i in range(N):
List.append(int(eval(input())))
List.sort()
ans_list = []
for i in range(N-K+1):
ans_list.append(List[i+K-1]-List[i])
ans_list.sort()
print((ans_list[0])) | N,K = list(map(int, input().split()))
H = [int(eval(input())) for _ in range(N)]
ans = 10**12
H.sort()
for i in range(N-K+1):
ans = min(ans, H[i+K-1]-H[i])
print(ans) | 12 | 8 | 232 | 166 | N, K = list(map(int, input().split()))
List = []
for i in range(N):
List.append(int(eval(input())))
List.sort()
ans_list = []
for i in range(N - K + 1):
ans_list.append(List[i + K - 1] - List[i])
ans_list.sort()
print((ans_list[0]))
| N, K = list(map(int, input().split()))
H = [int(eval(input())) for _ in range(N)]
ans = 10**12
H.sort()
for i in range(N - K + 1):
ans = min(ans, H[i + K - 1] - H[i])
print(ans)
| false | 33.333333 | [
"-List = []",
"-for i in range(N):",
"- List.append(int(eval(input())))",
"-List.sort()",
"-ans_list = []",
"+H = [int(eval(input())) for _ in range(N)]",
"+ans = 10**12",
"+H.sort()",
"- ans_list.append(List[i + K - 1] - List[i])",
"-ans_list.sort()",
"-print((ans_list[0]))",
"+ ans ... | false | 0.044239 | 0.040026 | 1.105257 | [
"s624204512",
"s413268606"
] |
u844646164 | p03682 | python | s684395192 | s687401486 | 1,674 | 954 | 63,524 | 135,336 | Accepted | Accepted | 43.01 |
import heapq
n = int(eval(input()))
stw = []
x_list = []
y_list = []
for i in range(n):
x, y = list(map(int, input().split()))
x_list += [[x, i]]
y_list += [[y, i]]
x_list.sort()
y_list.sort()
for i in range(n-1):
stw += [[x_list[i][1], x_list[i+1][1], abs(x_list[i][0]-x_list[i+1][0])]]
for i in range(n-1):
stw += [[y_list[i][1], y_list[i+1][1], abs(y_list[i][0]-y_list[i+1][0])]]
stw.sort(key=lambda x:x[2])
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
def Find_Root(self, x):
if(self.root[x] < 0):
return x
else:
self.root[x] = self.Find_Root(self.root[x])
return self.root[x]
def Unite(self, x, y):
x = self.Find_Root(x)
y = self.Find_Root(y)
if(x == y):
return
if self.root[x] > self.root[y]:
x, y = y, x
self.root[x] += self.root[y]
self.root[y] = x
def isSameGroup(self, x, y):
return self.Find_Root(x) == self.Find_Root(y)
def Count(self, x): # xが属するグループのサイズを返す
return -self.root[self.Find_Root(x)]
def Members(self, x): # xが属するグループに属する要素をリストで返す
return [i for i in range(self.n) if self.Find_Root(i)==self.Find_Root(x)]
def Roots(self): # 全ての根の要素をリストで返す
return [i for i, x in enumerate(self.root) if x < 0]
def Group_Count(self): # グループの数を返す
return len(self.Roots())
def kruskal():
# stw = [[s0, t0, w0], [s1, t1, w1], ..., [sn, tn, wn]]
# stw: s: 始点, t: 終点, w: st間の重み
# stwはwを小さい順にソートされたものとする
# s, tを入れ替えたものはいれなくていい
res = 0
uf = UnionFind(n)
for i in range(len(stw)):
s, t, w = stw[i]
if not uf.isSameGroup(s, t):
uf.Unite(s, t)
res += w
return res
ans = kruskal()
print(ans) | class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
def Find_Root(self, x):
if(self.root[x] < 0):
return x
else:
self.root[x] = self.Find_Root(self.root[x])
return self.root[x]
def Unite(self, x, y):
x = self.Find_Root(x)
y = self.Find_Root(y)
if(x == y):
return
if self.root[x] > self.root[y]:
x, y = y, x
self.root[x] += self.root[y]
self.root[y] = x
def isSameGroup(self, x, y):
return self.Find_Root(x) == self.Find_Root(y)
def Count(self, x): # xが属するグループのサイズを返す
return -self.root[self.Find_Root(x)]
def Members(self, x): # xが属するグループに属する要素をリストで返す
return [i for i in range(self.n) if self.Find_Root(i)==self.Find_Root(x)]
def Roots(self): # 全ての根の要素をリストで返す
return [i for i, x in enumerate(self.root) if x < 0]
def Group_Count(self): # グループの数を返す
return len(self.Roots())
def kruskal(N, stw):
# stw = [[s0, t0, w0], [s1, t1, w1], ..., [sn, tn, wn]]
# stw: s: 始点, t: 終点, w: st間の重み
# stwはwを小さい順にソートされたものとする
# s, tを入れ替えたものはいれなくていい
res = 0
uf = UnionFind(N)
for i in range(len(stw)):
s, t, w = stw[i]
if not uf.isSameGroup(s, t):
uf.Unite(s, t)
res += w
return res
N = int(eval(input()))
ixy = []
for i in range(N):
x, y = list(map(int, input().split()))
ixy += [[i, x, y]]
stw = []
ixy = sorted(ixy, key=lambda x:x[1])
for j in range(N-1):
i, x, y = ixy[j]
ii, xx, yy = ixy[j+1]
stw += [[i, ii, min(abs(x-xx), abs(y-yy))]]
ixy = sorted(ixy, key=lambda x:x[2])
for j in range(N-1):
i, x, y = ixy[j]
ii, xx, yy = ixy[j+1]
stw += [[i, ii, min(abs(x-xx), abs(y-yy))]]
stw = sorted(stw, key=lambda x:x[2])
print((kruskal(N, stw)))
| 69 | 68 | 1,759 | 1,792 | import heapq
n = int(eval(input()))
stw = []
x_list = []
y_list = []
for i in range(n):
x, y = list(map(int, input().split()))
x_list += [[x, i]]
y_list += [[y, i]]
x_list.sort()
y_list.sort()
for i in range(n - 1):
stw += [[x_list[i][1], x_list[i + 1][1], abs(x_list[i][0] - x_list[i + 1][0])]]
for i in range(n - 1):
stw += [[y_list[i][1], y_list[i + 1][1], abs(y_list[i][0] - y_list[i + 1][0])]]
stw.sort(key=lambda x: x[2])
class UnionFind:
def __init__(self, n):
self.n = n
self.root = [-1] * (n + 1)
self.rnk = [0] * (n + 1)
def Find_Root(self, x):
if self.root[x] < 0:
return x
else:
self.root[x] = self.Find_Root(self.root[x])
return self.root[x]
def Unite(self, x, y):
x = self.Find_Root(x)
y = self.Find_Root(y)
if x == y:
return
if self.root[x] > self.root[y]:
x, y = y, x
self.root[x] += self.root[y]
self.root[y] = x
def isSameGroup(self, x, y):
return self.Find_Root(x) == self.Find_Root(y)
def Count(self, x): # xが属するグループのサイズを返す
return -self.root[self.Find_Root(x)]
def Members(self, x): # xが属するグループに属する要素をリストで返す
return [i for i in range(self.n) if self.Find_Root(i) == self.Find_Root(x)]
def Roots(self): # 全ての根の要素をリストで返す
return [i for i, x in enumerate(self.root) if x < 0]
def Group_Count(self): # グループの数を返す
return len(self.Roots())
def kruskal():
# stw = [[s0, t0, w0], [s1, t1, w1], ..., [sn, tn, wn]]
# stw: s: 始点, t: 終点, w: st間の重み
# stwはwを小さい順にソートされたものとする
# s, tを入れ替えたものはいれなくていい
res = 0
uf = UnionFind(n)
for i in range(len(stw)):
s, t, w = stw[i]
if not uf.isSameGroup(s, t):
uf.Unite(s, t)
res += w
return res
ans = kruskal()
print(ans)
| class UnionFind:
def __init__(self, n):
self.n = n
self.root = [-1] * (n + 1)
self.rnk = [0] * (n + 1)
def Find_Root(self, x):
if self.root[x] < 0:
return x
else:
self.root[x] = self.Find_Root(self.root[x])
return self.root[x]
def Unite(self, x, y):
x = self.Find_Root(x)
y = self.Find_Root(y)
if x == y:
return
if self.root[x] > self.root[y]:
x, y = y, x
self.root[x] += self.root[y]
self.root[y] = x
def isSameGroup(self, x, y):
return self.Find_Root(x) == self.Find_Root(y)
def Count(self, x): # xが属するグループのサイズを返す
return -self.root[self.Find_Root(x)]
def Members(self, x): # xが属するグループに属する要素をリストで返す
return [i for i in range(self.n) if self.Find_Root(i) == self.Find_Root(x)]
def Roots(self): # 全ての根の要素をリストで返す
return [i for i, x in enumerate(self.root) if x < 0]
def Group_Count(self): # グループの数を返す
return len(self.Roots())
def kruskal(N, stw):
# stw = [[s0, t0, w0], [s1, t1, w1], ..., [sn, tn, wn]]
# stw: s: 始点, t: 終点, w: st間の重み
# stwはwを小さい順にソートされたものとする
# s, tを入れ替えたものはいれなくていい
res = 0
uf = UnionFind(N)
for i in range(len(stw)):
s, t, w = stw[i]
if not uf.isSameGroup(s, t):
uf.Unite(s, t)
res += w
return res
N = int(eval(input()))
ixy = []
for i in range(N):
x, y = list(map(int, input().split()))
ixy += [[i, x, y]]
stw = []
ixy = sorted(ixy, key=lambda x: x[1])
for j in range(N - 1):
i, x, y = ixy[j]
ii, xx, yy = ixy[j + 1]
stw += [[i, ii, min(abs(x - xx), abs(y - yy))]]
ixy = sorted(ixy, key=lambda x: x[2])
for j in range(N - 1):
i, x, y = ixy[j]
ii, xx, yy = ixy[j + 1]
stw += [[i, ii, min(abs(x - xx), abs(y - yy))]]
stw = sorted(stw, key=lambda x: x[2])
print((kruskal(N, stw)))
| false | 1.449275 | [
"-import heapq",
"-",
"-n = int(eval(input()))",
"-stw = []",
"-x_list = []",
"-y_list = []",
"-for i in range(n):",
"- x, y = list(map(int, input().split()))",
"- x_list += [[x, i]]",
"- y_list += [[y, i]]",
"-x_list.sort()",
"-y_list.sort()",
"-for i in range(n - 1):",
"- stw... | false | 0.085899 | 0.090032 | 0.954089 | [
"s684395192",
"s687401486"
] |
u345966487 | p02732 | python | s152961337 | s730244565 | 408 | 279 | 25,916 | 33,956 | Accepted | Accepted | 31.62 | import sys
import collections
ni = lambda: int(sys.stdin.readline())
nl = lambda: list(map(int, sys.stdin.readline().split()))
N = ni()
A = nl()
counter = collections.Counter(A)
total = 0
for n in list(counter.values()):
total += n * (n - 1) // 2
for i in range(N):
n = counter[A[i]]
k = total - (n * (n - 1) // 2) + (n - 1) * (n - 2) // 2
print(k)
| import sys
from collections import Counter
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
N = ini()
A = inl()
C = Counter(A)
def choose2(k):
return k * (k - 1) // 2
def solve():
total = 0
for x, k in C.items():
total += choose2(k)
for i in range(N):
x = A[i]
a = total - choose2(C[x]) + choose2(C[x] - 1)
print(a)
solve()
| 16 | 31 | 376 | 645 | import sys
import collections
ni = lambda: int(sys.stdin.readline())
nl = lambda: list(map(int, sys.stdin.readline().split()))
N = ni()
A = nl()
counter = collections.Counter(A)
total = 0
for n in list(counter.values()):
total += n * (n - 1) // 2
for i in range(N):
n = counter[A[i]]
k = total - (n * (n - 1) // 2) + (n - 1) * (n - 2) // 2
print(k)
| import sys
from collections import Counter
sys.setrecursionlimit(10**8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
N = ini()
A = inl()
C = Counter(A)
def choose2(k):
return k * (k - 1) // 2
def solve():
total = 0
for x, k in C.items():
total += choose2(k)
for i in range(N):
x = A[i]
a = total - choose2(C[x]) + choose2(C[x] - 1)
print(a)
solve()
| false | 48.387097 | [
"-import collections",
"+from collections import Counter",
"-ni = lambda: int(sys.stdin.readline())",
"-nl = lambda: list(map(int, sys.stdin.readline().split()))",
"-N = ni()",
"-A = nl()",
"-counter = collections.Counter(A)",
"-total = 0",
"-for n in list(counter.values()):",
"- total += n * (... | false | 0.037583 | 0.077638 | 0.484077 | [
"s152961337",
"s730244565"
] |
u930705402 | p03946 | python | s687078995 | s767025385 | 523 | 135 | 87,252 | 84,772 | Accepted | Accepted | 74.19 | class SEGTree:
def __init__(self,n):
self.Unit=0
i=1
while(i<n):
i*=2
self.SEG=[self.Unit]*(2*i-1)
self.d=i
def update(self,i,x):
i+=self.d-1
self.SEG[i]=x
while i>0:
i=(i-1)//2
self.SEG[i]=max(self.SEG[i*2+1],self.SEG[i*2+2])
def find(self,a,b,k,l,r):
if r<=a or b<=l:
return self.Unit
if a<=l and r<=b:
return self.SEG[k]
else:
c1=self.find(a,b,2*k+1,l,(l+r)//2)
c2=self.find(a,b,2*k+2,(l+r)//2,r)
return max(c1,c2)
def get(self,a,b):
return self.find(a,b,0,0,self.d)
N,T=list(map(int,input().split()))
A=list(map(int,input().split()))
SEG=SEGTree(N)
for i in range(N):
SEG.update(i,A[i])
li=[0]*N
for i in range(N):
li[i]=max(li[i],SEG.get(i+1,N)-A[i])
m=max(li)
ans=0
for i in range(N):
if li[i]==m:
ans+=1
print(ans) | N,T=list(map(int,input().split()))
A=list(map(int,input().split()))
ans=0
max_=0
B=[0]*N
for i in reversed(list(range(N))):
B[i]=max(B[i],max_-A[i])
max_=max(max_,A[i])
m=max(B)
print((B.count(m))) | 40 | 10 | 983 | 200 | class SEGTree:
def __init__(self, n):
self.Unit = 0
i = 1
while i < n:
i *= 2
self.SEG = [self.Unit] * (2 * i - 1)
self.d = i
def update(self, i, x):
i += self.d - 1
self.SEG[i] = x
while i > 0:
i = (i - 1) // 2
self.SEG[i] = max(self.SEG[i * 2 + 1], self.SEG[i * 2 + 2])
def find(self, a, b, k, l, r):
if r <= a or b <= l:
return self.Unit
if a <= l and r <= b:
return self.SEG[k]
else:
c1 = self.find(a, b, 2 * k + 1, l, (l + r) // 2)
c2 = self.find(a, b, 2 * k + 2, (l + r) // 2, r)
return max(c1, c2)
def get(self, a, b):
return self.find(a, b, 0, 0, self.d)
N, T = list(map(int, input().split()))
A = list(map(int, input().split()))
SEG = SEGTree(N)
for i in range(N):
SEG.update(i, A[i])
li = [0] * N
for i in range(N):
li[i] = max(li[i], SEG.get(i + 1, N) - A[i])
m = max(li)
ans = 0
for i in range(N):
if li[i] == m:
ans += 1
print(ans)
| N, T = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = 0
max_ = 0
B = [0] * N
for i in reversed(list(range(N))):
B[i] = max(B[i], max_ - A[i])
max_ = max(max_, A[i])
m = max(B)
print((B.count(m)))
| false | 75 | [
"-class SEGTree:",
"- def __init__(self, n):",
"- self.Unit = 0",
"- i = 1",
"- while i < n:",
"- i *= 2",
"- self.SEG = [self.Unit] * (2 * i - 1)",
"- self.d = i",
"-",
"- def update(self, i, x):",
"- i += self.d - 1",
"- self.... | false | 0.039476 | 0.056292 | 0.70127 | [
"s687078995",
"s767025385"
] |
u493520238 | p02616 | python | s341781120 | s955363582 | 559 | 509 | 116,040 | 124,700 | Accepted | Accepted | 8.94 |
def main():
MOD = 10**9+7
n,k = list(map(int, input().split()))
al = list(map(int, input().split()))
al_abs = []
al_nl = []
for a in al:
if a > 0: sig = 1
elif a < 0 :
sig = -1
al_nl.append(a)
else: sig = 0
al_abs.append((abs(a), sig))
if n == k:
ans = 1
for i in range(k):
a = al[i]
ans *= a
ans %= MOD
print(ans)
exit()
al_abs.sort(reverse=True)
n_cnt = 0
last_p = -1
last_n = -1
for i in range(k):
a, sig = al_abs[i]
if sig == -1:
n_cnt+=1
last_n = i
elif sig == 1:
last_p = i
ans = 1
if n_cnt%2 == 0:
for i in range(k):
a, sig = al_abs[i]
ans *= a
ans %= MOD
print(ans)
exit()
next_p = -1
next_n = -1
for i in range(k,n):
a, sig = al_abs[i]
if sig == 1 and next_p == -1:
next_p = i
elif sig == -1 and next_n == -1:
next_n = i
if next_n != -1 and next_p != -1:
break
comp_np = 0
if next_p != -1:
last_n_val = al_abs[last_n][0]
next_p_val = al_abs[next_p][0]
comp_np = next_p_val*(1.0)/last_n_val
comp_pn = 0
if next_n != -1 and last_p != -1:
last_p_val = al_abs[last_p][0]
next_n_val = al_abs[next_n][0]
comp_pn = next_n_val*(1.0)/last_p_val
if comp_np == 0 and comp_pn > 0:
np_or_pn = False
elif comp_pn == 0 and comp_np > 0:
np_or_pn = True
elif comp_np > 0 and comp_pn > 0:
if next_p_val*last_p_val > next_n_val*last_n_val:
np_or_pn = True
else:
np_or_pn = False
elif comp_np == 0 and comp_pn == 0:
if 0 in al:
print((0))
exit()
else:
al_nl.sort(reverse=True)
for i in range(k):
a = al_nl[i]
ans *= (a)
ans %= MOD
print(ans)
exit()
# print(next_p, next_n, comp_np, comp_pn)
for i in range(k):
if np_or_pn and i == last_n:
continue
if (not np_or_pn) and i == last_p:
continue
a, sig = al_abs[i]
ans *= a
ans %= MOD
if np_or_pn:
ans *= next_p_val
ans %= MOD
else:
ans *= next_n_val
ans %= MOD
print(ans)
if __name__ == "__main__":
main() | n, k = list(map(int, input().split()))
al = list(map(int, input().split()))
al_abs = []
al_p = []
al_m = []
zero_cnt = 0
MOD = 10**9+7
if n == 1 and k == 1:
print((al[0]%MOD))
exit()
if n == k:
ans = 1
for a in al:
ans *= a
ans %= MOD
print(ans)
exit()
for a in al:
if a == 0:
zero_cnt+=1
else:
if a > 0:
al_abs.append((abs(a),1))
al_p.append(a)
elif a < 0:
al_abs.append((abs(a),-1))
al_abs.sort(reverse=True)
if len(al_abs) < k:
print((0))
exit()
if len(al_abs) == k:
ans = 1
m_cnt = 0
for a,s in al_abs:
if s == -1: m_cnt += 1
ans *= a
ans %= MOD
if m_cnt%2 == 0:
print(ans)
else:
print((0))
exit()
if not al_p:
if k%2 == 1 and zero_cnt > 0:
print((0))
else:
if k%2 == 1:
al_abs.sort()
ans = 1
for a,s in al_abs[:k]:
ans *= (a*(-1))
ans %= MOD
print(ans)
exit()
val = 1
m_cnt = 0
last_m = 0
last_p = 0
for i in range(k):
v,sig = al_abs[i]
val *= v
val %= MOD
if sig == -1:
m_cnt += 1
last_m = v
else:
last_p = v
if m_cnt %2 == 0:
print(val)
exit()
# minus -> plus
## search next p
next_p = 0
for i in range(k,len(al_abs)):
v,sig = al_abs[i]
if sig == 1:
next_p = v
break
## search next m
next_m = 0
for i in range(k,len(al_abs)):
v,sig = al_abs[i]
if sig == -1:
next_m = v
break
# print(next_m, next_p)
if next_p == 0 and next_m == 0:
print((0))
exit()
# last_m -> next_p
if next_p*last_p >= next_m*last_m or last_p == 0:
# if next_p > 0 and next_m == 0:
ans = 1
skip_flag = False
for i in range(k):
v,sig = al_abs[i]
if not skip_flag and v == last_m and sig == -1:
ans *= next_p
skip_flag = True
else:
ans *= v
# print(ans)
ans %= MOD
print(ans)
exit()
# last_p -> next_m
# if next_p == 0 and next_m > 0:
elif next_p*last_p <= next_m*last_m:
ans = 1
skip_flag = False
for i in range(k):
v,sig = al_abs[i]
if not skip_flag and v == last_p and sig == 1:
ans *= next_m
skip_flag = True
else:
ans *= v
ans %= MOD
print(ans)
exit() | 115 | 140 | 2,642 | 2,540 | def main():
MOD = 10**9 + 7
n, k = list(map(int, input().split()))
al = list(map(int, input().split()))
al_abs = []
al_nl = []
for a in al:
if a > 0:
sig = 1
elif a < 0:
sig = -1
al_nl.append(a)
else:
sig = 0
al_abs.append((abs(a), sig))
if n == k:
ans = 1
for i in range(k):
a = al[i]
ans *= a
ans %= MOD
print(ans)
exit()
al_abs.sort(reverse=True)
n_cnt = 0
last_p = -1
last_n = -1
for i in range(k):
a, sig = al_abs[i]
if sig == -1:
n_cnt += 1
last_n = i
elif sig == 1:
last_p = i
ans = 1
if n_cnt % 2 == 0:
for i in range(k):
a, sig = al_abs[i]
ans *= a
ans %= MOD
print(ans)
exit()
next_p = -1
next_n = -1
for i in range(k, n):
a, sig = al_abs[i]
if sig == 1 and next_p == -1:
next_p = i
elif sig == -1 and next_n == -1:
next_n = i
if next_n != -1 and next_p != -1:
break
comp_np = 0
if next_p != -1:
last_n_val = al_abs[last_n][0]
next_p_val = al_abs[next_p][0]
comp_np = next_p_val * (1.0) / last_n_val
comp_pn = 0
if next_n != -1 and last_p != -1:
last_p_val = al_abs[last_p][0]
next_n_val = al_abs[next_n][0]
comp_pn = next_n_val * (1.0) / last_p_val
if comp_np == 0 and comp_pn > 0:
np_or_pn = False
elif comp_pn == 0 and comp_np > 0:
np_or_pn = True
elif comp_np > 0 and comp_pn > 0:
if next_p_val * last_p_val > next_n_val * last_n_val:
np_or_pn = True
else:
np_or_pn = False
elif comp_np == 0 and comp_pn == 0:
if 0 in al:
print((0))
exit()
else:
al_nl.sort(reverse=True)
for i in range(k):
a = al_nl[i]
ans *= a
ans %= MOD
print(ans)
exit()
# print(next_p, next_n, comp_np, comp_pn)
for i in range(k):
if np_or_pn and i == last_n:
continue
if (not np_or_pn) and i == last_p:
continue
a, sig = al_abs[i]
ans *= a
ans %= MOD
if np_or_pn:
ans *= next_p_val
ans %= MOD
else:
ans *= next_n_val
ans %= MOD
print(ans)
if __name__ == "__main__":
main()
| n, k = list(map(int, input().split()))
al = list(map(int, input().split()))
al_abs = []
al_p = []
al_m = []
zero_cnt = 0
MOD = 10**9 + 7
if n == 1 and k == 1:
print((al[0] % MOD))
exit()
if n == k:
ans = 1
for a in al:
ans *= a
ans %= MOD
print(ans)
exit()
for a in al:
if a == 0:
zero_cnt += 1
else:
if a > 0:
al_abs.append((abs(a), 1))
al_p.append(a)
elif a < 0:
al_abs.append((abs(a), -1))
al_abs.sort(reverse=True)
if len(al_abs) < k:
print((0))
exit()
if len(al_abs) == k:
ans = 1
m_cnt = 0
for a, s in al_abs:
if s == -1:
m_cnt += 1
ans *= a
ans %= MOD
if m_cnt % 2 == 0:
print(ans)
else:
print((0))
exit()
if not al_p:
if k % 2 == 1 and zero_cnt > 0:
print((0))
else:
if k % 2 == 1:
al_abs.sort()
ans = 1
for a, s in al_abs[:k]:
ans *= a * (-1)
ans %= MOD
print(ans)
exit()
val = 1
m_cnt = 0
last_m = 0
last_p = 0
for i in range(k):
v, sig = al_abs[i]
val *= v
val %= MOD
if sig == -1:
m_cnt += 1
last_m = v
else:
last_p = v
if m_cnt % 2 == 0:
print(val)
exit()
# minus -> plus
## search next p
next_p = 0
for i in range(k, len(al_abs)):
v, sig = al_abs[i]
if sig == 1:
next_p = v
break
## search next m
next_m = 0
for i in range(k, len(al_abs)):
v, sig = al_abs[i]
if sig == -1:
next_m = v
break
# print(next_m, next_p)
if next_p == 0 and next_m == 0:
print((0))
exit()
# last_m -> next_p
if next_p * last_p >= next_m * last_m or last_p == 0:
# if next_p > 0 and next_m == 0:
ans = 1
skip_flag = False
for i in range(k):
v, sig = al_abs[i]
if not skip_flag and v == last_m and sig == -1:
ans *= next_p
skip_flag = True
else:
ans *= v
# print(ans)
ans %= MOD
print(ans)
exit()
# last_p -> next_m
# if next_p == 0 and next_m > 0:
elif next_p * last_p <= next_m * last_m:
ans = 1
skip_flag = False
for i in range(k):
v, sig = al_abs[i]
if not skip_flag and v == last_p and sig == 1:
ans *= next_m
skip_flag = True
else:
ans *= v
ans %= MOD
print(ans)
exit()
| false | 17.857143 | [
"-def main():",
"- MOD = 10**9 + 7",
"- n, k = list(map(int, input().split()))",
"- al = list(map(int, input().split()))",
"- al_abs = []",
"- al_nl = []",
"+n, k = list(map(int, input().split()))",
"+al = list(map(int, input().split()))",
"+al_abs = []",
"+al_p = []",
"+al_m = []... | false | 0.038596 | 0.039454 | 0.978273 | [
"s341781120",
"s955363582"
] |
u018679195 | p03239 | python | s036388899 | s234277308 | 20 | 18 | 3,060 | 3,064 | Accepted | Accepted | 10 | def main():
line = eval(input())
n, T = [int(x) for x in line.split()]
lista_tempos = []
lista_custos = []
for i in range(n):
line = eval(input())
c, t = [int(x) for x in line.split()]
if t <= T:
lista_tempos.append(t)
lista_custos.append(c)
if lista_tempos:
print((min(lista_custos)))
else:
print('TLE')
main() | linha = eval(input())
Nvezes,TempoMax = [int(n) for n in linha.split()]
listaCusto = []
listaTempo = []
minimo = 1001
for aux in range(Nvezes):
entrada = eval(input())
custo,tempo = [int(n) for n in entrada.split()]
listaCusto.append(custo)
listaTempo.append(tempo)
indiceMenor = listaCusto.index(min(listaCusto))
#print("indice menor: " , indiceMenor)
#print(listaTempo)
#print(listaCusto)
if listaTempo[indiceMenor] <= TempoMax:
print((min(listaCusto)))
elif listaTempo[indiceMenor] > TempoMax:
for posicao, elemento in enumerate(listaCusto):
if listaCusto[posicao] < minimo and listaTempo[posicao] <= TempoMax:
minimo = listaCusto[posicao]
if minimo == 1001:
print("TLE")
else:
print(minimo) | 16 | 24 | 404 | 772 | def main():
line = eval(input())
n, T = [int(x) for x in line.split()]
lista_tempos = []
lista_custos = []
for i in range(n):
line = eval(input())
c, t = [int(x) for x in line.split()]
if t <= T:
lista_tempos.append(t)
lista_custos.append(c)
if lista_tempos:
print((min(lista_custos)))
else:
print("TLE")
main()
| linha = eval(input())
Nvezes, TempoMax = [int(n) for n in linha.split()]
listaCusto = []
listaTempo = []
minimo = 1001
for aux in range(Nvezes):
entrada = eval(input())
custo, tempo = [int(n) for n in entrada.split()]
listaCusto.append(custo)
listaTempo.append(tempo)
indiceMenor = listaCusto.index(min(listaCusto))
# print("indice menor: " , indiceMenor)
# print(listaTempo)
# print(listaCusto)
if listaTempo[indiceMenor] <= TempoMax:
print((min(listaCusto)))
elif listaTempo[indiceMenor] > TempoMax:
for posicao, elemento in enumerate(listaCusto):
if listaCusto[posicao] < minimo and listaTempo[posicao] <= TempoMax:
minimo = listaCusto[posicao]
if minimo == 1001:
print("TLE")
else:
print(minimo)
| false | 33.333333 | [
"-def main():",
"- line = eval(input())",
"- n, T = [int(x) for x in line.split()]",
"- lista_tempos = []",
"- lista_custos = []",
"- for i in range(n):",
"- line = eval(input())",
"- c, t = [int(x) for x in line.split()]",
"- if t <= T:",
"- lista_te... | false | 0.039143 | 0.039359 | 0.994501 | [
"s036388899",
"s234277308"
] |
u305366205 | p02837 | python | s200270430 | s558134098 | 301 | 236 | 3,064 | 3,064 | Accepted | Accepted | 21.59 | N = int(eval(input()))
a = [[] for i in range(N)]
ans = 0
for i in range(N):
times = int(eval(input()))
for j in range(times):
a[i].append(tuple(map(int, input().split())))
for i in range(2 ** N):
flag2 = False
cnt = 0
flag = [0] * N
for j in range(N):
if (i >> j) & 1:
flag[j] = 1
for k in range(N):
if flag[k] == 1:
for m in range(len(a[k])):
x, y = a[k][m]
if flag[x - 1] != y:
flag2 = True
break
if flag2:
break
if k == N - 1:
cnt = flag.count(1)
ans = max(ans, cnt)
print(ans)
| n = int(eval(input()))
witness = [[] for _ in range(n)]
for i in range(n):
ai = int(eval(input()))
for _ in range(ai):
x, y = list(map(int, input().split()))
witness[i].append((x - 1, y))
ans = 0
for i in range(2 ** n):
f = [False] * n
flag = False
for j in range(n):
if i >> j & 1:
f[j] = True
for j in range(n):
if f[j]:
for x, y in witness[j]:
if f[x] and y == 0 or not f[x] and y == 1:
flag = True
break
if flag:
break
if j == n - 1:
ans = max(ans, f.count(True))
print(ans) | 29 | 26 | 692 | 662 | N = int(eval(input()))
a = [[] for i in range(N)]
ans = 0
for i in range(N):
times = int(eval(input()))
for j in range(times):
a[i].append(tuple(map(int, input().split())))
for i in range(2**N):
flag2 = False
cnt = 0
flag = [0] * N
for j in range(N):
if (i >> j) & 1:
flag[j] = 1
for k in range(N):
if flag[k] == 1:
for m in range(len(a[k])):
x, y = a[k][m]
if flag[x - 1] != y:
flag2 = True
break
if flag2:
break
if k == N - 1:
cnt = flag.count(1)
ans = max(ans, cnt)
print(ans)
| n = int(eval(input()))
witness = [[] for _ in range(n)]
for i in range(n):
ai = int(eval(input()))
for _ in range(ai):
x, y = list(map(int, input().split()))
witness[i].append((x - 1, y))
ans = 0
for i in range(2**n):
f = [False] * n
flag = False
for j in range(n):
if i >> j & 1:
f[j] = True
for j in range(n):
if f[j]:
for x, y in witness[j]:
if f[x] and y == 0 or not f[x] and y == 1:
flag = True
break
if flag:
break
if j == n - 1:
ans = max(ans, f.count(True))
print(ans)
| false | 10.344828 | [
"-N = int(eval(input()))",
"-a = [[] for i in range(N)]",
"+n = int(eval(input()))",
"+witness = [[] for _ in range(n)]",
"+for i in range(n):",
"+ ai = int(eval(input()))",
"+ for _ in range(ai):",
"+ x, y = list(map(int, input().split()))",
"+ witness[i].append((x - 1, y))",
... | false | 0.032622 | 0.035303 | 0.924051 | [
"s200270430",
"s558134098"
] |
u729133443 | p02782 | python | s586556798 | s462635687 | 219 | 200 | 55,660 | 54,128 | Accepted | Accepted | 8.68 | M=10**9+7
r1,c1,r2,c2=list(map(int,input().split()))
n=r2+c2+2
fac=[0]*(n+1)
fac[0]=val=1
for i in range(1,n+1):fac[i]=val=val*i%M
pr1=pow(fac[r1],M-2,M)
pc1=pow(fac[c1],M-2,M)
pr2=pow(fac[r2+1],M-2,M)
pc2=pow(fac[c2+1],M-2,M)
a=fac[r2+c2+2]*pr2*pc2
a-=fac[r2+c1+1]*pr2*pc1
a-=fac[r1+c2+1]*pr1*pc2
a+=fac[r1+c1]*pr1*pc1
print((a%M)) | def main():
M=10**9+7
r1,c1,r2,c2=list(map(int,input().split()))
n=r2+c2+2
fac=[0]*(n+1)
fac[0]=val=1
for i in range(1,n+1):fac[i]=val=val*i%M
pr1=pow(fac[r1],M-2,M)
pc1=pow(fac[c1],M-2,M)
pr2=pow(fac[r2+1],M-2,M)
pc2=pow(fac[c2+1],M-2,M)
a=fac[r2+c2+2]*pr2*pc2
a-=fac[r2+c1+1]*pr2*pc1
a-=fac[r1+c2+1]*pr1*pc2
a+=fac[r1+c1]*pr1*pc1
print((a%M))
main() | 15 | 17 | 338 | 389 | M = 10**9 + 7
r1, c1, r2, c2 = list(map(int, input().split()))
n = r2 + c2 + 2
fac = [0] * (n + 1)
fac[0] = val = 1
for i in range(1, n + 1):
fac[i] = val = val * i % M
pr1 = pow(fac[r1], M - 2, M)
pc1 = pow(fac[c1], M - 2, M)
pr2 = pow(fac[r2 + 1], M - 2, M)
pc2 = pow(fac[c2 + 1], M - 2, M)
a = fac[r2 + c2 + 2] * pr2 * pc2
a -= fac[r2 + c1 + 1] * pr2 * pc1
a -= fac[r1 + c2 + 1] * pr1 * pc2
a += fac[r1 + c1] * pr1 * pc1
print((a % M))
| def main():
M = 10**9 + 7
r1, c1, r2, c2 = list(map(int, input().split()))
n = r2 + c2 + 2
fac = [0] * (n + 1)
fac[0] = val = 1
for i in range(1, n + 1):
fac[i] = val = val * i % M
pr1 = pow(fac[r1], M - 2, M)
pc1 = pow(fac[c1], M - 2, M)
pr2 = pow(fac[r2 + 1], M - 2, M)
pc2 = pow(fac[c2 + 1], M - 2, M)
a = fac[r2 + c2 + 2] * pr2 * pc2
a -= fac[r2 + c1 + 1] * pr2 * pc1
a -= fac[r1 + c2 + 1] * pr1 * pc2
a += fac[r1 + c1] * pr1 * pc1
print((a % M))
main()
| false | 11.764706 | [
"-M = 10**9 + 7",
"-r1, c1, r2, c2 = list(map(int, input().split()))",
"-n = r2 + c2 + 2",
"-fac = [0] * (n + 1)",
"-fac[0] = val = 1",
"-for i in range(1, n + 1):",
"- fac[i] = val = val * i % M",
"-pr1 = pow(fac[r1], M - 2, M)",
"-pc1 = pow(fac[c1], M - 2, M)",
"-pr2 = pow(fac[r2 + 1], M - 2,... | false | 0.04315 | 0.090197 | 0.478393 | [
"s586556798",
"s462635687"
] |
u970197315 | p03775 | python | s793150705 | s305083153 | 634 | 40 | 127,572 | 9,432 | Accepted | Accepted | 93.69 | # ABC057 C - Digits in Multiplication
from itertools import combinations
def factorize(n):
retlist = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
while temp%i==0:
temp //= i
retlist.append(i)
if temp!=1:
retlist.append(temp)
if retlist==[]:
retlist.append(n)
return retlist
N = int(eval(input()))
ans = 10000000
L = []
L = factorize(N)
# print(L)
for i in range(1,len(L)+1):
C = []
C = list(combinations(L,i))
# print(C)
for c in C:
a,b = 1,0
for j in range(len(c)):
a *= c[j]
b = N//a
a = str(a)
b = str(b)
# print('a:',a,'b:',b)
ans = min(ans,max(len(a),len(b)))
print(ans)
| n=int(eval(input()))
ans=10**18
for a in range(1,int(n**0.5)+1):
if n%a==0:
b=n//a
t=max(len(str(a)),len(str(b)))
ans=min(ans,t)
print(ans)
| 40 | 9 | 813 | 157 | # ABC057 C - Digits in Multiplication
from itertools import combinations
def factorize(n):
retlist = []
temp = n
for i in range(2, int(-(-(n**0.5) // 1)) + 1):
if temp % i == 0:
while temp % i == 0:
temp //= i
retlist.append(i)
if temp != 1:
retlist.append(temp)
if retlist == []:
retlist.append(n)
return retlist
N = int(eval(input()))
ans = 10000000
L = []
L = factorize(N)
# print(L)
for i in range(1, len(L) + 1):
C = []
C = list(combinations(L, i))
# print(C)
for c in C:
a, b = 1, 0
for j in range(len(c)):
a *= c[j]
b = N // a
a = str(a)
b = str(b)
# print('a:',a,'b:',b)
ans = min(ans, max(len(a), len(b)))
print(ans)
| n = int(eval(input()))
ans = 10**18
for a in range(1, int(n**0.5) + 1):
if n % a == 0:
b = n // a
t = max(len(str(a)), len(str(b)))
ans = min(ans, t)
print(ans)
| false | 77.5 | [
"-# ABC057 C - Digits in Multiplication",
"-from itertools import combinations",
"-",
"-",
"-def factorize(n):",
"- retlist = []",
"- temp = n",
"- for i in range(2, int(-(-(n**0.5) // 1)) + 1):",
"- if temp % i == 0:",
"- while temp % i == 0:",
"- temp ... | false | 0.085659 | 0.039502 | 2.168478 | [
"s793150705",
"s305083153"
] |
u969236097 | p02756 | python | s038596062 | s625254640 | 1,366 | 1,002 | 4,536 | 18,516 | Accepted | Accepted | 26.65 | import sys
s = eval(input())
q = int(eval(input()))
a = ['', '']
r = 0
for i in range(q):
l = sys.stdin.readline()
if l[0] == '1':
r ^= 1
else:
t, f, c = l.split()
a[0 if f == '21'[r] else 1] += c
if r:
print((a[0][::-1] + s[::-1] + a[1]))
else:
print((a[1][::-1] + s + a[0])) | import sys
i = sys.stdin.read().split('\n')[:-1]
s = i[0]
a = ['', '']
r = 0
for l in i[2:]:
if l[0] == '1':
r ^= 1
else:
t, f, c = l.split()
a[0 if f == '21'[r] else 1] += c
if r:
print((a[0][::-1] + s[::-1] + a[1]))
else:
print((a[1][::-1] + s + a[0])) | 16 | 15 | 320 | 305 | import sys
s = eval(input())
q = int(eval(input()))
a = ["", ""]
r = 0
for i in range(q):
l = sys.stdin.readline()
if l[0] == "1":
r ^= 1
else:
t, f, c = l.split()
a[0 if f == "21"[r] else 1] += c
if r:
print((a[0][::-1] + s[::-1] + a[1]))
else:
print((a[1][::-1] + s + a[0]))
| import sys
i = sys.stdin.read().split("\n")[:-1]
s = i[0]
a = ["", ""]
r = 0
for l in i[2:]:
if l[0] == "1":
r ^= 1
else:
t, f, c = l.split()
a[0 if f == "21"[r] else 1] += c
if r:
print((a[0][::-1] + s[::-1] + a[1]))
else:
print((a[1][::-1] + s + a[0]))
| false | 6.25 | [
"-s = eval(input())",
"-q = int(eval(input()))",
"+i = sys.stdin.read().split(\"\\n\")[:-1]",
"+s = i[0]",
"-for i in range(q):",
"- l = sys.stdin.readline()",
"+for l in i[2:]:"
] | false | 0.036302 | 0.037087 | 0.978837 | [
"s038596062",
"s625254640"
] |
u488401358 | p03212 | python | s237521538 | s136973649 | 523 | 256 | 3,192 | 46,168 | Accepted | Accepted | 51.05 | def function(n):
digit=len(str(n))
N=str(n)
if digit<3:
return 0
else:
k=int(N[0])
m=int(N[1])
if k<3:
return function(10**(digit-1)-1)
elif k==3 and m>0:
return function(10**(digit-1)-1)+function(n%(10**(digit-1)))-function(10**(digit-2))+subfunction(5,7,n%(10**(digit-1)))
elif k==3 and m==0:
return function(10**(digit-1)-1)
elif k==4:
return function(4*(10**(digit-1))-1)
elif k==5 and m>0:
return function(4*(10**(digit-1))-1)+function(n%(10**(digit-1)))-function(10**(digit-2))+subfunction(3,7,n%(10**(digit-1)))
elif k==5 and m==0:
return function(4*(10**(digit-1))-1)
elif k==6:
return function(6*(10**(digit-1))-1)
elif k==7 and m>0:
return function(6*(10**(digit-1))-1)+function(n%(10**(digit-1)))-function(10**(digit-2))+subfunction(3,5,n%(10**(digit-1)))
elif k==7 and m==0:
return function(6*(10**(digit-1))-1)
else:
return function(8*(10**(digit-1))-1)
def subfunction(a,b,n):
digit=len(str(n))
N=str(n)
k=int(N[0])
if digit<2:
return 0
else:
if k<a:
return 0
elif k==a:
if n%(10**(digit-1))<b*(10**(digit-1)-1)//9:
s=0
else:
s=1
return subfunction(a,b,n%(10**(digit-1)))+s
elif a<k<b:
return subfunction(a,b,(a+1)*(10**(digit-1))-1)
elif k==b:
if n%(10**(digit-1))<a*(10**(digit-1)-1)//9:
s=0
else:
s=1
return subfunction(a,b,(a+1)*(10**(digit-1))-1)+subfunction(a,b,n%(10**(digit-1)))+s
else:
return subfunction(a,b,(b+1)*(10**(digit-1))-1)
N=int(eval(input()))
print((function(N))) | import heapq
N=int(eval(input()))
count=0
que=[3,5,7]
heapq.heapify(que)
ans=[]
while True:
x=heapq.heappop(que)
if N>=x:
count+=1
ans.append(x)
else:
break
heapq.heappush(que,10*x+3)
heapq.heappush(que,10*x+5)
heapq.heappush(que,10*x+7)
count=0
check=["3","5","7"]
for i in ans:
for j in check:
if str(i).count(j)==0:
break
else:
count+=1
print(count) | 57 | 28 | 1,928 | 460 | def function(n):
digit = len(str(n))
N = str(n)
if digit < 3:
return 0
else:
k = int(N[0])
m = int(N[1])
if k < 3:
return function(10 ** (digit - 1) - 1)
elif k == 3 and m > 0:
return (
function(10 ** (digit - 1) - 1)
+ function(n % (10 ** (digit - 1)))
- function(10 ** (digit - 2))
+ subfunction(5, 7, n % (10 ** (digit - 1)))
)
elif k == 3 and m == 0:
return function(10 ** (digit - 1) - 1)
elif k == 4:
return function(4 * (10 ** (digit - 1)) - 1)
elif k == 5 and m > 0:
return (
function(4 * (10 ** (digit - 1)) - 1)
+ function(n % (10 ** (digit - 1)))
- function(10 ** (digit - 2))
+ subfunction(3, 7, n % (10 ** (digit - 1)))
)
elif k == 5 and m == 0:
return function(4 * (10 ** (digit - 1)) - 1)
elif k == 6:
return function(6 * (10 ** (digit - 1)) - 1)
elif k == 7 and m > 0:
return (
function(6 * (10 ** (digit - 1)) - 1)
+ function(n % (10 ** (digit - 1)))
- function(10 ** (digit - 2))
+ subfunction(3, 5, n % (10 ** (digit - 1)))
)
elif k == 7 and m == 0:
return function(6 * (10 ** (digit - 1)) - 1)
else:
return function(8 * (10 ** (digit - 1)) - 1)
def subfunction(a, b, n):
digit = len(str(n))
N = str(n)
k = int(N[0])
if digit < 2:
return 0
else:
if k < a:
return 0
elif k == a:
if n % (10 ** (digit - 1)) < b * (10 ** (digit - 1) - 1) // 9:
s = 0
else:
s = 1
return subfunction(a, b, n % (10 ** (digit - 1))) + s
elif a < k < b:
return subfunction(a, b, (a + 1) * (10 ** (digit - 1)) - 1)
elif k == b:
if n % (10 ** (digit - 1)) < a * (10 ** (digit - 1) - 1) // 9:
s = 0
else:
s = 1
return (
subfunction(a, b, (a + 1) * (10 ** (digit - 1)) - 1)
+ subfunction(a, b, n % (10 ** (digit - 1)))
+ s
)
else:
return subfunction(a, b, (b + 1) * (10 ** (digit - 1)) - 1)
N = int(eval(input()))
print((function(N)))
| import heapq
N = int(eval(input()))
count = 0
que = [3, 5, 7]
heapq.heapify(que)
ans = []
while True:
x = heapq.heappop(que)
if N >= x:
count += 1
ans.append(x)
else:
break
heapq.heappush(que, 10 * x + 3)
heapq.heappush(que, 10 * x + 5)
heapq.heappush(que, 10 * x + 7)
count = 0
check = ["3", "5", "7"]
for i in ans:
for j in check:
if str(i).count(j) == 0:
break
else:
count += 1
print(count)
| false | 50.877193 | [
"-def function(n):",
"- digit = len(str(n))",
"- N = str(n)",
"- if digit < 3:",
"- return 0",
"- else:",
"- k = int(N[0])",
"- m = int(N[1])",
"- if k < 3:",
"- return function(10 ** (digit - 1) - 1)",
"- elif k == 3 and m > 0:",
"- ... | false | 0.177573 | 0.07211 | 2.462545 | [
"s237521538",
"s136973649"
] |
u970899068 | p02733 | python | s618195763 | s356606735 | 377 | 339 | 46,300 | 45,276 | Accepted | Accepted | 10.08 | import sys
input = sys.stdin.readline
h,w,k= list(map(int, input().split()))
s = [list(input().strip()) for i in range(h)]
for i in range(h):
for j in range(w):
s[i][j]=int(s[i][j])
for i in range(h):
for j in range(1,w):
s[i][j]+=s[i][j-1]
for i in range(w):
for j in range(1,h):
s[j][i]+=s[j-1][i]
s=[[0]*w]+s
for i in range(h+1):
s[i]=[0]+s[i]
ans=float('inf')
#bit 全探索
for i in range(2**(h-1)):
line=[]
for j in range(h-1):
if (i>>j)&1:
line.append(j+1)
cnt=len(line)
line=[0]+line+[h]
x=0
flag=True
for k1 in range(1,w+1):
v=0
for l in range(len(line)-1):
# どう分割してもダメな奴に✖︎のフラグ立てる
if s[line[l+1]][k1]-s[line[l+1]][k1-1]-s[line[l]][k1]>k:
flag=False
v=max(s[line[l+1]][k1]-s[line[l+1]][x]-s[line[l]][k1]+s[line[l]][x],v)
if v<=k:
continue
else:
cnt+=1
x=k1-1
if flag:
ans=min(cnt,ans)
print(ans) | h,w,k= list(map(int, input().split()))
s = [[int(i) for i in eval(input())] for i in range(h)]
for i in range(h):
for j in range(1,w):
s[i][j]+=s[i][j-1]
for i in range(w):
for j in range(1,h):
s[j][i]+=s[j-1][i]
# １行目、一列目をゼロにする。
s=[[0]*w]+s
for i in range(h+1):
s[i]=[0]+s[i]
ans=float('inf')
#bit 全探索
for i in range(2**(h-1)):
line=[]
for j in range(h-1):
if (i>>j)&1:
line.append(j+1)
cnt=len(line)
line=[0]+line+[h]
x=0
flag=True
for k1 in range(1,w+1):
v=0
for l in range(len(line)-1):
# どう分割してもダメな奴に✖︎のフラグ立てる
if s[line[l+1]][k1]-s[line[l+1]][k1-1]-s[line[l]][k1]>k:
flag=False
v=max(s[line[l+1]][k1]-s[line[l+1]][x]-s[line[l]][k1]+s[line[l]][x],v)
if v>k:
cnt+=1
x=k1-1
if flag:
ans=min(cnt,ans)
print(ans) | 50 | 44 | 1,069 | 987 | import sys
input = sys.stdin.readline
h, w, k = list(map(int, input().split()))
s = [list(input().strip()) for i in range(h)]
for i in range(h):
for j in range(w):
s[i][j] = int(s[i][j])
for i in range(h):
for j in range(1, w):
s[i][j] += s[i][j - 1]
for i in range(w):
for j in range(1, h):
s[j][i] += s[j - 1][i]
s = [[0] * w] + s
for i in range(h + 1):
s[i] = [0] + s[i]
ans = float("inf")
# bit 全探索
for i in range(2 ** (h - 1)):
line = []
for j in range(h - 1):
if (i >> j) & 1:
line.append(j + 1)
cnt = len(line)
line = [0] + line + [h]
x = 0
flag = True
for k1 in range(1, w + 1):
v = 0
for l in range(len(line) - 1):
# どう分割してもダメな奴に✖︎のフラグ立てる
if s[line[l + 1]][k1] - s[line[l + 1]][k1 - 1] - s[line[l]][k1] > k:
flag = False
v = max(
s[line[l + 1]][k1] - s[line[l + 1]][x] - s[line[l]][k1] + s[line[l]][x],
v,
)
if v <= k:
continue
else:
cnt += 1
x = k1 - 1
if flag:
ans = min(cnt, ans)
print(ans)
| h, w, k = list(map(int, input().split()))
s = [[int(i) for i in eval(input())] for i in range(h)]
for i in range(h):
for j in range(1, w):
s[i][j] += s[i][j - 1]
for i in range(w):
for j in range(1, h):
s[j][i] += s[j - 1][i]
# １行目、一列目をゼロにする。
s = [[0] * w] + s
for i in range(h + 1):
s[i] = [0] + s[i]
ans = float("inf")
# bit 全探索
for i in range(2 ** (h - 1)):
line = []
for j in range(h - 1):
if (i >> j) & 1:
line.append(j + 1)
cnt = len(line)
line = [0] + line + [h]
x = 0
flag = True
for k1 in range(1, w + 1):
v = 0
for l in range(len(line) - 1):
# どう分割してもダメな奴に✖︎のフラグ立てる
if s[line[l + 1]][k1] - s[line[l + 1]][k1 - 1] - s[line[l]][k1] > k:
flag = False
v = max(
s[line[l + 1]][k1] - s[line[l + 1]][x] - s[line[l]][k1] + s[line[l]][x],
v,
)
if v > k:
cnt += 1
x = k1 - 1
if flag:
ans = min(cnt, ans)
print(ans)
| false | 12 | [
"-import sys",
"-",
"-input = sys.stdin.readline",
"-s = [list(input().strip()) for i in range(h)]",
"-for i in range(h):",
"- for j in range(w):",
"- s[i][j] = int(s[i][j])",
"+s = [[int(i) for i in eval(input())] for i in range(h)]",
"+# １行目、一列目をゼロにする。",
"- if v <= k:",
"- ... | false | 0.060357 | 0.059499 | 1.014416 | [
"s618195763",
"s356606735"
] |
u347600233 | p02959 | python | s230529437 | s005038203 | 176 | 157 | 25,368 | 25,316 | Accepted | Accepted | 10.8 | n = int(eval(input()))
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
cnt = 0
for i in range(n):
dm = min(a[i], b[i])
a[i] -= dm; b[i] -= dm; cnt += dm
dmn = min(a[i + 1], b[i])
a[i + 1] -= dmn; b[i] -= dmn; cnt += dmn
print(cnt) | n = int(eval(input()))
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
cnt = 0
for i in range(n):
dm = min(a[i], b[i])
b[i] -= dm; cnt += dm
dmn = min(a[i + 1], b[i])
a[i + 1] -= dmn; cnt += dmn
print(cnt) | 10 | 10 | 277 | 252 | n = int(eval(input()))
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
cnt = 0
for i in range(n):
dm = min(a[i], b[i])
a[i] -= dm
b[i] -= dm
cnt += dm
dmn = min(a[i + 1], b[i])
a[i + 1] -= dmn
b[i] -= dmn
cnt += dmn
print(cnt)
| n = int(eval(input()))
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
cnt = 0
for i in range(n):
dm = min(a[i], b[i])
b[i] -= dm
cnt += dm
dmn = min(a[i + 1], b[i])
a[i + 1] -= dmn
cnt += dmn
print(cnt)
| false | 0 | [
"- a[i] -= dm",
"- b[i] -= dmn"
] | false | 0.039552 | 0.077817 | 0.508268 | [
"s230529437",
"s005038203"
] |
u761320129 | p03576 | python | s631071884 | s995787224 | 1,129 | 746 | 53,340 | 74,784 | Accepted | Accepted | 33.92 | N,K = list(map(int,input().split()))
XY = [tuple(map(int,input().split())) for i in range(N)]
xs = []
ys = []
for x,y in XY:
xs.append(x)
ys.append(y)
xs.sort()
ys.sort()
def is_ok(l,r,d,u):
k = 0
for x,y in XY:
if l <= x <= r and d <= y <= u:
k += 1
if k >= K:
return True
return False
ans = float('inf')
for i in range(N-1):
for j in range(i+1,N):
for k in range(N-1):
for l in range(k+1,N):
l,r,d,u = xs[i],xs[j],ys[k],ys[l]
if (r-l)*(u-d) >= ans: continue
if is_ok(l,r,d,u):
ans = (r-l)*(u-d)
print(ans) | N,K = list(map(int,input().split()))
XY = [tuple(map(int,input().split())) for i in range(N)]
xs = []
ys = []
for x,y in XY:
xs.append(x)
ys.append(y)
xs.sort()
ys.sort()
ans = float('inf')
for l in range(N-1):
for r in range(l+1,N):
w = xs[r] - xs[l]
for d in range(N-1):
for u in range(d+1,N):
h = ys[u] - ys[d]
if w*h >= ans: continue
cnt = 0
for x,y in XY:
if xs[l] <= x <= xs[r] and ys[d] <= y <= ys[u]:
cnt += 1
if cnt==K: break
if cnt==K:
ans = w*h
print(ans) | 29 | 26 | 691 | 694 | N, K = list(map(int, input().split()))
XY = [tuple(map(int, input().split())) for i in range(N)]
xs = []
ys = []
for x, y in XY:
xs.append(x)
ys.append(y)
xs.sort()
ys.sort()
def is_ok(l, r, d, u):
k = 0
for x, y in XY:
if l <= x <= r and d <= y <= u:
k += 1
if k >= K:
return True
return False
ans = float("inf")
for i in range(N - 1):
for j in range(i + 1, N):
for k in range(N - 1):
for l in range(k + 1, N):
l, r, d, u = xs[i], xs[j], ys[k], ys[l]
if (r - l) * (u - d) >= ans:
continue
if is_ok(l, r, d, u):
ans = (r - l) * (u - d)
print(ans)
| N, K = list(map(int, input().split()))
XY = [tuple(map(int, input().split())) for i in range(N)]
xs = []
ys = []
for x, y in XY:
xs.append(x)
ys.append(y)
xs.sort()
ys.sort()
ans = float("inf")
for l in range(N - 1):
for r in range(l + 1, N):
w = xs[r] - xs[l]
for d in range(N - 1):
for u in range(d + 1, N):
h = ys[u] - ys[d]
if w * h >= ans:
continue
cnt = 0
for x, y in XY:
if xs[l] <= x <= xs[r] and ys[d] <= y <= ys[u]:
cnt += 1
if cnt == K:
break
if cnt == K:
ans = w * h
print(ans)
| false | 10.344828 | [
"-",
"-",
"-def is_ok(l, r, d, u):",
"- k = 0",
"- for x, y in XY:",
"- if l <= x <= r and d <= y <= u:",
"- k += 1",
"- if k >= K:",
"- return True",
"- return False",
"-",
"-",
"-for i in range(N - 1):",
"- for j in range(i + 1, N):... | false | 0.042469 | 0.196145 | 0.21652 | [
"s631071884",
"s995787224"
] |
u391731808 | p03044 | python | s515236696 | s359869911 | 834 | 710 | 63,044 | 75,524 | Accepted | Accepted | 14.87 | N=int(eval(input()))
uvw= [list(map(int,input().split())) for _ in [0]*(N-1)]
connect=[[] for _ in [0]*N]
for u,v,w in uvw:
connect[u-1].append((v-1,w))
connect[v-1].append((u-1,w))
MAX=10**16
dist = [MAX]*N
dist[0]=0
q = [0]
while q:
i = q.pop()
for j,w in connect[i]:
if dist[j] == MAX:
dist[j] = dist[i]+w
q.append(j)
for o in dist:
print((o%2)) | import heapq
N = int(input())
UVW = [list(map(int,input().split())) for _ in [0]*(N-1)]
E = [{} for _ in [0]*N]
for u,v,c in UVW:
E[u-1][v-1] = c
E[v-1][u-1] = c
def Dijkstra(N,E,start):
d = [-1]*N
q = [(0,start)]
while q:
ci,i = heapq.heappop(q)
if d[i]!= -1:continue
d[i] = ci
for j,cj in E[i].items():
if d[j]!=-1:continue
heapq.heappush(q,(ci+cj,j))
return d
d = Dijkstra(N,E,0)
print(*[l%2 for l in d],sep="\n")
| 18 | 23 | 409 | 521 | N = int(eval(input()))
uvw = [list(map(int, input().split())) for _ in [0] * (N - 1)]
connect = [[] for _ in [0] * N]
for u, v, w in uvw:
connect[u - 1].append((v - 1, w))
connect[v - 1].append((u - 1, w))
MAX = 10**16
dist = [MAX] * N
dist[0] = 0
q = [0]
while q:
i = q.pop()
for j, w in connect[i]:
if dist[j] == MAX:
dist[j] = dist[i] + w
q.append(j)
for o in dist:
print((o % 2))
| import heapq
N = int(input())
UVW = [list(map(int, input().split())) for _ in [0] * (N - 1)]
E = [{} for _ in [0] * N]
for u, v, c in UVW:
E[u - 1][v - 1] = c
E[v - 1][u - 1] = c
def Dijkstra(N, E, start):
d = [-1] * N
q = [(0, start)]
while q:
ci, i = heapq.heappop(q)
if d[i] != -1:
continue
d[i] = ci
for j, cj in E[i].items():
if d[j] != -1:
continue
heapq.heappush(q, (ci + cj, j))
return d
d = Dijkstra(N, E, 0)
print(*[l % 2 for l in d], sep="\n")
| false | 21.73913 | [
"-N = int(eval(input()))",
"-uvw = [list(map(int, input().split())) for _ in [0] * (N - 1)]",
"-connect = [[] for _ in [0] * N]",
"-for u, v, w in uvw:",
"- connect[u - 1].append((v - 1, w))",
"- connect[v - 1].append((u - 1, w))",
"-MAX = 10**16",
"-dist = [MAX] * N",
"-dist[0] = 0",
"-q = ... | false | 0.045226 | 0.051389 | 0.88008 | [
"s515236696",
"s359869911"
] |
u652656291 | p03503 | python | s809035700 | s717794450 | 367 | 151 | 12,164 | 3,064 | Accepted | Accepted | 58.86 | import numpy as np
N = int(eval(input()))
F = [[int(x) for x in input().split()] for _ in range(N)]
P = [[int(x) for x in input().split()] for _ in range(N)]
import itertools
answer = -(10 ** 18)
for a in itertools.product([0,1], repeat = 10):
if sum(a) == 0:
continue
profit = 0
for shop in range(N):
profit += P[shop][sum(a[i]*F[shop][i] for i in range(10))]
if answer < profit:
answer = profit
print(answer)
| n=int(eval(input()))
f=[list(map(int,input().split())) for i in range(n)]
p=[list(map(int,input().split())) for i in range(n)]
ma=-10000000000000
for i in range(1,2**10):
check=[0]*n
for j in range(10):
if (i>>j) & 1:
for k in range(n):
check[k]+=f[k][j]
ma_sub=0
for i in range(n):
ma_sub+=p[i][check[i]]
ma=max(ma,ma_sub)
print(ma) | 18 | 15 | 447 | 405 | import numpy as np
N = int(eval(input()))
F = [[int(x) for x in input().split()] for _ in range(N)]
P = [[int(x) for x in input().split()] for _ in range(N)]
import itertools
answer = -(10**18)
for a in itertools.product([0, 1], repeat=10):
if sum(a) == 0:
continue
profit = 0
for shop in range(N):
profit += P[shop][sum(a[i] * F[shop][i] for i in range(10))]
if answer < profit:
answer = profit
print(answer)
| n = int(eval(input()))
f = [list(map(int, input().split())) for i in range(n)]
p = [list(map(int, input().split())) for i in range(n)]
ma = -10000000000000
for i in range(1, 2**10):
check = [0] * n
for j in range(10):
if (i >> j) & 1:
for k in range(n):
check[k] += f[k][j]
ma_sub = 0
for i in range(n):
ma_sub += p[i][check[i]]
ma = max(ma, ma_sub)
print(ma)
| false | 16.666667 | [
"-import numpy as np",
"-",
"-N = int(eval(input()))",
"-F = [[int(x) for x in input().split()] for _ in range(N)]",
"-P = [[int(x) for x in input().split()] for _ in range(N)]",
"-import itertools",
"-",
"-answer = -(10**18)",
"-for a in itertools.product([0, 1], repeat=10):",
"- if sum(a) == ... | false | 0.045324 | 0.059198 | 0.765628 | [
"s809035700",
"s717794450"
] |
u799595944 | p00741 | python | s431916967 | s699268676 | 150 | 120 | 6,840 | 6,344 | Accepted | Accepted | 20 | import queue
def proceess(start_x,start_y):
#print("start_x : " + str(start_x) + ", start_y : " + str(start_y))
#insland = []
#insland.append([start_x,start_y])
new_island = queue.Queue()
map[start_x][start_y] = 0
new_island.put([start_x,start_y])
while True:
ob = new_island.get()
x = ob[0]
y = ob[1]
#print("x : " + str(x) + ", y : " + str(y))
for i in [-1,0,1]:
for j in [-1,0,1]:
nx = x + i
ny = y + j
if nx >= 0 and ny >= 0 and nx < h and ny < w:
if map[nx][ny] == 1:
#insland.append([nx,ny])
#print("ny : " + str(ny) + ", nx : " + str(nx))
new_island.put([nx,ny])
map[nx][ny] = 0
#print("end 8 count.")
if new_island.empty():
break
while True:
map = []
tmp = input().split(" ")
w = int(tmp[0])
h = int(tmp[1])
if w == 0 and h == 0:
break
for j in range(h):
nova = []
arm = eval(input())
for k in arm.split(" "):
#k.rstrip('\n')
nova.append(int(k))
map.append(nova)
#print(map)
count = 0
for i in range(h):
for j in range(w):
if map[i][j] == 1:
#print("i : " + str(i) + ", j : " + str(j))
proceess(i,j)
count += 1
print(count)
| import copy
move = ((1, 0), (0, 1), (0, -1), (-1, 0), (1, 1), (-1, -1), (-1, 1), (1, -1))
def dfs(start):
field[start[1]][start[0]] = '0'
CP = [start]
while CP:
NP = []
for cp in CP:
for m in move:
n_p = (cp[0]+m[0], cp[1]+m[1])
if not(n_p[0] < 0 or n_p[1] < 0 or n_p[1] >= h or n_p[0] >= w) and field[n_p[1]][n_p[0]] == '1':
field[n_p[1]][n_p[0]] = '0'
NP.append(n_p)
CP = NP
while True:
w, h = list(map(int, input().split()))
if w == 0 and h == 0:
break
field = [list(input().split()) for _ in range(h)]
count = 0
for y in range(h):
for x in range(w):
if field[y][x] == '1':
dfs((x, y))
count += 1
print(count)
| 62 | 32 | 1,544 | 848 | import queue
def proceess(start_x, start_y):
# print("start_x : " + str(start_x) + ", start_y : " + str(start_y))
# insland = []
# insland.append([start_x,start_y])
new_island = queue.Queue()
map[start_x][start_y] = 0
new_island.put([start_x, start_y])
while True:
ob = new_island.get()
x = ob[0]
y = ob[1]
# print("x : " + str(x) + ", y : " + str(y))
for i in [-1, 0, 1]:
for j in [-1, 0, 1]:
nx = x + i
ny = y + j
if nx >= 0 and ny >= 0 and nx < h and ny < w:
if map[nx][ny] == 1:
# insland.append([nx,ny])
# print("ny : " + str(ny) + ", nx : " + str(nx))
new_island.put([nx, ny])
map[nx][ny] = 0
# print("end 8 count.")
if new_island.empty():
break
while True:
map = []
tmp = input().split(" ")
w = int(tmp[0])
h = int(tmp[1])
if w == 0 and h == 0:
break
for j in range(h):
nova = []
arm = eval(input())
for k in arm.split(" "):
# k.rstrip('\n')
nova.append(int(k))
map.append(nova)
# print(map)
count = 0
for i in range(h):
for j in range(w):
if map[i][j] == 1:
# print("i : " + str(i) + ", j : " + str(j))
proceess(i, j)
count += 1
print(count)
| import copy
move = ((1, 0), (0, 1), (0, -1), (-1, 0), (1, 1), (-1, -1), (-1, 1), (1, -1))
def dfs(start):
field[start[1]][start[0]] = "0"
CP = [start]
while CP:
NP = []
for cp in CP:
for m in move:
n_p = (cp[0] + m[0], cp[1] + m[1])
if (
not (n_p[0] < 0 or n_p[1] < 0 or n_p[1] >= h or n_p[0] >= w)
and field[n_p[1]][n_p[0]] == "1"
):
field[n_p[1]][n_p[0]] = "0"
NP.append(n_p)
CP = NP
while True:
w, h = list(map(int, input().split()))
if w == 0 and h == 0:
break
field = [list(input().split()) for _ in range(h)]
count = 0
for y in range(h):
for x in range(w):
if field[y][x] == "1":
dfs((x, y))
count += 1
print(count)
| false | 48.387097 | [
"-import queue",
"+import copy",
"+",
"+move = ((1, 0), (0, 1), (0, -1), (-1, 0), (1, 1), (-1, -1), (-1, 1), (1, -1))",
"-def proceess(start_x, start_y):",
"- # print(\"start_x : \" + str(start_x) + \", start_y : \" + str(start_y))",
"- # insland = []",
"- # insland.append([start_x,start_y])"... | false | 0.044577 | 0.065366 | 0.681963 | [
"s431916967",
"s699268676"
] |
u498487134 | p02725 | python | s552228452 | s156695434 | 251 | 127 | 71,884 | 93,872 | Accepted | Accepted | 49.4 | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
K,N=MI()
A=LI()
diff=[0]*N
for i in range(N-1):
diff[i]=A[i+1]-A[i]
diff[-1]=A[0]+(K-A[-1])
print((K-max(diff)))
main()
| import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
K,N=MI()
A=LI()
S=sum(A)
L=[]
for i in range(N-1):
temp=A[i+1]-A[i]
L.append(temp)
L.append(A[0]+K-A[-1])
M=max(L)
print((K-M))
main()
| 19 | 23 | 367 | 407 | import sys
input = sys.stdin.readline
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
def main():
mod = 10**9 + 7
K, N = MI()
A = LI()
diff = [0] * N
for i in range(N - 1):
diff[i] = A[i + 1] - A[i]
diff[-1] = A[0] + (K - A[-1])
print((K - max(diff)))
main()
| import sys
input = sys.stdin.readline
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
def main():
mod = 10**9 + 7
K, N = MI()
A = LI()
S = sum(A)
L = []
for i in range(N - 1):
temp = A[i + 1] - A[i]
L.append(temp)
L.append(A[0] + K - A[-1])
M = max(L)
print((K - M))
main()
| false | 17.391304 | [
"- diff = [0] * N",
"+ S = sum(A)",
"+ L = []",
"- diff[i] = A[i + 1] - A[i]",
"- diff[-1] = A[0] + (K - A[-1])",
"- print((K - max(diff)))",
"+ temp = A[i + 1] - A[i]",
"+ L.append(temp)",
"+ L.append(A[0] + K - A[-1])",
"+ M = max(L)",
"+ print((K -... | false | 0.072502 | 0.040132 | 1.806592 | [
"s552228452",
"s156695434"
] |
u962655479 | p03013 | python | s027626481 | s566663363 | 500 | 454 | 460,020 | 460,020 | Accepted | Accepted | 9.2 | N, M = list(map(int, input().split()))
halls = [int(eval(input())) for i in range(M)]
dp = [1] * (N + 1)
for i in range(len(halls)):
dp[halls[i]] = 0
for i in range(2, N + 1):
if dp[i] == 0:
continue
dp[i] = dp[max(0, i - 1)] + dp[max(0, i - 2)]
print((dp[N] % 1000000007)) | N, M = list(map(int, input().split()))
halls = [int(eval(input())) for i in range(M)]
dp = [1] * (N + 1)
for i in range(len(halls)):
dp[halls[i]] = 0
for i in range(2, N + 1):
if dp[i] == 0:
continue
dp[i] = dp[i - 1] + dp[i - 2]
print((dp[N] % 1000000007)) | 14 | 14 | 296 | 280 | N, M = list(map(int, input().split()))
halls = [int(eval(input())) for i in range(M)]
dp = [1] * (N + 1)
for i in range(len(halls)):
dp[halls[i]] = 0
for i in range(2, N + 1):
if dp[i] == 0:
continue
dp[i] = dp[max(0, i - 1)] + dp[max(0, i - 2)]
print((dp[N] % 1000000007))
| N, M = list(map(int, input().split()))
halls = [int(eval(input())) for i in range(M)]
dp = [1] * (N + 1)
for i in range(len(halls)):
dp[halls[i]] = 0
for i in range(2, N + 1):
if dp[i] == 0:
continue
dp[i] = dp[i - 1] + dp[i - 2]
print((dp[N] % 1000000007))
| false | 0 | [
"- dp[i] = dp[max(0, i - 1)] + dp[max(0, i - 2)]",
"+ dp[i] = dp[i - 1] + dp[i - 2]"
] | false | 0.044393 | 0.045005 | 0.98639 | [
"s027626481",
"s566663363"
] |
u150984829 | p00447 | python | s218714358 | s327195427 | 1,080 | 260 | 5,984 | 5,916 | Accepted | Accepted | 75.93 | for e in iter(input,'0'):
a=[list(map(int,input().split()))for _ in[0]*int(e)]
b=[list(map(int,input().split()))for _ in[0]*int(eval(input()))]
for s,t in b:
u,v=a[0]
x,y=s-u,t-v
for u,v in a:
if[u+x,v+y]not in b:break
else:print((x,y))
| for e in iter(input,'0'):
a=[list(map(int,input().split()))for _ in[0]*int(e)]
b=[tuple(map(int,input().split()))for _ in[0]*int(eval(input()))]
for s,t in b:
u,v=a[0]
x,y=s-u,t-v
if not set((u+x,v+y)for u,v in a)-set(b):print((x,y));break
| 9 | 7 | 251 | 247 | for e in iter(input, "0"):
a = [list(map(int, input().split())) for _ in [0] * int(e)]
b = [list(map(int, input().split())) for _ in [0] * int(eval(input()))]
for s, t in b:
u, v = a[0]
x, y = s - u, t - v
for u, v in a:
if [u + x, v + y] not in b:
break
else:
print((x, y))
| for e in iter(input, "0"):
a = [list(map(int, input().split())) for _ in [0] * int(e)]
b = [tuple(map(int, input().split())) for _ in [0] * int(eval(input()))]
for s, t in b:
u, v = a[0]
x, y = s - u, t - v
if not set((u + x, v + y) for u, v in a) - set(b):
print((x, y))
break
| false | 22.222222 | [
"- b = [list(map(int, input().split())) for _ in [0] * int(eval(input()))]",
"+ b = [tuple(map(int, input().split())) for _ in [0] * int(eval(input()))]",
"- for u, v in a:",
"- if [u + x, v + y] not in b:",
"- break",
"- else:",
"+ if not set((u + x,... | false | 0.057897 | 0.078957 | 0.733269 | [
"s218714358",
"s327195427"
] |
u088063513 | p02719 | python | s942421547 | s033957690 | 48 | 26 | 5,460 | 9,752 | Accepted | Accepted | 45.83 | ## coding: UTF-8
from decimal import *
from itertools import permutations, combinations,combinations_with_replacement,product
s = input().split()
t = [int(p) for p in s]
N = t[0]
K = t[1]
#p = int(N/K)
#a = N - p * K
a = Decimal(N % K)
b = Decimal(K - a)
#print('N:{}, K:{}, p:{}, a:{}, b:{}'.format(N,K,p,a,b))
print((min(a,b)))
# 1000000000000000000 | ## coding: UTF-8
from decimal import *
from itertools import permutations, combinations,combinations_with_replacement,product
s = input().split()
t = [int(p) for p in s]
N = t[0]
K = t[1]
#p = int(N/K)
#a = N - p * K
#a = Decimal(N % K)
#b = Decimal(K - a)
a = N % K
b = K - a
#print('N:{}, K:{}, p:{}, a:{}, b:{}'.format(N,K,p,a,b))
print((min(a,b)))
# 1000000000000000000 | 16 | 19 | 366 | 392 | ## coding: UTF-8
from decimal import *
from itertools import permutations, combinations, combinations_with_replacement, product
s = input().split()
t = [int(p) for p in s]
N = t[0]
K = t[1]
# p = int(N/K)
# a = N - p * K
a = Decimal(N % K)
b = Decimal(K - a)
# print('N:{}, K:{}, p:{}, a:{}, b:{}'.format(N,K,p,a,b))
print((min(a, b)))
# 1000000000000000000
| ## coding: UTF-8
from decimal import *
from itertools import permutations, combinations, combinations_with_replacement, product
s = input().split()
t = [int(p) for p in s]
N = t[0]
K = t[1]
# p = int(N/K)
# a = N - p * K
# a = Decimal(N % K)
# b = Decimal(K - a)
a = N % K
b = K - a
# print('N:{}, K:{}, p:{}, a:{}, b:{}'.format(N,K,p,a,b))
print((min(a, b)))
# 1000000000000000000
| false | 15.789474 | [
"-a = Decimal(N % K)",
"-b = Decimal(K - a)",
"+# a = Decimal(N % K)",
"+# b = Decimal(K - a)",
"+a = N % K",
"+b = K - a"
] | false | 0.040328 | 0.037985 | 1.061695 | [
"s942421547",
"s033957690"
] |
u562935282 | p03600 | python | s947644879 | s559648639 | 1,106 | 579 | 55,516 | 42,972 | Accepted | Accepted | 47.65 | def main():
from heapq import heappush, heappop
n = int(eval(input()))
a = [[int(x) for x in input().split()] for _ in range(n)]
for i in range(n):
for j in range(n):
if a[i][j] != min(a[i][k] + a[k][j] for k in range(n)):
print((-1))
return
h = []
for r, row in enumerate(a):
for c, cell in enumerate(row):
if r == c: break
heappush(h, (cell, r, c)) # dist,r,c
pathes = []
while h:
dist, r, c = heappop(h)
is_path = True
for k in range(n):
if k == r or k == c: continue
if dist >= a[r][k] + a[k][c]:
is_path = False
break
if is_path:
pathes.append(dist)
print((sum(pathes)))
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
a = [[int(x) for x in input().split()] for _ in range(n)]
for i in range(n):
for j in range(n):
for k in range(n):
if a[i][j] > a[i][k] + a[k][j]:
print((-1))
return
ret = 0
for i in range(n):
for j in range(i):
for k in range(n):
if k == i or k == j: continue
if a[i][j] == a[i][k] + a[k][j]: break # 辺ではない
else:
ret += a[i][j]
print(ret)
if __name__ == '__main__':
main()
| 37 | 25 | 870 | 615 | def main():
from heapq import heappush, heappop
n = int(eval(input()))
a = [[int(x) for x in input().split()] for _ in range(n)]
for i in range(n):
for j in range(n):
if a[i][j] != min(a[i][k] + a[k][j] for k in range(n)):
print((-1))
return
h = []
for r, row in enumerate(a):
for c, cell in enumerate(row):
if r == c:
break
heappush(h, (cell, r, c)) # dist,r,c
pathes = []
while h:
dist, r, c = heappop(h)
is_path = True
for k in range(n):
if k == r or k == c:
continue
if dist >= a[r][k] + a[k][c]:
is_path = False
break
if is_path:
pathes.append(dist)
print((sum(pathes)))
if __name__ == "__main__":
main()
| def main():
n = int(eval(input()))
a = [[int(x) for x in input().split()] for _ in range(n)]
for i in range(n):
for j in range(n):
for k in range(n):
if a[i][j] > a[i][k] + a[k][j]:
print((-1))
return
ret = 0
for i in range(n):
for j in range(i):
for k in range(n):
if k == i or k == j:
continue
if a[i][j] == a[i][k] + a[k][j]:
break # 辺ではない
else:
ret += a[i][j]
print(ret)
if __name__ == "__main__":
main()
| false | 32.432432 | [
"- from heapq import heappush, heappop",
"-",
"- if a[i][j] != min(a[i][k] + a[k][j] for k in range(n)):",
"- print((-1))",
"- return",
"- h = []",
"- for r, row in enumerate(a):",
"- for c, cell in enumerate(row):",
"- if r == c:",... | false | 0.043841 | 0.036535 | 1.199985 | [
"s947644879",
"s559648639"
] |
u525065967 | p02584 | python | s653399258 | s936149178 | 32 | 29 | 9,176 | 9,152 | Accepted | Accepted | 9.38 | x, k, d = list(map(int, input().split()))
# print(x,k,d)
x = abs(x)
if x <= d:
if k%2:
print((d-x))
else:
print(x)
exit()
c = min(x//d, k)
x -= d*c
k -= c
if k%2:
print((abs(d-x)))
else:
print(x)
| x, k, d = list(map(int, input().split()))
x = abs(x)
if x > d:
c = min(x//d, k)
x -= d*c
k -= c
if k%2: x = d - x
print(x)
| 20 | 8 | 245 | 136 | x, k, d = list(map(int, input().split()))
# print(x,k,d)
x = abs(x)
if x <= d:
if k % 2:
print((d - x))
else:
print(x)
exit()
c = min(x // d, k)
x -= d * c
k -= c
if k % 2:
print((abs(d - x)))
else:
print(x)
| x, k, d = list(map(int, input().split()))
x = abs(x)
if x > d:
c = min(x // d, k)
x -= d * c
k -= c
if k % 2:
x = d - x
print(x)
| false | 60 | [
"-# print(x,k,d)",
"-if x <= d:",
"- if k % 2:",
"- print((d - x))",
"- else:",
"- print(x)",
"- exit()",
"-c = min(x // d, k)",
"-x -= d * c",
"-k -= c",
"+if x > d:",
"+ c = min(x // d, k)",
"+ x -= d * c",
"+ k -= c",
"- print((abs(d - x)))",
"-els... | false | 0.037909 | 0.034921 | 1.08555 | [
"s653399258",
"s936149178"
] |
u894258749 | p03008 | python | s655059335 | s922429703 | 669 | 483 | 103,128 | 84,568 | Accepted | Accepted | 27.8 | from fractions import gcd
from functools import reduce
inpl = lambda: list(map(int,input().split()))
def lcm(a,b):
return a*b//gcd(a,b)
def lcm_list(numbers):
return reduce(lcm, numbers)
N = int(eval(input()))
rate = []
rate.append(inpl())
rate.append(inpl())
AB = []
BA = []
for i in range(3):
rA, rB = rate[0][i], rate[1][i]
if rB > rA:
AB.append((rA, rB))
elif rA > rB:
BA.append((rB, rA))
for l in [AB, BA]:
l.sort(key=lambda x: -x[1]/x[0])
def buy_and_sell(N, cost_ret):
if len(cost_ret) == 0:
return N
else:
Nunit = lcm_list([ x[0] for x in cost_ret ])
b0, s0 = cost_ret[0]
q = N // b0
n = max(0, q - 2*Nunit//b0 + 1)
Ndp = N - n*b0
dp = [0]*(Ndp+1)
w = [0]*(len(cost_ret)+1)
for i in range(1,Ndp+1):
k = 1
for cost, ret in cost_ret:
if i >= cost:
w[k] = dp[i-cost] + ret
k += 1
dp[i] = max(dp[i-1]+1, max(w))
return s0*n + dp[-1]
M = buy_and_sell(N, AB)
L = buy_and_sell(M, BA)
print(L) | from fractions import gcd
from functools import reduce
inpl = lambda: list(map(int,input().split()))
def lcm(a,b):
return a*b//gcd(a,b)
def lcm_list(numbers):
return reduce(lcm, numbers)
N = int(eval(input()))
rate = []
rate.append(inpl())
rate.append(inpl())
AB = []
BA = []
for i in range(3):
rA, rB = rate[0][i], rate[1][i]
if rB > rA:
AB.append((rA, rB))
elif rA > rB:
BA.append((rB, rA))
for l in [AB, BA]:
l.sort(key=lambda x: -x[1]/x[0])
def buy_and_sell(N, cost_ret):
if len(cost_ret) == 0:
return N
else:
Nunit = lcm_list([ x[0] for x in cost_ret ])
b0, s0 = cost_ret[0]
q = N // b0
n = max(0, q - (len(cost_ret)-1)*Nunit//b0)
Ndp = N - n*b0
dp = [0]*(Ndp+1)
w = [0]*(len(cost_ret)+1)
for i in range(1,Ndp+1):
k = 1
for cost, ret in cost_ret:
if i >= cost:
w[k] = dp[i-cost] + ret
k += 1
dp[i] = max(dp[i-1]+1, max(w))
return s0*n + dp[-1]
M = buy_and_sell(N, AB)
L = buy_and_sell(M, BA)
print(L) | 46 | 46 | 1,155 | 1,167 | from fractions import gcd
from functools import reduce
inpl = lambda: list(map(int, input().split()))
def lcm(a, b):
return a * b // gcd(a, b)
def lcm_list(numbers):
return reduce(lcm, numbers)
N = int(eval(input()))
rate = []
rate.append(inpl())
rate.append(inpl())
AB = []
BA = []
for i in range(3):
rA, rB = rate[0][i], rate[1][i]
if rB > rA:
AB.append((rA, rB))
elif rA > rB:
BA.append((rB, rA))
for l in [AB, BA]:
l.sort(key=lambda x: -x[1] / x[0])
def buy_and_sell(N, cost_ret):
if len(cost_ret) == 0:
return N
else:
Nunit = lcm_list([x[0] for x in cost_ret])
b0, s0 = cost_ret[0]
q = N // b0
n = max(0, q - 2 * Nunit // b0 + 1)
Ndp = N - n * b0
dp = [0] * (Ndp + 1)
w = [0] * (len(cost_ret) + 1)
for i in range(1, Ndp + 1):
k = 1
for cost, ret in cost_ret:
if i >= cost:
w[k] = dp[i - cost] + ret
k += 1
dp[i] = max(dp[i - 1] + 1, max(w))
return s0 * n + dp[-1]
M = buy_and_sell(N, AB)
L = buy_and_sell(M, BA)
print(L)
| from fractions import gcd
from functools import reduce
inpl = lambda: list(map(int, input().split()))
def lcm(a, b):
return a * b // gcd(a, b)
def lcm_list(numbers):
return reduce(lcm, numbers)
N = int(eval(input()))
rate = []
rate.append(inpl())
rate.append(inpl())
AB = []
BA = []
for i in range(3):
rA, rB = rate[0][i], rate[1][i]
if rB > rA:
AB.append((rA, rB))
elif rA > rB:
BA.append((rB, rA))
for l in [AB, BA]:
l.sort(key=lambda x: -x[1] / x[0])
def buy_and_sell(N, cost_ret):
if len(cost_ret) == 0:
return N
else:
Nunit = lcm_list([x[0] for x in cost_ret])
b0, s0 = cost_ret[0]
q = N // b0
n = max(0, q - (len(cost_ret) - 1) * Nunit // b0)
Ndp = N - n * b0
dp = [0] * (Ndp + 1)
w = [0] * (len(cost_ret) + 1)
for i in range(1, Ndp + 1):
k = 1
for cost, ret in cost_ret:
if i >= cost:
w[k] = dp[i - cost] + ret
k += 1
dp[i] = max(dp[i - 1] + 1, max(w))
return s0 * n + dp[-1]
M = buy_and_sell(N, AB)
L = buy_and_sell(M, BA)
print(L)
| false | 0 | [
"- n = max(0, q - 2 * Nunit // b0 + 1)",
"+ n = max(0, q - (len(cost_ret) - 1) * Nunit // b0)"
] | false | 0.05021 | 0.136467 | 0.367931 | [
"s655059335",
"s922429703"
] |
u693953100 | p03061 | python | s586330878 | s494968176 | 269 | 242 | 69,996 | 14,488 | Accepted | Accepted | 10.04 | def gcd(a, b):
if b == 0:
return a
else:
return gcd(b,a%b)
n = int(eval(input()))
a = list(map(int, input().split()))
r = []
l = []
t = a[0]
for i in a:
t = gcd(t, i)
l.append(t)
t = a[-1]
for i in a[::-1]:
t = gcd(t, i)
r.append(t)
r = r[::-1]
ans = 0
for i in range(n):
if i == 0:
ans = max(ans, r[1])
continue
if i == n - 1:
ans = max(ans, l[-2])
continue
ans = max(ans, gcd(l[i-1], r[i+1]))
print(ans)
| def gcd(a,b):
if b==0:
return a
else:
return gcd(b,a%b)
eval(input())
l = list(map(int,input().split()))
gcd_l = [i for i in l]
gcd_r = [i for i in l]
for i in range(1,len(l)):
gcd_l[i] = gcd(gcd_l[i-1],gcd_l[i])
for i in range(0, len(l)-1)[::-1]:
gcd_r[i] = gcd(gcd_r[i+1], gcd_r[i])
ans = max(gcd_r[1],gcd_l[-2])
for i in range(1,len(l)-1):
ans = max(ans,gcd(gcd_l[i-1],gcd_r[i+1]))
print(ans) | 30 | 19 | 515 | 445 | def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a % b)
n = int(eval(input()))
a = list(map(int, input().split()))
r = []
l = []
t = a[0]
for i in a:
t = gcd(t, i)
l.append(t)
t = a[-1]
for i in a[::-1]:
t = gcd(t, i)
r.append(t)
r = r[::-1]
ans = 0
for i in range(n):
if i == 0:
ans = max(ans, r[1])
continue
if i == n - 1:
ans = max(ans, l[-2])
continue
ans = max(ans, gcd(l[i - 1], r[i + 1]))
print(ans)
| def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a % b)
eval(input())
l = list(map(int, input().split()))
gcd_l = [i for i in l]
gcd_r = [i for i in l]
for i in range(1, len(l)):
gcd_l[i] = gcd(gcd_l[i - 1], gcd_l[i])
for i in range(0, len(l) - 1)[::-1]:
gcd_r[i] = gcd(gcd_r[i + 1], gcd_r[i])
ans = max(gcd_r[1], gcd_l[-2])
for i in range(1, len(l) - 1):
ans = max(ans, gcd(gcd_l[i - 1], gcd_r[i + 1]))
print(ans)
| false | 36.666667 | [
"-n = int(eval(input()))",
"-a = list(map(int, input().split()))",
"-r = []",
"-l = []",
"-t = a[0]",
"-for i in a:",
"- t = gcd(t, i)",
"- l.append(t)",
"-t = a[-1]",
"-for i in a[::-1]:",
"- t = gcd(t, i)",
"- r.append(t)",
"-r = r[::-1]",
"-ans = 0",
"-for i in range(n):",... | false | 0.037303 | 0.036986 | 1.008568 | [
"s586330878",
"s494968176"
] |
u045953894 | p02641 | python | s206995443 | s411760707 | 31 | 28 | 9,096 | 9,184 | Accepted | Accepted | 9.68 | import sys
x,n = list(map(int,input().split()))
p = list(map(int,input().split()))
s = 100
min_i = -1
if x not in p:
print(x)
sys.exit()
for i in range(-1,102):
if i not in p and abs(i-x) < s:
s = abs(i-x)
min_i = i
print(min_i)
| x,n = list(map(int,input().split()))
p = list(map(int,input().split()))
i = 0
ans = -1
while True:
temp1 = x - i
temp2 = x + i
if temp1 not in p:
ans = temp1
break
if temp2 not in p:
ans = temp2
break
i += 1
print(ans) | 17 | 17 | 279 | 282 | import sys
x, n = list(map(int, input().split()))
p = list(map(int, input().split()))
s = 100
min_i = -1
if x not in p:
print(x)
sys.exit()
for i in range(-1, 102):
if i not in p and abs(i - x) < s:
s = abs(i - x)
min_i = i
print(min_i)
| x, n = list(map(int, input().split()))
p = list(map(int, input().split()))
i = 0
ans = -1
while True:
temp1 = x - i
temp2 = x + i
if temp1 not in p:
ans = temp1
break
if temp2 not in p:
ans = temp2
break
i += 1
print(ans)
| false | 0 | [
"-import sys",
"-",
"-s = 100",
"-min_i = -1",
"-if x not in p:",
"- print(x)",
"- sys.exit()",
"-for i in range(-1, 102):",
"- if i not in p and abs(i - x) < s:",
"- s = abs(i - x)",
"- min_i = i",
"-print(min_i)",
"+i = 0",
"+ans = -1",
"+while True:",
"+ te... | false | 0.041914 | 0.042595 | 0.984023 | [
"s206995443",
"s411760707"
] |
u347640436 | p02862 | python | s133282084 | s894677966 | 217 | 164 | 35,260 | 35,188 | Accepted | Accepted | 24.42 | # フェルマーの小定理
X, Y = list(map(int, input().split()))
m = 1000000007
if (X + Y) % 3 != 0:
print((0))
exit()
a = (2 * Y - X) // 3
b = (2 * X - Y) // 3
if a < 0 or b < 0:
print((0))
exit()
n = a + b
fac = [0] * (n + 1)
fac[0] = 1
for i in range(n):
fac[i + 1] = fac[i] * (i + 1) % m
def mcomb(n, k):
if n == 0 and k == 0:
return 1
if n < k or k < 0:
return 0
return fac[n] * pow(fac[n - k], m - 2, m) * pow(fac[k], m - 2, m) % m
print((mcomb(n, a)))
| # フェルマーの小定理
X, Y = list(map(int, input().split()))
m = 1000000007
def make_factorial_table(n):
result = [0] * (n + 1)
result[0] = 1
for i in range(1, n + 1):
result[i] = result[i - 1] * i % m
return result
def mcomb(n, k):
if n == 0 and k == 0:
return 1
if n < k or k < 0:
return 0
return fac[n] * pow(fac[n - k], m - 2, m) * pow(fac[k], m - 2, m) % m
if (X + Y) % 3 != 0:
print((0))
exit()
a = (2 * Y - X) // 3
b = (2 * X - Y) // 3
if a < 0 or b < 0:
print((0))
exit()
n = a + b
fac = make_factorial_table(n)
print((mcomb(n, a)))
| 32 | 36 | 521 | 632 | # フェルマーの小定理
X, Y = list(map(int, input().split()))
m = 1000000007
if (X + Y) % 3 != 0:
print((0))
exit()
a = (2 * Y - X) // 3
b = (2 * X - Y) // 3
if a < 0 or b < 0:
print((0))
exit()
n = a + b
fac = [0] * (n + 1)
fac[0] = 1
for i in range(n):
fac[i + 1] = fac[i] * (i + 1) % m
def mcomb(n, k):
if n == 0 and k == 0:
return 1
if n < k or k < 0:
return 0
return fac[n] * pow(fac[n - k], m - 2, m) * pow(fac[k], m - 2, m) % m
print((mcomb(n, a)))
| # フェルマーの小定理
X, Y = list(map(int, input().split()))
m = 1000000007
def make_factorial_table(n):
result = [0] * (n + 1)
result[0] = 1
for i in range(1, n + 1):
result[i] = result[i - 1] * i % m
return result
def mcomb(n, k):
if n == 0 and k == 0:
return 1
if n < k or k < 0:
return 0
return fac[n] * pow(fac[n - k], m - 2, m) * pow(fac[k], m - 2, m) % m
if (X + Y) % 3 != 0:
print((0))
exit()
a = (2 * Y - X) // 3
b = (2 * X - Y) // 3
if a < 0 or b < 0:
print((0))
exit()
n = a + b
fac = make_factorial_table(n)
print((mcomb(n, a)))
| false | 11.111111 | [
"-if (X + Y) % 3 != 0:",
"- print((0))",
"- exit()",
"-a = (2 * Y - X) // 3",
"-b = (2 * X - Y) // 3",
"-if a < 0 or b < 0:",
"- print((0))",
"- exit()",
"-n = a + b",
"-fac = [0] * (n + 1)",
"-fac[0] = 1",
"-for i in range(n):",
"- fac[i + 1] = fac[i] * (i + 1) % m",
"+",
... | false | 0.180234 | 0.065479 | 2.752559 | [
"s133282084",
"s894677966"
] |
u839537730 | p03816 | python | s773333756 | s862645292 | 54 | 45 | 18,656 | 14,564 | Accepted | Accepted | 16.67 | from collections import Counter
N = int(eval(input()))
a = list(map(int, input().split(" ")))
c = Counter(a)
ref = [v-1 for k, v in list(c.items()) if v != 1]
ans = N - ((sum(ref)+1)//2)*2
print(ans) | N = int(eval(input()))
a = list(map(int, input().split(" ")))
uni = len(list(set(a)))
if uni % 2 == 0:
uni -= 1
print(uni) | 11 | 8 | 201 | 129 | from collections import Counter
N = int(eval(input()))
a = list(map(int, input().split(" ")))
c = Counter(a)
ref = [v - 1 for k, v in list(c.items()) if v != 1]
ans = N - ((sum(ref) + 1) // 2) * 2
print(ans)
| N = int(eval(input()))
a = list(map(int, input().split(" ")))
uni = len(list(set(a)))
if uni % 2 == 0:
uni -= 1
print(uni)
| false | 27.272727 | [
"-from collections import Counter",
"-",
"-c = Counter(a)",
"-ref = [v - 1 for k, v in list(c.items()) if v != 1]",
"-ans = N - ((sum(ref) + 1) // 2) * 2",
"-print(ans)",
"+uni = len(list(set(a)))",
"+if uni % 2 == 0:",
"+ uni -= 1",
"+print(uni)"
] | false | 0.041823 | 0.040354 | 1.036402 | [
"s773333756",
"s862645292"
] |
u024807881 | p03062 | python | s709429192 | s923389751 | 75 | 55 | 14,116 | 14,352 | Accepted | Accepted | 26.67 | from sys import stdin
readline = stdin.readline
_, *aa = list(map(int, open(0).read().split()))
r = 0
mi = 1000000000
m = 0
for a in aa:
if a < 0:
m += 1
b = abs(a)
r += b
if b < mi:
mi = b
print((r - mi * 2 * (m % 2)))
| def main():
_ = eval(input())
A = tuple(map(int, input().split()))
B = tuple(map(abs, A))
C = tuple(a for a in A if a < 0)
print((sum(B) - min(B)*2*(len(C)%2)))
if __name__ == "__main__":
main() | 16 | 11 | 261 | 226 | from sys import stdin
readline = stdin.readline
_, *aa = list(map(int, open(0).read().split()))
r = 0
mi = 1000000000
m = 0
for a in aa:
if a < 0:
m += 1
b = abs(a)
r += b
if b < mi:
mi = b
print((r - mi * 2 * (m % 2)))
| def main():
_ = eval(input())
A = tuple(map(int, input().split()))
B = tuple(map(abs, A))
C = tuple(a for a in A if a < 0)
print((sum(B) - min(B) * 2 * (len(C) % 2)))
if __name__ == "__main__":
main()
| false | 31.25 | [
"-from sys import stdin",
"+def main():",
"+ _ = eval(input())",
"+ A = tuple(map(int, input().split()))",
"+ B = tuple(map(abs, A))",
"+ C = tuple(a for a in A if a < 0)",
"+ print((sum(B) - min(B) * 2 * (len(C) % 2)))",
"-readline = stdin.readline",
"-_, *aa = list(map(int, open(0).... | false | 0.036668 | 0.068012 | 0.539136 | [
"s709429192",
"s923389751"
] |
u102461423 | p03043 | python | s826704879 | s075814534 | 163 | 47 | 14,160 | 13,728 | Accepted | Accepted | 71.17 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
N,K = list(map(int,read().split()))
x = np.arange(1,N+1,dtype=np.int64)
need = np.zeros(N,dtype=np.int32)
for _ in range(20):
target = (x <= K-1)
x[target] <<= 1
need[target] += 1
counter = np.bincount(need,minlength=20)
power = np.full(20,1/2,dtype=np.float64); power[0] = 1; np.cumprod(power,out=power)
answer = (counter * power).sum() / N
print(answer) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, K = list(map(int, read().split()))
dp = [1.0] * (200_010)
for n in range(K - 1, 0, -1):
dp[n] = 0.5 * dp[2 * n]
print((sum(dp[1:N + 1]) / N)) | 22 | 13 | 523 | 272 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
N, K = list(map(int, read().split()))
x = np.arange(1, N + 1, dtype=np.int64)
need = np.zeros(N, dtype=np.int32)
for _ in range(20):
target = x <= K - 1
x[target] <<= 1
need[target] += 1
counter = np.bincount(need, minlength=20)
power = np.full(20, 1 / 2, dtype=np.float64)
power[0] = 1
np.cumprod(power, out=power)
answer = (counter * power).sum() / N
print(answer)
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, K = list(map(int, read().split()))
dp = [1.0] * (200_010)
for n in range(K - 1, 0, -1):
dp[n] = 0.5 * dp[2 * n]
print((sum(dp[1 : N + 1]) / N))
| false | 40.909091 | [
"-import numpy as np",
"-",
"-x = np.arange(1, N + 1, dtype=np.int64)",
"-need = np.zeros(N, dtype=np.int32)",
"-for _ in range(20):",
"- target = x <= K - 1",
"- x[target] <<= 1",
"- need[target] += 1",
"-counter = np.bincount(need, minlength=20)",
"-power = np.full(20, 1 / 2, dtype=np.f... | false | 0.737177 | 0.063234 | 11.657913 | [
"s826704879",
"s075814534"
] |
u627600101 | p03828 | python | s210453310 | s332629113 | 64 | 37 | 3,064 | 3,064 | Accepted | Accepted | 42.19 | mod=10**9+7
N=int(eval(input()))
M=1
y=[1 for k in range(N)]
for k in range(2,N+1):
for j in range(2,k+1):
if k%j ==0:
count=0
while k%j==0:
k=k//j
count+=1
y[j-1]+=count
ans=1
for k in range(len(y)):
ans=ans*y[k]%mod
print(ans) | mod=10**9+7
N=int(eval(input()))
M=1
y=[1 for k in range(N)]
for k in range(2,N+1):
for j in range(2,k+1):
if k==1:
break
if k%j ==0:
count=0
while k%j==0:
k=k//j
count+=1
y[j-1]+=count
ans=1
for k in range(len(y)):
ans=ans*y[k]%mod
print(ans) | 16 | 18 | 321 | 358 | mod = 10**9 + 7
N = int(eval(input()))
M = 1
y = [1 for k in range(N)]
for k in range(2, N + 1):
for j in range(2, k + 1):
if k % j == 0:
count = 0
while k % j == 0:
k = k // j
count += 1
y[j - 1] += count
ans = 1
for k in range(len(y)):
ans = ans * y[k] % mod
print(ans)
| mod = 10**9 + 7
N = int(eval(input()))
M = 1
y = [1 for k in range(N)]
for k in range(2, N + 1):
for j in range(2, k + 1):
if k == 1:
break
if k % j == 0:
count = 0
while k % j == 0:
k = k // j
count += 1
y[j - 1] += count
ans = 1
for k in range(len(y)):
ans = ans * y[k] % mod
print(ans)
| false | 11.111111 | [
"+ if k == 1:",
"+ break"
] | false | 0.091897 | 0.060481 | 1.519417 | [
"s210453310",
"s332629113"
] |
u715329136 | p02595 | python | s870057416 | s532321951 | 390 | 357 | 9,188 | 9,144 | Accepted | Accepted | 8.46 | import math
def resolve():
N, D = list(map(int, input().split()))
ans = 0
for _ in range(N):
x, y = list(map(int, input().split()))
dist = math.sqrt(x*x + y*y)
if dist <= D:
ans += 1
print(ans)
if __name__ == "__main__":
resolve() | import math
def resolve():
N, D = list(map(int, input().split()))
ans = 0
for _ in range(N):
x, y = list(map(int, input().split()))
if x*x + y*y <= D*D:
ans += 1
print(ans)
if __name__ == "__main__":
resolve() | 15 | 14 | 291 | 261 | import math
def resolve():
N, D = list(map(int, input().split()))
ans = 0
for _ in range(N):
x, y = list(map(int, input().split()))
dist = math.sqrt(x * x + y * y)
if dist <= D:
ans += 1
print(ans)
if __name__ == "__main__":
resolve()
| import math
def resolve():
N, D = list(map(int, input().split()))
ans = 0
for _ in range(N):
x, y = list(map(int, input().split()))
if x * x + y * y <= D * D:
ans += 1
print(ans)
if __name__ == "__main__":
resolve()
| false | 6.666667 | [
"- dist = math.sqrt(x * x + y * y)",
"- if dist <= D:",
"+ if x * x + y * y <= D * D:"
] | false | 0.007047 | 0.037185 | 0.189512 | [
"s870057416",
"s532321951"
] |
u460245024 | p03078 | python | s266789623 | s969616501 | 360 | 35 | 57,564 | 4,976 | Accepted | Accepted | 90.28 | import heapq
X, Y, Z, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)
B = sorted(list(map(int, input().split())), reverse=True)
C = sorted(list(map(int, input().split())), reverse=True)
Q = []
heapq.heappush(Q, (-1*(A[0]+B[0]+C[0]), 0, 0, 0))
registered = set()
registered.add((0, 0, 0))
for t in range(K):
s, ai, bi, ci = heapq.heappop(Q)
print((-s))
if ai+1 < X and (ai+1, bi, ci) not in registered:
heapq.heappush(Q, (-1*(A[ai+1]+B[bi]+C[ci]), ai+1, bi, ci))
registered.add((ai+1, bi, ci))
if bi+1 < Y and (ai, bi+1, ci) not in registered:
heapq.heappush(Q, (-1*(A[ai]+B[bi+1]+C[ci]), ai, bi+1, ci))
registered.add((ai, bi+1, ci))
if ci+1 < Z and (ai, bi, ci+1) not in registered:
heapq.heappush(Q, (-1*(A[ai]+B[bi]+C[ci+1]), ai, bi, ci+1))
registered.add((ai, bi, ci+1))
| import heapq
X, Y, Z, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)
B = sorted(list(map(int, input().split())), reverse=True)
C = sorted(list(map(int, input().split())), reverse=True)
Q = []
heapq.heappush(Q, (-1*(A[0]+B[0]+C[0]), 0, 0, 0))
registered = set()
registered.add((0, 0, 0))
for _ in range(K):
s, ai, bi, ci = heapq.heappop(Q)
print((-s))
if ai+1 < X and (ai+1, bi, ci) not in registered:
heapq.heappush(Q, (-1*(A[ai+1]+B[bi]+C[ci]), ai+1, bi, ci))
registered.add((ai+1, bi, ci))
if bi+1 < Y and (ai, bi+1, ci) not in registered:
heapq.heappush(Q, (-1*(A[ai]+B[bi+1]+C[ci]), ai, bi+1, ci))
registered.add((ai, bi+1, ci))
if ci+1 < Z and (ai, bi, ci+1) not in registered:
heapq.heappush(Q, (-1*(A[ai]+B[bi]+C[ci+1]), ai, bi, ci+1))
registered.add((ai, bi, ci+1))
| 24 | 24 | 907 | 907 | import heapq
X, Y, Z, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)
B = sorted(list(map(int, input().split())), reverse=True)
C = sorted(list(map(int, input().split())), reverse=True)
Q = []
heapq.heappush(Q, (-1 * (A[0] + B[0] + C[0]), 0, 0, 0))
registered = set()
registered.add((0, 0, 0))
for t in range(K):
s, ai, bi, ci = heapq.heappop(Q)
print((-s))
if ai + 1 < X and (ai + 1, bi, ci) not in registered:
heapq.heappush(Q, (-1 * (A[ai + 1] + B[bi] + C[ci]), ai + 1, bi, ci))
registered.add((ai + 1, bi, ci))
if bi + 1 < Y and (ai, bi + 1, ci) not in registered:
heapq.heappush(Q, (-1 * (A[ai] + B[bi + 1] + C[ci]), ai, bi + 1, ci))
registered.add((ai, bi + 1, ci))
if ci + 1 < Z and (ai, bi, ci + 1) not in registered:
heapq.heappush(Q, (-1 * (A[ai] + B[bi] + C[ci + 1]), ai, bi, ci + 1))
registered.add((ai, bi, ci + 1))
| import heapq
X, Y, Z, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)
B = sorted(list(map(int, input().split())), reverse=True)
C = sorted(list(map(int, input().split())), reverse=True)
Q = []
heapq.heappush(Q, (-1 * (A[0] + B[0] + C[0]), 0, 0, 0))
registered = set()
registered.add((0, 0, 0))
for _ in range(K):
s, ai, bi, ci = heapq.heappop(Q)
print((-s))
if ai + 1 < X and (ai + 1, bi, ci) not in registered:
heapq.heappush(Q, (-1 * (A[ai + 1] + B[bi] + C[ci]), ai + 1, bi, ci))
registered.add((ai + 1, bi, ci))
if bi + 1 < Y and (ai, bi + 1, ci) not in registered:
heapq.heappush(Q, (-1 * (A[ai] + B[bi + 1] + C[ci]), ai, bi + 1, ci))
registered.add((ai, bi + 1, ci))
if ci + 1 < Z and (ai, bi, ci + 1) not in registered:
heapq.heappush(Q, (-1 * (A[ai] + B[bi] + C[ci + 1]), ai, bi, ci + 1))
registered.add((ai, bi, ci + 1))
| false | 0 | [
"-for t in range(K):",
"+for _ in range(K):"
] | false | 0.048557 | 0.036858 | 1.317411 | [
"s266789623",
"s969616501"
] |
u761529120 | p03148 | python | s759435093 | s972967405 | 962 | 376 | 64,472 | 69,212 | Accepted | Accepted | 60.91 | import heapq
def main():
N, K = list(map(int, input().split()))
sushi_list = []
for _ in range(N):
t, d = list(map(int, input().split()))
sushi_list.append((d,t))
sushi_list = sorted(sushi_list, reverse=True)
# 各種類(最大でK種類目まで)でおいしさが最大のものを保存
keep = []
# 取り替えるようのheapq
exchange = []
# keepに入っている種類
types = set()
for i in range(K):
d, t = sushi_list[i]
if t not in types:
keep.append(d)
types.add(t)
else:
heapq.heappush(exchange, d)
base_point1 = sum(keep)
base_point2 = sum(exchange)
bonus_point = len(types)
ans = base_point1 + base_point2 + bonus_point ** 2
# K～N番目までをみて、選んでいない種類で最大のものを交換していく
for i in range(K, N):
if len(exchange) == 0:
break
d, t = sushi_list[i]
# すでに選んだ種類のものはスキップする
if t in types:
continue
types.add(t)
# 選んでいない種類で最大のものを追加する
base_point1 += d
# 選んだ種類で最小のものを削除する
base_point2 -= heapq.heappop(exchange)
bonus_point += 1
ans = max(ans, base_point1 + base_point2 + bonus_point ** 2)
print(ans)
main() | from collections import defaultdict
from itertools import accumulate
import sys
input = sys.stdin.readline
def main():
N, K = list(map(int, input().split()))
d = defaultdict(list)
for _ in range(N):
t, v = list(map(int, input().split()))
d[t].append(v)
other = []
vmax = []
for nums in list(d.values()):
nums.sort(reverse=True)
for i, j in enumerate(nums):
if i == 0:
vmax.append(j)
else:
other.append(j)
vmax.sort(reverse=True)
other.sort(reverse=True)
sum_v = [0] + list(accumulate(vmax))
sum_o = [0] + list(accumulate(other))
ans = 0
for i in range(K,0,-1):
neta = min(i, len(vmax))
base = neta * neta
tmp = base + sum_v[neta]
if K - neta > len(other):
break
tmp += sum_o[K-neta]
ans = max(ans, tmp)
print(ans)
if __name__ == "__main__":
main() | 53 | 48 | 1,235 | 1,009 | import heapq
def main():
N, K = list(map(int, input().split()))
sushi_list = []
for _ in range(N):
t, d = list(map(int, input().split()))
sushi_list.append((d, t))
sushi_list = sorted(sushi_list, reverse=True)
# 各種類(最大でK種類目まで)でおいしさが最大のものを保存
keep = []
# 取り替えるようのheapq
exchange = []
# keepに入っている種類
types = set()
for i in range(K):
d, t = sushi_list[i]
if t not in types:
keep.append(d)
types.add(t)
else:
heapq.heappush(exchange, d)
base_point1 = sum(keep)
base_point2 = sum(exchange)
bonus_point = len(types)
ans = base_point1 + base_point2 + bonus_point**2
# K～N番目までをみて、選んでいない種類で最大のものを交換していく
for i in range(K, N):
if len(exchange) == 0:
break
d, t = sushi_list[i]
# すでに選んだ種類のものはスキップする
if t in types:
continue
types.add(t)
# 選んでいない種類で最大のものを追加する
base_point1 += d
# 選んだ種類で最小のものを削除する
base_point2 -= heapq.heappop(exchange)
bonus_point += 1
ans = max(ans, base_point1 + base_point2 + bonus_point**2)
print(ans)
main()
| from collections import defaultdict
from itertools import accumulate
import sys
input = sys.stdin.readline
def main():
N, K = list(map(int, input().split()))
d = defaultdict(list)
for _ in range(N):
t, v = list(map(int, input().split()))
d[t].append(v)
other = []
vmax = []
for nums in list(d.values()):
nums.sort(reverse=True)
for i, j in enumerate(nums):
if i == 0:
vmax.append(j)
else:
other.append(j)
vmax.sort(reverse=True)
other.sort(reverse=True)
sum_v = [0] + list(accumulate(vmax))
sum_o = [0] + list(accumulate(other))
ans = 0
for i in range(K, 0, -1):
neta = min(i, len(vmax))
base = neta * neta
tmp = base + sum_v[neta]
if K - neta > len(other):
break
tmp += sum_o[K - neta]
ans = max(ans, tmp)
print(ans)
if __name__ == "__main__":
main()
| false | 9.433962 | [
"-import heapq",
"+from collections import defaultdict",
"+from itertools import accumulate",
"+import sys",
"+",
"+input = sys.stdin.readline",
"- sushi_list = []",
"+ d = defaultdict(list)",
"- t, d = list(map(int, input().split()))",
"- sushi_list.append((d, t))",
"- su... | false | 0.121131 | 0.042638 | 2.840915 | [
"s759435093",
"s972967405"
] |
u729133443 | p03137 | python | s314367801 | s523934226 | 247 | 100 | 57,640 | 13,964 | Accepted | Accepted | 59.51 | I=lambda:list(map(int,input().split()));n,m=I();x=sorted(I());print((sum(sorted(j-i for i,j in zip(x,x[1:]))[:max(0,m-n)]))) | n,m,*x=list(map(int,open(0).read().split()));x.sort();print((sum(sorted(j-i for i,j in zip(x,x[1:]))[::-1][n-1:]))) | 1 | 1 | 116 | 107 | I = lambda: list(map(int, input().split()))
n, m = I()
x = sorted(I())
print((sum(sorted(j - i for i, j in zip(x, x[1:]))[: max(0, m - n)])))
| n, m, *x = list(map(int, open(0).read().split()))
x.sort()
print((sum(sorted(j - i for i, j in zip(x, x[1:]))[::-1][n - 1 :])))
| false | 0 | [
"-I = lambda: list(map(int, input().split()))",
"-n, m = I()",
"-x = sorted(I())",
"-print((sum(sorted(j - i for i, j in zip(x, x[1:]))[: max(0, m - n)])))",
"+n, m, *x = list(map(int, open(0).read().split()))",
"+x.sort()",
"+print((sum(sorted(j - i for i, j in zip(x, x[1:]))[::-1][n - 1 :])))"
] | false | 0.041605 | 0.047995 | 0.866849 | [
"s314367801",
"s523934226"
] |
u562935282 | p03063 | python | s274891587 | s430377316 | 226 | 126 | 12,776 | 3,500 | Accepted | Accepted | 44.25 | N = int(eval(input()))
s = eval(input())
BK = '#'
c_bk = [0]
t_bk = 0
c_wt = [0]
t_wt = 0
for ss in s:
if ss == BK:
t_bk += 1
else:
t_wt += 1
c_bk.append(t_bk)
c_wt.append(t_wt)
ans = N
for i in range(0, N + 1):
to_white = c_bk[i] - c_bk[0]
to_black = c_wt[N] - c_wt[i]
ans = min(ans, to_black + to_white)
print(ans)
| # https://atcoder.jp/contests/tenka1-2019/tasks/tenka1_2019_c
n = int(eval(input()))
s = eval(input())
tot_w = s.count('.')
ret = tot_w # 初期配置をすべて黒にした場合にして、左端から白を置いていく
w = 0
b = 0
for c in s:
if c == '#':
b += 1
else:
w += 1
cost = b + tot_w - w
ret = min(ret, cost)
print(ret)
| 27 | 19 | 382 | 321 | N = int(eval(input()))
s = eval(input())
BK = "#"
c_bk = [0]
t_bk = 0
c_wt = [0]
t_wt = 0
for ss in s:
if ss == BK:
t_bk += 1
else:
t_wt += 1
c_bk.append(t_bk)
c_wt.append(t_wt)
ans = N
for i in range(0, N + 1):
to_white = c_bk[i] - c_bk[0]
to_black = c_wt[N] - c_wt[i]
ans = min(ans, to_black + to_white)
print(ans)
| # https://atcoder.jp/contests/tenka1-2019/tasks/tenka1_2019_c
n = int(eval(input()))
s = eval(input())
tot_w = s.count(".")
ret = tot_w # 初期配置をすべて黒にした場合にして、左端から白を置いていく
w = 0
b = 0
for c in s:
if c == "#":
b += 1
else:
w += 1
cost = b + tot_w - w
ret = min(ret, cost)
print(ret)
| false | 29.62963 | [
"-N = int(eval(input()))",
"+# https://atcoder.jp/contests/tenka1-2019/tasks/tenka1_2019_c",
"+n = int(eval(input()))",
"-BK = \"#\"",
"-c_bk = [0]",
"-t_bk = 0",
"-c_wt = [0]",
"-t_wt = 0",
"-for ss in s:",
"- if ss == BK:",
"- t_bk += 1",
"+tot_w = s.count(\".\")",
"+ret = tot_w ... | false | 0.047114 | 0.088794 | 0.530597 | [
"s274891587",
"s430377316"
] |
u671060652 | p02881 | python | s888465281 | s164617285 | 264 | 120 | 40,172 | 73,004 | Accepted | Accepted | 54.55 | import math
import itertools
n = int(eval(input()))
x = 1
for i in reversed(list(range(1, math.ceil(math.sqrt(n))+1))):
if n % i == 0:
x = n / i
break
print((math.floor(x - 1 + n / x - 1))) | import itertools
import math
import fractions
import functools
n = int(eval(input()))
maximum = math.ceil(math.sqrt(n))
minimum = 10**20
for i in range(1,maximum+1):
j = 0
if n % i == 0:
j = n / i
minimum = min(minimum,i+j)
print((int(minimum-2))) | 10 | 15 | 205 | 279 | import math
import itertools
n = int(eval(input()))
x = 1
for i in reversed(list(range(1, math.ceil(math.sqrt(n)) + 1))):
if n % i == 0:
x = n / i
break
print((math.floor(x - 1 + n / x - 1)))
| import itertools
import math
import fractions
import functools
n = int(eval(input()))
maximum = math.ceil(math.sqrt(n))
minimum = 10**20
for i in range(1, maximum + 1):
j = 0
if n % i == 0:
j = n / i
minimum = min(minimum, i + j)
print((int(minimum - 2)))
| false | 33.333333 | [
"+import itertools",
"-import itertools",
"+import fractions",
"+import functools",
"-x = 1",
"-for i in reversed(list(range(1, math.ceil(math.sqrt(n)) + 1))):",
"+maximum = math.ceil(math.sqrt(n))",
"+minimum = 10**20",
"+for i in range(1, maximum + 1):",
"+ j = 0",
"- x = n / i",
"... | false | 0.050368 | 0.044785 | 1.124662 | [
"s888465281",
"s164617285"
] |
u790710233 | p03659 | python | s031536469 | s755932291 | 229 | 170 | 24,820 | 24,800 | Accepted | Accepted | 25.76 | n = int(eval(input()))
A = list(map(int, input().split()))
S = [0]*(n+1)
for i in range(n):
S[i+1] = S[i]+A[i]
INF = 10**18
ans = INF
for R in range(1, n):
ans = min(ans, abs((S[R]-S[0])-(S[n]-S[R])))
print(ans)
| n = int(eval(input()))
A = list(map(int, input().split()))
sum_A = sum(A)
INF = 10**18
ans = INF
X = 0
for a in A[:-1]:
X += a
ans = min(ans, abs(2*X-sum_A))
print(ans) | 10 | 10 | 223 | 179 | n = int(eval(input()))
A = list(map(int, input().split()))
S = [0] * (n + 1)
for i in range(n):
S[i + 1] = S[i] + A[i]
INF = 10**18
ans = INF
for R in range(1, n):
ans = min(ans, abs((S[R] - S[0]) - (S[n] - S[R])))
print(ans)
| n = int(eval(input()))
A = list(map(int, input().split()))
sum_A = sum(A)
INF = 10**18
ans = INF
X = 0
for a in A[:-1]:
X += a
ans = min(ans, abs(2 * X - sum_A))
print(ans)
| false | 0 | [
"-S = [0] * (n + 1)",
"-for i in range(n):",
"- S[i + 1] = S[i] + A[i]",
"+sum_A = sum(A)",
"-for R in range(1, n):",
"- ans = min(ans, abs((S[R] - S[0]) - (S[n] - S[R])))",
"+X = 0",
"+for a in A[:-1]:",
"+ X += a",
"+ ans = min(ans, abs(2 * X - sum_A))"
] | false | 0.066106 | 0.044627 | 1.481292 | [
"s031536469",
"s755932291"
] |
u038021590 | p03168 | python | s205382854 | s852442495 | 597 | 171 | 187,656 | 27,636 | Accepted | Accepted | 71.36 | N = int(eval(input()))
P = list(map(float, input().split()))
DP = [[0]*(N+1)for _ in range(N+1)]
DP[0][0] = 1
for i in range(1,N+1):
for j in range(N+1):
if i < j:
DP[i][j] = 0
else:
DP[i][j] = P[i-1] * DP[i-1][j-1] + (1 - P[i-1]) * DP[i-1][j]
print((sum(DP[N][N//2 + 1:]))) | import numpy as np
N = int(eval(input()))
P = list(map(float, input().split()))
DP = np.zeros(N+2)
DP[0] = 1
for i, p in enumerate(P, 1):
DP = DP * (1 - p) + np.roll(DP, 1) * p
print((np.sum(DP[N//2 + 1:]))) | 11 | 10 | 320 | 214 | N = int(eval(input()))
P = list(map(float, input().split()))
DP = [[0] * (N + 1) for _ in range(N + 1)]
DP[0][0] = 1
for i in range(1, N + 1):
for j in range(N + 1):
if i < j:
DP[i][j] = 0
else:
DP[i][j] = P[i - 1] * DP[i - 1][j - 1] + (1 - P[i - 1]) * DP[i - 1][j]
print((sum(DP[N][N // 2 + 1 :])))
| import numpy as np
N = int(eval(input()))
P = list(map(float, input().split()))
DP = np.zeros(N + 2)
DP[0] = 1
for i, p in enumerate(P, 1):
DP = DP * (1 - p) + np.roll(DP, 1) * p
print((np.sum(DP[N // 2 + 1 :])))
| false | 9.090909 | [
"+import numpy as np",
"+",
"-DP = [[0] * (N + 1) for _ in range(N + 1)]",
"-DP[0][0] = 1",
"-for i in range(1, N + 1):",
"- for j in range(N + 1):",
"- if i < j:",
"- DP[i][j] = 0",
"- else:",
"- DP[i][j] = P[i - 1] * DP[i - 1][j - 1] + (1 - P[i - 1]) * DP[i... | false | 0.038438 | 0.562107 | 0.068383 | [
"s205382854",
"s852442495"
] |
u141610915 | p03502 | python | s917696515 | s812601182 | 173 | 72 | 38,256 | 61,820 | Accepted | Accepted | 58.38 | import sys
input = sys.stdin.readline
N = input()[: -1]
f = sum(list(map(int, list(N))))
if int(N) % f == 0:
print("Yes")
else:
print("No") | import sys
input = sys.stdin.readline
N = int(eval(input()))
if N % sum(list(map(int, str(N)))) == 0: print("Yes")
else: print("No") | 8 | 5 | 150 | 130 | import sys
input = sys.stdin.readline
N = input()[:-1]
f = sum(list(map(int, list(N))))
if int(N) % f == 0:
print("Yes")
else:
print("No")
| import sys
input = sys.stdin.readline
N = int(eval(input()))
if N % sum(list(map(int, str(N)))) == 0:
print("Yes")
else:
print("No")
| false | 37.5 | [
"-N = input()[:-1]",
"-f = sum(list(map(int, list(N))))",
"-if int(N) % f == 0:",
"+N = int(eval(input()))",
"+if N % sum(list(map(int, str(N)))) == 0:"
] | false | 0.035735 | 0.037657 | 0.948955 | [
"s917696515",
"s812601182"
] |
u864641771 | p02714 | python | s429033228 | s859491889 | 1,466 | 1,256 | 9,064 | 9,140 | Accepted | Accepted | 14.32 | n = int(eval(input()))
s = eval(input())
ans = s.count("R")*s.count("G")*s.count("B")
for i in range(n):
for d in range(n):
j = i + d
k = j + d
if k >= n:
break
if s[i] != s[j] and s[i] != s[k] and s[j] != s[k]:
ans -= 1
print(ans) | n = int(eval(input()))
s = eval(input())
ans = s.count("R")*s.count("G")*s.count("B")
for i in range(n):
for j in range(i+1, n):
k = j-i+j
if k >= n:
break
if s[i] != s[j] and s[i] != s[k] and s[j] != s[k]:
ans -= 1
print(ans) | 13 | 12 | 292 | 278 | n = int(eval(input()))
s = eval(input())
ans = s.count("R") * s.count("G") * s.count("B")
for i in range(n):
for d in range(n):
j = i + d
k = j + d
if k >= n:
break
if s[i] != s[j] and s[i] != s[k] and s[j] != s[k]:
ans -= 1
print(ans)
| n = int(eval(input()))
s = eval(input())
ans = s.count("R") * s.count("G") * s.count("B")
for i in range(n):
for j in range(i + 1, n):
k = j - i + j
if k >= n:
break
if s[i] != s[j] and s[i] != s[k] and s[j] != s[k]:
ans -= 1
print(ans)
| false | 7.692308 | [
"- for d in range(n):",
"- j = i + d",
"- k = j + d",
"+ for j in range(i + 1, n):",
"+ k = j - i + j"
] | false | 0.111981 | 0.141281 | 0.792609 | [
"s429033228",
"s859491889"
] |
u690536347 | p02874 | python | s719730057 | s493663795 | 438 | 372 | 98,768 | 90,524 | Accepted | Accepted | 15.07 | import sys
input=sys.stdin.readline
class SegTree():
def __init__(self, N, e, operator_func):
self.e = e # 単位元
self.size = N
self.node = [self.e] * (2*N)
self.operator_func = operator_func # 処理(add or xor max minなど)
def set_list(self, l):
for i in range(self.size):
self.node[i+self.size-1] = l[i]
for i in range(self.size-1)[::-1]:
self.node[i] = self.operator_func(self.node[2*i+1], self.node[2*i+2])
def update(self, k, x):
k += self.size-1
self.node[k] = x
while k >= 0:
k = (k - 1) // 2
self.node[k] = self.operator_func(self.node[2*k+1], self.node[2*k+2])
def get(self, l, r):
# [l, r) についてqueryを求める
x = self.e
l += self.size
r += self.size
while l<r:
if l&1:
x = self.operator_func(x, self.node[l-1])
l += 1
if r&1:
r -= 1
x = self.operator_func(x, self.node[r-1])
l >>= 1
r >>= 1
return x
def solve():
N = int(eval(input()))
l = [tuple(map(int, input().split())) for i in range(N)]
l.sort(key=lambda x:(x[0], -x[1]))
#1 [lmax, rmin] [*, *]
#2 [lmax, *] [*, rmin]
lmax = 0
rmin = 10**12
a, b = 0, 0
for i in range(N):
if lmax < l[i][0]:
lmax = l[i][0]
a = i
if rmin > l[i][1]:
rmin = l[i][1]
b = i
#1
ans1 = 0
for i in range(N):
if i==a or i==b:
continue
ans1 = max(ans1, max(l[b][1]-l[a][0]+1, 0)+max(l[i][1]-l[i][0]+1, 0))
#2
ans2 = 0
tree = SegTree(N, 10**12, min)
tree.set_list([i[1] for i in l])
for i in range(N-1):
ans2 = max(ans2, max(l[b][1]-l[i][0]+1, 0)+max(tree.get(i+1, N)-l[a][0]+1, 0))
ans = max(ans1, ans2)
print(ans)
if __name__ == "__main__":
solve()
| import sys
input=sys.stdin.readline
def solve():
N = int(eval(input()))
l = [tuple(map(int, input().split())) for i in range(N)]
l.sort(key=lambda x:(x[0], -x[1]))
#1 [lmax, rmin] [*, *]
#2 [lmax, *] [*, rmin]
lmax = 0
rmin = 10**12
a, b = 0, 0
for i in range(N):
if lmax < l[i][0]:
lmax = l[i][0]
a = i
if rmin > l[i][1]:
rmin = l[i][1]
b = i
#1
ans1 = 0
for i in range(N):
if i==a or i==b:
continue
ans1 = max(ans1, max(l[b][1]-l[a][0]+1, 0)+max(l[i][1]-l[i][0]+1, 0))
#2
ans2 = 0
p = 10**18
for i in range(1, N)[::-1]:
p = min(p, l[i][1])
ans2 = max(ans2, max(l[b][1]-l[i-1][0]+1, 0)+max(p-l[a][0]+1, 0))
ans = max(ans1, ans2)
print(ans)
if __name__ == "__main__":
solve()
| 82 | 44 | 2,047 | 907 | import sys
input = sys.stdin.readline
class SegTree:
def __init__(self, N, e, operator_func):
self.e = e # 単位元
self.size = N
self.node = [self.e] * (2 * N)
self.operator_func = operator_func # 処理(add or xor max minなど)
def set_list(self, l):
for i in range(self.size):
self.node[i + self.size - 1] = l[i]
for i in range(self.size - 1)[::-1]:
self.node[i] = self.operator_func(
self.node[2 * i + 1], self.node[2 * i + 2]
)
def update(self, k, x):
k += self.size - 1
self.node[k] = x
while k >= 0:
k = (k - 1) // 2
self.node[k] = self.operator_func(
self.node[2 * k + 1], self.node[2 * k + 2]
)
def get(self, l, r):
# [l, r) についてqueryを求める
x = self.e
l += self.size
r += self.size
while l < r:
if l & 1:
x = self.operator_func(x, self.node[l - 1])
l += 1
if r & 1:
r -= 1
x = self.operator_func(x, self.node[r - 1])
l >>= 1
r >>= 1
return x
def solve():
N = int(eval(input()))
l = [tuple(map(int, input().split())) for i in range(N)]
l.sort(key=lambda x: (x[0], -x[1]))
# 1 [lmax, rmin] [*, *]
# 2 [lmax, *] [*, rmin]
lmax = 0
rmin = 10**12
a, b = 0, 0
for i in range(N):
if lmax < l[i][0]:
lmax = l[i][0]
a = i
if rmin > l[i][1]:
rmin = l[i][1]
b = i
# 1
ans1 = 0
for i in range(N):
if i == a or i == b:
continue
ans1 = max(ans1, max(l[b][1] - l[a][0] + 1, 0) + max(l[i][1] - l[i][0] + 1, 0))
# 2
ans2 = 0
tree = SegTree(N, 10**12, min)
tree.set_list([i[1] for i in l])
for i in range(N - 1):
ans2 = max(
ans2,
max(l[b][1] - l[i][0] + 1, 0) + max(tree.get(i + 1, N) - l[a][0] + 1, 0),
)
ans = max(ans1, ans2)
print(ans)
if __name__ == "__main__":
solve()
| import sys
input = sys.stdin.readline
def solve():
N = int(eval(input()))
l = [tuple(map(int, input().split())) for i in range(N)]
l.sort(key=lambda x: (x[0], -x[1]))
# 1 [lmax, rmin] [*, *]
# 2 [lmax, *] [*, rmin]
lmax = 0
rmin = 10**12
a, b = 0, 0
for i in range(N):
if lmax < l[i][0]:
lmax = l[i][0]
a = i
if rmin > l[i][1]:
rmin = l[i][1]
b = i
# 1
ans1 = 0
for i in range(N):
if i == a or i == b:
continue
ans1 = max(ans1, max(l[b][1] - l[a][0] + 1, 0) + max(l[i][1] - l[i][0] + 1, 0))
# 2
ans2 = 0
p = 10**18
for i in range(1, N)[::-1]:
p = min(p, l[i][1])
ans2 = max(ans2, max(l[b][1] - l[i - 1][0] + 1, 0) + max(p - l[a][0] + 1, 0))
ans = max(ans1, ans2)
print(ans)
if __name__ == "__main__":
solve()
| false | 46.341463 | [
"-",
"-",
"-class SegTree:",
"- def __init__(self, N, e, operator_func):",
"- self.e = e # 単位元",
"- self.size = N",
"- self.node = [self.e] * (2 * N)",
"- self.operator_func = operator_func # 処理(add or xor max minなど)",
"-",
"- def set_list(self, l):",
"- ... | false | 0.035356 | 0.058352 | 0.605911 | [
"s719730057",
"s493663795"
] |
u689626103 | p02837 | python | s600372176 | s656424290 | 680 | 276 | 3,064 | 3,064 | Accepted | Accepted | 59.41 | import sys
readline = sys.stdin.buffer.readline
N = int(readline())
A = [[] for _ in range(N)]
for i in range(N):
count = int(readline())
for j in range(count):
x, y = list(map(int, readline().split()))
x -= 1
A[i].append([x, y])
ans = 0
for i in range(2**N):
good = [0] * N
f = 1
for j in range(N):
if (i >> j) & 1:
good[j] = 1
for k in range(N):
if good[k]:
for x, y in A[k]:
if good[x] != y:
f = 0
if f:
ans = max(ans, sum(good))
print(ans) | import sys
readline = sys.stdin.buffer.readline
N = int(readline())
A = [[] for _ in range(N)]
for i in range(N):
count = int(readline())
for j in range(count):
x, y = list(map(int, readline().split()))
x -= 1
A[i].append([x, y])
ans = 0
for i in range(2**N):
pattern = [0] * N
valid = True
for j in range(N):
if (i >> j) & 1:
pattern[j] = 1
# ビットが1になっている人の証言をみる
for k in range(N):
if pattern[k]:
for x, y in A[k]:
if pattern[x] != y: # 矛盾があれば終了、このパターンはありえない。
valid = False
break
if valid:
ans = max(ans, sum(pattern))
print(ans)
| 31 | 33 | 609 | 723 | import sys
readline = sys.stdin.buffer.readline
N = int(readline())
A = [[] for _ in range(N)]
for i in range(N):
count = int(readline())
for j in range(count):
x, y = list(map(int, readline().split()))
x -= 1
A[i].append([x, y])
ans = 0
for i in range(2**N):
good = [0] * N
f = 1
for j in range(N):
if (i >> j) & 1:
good[j] = 1
for k in range(N):
if good[k]:
for x, y in A[k]:
if good[x] != y:
f = 0
if f:
ans = max(ans, sum(good))
print(ans)
| import sys
readline = sys.stdin.buffer.readline
N = int(readline())
A = [[] for _ in range(N)]
for i in range(N):
count = int(readline())
for j in range(count):
x, y = list(map(int, readline().split()))
x -= 1
A[i].append([x, y])
ans = 0
for i in range(2**N):
pattern = [0] * N
valid = True
for j in range(N):
if (i >> j) & 1:
pattern[j] = 1
# ビットが1になっている人の証言をみる
for k in range(N):
if pattern[k]:
for x, y in A[k]:
if pattern[x] != y: # 矛盾があれば終了、このパターンはありえない。
valid = False
break
if valid:
ans = max(ans, sum(pattern))
print(ans)
| false | 6.060606 | [
"- good = [0] * N",
"- f = 1",
"+ pattern = [0] * N",
"+ valid = True",
"- good[j] = 1",
"+ pattern[j] = 1",
"+ # ビットが1になっている人の証言をみる",
"- if good[k]:",
"+ if pattern[k]:",
"- if good[x] != y:",
"- f = 0",
"- ... | false | 0.034978 | 0.034848 | 1.003736 | [
"s600372176",
"s656424290"
] |
u408071652 | p02616 | python | s943212303 | s637815931 | 739 | 207 | 33,556 | 118,048 | Accepted | Accepted | 71.99 | import sys
sys.setrecursionlimit(10 ** 7)
# import bisect
# import numpy as np
# from collections import deque
from collections import deque
# map(int, sys.stdin.read().split())
import itertools
import heapq
def input():
return sys.stdin.readline().rstrip()
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
A.sort()
A = deque(A)
# print(A)
A_minus = deque([s for s in A if s < 0])
A_plus = deque([s for s in A if s >= 0])
# print(A_plus)
# print(A_minus)
AA = []
if N == K:
ans = 1
for l in range(N):
ans *= A[l]
ans %=mod
print((ans % mod))
elif K % 2 == 0:
while len(A_minus) >= 2:
a1 = A_minus.popleft()
a2 = A_minus.popleft()
AA.append(-a1 * a2)
while len(A_plus) >= 2:
a1 = A_plus.pop()
a2 = A_plus.pop()
AA.append(-a1 * a2)
ans = 1
heapq.heapify(AA)
for i in range(K // 2):
ans *= (-1 * heapq.heappop(AA)) % mod
ans %= mod
print((ans % mod))
elif len(A_plus) == 0:
ans = 1
for i in range(K):
ans *= A_minus.pop() % mod
ans %= mod
print((ans % mod))
else:
ans = A_plus.pop()
while len(A_minus) >= 2:
a1 = A_minus.popleft()
a2 = A_minus.popleft()
AA.append(-a1 * a2)
while len(A_plus) >= 2:
a1 = A_plus.pop()
a2 = A_plus.pop()
AA.append(-a1 * a2)
heapq.heapify(AA)
for i in range(K // 2):
ans *= (-1 * heapq.heappop(AA))
ans %= mod
print((ans % mod))
if __name__ == "__main__":
main()
| import sys
sys.setrecursionlimit(10 ** 7)
# import bisect
# import numpy as np
# from collections import deque
from collections import deque
# map(int, sys.stdin.read().split())
import itertools
import heapq
def input():
return sys.stdin.readline().rstrip()
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
A.sort()
A = deque(A)
# print(A)
A_minus = deque([s for s in A if s < 0])
A_plus = deque([s for s in A if s >= 0])
# print(A_plus)
# print(A_minus)
AA = []
if N == K:
ans = 1
for i in A:
ans *= i % mod
ans %=mod
print((ans % mod))
elif K % 2 == 0:
while len(A_minus) >= 2:
a1 = A_minus.popleft()
a2 = A_minus.popleft()
heapq.heappush(AA, -a1 * a2)
while len(A_plus) >= 2:
a1 = A_plus.pop()
a2 = A_plus.pop()
heapq.heappush(AA, -a1 * a2)
ans = 1
for i in range(K // 2):
ans *= (-1 * heapq.heappop(AA))
ans %= mod
print((ans % mod))
elif len(A_plus) == 0:
ans = 1
for i in range(K):
ans *= A_minus.pop() % mod
ans %= mod
print((ans % mod))
else:
ans = A_plus.pop()
while len(A_minus) >= 2:
a1 = A_minus.popleft()
a2 = A_minus.popleft()
heapq.heappush(AA, -a1 * a2)
while len(A_plus) >= 2:
a1 = A_plus.pop()
a2 = A_plus.pop()
heapq.heappush(AA, -a1 * a2)
heapq.heapify(AA)
for i in range(K // 2):
ans *= (-1 * heapq.heappop(AA)) % mod
ans %=mod
print((ans% mod))
if __name__ == "__main__":
main()
| 81 | 81 | 1,888 | 1,891 | import sys
sys.setrecursionlimit(10**7)
# import bisect
# import numpy as np
# from collections import deque
from collections import deque
# map(int, sys.stdin.read().split())
import itertools
import heapq
def input():
return sys.stdin.readline().rstrip()
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10**9 + 7
A.sort()
A = deque(A)
# print(A)
A_minus = deque([s for s in A if s < 0])
A_plus = deque([s for s in A if s >= 0])
# print(A_plus)
# print(A_minus)
AA = []
if N == K:
ans = 1
for l in range(N):
ans *= A[l]
ans %= mod
print((ans % mod))
elif K % 2 == 0:
while len(A_minus) >= 2:
a1 = A_minus.popleft()
a2 = A_minus.popleft()
AA.append(-a1 * a2)
while len(A_plus) >= 2:
a1 = A_plus.pop()
a2 = A_plus.pop()
AA.append(-a1 * a2)
ans = 1
heapq.heapify(AA)
for i in range(K // 2):
ans *= (-1 * heapq.heappop(AA)) % mod
ans %= mod
print((ans % mod))
elif len(A_plus) == 0:
ans = 1
for i in range(K):
ans *= A_minus.pop() % mod
ans %= mod
print((ans % mod))
else:
ans = A_plus.pop()
while len(A_minus) >= 2:
a1 = A_minus.popleft()
a2 = A_minus.popleft()
AA.append(-a1 * a2)
while len(A_plus) >= 2:
a1 = A_plus.pop()
a2 = A_plus.pop()
AA.append(-a1 * a2)
heapq.heapify(AA)
for i in range(K // 2):
ans *= -1 * heapq.heappop(AA)
ans %= mod
print((ans % mod))
if __name__ == "__main__":
main()
| import sys
sys.setrecursionlimit(10**7)
# import bisect
# import numpy as np
# from collections import deque
from collections import deque
# map(int, sys.stdin.read().split())
import itertools
import heapq
def input():
return sys.stdin.readline().rstrip()
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
mod = 10**9 + 7
A.sort()
A = deque(A)
# print(A)
A_minus = deque([s for s in A if s < 0])
A_plus = deque([s for s in A if s >= 0])
# print(A_plus)
# print(A_minus)
AA = []
if N == K:
ans = 1
for i in A:
ans *= i % mod
ans %= mod
print((ans % mod))
elif K % 2 == 0:
while len(A_minus) >= 2:
a1 = A_minus.popleft()
a2 = A_minus.popleft()
heapq.heappush(AA, -a1 * a2)
while len(A_plus) >= 2:
a1 = A_plus.pop()
a2 = A_plus.pop()
heapq.heappush(AA, -a1 * a2)
ans = 1
for i in range(K // 2):
ans *= -1 * heapq.heappop(AA)
ans %= mod
print((ans % mod))
elif len(A_plus) == 0:
ans = 1
for i in range(K):
ans *= A_minus.pop() % mod
ans %= mod
print((ans % mod))
else:
ans = A_plus.pop()
while len(A_minus) >= 2:
a1 = A_minus.popleft()
a2 = A_minus.popleft()
heapq.heappush(AA, -a1 * a2)
while len(A_plus) >= 2:
a1 = A_plus.pop()
a2 = A_plus.pop()
heapq.heappush(AA, -a1 * a2)
heapq.heapify(AA)
for i in range(K // 2):
ans *= (-1 * heapq.heappop(AA)) % mod
ans %= mod
print((ans % mod))
if __name__ == "__main__":
main()
| false | 0 | [
"- for l in range(N):",
"- ans *= A[l]",
"+ for i in A:",
"+ ans *= i % mod",
"- AA.append(-a1 * a2)",
"+ heapq.heappush(AA, -a1 * a2)",
"- AA.append(-a1 * a2)",
"+ heapq.heappush(AA, -a1 * a2)",
"- heapq.heapify(... | false | 0.042843 | 0.037416 | 1.145057 | [
"s943212303",
"s637815931"
] |
u170201762 | p02955 | python | s450176175 | s489542977 | 690 | 375 | 3,188 | 44,140 | Accepted | Accepted | 45.65 | def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
D = sum(A)
D = make_divisors(D)[::-1]
for d in D:
a = []
for i in range(N):
if A[i]%d != 0:
a.append(A[i]%d)
a.sort()
b = [d-x for x in a]
b.sort()
c1 = [0]*(len(a)+1)
for i in range(len(a)):
c1[i] = a[i]+c1[i-1]
c2 = [0]*(len(b)+1)
for i in range(len(b)):
c2[i] = b[i]+c2[i-1]
k = float('inf')
for i in range(len(a)):
if c1[i] == c2[len(a)-2-i]:
k = c1[i]
break
if k <= K:
break
print(d) | def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
D = sum(A)
D = make_divisors(D)[::-1]
for d in D:
a = []
for i in range(N):
a.append(A[i]%d)
k = 0
M = max(a)
while k <= K and M != 0:
i = 0
j = 0
m = d
M = 0
for l in range(N):
if 0 < a[l] < m:
m = a[l]
i = l
for l in range(N-1,-1,-1):
if a[l] > M:
M = a[l]
j = l
if m == d:
break
if m <= d-M:
a[i] = 0
a[j] += m
a[j] %= d
k += m
else:
a[i] -= d-M
a[i] %= d
a[j] = 0
k += d-M
if k <= K:
break
print(d) | 40 | 51 | 860 | 1,068 | def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
divisors.sort()
return divisors
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
D = sum(A)
D = make_divisors(D)[::-1]
for d in D:
a = []
for i in range(N):
if A[i] % d != 0:
a.append(A[i] % d)
a.sort()
b = [d - x for x in a]
b.sort()
c1 = [0] * (len(a) + 1)
for i in range(len(a)):
c1[i] = a[i] + c1[i - 1]
c2 = [0] * (len(b) + 1)
for i in range(len(b)):
c2[i] = b[i] + c2[i - 1]
k = float("inf")
for i in range(len(a)):
if c1[i] == c2[len(a) - 2 - i]:
k = c1[i]
break
if k <= K:
break
print(d)
| def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
divisors.sort()
return divisors
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
D = sum(A)
D = make_divisors(D)[::-1]
for d in D:
a = []
for i in range(N):
a.append(A[i] % d)
k = 0
M = max(a)
while k <= K and M != 0:
i = 0
j = 0
m = d
M = 0
for l in range(N):
if 0 < a[l] < m:
m = a[l]
i = l
for l in range(N - 1, -1, -1):
if a[l] > M:
M = a[l]
j = l
if m == d:
break
if m <= d - M:
a[i] = 0
a[j] += m
a[j] %= d
k += m
else:
a[i] -= d - M
a[i] %= d
a[j] = 0
k += d - M
if k <= K:
break
print(d)
| false | 21.568627 | [
"- if A[i] % d != 0:",
"- a.append(A[i] % d)",
"- a.sort()",
"- b = [d - x for x in a]",
"- b.sort()",
"- c1 = [0] * (len(a) + 1)",
"- for i in range(len(a)):",
"- c1[i] = a[i] + c1[i - 1]",
"- c2 = [0] * (len(b) + 1)",
"- for i in range(len(b)):",
"... | false | 0.158391 | 0.087803 | 1.803928 | [
"s450176175",
"s489542977"
] |
u493520238 | p02586 | python | s745699682 | s940580420 | 1,762 | 1,433 | 431,140 | 429,252 | Accepted | Accepted | 18.67 | r,c,k = list(map(int, input().split()))
rcv = [ [0]*c for _ in range(r) ]
for _ in range(k):
ri,ci,vi = list(map(int, input().split()))
rcv[ri-1][ci-1] = vi
# dp[0] = [ [0]*c for _ in range(r) ]
# dp1 = [ [0]*c for _ in range(r) ]
# dp2 = [ [0]*c for _ in range(r) ]
# dp[3] = [ [0]*c for _ in range(r) ]
dp = [ [ [0]*c for _ in range(r) ] for _ in range(4) ]
dp[1][0][0] = rcv[0][0]
for i in range(r):
for j in range(c):
if i+1 < r:
dp[0][i+1][j] = max(dp[0][i][j], dp[1][i][j], dp[2][i][j], dp[3][i][j], dp[0][i+1][j])
if rcv[i+1][j] > 0:
dp[1][i+1][j] = max(dp[1][i+1][j], max(dp[0][i][j], dp[1][i][j], dp[2][i][j], dp[3][i][j])+rcv[i+1][j])
if j+1 < c:
dp[0][i][j+1] = max(dp[0][i][j], dp[0][i][j+1])
dp[1][i][j+1] = max(dp[1][i][j], dp[1][i][j+1])
dp[2][i][j+1] = max(dp[2][i][j], dp[2][i][j+1])
dp[3][i][j+1] = max(dp[3][i][j], dp[3][i][j+1])
if rcv[i][j+1] > 0:
dp[1][i][j+1] = max(dp[1][i][j+1], dp[0][i][j]+rcv[i][j+1])
dp[2][i][j+1] = max(dp[2][i][j+1], dp[1][i][j]+rcv[i][j+1])
dp[3][i][j+1] = max(dp[3][i][j+1], dp[2][i][j]+rcv[i][j+1])
ans = max(dp[0][r-1][c-1], dp[1][r-1][c-1], dp[2][r-1][c-1], dp[3][r-1][c-1])
print(ans)
| import sys
input = sys.stdin.readline
def main():
r,c,k = list(map(int, input().split()))
rcv = [ [0]*c for _ in range(r) ]
for _ in range(k):
ri,ci,vi = list(map(int, input().split()))
rcv[ri-1][ci-1] = vi
# dp[0] = [ [0]*c for _ in range(r) ]
# dp1 = [ [0]*c for _ in range(r) ]
# dp2 = [ [0]*c for _ in range(r) ]
# dp[3] = [ [0]*c for _ in range(r) ]
dp = [ [ [0]*c for _ in range(r) ] for _ in range(4) ]
dp[1][0][0] = rcv[0][0]
for i in range(r):
for j in range(c):
if i+1 < r:
dp[0][i+1][j] = max(dp[0][i][j], dp[1][i][j], dp[2][i][j], dp[3][i][j], dp[0][i+1][j])
if rcv[i+1][j] > 0:
dp[1][i+1][j] = max(dp[1][i+1][j], max(dp[0][i][j], dp[1][i][j], dp[2][i][j], dp[3][i][j])+rcv[i+1][j])
if j+1 < c:
dp[0][i][j+1] = max(dp[0][i][j], dp[0][i][j+1])
dp[1][i][j+1] = max(dp[1][i][j], dp[1][i][j+1])
dp[2][i][j+1] = max(dp[2][i][j], dp[2][i][j+1])
dp[3][i][j+1] = max(dp[3][i][j], dp[3][i][j+1])
if rcv[i][j+1] > 0:
dp[1][i][j+1] = max(dp[1][i][j+1], dp[0][i][j]+rcv[i][j+1])
dp[2][i][j+1] = max(dp[2][i][j+1], dp[1][i][j]+rcv[i][j+1])
dp[3][i][j+1] = max(dp[3][i][j+1], dp[2][i][j]+rcv[i][j+1])
ans = max(dp[0][r-1][c-1], dp[1][r-1][c-1], dp[2][r-1][c-1], dp[3][r-1][c-1])
print(ans)
if __name__ == "__main__":
main() | 34 | 42 | 1,343 | 1,553 | r, c, k = list(map(int, input().split()))
rcv = [[0] * c for _ in range(r)]
for _ in range(k):
ri, ci, vi = list(map(int, input().split()))
rcv[ri - 1][ci - 1] = vi
# dp[0] = [ [0]*c for _ in range(r) ]
# dp1 = [ [0]*c for _ in range(r) ]
# dp2 = [ [0]*c for _ in range(r) ]
# dp[3] = [ [0]*c for _ in range(r) ]
dp = [[[0] * c for _ in range(r)] for _ in range(4)]
dp[1][0][0] = rcv[0][0]
for i in range(r):
for j in range(c):
if i + 1 < r:
dp[0][i + 1][j] = max(
dp[0][i][j], dp[1][i][j], dp[2][i][j], dp[3][i][j], dp[0][i + 1][j]
)
if rcv[i + 1][j] > 0:
dp[1][i + 1][j] = max(
dp[1][i + 1][j],
max(dp[0][i][j], dp[1][i][j], dp[2][i][j], dp[3][i][j])
+ rcv[i + 1][j],
)
if j + 1 < c:
dp[0][i][j + 1] = max(dp[0][i][j], dp[0][i][j + 1])
dp[1][i][j + 1] = max(dp[1][i][j], dp[1][i][j + 1])
dp[2][i][j + 1] = max(dp[2][i][j], dp[2][i][j + 1])
dp[3][i][j + 1] = max(dp[3][i][j], dp[3][i][j + 1])
if rcv[i][j + 1] > 0:
dp[1][i][j + 1] = max(dp[1][i][j + 1], dp[0][i][j] + rcv[i][j + 1])
dp[2][i][j + 1] = max(dp[2][i][j + 1], dp[1][i][j] + rcv[i][j + 1])
dp[3][i][j + 1] = max(dp[3][i][j + 1], dp[2][i][j] + rcv[i][j + 1])
ans = max(
dp[0][r - 1][c - 1], dp[1][r - 1][c - 1], dp[2][r - 1][c - 1], dp[3][r - 1][c - 1]
)
print(ans)
| import sys
input = sys.stdin.readline
def main():
r, c, k = list(map(int, input().split()))
rcv = [[0] * c for _ in range(r)]
for _ in range(k):
ri, ci, vi = list(map(int, input().split()))
rcv[ri - 1][ci - 1] = vi
# dp[0] = [ [0]*c for _ in range(r) ]
# dp1 = [ [0]*c for _ in range(r) ]
# dp2 = [ [0]*c for _ in range(r) ]
# dp[3] = [ [0]*c for _ in range(r) ]
dp = [[[0] * c for _ in range(r)] for _ in range(4)]
dp[1][0][0] = rcv[0][0]
for i in range(r):
for j in range(c):
if i + 1 < r:
dp[0][i + 1][j] = max(
dp[0][i][j], dp[1][i][j], dp[2][i][j], dp[3][i][j], dp[0][i + 1][j]
)
if rcv[i + 1][j] > 0:
dp[1][i + 1][j] = max(
dp[1][i + 1][j],
max(dp[0][i][j], dp[1][i][j], dp[2][i][j], dp[3][i][j])
+ rcv[i + 1][j],
)
if j + 1 < c:
dp[0][i][j + 1] = max(dp[0][i][j], dp[0][i][j + 1])
dp[1][i][j + 1] = max(dp[1][i][j], dp[1][i][j + 1])
dp[2][i][j + 1] = max(dp[2][i][j], dp[2][i][j + 1])
dp[3][i][j + 1] = max(dp[3][i][j], dp[3][i][j + 1])
if rcv[i][j + 1] > 0:
dp[1][i][j + 1] = max(dp[1][i][j + 1], dp[0][i][j] + rcv[i][j + 1])
dp[2][i][j + 1] = max(dp[2][i][j + 1], dp[1][i][j] + rcv[i][j + 1])
dp[3][i][j + 1] = max(dp[3][i][j + 1], dp[2][i][j] + rcv[i][j + 1])
ans = max(
dp[0][r - 1][c - 1],
dp[1][r - 1][c - 1],
dp[2][r - 1][c - 1],
dp[3][r - 1][c - 1],
)
print(ans)
if __name__ == "__main__":
main()
| false | 19.047619 | [
"-r, c, k = list(map(int, input().split()))",
"-rcv = [[0] * c for _ in range(r)]",
"-for _ in range(k):",
"- ri, ci, vi = list(map(int, input().split()))",
"- rcv[ri - 1][ci - 1] = vi",
"-# dp[0] = [ [0]*c for _ in range(r) ]",
"-# dp1 = [ [0]*c for _ in range(r) ]",
"-# dp2 = [ [0]*c for _ in ... | false | 0.073322 | 0.03931 | 1.865222 | [
"s745699682",
"s940580420"
] |
u506858457 | p02862 | python | s181330974 | s171257120 | 509 | 220 | 40,912 | 29,300 | Accepted | Accepted | 56.78 | X,Y=list(map(int,input().split()))
if (X+Y)%3!=0:
print((0))
exit()
A=int((X+Y)/3)
B=int((2*Y-X)/3)
if A<0 or B<0:
print((0))
exit()
MOD=10**9+7
def comb(n,k):
tmp=1
for i in range(n-k+1,n+1):
tmp*=i
tmp%=MOD
for i in range(1,k+1):
tmp*=pow(i,MOD-2,MOD)
tmp%=MOD
return tmp
ans = comb(A,B)
print((ans%MOD)) | #ika tako
def prepare(n, MOD):
f = 1
for m in range(1, n + 1):
f = f * m % MOD
#print(f)
fn = f#n!を求める
#print(fn)
#print(f)
inv = pow(f, MOD - 2, MOD)
#print(inv)
invs = [1] * (n + 1)#[1, 1, 1]のイメージ、逆元？格納テーブル
#print(invs) ⇒ [1, 1, 1]のイメージ、逆元格納テーブル
invs[n] = inv
for m in range(n, 1, -1):#n*(n-1)*(n-2)*...と上から掛けている
inv = inv * m % MOD#なぜ、下から掛けない？
invs[m - 1] = inv
return fn, invs
def solve(x, y):
d, m = divmod(x + y, 3)#商と余り
if m != 0 or x < d or y < d:
#Xとyの合計は3の倍数、x、yがd移動回数以下はあり得ない（1回1個は進む）
return 0
#c = d - x これだと範囲外参照でエラー
c = abs(d - x)
MOD = 10 ** 9 + 7
f, invs = prepare(d, MOD)
return f * invs[c] * invs[d - c] % MOD
#fはn!、invs[c],invs[d - c] はc!,(d-c)!の逆元？
#nCr=n!/(r!*(n-r)!)
x, y = list(map(int, input().split()))
print((solve(x, y))) | 21 | 37 | 346 | 913 | X, Y = list(map(int, input().split()))
if (X + Y) % 3 != 0:
print((0))
exit()
A = int((X + Y) / 3)
B = int((2 * Y - X) / 3)
if A < 0 or B < 0:
print((0))
exit()
MOD = 10**9 + 7
def comb(n, k):
tmp = 1
for i in range(n - k + 1, n + 1):
tmp *= i
tmp %= MOD
for i in range(1, k + 1):
tmp *= pow(i, MOD - 2, MOD)
tmp %= MOD
return tmp
ans = comb(A, B)
print((ans % MOD))
| # ika tako
def prepare(n, MOD):
f = 1
for m in range(1, n + 1):
f = f * m % MOD
# print(f)
fn = f # n!を求める
# print(fn)
# print(f)
inv = pow(f, MOD - 2, MOD)
# print(inv)
invs = [1] * (n + 1) # [1, 1, 1]のイメージ、逆元？格納テーブル
# print(invs) ⇒ [1, 1, 1]のイメージ、逆元格納テーブル
invs[n] = inv
for m in range(n, 1, -1): # n*(n-1)*(n-2)*...と上から掛けている
inv = inv * m % MOD # なぜ、下から掛けない？
invs[m - 1] = inv
return fn, invs
def solve(x, y):
d, m = divmod(x + y, 3) # 商と余り
if m != 0 or x < d or y < d:
# Xとyの合計は3の倍数、x、yがd移動回数以下はあり得ない（1回1個は進む）
return 0
# c = d - x これだと範囲外参照でエラー
c = abs(d - x)
MOD = 10**9 + 7
f, invs = prepare(d, MOD)
return f * invs[c] * invs[d - c] % MOD
# fはn!、invs[c],invs[d - c] はc!,(d-c)!の逆元？
# nCr=n!/(r!*(n-r)!)
x, y = list(map(int, input().split()))
print((solve(x, y)))
| false | 43.243243 | [
"-X, Y = list(map(int, input().split()))",
"-if (X + Y) % 3 != 0:",
"- print((0))",
"- exit()",
"-A = int((X + Y) / 3)",
"-B = int((2 * Y - X) / 3)",
"-if A < 0 or B < 0:",
"- print((0))",
"- exit()",
"-MOD = 10**9 + 7",
"+# ika tako",
"+def prepare(n, MOD):",
"+ f = 1",
"+ ... | false | 0.811875 | 0.292421 | 2.776391 | [
"s181330974",
"s171257120"
] |
u969190727 | p02928 | python | s659573617 | s392317135 | 53 | 25 | 3,188 | 3,188 | Accepted | Accepted | 52.83 | n,k=list(map(int,input().split()))
A=[int(i) for i in input().split()]
import bisect
mod=10**9+7
AA=[]
ans1=0
for i in range(n):
ans1+=i-bisect.bisect_right(AA,A[i])
AA.append(A[i])
AA.sort()
ans2=0
for i in range(n-1):
ans2+=n-bisect.bisect_right(AA,AA[i])
ans=(ans1*k)%mod
ans=(ans+ans2*k*(k-1)//2)%mod
print(ans) | n,k=list(map(int,input().split()))
A=[int(i) for i in input().split()]
mod=10**9+7
import math
import bisect
n_max=2000
nn=int(math.log2(n_max))+1
BIT=[0]*(2**nn)
BIT.insert(0,0)
def bitsum(BIT,i):
s=0
while i>0:
s+=BIT[i]
i-=i&(-i)
return s
def bitadd(BIT,i,x):
while i<=n_max:
BIT[i]+=x
i+=i&(-i)
return BIT
ans1=0
for i in range(n):
ans1+=i-bitsum(BIT,A[i])
bitadd(BIT,A[i],1)
ans2=0
A.sort()
for i in range(n-1):
ans2+=n-bisect.bisect_right(A,A[i])
ans=(ans1*k)%mod
ans=(ans+ans2*k*(k-1)//2)%mod
print(ans) | 17 | 37 | 334 | 578 | n, k = list(map(int, input().split()))
A = [int(i) for i in input().split()]
import bisect
mod = 10**9 + 7
AA = []
ans1 = 0
for i in range(n):
ans1 += i - bisect.bisect_right(AA, A[i])
AA.append(A[i])
AA.sort()
ans2 = 0
for i in range(n - 1):
ans2 += n - bisect.bisect_right(AA, AA[i])
ans = (ans1 * k) % mod
ans = (ans + ans2 * k * (k - 1) // 2) % mod
print(ans)
| n, k = list(map(int, input().split()))
A = [int(i) for i in input().split()]
mod = 10**9 + 7
import math
import bisect
n_max = 2000
nn = int(math.log2(n_max)) + 1
BIT = [0] * (2**nn)
BIT.insert(0, 0)
def bitsum(BIT, i):
s = 0
while i > 0:
s += BIT[i]
i -= i & (-i)
return s
def bitadd(BIT, i, x):
while i <= n_max:
BIT[i] += x
i += i & (-i)
return BIT
ans1 = 0
for i in range(n):
ans1 += i - bitsum(BIT, A[i])
bitadd(BIT, A[i], 1)
ans2 = 0
A.sort()
for i in range(n - 1):
ans2 += n - bisect.bisect_right(A, A[i])
ans = (ans1 * k) % mod
ans = (ans + ans2 * k * (k - 1) // 2) % mod
print(ans)
| false | 54.054054 | [
"+mod = 10**9 + 7",
"+import math",
"-mod = 10**9 + 7",
"-AA = []",
"+n_max = 2000",
"+nn = int(math.log2(n_max)) + 1",
"+BIT = [0] * (2**nn)",
"+BIT.insert(0, 0)",
"+",
"+",
"+def bitsum(BIT, i):",
"+ s = 0",
"+ while i > 0:",
"+ s += BIT[i]",
"+ i -= i & (-i)",
"+... | false | 0.035676 | 0.074193 | 0.480854 | [
"s659573617",
"s392317135"
] |
u760569096 | p02983 | python | s336181986 | s151985670 | 507 | 86 | 9,180 | 9,112 | Accepted | Accepted | 83.04 | l,r = list(map(int, input().split()))
if l//2019 != r//2019:
print((0))
exit(0)
l = l%2019
r = r%2019
a = 2019
for i in range(l,r+1):
for j in range(l,i):
a = min(a,(i*j)%2019)
print(a)
| l,r = list(map(int, input().split()))
if l//2019 != r//2019:
print((0))
exit(0)
l = l%2019
r = r%2019
a = 2019
for i in range(l,r+1):
for j in range(l,i):
a = min(a,(i*j)%2019)
if a == 0:
print((0))
exit(0)
print(a) | 11 | 14 | 198 | 244 | l, r = list(map(int, input().split()))
if l // 2019 != r // 2019:
print((0))
exit(0)
l = l % 2019
r = r % 2019
a = 2019
for i in range(l, r + 1):
for j in range(l, i):
a = min(a, (i * j) % 2019)
print(a)
| l, r = list(map(int, input().split()))
if l // 2019 != r // 2019:
print((0))
exit(0)
l = l % 2019
r = r % 2019
a = 2019
for i in range(l, r + 1):
for j in range(l, i):
a = min(a, (i * j) % 2019)
if a == 0:
print((0))
exit(0)
print(a)
| false | 21.428571 | [
"+ if a == 0:",
"+ print((0))",
"+ exit(0)"
] | false | 0.038012 | 0.037601 | 1.010912 | [
"s336181986",
"s151985670"
] |
u697758384 | p02711 | python | s640413972 | s316533183 | 22 | 19 | 9,024 | 8,884 | Accepted | Accepted | 13.64 | S = eval(input())
if "7" in S:
print("Yes")
else:
print("No") | N = eval(input())
if "7" in N:
print("Yes")
else:
print("No") | 5 | 5 | 67 | 67 | S = eval(input())
if "7" in S:
print("Yes")
else:
print("No")
| N = eval(input())
if "7" in N:
print("Yes")
else:
print("No")
| false | 0 | [
"-S = eval(input())",
"-if \"7\" in S:",
"+N = eval(input())",
"+if \"7\" in N:"
] | false | 0.074144 | 0.075434 | 0.982894 | [
"s640413972",
"s316533183"
] |
u145600939 | p02695 | python | s078059880 | s357479453 | 1,166 | 699 | 9,148 | 9,228 | Accepted | Accepted | 40.05 | import itertools
n,m,q = list(map(int,input().split()))
a = [0]*q
b = [0]*q
c = [0]*q
d = [0]*q
for i in range(q):
a[i],b[i],c[i],d[i] = list(map(int,input().split()))
ans = 0
for A in itertools.combinations_with_replacement(list(range(1,m+1)),n):
tmp = 0
for i in range(q):
if A[b[i]-1] - A[a[i]-1] == c[i]:
tmp += d[i]
ans = max(ans,tmp)
print(ans)
| n,m,q = list(map(int,input().split()))
a = [0]*q
b = [0]*q
c = [0]*q
d = [0]*q
for i in range(q):
a[i],b[i],c[i],d[i] = list(map(int,input().split()))
a[i] -= 1
b[i] -= 1
A = [0]*n
ans = 0
def dfs(h):
global ans
if h == n-1:
cnt = 0
for i in range(q):
if A[b[i]] - A[a[i]] == c[i]:
cnt += d[i]
ans = max(ans,cnt)
else:
for i in range(A[h],m+1):
A[h+1] = i
dfs(h+1)
return
for i in range(1,m+1):
A[0] = i
dfs(0)
print(ans)
| 16 | 29 | 384 | 559 | import itertools
n, m, q = list(map(int, input().split()))
a = [0] * q
b = [0] * q
c = [0] * q
d = [0] * q
for i in range(q):
a[i], b[i], c[i], d[i] = list(map(int, input().split()))
ans = 0
for A in itertools.combinations_with_replacement(list(range(1, m + 1)), n):
tmp = 0
for i in range(q):
if A[b[i] - 1] - A[a[i] - 1] == c[i]:
tmp += d[i]
ans = max(ans, tmp)
print(ans)
| n, m, q = list(map(int, input().split()))
a = [0] * q
b = [0] * q
c = [0] * q
d = [0] * q
for i in range(q):
a[i], b[i], c[i], d[i] = list(map(int, input().split()))
a[i] -= 1
b[i] -= 1
A = [0] * n
ans = 0
def dfs(h):
global ans
if h == n - 1:
cnt = 0
for i in range(q):
if A[b[i]] - A[a[i]] == c[i]:
cnt += d[i]
ans = max(ans, cnt)
else:
for i in range(A[h], m + 1):
A[h + 1] = i
dfs(h + 1)
return
for i in range(1, m + 1):
A[0] = i
dfs(0)
print(ans)
| false | 44.827586 | [
"-import itertools",
"-",
"+ a[i] -= 1",
"+ b[i] -= 1",
"+A = [0] * n",
"-for A in itertools.combinations_with_replacement(list(range(1, m + 1)), n):",
"- tmp = 0",
"- for i in range(q):",
"- if A[b[i] - 1] - A[a[i] - 1] == c[i]:",
"- tmp += d[i]",
"- ans = max(a... | false | 0.045576 | 0.058157 | 0.783659 | [
"s078059880",
"s357479453"
] |
u508732591 | p02314 | python | s331397039 | s214912635 | 550 | 440 | 9,616 | 9,616 | Accepted | Accepted | 20 | n = int(input().split()[0])
c = list([x for x in map(int,input().split()) if x <= n])
m = len(c)
minimum = [ i for i in range(n+1) ]
for i in c:
minimum[i] = 1
for i in range(1,n+1):
if minimum[i] <= 2:
continue
for j in range(m):
if c[j]<=i and minimum[i-c[j]] + 1 < minimum[i]:
minimum[i] = minimum[i-c[j]]+1
print((minimum[n])) | n = int(input().split()[0])
c = list([x for x in map(int,input().split()) if x <= n])
minimum = [ i for i in range(n+1) ]
for i in c:
minimum[i] = 1
for i in range(2,n+1):
for j in c:
if j<=i and minimum[i-j] + 1 < minimum[i]:
minimum[i] = minimum[i-j]+1
print((minimum[n])) | 16 | 13 | 387 | 316 | n = int(input().split()[0])
c = list([x for x in map(int, input().split()) if x <= n])
m = len(c)
minimum = [i for i in range(n + 1)]
for i in c:
minimum[i] = 1
for i in range(1, n + 1):
if minimum[i] <= 2:
continue
for j in range(m):
if c[j] <= i and minimum[i - c[j]] + 1 < minimum[i]:
minimum[i] = minimum[i - c[j]] + 1
print((minimum[n]))
| n = int(input().split()[0])
c = list([x for x in map(int, input().split()) if x <= n])
minimum = [i for i in range(n + 1)]
for i in c:
minimum[i] = 1
for i in range(2, n + 1):
for j in c:
if j <= i and minimum[i - j] + 1 < minimum[i]:
minimum[i] = minimum[i - j] + 1
print((minimum[n]))
| false | 18.75 | [
"-m = len(c)",
"-for i in range(1, n + 1):",
"- if minimum[i] <= 2:",
"- continue",
"- for j in range(m):",
"- if c[j] <= i and minimum[i - c[j]] + 1 < minimum[i]:",
"- minimum[i] = minimum[i - c[j]] + 1",
"+for i in range(2, n + 1):",
"+ for j in c:",
"+ i... | false | 0.042608 | 0.043515 | 0.979136 | [
"s331397039",
"s214912635"
] |
u589276934 | p02409 | python | s657496604 | s385953216 | 40 | 20 | 7,756 | 7,680 | Accepted | Accepted | 50 | # coding: utf-8
def make_buildings():
return [[[0 for room in range(10)] for floor in range(3)] for building in range(4)]
def print_building(building):
return "\n".join([" " + " ".join(map(str, floor)) for floor in building])
line_number = int(eval(input()))
regidents_data = [list(map(int, input().split(" "))) for i in range(line_number)]
buildings = make_buildings()
for data in regidents_data:
b, f, r, v = data
buildings[b-1][f-1][r-1] += v
print(("\n####################\n".join(map(print_building, buildings)))) | # coding: utf-8
def format_building(building):
return "\n".join([" " + " ".join(map(str, floor)) for floor in building])
line_number = int(eval(input()))
regidents_data = [list(map(int, input().split(" "))) for i in range(line_number)]
buildings = [[[0 for room in range(10)] for floor in range(3)] for building in range(4)]
for data in regidents_data:
b, f, r, v = data
buildings[b-1][f-1][r-1] += v
print(("\n####################\n".join(map(format_building, buildings)))) | 16 | 13 | 553 | 501 | # coding: utf-8
def make_buildings():
return [[[0 for room in range(10)] for floor in range(3)] for building in range(4)]
def print_building(building):
return "\n".join([" " + " ".join(map(str, floor)) for floor in building])
line_number = int(eval(input()))
regidents_data = [list(map(int, input().split(" "))) for i in range(line_number)]
buildings = make_buildings()
for data in regidents_data:
b, f, r, v = data
buildings[b - 1][f - 1][r - 1] += v
print(("\n####################\n".join(map(print_building, buildings))))
| # coding: utf-8
def format_building(building):
return "\n".join([" " + " ".join(map(str, floor)) for floor in building])
line_number = int(eval(input()))
regidents_data = [list(map(int, input().split(" "))) for i in range(line_number)]
buildings = [[[0 for room in range(10)] for floor in range(3)] for building in range(4)]
for data in regidents_data:
b, f, r, v = data
buildings[b - 1][f - 1][r - 1] += v
print(("\n####################\n".join(map(format_building, buildings))))
| false | 18.75 | [
"-def make_buildings():",
"- return [[[0 for room in range(10)] for floor in range(3)] for building in range(4)]",
"-",
"-",
"-def print_building(building):",
"+def format_building(building):",
"-buildings = make_buildings()",
"+buildings = [[[0 for room in range(10)] for floor in range(3)] for bui... | false | 0.047483 | 0.048159 | 0.985944 | [
"s657496604",
"s385953216"
] |
u729133443 | p02889 | python | s912157597 | s242323644 | 804 | 582 | 89,680 | 40,764 | Accepted | Accepted | 27.61 | from subprocess import*
call(('python3','-c',"""
from scipy.sparse import*
s=csgraph.floyd_warshall
n,m,l,*t=map(int,open(0).read().split())
d=eval('[9e9]*-~n,'*-~n)
for a,b,c in zip(*[iter(t[:m*3])]*3):d[a][b]=d[b][a]=c
d=s(d)
d[d>l]=9e9
d[d<=l]=1
d=s(d)
d[d>9e9]=9e9
for s,t in zip(*[iter(t[m*3+1:])]*2):print(int(d[s,t]%9e9-1))
""")) | from scipy.sparse import*
f=csgraph.floyd_warshall
I=9e9
n,m,l,*t=list(map(int,open(0).read().split()))
d=eval('[I]*-~n,'*-~n)
for a,b,c in zip(*[iter(t[:m*3])]*3):d[a][b]=d[b][a]=c
d=f(d)
d[d>l]=I
d[d<I]=1
d=f(d)
d[d>I]=I
for i in zip(*[iter(t[m*3+1:])]*2):print((int(d[i]%I-1))) | 14 | 12 | 349 | 283 | from subprocess import *
call(
(
"python3",
"-c",
"""
from scipy.sparse import*
s=csgraph.floyd_warshall
n,m,l,*t=map(int,open(0).read().split())
d=eval('[9e9]*-~n,'*-~n)
for a,b,c in zip(*[iter(t[:m*3])]*3):d[a][b]=d[b][a]=c
d=s(d)
d[d>l]=9e9
d[d<=l]=1
d=s(d)
d[d>9e9]=9e9
for s,t in zip(*[iter(t[m*3+1:])]*2):print(int(d[s,t]%9e9-1))
""",
)
)
| from scipy.sparse import *
f = csgraph.floyd_warshall
I = 9e9
n, m, l, *t = list(map(int, open(0).read().split()))
d = eval("[I]*-~n," * -~n)
for a, b, c in zip(*[iter(t[: m * 3])] * 3):
d[a][b] = d[b][a] = c
d = f(d)
d[d > l] = I
d[d < I] = 1
d = f(d)
d[d > I] = I
for i in zip(*[iter(t[m * 3 + 1 :])] * 2):
print((int(d[i] % I - 1)))
| false | 14.285714 | [
"-from subprocess import *",
"+from scipy.sparse import *",
"-call(",
"- (",
"- \"python3\",",
"- \"-c\",",
"- \"\"\"",
"-from scipy.sparse import*",
"-s=csgraph.floyd_warshall",
"-n,m,l,*t=map(int,open(0).read().split())",
"-d=eval('[9e9]*-~n,'*-~n)",
"-for a,b,c in zi... | false | 0.299634 | 0.474519 | 0.631448 | [
"s912157597",
"s242323644"
] |
u885986895 | p02726 | python | s229345624 | s534969644 | 430 | 256 | 82,012 | 46,172 | Accepted | Accepted | 40.47 | import sys
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
d = [[sys.maxsize for _ in range(N)] for _ in range(N)]
for i in range(N):
for j in range(N):
d[i][j] = min(abs(j-i), abs(X-i) + 1 + abs(j-Y))
answer = [0 for _ in range(N-1)]
for h in range(N):
for i in range(h+1, N):
if h != i:
answer[d[h][i]-1] += 1
for k in range(N-1):
print((answer[k])) | import sys
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
answer = [0 for _ in range(N-1)]
for i in range(N):
for j in range(i+1, N):
answer[min(j-i, abs(X-i) + 1 + abs(j-Y))-1] += 1
for k in range(N-1):
print((answer[k])) | 21 | 14 | 397 | 248 | import sys
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
d = [[sys.maxsize for _ in range(N)] for _ in range(N)]
for i in range(N):
for j in range(N):
d[i][j] = min(abs(j - i), abs(X - i) + 1 + abs(j - Y))
answer = [0 for _ in range(N - 1)]
for h in range(N):
for i in range(h + 1, N):
if h != i:
answer[d[h][i] - 1] += 1
for k in range(N - 1):
print((answer[k]))
| import sys
N, X, Y = list(map(int, input().split()))
X -= 1
Y -= 1
answer = [0 for _ in range(N - 1)]
for i in range(N):
for j in range(i + 1, N):
answer[min(j - i, abs(X - i) + 1 + abs(j - Y)) - 1] += 1
for k in range(N - 1):
print((answer[k]))
| false | 33.333333 | [
"-d = [[sys.maxsize for _ in range(N)] for _ in range(N)]",
"+answer = [0 for _ in range(N - 1)]",
"- for j in range(N):",
"- d[i][j] = min(abs(j - i), abs(X - i) + 1 + abs(j - Y))",
"-answer = [0 for _ in range(N - 1)]",
"-for h in range(N):",
"- for i in range(h + 1, N):",
"- if ... | false | 0.046146 | 0.044939 | 1.026867 | [
"s229345624",
"s534969644"
] |
u375616706 | p03652 | python | s947802064 | s024464788 | 1,974 | 1,768 | 4,596 | 4,588 | Accepted | Accepted | 10.44 | from collections import Counter
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, M = list(map(int, input().split()))
mat = [list([int(x)-1 for x in input().split()]) for _ in range(N)]
ans = N
sports_cand = set([v for v in range(M)])
for _ in range(M-1):
C = Counter()
for n in range(N):
for m in range(M):
if mat[n][m] in sports_cand:
C[mat[n][m]] += 1
break
tmp = 0
key, val = C.most_common(1)[0]
ans = min(ans, val)
sports_cand -= {key}
print(ans)
| from collections import Counter
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, M = list(map(int, input().split()))
mat = [list([int(x)-1 for x in input().split()]) for _ in range(N)]
ans = N
Q = [set([v for v in range(M)])]
while Q:
C = Counter()
sports_cand = Q.pop(0)
for n in range(N):
for m in range(M):
if mat[n][m] in sports_cand:
C[mat[n][m]] += 1
break
tmp = 0
rem_key = set()
for key, val in C.most_common():
if val >= tmp:
tmp = val
ans = min(ans, val)
rem_key.add(key)
else:
break
if len(sports_cand) > 2:
Q.append(sports_cand-rem_key)
print(ans)
| 23 | 31 | 571 | 764 | from collections import Counter
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, M = list(map(int, input().split()))
mat = [list([int(x) - 1 for x in input().split()]) for _ in range(N)]
ans = N
sports_cand = set([v for v in range(M)])
for _ in range(M - 1):
C = Counter()
for n in range(N):
for m in range(M):
if mat[n][m] in sports_cand:
C[mat[n][m]] += 1
break
tmp = 0
key, val = C.most_common(1)[0]
ans = min(ans, val)
sports_cand -= {key}
print(ans)
| from collections import Counter
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, M = list(map(int, input().split()))
mat = [list([int(x) - 1 for x in input().split()]) for _ in range(N)]
ans = N
Q = [set([v for v in range(M)])]
while Q:
C = Counter()
sports_cand = Q.pop(0)
for n in range(N):
for m in range(M):
if mat[n][m] in sports_cand:
C[mat[n][m]] += 1
break
tmp = 0
rem_key = set()
for key, val in C.most_common():
if val >= tmp:
tmp = val
ans = min(ans, val)
rem_key.add(key)
else:
break
if len(sports_cand) > 2:
Q.append(sports_cand - rem_key)
print(ans)
| false | 25.806452 | [
"-sports_cand = set([v for v in range(M)])",
"-for _ in range(M - 1):",
"+Q = [set([v for v in range(M)])]",
"+while Q:",
"+ sports_cand = Q.pop(0)",
"- key, val = C.most_common(1)[0]",
"- ans = min(ans, val)",
"- sports_cand -= {key}",
"+ rem_key = set()",
"+ for key, val in C.m... | false | 0.047254 | 0.060965 | 0.775112 | [
"s947802064",
"s024464788"
] |
u282228874 | p03487 | python | s793131169 | s644989589 | 94 | 83 | 18,676 | 18,672 | Accepted | Accepted | 11.7 | from collections import Counter
n = int(eval(input()))
A = [int(i) for i in input().split()]
D = Counter(A)
res = 0
for i in list(D.items()):
if i[0] < i[1]:
res += i[1]-i[0]
elif i[0] > i[1]:
res += i[1]
print(res) | from collections import Counter
n = int(eval(input()))
A = list(map(int,input().split()))
D = Counter(A)
res = 0
for i,v in list(D.items()):
if i > v:
res += v
elif i < v:
res += v-i
print(res)
| 15 | 12 | 245 | 218 | from collections import Counter
n = int(eval(input()))
A = [int(i) for i in input().split()]
D = Counter(A)
res = 0
for i in list(D.items()):
if i[0] < i[1]:
res += i[1] - i[0]
elif i[0] > i[1]:
res += i[1]
print(res)
| from collections import Counter
n = int(eval(input()))
A = list(map(int, input().split()))
D = Counter(A)
res = 0
for i, v in list(D.items()):
if i > v:
res += v
elif i < v:
res += v - i
print(res)
| false | 20 | [
"-A = [int(i) for i in input().split()]",
"+A = list(map(int, input().split()))",
"-for i in list(D.items()):",
"- if i[0] < i[1]:",
"- res += i[1] - i[0]",
"- elif i[0] > i[1]:",
"- res += i[1]",
"+for i, v in list(D.items()):",
"+ if i > v:",
"+ res += v",
"+ e... | false | 0.03899 | 0.032785 | 1.189255 | [
"s793131169",
"s644989589"
] |
u814986259 | p03363 | python | s494417681 | s937612423 | 226 | 203 | 40,868 | 38,932 | Accepted | Accepted | 10.18 | import collections
N = int(eval(input()))
A = list(map(int, input().split()))
sumA = [0]*(N+1)
table = collections.defaultdict(int)
table[0] += 1
for i in range(N):
sumA[i+1] = sumA[i]+A[i]
table[sumA[i+1]] += 1
ans = 0
table = list(table.values())
table = [x for x in table if x > 1]
for x in table:
ans += x*(x-1)//2
print(ans)
| import itertools
import collections
N = int(eval(input()))
A = list(map(int, input().split()))
table = collections.defaultdict(int)
A = [0] + A
s = itertools.accumulate(A)
for x in s:
table[x] += 1
ans = 0
for x in table:
if table[x] > 1:
ans += (table[x] * (table[x]-1)) // 2
print(ans)
| 17 | 15 | 348 | 313 | import collections
N = int(eval(input()))
A = list(map(int, input().split()))
sumA = [0] * (N + 1)
table = collections.defaultdict(int)
table[0] += 1
for i in range(N):
sumA[i + 1] = sumA[i] + A[i]
table[sumA[i + 1]] += 1
ans = 0
table = list(table.values())
table = [x for x in table if x > 1]
for x in table:
ans += x * (x - 1) // 2
print(ans)
| import itertools
import collections
N = int(eval(input()))
A = list(map(int, input().split()))
table = collections.defaultdict(int)
A = [0] + A
s = itertools.accumulate(A)
for x in s:
table[x] += 1
ans = 0
for x in table:
if table[x] > 1:
ans += (table[x] * (table[x] - 1)) // 2
print(ans)
| false | 11.764706 | [
"+import itertools",
"-sumA = [0] * (N + 1)",
"-table[0] += 1",
"-for i in range(N):",
"- sumA[i + 1] = sumA[i] + A[i]",
"- table[sumA[i + 1]] += 1",
"+A = [0] + A",
"+s = itertools.accumulate(A)",
"+for x in s:",
"+ table[x] += 1",
"-table = list(table.values())",
"-table = [x for x ... | false | 0.038374 | 0.036782 | 1.043285 | [
"s494417681",
"s937612423"
] |
u255673886 | p02787 | python | s650332909 | s106901311 | 617 | 541 | 43,100 | 43,756 | Accepted | Accepted | 12.32 | from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import permutations,combinations
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
# from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint
def myinput():
return list(map(int,input().split()))
def mylistinput(n):
return [ list(myinput()) for _ in range(n) ]
def mycol(data,col):
return [ row[col] for row in data ]
def mysort(data,col,reverse_flag):
data.sort(key=lambda x:x[col],reverse=reverse_flag)
return data
def mymax(data):
M = -1*float("inf")
for i in range(len(data)):
m = max(data[i])
M = max(M,m)
return M
def mymin(data):
m = float("inf")
for i in range(len(data)):
M = min(data[i])
m = min(m,M)
return m
def myoutput(ls,space=True):
if space:
if len(ls)==0:
print(" ")
elif type(ls[0])==str:
print((" ".join(ls)))
elif type(ls[0])==int:
print((" ".join(map(str,ls))))
else:
print("Output Error")
else:
if len(ls)==0:
print("")
elif type(ls[0])==str:
print(("".join(ls)))
elif type(ls[0])==int:
print(("".join(map(str,ls))))
else:
print("Output Error")
H,N = myinput()
AB = mylistinput(N)
AB_sorted = mysort(AB,0,True)
# pprint(AB_sorted)
maxA = AB[0][0]
# print(maxA)
HA = H+maxA
# dp[i]: 敵の体力をiだけ減らすとしたときの，消耗魔力累計値の最小値
dp = [float("inf")]*(H+1)
dp[0] = 0
for i in range(1,H+1):
for j in range(N):
a = AB[j][0]
b = AB[j][1]
if i<a:
dp[i] = min( dp[i], dp[0]+b )
else:
dp[i] = min( dp[i], dp[i-a]+b )
# print(dp)
ans = dp[H]
print(ans) | from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import permutations,combinations
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
# from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint
def myinput():
return list(map(int,input().split()))
def mylistinput(n):
return [ list(myinput()) for _ in range(n) ]
def mycol(data,col):
return [ row[col] for row in data ]
def mysort(data,col,reverse_flag):
data.sort(key=lambda x:x[col],reverse=reverse_flag)
return data
def mymax(data):
M = -1*float("inf")
for i in range(len(data)):
m = max(data[i])
M = max(M,m)
return M
def mymin(data):
m = float("inf")
for i in range(len(data)):
M = min(data[i])
m = min(m,M)
return m
def myoutput(ls,space=True):
if space:
if len(ls)==0:
print(" ")
elif type(ls[0])==str:
print((" ".join(ls)))
elif type(ls[0])==int:
print((" ".join(map(str,ls))))
else:
print("Output Error")
else:
if len(ls)==0:
print("")
elif type(ls[0])==str:
print(("".join(ls)))
elif type(ls[0])==int:
print(("".join(map(str,ls))))
else:
print("Output Error")
H,N = myinput()
AB = mylistinput(N)
# dp[i]: 敵の体力をiだけ減らすとしたときの，消耗魔力累計値の最小値
dp = [float("inf")]*(H+1)
dp[0] = 0
for i in range(1,H+1):
for j in range(N):
a = AB[j][0]
b = AB[j][1]
if i<a:
dp[i] = min( dp[i], dp[0]+b )
else:
dp[i] = min( dp[i], dp[i-a]+b )
# print(dp)
ans = dp[H]
print(ans) | 82 | 76 | 1,967 | 1,868 | from collections import deque
from heapq import heapify, heappop, heappush, heappushpop
from copy import copy, deepcopy
from itertools import permutations, combinations
from collections import defaultdict, Counter
from bisect import bisect_left, bisect_right
# from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint
def myinput():
return list(map(int, input().split()))
def mylistinput(n):
return [list(myinput()) for _ in range(n)]
def mycol(data, col):
return [row[col] for row in data]
def mysort(data, col, reverse_flag):
data.sort(key=lambda x: x[col], reverse=reverse_flag)
return data
def mymax(data):
M = -1 * float("inf")
for i in range(len(data)):
m = max(data[i])
M = max(M, m)
return M
def mymin(data):
m = float("inf")
for i in range(len(data)):
M = min(data[i])
m = min(m, M)
return m
def myoutput(ls, space=True):
if space:
if len(ls) == 0:
print(" ")
elif type(ls[0]) == str:
print((" ".join(ls)))
elif type(ls[0]) == int:
print((" ".join(map(str, ls))))
else:
print("Output Error")
else:
if len(ls) == 0:
print("")
elif type(ls[0]) == str:
print(("".join(ls)))
elif type(ls[0]) == int:
print(("".join(map(str, ls))))
else:
print("Output Error")
H, N = myinput()
AB = mylistinput(N)
AB_sorted = mysort(AB, 0, True)
# pprint(AB_sorted)
maxA = AB[0][0]
# print(maxA)
HA = H + maxA
# dp[i]: 敵の体力をiだけ減らすとしたときの，消耗魔力累計値の最小値
dp = [float("inf")] * (H + 1)
dp[0] = 0
for i in range(1, H + 1):
for j in range(N):
a = AB[j][0]
b = AB[j][1]
if i < a:
dp[i] = min(dp[i], dp[0] + b)
else:
dp[i] = min(dp[i], dp[i - a] + b)
# print(dp)
ans = dp[H]
print(ans)
| from collections import deque
from heapq import heapify, heappop, heappush, heappushpop
from copy import copy, deepcopy
from itertools import permutations, combinations
from collections import defaultdict, Counter
from bisect import bisect_left, bisect_right
# from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint
def myinput():
return list(map(int, input().split()))
def mylistinput(n):
return [list(myinput()) for _ in range(n)]
def mycol(data, col):
return [row[col] for row in data]
def mysort(data, col, reverse_flag):
data.sort(key=lambda x: x[col], reverse=reverse_flag)
return data
def mymax(data):
M = -1 * float("inf")
for i in range(len(data)):
m = max(data[i])
M = max(M, m)
return M
def mymin(data):
m = float("inf")
for i in range(len(data)):
M = min(data[i])
m = min(m, M)
return m
def myoutput(ls, space=True):
if space:
if len(ls) == 0:
print(" ")
elif type(ls[0]) == str:
print((" ".join(ls)))
elif type(ls[0]) == int:
print((" ".join(map(str, ls))))
else:
print("Output Error")
else:
if len(ls) == 0:
print("")
elif type(ls[0]) == str:
print(("".join(ls)))
elif type(ls[0]) == int:
print(("".join(map(str, ls))))
else:
print("Output Error")
H, N = myinput()
AB = mylistinput(N)
# dp[i]: 敵の体力をiだけ減らすとしたときの，消耗魔力累計値の最小値
dp = [float("inf")] * (H + 1)
dp[0] = 0
for i in range(1, H + 1):
for j in range(N):
a = AB[j][0]
b = AB[j][1]
if i < a:
dp[i] = min(dp[i], dp[0] + b)
else:
dp[i] = min(dp[i], dp[i - a] + b)
# print(dp)
ans = dp[H]
print(ans)
| false | 7.317073 | [
"-AB_sorted = mysort(AB, 0, True)",
"-# pprint(AB_sorted)",
"-maxA = AB[0][0]",
"-# print(maxA)",
"-HA = H + maxA"
] | false | 0.109543 | 0.0868 | 1.262016 | [
"s650332909",
"s106901311"
] |
u992910889 | p03611 | python | s101487242 | s105062924 | 225 | 152 | 56,364 | 14,564 | Accepted | Accepted | 32.44 | from collections import Counter, deque
# from copy import copy, deepcopy
# from fractions import gcd
# from functools import reduce
# from itertools import accumulate, permutations, combinations, combinations_with_replacement, groupby, product
# import math
# import numpy as np
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
def resolve():
N=int(eval(input()))
A=list(map(int,input().split()))
AA=Counter(A)
maxval=0
for i in list(AA.keys()):
maxval=max(AA[i-1]+AA[i]+AA[i+1],maxval)
print(maxval)
resolve() | from collections import Counter, deque
# from copy import copy, deepcopy
# from fractions import gcd
# from functools import reduce
# from itertools import accumulate, permutations, combinations, combinations_with_replacement, groupby, product
# import math
# import numpy as np
# from operator import xor
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
def resolve():
N=int(eval(input()))
A=list(map(int,input().split()))
AA=Counter(A)
ans=0
if N==1:
print((1))
elif N==2:
if abs(A[0]-A[1])<=1:
print((2))
else:
print((1))
else:
for i in range(N-2):
ans=max(AA[i]+AA[i+1]+AA[i+2],ans)
print(ans)
resolve() | 24 | 33 | 585 | 763 | from collections import Counter, deque
# from copy import copy, deepcopy
# from fractions import gcd
# from functools import reduce
# from itertools import accumulate, permutations, combinations, combinations_with_replacement, groupby, product
# import math
# import numpy as np
import sys
sys.setrecursionlimit(10**5 + 10)
# input = sys.stdin.readline
def resolve():
N = int(eval(input()))
A = list(map(int, input().split()))
AA = Counter(A)
maxval = 0
for i in list(AA.keys()):
maxval = max(AA[i - 1] + AA[i] + AA[i + 1], maxval)
print(maxval)
resolve()
| from collections import Counter, deque
# from copy import copy, deepcopy
# from fractions import gcd
# from functools import reduce
# from itertools import accumulate, permutations, combinations, combinations_with_replacement, groupby, product
# import math
# import numpy as np
# from operator import xor
import sys
sys.setrecursionlimit(10**5 + 10)
# input = sys.stdin.readline
def resolve():
N = int(eval(input()))
A = list(map(int, input().split()))
AA = Counter(A)
ans = 0
if N == 1:
print((1))
elif N == 2:
if abs(A[0] - A[1]) <= 1:
print((2))
else:
print((1))
else:
for i in range(N - 2):
ans = max(AA[i] + AA[i + 1] + AA[i + 2], ans)
print(ans)
resolve()
| false | 27.272727 | [
"+# from operator import xor",
"- maxval = 0",
"- for i in list(AA.keys()):",
"- maxval = max(AA[i - 1] + AA[i] + AA[i + 1], maxval)",
"- print(maxval)",
"+ ans = 0",
"+ if N == 1:",
"+ print((1))",
"+ elif N == 2:",
"+ if abs(A[0] - A[1]) <= 1:",
"+ ... | false | 0.035449 | 0.157533 | 0.225028 | [
"s101487242",
"s105062924"
] |
u711539583 | p03112 | python | s278392237 | s491634238 | 996 | 907 | 16,152 | 16,128 | Accepted | Accepted | 8.94 | import sys
from bisect import bisect_left
inpurt = sys.stdin.readline
a, b, q = list(map(int, input().split()))
INF = 10 ** 11
s = [-INF]
s_append = s.append
for i in range(a):
si = int(eval(input()))
s_append(si)
s_append(INF)
t = [-INF]
t_append = t.append
for i in range(b):
ti = int(eval(input()))
t_append(ti)
t_append(INF)
x = []
x_append = x.append
for i in range(q):
xi = int(eval(input()))
x_append(xi)
for xi in x:
index_s = bisect_left(s, xi)
s1 = xi - s[index_s - 1]
s2 = s[index_s] - xi
index_t = bisect_left(t, xi)
t1 = xi - t[index_t - 1]
t2 = t[index_t] -xi
print((min(max(s1, t1), max(s2, t2), min(s1, t2) * 2 + max(s1, t2), min(s2, t1) * 2 + max(s2, t1))))
| import sys
from bisect import bisect_left
inpurt = sys.stdin.readline
a, b, q = list(map(int, input().split()))
INF = 10 ** 11
s = [-INF] + [int(eval(input())) for _ in range(a)] + [INF]
t = [-INF] + [int(eval(input())) for _ in range(b)] + [INF]
x = [int(eval(input())) for _ in range(q)]
for xi in x:
index_s = bisect_left(s, xi)
s1 = xi - s[index_s - 1]
s2 = s[index_s] - xi
index_t = bisect_left(t, xi)
t1 = xi - t[index_t - 1]
t2 = t[index_t] -xi
print((min(max(s1, t1), max(s2, t2), min(s1, t2) * 2 + max(s1, t2), min(s2, t1) * 2 + max(s2, t1))))
| 31 | 17 | 732 | 572 | import sys
from bisect import bisect_left
inpurt = sys.stdin.readline
a, b, q = list(map(int, input().split()))
INF = 10**11
s = [-INF]
s_append = s.append
for i in range(a):
si = int(eval(input()))
s_append(si)
s_append(INF)
t = [-INF]
t_append = t.append
for i in range(b):
ti = int(eval(input()))
t_append(ti)
t_append(INF)
x = []
x_append = x.append
for i in range(q):
xi = int(eval(input()))
x_append(xi)
for xi in x:
index_s = bisect_left(s, xi)
s1 = xi - s[index_s - 1]
s2 = s[index_s] - xi
index_t = bisect_left(t, xi)
t1 = xi - t[index_t - 1]
t2 = t[index_t] - xi
print(
(
min(
max(s1, t1),
max(s2, t2),
min(s1, t2) * 2 + max(s1, t2),
min(s2, t1) * 2 + max(s2, t1),
)
)
)
| import sys
from bisect import bisect_left
inpurt = sys.stdin.readline
a, b, q = list(map(int, input().split()))
INF = 10**11
s = [-INF] + [int(eval(input())) for _ in range(a)] + [INF]
t = [-INF] + [int(eval(input())) for _ in range(b)] + [INF]
x = [int(eval(input())) for _ in range(q)]
for xi in x:
index_s = bisect_left(s, xi)
s1 = xi - s[index_s - 1]
s2 = s[index_s] - xi
index_t = bisect_left(t, xi)
t1 = xi - t[index_t - 1]
t2 = t[index_t] - xi
print(
(
min(
max(s1, t1),
max(s2, t2),
min(s1, t2) * 2 + max(s1, t2),
min(s2, t1) * 2 + max(s2, t1),
)
)
)
| false | 45.16129 | [
"-s = [-INF]",
"-s_append = s.append",
"-for i in range(a):",
"- si = int(eval(input()))",
"- s_append(si)",
"-s_append(INF)",
"-t = [-INF]",
"-t_append = t.append",
"-for i in range(b):",
"- ti = int(eval(input()))",
"- t_append(ti)",
"-t_append(INF)",
"-x = []",
"-x_append = ... | false | 0.159374 | 0.045036 | 3.538779 | [
"s278392237",
"s491634238"
] |
u512007680 | p02720 | python | s409871504 | s123585368 | 185 | 130 | 11,748 | 11,908 | Accepted | Accepted | 29.73 | import heapq
K = int(eval(input()))
Q = [1,2,3,4,5,6,7,8,9]
heapq.heapify(Q)
for i in range(K-1):
x = heapq.heappop(Q)
if x % 10 != 0:
heapq.heappush(Q,10*x+x%10-1)
heapq.heappush(Q,10*x+x%10)
if x % 10 != 9:
heapq.heappush(Q,10*x+x%10+1)
print((heapq.heappop(Q))) | from collections import deque
K = int(eval(input()))
Q = deque([1,2,3,4,5,6,7,8,9])
for i in range(K-1):
x = Q.popleft()
if x % 10 != 0:
Q.append(10*x+x%10-1)
Q.append(10*x+x%10)
if x % 10 != 9:
Q.append(10*x+x%10+1)
print((Q.popleft())) | 16 | 15 | 307 | 279 | import heapq
K = int(eval(input()))
Q = [1, 2, 3, 4, 5, 6, 7, 8, 9]
heapq.heapify(Q)
for i in range(K - 1):
x = heapq.heappop(Q)
if x % 10 != 0:
heapq.heappush(Q, 10 * x + x % 10 - 1)
heapq.heappush(Q, 10 * x + x % 10)
if x % 10 != 9:
heapq.heappush(Q, 10 * x + x % 10 + 1)
print((heapq.heappop(Q)))
| from collections import deque
K = int(eval(input()))
Q = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
for i in range(K - 1):
x = Q.popleft()
if x % 10 != 0:
Q.append(10 * x + x % 10 - 1)
Q.append(10 * x + x % 10)
if x % 10 != 9:
Q.append(10 * x + x % 10 + 1)
print((Q.popleft()))
| false | 6.25 | [
"-import heapq",
"+from collections import deque",
"-Q = [1, 2, 3, 4, 5, 6, 7, 8, 9]",
"-heapq.heapify(Q)",
"+Q = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])",
"- x = heapq.heappop(Q)",
"+ x = Q.popleft()",
"- heapq.heappush(Q, 10 * x + x % 10 - 1)",
"- heapq.heappush(Q, 10 * x + x % 10)",
... | false | 0.054709 | 0.095828 | 0.570908 | [
"s409871504",
"s123585368"
] |
u633068244 | p00070 | python | s847711697 | s002668727 | 4,700 | 4,330 | 4,256 | 4,268 | Accepted | Accepted | 7.87 | def mx(ls,m):
global n
sum = 0
for i in range(m):
sum += (n-i)*ls[-i-1]
return sum
def mn(ls,m):
global n
sum = 0
for i in range(m):
sum += (n-i)*ls[i]
return sum
def f(ls,m,s):
global n
count = 0
if m > 0:
if mx(ls,m) < s or mn(ls,m) > s: return 0
for i in range(len(ls)):
lls = ls[:]
a = (n-m+1)*lls.pop(i)
if s-a < 0: break
else: count += f(lls,m-1,s-a)
return count
else:
return 1 if s == 0 else 0
ls = [i for i in range(10)]
while True:
try:
n,s = list(map(int, input().split()))
print(f(ls,n,s))
except:
break | def mx(ls,m):
global n
sum = 0
for i in range(m):
sum += (n-i)*ls[-i-1]
return sum
def mn(ls,m):
global n
sum = 0
for i in range(m):
sum += (n-i)*ls[i]
return sum
def f(ls,m,s):
global n
count = 0
if m > 0:
vmx,vmn = mx(ls,m),mn(ls,m)
if vmx < s or vmn > s: return 0
elif vmx == s or vmn == s: return 1
for i in range(len(ls)):
lls = ls[:]
a = (n-m+1)*lls.pop(i)
if s-a < 0: break
else: count += f(lls,m-1,s-a)
return count
else:
return 1 if s == 0 else 0
ls = [i for i in range(10)]
while True:
try:
n,s = list(map(int, input().split()))
print(f(ls,n,s))
except:
break | 35 | 37 | 597 | 657 | def mx(ls, m):
global n
sum = 0
for i in range(m):
sum += (n - i) * ls[-i - 1]
return sum
def mn(ls, m):
global n
sum = 0
for i in range(m):
sum += (n - i) * ls[i]
return sum
def f(ls, m, s):
global n
count = 0
if m > 0:
if mx(ls, m) < s or mn(ls, m) > s:
return 0
for i in range(len(ls)):
lls = ls[:]
a = (n - m + 1) * lls.pop(i)
if s - a < 0:
break
else:
count += f(lls, m - 1, s - a)
return count
else:
return 1 if s == 0 else 0
ls = [i for i in range(10)]
while True:
try:
n, s = list(map(int, input().split()))
print(f(ls, n, s))
except:
break
| def mx(ls, m):
global n
sum = 0
for i in range(m):
sum += (n - i) * ls[-i - 1]
return sum
def mn(ls, m):
global n
sum = 0
for i in range(m):
sum += (n - i) * ls[i]
return sum
def f(ls, m, s):
global n
count = 0
if m > 0:
vmx, vmn = mx(ls, m), mn(ls, m)
if vmx < s or vmn > s:
return 0
elif vmx == s or vmn == s:
return 1
for i in range(len(ls)):
lls = ls[:]
a = (n - m + 1) * lls.pop(i)
if s - a < 0:
break
else:
count += f(lls, m - 1, s - a)
return count
else:
return 1 if s == 0 else 0
ls = [i for i in range(10)]
while True:
try:
n, s = list(map(int, input().split()))
print(f(ls, n, s))
except:
break
| false | 5.405405 | [
"- if mx(ls, m) < s or mn(ls, m) > s:",
"+ vmx, vmn = mx(ls, m), mn(ls, m)",
"+ if vmx < s or vmn > s:",
"+ elif vmx == s or vmn == s:",
"+ return 1"
] | false | 0.044768 | 0.047486 | 0.94276 | [
"s847711697",
"s002668727"
] |
u790710233 | p02913 | python | s763270411 | s156991556 | 557 | 419 | 270,160 | 270,164 | Accepted | Accepted | 24.78 | n = int(eval(input()))
s = eval(input())
dp = [[0]*(n+1) for _ in range(n+1)]
for i in reversed(list(range(n))):
for j in reversed(list(range(n))):
if s[i] == s[j]:
dp[i][j] = dp[i+1][j+1]+1
ans = 0
for i in range(n-1):
for j in range(i+1, n):
x = min(dp[i][j], j-i)
if ans < x:
ans = x
print(ans)
| n = int(eval(input()))
s = eval(input())
dp = [[0]*(n+1) for _ in range(n+1)]
for i in reversed(list(range(n-1))):
for j in reversed(list(range(i+1, n))):
if s[i] == s[j]:
dp[i][j] = dp[i+1][j+1]+1
ans = 0
for i in range(n-1):
for j in range(i+1, n):
x = min(dp[i][j], j-i)
if ans < x:
ans = x
print(ans)
| 18 | 19 | 351 | 360 | n = int(eval(input()))
s = eval(input())
dp = [[0] * (n + 1) for _ in range(n + 1)]
for i in reversed(list(range(n))):
for j in reversed(list(range(n))):
if s[i] == s[j]:
dp[i][j] = dp[i + 1][j + 1] + 1
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
x = min(dp[i][j], j - i)
if ans < x:
ans = x
print(ans)
| n = int(eval(input()))
s = eval(input())
dp = [[0] * (n + 1) for _ in range(n + 1)]
for i in reversed(list(range(n - 1))):
for j in reversed(list(range(i + 1, n))):
if s[i] == s[j]:
dp[i][j] = dp[i + 1][j + 1] + 1
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
x = min(dp[i][j], j - i)
if ans < x:
ans = x
print(ans)
| false | 5.263158 | [
"-for i in reversed(list(range(n))):",
"- for j in reversed(list(range(n))):",
"+for i in reversed(list(range(n - 1))):",
"+ for j in reversed(list(range(i + 1, n))):"
] | false | 0.038116 | 0.038535 | 0.989127 | [
"s763270411",
"s156991556"
] |
u515740713 | p02662 | python | s518836099 | s935259485 | 319 | 230 | 147,544 | 27,308 | Accepted | Accepted | 27.9 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
mod = 998244353
N,S = list(map(int,readline().split()))
A = list(map(int,readline().split()))
dp = [[0 for _ in range(S+1)] for _ in range(N+1)]
dp[0][0] = 1
for i in range(N):
for j in range(S+1):
dp[i+1][j] += 2*dp[i][j]
dp[i+1][j] %= mod
if j + A[i] <=S:
dp[i+1][j+A[i]] += dp[i][j]
dp[i+1][j+A[i]] %= mod
print((dp[N][S]%mod)) | # -*- coding: utf-8 -*-
import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
MOD = 998244353
N, S = list(map(int, readline().split()))
A = list(map(int,readline().split()))
U = 3010
f = np.zeros(U,np.int64)
f[0] = 1
for a in A:
ff = 2*f
ff[a:] += f[:-a]
ff%=MOD
f = ff
ans = f[S]
print((ans%MOD)) | 17 | 20 | 481 | 407 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
mod = 998244353
N, S = list(map(int, readline().split()))
A = list(map(int, readline().split()))
dp = [[0 for _ in range(S + 1)] for _ in range(N + 1)]
dp[0][0] = 1
for i in range(N):
for j in range(S + 1):
dp[i + 1][j] += 2 * dp[i][j]
dp[i + 1][j] %= mod
if j + A[i] <= S:
dp[i + 1][j + A[i]] += dp[i][j]
dp[i + 1][j + A[i]] %= mod
print((dp[N][S] % mod))
| # -*- coding: utf-8 -*-
import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
MOD = 998244353
N, S = list(map(int, readline().split()))
A = list(map(int, readline().split()))
U = 3010
f = np.zeros(U, np.int64)
f[0] = 1
for a in A:
ff = 2 * f
ff[a:] += f[:-a]
ff %= MOD
f = ff
ans = f[S]
print((ans % MOD))
| false | 15 | [
"+# -*- coding: utf-8 -*-",
"+import numpy as np",
"-mod = 998244353",
"+MOD = 998244353",
"-dp = [[0 for _ in range(S + 1)] for _ in range(N + 1)]",
"-dp[0][0] = 1",
"-for i in range(N):",
"- for j in range(S + 1):",
"- dp[i + 1][j] += 2 * dp[i][j]",
"- dp[i + 1][j] %= mod",
"-... | false | 0.117173 | 0.597417 | 0.196132 | [
"s518836099",
"s935259485"
] |
u058861899 | p03194 | python | s833807390 | s623027046 | 690 | 280 | 3,060 | 3,060 | Accepted | Accepted | 59.42 | N, P = list(map(int, input().split()))
ans = 1
if N >= 45:
print(ans)
elif N == 1:
print(P)
else:
i = 1
while(i**N <= P):
if P % (i**N) == 0:
ans = i
i += 1
print(ans) | n,p=list(map(int,input().split()))
if n==1:
print(p)
elif n>45:
print((1))
else:
x=round((p**(1/n)+1))+1
for i in range(x,0,-1):
if p%(i**n)==0:
print(i)
break
| 17 | 14 | 211 | 253 | N, P = list(map(int, input().split()))
ans = 1
if N >= 45:
print(ans)
elif N == 1:
print(P)
else:
i = 1
while i**N <= P:
if P % (i**N) == 0:
ans = i
i += 1
print(ans)
| n, p = list(map(int, input().split()))
if n == 1:
print(p)
elif n > 45:
print((1))
else:
x = round((p ** (1 / n) + 1)) + 1
for i in range(x, 0, -1):
if p % (i**n) == 0:
print(i)
break
| false | 17.647059 | [
"-N, P = list(map(int, input().split()))",
"-ans = 1",
"-if N >= 45:",
"- print(ans)",
"-elif N == 1:",
"- print(P)",
"+n, p = list(map(int, input().split()))",
"+if n == 1:",
"+ print(p)",
"+elif n > 45:",
"+ print((1))",
"- i = 1",
"- while i**N <= P:",
"- if P %... | false | 0.047282 | 0.096525 | 0.489839 | [
"s833807390",
"s623027046"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.