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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u721316601 | p02786 | python | s900882596 | s814423363 | 19 | 17 | 3,060 | 3,060 | Accepted | Accepted | 10.53 | def solve(n):
if n == 1: return 1
return 2 * solve(n//2) + 1
print((solve(int(eval(input())))))
| def solve(n):
if n in memo: return memo[n]
memo[n] = 2*solve(n//2)+1
return memo[n]
memo = {1:1}
print((solve(int(eval(input()))))) | 5 | 9 | 101 | 146 | def solve(n):
if n == 1:
return 1
return 2 * solve(n // 2) + 1
print((solve(int(eval(input())))))
| def solve(n):
if n in memo:
return memo[n]
memo[n] = 2 * solve(n // 2) + 1
return memo[n]
memo = {1: 1}
print((solve(int(eval(input())))))
| false | 44.444444 | [
"- if n == 1:",
"- return 1",
"- return 2 * solve(n // 2) + 1",
"+ if n in memo:",
"+ return memo[n]",
"+ memo[n] = 2 * solve(n // 2) + 1",
"+ return memo[n]",
"+memo = {1: 1}"
]
| false | 0.042605 | 0.042238 | 1.008688 | [
"s900882596",
"s814423363"
]
|
u814265211 | p02743 | python | s165505202 | s902287658 | 303 | 172 | 59,844 | 38,384 | Accepted | Accepted | 43.23 | from decimal import *
getcontext().prec = 128
a, b, c = [int(i) for i in input().split()]
print(("Yes" if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt() else "No"))
| a, b, c = [int(i) for i in input().split()]
d = c - a - b
print(('Yes' if d > 0 and d**2 > 4*a*b else 'No')) | 6 | 3 | 181 | 108 | from decimal import *
getcontext().prec = 128
a, b, c = [int(i) for i in input().split()]
print(("Yes" if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt() else "No"))
| a, b, c = [int(i) for i in input().split()]
d = c - a - b
print(("Yes" if d > 0 and d**2 > 4 * a * b else "No"))
| false | 50 | [
"-from decimal import *",
"-",
"-getcontext().prec = 128",
"-print((\"Yes\" if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt() else \"No\"))",
"+d = c - a - b",
"+print((\"Yes\" if d > 0 and d**2 > 4 * a * b else \"No\"))"
]
| false | 0.039573 | 0.037752 | 1.048238 | [
"s165505202",
"s902287658"
]
|
u134019875 | p03043 | python | s777860028 | s405451219 | 64 | 38 | 3,828 | 2,940 | Accepted | Accepted | 40.62 | n, k = list(map(int, input().split()))
L = [''] * n
for i in range(1, n + 1):
j = 0
while i * (2 ** j) < k:
j += 1
L[i - 1] = j
S = 0
for k in L:
S += 1 / (2 ** k)
print((S / n)) | n, k = list(map(int, input().split()))
ans = 0
for i in range(1, n+1):
cnt = 0
while i < k:
i *= 2
cnt += 1
ans += (0.5) ** cnt
print((ans / n))
| 11 | 9 | 204 | 173 | n, k = list(map(int, input().split()))
L = [""] * n
for i in range(1, n + 1):
j = 0
while i * (2**j) < k:
j += 1
L[i - 1] = j
S = 0
for k in L:
S += 1 / (2**k)
print((S / n))
| n, k = list(map(int, input().split()))
ans = 0
for i in range(1, n + 1):
cnt = 0
while i < k:
i *= 2
cnt += 1
ans += (0.5) ** cnt
print((ans / n))
| false | 18.181818 | [
"-L = [\"\"] * n",
"+ans = 0",
"- j = 0",
"- while i * (2**j) < k:",
"- j += 1",
"- L[i - 1] = j",
"-S = 0",
"-for k in L:",
"- S += 1 / (2**k)",
"-print((S / n))",
"+ cnt = 0",
"+ while i < k:",
"+ i *= 2",
"+ cnt += 1",
"+ ans += (0.5) ** cnt",
"+print((ans / n))"
]
| false | 0.19108 | 0.204929 | 0.93242 | [
"s777860028",
"s405451219"
]
|
u102461423 | p03283 | python | s394327794 | s682651050 | 2,507 | 1,679 | 18,280 | 26,252 | Accepted | Accepted | 33.03 | # count p<=x<=q and p<=y <=q
# 長方形に含まれる格子点の数
import numpy as np
N,M,Q = list(map(int,input().split()))
cnt = [[0]*(N+1) for _ in range(N+1)]
for _ in range(M):
x,y = list(map(int,input().split()))
cnt[x][y] += 1
cnt = np.cumsum(cnt,axis=0).cumsum(axis=1)
for _ in range(Q):
p,q = list(map(int,input().split()))
p -= 1
x = cnt[q,q]
x -= cnt[q,p]
x -= cnt[p,q]
x += cnt[p,p]
print(x) | # count p<=x<=q and p<=y <=q
# 長方形に含まれる格子点の数
import numpy as np
N,M,Q = list(map(int,input().split()))
cnt = [[0]*(N+1) for _ in range(N+1)]
for _ in range(M):
x,y = list(map(int,input().split()))
cnt[x][y] += 1
# cumsumだけnumpyを使って、添字アクセスするときはlistの方が速い
cnt = np.cumsum(cnt,axis=0).cumsum(axis=1).tolist()
for _ in range(Q):
p,q = list(map(int,input().split()))
p -= 1
x = cnt[q][q]
x -= cnt[q][p]
x -= cnt[p][q]
x += cnt[p][p]
print(x) | 20 | 21 | 403 | 458 | # count p<=x<=q and p<=y <=q
# 長方形に含まれる格子点の数
import numpy as np
N, M, Q = list(map(int, input().split()))
cnt = [[0] * (N + 1) for _ in range(N + 1)]
for _ in range(M):
x, y = list(map(int, input().split()))
cnt[x][y] += 1
cnt = np.cumsum(cnt, axis=0).cumsum(axis=1)
for _ in range(Q):
p, q = list(map(int, input().split()))
p -= 1
x = cnt[q, q]
x -= cnt[q, p]
x -= cnt[p, q]
x += cnt[p, p]
print(x)
| # count p<=x<=q and p<=y <=q
# 長方形に含まれる格子点の数
import numpy as np
N, M, Q = list(map(int, input().split()))
cnt = [[0] * (N + 1) for _ in range(N + 1)]
for _ in range(M):
x, y = list(map(int, input().split()))
cnt[x][y] += 1
# cumsumだけnumpyを使って、添字アクセスするときはlistの方が速い
cnt = np.cumsum(cnt, axis=0).cumsum(axis=1).tolist()
for _ in range(Q):
p, q = list(map(int, input().split()))
p -= 1
x = cnt[q][q]
x -= cnt[q][p]
x -= cnt[p][q]
x += cnt[p][p]
print(x)
| false | 4.761905 | [
"-cnt = np.cumsum(cnt, axis=0).cumsum(axis=1)",
"+# cumsumだけnumpyを使って、添字アクセスするときはlistの方が速い",
"+cnt = np.cumsum(cnt, axis=0).cumsum(axis=1).tolist()",
"- x = cnt[q, q]",
"- x -= cnt[q, p]",
"- x -= cnt[p, q]",
"- x += cnt[p, p]",
"+ x = cnt[q][q]",
"+ x -= cnt[q][p]",
"+ x -= cnt[p][q]",
"+ x += cnt[p][p]"
]
| false | 0.769247 | 0.450368 | 1.708041 | [
"s394327794",
"s682651050"
]
|
u174394352 | p03493 | python | s487010849 | s463287775 | 178 | 17 | 38,384 | 2,940 | Accepted | Accepted | 90.45 | s=eval(input())
print((s.count('1'))) | a=list(map(int,list(eval(input()))))
b=0
for i in a:
if i==1:
b+=1
else:
pass
print(b) | 2 | 8 | 30 | 93 | s = eval(input())
print((s.count("1")))
| a = list(map(int, list(eval(input()))))
b = 0
for i in a:
if i == 1:
b += 1
else:
pass
print(b)
| false | 75 | [
"-s = eval(input())",
"-print((s.count(\"1\")))",
"+a = list(map(int, list(eval(input()))))",
"+b = 0",
"+for i in a:",
"+ if i == 1:",
"+ b += 1",
"+ else:",
"+ pass",
"+print(b)"
]
| false | 0.056334 | 0.03932 | 1.43271 | [
"s487010849",
"s463287775"
]
|
u399721252 | p03044 | python | s205733169 | s191346560 | 1,841 | 475 | 67,760 | 68,716 | Accepted | Accepted | 74.2 | import sys
input = sys.stdin.readline
n = int(eval(input()))
connect_list = [ [] for i in range(n) ]
distance_list = [ -1 for i in range(n) ]
color_list = [ "Gray" for i in range(n) ]
distance_list[0] = 0
for i in range(n-1):
u, v, w = [ int(v) for v in input().split() ]
w %= 2
connect_list[u-1].append((v-1,w))
connect_list[v-1].append((u-1,w))
search_list = [0]
while search_list != []:
s = search_list[0]
for i in connect_list[s]:
if distance_list[i[0]] == -1:
distance_list[i[0]] = (distance_list[s] + i[1]) % 2
search_list.append(i[0])
del search_list[0]
for i in distance_list:
print(i) |
import sys
input = sys.stdin.readline
n = int(eval(input()))
connect_list = [ [] for i in range(n) ]
distance_list = [ -1 for i in range(n) ]
color_list = [ "Gray" for i in range(n) ]
distance_list[0] = 0
for i in range(n-1):
u, v, w = [ int(v) for v in input().split() ]
w %= 2
connect_list[u-1].append((v-1,w))
connect_list[v-1].append((u-1,w))
search_list = [0]
t = 0
stop = 0
while t < len(search_list):
s = search_list[t]
stop = 0
for i in connect_list[s]:
if distance_list[i[0]] == -1:
distance_list[i[0]] = (distance_list[s] + i[1]) % 2
search_list.append(i[0])
t += 1
for i in distance_list:
print(i) | 30 | 34 | 641 | 662 | import sys
input = sys.stdin.readline
n = int(eval(input()))
connect_list = [[] for i in range(n)]
distance_list = [-1 for i in range(n)]
color_list = ["Gray" for i in range(n)]
distance_list[0] = 0
for i in range(n - 1):
u, v, w = [int(v) for v in input().split()]
w %= 2
connect_list[u - 1].append((v - 1, w))
connect_list[v - 1].append((u - 1, w))
search_list = [0]
while search_list != []:
s = search_list[0]
for i in connect_list[s]:
if distance_list[i[0]] == -1:
distance_list[i[0]] = (distance_list[s] + i[1]) % 2
search_list.append(i[0])
del search_list[0]
for i in distance_list:
print(i)
| import sys
input = sys.stdin.readline
n = int(eval(input()))
connect_list = [[] for i in range(n)]
distance_list = [-1 for i in range(n)]
color_list = ["Gray" for i in range(n)]
distance_list[0] = 0
for i in range(n - 1):
u, v, w = [int(v) for v in input().split()]
w %= 2
connect_list[u - 1].append((v - 1, w))
connect_list[v - 1].append((u - 1, w))
search_list = [0]
t = 0
stop = 0
while t < len(search_list):
s = search_list[t]
stop = 0
for i in connect_list[s]:
if distance_list[i[0]] == -1:
distance_list[i[0]] = (distance_list[s] + i[1]) % 2
search_list.append(i[0])
t += 1
for i in distance_list:
print(i)
| false | 11.764706 | [
"-while search_list != []:",
"- s = search_list[0]",
"+t = 0",
"+stop = 0",
"+while t < len(search_list):",
"+ s = search_list[t]",
"+ stop = 0",
"- del search_list[0]",
"+ t += 1"
]
| false | 0.036163 | 0.035669 | 1.013852 | [
"s205733169",
"s191346560"
]
|
u777923818 | p03425 | python | s518125106 | s258539301 | 203 | 165 | 3,064 | 3,316 | Accepted | Accepted | 18.72 | # -*- coding: utf-8 -*-
from itertools import combinations
N = int(eval(input()))
C = [0, 0, 0, 0, 0]
march = set(list("MARCH"))
for _ in range(N):
S = input()[0]
if S in march:
C["MARCH".index(S)] += 1
ans = 0
for a, b, c in combinations(list(range(5)), r=3):
ans += C[a]*C[b]*C[c]
print(ans)
| # -*- coding: utf-8 -*-
from collections import defaultdict
from itertools import combinations
N = int(eval(input()))
C = [0, 0, 0, 0, 0, 0]
D = defaultdict(int)
for i, m in enumerate("MARCH", start=1):
D[m] = i
for _ in range(N):
C[D[input()[0]]] += 1
ans = 0
for a, b, c in combinations(list(range(1, 6)), r=3):
ans += C[a]*C[b]*C[c]
print(ans) | 14 | 16 | 316 | 363 | # -*- coding: utf-8 -*-
from itertools import combinations
N = int(eval(input()))
C = [0, 0, 0, 0, 0]
march = set(list("MARCH"))
for _ in range(N):
S = input()[0]
if S in march:
C["MARCH".index(S)] += 1
ans = 0
for a, b, c in combinations(list(range(5)), r=3):
ans += C[a] * C[b] * C[c]
print(ans)
| # -*- coding: utf-8 -*-
from collections import defaultdict
from itertools import combinations
N = int(eval(input()))
C = [0, 0, 0, 0, 0, 0]
D = defaultdict(int)
for i, m in enumerate("MARCH", start=1):
D[m] = i
for _ in range(N):
C[D[input()[0]]] += 1
ans = 0
for a, b, c in combinations(list(range(1, 6)), r=3):
ans += C[a] * C[b] * C[c]
print(ans)
| false | 12.5 | [
"+from collections import defaultdict",
"-C = [0, 0, 0, 0, 0]",
"-march = set(list(\"MARCH\"))",
"+C = [0, 0, 0, 0, 0, 0]",
"+D = defaultdict(int)",
"+for i, m in enumerate(\"MARCH\", start=1):",
"+ D[m] = i",
"- S = input()[0]",
"- if S in march:",
"- C[\"MARCH\".index(S)] += 1",
"+ C[D[input()[0]]] += 1",
"-for a, b, c in combinations(list(range(5)), r=3):",
"+for a, b, c in combinations(list(range(1, 6)), r=3):"
]
| false | 0.036708 | 0.035637 | 1.030047 | [
"s518125106",
"s258539301"
]
|
u411203878 | p03380 | python | s562365063 | s342082632 | 241 | 106 | 62,704 | 85,732 | Accepted | Accepted | 56.02 | n=int(eval(input()))
t = list(map(int,input().split()))
t.sort()
a1 = max(t)
ans = 100000000000000
memo = 0
for i in t:
if ans > abs(a1/2-i):
ans = abs(a1/2-i)
memo = i
print((a1, memo))
| n=int(eval(input()))
t = list(map(int,input().split()))
t.sort()
max_value = t[-1]
mid_value = 0
for a in t:
if abs(max_value/2-a) < abs(max_value/2-mid_value):
mid_value = a
print((max_value, mid_value)) | 15 | 15 | 220 | 228 | n = int(eval(input()))
t = list(map(int, input().split()))
t.sort()
a1 = max(t)
ans = 100000000000000
memo = 0
for i in t:
if ans > abs(a1 / 2 - i):
ans = abs(a1 / 2 - i)
memo = i
print((a1, memo))
| n = int(eval(input()))
t = list(map(int, input().split()))
t.sort()
max_value = t[-1]
mid_value = 0
for a in t:
if abs(max_value / 2 - a) < abs(max_value / 2 - mid_value):
mid_value = a
print((max_value, mid_value))
| false | 0 | [
"-a1 = max(t)",
"-ans = 100000000000000",
"-memo = 0",
"-for i in t:",
"- if ans > abs(a1 / 2 - i):",
"- ans = abs(a1 / 2 - i)",
"- memo = i",
"-print((a1, memo))",
"+max_value = t[-1]",
"+mid_value = 0",
"+for a in t:",
"+ if abs(max_value / 2 - a) < abs(max_value / 2 - mid_value):",
"+ mid_value = a",
"+print((max_value, mid_value))"
]
| false | 0.070449 | 0.007673 | 9.180911 | [
"s562365063",
"s342082632"
]
|
u027685417 | p02861 | python | s928023876 | s864393391 | 433 | 17 | 8,180 | 3,188 | Accepted | Accepted | 96.07 | N = int(eval(input()))
coordinates = []
for i in range(N):
x, y = list(map(int, input().split()))
coordinates.append((x, y))
import itertools
paths = list(itertools.permutations(list(range(N))))
total_length = 0
for i in paths:
for j in range(N - 1):
x1, y1 = coordinates[i[j]]
x2, y2 = coordinates[i[j + 1]]
total_length += ((x1 - x2)**2 + (y1 - y2)**2)**0.5
average_length = total_length / len(paths)
print(average_length)
| n = int(eval(input()))
C = []
for _ in range(n):
x, y = list(map(int, input().split()))
C.append((x, y))
l = 0
for i in range(n - 1):
for j in range(i + 1, n):
xi, yi = C[i][0], C[i][1]
xj, yj = C[j][0], C[j][1]
l += ((xi - xj)**2 + (yi - yj)**2)**0.5
print(((2 * l) / n))
| 19 | 15 | 465 | 312 | N = int(eval(input()))
coordinates = []
for i in range(N):
x, y = list(map(int, input().split()))
coordinates.append((x, y))
import itertools
paths = list(itertools.permutations(list(range(N))))
total_length = 0
for i in paths:
for j in range(N - 1):
x1, y1 = coordinates[i[j]]
x2, y2 = coordinates[i[j + 1]]
total_length += ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5
average_length = total_length / len(paths)
print(average_length)
| n = int(eval(input()))
C = []
for _ in range(n):
x, y = list(map(int, input().split()))
C.append((x, y))
l = 0
for i in range(n - 1):
for j in range(i + 1, n):
xi, yi = C[i][0], C[i][1]
xj, yj = C[j][0], C[j][1]
l += ((xi - xj) ** 2 + (yi - yj) ** 2) ** 0.5
print(((2 * l) / n))
| false | 21.052632 | [
"-N = int(eval(input()))",
"-coordinates = []",
"-for i in range(N):",
"+n = int(eval(input()))",
"+C = []",
"+for _ in range(n):",
"- coordinates.append((x, y))",
"-import itertools",
"-",
"-paths = list(itertools.permutations(list(range(N))))",
"-total_length = 0",
"-for i in paths:",
"- for j in range(N - 1):",
"- x1, y1 = coordinates[i[j]]",
"- x2, y2 = coordinates[i[j + 1]]",
"- total_length += ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5",
"-average_length = total_length / len(paths)",
"-print(average_length)",
"+ C.append((x, y))",
"+l = 0",
"+for i in range(n - 1):",
"+ for j in range(i + 1, n):",
"+ xi, yi = C[i][0], C[i][1]",
"+ xj, yj = C[j][0], C[j][1]",
"+ l += ((xi - xj) ** 2 + (yi - yj) ** 2) ** 0.5",
"+print(((2 * l) / n))"
]
| false | 0.112584 | 0.039812 | 2.827894 | [
"s928023876",
"s864393391"
]
|
u707124227 | p02787 | python | s192576033 | s573512961 | 606 | 357 | 45,532 | 91,532 | Accepted | Accepted | 41.09 | h,n=list(map(int,input().split()))
ab=[list(map(int,input().split()))for _ in range(n)]
maxa=max([a for a,b in ab])
maxmp=pow(10,8)
dp=[maxmp]*(h+maxa) # dp[i]:ダメージをぴったりi与えるのに必要な最小魔力
dp[0]=0
for i in range(h+maxa):
b=[dp[i-a]+b for a,b in ab if i-a>=0]
dp[i]=min(dp[i],min(b)) if b else dp[i]
print((min(dp[h:])))
| h,n=list(map(int,input().split()))
ab=[list(map(int,input().split())) for _ in range(n)]
inf=float('inf')
dp=[inf]*(h+1)
# dp[i]:ダメージiを与えるための最小魔力
dp[0]=0
for a,b in ab:
# a:ダメージ,b:魔力
ndp=[inf]*(h+1)
ndp[0]=0
for i in range(1,h+1):
ndp[i]=min(dp[i],ndp[max(0,i-a)]+b)
dp=ndp
print((dp[h])) | 10 | 14 | 319 | 307 | h, n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
maxa = max([a for a, b in ab])
maxmp = pow(10, 8)
dp = [maxmp] * (h + maxa) # dp[i]:ダメージをぴったりi与えるのに必要な最小魔力
dp[0] = 0
for i in range(h + maxa):
b = [dp[i - a] + b for a, b in ab if i - a >= 0]
dp[i] = min(dp[i], min(b)) if b else dp[i]
print((min(dp[h:])))
| h, n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
inf = float("inf")
dp = [inf] * (h + 1)
# dp[i]:ダメージiを与えるための最小魔力
dp[0] = 0
for a, b in ab:
# a:ダメージ,b:魔力
ndp = [inf] * (h + 1)
ndp[0] = 0
for i in range(1, h + 1):
ndp[i] = min(dp[i], ndp[max(0, i - a)] + b)
dp = ndp
print((dp[h]))
| false | 28.571429 | [
"-maxa = max([a for a, b in ab])",
"-maxmp = pow(10, 8)",
"-dp = [maxmp] * (h + maxa) # dp[i]:ダメージをぴったりi与えるのに必要な最小魔力",
"+inf = float(\"inf\")",
"+dp = [inf] * (h + 1)",
"+# dp[i]:ダメージiを与えるための最小魔力",
"-for i in range(h + maxa):",
"- b = [dp[i - a] + b for a, b in ab if i - a >= 0]",
"- dp[i] = min(dp[i], min(b)) if b else dp[i]",
"-print((min(dp[h:])))",
"+for a, b in ab:",
"+ # a:ダメージ,b:魔力",
"+ ndp = [inf] * (h + 1)",
"+ ndp[0] = 0",
"+ for i in range(1, h + 1):",
"+ ndp[i] = min(dp[i], ndp[max(0, i - a)] + b)",
"+ dp = ndp",
"+print((dp[h]))"
]
| false | 0.163141 | 0.1377 | 1.184752 | [
"s192576033",
"s573512961"
]
|
u651663683 | p02936 | python | s524214567 | s337001434 | 1,262 | 763 | 65,288 | 161,812 | Accepted | Accepted | 39.54 | n,q=list(map(int,input().split()))
e=[[] for i in range(n)]
for i in range(n-1):
a,b=[int(x)-1 for x in input().split()]
e[a].append(b)
e[b].append(a)
ps=[0 for i in range(n)]
for i in range(q):
p,x=list(map(int,input().split()))
ps[p-1]+=x
s=[-1 for i in range(n)]
sc=[0]
s[0]=0
while sc:
nsc=[]
for i in sc:
s[i]+=ps[i]
for j in e[i]:
if s[j]==-1:
nsc.append(j)
s[j]=s[i]
sc=nsc
r=""
for i in range(n):
r+=str(s[i])+" "
print((r[:-1])) | n,q=list(map(int,input().split()))
e=[[] for i in range(n)]
for i in range(n-1):
a,b=[int(x)-1 for x in input().split()]
e[a].append(b)
e[b].append(a)
ps=[0 for i in range(n)]
for i in range(q):
p,x=list(map(int,input().split()))
ps[p-1]+=x
s=[-1 for i in range(n)]
sc=[0]
s[0]=0
while sc:
nsc=[]
for i in sc:
s[i]+=ps[i]
for j in e[i]:
if s[j]==-1:
nsc.append(j)
s[j]=s[i]
sc=nsc
print((" ".join(map(str,s)))) | 28 | 26 | 503 | 473 | n, q = list(map(int, input().split()))
e = [[] for i in range(n)]
for i in range(n - 1):
a, b = [int(x) - 1 for x in input().split()]
e[a].append(b)
e[b].append(a)
ps = [0 for i in range(n)]
for i in range(q):
p, x = list(map(int, input().split()))
ps[p - 1] += x
s = [-1 for i in range(n)]
sc = [0]
s[0] = 0
while sc:
nsc = []
for i in sc:
s[i] += ps[i]
for j in e[i]:
if s[j] == -1:
nsc.append(j)
s[j] = s[i]
sc = nsc
r = ""
for i in range(n):
r += str(s[i]) + " "
print((r[:-1]))
| n, q = list(map(int, input().split()))
e = [[] for i in range(n)]
for i in range(n - 1):
a, b = [int(x) - 1 for x in input().split()]
e[a].append(b)
e[b].append(a)
ps = [0 for i in range(n)]
for i in range(q):
p, x = list(map(int, input().split()))
ps[p - 1] += x
s = [-1 for i in range(n)]
sc = [0]
s[0] = 0
while sc:
nsc = []
for i in sc:
s[i] += ps[i]
for j in e[i]:
if s[j] == -1:
nsc.append(j)
s[j] = s[i]
sc = nsc
print((" ".join(map(str, s))))
| false | 7.142857 | [
"-r = \"\"",
"-for i in range(n):",
"- r += str(s[i]) + \" \"",
"-print((r[:-1]))",
"+print((\" \".join(map(str, s))))"
]
| false | 0.089768 | 0.069644 | 1.288949 | [
"s524214567",
"s337001434"
]
|
u806403461 | p02641 | python | s879823148 | s145957579 | 24 | 21 | 9,132 | 9,188 | Accepted | Accepted | 12.5 | x, n = list(map(int, input().split()))
p = list(map(int, input().split()))
p = set(p)
diff = 101
indx = 0
if n != 0:
for now in range(0, 102):
if now not in p:
now_diff = abs(now - x)
if diff > now_diff:
diff = now_diff
indx = now
else:
break
print(indx)
else:
print(x)
| x, n = list(map(int, input().split()))
p = list(map(int, input().split()))
p = set(p)
diff = 101
indx = 0
ans = (101, 0)
if n != 0:
for now in range(0, 102):
if now not in p:
now_diff = abs(now - x)
ans = min(ans, (now_diff, now))
print((ans[1]))
else:
print(x)
| 19 | 16 | 388 | 315 | x, n = list(map(int, input().split()))
p = list(map(int, input().split()))
p = set(p)
diff = 101
indx = 0
if n != 0:
for now in range(0, 102):
if now not in p:
now_diff = abs(now - x)
if diff > now_diff:
diff = now_diff
indx = now
else:
break
print(indx)
else:
print(x)
| x, n = list(map(int, input().split()))
p = list(map(int, input().split()))
p = set(p)
diff = 101
indx = 0
ans = (101, 0)
if n != 0:
for now in range(0, 102):
if now not in p:
now_diff = abs(now - x)
ans = min(ans, (now_diff, now))
print((ans[1]))
else:
print(x)
| false | 15.789474 | [
"+ans = (101, 0)",
"- if diff > now_diff:",
"- diff = now_diff",
"- indx = now",
"- else:",
"- break",
"- print(indx)",
"+ ans = min(ans, (now_diff, now))",
"+ print((ans[1]))"
]
| false | 0.05381 | 0.082868 | 0.649348 | [
"s879823148",
"s145957579"
]
|
u753803401 | p03289 | python | s313526381 | s197278191 | 19 | 17 | 3,060 | 2,940 | Accepted | Accepted | 10.53 | s = eval(input())
cnt = 0
for i in range(len(s)):
if i == 0:
if s[i] != "A":
print("WA")
exit()
else:
if s[i] == "C" and 2 <= i <= len(s) - 2:
cnt += 1
else:
if s[i] != s[i].lower():
print("WA")
exit()
if cnt == 1:
print("AC")
else:
print("WA")
| s = eval(input())
if s[0] == "A" and s[2:-1].count("C") == 1:
for i in range(len(s)):
if s[i] != "A" and s[i] != "C":
if s[i] != s[i].lower():
print("WA")
exit()
print("AC")
else:
print("WA")
| 18 | 10 | 376 | 259 | s = eval(input())
cnt = 0
for i in range(len(s)):
if i == 0:
if s[i] != "A":
print("WA")
exit()
else:
if s[i] == "C" and 2 <= i <= len(s) - 2:
cnt += 1
else:
if s[i] != s[i].lower():
print("WA")
exit()
if cnt == 1:
print("AC")
else:
print("WA")
| s = eval(input())
if s[0] == "A" and s[2:-1].count("C") == 1:
for i in range(len(s)):
if s[i] != "A" and s[i] != "C":
if s[i] != s[i].lower():
print("WA")
exit()
print("AC")
else:
print("WA")
| false | 44.444444 | [
"-cnt = 0",
"-for i in range(len(s)):",
"- if i == 0:",
"- if s[i] != \"A\":",
"- print(\"WA\")",
"- exit()",
"- else:",
"- if s[i] == \"C\" and 2 <= i <= len(s) - 2:",
"- cnt += 1",
"- else:",
"+if s[0] == \"A\" and s[2:-1].count(\"C\") == 1:",
"+ for i in range(len(s)):",
"+ if s[i] != \"A\" and s[i] != \"C\":",
"-if cnt == 1:"
]
| false | 0.04713 | 0.04699 | 1.002994 | [
"s313526381",
"s197278191"
]
|
u223646582 | p03096 | python | s871071359 | s732779219 | 523 | 254 | 29,796 | 91,232 | Accepted | Accepted | 51.43 | from collections import defaultdict
N=int(eval(input()))
C=[int(eval(input())) for _ in range(N)]
d = defaultdict(int)
ans=1
for i,c in enumerate(C):
if i>=1 and C[i-1]==C[i]:
continue
else:
ans+=d[c]
d[c]=ans
ans%=10**9+7
d[c]%=10**9+7
print(ans) | MOD = 10**9 + 7
N = int(eval(input()))
C = [int(eval(input())) for _ in range(N)]
L = [-1]*(2*10**5+10)
dp = [-1]*(2*10**5+10)
dp[0] = 1
for i in range(N):
if L[C[i]] == -1:
dp[i+1] = dp[i]
elif C[i] == C[i-1]:
dp[i+1] = dp[i]
else:
dp[i+1] = dp[i]+dp[L[C[i]]]
dp[i+1] %= MOD
L[C[i]] = i+1
print((dp[N]))
| 18 | 18 | 312 | 354 | from collections import defaultdict
N = int(eval(input()))
C = [int(eval(input())) for _ in range(N)]
d = defaultdict(int)
ans = 1
for i, c in enumerate(C):
if i >= 1 and C[i - 1] == C[i]:
continue
else:
ans += d[c]
d[c] = ans
ans %= 10**9 + 7
d[c] %= 10**9 + 7
print(ans)
| MOD = 10**9 + 7
N = int(eval(input()))
C = [int(eval(input())) for _ in range(N)]
L = [-1] * (2 * 10**5 + 10)
dp = [-1] * (2 * 10**5 + 10)
dp[0] = 1
for i in range(N):
if L[C[i]] == -1:
dp[i + 1] = dp[i]
elif C[i] == C[i - 1]:
dp[i + 1] = dp[i]
else:
dp[i + 1] = dp[i] + dp[L[C[i]]]
dp[i + 1] %= MOD
L[C[i]] = i + 1
print((dp[N]))
| false | 0 | [
"-from collections import defaultdict",
"-",
"+MOD = 10**9 + 7",
"-d = defaultdict(int)",
"-ans = 1",
"-for i, c in enumerate(C):",
"- if i >= 1 and C[i - 1] == C[i]:",
"- continue",
"+L = [-1] * (2 * 10**5 + 10)",
"+dp = [-1] * (2 * 10**5 + 10)",
"+dp[0] = 1",
"+for i in range(N):",
"+ if L[C[i]] == -1:",
"+ dp[i + 1] = dp[i]",
"+ elif C[i] == C[i - 1]:",
"+ dp[i + 1] = dp[i]",
"- ans += d[c]",
"- d[c] = ans",
"- ans %= 10**9 + 7",
"- d[c] %= 10**9 + 7",
"-print(ans)",
"+ dp[i + 1] = dp[i] + dp[L[C[i]]]",
"+ dp[i + 1] %= MOD",
"+ L[C[i]] = i + 1",
"+print((dp[N]))"
]
| false | 0.038176 | 0.038487 | 0.991913 | [
"s871071359",
"s732779219"
]
|
u386819480 | p02779 | python | s127169270 | s148516235 | 158 | 128 | 46,256 | 40,384 | Accepted | Accepted | 18.99 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32
YES = "YES" # type: str
NO = "NO" # type: str
def solve(N: int, A: "List[int]"):
from collections import Counter
c = Counter(A)
if len([k for k,v in list(c.items()) if v != 1]) == 0:
print(YES)
else:
print(NO)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, A)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32
YES = "YES" # type: str
NO = "NO" # type: str
def solve(N: int, A: "List[int]"):
if len(list(set(A))) == N:
print(YES)
else:
print(NO)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, A)
if __name__ == '__main__':
main()
| 31 | 29 | 687 | 608 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1 << 32
YES = "YES" # type: str
NO = "NO" # type: str
def solve(N: int, A: "List[int]"):
from collections import Counter
c = Counter(A)
if len([k for k, v in list(c.items()) if v != 1]) == 0:
print(YES)
else:
print(NO)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, A)
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1 << 32
YES = "YES" # type: str
NO = "NO" # type: str
def solve(N: int, A: "List[int]"):
if len(list(set(A))) == N:
print(YES)
else:
print(NO)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, A)
if __name__ == "__main__":
main()
| false | 6.451613 | [
"- from collections import Counter",
"-",
"- c = Counter(A)",
"- if len([k for k, v in list(c.items()) if v != 1]) == 0:",
"+ if len(list(set(A))) == N:"
]
| false | 0.044358 | 0.152077 | 0.29168 | [
"s127169270",
"s148516235"
]
|
u467736898 | p02574 | python | s344687115 | s480190618 | 1,756 | 1,236 | 335,700 | 308,624 | Accepted | Accepted | 29.61 | from itertools import groupby
class Osa_k:
def __init__(self, n_max):
self.min_factor = min_factor = list(range(n_max+1))
for i in range(2, int(n_max**0.5)+1):
if min_factor[i] == i:
for j in range(i*i, n_max+1, i):
if min_factor[j] == j:
min_factor[j] = i
def __call__(self, n):
min_factor = self.min_factor
n_twoes = (n & -n).bit_length() - 1 # 最悪ケースでは速くなる
res = [2] * n_twoes
n >>= n_twoes
while n > 1:
p = min_factor[n]
res.append(p)
n //= p
return res
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
osa_k = Osa_k(1010101)
Factors = [osa_k(a) for a in A]
factors = Factors[0]
st0 = set(factors) # 0 になれば setwize
st1 = set(factors) # 重複しなければ pairwise
pairwise = True
for factors in Factors[1:]:
st = []
for f, _ in groupby(factors):
if f in st1:
pairwise = False
else:
st1.add(f)
st.append(f)
st0 &= set(st)
if pairwise:
print("pairwise coprime")
elif not st0:
print("setwise coprime")
else:
print("not coprime")
main()
| def numba_compile(numba_config):
import os, sys
if sys.argv[-1] == "ONLINE_JUDGE":
from numba import njit
from numba.pycc import CC
cc = CC("my_module")
for func, signature in numba_config:
globals()[func.__name__] = njit(signature)(func)
cc.export(func.__name__, signature)(func)
cc.compile()
exit()
elif os.name == "posix":
exec(f"from my_module import {','.join(func.__name__ for func, _ in numba_config)}")
for func, _ in numba_config:
globals()[func.__name__] = vars()[func.__name__]
else:
from numba import njit
for func, signature in numba_config:
globals()[func.__name__] = njit(signature, cache=True)(func)
print("compiled!", file=sys.stderr)
import sys
import numpy as np
def solve(N, A):
def osa_k_construct(n_max):
min_factor = np.arange(n_max+1)
for i in range(2, int(n_max**0.5)+1):
if min_factor[i] == i:
for j in range(i*i, n_max+1, i):
if min_factor[j] == j:
min_factor[j] = i
return min_factor
def osa_k_factorize(min_factor, n):
min_factor = min_factor
# n_twoes = (n & -n).bit_length() - 1
# res = [2] * n_twoes
# n >>= n_twoes
res = [0]*0
while n > 1:
p = min_factor[n]
res.append(p)
n //= p
return res
osa_k = osa_k_construct(1010101)
Factors = [osa_k_factorize(osa_k, a) for a in A]
factors = Factors[0]
st0 = set(factors) # 0 になれば setwize
st1 = set(factors) # 重複しなければ pairwise
pairwise = True
for factors in Factors[1:]:
st = set(factors)
for f in st:
if f in st1:
pairwise = False
else:
st1.add(f)
st0 &= st
if pairwise:
print("pairwise coprime")
elif not st0:
print("setwise coprime")
else:
print("not coprime")
numba_compile([
[solve, "void(i8,i8[:])"]
])
def main():
input = sys.stdin.buffer.readline
N = int(input())
A = np.array(input().split(), dtype=np.int64)
solve(N, A)
main()
| 48 | 78 | 1,339 | 2,309 | from itertools import groupby
class Osa_k:
def __init__(self, n_max):
self.min_factor = min_factor = list(range(n_max + 1))
for i in range(2, int(n_max**0.5) + 1):
if min_factor[i] == i:
for j in range(i * i, n_max + 1, i):
if min_factor[j] == j:
min_factor[j] = i
def __call__(self, n):
min_factor = self.min_factor
n_twoes = (n & -n).bit_length() - 1 # 最悪ケースでは速くなる
res = [2] * n_twoes
n >>= n_twoes
while n > 1:
p = min_factor[n]
res.append(p)
n //= p
return res
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
osa_k = Osa_k(1010101)
Factors = [osa_k(a) for a in A]
factors = Factors[0]
st0 = set(factors) # 0 になれば setwize
st1 = set(factors) # 重複しなければ pairwise
pairwise = True
for factors in Factors[1:]:
st = []
for f, _ in groupby(factors):
if f in st1:
pairwise = False
else:
st1.add(f)
st.append(f)
st0 &= set(st)
if pairwise:
print("pairwise coprime")
elif not st0:
print("setwise coprime")
else:
print("not coprime")
main()
| def numba_compile(numba_config):
import os, sys
if sys.argv[-1] == "ONLINE_JUDGE":
from numba import njit
from numba.pycc import CC
cc = CC("my_module")
for func, signature in numba_config:
globals()[func.__name__] = njit(signature)(func)
cc.export(func.__name__, signature)(func)
cc.compile()
exit()
elif os.name == "posix":
exec(
f"from my_module import {','.join(func.__name__ for func, _ in numba_config)}"
)
for func, _ in numba_config:
globals()[func.__name__] = vars()[func.__name__]
else:
from numba import njit
for func, signature in numba_config:
globals()[func.__name__] = njit(signature, cache=True)(func)
print("compiled!", file=sys.stderr)
import sys
import numpy as np
def solve(N, A):
def osa_k_construct(n_max):
min_factor = np.arange(n_max + 1)
for i in range(2, int(n_max**0.5) + 1):
if min_factor[i] == i:
for j in range(i * i, n_max + 1, i):
if min_factor[j] == j:
min_factor[j] = i
return min_factor
def osa_k_factorize(min_factor, n):
min_factor = min_factor
# n_twoes = (n & -n).bit_length() - 1
# res = [2] * n_twoes
# n >>= n_twoes
res = [0] * 0
while n > 1:
p = min_factor[n]
res.append(p)
n //= p
return res
osa_k = osa_k_construct(1010101)
Factors = [osa_k_factorize(osa_k, a) for a in A]
factors = Factors[0]
st0 = set(factors) # 0 になれば setwize
st1 = set(factors) # 重複しなければ pairwise
pairwise = True
for factors in Factors[1:]:
st = set(factors)
for f in st:
if f in st1:
pairwise = False
else:
st1.add(f)
st0 &= st
if pairwise:
print("pairwise coprime")
elif not st0:
print("setwise coprime")
else:
print("not coprime")
numba_compile([[solve, "void(i8,i8[:])"]])
def main():
input = sys.stdin.buffer.readline
N = int(input())
A = np.array(input().split(), dtype=np.int64)
solve(N, A)
main()
| false | 38.461538 | [
"-from itertools import groupby",
"+def numba_compile(numba_config):",
"+ import os, sys",
"+",
"+ if sys.argv[-1] == \"ONLINE_JUDGE\":",
"+ from numba import njit",
"+ from numba.pycc import CC",
"+",
"+ cc = CC(\"my_module\")",
"+ for func, signature in numba_config:",
"+ globals()[func.__name__] = njit(signature)(func)",
"+ cc.export(func.__name__, signature)(func)",
"+ cc.compile()",
"+ exit()",
"+ elif os.name == \"posix\":",
"+ exec(",
"+ f\"from my_module import {','.join(func.__name__ for func, _ in numba_config)}\"",
"+ )",
"+ for func, _ in numba_config:",
"+ globals()[func.__name__] = vars()[func.__name__]",
"+ else:",
"+ from numba import njit",
"+",
"+ for func, signature in numba_config:",
"+ globals()[func.__name__] = njit(signature, cache=True)(func)",
"+ print(\"compiled!\", file=sys.stderr)",
"-class Osa_k:",
"- def __init__(self, n_max):",
"- self.min_factor = min_factor = list(range(n_max + 1))",
"+import sys",
"+import numpy as np",
"+",
"+",
"+def solve(N, A):",
"+ def osa_k_construct(n_max):",
"+ min_factor = np.arange(n_max + 1)",
"+ return min_factor",
"- def __call__(self, n):",
"- min_factor = self.min_factor",
"- n_twoes = (n & -n).bit_length() - 1 # 最悪ケースでは速くなる",
"- res = [2] * n_twoes",
"- n >>= n_twoes",
"+ def osa_k_factorize(min_factor, n):",
"+ min_factor = min_factor",
"+ # n_twoes = (n & -n).bit_length() - 1",
"+ # res = [2] * n_twoes",
"+ # n >>= n_twoes",
"+ res = [0] * 0",
"-",
"-def main():",
"- N = int(eval(input()))",
"- A = list(map(int, input().split()))",
"- osa_k = Osa_k(1010101)",
"- Factors = [osa_k(a) for a in A]",
"+ osa_k = osa_k_construct(1010101)",
"+ Factors = [osa_k_factorize(osa_k, a) for a in A]",
"- st = []",
"- for f, _ in groupby(factors):",
"+ st = set(factors)",
"+ for f in st:",
"- st.append(f)",
"- st0 &= set(st)",
"+ st0 &= st",
"+numba_compile([[solve, \"void(i8,i8[:])\"]])",
"+",
"+",
"+def main():",
"+ input = sys.stdin.buffer.readline",
"+ N = int(input())",
"+ A = np.array(input().split(), dtype=np.int64)",
"+ solve(N, A)",
"+",
"+"
]
| false | 0.811668 | 0.19955 | 4.067496 | [
"s344687115",
"s480190618"
]
|
u102461423 | p02931 | python | s192435408 | s701337667 | 573 | 480 | 100,776 | 101,608 | Accepted | Accepted | 16.23 | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
import operator
N,H,W = list(map(int,readline().split()))
RCA = [tuple(int(x) for x in line.split()) for line in readlines()]
RCA.sort(key = operator.itemgetter(2), reverse=True)
root = list(range(H+W))
size = [0] * (H+W)
no_cycle = [True] * (H+W)
def find_root(x):
y = root[x]
if x == y:
return y
z = find_root(y)
root[x] = z
return z
def merge(x,y):
x,y = find_root(x),find_root(y)
sx,sy = size[x],size[y]
if sx < sy:
sx,sy = sy,sx
x,y = y,x
root[y] = x
no_cycle[x] = no_cycle[x] and no_cycle[y]
answer = 0
for R,C,A in RCA:
x,y = R-1,H+C-1
rx,ry = find_root(x),find_root(y)
if rx == ry:
if not no_cycle[rx]:
continue
no_cycle[rx] = False
else:
if (not no_cycle[rx]) and (not no_cycle[ry]):
continue
merge(rx,ry)
answer += A
print(answer)
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
import operator
N,H,W = list(map(int,readline().split()))
m = list(map(int,read().split()))
RCA = sorted(zip(m,m,m),key=operator.itemgetter(2),reverse=True)
root = list(range(H+W))
size = [0] * (H+W)
no_cycle = [True] * (H+W)
def find_root(x):
y = root[x]
if x == y:
return y
z = find_root(y)
root[x] = z
return z
def merge(x,y):
x,y = find_root(x),find_root(y)
sx,sy = size[x],size[y]
if sx < sy:
sx,sy = sy,sx
x,y = y,x
root[y] = x
no_cycle[x] = no_cycle[x] and no_cycle[y]
answer = 0
for R,C,A in RCA:
x,y = R-1,H+C-1
rx,ry = find_root(x),find_root(y)
if rx == ry:
if not no_cycle[rx]:
continue
no_cycle[rx] = False
else:
if (not no_cycle[rx]) and (not no_cycle[ry]):
continue
merge(rx,ry)
answer += A
print(answer) | 48 | 48 | 1,048 | 1,045 | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
import operator
N, H, W = list(map(int, readline().split()))
RCA = [tuple(int(x) for x in line.split()) for line in readlines()]
RCA.sort(key=operator.itemgetter(2), reverse=True)
root = list(range(H + W))
size = [0] * (H + W)
no_cycle = [True] * (H + W)
def find_root(x):
y = root[x]
if x == y:
return y
z = find_root(y)
root[x] = z
return z
def merge(x, y):
x, y = find_root(x), find_root(y)
sx, sy = size[x], size[y]
if sx < sy:
sx, sy = sy, sx
x, y = y, x
root[y] = x
no_cycle[x] = no_cycle[x] and no_cycle[y]
answer = 0
for R, C, A in RCA:
x, y = R - 1, H + C - 1
rx, ry = find_root(x), find_root(y)
if rx == ry:
if not no_cycle[rx]:
continue
no_cycle[rx] = False
else:
if (not no_cycle[rx]) and (not no_cycle[ry]):
continue
merge(rx, ry)
answer += A
print(answer)
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
import operator
N, H, W = list(map(int, readline().split()))
m = list(map(int, read().split()))
RCA = sorted(zip(m, m, m), key=operator.itemgetter(2), reverse=True)
root = list(range(H + W))
size = [0] * (H + W)
no_cycle = [True] * (H + W)
def find_root(x):
y = root[x]
if x == y:
return y
z = find_root(y)
root[x] = z
return z
def merge(x, y):
x, y = find_root(x), find_root(y)
sx, sy = size[x], size[y]
if sx < sy:
sx, sy = sy, sx
x, y = y, x
root[y] = x
no_cycle[x] = no_cycle[x] and no_cycle[y]
answer = 0
for R, C, A in RCA:
x, y = R - 1, H + C - 1
rx, ry = find_root(x), find_root(y)
if rx == ry:
if not no_cycle[rx]:
continue
no_cycle[rx] = False
else:
if (not no_cycle[rx]) and (not no_cycle[ry]):
continue
merge(rx, ry)
answer += A
print(answer)
| false | 0 | [
"+read = sys.stdin.buffer.read",
"-RCA = [tuple(int(x) for x in line.split()) for line in readlines()]",
"-RCA.sort(key=operator.itemgetter(2), reverse=True)",
"+m = list(map(int, read().split()))",
"+RCA = sorted(zip(m, m, m), key=operator.itemgetter(2), reverse=True)"
]
| false | 0.038063 | 0.037929 | 1.003515 | [
"s192435408",
"s701337667"
]
|
u703196441 | p02416 | python | s432178973 | s419924572 | 20 | 10 | 4,292 | 4,196 | Accepted | Accepted | 50 | from functools import reduce
while 1:
n = input()
if n == '0': break;
print(reduce(lambda x,y: x+int(y), n, 0)) | while 1:
x = input()
if x == '0': break;
print(sum([int(d) for d in x])) | 4 | 4 | 100 | 90 | from functools import reduce
while 1:
n = input()
if n == "0":
break
print(reduce(lambda x, y: x + int(y), n, 0))
| while 1:
x = input()
if x == "0":
break
print(sum([int(d) for d in x]))
| false | 0 | [
"-from functools import reduce",
"-",
"- n = input()",
"- if n == \"0\":",
"+ x = input()",
"+ if x == \"0\":",
"- print(reduce(lambda x, y: x + int(y), n, 0))",
"+ print(sum([int(d) for d in x]))"
]
| false | 0.036946 | 0.03306 | 1.117542 | [
"s432178973",
"s419924572"
]
|
u802963389 | p02744 | python | s576198675 | s210997818 | 426 | 109 | 42,092 | 16,312 | Accepted | Accepted | 74.41 | import sys
sys.setrecursionlimit(10 ** 6)
def create_li(li):
if len(li) >= n:
lis.append(li)
return
p = max(li)
for i in range(1, p + 2):
cp = li[:]
cp.append(i)
# print(cp)
create_li(cp)
lis = []
n = int(eval(input()))
pre = [1]
create_li(pre)
lis.sort()
al = ["a","b","c","d","e","f","g","h","i","j"]
ans = set(["".join([al[id-1] for id in i]) for i in lis])
ans = list(ans)
ans.sort()
for i in ans:
print(i) | from collections import deque
n = int(eval(input()))
def dfs(n):
stack = deque()
stack.append("a")
while stack:
q = stack.popleft()
if len(q) == n:
ans.append(q)
if len(q) < n:
for i in range(ord("a"), ord(max(q)) + 2):
stack.append(q + chr(i))
ans = []
dfs(n)
print(("\n".join(ans))) | 26 | 19 | 465 | 341 | import sys
sys.setrecursionlimit(10**6)
def create_li(li):
if len(li) >= n:
lis.append(li)
return
p = max(li)
for i in range(1, p + 2):
cp = li[:]
cp.append(i)
# print(cp)
create_li(cp)
lis = []
n = int(eval(input()))
pre = [1]
create_li(pre)
lis.sort()
al = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j"]
ans = set(["".join([al[id - 1] for id in i]) for i in lis])
ans = list(ans)
ans.sort()
for i in ans:
print(i)
| from collections import deque
n = int(eval(input()))
def dfs(n):
stack = deque()
stack.append("a")
while stack:
q = stack.popleft()
if len(q) == n:
ans.append(q)
if len(q) < n:
for i in range(ord("a"), ord(max(q)) + 2):
stack.append(q + chr(i))
ans = []
dfs(n)
print(("\n".join(ans)))
| false | 26.923077 | [
"-import sys",
"+from collections import deque",
"-sys.setrecursionlimit(10**6)",
"+n = int(eval(input()))",
"-def create_li(li):",
"- if len(li) >= n:",
"- lis.append(li)",
"- return",
"- p = max(li)",
"- for i in range(1, p + 2):",
"- cp = li[:]",
"- cp.append(i)",
"- # print(cp)",
"- create_li(cp)",
"+def dfs(n):",
"+ stack = deque()",
"+ stack.append(\"a\")",
"+ while stack:",
"+ q = stack.popleft()",
"+ if len(q) == n:",
"+ ans.append(q)",
"+ if len(q) < n:",
"+ for i in range(ord(\"a\"), ord(max(q)) + 2):",
"+ stack.append(q + chr(i))",
"-lis = []",
"-n = int(eval(input()))",
"-pre = [1]",
"-create_li(pre)",
"-lis.sort()",
"-al = [\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\"]",
"-ans = set([\"\".join([al[id - 1] for id in i]) for i in lis])",
"-ans = list(ans)",
"-ans.sort()",
"-for i in ans:",
"- print(i)",
"+ans = []",
"+dfs(n)",
"+print((\"\\n\".join(ans)))"
]
| false | 0.040717 | 0.053177 | 0.765698 | [
"s576198675",
"s210997818"
]
|
u353797797 | p03162 | python | s969843916 | s784718685 | 385 | 228 | 3,060 | 3,060 | Accepted | Accepted | 40.78 | n=int(eval(input()))
a,b,c=list(map(int,input().split()))
for i in range(n-1):
a1, b1, c1 = list(map(int, input().split()))
a,b,c=a1+max(b,c),b1+max(a,c),c1+max(a,b)
print((max(a,b,c))) | import sys
input=sys.stdin.readline
n=int(eval(input()))
a,b,c=list(map(int,input().split()))
for i in range(n-1):
a1, b1, c1 = list(map(int, input().split()))
a,b,c=a1+max(b,c),b1+max(a,c),c1+max(a,b)
print((max(a,b,c))) | 6 | 9 | 178 | 218 | n = int(eval(input()))
a, b, c = list(map(int, input().split()))
for i in range(n - 1):
a1, b1, c1 = list(map(int, input().split()))
a, b, c = a1 + max(b, c), b1 + max(a, c), c1 + max(a, b)
print((max(a, b, c)))
| import sys
input = sys.stdin.readline
n = int(eval(input()))
a, b, c = list(map(int, input().split()))
for i in range(n - 1):
a1, b1, c1 = list(map(int, input().split()))
a, b, c = a1 + max(b, c), b1 + max(a, c), c1 + max(a, b)
print((max(a, b, c)))
| false | 33.333333 | [
"+import sys",
"+",
"+input = sys.stdin.readline"
]
| false | 0.161718 | 0.087227 | 1.853995 | [
"s969843916",
"s784718685"
]
|
u145950990 | p03073 | python | s713437792 | s404671595 | 81 | 48 | 5,160 | 3,188 | Accepted | Accepted | 40.74 | import copy
s = list(eval(input()))
c = copy.copy(s)
n = len(s)
cnt1 = cnt2 = 0
for i in range(n-1):
if c[i+1]==c[i]:
cnt1 += 1
c[i+1] = '0' if c[i+1]=='1' else '1'
s[0] = '0' if s[0]=='1' else '1'
cnt2+=1
for i in range(1,n):
if s[i-1]==s[i]:
cnt2 += 1
s[i] = '0' if s[i]=='1' else '1'
print((min(cnt1,cnt2))) | s = eval(input())
a1 = a2 = 0
for i in range(len(s)):
if i%2==0:
if s[i]=='1':a1+=1
else:a2+=1
else:
if s[i]=='0':a1+=1
else:a2+=1
print((min(a1,a2))) | 16 | 10 | 357 | 191 | import copy
s = list(eval(input()))
c = copy.copy(s)
n = len(s)
cnt1 = cnt2 = 0
for i in range(n - 1):
if c[i + 1] == c[i]:
cnt1 += 1
c[i + 1] = "0" if c[i + 1] == "1" else "1"
s[0] = "0" if s[0] == "1" else "1"
cnt2 += 1
for i in range(1, n):
if s[i - 1] == s[i]:
cnt2 += 1
s[i] = "0" if s[i] == "1" else "1"
print((min(cnt1, cnt2)))
| s = eval(input())
a1 = a2 = 0
for i in range(len(s)):
if i % 2 == 0:
if s[i] == "1":
a1 += 1
else:
a2 += 1
else:
if s[i] == "0":
a1 += 1
else:
a2 += 1
print((min(a1, a2)))
| false | 37.5 | [
"-import copy",
"-",
"-s = list(eval(input()))",
"-c = copy.copy(s)",
"-n = len(s)",
"-cnt1 = cnt2 = 0",
"-for i in range(n - 1):",
"- if c[i + 1] == c[i]:",
"- cnt1 += 1",
"- c[i + 1] = \"0\" if c[i + 1] == \"1\" else \"1\"",
"-s[0] = \"0\" if s[0] == \"1\" else \"1\"",
"-cnt2 += 1",
"-for i in range(1, n):",
"- if s[i - 1] == s[i]:",
"- cnt2 += 1",
"- s[i] = \"0\" if s[i] == \"1\" else \"1\"",
"-print((min(cnt1, cnt2)))",
"+s = eval(input())",
"+a1 = a2 = 0",
"+for i in range(len(s)):",
"+ if i % 2 == 0:",
"+ if s[i] == \"1\":",
"+ a1 += 1",
"+ else:",
"+ a2 += 1",
"+ else:",
"+ if s[i] == \"0\":",
"+ a1 += 1",
"+ else:",
"+ a2 += 1",
"+print((min(a1, a2)))"
]
| false | 0.007701 | 0.054214 | 0.142046 | [
"s713437792",
"s404671595"
]
|
u608088992 | p02953 | python | s932967772 | s463013487 | 77 | 64 | 14,396 | 14,252 | Accepted | Accepted | 16.88 | N = int(eval(input()))
H = [int(h) for h in input().split()]
for i in reversed(list(range(1, N))):
if H[i] >= H[i-1]: continue
elif H[i] == H[i-1] - 1: H[i-1] -= 1
else:
print("No")
break
else: print("Yes")
| import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
H = [int(h) for h in input().split()]
for i in reversed(list(range(N-1))):
if H[i] > H[i + 1]: H[i] -= 1
if H[i] > H[i + 1]:
print("No")
break
else: print("Yes")
return 0
if __name__ == "__main__":
solve() | 10 | 17 | 233 | 355 | N = int(eval(input()))
H = [int(h) for h in input().split()]
for i in reversed(list(range(1, N))):
if H[i] >= H[i - 1]:
continue
elif H[i] == H[i - 1] - 1:
H[i - 1] -= 1
else:
print("No")
break
else:
print("Yes")
| import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
H = [int(h) for h in input().split()]
for i in reversed(list(range(N - 1))):
if H[i] > H[i + 1]:
H[i] -= 1
if H[i] > H[i + 1]:
print("No")
break
else:
print("Yes")
return 0
if __name__ == "__main__":
solve()
| false | 41.176471 | [
"-N = int(eval(input()))",
"-H = [int(h) for h in input().split()]",
"-for i in reversed(list(range(1, N))):",
"- if H[i] >= H[i - 1]:",
"- continue",
"- elif H[i] == H[i - 1] - 1:",
"- H[i - 1] -= 1",
"+import sys",
"+",
"+",
"+def solve():",
"+ input = sys.stdin.readline",
"+ N = int(eval(input()))",
"+ H = [int(h) for h in input().split()]",
"+ for i in reversed(list(range(N - 1))):",
"+ if H[i] > H[i + 1]:",
"+ H[i] -= 1",
"+ if H[i] > H[i + 1]:",
"+ print(\"No\")",
"+ break",
"- print(\"No\")",
"- break",
"-else:",
"- print(\"Yes\")",
"+ print(\"Yes\")",
"+ return 0",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ solve()"
]
| false | 0.068911 | 0.036153 | 1.906077 | [
"s932967772",
"s463013487"
]
|
u498487134 | p03032 | python | s886154006 | s235281885 | 195 | 137 | 40,304 | 69,804 | Accepted | Accepted | 29.74 | #import heapq
import copy
N,K=list(map(int,input().split()))
V=list(map(int,input().split()))
V.append(0)#右から取る時用
S=[0]*(N+1)#累積和
for i in range(N):
S[i+1]=S[i]+V[i]
#左からi番目まで見たときに，持っている負の宝石
left=[[] for _ in range(N+1)]
for i in range(N):
left[i+1]=copy.deepcopy(left[i])
if V[i]<0:
left[i+1].append(V[i])
left[i+1].sort()
ans=0
#左からi個，右からj個とったときについて考える
for i in range(N+1):
temp=S[i]
rem=copy.deepcopy(left[i])
#heapq.heapify(rem)
for j in range(N+1-i):
if i+j>K:
break
temp+=S[-1]-S[N-j]
if V[N-j]<0:
#heapq.heappush(rem,V[N-j])
rem.append(V[N-j])
rem.sort()
ret=K-(i+j)#負の宝石を返却できる回数
if ret>0:
for k in range(min(ret,len(rem))):
temp-=rem[k]
ans=max(ans,temp)
temp=S[i]
print(ans)
| import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N,K=MI()
V=LI()
ans=0
import heapq
#左からa個，右からb個とって，あまり分で負数を捨てる
for a in range(K+1):
for b in range(K+1):
if a+b>min(K,N):
break
hq=[]
heapq.heapify(hq)
for i in range(a):
heapq.heappush(hq,V[i])
for j in range(b):
heapq.heappush(hq,V[N-1-j])
temp=0
rem=K-(a+b)
for i in range(a+b):
v=heapq.heappop(hq)
if v>=0:
temp+=v
else:
if rem>0:
rem-=1
else:
temp+=v
ans=max(ans,temp)
print(ans)
main()
| 44 | 46 | 928 | 1,070 | # import heapq
import copy
N, K = list(map(int, input().split()))
V = list(map(int, input().split()))
V.append(0) # 右から取る時用
S = [0] * (N + 1) # 累積和
for i in range(N):
S[i + 1] = S[i] + V[i]
# 左からi番目まで見たときに，持っている負の宝石
left = [[] for _ in range(N + 1)]
for i in range(N):
left[i + 1] = copy.deepcopy(left[i])
if V[i] < 0:
left[i + 1].append(V[i])
left[i + 1].sort()
ans = 0
# 左からi個，右からj個とったときについて考える
for i in range(N + 1):
temp = S[i]
rem = copy.deepcopy(left[i])
# heapq.heapify(rem)
for j in range(N + 1 - i):
if i + j > K:
break
temp += S[-1] - S[N - j]
if V[N - j] < 0:
# heapq.heappush(rem,V[N-j])
rem.append(V[N - j])
rem.sort()
ret = K - (i + j) # 負の宝石を返却できる回数
if ret > 0:
for k in range(min(ret, len(rem))):
temp -= rem[k]
ans = max(ans, temp)
temp = S[i]
print(ans)
| import sys
input = sys.stdin.readline
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
def main():
mod = 10**9 + 7
N, K = MI()
V = LI()
ans = 0
import heapq
# 左からa個，右からb個とって，あまり分で負数を捨てる
for a in range(K + 1):
for b in range(K + 1):
if a + b > min(K, N):
break
hq = []
heapq.heapify(hq)
for i in range(a):
heapq.heappush(hq, V[i])
for j in range(b):
heapq.heappush(hq, V[N - 1 - j])
temp = 0
rem = K - (a + b)
for i in range(a + b):
v = heapq.heappop(hq)
if v >= 0:
temp += v
else:
if rem > 0:
rem -= 1
else:
temp += v
ans = max(ans, temp)
print(ans)
main()
| false | 4.347826 | [
"-# import heapq",
"-import copy",
"+import sys",
"-N, K = list(map(int, input().split()))",
"-V = list(map(int, input().split()))",
"-V.append(0) # 右から取る時用",
"-S = [0] * (N + 1) # 累積和",
"-for i in range(N):",
"- S[i + 1] = S[i] + V[i]",
"-# 左からi番目まで見たときに，持っている負の宝石",
"-left = [[] for _ in range(N + 1)]",
"-for i in range(N):",
"- left[i + 1] = copy.deepcopy(left[i])",
"- if V[i] < 0:",
"- left[i + 1].append(V[i])",
"- left[i + 1].sort()",
"-ans = 0",
"-# 左からi個，右からj個とったときについて考える",
"-for i in range(N + 1):",
"- temp = S[i]",
"- rem = copy.deepcopy(left[i])",
"- # heapq.heapify(rem)",
"- for j in range(N + 1 - i):",
"- if i + j > K:",
"- break",
"- temp += S[-1] - S[N - j]",
"- if V[N - j] < 0:",
"- # heapq.heappush(rem,V[N-j])",
"- rem.append(V[N - j])",
"- rem.sort()",
"- ret = K - (i + j) # 負の宝石を返却できる回数",
"- if ret > 0:",
"- for k in range(min(ret, len(rem))):",
"- temp -= rem[k]",
"- ans = max(ans, temp)",
"- temp = S[i]",
"-print(ans)",
"+input = sys.stdin.readline",
"+",
"+",
"+def I():",
"+ return int(eval(input()))",
"+",
"+",
"+def MI():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def LI():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def main():",
"+ mod = 10**9 + 7",
"+ N, K = MI()",
"+ V = LI()",
"+ ans = 0",
"+ import heapq",
"+",
"+ # 左からa個，右からb個とって，あまり分で負数を捨てる",
"+ for a in range(K + 1):",
"+ for b in range(K + 1):",
"+ if a + b > min(K, N):",
"+ break",
"+ hq = []",
"+ heapq.heapify(hq)",
"+ for i in range(a):",
"+ heapq.heappush(hq, V[i])",
"+ for j in range(b):",
"+ heapq.heappush(hq, V[N - 1 - j])",
"+ temp = 0",
"+ rem = K - (a + b)",
"+ for i in range(a + b):",
"+ v = heapq.heappop(hq)",
"+ if v >= 0:",
"+ temp += v",
"+ else:",
"+ if rem > 0:",
"+ rem -= 1",
"+ else:",
"+ temp += v",
"+ ans = max(ans, temp)",
"+ print(ans)",
"+",
"+",
"+main()"
]
| false | 0.047109 | 0.043917 | 1.072683 | [
"s886154006",
"s235281885"
]
|
u130900604 | p02785 | python | s595909870 | s897248557 | 309 | 186 | 90,572 | 110,324 | Accepted | Accepted | 39.81 | n,k=list(map(int,input().split()))
h=sorted(list(map(int,input().split())))
# print(h)
new_h=h[0:max(n-k,0)]
# print(new_h)
print((sum(new_h)))
| n,k,*h=list(map(int,open(0).read().split()))
if k>=n:
print((0))
exit()
h.sort(reverse=True)
for i in range(k):
h[i]=0
print((sum(h))) | 11 | 8 | 151 | 137 | n, k = list(map(int, input().split()))
h = sorted(list(map(int, input().split())))
# print(h)
new_h = h[0 : max(n - k, 0)]
# print(new_h)
print((sum(new_h)))
| n, k, *h = list(map(int, open(0).read().split()))
if k >= n:
print((0))
exit()
h.sort(reverse=True)
for i in range(k):
h[i] = 0
print((sum(h)))
| false | 27.272727 | [
"-n, k = list(map(int, input().split()))",
"-h = sorted(list(map(int, input().split())))",
"-# print(h)",
"-new_h = h[0 : max(n - k, 0)]",
"-# print(new_h)",
"-print((sum(new_h)))",
"+n, k, *h = list(map(int, open(0).read().split()))",
"+if k >= n:",
"+ print((0))",
"+ exit()",
"+h.sort(reverse=True)",
"+for i in range(k):",
"+ h[i] = 0",
"+print((sum(h)))"
]
| false | 0.044776 | 0.063552 | 0.704555 | [
"s595909870",
"s897248557"
]
|
u560867850 | p03200 | python | s271220482 | s016160027 | 67 | 33 | 3,500 | 3,500 | Accepted | Accepted | 50.75 | import sys
# input = sys.stdin.readline
def main():
s = eval(input())
total = 0
for i in range(len(s)-1):
if s[i] == "B":
total += 1
if s[i] == "B" and s[i+1] == "W":
yield total
else:
if s[i] == "W" and s[i+1] == "W":
yield total
print((sum(main()))) | import sys
# input = sys.stdin.readline
def main():
s = eval(input())
b = 0
for c in s:
if c == "B":
b += 1
else:
yield b
print((sum(main()))) | 17 | 14 | 358 | 202 | import sys
# input = sys.stdin.readline
def main():
s = eval(input())
total = 0
for i in range(len(s) - 1):
if s[i] == "B":
total += 1
if s[i] == "B" and s[i + 1] == "W":
yield total
else:
if s[i] == "W" and s[i + 1] == "W":
yield total
print((sum(main())))
| import sys
# input = sys.stdin.readline
def main():
s = eval(input())
b = 0
for c in s:
if c == "B":
b += 1
else:
yield b
print((sum(main())))
| false | 17.647059 | [
"- total = 0",
"- for i in range(len(s) - 1):",
"- if s[i] == \"B\":",
"- total += 1",
"- if s[i] == \"B\" and s[i + 1] == \"W\":",
"- yield total",
"+ b = 0",
"+ for c in s:",
"+ if c == \"B\":",
"+ b += 1",
"- if s[i] == \"W\" and s[i + 1] == \"W\":",
"- yield total",
"+ yield b"
]
| false | 0.03832 | 0.045717 | 0.838217 | [
"s271220482",
"s016160027"
]
|
u237991875 | p02396 | python | s457992481 | s163642826 | 60 | 50 | 6,248 | 6,692 | Accepted | Accepted | 16.67 | i = 1
n = 1
while n != 0:
n = int(input())
if n == 0:
continue
print("Case %d: %d" %(i, n))
i += 1 | cases = []
n = 1
while n != 0:
n = int(input())
if n == 0:
continue
cases.append(n)
for i in range(len(cases)):
print("Case %d: %d" %(i + 1, cases[i])) | 8 | 11 | 114 | 172 | i = 1
n = 1
while n != 0:
n = int(input())
if n == 0:
continue
print("Case %d: %d" % (i, n))
i += 1
| cases = []
n = 1
while n != 0:
n = int(input())
if n == 0:
continue
cases.append(n)
for i in range(len(cases)):
print("Case %d: %d" % (i + 1, cases[i]))
| false | 27.272727 | [
"-i = 1",
"+cases = []",
"- print(\"Case %d: %d\" % (i, n))",
"- i += 1",
"+ cases.append(n)",
"+for i in range(len(cases)):",
"+ print(\"Case %d: %d\" % (i + 1, cases[i]))"
]
| false | 0.035975 | 0.035332 | 1.018206 | [
"s457992481",
"s163642826"
]
|
u268318377 | p02678 | python | s342587961 | s786364082 | 1,122 | 1,032 | 57,640 | 42,008 | Accepted | Accepted | 8.02 | import sys
readline = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
N, M = list(map(int, readline().split()))
m = list(map(int, read().split()))
AB = list(zip(m, m))
graph = [[] for _ in range(N+1)]
for a, b in AB:
graph[a].append(b)
graph[b].append(a)
root = 1
q = [root]
checked = [0] * (N + 1)
checked[root] = 1
order = []
D = [0 for _ in range(N+1)]
d = 0
while q:
x = q.pop(0)
d = D[x]
for y in graph[x]:
if checked[y]:
continue
D[y] = d + 1
checked[y] = 1
q.append(y)
ans = [0 for _ in range(N+1)]
for a, b in AB:
d_a, d_b = D[a], D[b]
if d_a < d_b:
ans[b] = a
elif d_a > d_b:
ans[a] = b
print('Yes')
print(('\n'.join(map(str, ans[2:])))) | import sys
readline = sys.stdin.buffer.readline
N, M = list(map(int, readline().split()))
ans = [0] * (N+1)
graph = [[] for _ in range(N+1)]
for _ in range(M):
a, b = list(map(int, readline().split()))
graph[a].append(b)
graph[b].append(a)
root = 1
q = [root]
checked = [0] * (N + 1)
checked[root] = 1
while q:
x = q.pop(0)
for y in graph[x]:
if checked[y]:
continue
ans[y] = x
checked[y] = 1
q.append(y)
print('Yes')
print(('\n'.join(map(str, ans[2:])))) | 39 | 28 | 773 | 537 | import sys
readline = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
N, M = list(map(int, readline().split()))
m = list(map(int, read().split()))
AB = list(zip(m, m))
graph = [[] for _ in range(N + 1)]
for a, b in AB:
graph[a].append(b)
graph[b].append(a)
root = 1
q = [root]
checked = [0] * (N + 1)
checked[root] = 1
order = []
D = [0 for _ in range(N + 1)]
d = 0
while q:
x = q.pop(0)
d = D[x]
for y in graph[x]:
if checked[y]:
continue
D[y] = d + 1
checked[y] = 1
q.append(y)
ans = [0 for _ in range(N + 1)]
for a, b in AB:
d_a, d_b = D[a], D[b]
if d_a < d_b:
ans[b] = a
elif d_a > d_b:
ans[a] = b
print("Yes")
print(("\n".join(map(str, ans[2:]))))
| import sys
readline = sys.stdin.buffer.readline
N, M = list(map(int, readline().split()))
ans = [0] * (N + 1)
graph = [[] for _ in range(N + 1)]
for _ in range(M):
a, b = list(map(int, readline().split()))
graph[a].append(b)
graph[b].append(a)
root = 1
q = [root]
checked = [0] * (N + 1)
checked[root] = 1
while q:
x = q.pop(0)
for y in graph[x]:
if checked[y]:
continue
ans[y] = x
checked[y] = 1
q.append(y)
print("Yes")
print(("\n".join(map(str, ans[2:]))))
| false | 28.205128 | [
"-read = sys.stdin.buffer.read",
"-m = list(map(int, read().split()))",
"-AB = list(zip(m, m))",
"+ans = [0] * (N + 1)",
"-for a, b in AB:",
"+for _ in range(M):",
"+ a, b = list(map(int, readline().split()))",
"-order = []",
"-D = [0 for _ in range(N + 1)]",
"-d = 0",
"- d = D[x]",
"- D[y] = d + 1",
"+ ans[y] = x",
"-ans = [0 for _ in range(N + 1)]",
"-for a, b in AB:",
"- d_a, d_b = D[a], D[b]",
"- if d_a < d_b:",
"- ans[b] = a",
"- elif d_a > d_b:",
"- ans[a] = b"
]
| false | 0.037476 | 0.066386 | 0.564507 | [
"s342587961",
"s786364082"
]
|
u762420987 | p03127 | python | s066895205 | s363546380 | 368 | 79 | 83,992 | 14,184 | Accepted | Accepted | 78.53 | from heapq import heapify, heappush, heappop
N = int(eval(input()))
Alist = list(map(int, input().split()))
heapify(Alist)
while len(Alist)>1:
Alist = [a for a in Alist if a > 0]
min_num = heappop(Alist)
for i in range(len(Alist)):
Alist[i] %= min_num
heappush(Alist, min_num)
print((Alist[0])) | from heapq import heapify, heappop, heappush
N = int(eval(input()))
Alist = list(map(int, input().split()))
heapify(Alist)
while len(Alist) > 1:
atk = heappop(Alist)
Alist = [A % atk for A in Alist if (A % atk != 0)]
heapify(Alist)
heappush(Alist, atk)
print((Alist[0]))
| 11 | 10 | 320 | 288 | from heapq import heapify, heappush, heappop
N = int(eval(input()))
Alist = list(map(int, input().split()))
heapify(Alist)
while len(Alist) > 1:
Alist = [a for a in Alist if a > 0]
min_num = heappop(Alist)
for i in range(len(Alist)):
Alist[i] %= min_num
heappush(Alist, min_num)
print((Alist[0]))
| from heapq import heapify, heappop, heappush
N = int(eval(input()))
Alist = list(map(int, input().split()))
heapify(Alist)
while len(Alist) > 1:
atk = heappop(Alist)
Alist = [A % atk for A in Alist if (A % atk != 0)]
heapify(Alist)
heappush(Alist, atk)
print((Alist[0]))
| false | 9.090909 | [
"-from heapq import heapify, heappush, heappop",
"+from heapq import heapify, heappop, heappush",
"- Alist = [a for a in Alist if a > 0]",
"- min_num = heappop(Alist)",
"- for i in range(len(Alist)):",
"- Alist[i] %= min_num",
"- heappush(Alist, min_num)",
"+ atk = heappop(Alist)",
"+ Alist = [A % atk for A in Alist if (A % atk != 0)]",
"+ heapify(Alist)",
"+ heappush(Alist, atk)"
]
| false | 0.042246 | 0.039096 | 1.080548 | [
"s066895205",
"s363546380"
]
|
u566428756 | p03681 | python | s954657282 | s024682348 | 67 | 58 | 9,192 | 9,204 | Accepted | Accepted | 13.43 | N,M=list(map(int,input().split()))
abs_NM=abs(N-M)
if abs_NM>1:
print((0))
exit()
p=10**9+7
ans=1
for i in range(1,N+1):
ans=(ans*i)%p
for i in range(1,M+1):
ans=(ans*i)%p
if abs_NM==0:
ans=(ans*2)%p
print(ans) | N,M=list(map(int,input().split()))
abs_NM=abs(N-M)
if abs_NM>1:
print((0))
exit()
p=10**9+7
min_=min(N,M)
max_=max(N,M)
ans=1
for i in range(1,min_+1):
ans=(ans*i)%p
ans=(ans*i)%p
if abs_NM==1:
ans=(ans*max_)%p
else:
ans=(ans*2)%p
print(ans) | 16 | 20 | 239 | 279 | N, M = list(map(int, input().split()))
abs_NM = abs(N - M)
if abs_NM > 1:
print((0))
exit()
p = 10**9 + 7
ans = 1
for i in range(1, N + 1):
ans = (ans * i) % p
for i in range(1, M + 1):
ans = (ans * i) % p
if abs_NM == 0:
ans = (ans * 2) % p
print(ans)
| N, M = list(map(int, input().split()))
abs_NM = abs(N - M)
if abs_NM > 1:
print((0))
exit()
p = 10**9 + 7
min_ = min(N, M)
max_ = max(N, M)
ans = 1
for i in range(1, min_ + 1):
ans = (ans * i) % p
ans = (ans * i) % p
if abs_NM == 1:
ans = (ans * max_) % p
else:
ans = (ans * 2) % p
print(ans)
| false | 20 | [
"+min_ = min(N, M)",
"+max_ = max(N, M)",
"-for i in range(1, N + 1):",
"+for i in range(1, min_ + 1):",
"-for i in range(1, M + 1):",
"-if abs_NM == 0:",
"+if abs_NM == 1:",
"+ ans = (ans * max_) % p",
"+else:"
]
| false | 0.041672 | 0.109429 | 0.380812 | [
"s954657282",
"s024682348"
]
|
u703950586 | p02684 | python | s034841365 | s642967466 | 124 | 114 | 101,292 | 96,812 | Accepted | Accepted | 8.06 | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N,K = LI()
A = [0] + LI()
his = [0] * (N+1)
s = 1
cnt = 1
his[1] = 1
while his[A[s]] == 0:
s = A[s]
cnt += 1
his[s] = cnt
if K >= cnt:
s = A[s]
cnt -= his[s] - 1
k = (K - his[s] + 1) % cnt
else:
k = K
s = 1
for i in range(k):
s = A[s]
print(s)
if __name__ == '__main__':
main() | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N,K = LI()
A = [0] + LI()
his = [0] * (N+1)
s = 1
cnt = K
while cnt > 0:
his[s] = cnt
s = A[s]
cnt -= 1
if his[s] > cnt:
cnt = cnt % (his[s]-cnt)
print(s)
if __name__ == '__main__':
main() | 36 | 24 | 657 | 508 | import sys, queue, math, copy, itertools, bisect, collections, heapq
def main():
sys.setrecursionlimit(10**7)
LI = lambda: [int(x) for x in sys.stdin.readline().split()]
NI = lambda: int(sys.stdin.readline())
N, K = LI()
A = [0] + LI()
his = [0] * (N + 1)
s = 1
cnt = 1
his[1] = 1
while his[A[s]] == 0:
s = A[s]
cnt += 1
his[s] = cnt
if K >= cnt:
s = A[s]
cnt -= his[s] - 1
k = (K - his[s] + 1) % cnt
else:
k = K
s = 1
for i in range(k):
s = A[s]
print(s)
if __name__ == "__main__":
main()
| import sys, queue, math, copy, itertools, bisect, collections, heapq
def main():
sys.setrecursionlimit(10**7)
LI = lambda: [int(x) for x in sys.stdin.readline().split()]
NI = lambda: int(sys.stdin.readline())
N, K = LI()
A = [0] + LI()
his = [0] * (N + 1)
s = 1
cnt = K
while cnt > 0:
his[s] = cnt
s = A[s]
cnt -= 1
if his[s] > cnt:
cnt = cnt % (his[s] - cnt)
print(s)
if __name__ == "__main__":
main()
| false | 33.333333 | [
"- cnt = 1",
"- his[1] = 1",
"- while his[A[s]] == 0:",
"+ cnt = K",
"+ while cnt > 0:",
"+ his[s] = cnt",
"- cnt += 1",
"- his[s] = cnt",
"- if K >= cnt:",
"- s = A[s]",
"- cnt -= his[s] - 1",
"- k = (K - his[s] + 1) % cnt",
"- else:",
"- k = K",
"- s = 1",
"- for i in range(k):",
"- s = A[s]",
"+ cnt -= 1",
"+ if his[s] > cnt:",
"+ cnt = cnt % (his[s] - cnt)"
]
| false | 0.03732 | 0.042802 | 0.871908 | [
"s034841365",
"s642967466"
]
|
u694810977 | p03087 | python | s846616790 | s451346567 | 639 | 438 | 59,208 | 10,208 | Accepted | Accepted | 31.46 | N, Q = list(map(int, input().split()))
ruisekiwa = [0]
lists = []
cnt = 0
S = str(eval(input()))
for t in range(1, N):
if S[t - 1] == "A" and S[t] == "C":
cnt += 1
ruisekiwa.append(cnt)
ruisekiwa.append(cnt)
for i in range(Q):
l, r = list(map(int, input().split()))
ans = ruisekiwa[r - 1] - ruisekiwa[l - 1]
lists.append(ans)
for m in range(len(lists)):
print((lists[m]))
| N, Q = list(map(int, input().split()))
S = str(eval(input()))
count = [0]*(N+1)
lists = []
for i in range(1, N):
if S[i-1] == "A" and S[i] == "C":
count[i] = count[i-1] + 1
else:
count[i] = count[i-1]
for i in range(Q):
l, r = list(map(int, input().split()))
ans = count[r-1] - count[l-1]
lists.append(ans)
for i in range(len(lists)):
print((lists[i]))
| 16 | 15 | 399 | 387 | N, Q = list(map(int, input().split()))
ruisekiwa = [0]
lists = []
cnt = 0
S = str(eval(input()))
for t in range(1, N):
if S[t - 1] == "A" and S[t] == "C":
cnt += 1
ruisekiwa.append(cnt)
ruisekiwa.append(cnt)
for i in range(Q):
l, r = list(map(int, input().split()))
ans = ruisekiwa[r - 1] - ruisekiwa[l - 1]
lists.append(ans)
for m in range(len(lists)):
print((lists[m]))
| N, Q = list(map(int, input().split()))
S = str(eval(input()))
count = [0] * (N + 1)
lists = []
for i in range(1, N):
if S[i - 1] == "A" and S[i] == "C":
count[i] = count[i - 1] + 1
else:
count[i] = count[i - 1]
for i in range(Q):
l, r = list(map(int, input().split()))
ans = count[r - 1] - count[l - 1]
lists.append(ans)
for i in range(len(lists)):
print((lists[i]))
| false | 6.25 | [
"-ruisekiwa = [0]",
"+S = str(eval(input()))",
"+count = [0] * (N + 1)",
"-cnt = 0",
"-S = str(eval(input()))",
"-for t in range(1, N):",
"- if S[t - 1] == \"A\" and S[t] == \"C\":",
"- cnt += 1",
"- ruisekiwa.append(cnt)",
"-ruisekiwa.append(cnt)",
"+for i in range(1, N):",
"+ if S[i - 1] == \"A\" and S[i] == \"C\":",
"+ count[i] = count[i - 1] + 1",
"+ else:",
"+ count[i] = count[i - 1]",
"- ans = ruisekiwa[r - 1] - ruisekiwa[l - 1]",
"+ ans = count[r - 1] - count[l - 1]",
"-for m in range(len(lists)):",
"- print((lists[m]))",
"+for i in range(len(lists)):",
"+ print((lists[i]))"
]
| false | 0.079438 | 0.107676 | 0.737748 | [
"s846616790",
"s451346567"
]
|
u852690916 | p03705 | python | s361098830 | s743481028 | 193 | 160 | 38,384 | 38,384 | Accepted | Accepted | 17.1 | N,A,B = list(map(int, input().split()))
if N == 1 and A != B:
print((0))
exit()
if A > B:
print((0))
exit()
if N == 2:
print((1))
exit()
m = N - 2
print((B*m - A*m + 1)) | N,A,B=list(map(int, input().split()))
if A>B:
print((0))
exit()
elif N==1 and A!=B:
print((0))
exit()
mn=A*(N-1) + B
mx=A + B*(N-1)
print((mx-mn+1))
| 14 | 12 | 194 | 166 | N, A, B = list(map(int, input().split()))
if N == 1 and A != B:
print((0))
exit()
if A > B:
print((0))
exit()
if N == 2:
print((1))
exit()
m = N - 2
print((B * m - A * m + 1))
| N, A, B = list(map(int, input().split()))
if A > B:
print((0))
exit()
elif N == 1 and A != B:
print((0))
exit()
mn = A * (N - 1) + B
mx = A + B * (N - 1)
print((mx - mn + 1))
| false | 14.285714 | [
"-if N == 1 and A != B:",
"- print((0))",
"- exit()",
"-if N == 2:",
"- print((1))",
"+elif N == 1 and A != B:",
"+ print((0))",
"-m = N - 2",
"-print((B * m - A * m + 1))",
"+mn = A * (N - 1) + B",
"+mx = A + B * (N - 1)",
"+print((mx - mn + 1))"
]
| false | 0.101284 | 0.039024 | 2.595391 | [
"s361098830",
"s743481028"
]
|
u504836877 | p03077 | python | s646334654 | s869852592 | 19 | 17 | 3,188 | 2,940 | Accepted | Accepted | 10.53 | N = int(eval(input()))
L = [0 for i in range(5)]
for i in range(5):
L[i] = int(eval(input()))
time = [0 for i in range(5)]
time[0] = (N-1)//L[0] + 1
for i in range(4):
if L[i] <= L[i+1]:
time[i+1] = time[i]
else:
time[i+1] = (N-1)//L[i+1] + 1
ans = max(time) + 4
print(ans) | N = int(eval(input()))
L = [int(eval(input())) for _ in range(5)]
n = min(L)
ans = (N+n-1) // n + 4
print(ans) | 16 | 6 | 327 | 104 | N = int(eval(input()))
L = [0 for i in range(5)]
for i in range(5):
L[i] = int(eval(input()))
time = [0 for i in range(5)]
time[0] = (N - 1) // L[0] + 1
for i in range(4):
if L[i] <= L[i + 1]:
time[i + 1] = time[i]
else:
time[i + 1] = (N - 1) // L[i + 1] + 1
ans = max(time) + 4
print(ans)
| N = int(eval(input()))
L = [int(eval(input())) for _ in range(5)]
n = min(L)
ans = (N + n - 1) // n + 4
print(ans)
| false | 62.5 | [
"-L = [0 for i in range(5)]",
"-for i in range(5):",
"- L[i] = int(eval(input()))",
"-time = [0 for i in range(5)]",
"-time[0] = (N - 1) // L[0] + 1",
"-for i in range(4):",
"- if L[i] <= L[i + 1]:",
"- time[i + 1] = time[i]",
"- else:",
"- time[i + 1] = (N - 1) // L[i + 1] + 1",
"-ans = max(time) + 4",
"+L = [int(eval(input())) for _ in range(5)]",
"+n = min(L)",
"+ans = (N + n - 1) // n + 4"
]
| false | 0.051625 | 0.050092 | 1.030614 | [
"s646334654",
"s869852592"
]
|
u581603131 | p03835 | python | s071765851 | s981870799 | 1,415 | 800 | 2,940 | 41,112 | Accepted | Accepted | 43.46 | K, S = list(map(int, input().split()))
count = 0
for X in range(K+1):
for Y in range(K+1):
if 0<=S-X-Y<=K: #X+Y+Z=S Z=S-X-Y,0<=Z<=K
count += 1
print(count) | k,s=list(map(int,input().split()))
print((len([1 for z in range(k+1) for y in range(k+1) if 0<=s-y-z<=k]))) | 7 | 2 | 179 | 100 | K, S = list(map(int, input().split()))
count = 0
for X in range(K + 1):
for Y in range(K + 1):
if 0 <= S - X - Y <= K: # X+Y+Z=S Z=S-X-Y,0<=Z<=K
count += 1
print(count)
| k, s = list(map(int, input().split()))
print((len([1 for z in range(k + 1) for y in range(k + 1) if 0 <= s - y - z <= k])))
| false | 71.428571 | [
"-K, S = list(map(int, input().split()))",
"-count = 0",
"-for X in range(K + 1):",
"- for Y in range(K + 1):",
"- if 0 <= S - X - Y <= K: # X+Y+Z=S Z=S-X-Y,0<=Z<=K",
"- count += 1",
"-print(count)",
"+k, s = list(map(int, input().split()))",
"+print((len([1 for z in range(k + 1) for y in range(k + 1) if 0 <= s - y - z <= k])))"
]
| false | 0.035081 | 0.042251 | 0.830305 | [
"s071765851",
"s981870799"
]
|
u089142196 | p02727 | python | s860024643 | s906452857 | 1,821 | 224 | 23,584 | 29,592 | Accepted | Accepted | 87.7 | import heapq
X,Y,A,B,C = list(map(int,input().split()))
p=list(map(int,input().split()))
q=list(map(int,input().split()))
r=list(map(int,input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
a=p[0:X]+q[0:Y]
heapq.heapify(a)
#print(a)
#print(a[0])
flag=True
while flag:
if len(r)==0:
flag=False
elif a[0]<r[0]:
heapq.heappop(a)
heapq.heappush(a,r[0])
r.pop(0)
else:
flag=False
print((sum(a))) | import heapq
X,Y,A,B,C=list(map(int,input().split()))
p=list(map(int,input().split()))
q=list(map(int,input().split()))
r=list(map(int,input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort()
s = p[:X]+q[:Y]
ans=sum(s)
heapq.heapify(s)
while r and s:
if s[0]<r[-1]:
ans += r[-1]
r.pop()
ans -= heapq.heappop(s)
else:
break
print(ans) | 27 | 22 | 466 | 403 | import heapq
X, Y, A, B, C = list(map(int, input().split()))
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
a = p[0:X] + q[0:Y]
heapq.heapify(a)
# print(a)
# print(a[0])
flag = True
while flag:
if len(r) == 0:
flag = False
elif a[0] < r[0]:
heapq.heappop(a)
heapq.heappush(a, r[0])
r.pop(0)
else:
flag = False
print((sum(a)))
| import heapq
X, Y, A, B, C = list(map(int, input().split()))
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort()
s = p[:X] + q[:Y]
ans = sum(s)
heapq.heapify(s)
while r and s:
if s[0] < r[-1]:
ans += r[-1]
r.pop()
ans -= heapq.heappop(s)
else:
break
print(ans)
| false | 18.518519 | [
"-r.sort(reverse=True)",
"-a = p[0:X] + q[0:Y]",
"-heapq.heapify(a)",
"-# print(a)",
"-# print(a[0])",
"-flag = True",
"-while flag:",
"- if len(r) == 0:",
"- flag = False",
"- elif a[0] < r[0]:",
"- heapq.heappop(a)",
"- heapq.heappush(a, r[0])",
"- r.pop(0)",
"+r.sort()",
"+s = p[:X] + q[:Y]",
"+ans = sum(s)",
"+heapq.heapify(s)",
"+while r and s:",
"+ if s[0] < r[-1]:",
"+ ans += r[-1]",
"+ r.pop()",
"+ ans -= heapq.heappop(s)",
"- flag = False",
"-print((sum(a)))",
"+ break",
"+print(ans)"
]
| false | 0.118277 | 0.068838 | 1.718202 | [
"s860024643",
"s906452857"
]
|
u729133443 | p02709 | python | s482036186 | s820929619 | 937 | 858 | 9,676 | 9,676 | Accepted | Accepted | 8.43 | e=enumerate
n,*a=list(map(int,open(0).read().split()))
d=[0]
for j,(a,i)in e(sorted((a,i)for i,a in e(a))[::-1]):d=[d[0]+a*(~i-j+n)]+[max(d[k]+a*(~i-j+n+k),d[k-1]+a*abs(i-k+1))for k in range(1,j+1)]+[d[j]+a*abs(i-j)]
print((max(d))) | e=enumerate
n,*a=list(map(int,open(0).read().split()))
d=[0]
for j,(a,i)in e(sorted((a,i)for i,a in e(a))[::-1]):d=[d[0]+a*(~i-j+n)]+[max(d[k+1]+a*(n+k-i-j),d[k]+a*abs(i-k))for k in range(j)]+[d[j]+a*abs(i-j)]
print((max(d))) | 5 | 5 | 228 | 221 | e = enumerate
n, *a = list(map(int, open(0).read().split()))
d = [0]
for j, (a, i) in e(sorted((a, i) for i, a in e(a))[::-1]):
d = (
[d[0] + a * (~i - j + n)]
+ [
max(d[k] + a * (~i - j + n + k), d[k - 1] + a * abs(i - k + 1))
for k in range(1, j + 1)
]
+ [d[j] + a * abs(i - j)]
)
print((max(d)))
| e = enumerate
n, *a = list(map(int, open(0).read().split()))
d = [0]
for j, (a, i) in e(sorted((a, i) for i, a in e(a))[::-1]):
d = (
[d[0] + a * (~i - j + n)]
+ [max(d[k + 1] + a * (n + k - i - j), d[k] + a * abs(i - k)) for k in range(j)]
+ [d[j] + a * abs(i - j)]
)
print((max(d)))
| false | 0 | [
"- + [",
"- max(d[k] + a * (~i - j + n + k), d[k - 1] + a * abs(i - k + 1))",
"- for k in range(1, j + 1)",
"- ]",
"+ + [max(d[k + 1] + a * (n + k - i - j), d[k] + a * abs(i - k)) for k in range(j)]"
]
| false | 0.108108 | 0.071441 | 1.513251 | [
"s482036186",
"s820929619"
]
|
u780342333 | p02389 | python | s376463199 | s944133112 | 30 | 20 | 7,728 | 5,580 | Accepted | Accepted | 33.33 | width, length = [int(x) for x in input().split(" ")]
print(("{} {}".format(width * length, 2 * (width+length)))) | a, b = list(map(int, input().split()))
print(("{} {}".format(a*b, (a+b)* 2)))
| 2 | 2 | 111 | 71 | width, length = [int(x) for x in input().split(" ")]
print(("{} {}".format(width * length, 2 * (width + length))))
| a, b = list(map(int, input().split()))
print(("{} {}".format(a * b, (a + b) * 2)))
| false | 0 | [
"-width, length = [int(x) for x in input().split(\" \")]",
"-print((\"{} {}\".format(width * length, 2 * (width + length))))",
"+a, b = list(map(int, input().split()))",
"+print((\"{} {}\".format(a * b, (a + b) * 2)))"
]
| false | 0.043198 | 0.042982 | 1.005033 | [
"s376463199",
"s944133112"
]
|
u263830634 | p03660 | python | s835778793 | s111665603 | 321 | 296 | 22,232 | 22,232 | Accepted | Accepted | 7.79 | import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
graph = [[] for _ in range(N + 1)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
check = [0] * (N + 1)
que1 = deque() #fennecのキュー
que2 = deque() #sunukeのキュー
que1.append(1)
que2.append(N)
check[1] = 1
check[N] = 1
fennec = 0
snuke = 0
flag = True
while flag:
flag = False
tmp_lst = []
while len(que1) != 0:
flag = True
tmp = que1.popleft()
for next_ in graph[tmp]:
if check[next_] == 0:
tmp_lst.append(next_)
fennec += 1
check[next_] = 1
for i in tmp_lst:
que1.append(i)
tmp_lst = []
while len(que2) != 0:
flag = True
tmp = que2.popleft()
for next_ in graph[tmp]:
if check[next_] == 0:
tmp_lst.append(next_)
snuke += 1
check[next_] = 1
for i in tmp_lst:
que2.append(i)
if fennec > snuke:
print ('Fennec')
else:
print ('Snuke') | def main():
import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
graph = [[] for _ in range(N + 1)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
check = [0] * (N + 1)
que1 = deque() #fennecのキュー
que2 = deque() #sunukeのキュー
que1.append(1)
que2.append(N)
check[1] = 1
check[N] = 1
fennec = 0
snuke = 0
flag = True
while flag:
flag = False
tmp_lst = []
while len(que1) != 0:
flag = True
tmp = que1.popleft()
for next_ in graph[tmp]:
if check[next_] == 0:
tmp_lst.append(next_)
fennec += 1
check[next_] = 1
for i in tmp_lst:
que1.append(i)
tmp_lst = []
while len(que2) != 0:
flag = True
tmp = que2.popleft()
for next_ in graph[tmp]:
if check[next_] == 0:
tmp_lst.append(next_)
snuke += 1
check[next_] = 1
for i in tmp_lst:
que2.append(i)
if fennec > snuke:
print ('Fennec')
else:
print ('Snuke')
if __name__ == '__main__':
main() | 59 | 63 | 1,164 | 1,411 | import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
graph = [[] for _ in range(N + 1)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
check = [0] * (N + 1)
que1 = deque() # fennecのキュー
que2 = deque() # sunukeのキュー
que1.append(1)
que2.append(N)
check[1] = 1
check[N] = 1
fennec = 0
snuke = 0
flag = True
while flag:
flag = False
tmp_lst = []
while len(que1) != 0:
flag = True
tmp = que1.popleft()
for next_ in graph[tmp]:
if check[next_] == 0:
tmp_lst.append(next_)
fennec += 1
check[next_] = 1
for i in tmp_lst:
que1.append(i)
tmp_lst = []
while len(que2) != 0:
flag = True
tmp = que2.popleft()
for next_ in graph[tmp]:
if check[next_] == 0:
tmp_lst.append(next_)
snuke += 1
check[next_] = 1
for i in tmp_lst:
que2.append(i)
if fennec > snuke:
print("Fennec")
else:
print("Snuke")
| def main():
import sys
from collections import deque
input = sys.stdin.readline
N = int(eval(input()))
graph = [[] for _ in range(N + 1)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
check = [0] * (N + 1)
que1 = deque() # fennecのキュー
que2 = deque() # sunukeのキュー
que1.append(1)
que2.append(N)
check[1] = 1
check[N] = 1
fennec = 0
snuke = 0
flag = True
while flag:
flag = False
tmp_lst = []
while len(que1) != 0:
flag = True
tmp = que1.popleft()
for next_ in graph[tmp]:
if check[next_] == 0:
tmp_lst.append(next_)
fennec += 1
check[next_] = 1
for i in tmp_lst:
que1.append(i)
tmp_lst = []
while len(que2) != 0:
flag = True
tmp = que2.popleft()
for next_ in graph[tmp]:
if check[next_] == 0:
tmp_lst.append(next_)
snuke += 1
check[next_] = 1
for i in tmp_lst:
que2.append(i)
if fennec > snuke:
print("Fennec")
else:
print("Snuke")
if __name__ == "__main__":
main()
| false | 6.349206 | [
"-import sys",
"-from collections import deque",
"+def main():",
"+ import sys",
"+ from collections import deque",
"-input = sys.stdin.readline",
"-N = int(eval(input()))",
"-graph = [[] for _ in range(N + 1)]",
"-for _ in range(N - 1):",
"- a, b = list(map(int, input().split()))",
"- graph[a].append(b)",
"- graph[b].append(a)",
"-check = [0] * (N + 1)",
"-que1 = deque() # fennecのキュー",
"-que2 = deque() # sunukeのキュー",
"-que1.append(1)",
"-que2.append(N)",
"-check[1] = 1",
"-check[N] = 1",
"-fennec = 0",
"-snuke = 0",
"-flag = True",
"-while flag:",
"- flag = False",
"- tmp_lst = []",
"- while len(que1) != 0:",
"- flag = True",
"- tmp = que1.popleft()",
"- for next_ in graph[tmp]:",
"- if check[next_] == 0:",
"- tmp_lst.append(next_)",
"- fennec += 1",
"- check[next_] = 1",
"- for i in tmp_lst:",
"- que1.append(i)",
"- tmp_lst = []",
"- while len(que2) != 0:",
"- flag = True",
"- tmp = que2.popleft()",
"- for next_ in graph[tmp]:",
"- if check[next_] == 0:",
"- tmp_lst.append(next_)",
"- snuke += 1",
"- check[next_] = 1",
"- for i in tmp_lst:",
"- que2.append(i)",
"-if fennec > snuke:",
"- print(\"Fennec\")",
"-else:",
"- print(\"Snuke\")",
"+ input = sys.stdin.readline",
"+ N = int(eval(input()))",
"+ graph = [[] for _ in range(N + 1)]",
"+ for _ in range(N - 1):",
"+ a, b = list(map(int, input().split()))",
"+ graph[a].append(b)",
"+ graph[b].append(a)",
"+ check = [0] * (N + 1)",
"+ que1 = deque() # fennecのキュー",
"+ que2 = deque() # sunukeのキュー",
"+ que1.append(1)",
"+ que2.append(N)",
"+ check[1] = 1",
"+ check[N] = 1",
"+ fennec = 0",
"+ snuke = 0",
"+ flag = True",
"+ while flag:",
"+ flag = False",
"+ tmp_lst = []",
"+ while len(que1) != 0:",
"+ flag = True",
"+ tmp = que1.popleft()",
"+ for next_ in graph[tmp]:",
"+ if check[next_] == 0:",
"+ tmp_lst.append(next_)",
"+ fennec += 1",
"+ check[next_] = 1",
"+ for i in tmp_lst:",
"+ que1.append(i)",
"+ tmp_lst = []",
"+ while len(que2) != 0:",
"+ flag = True",
"+ tmp = que2.popleft()",
"+ for next_ in graph[tmp]:",
"+ if check[next_] == 0:",
"+ tmp_lst.append(next_)",
"+ snuke += 1",
"+ check[next_] = 1",
"+ for i in tmp_lst:",
"+ que2.append(i)",
"+ if fennec > snuke:",
"+ print(\"Fennec\")",
"+ else:",
"+ print(\"Snuke\")",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.04085 | 0.054886 | 0.744259 | [
"s835778793",
"s111665603"
]
|
u729133443 | p03425 | python | s751092813 | s437144013 | 58 | 53 | 17,688 | 17,832 | Accepted | Accepted | 8.62 | from itertools import*;s,*_=list(zip(*open(0).readlines()));print((sum(p*q*r for p,q,r in combinations(list(map(s.count,'MARCH')),3)))) | from itertools import*;s,*_=list(zip(*open(0)));print((sum(p*q*r for p,q,r in combinations(list(map(s.count,'MARCH')),3)))) | 1 | 1 | 121 | 109 | from itertools import *
s, *_ = list(zip(*open(0).readlines()))
print((sum(p * q * r for p, q, r in combinations(list(map(s.count, "MARCH")), 3))))
| from itertools import *
s, *_ = list(zip(*open(0)))
print((sum(p * q * r for p, q, r in combinations(list(map(s.count, "MARCH")), 3))))
| false | 0 | [
"-s, *_ = list(zip(*open(0).readlines()))",
"+s, *_ = list(zip(*open(0)))"
]
| false | 0.059567 | 0.046368 | 1.284649 | [
"s751092813",
"s437144013"
]
|
u942982705 | p02659 | python | s841917569 | s011334399 | 24 | 21 | 10,076 | 9,148 | Accepted | Accepted | 12.5 | from sys import stdin
from decimal import Decimal
import math
A, B = [Decimal(x) for x in stdin.readline().rstrip().split()]
print((int(math.floor(A * B)))) | from sys import stdin
A,B=stdin.readline().rstrip().split()
print((int(A)*int(B.replace(".", ""))//100)) | 5 | 3 | 158 | 104 | from sys import stdin
from decimal import Decimal
import math
A, B = [Decimal(x) for x in stdin.readline().rstrip().split()]
print((int(math.floor(A * B))))
| from sys import stdin
A, B = stdin.readline().rstrip().split()
print((int(A) * int(B.replace(".", "")) // 100))
| false | 40 | [
"-from decimal import Decimal",
"-import math",
"-A, B = [Decimal(x) for x in stdin.readline().rstrip().split()]",
"-print((int(math.floor(A * B))))",
"+A, B = stdin.readline().rstrip().split()",
"+print((int(A) * int(B.replace(\".\", \"\")) // 100))"
]
| false | 0.103771 | 0.082363 | 1.259929 | [
"s841917569",
"s011334399"
]
|
u150821332 | p02715 | python | s931917045 | s192248325 | 741 | 553 | 27,416 | 27,312 | Accepted | Accepted | 25.37 | import numpy as np
n,k = list(map(int,input().split()))
m = 10**9 + 7
gcds = np.zeros(k+1, int)
for i in range(k,0,-1):
tmp = k // i
gcds[i] = pow(tmp,n, m)
for j in range(tmp,1,-1):
gcds[i] -= gcds[j*i]
ans = 0
for i in range(k,0,-1):
ans = (ans + gcds[i]*i)%m
print(ans) | import numpy as np
n,k = list(map(int,input().split()))
m = 10**9 + 7
gcds = np.zeros(k+1, int)
ans = 0
for i in range(k,0,-1):
tmp = pow(k//i,n, m)
for j in range(i*2,k+1,i):
tmp -= gcds[j]
ans = (ans + tmp*i)%m
gcds[i] = tmp
print(ans) | 14 | 13 | 292 | 256 | import numpy as np
n, k = list(map(int, input().split()))
m = 10**9 + 7
gcds = np.zeros(k + 1, int)
for i in range(k, 0, -1):
tmp = k // i
gcds[i] = pow(tmp, n, m)
for j in range(tmp, 1, -1):
gcds[i] -= gcds[j * i]
ans = 0
for i in range(k, 0, -1):
ans = (ans + gcds[i] * i) % m
print(ans)
| import numpy as np
n, k = list(map(int, input().split()))
m = 10**9 + 7
gcds = np.zeros(k + 1, int)
ans = 0
for i in range(k, 0, -1):
tmp = pow(k // i, n, m)
for j in range(i * 2, k + 1, i):
tmp -= gcds[j]
ans = (ans + tmp * i) % m
gcds[i] = tmp
print(ans)
| false | 7.142857 | [
"-for i in range(k, 0, -1):",
"- tmp = k // i",
"- gcds[i] = pow(tmp, n, m)",
"- for j in range(tmp, 1, -1):",
"- gcds[i] -= gcds[j * i]",
"- ans = (ans + gcds[i] * i) % m",
"+ tmp = pow(k // i, n, m)",
"+ for j in range(i * 2, k + 1, i):",
"+ tmp -= gcds[j]",
"+ ans = (ans + tmp * i) % m",
"+ gcds[i] = tmp"
]
| false | 0.623361 | 0.288925 | 2.15752 | [
"s931917045",
"s192248325"
]
|
u970197315 | p03680 | python | s072454049 | s527473843 | 286 | 206 | 16,500 | 7,852 | Accepted | Accepted | 27.97 | # ABC065 B - Trained?
N = int(eval(input()))
A = [[int(eval(input())),False] for i in range(N)]
idx = 0
A[0][1] == True
cnt = 1
while cnt != N+1:
if A[idx][1]:
print((-1))
exit()
if A[idx][0] == 2:
print(cnt)
exit()
A[idx][1] = True
idx = A[idx][0]-1
cnt += 1
| n=int(eval(input()))
a=[int(eval(input())) for i in range(n)]
btn=[0]*n
ans=1
i=0
while True:
if btn[i]==1:
print((-1))
exit()
if a[i]==2:
print(ans)
exit()
btn[i]=1
i=a[i]-1
ans+=1
| 17 | 15 | 315 | 208 | # ABC065 B - Trained?
N = int(eval(input()))
A = [[int(eval(input())), False] for i in range(N)]
idx = 0
A[0][1] == True
cnt = 1
while cnt != N + 1:
if A[idx][1]:
print((-1))
exit()
if A[idx][0] == 2:
print(cnt)
exit()
A[idx][1] = True
idx = A[idx][0] - 1
cnt += 1
| n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
btn = [0] * n
ans = 1
i = 0
while True:
if btn[i] == 1:
print((-1))
exit()
if a[i] == 2:
print(ans)
exit()
btn[i] = 1
i = a[i] - 1
ans += 1
| false | 11.764706 | [
"-# ABC065 B - Trained?",
"-N = int(eval(input()))",
"-A = [[int(eval(input())), False] for i in range(N)]",
"-idx = 0",
"-A[0][1] == True",
"-cnt = 1",
"-while cnt != N + 1:",
"- if A[idx][1]:",
"+n = int(eval(input()))",
"+a = [int(eval(input())) for i in range(n)]",
"+btn = [0] * n",
"+ans = 1",
"+i = 0",
"+while True:",
"+ if btn[i] == 1:",
"- if A[idx][0] == 2:",
"- print(cnt)",
"+ if a[i] == 2:",
"+ print(ans)",
"- A[idx][1] = True",
"- idx = A[idx][0] - 1",
"- cnt += 1",
"+ btn[i] = 1",
"+ i = a[i] - 1",
"+ ans += 1"
]
| false | 0.036839 | 0.040911 | 0.900474 | [
"s072454049",
"s527473843"
]
|
u280978334 | p03309 | python | s818180320 | s891429191 | 205 | 185 | 25,196 | 27,412 | Accepted | Accepted | 9.76 | N = int(eval(input()))
A = [int(x)-i for x,i in zip(input().split(),list(range(1,N+1)))]
from math import ceil,floor
A.sort()
if N%2 == 0:
b = round((A[floor(N/2)]+A[ceil(N/2)])/2)
else:
b = A[floor(N/2)]
ans = 0
for a in A:
ans += abs(a-b)
print(ans) | def main():
N = int(eval(input()))
A = list(map(int,input().split()))
B = [A[i-1] - i for i in range(1,N+1)]
B.sort()
b = B[N // 2] if N%2 == 1 else round((B[N // 2 - 1] + B[N // 2]) / 2)
print((sum([abs(bb -b) for bb in B])))
return
if __name__ == "__main__":
main() | 15 | 11 | 272 | 302 | N = int(eval(input()))
A = [int(x) - i for x, i in zip(input().split(), list(range(1, N + 1)))]
from math import ceil, floor
A.sort()
if N % 2 == 0:
b = round((A[floor(N / 2)] + A[ceil(N / 2)]) / 2)
else:
b = A[floor(N / 2)]
ans = 0
for a in A:
ans += abs(a - b)
print(ans)
| def main():
N = int(eval(input()))
A = list(map(int, input().split()))
B = [A[i - 1] - i for i in range(1, N + 1)]
B.sort()
b = B[N // 2] if N % 2 == 1 else round((B[N // 2 - 1] + B[N // 2]) / 2)
print((sum([abs(bb - b) for bb in B])))
return
if __name__ == "__main__":
main()
| false | 26.666667 | [
"-N = int(eval(input()))",
"-A = [int(x) - i for x, i in zip(input().split(), list(range(1, N + 1)))]",
"-from math import ceil, floor",
"+def main():",
"+ N = int(eval(input()))",
"+ A = list(map(int, input().split()))",
"+ B = [A[i - 1] - i for i in range(1, N + 1)]",
"+ B.sort()",
"+ b = B[N // 2] if N % 2 == 1 else round((B[N // 2 - 1] + B[N // 2]) / 2)",
"+ print((sum([abs(bb - b) for bb in B])))",
"+ return",
"-A.sort()",
"-if N % 2 == 0:",
"- b = round((A[floor(N / 2)] + A[ceil(N / 2)]) / 2)",
"-else:",
"- b = A[floor(N / 2)]",
"-ans = 0",
"-for a in A:",
"- ans += abs(a - b)",
"-print(ans)",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.049055 | 0.088264 | 0.555769 | [
"s818180320",
"s891429191"
]
|
u886747123 | p03354 | python | s167451187 | s123649924 | 1,068 | 618 | 110,060 | 34,472 | Accepted | Accepted | 42.13 | # D - Equals
from collections import deque
N, M = list(map(int, input().split()))
p = list(map(int, input().split()))
xy = [list(map(int, input().split())) for _ in range(M)]
neighbor = [[] for _ in range(N)]
for idx in range(M):
neighbor[xy[idx][0]-1].append(xy[idx][1]-1)
neighbor[xy[idx][1]-1].append(xy[idx][0]-1)
can_swap = []
visited = [-1]*N
for start in range(N):
if visited[start] == -1:
tmp = [start] # startから到達可能なpointのリスト
d = deque([start])
while d:
current_point = d.pop()
visited[current_point] = 1
for next_point in neighbor[current_point]:
if visited[next_point] == -1:
d.append(next_point)
tmp.append(next_point)
can_swap.append(tmp)
ans = 0
for idx_group in can_swap:
tmp_p = [p[idx]-1 for idx in idx_group]
ans += len(set(tmp_p) & set(idx_group))
print(ans) | # D - Equals Union Find
N, M = list(map(int, input().split()))
p = list(map(int, input().split()))
xy = [list(map(int, input().split())) for _ in range(M)]
# 負ならそのノードが根かつ絶対値が木の要素数を示す、正なら値のノードが根であることを示す
root = [-1] * N
# 木の高さを示す
rank = [1] * N
# インデックスxを与えると、xの根を返す関数
def find_root(x):
if root[x] < 0:
return x
else:
root[x] = find_root(root[x])
return root[x]
# インデックスx,yを与えると、xとyの木を統合する関数
def union(x,y):
# root_x, root_yは根のインデックス
root_x = find_root(x)
root_y = find_root(y)
if root_x == root_y:
return
elif rank[root_x] > rank[root_y]: # 短い木(yの方)を長い木(xの方)に繋ぐ
root[root_x] += root[root_y] # 要素数結合
root[root_y] = root_x # 根を切り替え
else:
root[root_y] += root[root_x]
root[root_x] = root_y
if rank[root_x] == rank[root_y]:
rank[root_y] += 1 # 新しい木の高さを1追加
for idx in range(M):
union(xy[idx][0]-1, xy[idx][1]-1)
ans = 0
for i in range(N):
if find_root(i) == find_root(p[i]-1):
ans += 1
print(ans) | 35 | 46 | 976 | 1,107 | # D - Equals
from collections import deque
N, M = list(map(int, input().split()))
p = list(map(int, input().split()))
xy = [list(map(int, input().split())) for _ in range(M)]
neighbor = [[] for _ in range(N)]
for idx in range(M):
neighbor[xy[idx][0] - 1].append(xy[idx][1] - 1)
neighbor[xy[idx][1] - 1].append(xy[idx][0] - 1)
can_swap = []
visited = [-1] * N
for start in range(N):
if visited[start] == -1:
tmp = [start] # startから到達可能なpointのリスト
d = deque([start])
while d:
current_point = d.pop()
visited[current_point] = 1
for next_point in neighbor[current_point]:
if visited[next_point] == -1:
d.append(next_point)
tmp.append(next_point)
can_swap.append(tmp)
ans = 0
for idx_group in can_swap:
tmp_p = [p[idx] - 1 for idx in idx_group]
ans += len(set(tmp_p) & set(idx_group))
print(ans)
| # D - Equals Union Find
N, M = list(map(int, input().split()))
p = list(map(int, input().split()))
xy = [list(map(int, input().split())) for _ in range(M)]
# 負ならそのノードが根かつ絶対値が木の要素数を示す、正なら値のノードが根であることを示す
root = [-1] * N
# 木の高さを示す
rank = [1] * N
# インデックスxを与えると、xの根を返す関数
def find_root(x):
if root[x] < 0:
return x
else:
root[x] = find_root(root[x])
return root[x]
# インデックスx,yを与えると、xとyの木を統合する関数
def union(x, y):
# root_x, root_yは根のインデックス
root_x = find_root(x)
root_y = find_root(y)
if root_x == root_y:
return
elif rank[root_x] > rank[root_y]: # 短い木(yの方)を長い木(xの方)に繋ぐ
root[root_x] += root[root_y] # 要素数結合
root[root_y] = root_x # 根を切り替え
else:
root[root_y] += root[root_x]
root[root_x] = root_y
if rank[root_x] == rank[root_y]:
rank[root_y] += 1 # 新しい木の高さを1追加
for idx in range(M):
union(xy[idx][0] - 1, xy[idx][1] - 1)
ans = 0
for i in range(N):
if find_root(i) == find_root(p[i] - 1):
ans += 1
print(ans)
| false | 23.913043 | [
"-# D - Equals",
"-from collections import deque",
"-",
"+# D - Equals Union Find",
"-neighbor = [[] for _ in range(N)]",
"+# 負ならそのノードが根かつ絶対値が木の要素数を示す、正なら値のノードが根であることを示す",
"+root = [-1] * N",
"+# 木の高さを示す",
"+rank = [1] * N",
"+# インデックスxを与えると、xの根を返す関数",
"+def find_root(x):",
"+ if root[x] < 0:",
"+ return x",
"+ else:",
"+ root[x] = find_root(root[x])",
"+ return root[x]",
"+",
"+",
"+# インデックスx,yを与えると、xとyの木を統合する関数",
"+def union(x, y):",
"+ # root_x, root_yは根のインデックス",
"+ root_x = find_root(x)",
"+ root_y = find_root(y)",
"+ if root_x == root_y:",
"+ return",
"+ elif rank[root_x] > rank[root_y]: # 短い木(yの方)を長い木(xの方)に繋ぐ",
"+ root[root_x] += root[root_y] # 要素数結合",
"+ root[root_y] = root_x # 根を切り替え",
"+ else:",
"+ root[root_y] += root[root_x]",
"+ root[root_x] = root_y",
"+ if rank[root_x] == rank[root_y]:",
"+ rank[root_y] += 1 # 新しい木の高さを1追加",
"+",
"+",
"- neighbor[xy[idx][0] - 1].append(xy[idx][1] - 1)",
"- neighbor[xy[idx][1] - 1].append(xy[idx][0] - 1)",
"-can_swap = []",
"-visited = [-1] * N",
"-for start in range(N):",
"- if visited[start] == -1:",
"- tmp = [start] # startから到達可能なpointのリスト",
"- d = deque([start])",
"- while d:",
"- current_point = d.pop()",
"- visited[current_point] = 1",
"- for next_point in neighbor[current_point]:",
"- if visited[next_point] == -1:",
"- d.append(next_point)",
"- tmp.append(next_point)",
"- can_swap.append(tmp)",
"+ union(xy[idx][0] - 1, xy[idx][1] - 1)",
"-for idx_group in can_swap:",
"- tmp_p = [p[idx] - 1 for idx in idx_group]",
"- ans += len(set(tmp_p) & set(idx_group))",
"+for i in range(N):",
"+ if find_root(i) == find_root(p[i] - 1):",
"+ ans += 1"
]
| false | 0.00747 | 0.042712 | 0.174898 | [
"s167451187",
"s123649924"
]
|
u729133443 | p03607 | python | s988983448 | s980877666 | 504 | 57 | 62,296 | 16,400 | Accepted | Accepted | 88.69 | d={}
for _ in[0]*int(eval(input())):
i=eval(input())
d[i]=d.get(i,0)^1
print((sum(d.values()))) | _,a,*s=open(0)
a={a}
for i in s:a^={i}
print((len(a))) | 5 | 4 | 87 | 55 | d = {}
for _ in [0] * int(eval(input())):
i = eval(input())
d[i] = d.get(i, 0) ^ 1
print((sum(d.values())))
| _, a, *s = open(0)
a = {a}
for i in s:
a ^= {i}
print((len(a)))
| false | 20 | [
"-d = {}",
"-for _ in [0] * int(eval(input())):",
"- i = eval(input())",
"- d[i] = d.get(i, 0) ^ 1",
"-print((sum(d.values())))",
"+_, a, *s = open(0)",
"+a = {a}",
"+for i in s:",
"+ a ^= {i}",
"+print((len(a)))"
]
| false | 0.035623 | 0.035651 | 0.999205 | [
"s988983448",
"s980877666"
]
|
u150984829 | p00424 | python | s926065671 | s311164634 | 850 | 300 | 6,472 | 6,484 | Accepted | Accepted | 64.71 | while 1:
n=int(input())
if n==0:break
d={}
for _ in[0]*n:
k,v=input().strip().split()
d[k]=v
for _ in[0]*int(input()):
e=input().strip()
print(d[e]if e in d else e,end='')
print()
| while 1:
n=int(eval(input()))
if n==0:break
d={}
for _ in[0]*n:
k,v=input().strip().split()
d[k]=v
a=''
for _ in[0]*int(eval(input())):
e=input().strip()
a+=d[e]if e in d else e
print(a)
| 11 | 12 | 204 | 201 | while 1:
n = int(input())
if n == 0:
break
d = {}
for _ in [0] * n:
k, v = input().strip().split()
d[k] = v
for _ in [0] * int(input()):
e = input().strip()
print(d[e] if e in d else e, end="")
print()
| while 1:
n = int(eval(input()))
if n == 0:
break
d = {}
for _ in [0] * n:
k, v = input().strip().split()
d[k] = v
a = ""
for _ in [0] * int(eval(input())):
e = input().strip()
a += d[e] if e in d else e
print(a)
| false | 8.333333 | [
"- n = int(input())",
"+ n = int(eval(input()))",
"- for _ in [0] * int(input()):",
"+ a = \"\"",
"+ for _ in [0] * int(eval(input())):",
"- print(d[e] if e in d else e, end=\"\")",
"- print()",
"+ a += d[e] if e in d else e",
"+ print(a)"
]
| false | 0.032808 | 0.036884 | 0.889497 | [
"s926065671",
"s311164634"
]
|
u497952650 | p03599 | python | s305348285 | s135512807 | 355 | 23 | 7,256 | 3,188 | Accepted | Accepted | 93.52 | A,B,C,D,E,F = list(map(int,input().split()))
MAX_SUGER = E*F/(E+100)
water = [min(A,B)*100,max(A,B)*100]
for i in range(1,300):
for j in range(1,300):
water.append(100*A*i+100*B*j)
water = sorted(list(set(water)))
suger = []
for i in range(1000):
for j in range(1000):
if C*i + D*j <= MAX_SUGER:
suger.append(C*i+D*j)
suger = sorted(list(set(suger)))
ans = []
for s in suger:
min_water = 100*s/E
for w in water:
if w >= min_water:
ans.append([s/(w+s),w+s,s])
break
ans.sort(reverse=True)
for c,w,s in ans:
if w <= F:
print((w,s))
break | A,B,C,D,E,F = list(map(int,input().split()))
MAX_SUGER = E*F/(E+100)
water = [min(A,B)*100,max(A,B)*100]
for i in range(1,31):
for j in range(1,31):
water.append(100*A*i+100*B*j)
water = sorted(list(set(water)))
suger = []
for i in range(101):
for j in range(101):
if C*i + D*j <= MAX_SUGER:
suger.append(C*i+D*j)
suger = sorted(list(set(suger)))
ans = []
for s in suger:
min_water = 100*s/E
for w in water:
if w >= min_water:
ans.append([s/(w+s),w+s,s])
break
ans.sort(reverse=True)
for c,w,s in ans:
if w <= F:
print((w,s))
break
| 30 | 31 | 657 | 656 | A, B, C, D, E, F = list(map(int, input().split()))
MAX_SUGER = E * F / (E + 100)
water = [min(A, B) * 100, max(A, B) * 100]
for i in range(1, 300):
for j in range(1, 300):
water.append(100 * A * i + 100 * B * j)
water = sorted(list(set(water)))
suger = []
for i in range(1000):
for j in range(1000):
if C * i + D * j <= MAX_SUGER:
suger.append(C * i + D * j)
suger = sorted(list(set(suger)))
ans = []
for s in suger:
min_water = 100 * s / E
for w in water:
if w >= min_water:
ans.append([s / (w + s), w + s, s])
break
ans.sort(reverse=True)
for c, w, s in ans:
if w <= F:
print((w, s))
break
| A, B, C, D, E, F = list(map(int, input().split()))
MAX_SUGER = E * F / (E + 100)
water = [min(A, B) * 100, max(A, B) * 100]
for i in range(1, 31):
for j in range(1, 31):
water.append(100 * A * i + 100 * B * j)
water = sorted(list(set(water)))
suger = []
for i in range(101):
for j in range(101):
if C * i + D * j <= MAX_SUGER:
suger.append(C * i + D * j)
suger = sorted(list(set(suger)))
ans = []
for s in suger:
min_water = 100 * s / E
for w in water:
if w >= min_water:
ans.append([s / (w + s), w + s, s])
break
ans.sort(reverse=True)
for c, w, s in ans:
if w <= F:
print((w, s))
break
| false | 3.225806 | [
"-for i in range(1, 300):",
"- for j in range(1, 300):",
"+for i in range(1, 31):",
"+ for j in range(1, 31):",
"-for i in range(1000):",
"- for j in range(1000):",
"+for i in range(101):",
"+ for j in range(101):"
]
| false | 1.234327 | 0.039457 | 31.282666 | [
"s305348285",
"s135512807"
]
|
u340781749 | p02975 | python | s314164212 | s595298163 | 65 | 53 | 15,516 | 14,460 | Accepted | Accepted | 18.46 | from collections import Counter
def solve(n, aaa):
if all(a == 0 for a in aaa):
return True
if n % 3 != 0:
return False
cnt = list(Counter(aaa).items())
if len(cnt) == 2:
(a1, c1), (a2, c2) = cnt
if c1 > c2:
c1, c2 = c2, c1
if c1 != n // 3 or c2 != n * 2 // 3:
return False
return a1 == 0
if len(cnt) == 3:
if any(c[1] != n // 3 for c in cnt):
return False
a1, a2, a3 = (c[0] for c in cnt)
return a1 ^ a2 == a3
return False
n = int(eval(input()))
aaa = list(map(int, input().split()))
print(('Yes' if solve(n, aaa) else 'No'))
| from collections import Counter
def solve(n, aaa):
if all(a == 0 for a in aaa):
return True
if n % 3 != 0:
return False
cnt = Counter(aaa)
if len(cnt) == 2:
(a1, c1), (a2, c2) = cnt.most_common()
if c1 != n * 2 // 3 or c2 != n // 3:
return False
return a2 == 0
if len(cnt) == 3:
if any(c != n // 3 for c in list(cnt.values())):
return False
a1, a2, a3 = list(cnt.keys())
return a1 ^ a2 == a3
return False
n = int(eval(input()))
aaa = list(map(int, input().split()))
print(('Yes' if solve(n, aaa) else 'No'))
| 31 | 29 | 689 | 636 | from collections import Counter
def solve(n, aaa):
if all(a == 0 for a in aaa):
return True
if n % 3 != 0:
return False
cnt = list(Counter(aaa).items())
if len(cnt) == 2:
(a1, c1), (a2, c2) = cnt
if c1 > c2:
c1, c2 = c2, c1
if c1 != n // 3 or c2 != n * 2 // 3:
return False
return a1 == 0
if len(cnt) == 3:
if any(c[1] != n // 3 for c in cnt):
return False
a1, a2, a3 = (c[0] for c in cnt)
return a1 ^ a2 == a3
return False
n = int(eval(input()))
aaa = list(map(int, input().split()))
print(("Yes" if solve(n, aaa) else "No"))
| from collections import Counter
def solve(n, aaa):
if all(a == 0 for a in aaa):
return True
if n % 3 != 0:
return False
cnt = Counter(aaa)
if len(cnt) == 2:
(a1, c1), (a2, c2) = cnt.most_common()
if c1 != n * 2 // 3 or c2 != n // 3:
return False
return a2 == 0
if len(cnt) == 3:
if any(c != n // 3 for c in list(cnt.values())):
return False
a1, a2, a3 = list(cnt.keys())
return a1 ^ a2 == a3
return False
n = int(eval(input()))
aaa = list(map(int, input().split()))
print(("Yes" if solve(n, aaa) else "No"))
| false | 6.451613 | [
"- cnt = list(Counter(aaa).items())",
"+ cnt = Counter(aaa)",
"- (a1, c1), (a2, c2) = cnt",
"- if c1 > c2:",
"- c1, c2 = c2, c1",
"- if c1 != n // 3 or c2 != n * 2 // 3:",
"+ (a1, c1), (a2, c2) = cnt.most_common()",
"+ if c1 != n * 2 // 3 or c2 != n // 3:",
"- return a1 == 0",
"+ return a2 == 0",
"- if any(c[1] != n // 3 for c in cnt):",
"+ if any(c != n // 3 for c in list(cnt.values())):",
"- a1, a2, a3 = (c[0] for c in cnt)",
"+ a1, a2, a3 = list(cnt.keys())"
]
| false | 0.118036 | 0.154801 | 0.7625 | [
"s314164212",
"s595298163"
]
|
u723583932 | p02712 | python | s736203423 | s094574870 | 197 | 104 | 9,100 | 9,064 | Accepted | Accepted | 47.21 | n=int(eval(input()))
ans=0
def fb(num):
if num%3==0 or num%5==0:
return False
else:
return True
for i in range(1,n+1):
if fb(i):
ans+=i
print(ans)
| n=int(eval(input()))
def func():
s=0
for i in range(1,n+1):
if not(i%3==0 or i%5==0):
s+=i
else:
continue
return s
print((func()))
| 12 | 10 | 190 | 185 | n = int(eval(input()))
ans = 0
def fb(num):
if num % 3 == 0 or num % 5 == 0:
return False
else:
return True
for i in range(1, n + 1):
if fb(i):
ans += i
print(ans)
| n = int(eval(input()))
def func():
s = 0
for i in range(1, n + 1):
if not (i % 3 == 0 or i % 5 == 0):
s += i
else:
continue
return s
print((func()))
| false | 16.666667 | [
"-ans = 0",
"-def fb(num):",
"- if num % 3 == 0 or num % 5 == 0:",
"- return False",
"- else:",
"- return True",
"+def func():",
"+ s = 0",
"+ for i in range(1, n + 1):",
"+ if not (i % 3 == 0 or i % 5 == 0):",
"+ s += i",
"+ else:",
"+ continue",
"+ return s",
"-for i in range(1, n + 1):",
"- if fb(i):",
"- ans += i",
"-print(ans)",
"+print((func()))"
]
| false | 0.368778 | 0.096137 | 3.835977 | [
"s736203423",
"s094574870"
]
|
u287132915 | p02781 | python | s330923833 | s209164017 | 40 | 22 | 3,440 | 3,064 | Accepted | Accepted | 45 | n = eval(input())
k = int(eval(input()))
keta = len(n)
# dp0 = ヨユーなやつ, dp1 = ギリなやつ
dp0 = [[0 for j in range(keta+1)] for i in range(keta+1)]
dp1 = [[0 for j in range(keta+1)] for i in range(keta+1)]
dp1[0][0] = 1
for i in range(keta):
for j in range(keta+1):
# ギリギリのやつ(dp1)の処理
if n[i] == '0': # i+1桁目が0の場合
dp1[i+1][j] = dp1[i][j] # 真上からスライド
else: # i+1桁目が1~9の場合
if j < keta:
dp1[i+1][j+1] = dp1[i][j] # 左上からスライド
# ヨユーなやつ(dp0)の処理
if n[i] == '0': # i+1桁目が0の場合
# i桁目がヨユーな状態ではi+1桁目には何でも入れられる
dp0[i+1][j] += dp0[i][j] # i+1桁目に0を入れた場合
if j < keta:
dp0[i+1][j+1] += dp0[i][j] * 9 # i+1桁目に1~9を入れた場合
# i桁目までギリだったときの、i+1桁目のヨユーなやつのカウント
# 何もない(ギリである0しか入れられないため)
else: # i+1桁目が1~9の場合
# i桁目がヨユーな状態ではi+1桁目には何でも入れられる
dp0[i+1][j] += dp0[i][j] # i+1桁目に0を入れた場合
if j < keta:
dp0[i+1][j+1] += dp0[i][j] * 9 # i+1桁目に1~9を入れた場合
# i桁目までギリだったときの、i+1桁目のヨユーなやつのカウント
dp0[i+1][j] += dp1[i][j] # i+1桁目に0を入れた場合
if j < keta:
dp0[i+1][j+1] += dp1[i][j] * (ord(n[i])-ord('0')-1) # i+1桁目にrange(1, n[i])を入れた場合
if k > keta:
print((0))
else:
print((dp0[keta][k] + dp1[keta][k])) | n = eval(input())
km = int(eval(input()))
dp1 = [[0] * (4) for _ in range(len(n) + 1)]
dp2 = [[0] * (4) for _ in range(len(n) + 1)]
dp1[0][0] = 1
for i in range(len(n)):
for j in range(4):
# i+1桁目に0が入る場合
if n[i] == '0':
dp1[i + 1][j] += dp1[i][j]
dp2[i + 1][j] += dp2[i][j]
else:
dp2[i + 1][j] += dp1[i][j]
dp2[i + 1][j] += dp2[i][j]
if j < 3:
for k in range(1, ord(n[i]) - ord('0')):
dp2[i + 1][j + 1] += dp1[i][j]
if n[i] != '0':
dp1[i + 1][j + 1] += dp1[i][j]
for k in range(1, 10):
dp2[i + 1][j + 1] += dp2[i][j]
print((dp1[len(n)][km] + dp2[len(n)][km])) | 42 | 22 | 1,362 | 734 | n = eval(input())
k = int(eval(input()))
keta = len(n)
# dp0 = ヨユーなやつ, dp1 = ギリなやつ
dp0 = [[0 for j in range(keta + 1)] for i in range(keta + 1)]
dp1 = [[0 for j in range(keta + 1)] for i in range(keta + 1)]
dp1[0][0] = 1
for i in range(keta):
for j in range(keta + 1):
# ギリギリのやつ(dp1)の処理
if n[i] == "0": # i+1桁目が0の場合
dp1[i + 1][j] = dp1[i][j] # 真上からスライド
else: # i+1桁目が1~9の場合
if j < keta:
dp1[i + 1][j + 1] = dp1[i][j] # 左上からスライド
# ヨユーなやつ(dp0)の処理
if n[i] == "0": # i+1桁目が0の場合
# i桁目がヨユーな状態ではi+1桁目には何でも入れられる
dp0[i + 1][j] += dp0[i][j] # i+1桁目に0を入れた場合
if j < keta:
dp0[i + 1][j + 1] += dp0[i][j] * 9 # i+1桁目に1~9を入れた場合
# i桁目までギリだったときの、i+1桁目のヨユーなやつのカウント
# 何もない(ギリである0しか入れられないため)
else: # i+1桁目が1~9の場合
# i桁目がヨユーな状態ではi+1桁目には何でも入れられる
dp0[i + 1][j] += dp0[i][j] # i+1桁目に0を入れた場合
if j < keta:
dp0[i + 1][j + 1] += dp0[i][j] * 9 # i+1桁目に1~9を入れた場合
# i桁目までギリだったときの、i+1桁目のヨユーなやつのカウント
dp0[i + 1][j] += dp1[i][j] # i+1桁目に0を入れた場合
if j < keta:
dp0[i + 1][j + 1] += dp1[i][j] * (
ord(n[i]) - ord("0") - 1
) # i+1桁目にrange(1, n[i])を入れた場合
if k > keta:
print((0))
else:
print((dp0[keta][k] + dp1[keta][k]))
| n = eval(input())
km = int(eval(input()))
dp1 = [[0] * (4) for _ in range(len(n) + 1)]
dp2 = [[0] * (4) for _ in range(len(n) + 1)]
dp1[0][0] = 1
for i in range(len(n)):
for j in range(4):
# i+1桁目に0が入る場合
if n[i] == "0":
dp1[i + 1][j] += dp1[i][j]
dp2[i + 1][j] += dp2[i][j]
else:
dp2[i + 1][j] += dp1[i][j]
dp2[i + 1][j] += dp2[i][j]
if j < 3:
for k in range(1, ord(n[i]) - ord("0")):
dp2[i + 1][j + 1] += dp1[i][j]
if n[i] != "0":
dp1[i + 1][j + 1] += dp1[i][j]
for k in range(1, 10):
dp2[i + 1][j + 1] += dp2[i][j]
print((dp1[len(n)][km] + dp2[len(n)][km]))
| false | 47.619048 | [
"-k = int(eval(input()))",
"-keta = len(n)",
"-# dp0 = ヨユーなやつ, dp1 = ギリなやつ",
"-dp0 = [[0 for j in range(keta + 1)] for i in range(keta + 1)]",
"-dp1 = [[0 for j in range(keta + 1)] for i in range(keta + 1)]",
"+km = int(eval(input()))",
"+dp1 = [[0] * (4) for _ in range(len(n) + 1)]",
"+dp2 = [[0] * (4) for _ in range(len(n) + 1)]",
"-for i in range(keta):",
"- for j in range(keta + 1):",
"- # ギリギリのやつ(dp1)の処理",
"- if n[i] == \"0\": # i+1桁目が0の場合",
"- dp1[i + 1][j] = dp1[i][j] # 真上からスライド",
"- else: # i+1桁目が1~9の場合",
"- if j < keta:",
"- dp1[i + 1][j + 1] = dp1[i][j] # 左上からスライド",
"- # ヨユーなやつ(dp0)の処理",
"- if n[i] == \"0\": # i+1桁目が0の場合",
"- # i桁目がヨユーな状態ではi+1桁目には何でも入れられる",
"- dp0[i + 1][j] += dp0[i][j] # i+1桁目に0を入れた場合",
"- if j < keta:",
"- dp0[i + 1][j + 1] += dp0[i][j] * 9 # i+1桁目に1~9を入れた場合",
"- # i桁目までギリだったときの、i+1桁目のヨユーなやつのカウント",
"- # 何もない(ギリである0しか入れられないため)",
"- else: # i+1桁目が1~9の場合",
"- # i桁目がヨユーな状態ではi+1桁目には何でも入れられる",
"- dp0[i + 1][j] += dp0[i][j] # i+1桁目に0を入れた場合",
"- if j < keta:",
"- dp0[i + 1][j + 1] += dp0[i][j] * 9 # i+1桁目に1~9を入れた場合",
"- # i桁目までギリだったときの、i+1桁目のヨユーなやつのカウント",
"- dp0[i + 1][j] += dp1[i][j] # i+1桁目に0を入れた場合",
"- if j < keta:",
"- dp0[i + 1][j + 1] += dp1[i][j] * (",
"- ord(n[i]) - ord(\"0\") - 1",
"- ) # i+1桁目にrange(1, n[i])を入れた場合",
"-if k > keta:",
"- print((0))",
"-else:",
"- print((dp0[keta][k] + dp1[keta][k]))",
"+for i in range(len(n)):",
"+ for j in range(4):",
"+ # i+1桁目に0が入る場合",
"+ if n[i] == \"0\":",
"+ dp1[i + 1][j] += dp1[i][j]",
"+ dp2[i + 1][j] += dp2[i][j]",
"+ else:",
"+ dp2[i + 1][j] += dp1[i][j]",
"+ dp2[i + 1][j] += dp2[i][j]",
"+ if j < 3:",
"+ for k in range(1, ord(n[i]) - ord(\"0\")):",
"+ dp2[i + 1][j + 1] += dp1[i][j]",
"+ if n[i] != \"0\":",
"+ dp1[i + 1][j + 1] += dp1[i][j]",
"+ for k in range(1, 10):",
"+ dp2[i + 1][j + 1] += dp2[i][j]",
"+print((dp1[len(n)][km] + dp2[len(n)][km]))"
]
| false | 0.036889 | 0.037272 | 0.989716 | [
"s330923833",
"s209164017"
]
|
u899975427 | p03231 | python | s960302419 | s145267837 | 35 | 17 | 5,432 | 3,316 | Accepted | Accepted | 51.43 | import fractions
n,m = list(map(int,input().split()))
gcd = int(fractions.gcd(n,m))
lcm = n * m // gcd
s = eval(input())
t = eval(input())
if gcd == 1:
if s[0] == t[0]:
print(lcm)
else:
print((-1))
else:
if s[::n//gcd] == t[::m//gcd]:
print(lcm)
else:
print((-1)) | n,m = list(map(int,input().split()))
def gcd(a, b):
a, b = (a, b) if a >= b else (b, a)
while b > 0:
a, b = b, a % b
return a
gc = gcd(n,m)
lcm = n * m // gc
s = eval(input())
t = eval(input())
if s[::n//gc] == t[::m//gc]:
print(lcm)
else:
print((-1)) | 17 | 17 | 287 | 264 | import fractions
n, m = list(map(int, input().split()))
gcd = int(fractions.gcd(n, m))
lcm = n * m // gcd
s = eval(input())
t = eval(input())
if gcd == 1:
if s[0] == t[0]:
print(lcm)
else:
print((-1))
else:
if s[:: n // gcd] == t[:: m // gcd]:
print(lcm)
else:
print((-1))
| n, m = list(map(int, input().split()))
def gcd(a, b):
a, b = (a, b) if a >= b else (b, a)
while b > 0:
a, b = b, a % b
return a
gc = gcd(n, m)
lcm = n * m // gc
s = eval(input())
t = eval(input())
if s[:: n // gc] == t[:: m // gc]:
print(lcm)
else:
print((-1))
| false | 0 | [
"-import fractions",
"+n, m = list(map(int, input().split()))",
"-n, m = list(map(int, input().split()))",
"-gcd = int(fractions.gcd(n, m))",
"-lcm = n * m // gcd",
"+",
"+def gcd(a, b):",
"+ a, b = (a, b) if a >= b else (b, a)",
"+ while b > 0:",
"+ a, b = b, a % b",
"+ return a",
"+",
"+",
"+gc = gcd(n, m)",
"+lcm = n * m // gc",
"-if gcd == 1:",
"- if s[0] == t[0]:",
"- print(lcm)",
"- else:",
"- print((-1))",
"+if s[:: n // gc] == t[:: m // gc]:",
"+ print(lcm)",
"- if s[:: n // gcd] == t[:: m // gcd]:",
"- print(lcm)",
"- else:",
"- print((-1))",
"+ print((-1))"
]
| false | 0.062153 | 0.059874 | 1.03806 | [
"s960302419",
"s145267837"
]
|
u254871849 | p02888 | python | s266362423 | s516513459 | 1,374 | 869 | 3,316 | 3,188 | Accepted | Accepted | 36.75 | import bisect
n = int(eval(input()))
ls = list(map(int, input().split()))
ls.sort()
count = 0
for i in range(n - 2):
a = ls[i]
for j in range(i + 1, n - 1):
b = ls[j]
index = bisect.bisect_left(ls, a + b)
count += index - j - 1
print(count)
| # 2019-11-18 23:58:23(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# import re
# import heapq
# import array
# from scipy.misc import comb # (default: exact=False)
# import numpy as np
def main():
n, *l = [int(x) for x in sys.stdin.read().split()]
l.sort()
count = 0
for i in range(n-2):
a = l[i]
for j in range(i+1, n-1):
b = l[j]
count += (bi_l(l, a + b) - 1) - j
print(count)
if __name__ == "__main__":
main()
| 15 | 30 | 268 | 718 | import bisect
n = int(eval(input()))
ls = list(map(int, input().split()))
ls.sort()
count = 0
for i in range(n - 2):
a = ls[i]
for j in range(i + 1, n - 1):
b = ls[j]
index = bisect.bisect_left(ls, a + b)
count += index - j - 1
print(count)
| # 2019-11-18 23:58:23(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# import re
# import heapq
# import array
# from scipy.misc import comb # (default: exact=False)
# import numpy as np
def main():
n, *l = [int(x) for x in sys.stdin.read().split()]
l.sort()
count = 0
for i in range(n - 2):
a = l[i]
for j in range(i + 1, n - 1):
b = l[j]
count += (bi_l(l, a + b) - 1) - j
print(count)
if __name__ == "__main__":
main()
| false | 50 | [
"-import bisect",
"+# 2019-11-18 23:58:23(JST)",
"+import sys",
"-n = int(eval(input()))",
"-ls = list(map(int, input().split()))",
"-ls.sort()",
"-count = 0",
"-for i in range(n - 2):",
"- a = ls[i]",
"- for j in range(i + 1, n - 1):",
"- b = ls[j]",
"- index = bisect.bisect_left(ls, a + b)",
"- count += index - j - 1",
"-print(count)",
"+# import collections",
"+# import math",
"+# from string import ascii_lowercase, ascii_uppercase, digits",
"+from bisect import bisect_left as bi_l, bisect_right as bi_r",
"+",
"+# import itertools",
"+# from functools import reduce",
"+# import operator as op",
"+# import re",
"+# import heapq",
"+# import array",
"+# from scipy.misc import comb # (default: exact=False)",
"+# import numpy as np",
"+def main():",
"+ n, *l = [int(x) for x in sys.stdin.read().split()]",
"+ l.sort()",
"+ count = 0",
"+ for i in range(n - 2):",
"+ a = l[i]",
"+ for j in range(i + 1, n - 1):",
"+ b = l[j]",
"+ count += (bi_l(l, a + b) - 1) - j",
"+ print(count)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.078507 | 0.037362 | 2.101232 | [
"s266362423",
"s516513459"
]
|
u645250356 | p03062 | python | s583101296 | s435572520 | 333 | 120 | 85,976 | 16,384 | Accepted | Accepted | 63.96 | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n = inp()
a = inpl()
mic = 0
for i in range(n):
if a[i]<0:
mic += 1
a[i] *= -1
if mic%2:
a.sort()
print((sum(a[1:])-a[0]))
else:
print((sum(a)))
| from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,copy
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n = inp()
a = inpl()
cnt = 0
for i in range(n):
if a[i] < 0:
cnt += 1
a = [abs(x) for x in a]
a.sort()
if cnt%2:
a[0] = -a[0]
print((sum(a))) | 22 | 20 | 513 | 486 | from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
import sys, bisect, math, itertools, fractions, pprint
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
INF = float("inf")
def inp():
return int(sys.stdin.readline())
def inpl():
return list(map(int, sys.stdin.readline().split()))
n = inp()
a = inpl()
mic = 0
for i in range(n):
if a[i] < 0:
mic += 1
a[i] *= -1
if mic % 2:
a.sort()
print((sum(a[1:]) - a[0]))
else:
print((sum(a)))
| from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
import sys, bisect, math, itertools, fractions, copy
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
INF = float("inf")
def inp():
return int(sys.stdin.readline())
def inpl():
return list(map(int, sys.stdin.readline().split()))
n = inp()
a = inpl()
cnt = 0
for i in range(n):
if a[i] < 0:
cnt += 1
a = [abs(x) for x in a]
a.sort()
if cnt % 2:
a[0] = -a[0]
print((sum(a)))
| false | 9.090909 | [
"-import sys, bisect, math, itertools, fractions, pprint",
"+import sys, bisect, math, itertools, fractions, copy",
"-mic = 0",
"+cnt = 0",
"- mic += 1",
"- a[i] *= -1",
"-if mic % 2:",
"- a.sort()",
"- print((sum(a[1:]) - a[0]))",
"-else:",
"- print((sum(a)))",
"+ cnt += 1",
"+a = [abs(x) for x in a]",
"+a.sort()",
"+if cnt % 2:",
"+ a[0] = -a[0]",
"+print((sum(a)))"
]
| false | 0.091222 | 0.03607 | 2.528996 | [
"s583101296",
"s435572520"
]
|
u562935282 | p03674 | python | s435017206 | s275980407 | 345 | 273 | 20,432 | 19,428 | Accepted | Accepted | 20.87 | # 解説を見た
class Calc:
def __init__(self, max_value, mod):
"""combination(max_value, all)"""
fact = [-1] * (max_value + 1)
fact[0] = 1
fact[1] = 1
for x in range(2, max_value + 1):
fact[x] = x * fact[x - 1] % mod
invs = [-1] * (max_value + 1)
invs[max_value] = pow(fact[max_value], mod - 2, mod)
for x in range(max_value - 1, 0, -1):
invs[x] = invs[x + 1] * (x + 1) % mod
# 逆元はこの求め方が速いらしい
self.fact = fact
self.invs = invs
self.mod = mod
def combination(self, n, r):
if n - r < r:
return self.combination(n, n - r)
if r < 0:
return 0
if r == 0:
return 1
if r == 1:
return n
return self.fact[n] * self.invs[r] * self.invs[n - r] % self.mod
def main():
MOD = 10 ** 9 + 7
N = int(eval(input()))
*A, = list(map(int, input().split()))
pos = [-1] * (N + 1)
indices = None
for i, a in enumerate(A):
if pos[a] == -1:
pos[a] = i
else:
indices = pos[a], i
break
width = indices[1] - indices[0] + 1
# 重複要素を両端に持つような区間の長さ
calc = Calc(max_value=N + 1, mod=MOD)
for k in range(1, N + 1 + 1):
res = (calc.combination(N + 1, k) - calc.combination(N + 1 - width, k - 1)) % MOD
print(res)
if __name__ == '__main__':
main()
# PxQxR
# PxRが重複
# 重複要素xの含まれる個数で場合分けをする
# xを含まない
# xを2個とも含む
# 一意
# xを1個含む場合でも、
# Qの要素を含む場合は、どっちのxを取ったか分かる
# Qの要素を含まないとき、どっちのxを取ったか分からない
# cmb(N+1,K)-cmb(PRの総和,K-1)
| def build_combination(n, mod):
def cmb(n, r):
if r < 0 or n < r:
return 0
return (((invs[r] * invs[n - r]) % mod) * fact[n]) % mod
fact = [1] * (n + 1)
for x in range(2, n + 1):
fact[x] = x * fact[x - 1] % mod
invs = [1] * (n + 1)
invs[n] = pow(fact[n], mod - 2, mod)
for x in range(n - 1, 0, -1):
invs[x] = invs[x + 1] * (x + 1) % mod
return cmb
def find(a):
"""重複する数値のindexのペアを返す"""
n = len(a)
checked = [-1] * (n + 1)
for i, x in enumerate(a):
if checked[x] != -1:
return checked[x], i
else:
checked[x] = i
raise ValueError
def main():
mod = 10 ** 9 + 7
n = int(eval(input()))
*a, = list(map(int, input().split()))
cmb = build_combination(n + 1, mod)
li, ri = find(a)
for k in range(1, n + 2):
ret = (cmb(n + 1, k) - cmb(n + 1 - (ri - li + 1), k - 1)) % mod # mod忘れ
print(ret)
# for j in range(k + 1):
# ret -= cmb(li, j) * cmb(n - ri, k - j - 1)
# PxQxRのPRからk-1個とる
# PRの取り方の総和を求めるより、区間PRに含まれる総個数からk-1個選ぶ方法を考える
if __name__ == '__main__':
main()
| 75 | 51 | 1,673 | 1,212 | # 解説を見た
class Calc:
def __init__(self, max_value, mod):
"""combination(max_value, all)"""
fact = [-1] * (max_value + 1)
fact[0] = 1
fact[1] = 1
for x in range(2, max_value + 1):
fact[x] = x * fact[x - 1] % mod
invs = [-1] * (max_value + 1)
invs[max_value] = pow(fact[max_value], mod - 2, mod)
for x in range(max_value - 1, 0, -1):
invs[x] = invs[x + 1] * (x + 1) % mod
# 逆元はこの求め方が速いらしい
self.fact = fact
self.invs = invs
self.mod = mod
def combination(self, n, r):
if n - r < r:
return self.combination(n, n - r)
if r < 0:
return 0
if r == 0:
return 1
if r == 1:
return n
return self.fact[n] * self.invs[r] * self.invs[n - r] % self.mod
def main():
MOD = 10**9 + 7
N = int(eval(input()))
(*A,) = list(map(int, input().split()))
pos = [-1] * (N + 1)
indices = None
for i, a in enumerate(A):
if pos[a] == -1:
pos[a] = i
else:
indices = pos[a], i
break
width = indices[1] - indices[0] + 1
# 重複要素を両端に持つような区間の長さ
calc = Calc(max_value=N + 1, mod=MOD)
for k in range(1, N + 1 + 1):
res = (
calc.combination(N + 1, k) - calc.combination(N + 1 - width, k - 1)
) % MOD
print(res)
if __name__ == "__main__":
main()
# PxQxR
# PxRが重複
# 重複要素xの含まれる個数で場合分けをする
# xを含まない
# xを2個とも含む
# 一意
# xを1個含む場合でも、
# Qの要素を含む場合は、どっちのxを取ったか分かる
# Qの要素を含まないとき、どっちのxを取ったか分からない
# cmb(N+1,K)-cmb(PRの総和,K-1)
| def build_combination(n, mod):
def cmb(n, r):
if r < 0 or n < r:
return 0
return (((invs[r] * invs[n - r]) % mod) * fact[n]) % mod
fact = [1] * (n + 1)
for x in range(2, n + 1):
fact[x] = x * fact[x - 1] % mod
invs = [1] * (n + 1)
invs[n] = pow(fact[n], mod - 2, mod)
for x in range(n - 1, 0, -1):
invs[x] = invs[x + 1] * (x + 1) % mod
return cmb
def find(a):
"""重複する数値のindexのペアを返す"""
n = len(a)
checked = [-1] * (n + 1)
for i, x in enumerate(a):
if checked[x] != -1:
return checked[x], i
else:
checked[x] = i
raise ValueError
def main():
mod = 10**9 + 7
n = int(eval(input()))
(*a,) = list(map(int, input().split()))
cmb = build_combination(n + 1, mod)
li, ri = find(a)
for k in range(1, n + 2):
ret = (cmb(n + 1, k) - cmb(n + 1 - (ri - li + 1), k - 1)) % mod # mod忘れ
print(ret)
# for j in range(k + 1):
# ret -= cmb(li, j) * cmb(n - ri, k - j - 1)
# PxQxRのPRからk-1個とる
# PRの取り方の総和を求めるより、区間PRに含まれる総個数からk-1個選ぶ方法を考える
if __name__ == "__main__":
main()
| false | 32 | [
"-# 解説を見た",
"-class Calc:",
"- def __init__(self, max_value, mod):",
"- \"\"\"combination(max_value, all)\"\"\"",
"- fact = [-1] * (max_value + 1)",
"- fact[0] = 1",
"- fact[1] = 1",
"- for x in range(2, max_value + 1):",
"- fact[x] = x * fact[x - 1] % mod",
"- invs = [-1] * (max_value + 1)",
"- invs[max_value] = pow(fact[max_value], mod - 2, mod)",
"- for x in range(max_value - 1, 0, -1):",
"- invs[x] = invs[x + 1] * (x + 1) % mod",
"- # 逆元はこの求め方が速いらしい",
"- self.fact = fact",
"- self.invs = invs",
"- self.mod = mod",
"+def build_combination(n, mod):",
"+ def cmb(n, r):",
"+ if r < 0 or n < r:",
"+ return 0",
"+ return (((invs[r] * invs[n - r]) % mod) * fact[n]) % mod",
"- def combination(self, n, r):",
"- if n - r < r:",
"- return self.combination(n, n - r)",
"- if r < 0:",
"- return 0",
"- if r == 0:",
"- return 1",
"- if r == 1:",
"- return n",
"- return self.fact[n] * self.invs[r] * self.invs[n - r] % self.mod",
"+ fact = [1] * (n + 1)",
"+ for x in range(2, n + 1):",
"+ fact[x] = x * fact[x - 1] % mod",
"+ invs = [1] * (n + 1)",
"+ invs[n] = pow(fact[n], mod - 2, mod)",
"+ for x in range(n - 1, 0, -1):",
"+ invs[x] = invs[x + 1] * (x + 1) % mod",
"+ return cmb",
"+",
"+",
"+def find(a):",
"+ \"\"\"重複する数値のindexのペアを返す\"\"\"",
"+ n = len(a)",
"+ checked = [-1] * (n + 1)",
"+ for i, x in enumerate(a):",
"+ if checked[x] != -1:",
"+ return checked[x], i",
"+ else:",
"+ checked[x] = i",
"+ raise ValueError",
"- MOD = 10**9 + 7",
"- N = int(eval(input()))",
"- (*A,) = list(map(int, input().split()))",
"- pos = [-1] * (N + 1)",
"- indices = None",
"- for i, a in enumerate(A):",
"- if pos[a] == -1:",
"- pos[a] = i",
"- else:",
"- indices = pos[a], i",
"- break",
"- width = indices[1] - indices[0] + 1",
"- # 重複要素を両端に持つような区間の長さ",
"- calc = Calc(max_value=N + 1, mod=MOD)",
"- for k in range(1, N + 1 + 1):",
"- res = (",
"- calc.combination(N + 1, k) - calc.combination(N + 1 - width, k - 1)",
"- ) % MOD",
"- print(res)",
"+ mod = 10**9 + 7",
"+ n = int(eval(input()))",
"+ (*a,) = list(map(int, input().split()))",
"+ cmb = build_combination(n + 1, mod)",
"+ li, ri = find(a)",
"+ for k in range(1, n + 2):",
"+ ret = (cmb(n + 1, k) - cmb(n + 1 - (ri - li + 1), k - 1)) % mod # mod忘れ",
"+ print(ret)",
"+ # for j in range(k + 1):",
"+ # ret -= cmb(li, j) * cmb(n - ri, k - j - 1)",
"+ # PxQxRのPRからk-1個とる",
"+ # PRの取り方の総和を求めるより、区間PRに含まれる総個数からk-1個選ぶ方法を考える",
"-# PxQxR",
"-# PxRが重複",
"-# 重複要素xの含まれる個数で場合分けをする",
"-# xを含まない",
"-# xを2個とも含む",
"-# 一意",
"-# xを1個含む場合でも、",
"-# Qの要素を含む場合は、どっちのxを取ったか分かる",
"-# Qの要素を含まないとき、どっちのxを取ったか分からない",
"-# cmb(N+1,K)-cmb(PRの総和,K-1)"
]
| false | 0.055005 | 0.06916 | 0.795337 | [
"s435017206",
"s275980407"
]
|
u268554510 | p02798 | python | s625936314 | s154337988 | 1,924 | 922 | 419,904 | 165,660 | Accepted | Accepted | 52.08 | def main():
N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
# M:カードの数字の最大値+1
M = max(max(A),max(B))+1
INF=float('inf')
# dp[mask][a]:maskのカードが操作済で、そのうち右端のカードの数字がaであるときの操作回数の最小値
dp = [[INF for _ in range(M)] for _ in range(1<<N)]
dp[0][0] = 0
for i in range(1<<N):
# idx:操作済カードの枚数
idx = 0
for k in range(N):
#k番目のカードが操作済みかどうか判定する。iでk番目にフラグがたってたら、操作済みとする。
if (i>>k)&1 == 1:
idx += 1
for j in range(M):
if dp[i][j] >= INF:
continue
for k in range(N):
# k:右端の操作済カードの次に来るカード
# kがすでに操作済の場合はcontinueする
if (i>>k)&1:
continue
# kが何回操作されるかによってkの数字が表の数字になるか裏の数字になるかが決まる
if abs(k-idx)%2 == 0:
c = A[k]
else:
c = B[k]
# kの数字広義単調増加にならない場合はcontinue
if j > c:
continue
# t:kを右端の操作済カードの次に並べるための操作回数
# それは、初期配置でkより左にあってまだ操作済でないカードの枚数と一致する
t = 0
for l in range(k):
if (i>>l)&1 == 0:
t += 1
#print(i,k,idx,c,dp[i|(1<<k)][c],t)
dp[i|(1<<k)][c] = min(dp[i|(1<<k)][c],dp[i][j]+t)
ans = INF
for i in range(M):
ans = min(dp[(1<<N)-1][i],ans)
print((ans if ans < INF else -1))
if __name__ == '__main__':
main() | N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
INF = N**3
max_ab = max(max(A),max(B))+1
dp = [[INF] * max_ab for _ in range(2**N)]
dp[0][0]=0
for i in range(2**N):
done = 0
for j in range(N):
if (i>>j)&1:
done += 1
for right_end in range(max_ab):
if dp[i][right_end]==INF:
continue
for add_last in range(N):
if (i>>add_last)&1:
continue
if abs(add_last-done)%2==0:
add_last_surface = A[add_last]
else:
add_last_surface = B[add_last]
if right_end>add_last_surface:
continue
num = 0
for k in range(add_last):
if (i>>k)&1==0:
num+=1
dp[i|1<<add_last][add_last_surface]=min(dp[i|1<<add_last][add_last_surface],
dp[i][right_end]+num)
ans = min(dp[-1])
if ans==INF:
print((-1))
else:
print(ans) | 53 | 40 | 1,363 | 976 | def main():
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
# M:カードの数字の最大値+1
M = max(max(A), max(B)) + 1
INF = float("inf")
# dp[mask][a]:maskのカードが操作済で、そのうち右端のカードの数字がaであるときの操作回数の最小値
dp = [[INF for _ in range(M)] for _ in range(1 << N)]
dp[0][0] = 0
for i in range(1 << N):
# idx:操作済カードの枚数
idx = 0
for k in range(N):
# k番目のカードが操作済みかどうか判定する。iでk番目にフラグがたってたら、操作済みとする。
if (i >> k) & 1 == 1:
idx += 1
for j in range(M):
if dp[i][j] >= INF:
continue
for k in range(N):
# k:右端の操作済カードの次に来るカード
# kがすでに操作済の場合はcontinueする
if (i >> k) & 1:
continue
# kが何回操作されるかによってkの数字が表の数字になるか裏の数字になるかが決まる
if abs(k - idx) % 2 == 0:
c = A[k]
else:
c = B[k]
# kの数字広義単調増加にならない場合はcontinue
if j > c:
continue
# t:kを右端の操作済カードの次に並べるための操作回数
# それは、初期配置でkより左にあってまだ操作済でないカードの枚数と一致する
t = 0
for l in range(k):
if (i >> l) & 1 == 0:
t += 1
# print(i,k,idx,c,dp[i|(1<<k)][c],t)
dp[i | (1 << k)][c] = min(dp[i | (1 << k)][c], dp[i][j] + t)
ans = INF
for i in range(M):
ans = min(dp[(1 << N) - 1][i], ans)
print((ans if ans < INF else -1))
if __name__ == "__main__":
main()
| N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
INF = N**3
max_ab = max(max(A), max(B)) + 1
dp = [[INF] * max_ab for _ in range(2**N)]
dp[0][0] = 0
for i in range(2**N):
done = 0
for j in range(N):
if (i >> j) & 1:
done += 1
for right_end in range(max_ab):
if dp[i][right_end] == INF:
continue
for add_last in range(N):
if (i >> add_last) & 1:
continue
if abs(add_last - done) % 2 == 0:
add_last_surface = A[add_last]
else:
add_last_surface = B[add_last]
if right_end > add_last_surface:
continue
num = 0
for k in range(add_last):
if (i >> k) & 1 == 0:
num += 1
dp[i | 1 << add_last][add_last_surface] = min(
dp[i | 1 << add_last][add_last_surface], dp[i][right_end] + num
)
ans = min(dp[-1])
if ans == INF:
print((-1))
else:
print(ans)
| false | 24.528302 | [
"-def main():",
"- N = int(eval(input()))",
"- A = list(map(int, input().split()))",
"- B = list(map(int, input().split()))",
"- # M:カードの数字の最大値+1",
"- M = max(max(A), max(B)) + 1",
"- INF = float(\"inf\")",
"- # dp[mask][a]:maskのカードが操作済で、そのうち右端のカードの数字がaであるときの操作回数の最小値",
"- dp = [[INF for _ in range(M)] for _ in range(1 << N)]",
"- dp[0][0] = 0",
"- for i in range(1 << N):",
"- # idx:操作済カードの枚数",
"- idx = 0",
"- for k in range(N):",
"- # k番目のカードが操作済みかどうか判定する。iでk番目にフラグがたってたら、操作済みとする。",
"- if (i >> k) & 1 == 1:",
"- idx += 1",
"- for j in range(M):",
"- if dp[i][j] >= INF:",
"+N = int(eval(input()))",
"+A = list(map(int, input().split()))",
"+B = list(map(int, input().split()))",
"+INF = N**3",
"+max_ab = max(max(A), max(B)) + 1",
"+dp = [[INF] * max_ab for _ in range(2**N)]",
"+dp[0][0] = 0",
"+for i in range(2**N):",
"+ done = 0",
"+ for j in range(N):",
"+ if (i >> j) & 1:",
"+ done += 1",
"+ for right_end in range(max_ab):",
"+ if dp[i][right_end] == INF:",
"+ continue",
"+ for add_last in range(N):",
"+ if (i >> add_last) & 1:",
"- for k in range(N):",
"- # k:右端の操作済カードの次に来るカード",
"- # kがすでに操作済の場合はcontinueする",
"- if (i >> k) & 1:",
"- continue",
"- # kが何回操作されるかによってkの数字が表の数字になるか裏の数字になるかが決まる",
"- if abs(k - idx) % 2 == 0:",
"- c = A[k]",
"- else:",
"- c = B[k]",
"- # kの数字広義単調増加にならない場合はcontinue",
"- if j > c:",
"- continue",
"- # t:kを右端の操作済カードの次に並べるための操作回数",
"- # それは、初期配置でkより左にあってまだ操作済でないカードの枚数と一致する",
"- t = 0",
"- for l in range(k):",
"- if (i >> l) & 1 == 0:",
"- t += 1",
"- # print(i,k,idx,c,dp[i|(1<<k)][c],t)",
"- dp[i | (1 << k)][c] = min(dp[i | (1 << k)][c], dp[i][j] + t)",
"- ans = INF",
"- for i in range(M):",
"- ans = min(dp[(1 << N) - 1][i], ans)",
"- print((ans if ans < INF else -1))",
"-",
"-",
"-if __name__ == \"__main__\":",
"- main()",
"+ if abs(add_last - done) % 2 == 0:",
"+ add_last_surface = A[add_last]",
"+ else:",
"+ add_last_surface = B[add_last]",
"+ if right_end > add_last_surface:",
"+ continue",
"+ num = 0",
"+ for k in range(add_last):",
"+ if (i >> k) & 1 == 0:",
"+ num += 1",
"+ dp[i | 1 << add_last][add_last_surface] = min(",
"+ dp[i | 1 << add_last][add_last_surface], dp[i][right_end] + num",
"+ )",
"+ans = min(dp[-1])",
"+if ans == INF:",
"+ print((-1))",
"+else:",
"+ print(ans)"
]
| false | 0.0462 | 0.03719 | 1.242276 | [
"s625936314",
"s154337988"
]
|
u736729525 | p03634 | python | s038287829 | s243650234 | 1,590 | 621 | 56,696 | 44,412 | Accepted | Accepted | 60.94 | from collections import deque
N = int(eval(input()))
E = [[] for i in range(N)]
C = {}
D = [0] * N
parent = [0]*N
for i in range(N-1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
E[a].append(b)
E[b].append(a)
C[(a,b)] = c
C[(b,a)] = c
M, K = list(map(int, input().split()))
K -= 1
parent[K] = K
Q = deque()
Q.append(K)
while Q:
u = Q.popleft()
d = D[u]
for v in E[u]:
if parent[u] == v:
continue
parent[v] = u
D[v] = d + C[(u,v)]
Q.append(v)
for i in range(M):
x, y = list(map(int, input().split()))
x -= 1
y -= 1
print((D[x]+D[y]))
| from collections import deque
def main():
def p(a,b):
if a < b:
return (a,b)
else:
return (b,a)
input = open(0).readline
N = int(eval(input()))
E = [[] for i in range(N)]
C = {}
D = [0] * N
parent = [0]*N
for i in range(N-1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
E[a].append(b)
E[b].append(a)
C[p(a,b)] = c
M, K = list(map(int, input().split()))
K -= 1
parent[K] = K
Q = deque()
Q.append(K)
while Q:
u = Q.popleft()
d = D[u]
for v in E[u]:
if parent[u] == v:
continue
parent[v] = u
D[v] = d + C[p(u,v)]
Q.append(v)
for i in range(M):
x, y = list(map(int, input().split()))
x -= 1
y -= 1
print((D[x]+D[y]))
main()
| 41 | 47 | 621 | 795 | from collections import deque
N = int(eval(input()))
E = [[] for i in range(N)]
C = {}
D = [0] * N
parent = [0] * N
for i in range(N - 1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
E[a].append(b)
E[b].append(a)
C[(a, b)] = c
C[(b, a)] = c
M, K = list(map(int, input().split()))
K -= 1
parent[K] = K
Q = deque()
Q.append(K)
while Q:
u = Q.popleft()
d = D[u]
for v in E[u]:
if parent[u] == v:
continue
parent[v] = u
D[v] = d + C[(u, v)]
Q.append(v)
for i in range(M):
x, y = list(map(int, input().split()))
x -= 1
y -= 1
print((D[x] + D[y]))
| from collections import deque
def main():
def p(a, b):
if a < b:
return (a, b)
else:
return (b, a)
input = open(0).readline
N = int(eval(input()))
E = [[] for i in range(N)]
C = {}
D = [0] * N
parent = [0] * N
for i in range(N - 1):
a, b, c = list(map(int, input().split()))
a -= 1
b -= 1
E[a].append(b)
E[b].append(a)
C[p(a, b)] = c
M, K = list(map(int, input().split()))
K -= 1
parent[K] = K
Q = deque()
Q.append(K)
while Q:
u = Q.popleft()
d = D[u]
for v in E[u]:
if parent[u] == v:
continue
parent[v] = u
D[v] = d + C[p(u, v)]
Q.append(v)
for i in range(M):
x, y = list(map(int, input().split()))
x -= 1
y -= 1
print((D[x] + D[y]))
main()
| false | 12.765957 | [
"-N = int(eval(input()))",
"-E = [[] for i in range(N)]",
"-C = {}",
"-D = [0] * N",
"-parent = [0] * N",
"-for i in range(N - 1):",
"- a, b, c = list(map(int, input().split()))",
"- a -= 1",
"- b -= 1",
"- E[a].append(b)",
"- E[b].append(a)",
"- C[(a, b)] = c",
"- C[(b, a)] = c",
"-M, K = list(map(int, input().split()))",
"-K -= 1",
"-parent[K] = K",
"-Q = deque()",
"-Q.append(K)",
"-while Q:",
"- u = Q.popleft()",
"- d = D[u]",
"- for v in E[u]:",
"- if parent[u] == v:",
"- continue",
"- parent[v] = u",
"- D[v] = d + C[(u, v)]",
"- Q.append(v)",
"-for i in range(M):",
"- x, y = list(map(int, input().split()))",
"- x -= 1",
"- y -= 1",
"- print((D[x] + D[y]))",
"+",
"+def main():",
"+ def p(a, b):",
"+ if a < b:",
"+ return (a, b)",
"+ else:",
"+ return (b, a)",
"+",
"+ input = open(0).readline",
"+ N = int(eval(input()))",
"+ E = [[] for i in range(N)]",
"+ C = {}",
"+ D = [0] * N",
"+ parent = [0] * N",
"+ for i in range(N - 1):",
"+ a, b, c = list(map(int, input().split()))",
"+ a -= 1",
"+ b -= 1",
"+ E[a].append(b)",
"+ E[b].append(a)",
"+ C[p(a, b)] = c",
"+ M, K = list(map(int, input().split()))",
"+ K -= 1",
"+ parent[K] = K",
"+ Q = deque()",
"+ Q.append(K)",
"+ while Q:",
"+ u = Q.popleft()",
"+ d = D[u]",
"+ for v in E[u]:",
"+ if parent[u] == v:",
"+ continue",
"+ parent[v] = u",
"+ D[v] = d + C[p(u, v)]",
"+ Q.append(v)",
"+ for i in range(M):",
"+ x, y = list(map(int, input().split()))",
"+ x -= 1",
"+ y -= 1",
"+ print((D[x] + D[y]))",
"+",
"+",
"+main()"
]
| false | 0.042738 | 0.036675 | 1.165301 | [
"s038287829",
"s243650234"
]
|
u710921979 | p03478 | python | s554350711 | s043158750 | 205 | 34 | 42,092 | 3,188 | Accepted | Accepted | 83.41 | n,a,b=list(map(int,input().split()))
ans=0
for i in range(n+1):
if a<=sum(list(map(int,list(str(i)))))<=b:
ans+=i
print(ans) | n,a,b=list(map(int,input().split()))
ans=0
for i in range(1,n+1):
if a<=sum(list(map(int,str(i))))<=b:
ans+=i
print(ans) | 6 | 6 | 135 | 131 | n, a, b = list(map(int, input().split()))
ans = 0
for i in range(n + 1):
if a <= sum(list(map(int, list(str(i))))) <= b:
ans += i
print(ans)
| n, a, b = list(map(int, input().split()))
ans = 0
for i in range(1, n + 1):
if a <= sum(list(map(int, str(i)))) <= b:
ans += i
print(ans)
| false | 0 | [
"-for i in range(n + 1):",
"- if a <= sum(list(map(int, list(str(i))))) <= b:",
"+for i in range(1, n + 1):",
"+ if a <= sum(list(map(int, str(i)))) <= b:"
]
| false | 0.053629 | 0.054505 | 0.983938 | [
"s554350711",
"s043158750"
]
|
u284854859 | p03061 | python | s040742222 | s462423400 | 822 | 675 | 104,664 | 88,288 | Accepted | Accepted | 17.88 | def main():
import sys
input = sys.stdin.readline
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b,a%b)
#[p,q)のgcd
def query(p,q):
if p>n-1 or q<1:
return 0
if abs(q-p)<=1:
return a[p]
p += num-1
q += num-2
res=0
while q>p:
if p&1 == 0:
res = gcd(res,seg[p])
if q&1 == 1:
res = gcd(res,seg[q])
q -= 1
p = p//2
q = (q-1)//2
res = gcd(res,seg[p])
return res
n = int(eval(input()))
a = tuple(map(int,input().split()))
#num:n以上の最小の2のべき乗
num =2**(n-1).bit_length()
seg=[0]*2*num
for i in range(n):
seg[i+num-1]=a[i]
for i in range(num-2,-1,-1) :
seg[i]=gcd(seg[2*i+1],seg[2*i+2])
ans = -1
for i in range(n):
ans = max(ans,gcd(query(0,i),query(i+1,n)))
print(ans)
if __name__=='__main__':
main() |
def main():
import sys
from fractions import gcd
input = sys.stdin.readline
def init():
#set_val
for i in range(n):
seg[i+num-1]=a[i]
#built
for i in range(num-2,-1,-1) :
seg[i]=gcd(seg[2*i+1],seg[2*i+2])
def update(k,z):
k += num
seg[k] = x
while k+1:
k = (k-1)//2
date[k] = gcd(seg[k*2+1],seg[k*2+2])
def query(p,q):
if p>n-1 or q<1:
return 0
if abs(q-p)<=1:
return a[p]
p += num-1
q += num-2
res=0
while q>p:
if p&1 == 0:
res = gcd(res,seg[p])
if q&1 == 1:
res = gcd(res,seg[q])
q -= 1
p = p//2
q = (q-1)//2
res = gcd(res,seg[p])
return res
n = int(eval(input()))
a = tuple(map(int,input().split()))
#num:n以上の最小の2のべき乗
num =2**(n-1).bit_length()
seg=[0]*2*num
init()
ans = -1
for i in range(n):
ans = max(ans,gcd(query(0,i),query(i+1,n)))
print(ans)
if __name__ == '__main__':
main() | 45 | 57 | 1,051 | 1,228 | def main():
import sys
input = sys.stdin.readline
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a % b)
# [p,q)のgcd
def query(p, q):
if p > n - 1 or q < 1:
return 0
if abs(q - p) <= 1:
return a[p]
p += num - 1
q += num - 2
res = 0
while q > p:
if p & 1 == 0:
res = gcd(res, seg[p])
if q & 1 == 1:
res = gcd(res, seg[q])
q -= 1
p = p // 2
q = (q - 1) // 2
res = gcd(res, seg[p])
return res
n = int(eval(input()))
a = tuple(map(int, input().split()))
# num:n以上の最小の2のべき乗
num = 2 ** (n - 1).bit_length()
seg = [0] * 2 * num
for i in range(n):
seg[i + num - 1] = a[i]
for i in range(num - 2, -1, -1):
seg[i] = gcd(seg[2 * i + 1], seg[2 * i + 2])
ans = -1
for i in range(n):
ans = max(ans, gcd(query(0, i), query(i + 1, n)))
print(ans)
if __name__ == "__main__":
main()
| def main():
import sys
from fractions import gcd
input = sys.stdin.readline
def init():
# set_val
for i in range(n):
seg[i + num - 1] = a[i]
# built
for i in range(num - 2, -1, -1):
seg[i] = gcd(seg[2 * i + 1], seg[2 * i + 2])
def update(k, z):
k += num
seg[k] = x
while k + 1:
k = (k - 1) // 2
date[k] = gcd(seg[k * 2 + 1], seg[k * 2 + 2])
def query(p, q):
if p > n - 1 or q < 1:
return 0
if abs(q - p) <= 1:
return a[p]
p += num - 1
q += num - 2
res = 0
while q > p:
if p & 1 == 0:
res = gcd(res, seg[p])
if q & 1 == 1:
res = gcd(res, seg[q])
q -= 1
p = p // 2
q = (q - 1) // 2
res = gcd(res, seg[p])
return res
n = int(eval(input()))
a = tuple(map(int, input().split()))
# num:n以上の最小の2のべき乗
num = 2 ** (n - 1).bit_length()
seg = [0] * 2 * num
init()
ans = -1
for i in range(n):
ans = max(ans, gcd(query(0, i), query(i + 1, n)))
print(ans)
if __name__ == "__main__":
main()
| false | 21.052632 | [
"+ from fractions import gcd",
"- def gcd(a, b):",
"- if b == 0:",
"- return a",
"- else:",
"- return gcd(b, a % b)",
"+ def init():",
"+ # set_val",
"+ for i in range(n):",
"+ seg[i + num - 1] = a[i]",
"+ # built",
"+ for i in range(num - 2, -1, -1):",
"+ seg[i] = gcd(seg[2 * i + 1], seg[2 * i + 2])",
"- # [p,q)のgcd",
"+ def update(k, z):",
"+ k += num",
"+ seg[k] = x",
"+ while k + 1:",
"+ k = (k - 1) // 2",
"+ date[k] = gcd(seg[k * 2 + 1], seg[k * 2 + 2])",
"+",
"- for i in range(n):",
"- seg[i + num - 1] = a[i]",
"- for i in range(num - 2, -1, -1):",
"- seg[i] = gcd(seg[2 * i + 1], seg[2 * i + 2])",
"+ init()"
]
| false | 0.050961 | 0.062562 | 0.814575 | [
"s040742222",
"s462423400"
]
|
u044220565 | p02757 | python | s539289151 | s279672612 | 1,216 | 229 | 14,320 | 12,564 | Accepted | Accepted | 81.17 | # coding: utf-8
import numpy as np
N,P = list(map(int, input().split()))
S = '0'+eval(input())
#N=200000
#P=9893
#S= '0'+'1234567890' * 20000
if (P==2)|(P==5):
sum=0
for i in range(N, 0, -1):
if int(S[i]) % P == 0:
sum+= i
print(sum)
else:
dp1 = np.zeros(N + 1)
dp2 = np.zeros(N + 1)
dp3 = np.zeros(P)
dp1[N] = int(S[N]) % P
dp3[int(dp1[N])] += 1
k = 1
for i in range(N - 1, 0, -1):
dp1[i] = (dp1[i + 1] + (int(S[i]) * 10 * k)) % P
dp3[int(dp1[i])] += 1
k = (k * 10) % P
sum = 0
for i in range(P):
if i == 0:
sum += (dp3[i] * (dp3[i] - 1)) // 2 + dp3[i]
continue
if dp3[i] == 0: continue
sum += (dp3[i] * (dp3[i] - 1)) // 2
print((int(sum)))
| # coding: utf-8
N,P = list(map(int, input().split()))
S = '0'+eval(input())
#N=200000
#P=9893
#S= '0'+'1234567890' * 20000
if (P==2)|(P==5):
sum=0
for i in range(N, 0, -1):
if int(S[i]) % P == 0:
sum+= i
print(sum)
else:
dp1 = [0] * (N+1)
dp2 = [0] * (N+1)
dp3 = [0] * P
dp1[N] = int(S[N]) % P
dp3[int(dp1[N])] += 1
k = 1
for i in range(N - 1, 0, -1):
dp1[i] = (dp1[i + 1] + (int(S[i]) * 10 * k)) % P
dp3[int(dp1[i])] += 1
k = (k * 10) % P
sum = 0
for i in range(P):
if i == 0:
sum += (dp3[i] * (dp3[i] - 1)) // 2 + dp3[i]
continue
if dp3[i] == 0: continue
sum += (dp3[i] * (dp3[i] - 1)) // 2
print((int(sum)))
| 38 | 38 | 821 | 791 | # coding: utf-8
import numpy as np
N, P = list(map(int, input().split()))
S = "0" + eval(input())
# N=200000
# P=9893
# S= '0'+'1234567890' * 20000
if (P == 2) | (P == 5):
sum = 0
for i in range(N, 0, -1):
if int(S[i]) % P == 0:
sum += i
print(sum)
else:
dp1 = np.zeros(N + 1)
dp2 = np.zeros(N + 1)
dp3 = np.zeros(P)
dp1[N] = int(S[N]) % P
dp3[int(dp1[N])] += 1
k = 1
for i in range(N - 1, 0, -1):
dp1[i] = (dp1[i + 1] + (int(S[i]) * 10 * k)) % P
dp3[int(dp1[i])] += 1
k = (k * 10) % P
sum = 0
for i in range(P):
if i == 0:
sum += (dp3[i] * (dp3[i] - 1)) // 2 + dp3[i]
continue
if dp3[i] == 0:
continue
sum += (dp3[i] * (dp3[i] - 1)) // 2
print((int(sum)))
| # coding: utf-8
N, P = list(map(int, input().split()))
S = "0" + eval(input())
# N=200000
# P=9893
# S= '0'+'1234567890' * 20000
if (P == 2) | (P == 5):
sum = 0
for i in range(N, 0, -1):
if int(S[i]) % P == 0:
sum += i
print(sum)
else:
dp1 = [0] * (N + 1)
dp2 = [0] * (N + 1)
dp3 = [0] * P
dp1[N] = int(S[N]) % P
dp3[int(dp1[N])] += 1
k = 1
for i in range(N - 1, 0, -1):
dp1[i] = (dp1[i + 1] + (int(S[i]) * 10 * k)) % P
dp3[int(dp1[i])] += 1
k = (k * 10) % P
sum = 0
for i in range(P):
if i == 0:
sum += (dp3[i] * (dp3[i] - 1)) // 2 + dp3[i]
continue
if dp3[i] == 0:
continue
sum += (dp3[i] * (dp3[i] - 1)) // 2
print((int(sum)))
| false | 0 | [
"-import numpy as np",
"-",
"- dp1 = np.zeros(N + 1)",
"- dp2 = np.zeros(N + 1)",
"- dp3 = np.zeros(P)",
"+ dp1 = [0] * (N + 1)",
"+ dp2 = [0] * (N + 1)",
"+ dp3 = [0] * P"
]
| false | 0.513854 | 0.063848 | 8.048085 | [
"s539289151",
"s279672612"
]
|
u977389981 | p03937 | python | s423432647 | s735084780 | 20 | 17 | 3,188 | 3,060 | Accepted | Accepted | 15 | h, w = list(map(int, input().split()))
A = [eval(input()) for i in range(h)]
flag = 0
for a in A:
X = a.split('.')
cnt = 0
for x in X:
if '#' in x:
cnt += 1
if cnt > 1:
flag = 1
if flag:
ans = 'Impossible'
else:
ans = 'Possible'
posi = 0
for i in range(h):
B = []
for j in range(w):
if A[i][j] == '#':
B.append(j)
if B[0] > posi or B[0] < posi:
ans = 'Impossible'
break
else:
posi = B[-1]
print(ans) | h, w = list(map(int, input().split()))
A = [eval(input()) for i in range(h)]
cnt = 0
for i in range(h):
for j in range(w):
if A[i][j] == '#':
cnt += 1
if cnt == w + h - 1:
print('Possible')
else:
print('Impossible') | 30 | 11 | 583 | 245 | h, w = list(map(int, input().split()))
A = [eval(input()) for i in range(h)]
flag = 0
for a in A:
X = a.split(".")
cnt = 0
for x in X:
if "#" in x:
cnt += 1
if cnt > 1:
flag = 1
if flag:
ans = "Impossible"
else:
ans = "Possible"
posi = 0
for i in range(h):
B = []
for j in range(w):
if A[i][j] == "#":
B.append(j)
if B[0] > posi or B[0] < posi:
ans = "Impossible"
break
else:
posi = B[-1]
print(ans)
| h, w = list(map(int, input().split()))
A = [eval(input()) for i in range(h)]
cnt = 0
for i in range(h):
for j in range(w):
if A[i][j] == "#":
cnt += 1
if cnt == w + h - 1:
print("Possible")
else:
print("Impossible")
| false | 63.333333 | [
"-flag = 0",
"-for a in A:",
"- X = a.split(\".\")",
"- cnt = 0",
"- for x in X:",
"- if \"#\" in x:",
"+cnt = 0",
"+for i in range(h):",
"+ for j in range(w):",
"+ if A[i][j] == \"#\":",
"- if cnt > 1:",
"- flag = 1",
"-if flag:",
"- ans = \"Impossible\"",
"+if cnt == w + h - 1:",
"+ print(\"Possible\")",
"- ans = \"Possible\"",
"- posi = 0",
"- for i in range(h):",
"- B = []",
"- for j in range(w):",
"- if A[i][j] == \"#\":",
"- B.append(j)",
"- if B[0] > posi or B[0] < posi:",
"- ans = \"Impossible\"",
"- break",
"- else:",
"- posi = B[-1]",
"-print(ans)",
"+ print(\"Impossible\")"
]
| false | 0.048423 | 0.047365 | 1.022328 | [
"s423432647",
"s735084780"
]
|
u773265208 | p02954 | python | s254393924 | s777000085 | 402 | 207 | 4,968 | 51,120 | Accepted | Accepted | 48.51 | import sys
s = eval(input())
n = len(s)
l = [0] * n
reverse_s = ''.join(list(reversed(s)))
for i in range(n):
state = i
count = 0
while True:
if s[state] == 'R' and s[state+1] == 'L':
if count % 2 == 0:
l[state] += 1
else:
l[state+1] += 1
break
elif s[state] == 'L' and s[state-1] == 'R':
if count % 2 == 0:
l[state] += 1
else:
l[state-1] += 1
break
elif s[state] == 'R' and s[state+1] == 'R':
tmp = s.find('L',state,n) - state
state += tmp
count += tmp
elif s[state] == 'L' and s[state-1] == 'L':
tmp = reverse_s.find('R',n-state,n) - (n - state)
state -= tmp
count += tmp
else:
print('error')
break
for i in range(n):
sys.stdout.write(str(l[i]))
if i != n-1:
sys.stdout.write(" ") | import sys
readline = sys.stdin.readline
def main():
s = eval(input())
n = len(s)
ans = [0 for _ in range(n)]
field = [0 for _ in range(n)]
for i in range(n):
if s[i] == 'L' and s[i-1] == 'L':
field[i] = field[i-1] + 1
for i in reversed(list(range(n))):
if s[i] == 'R' and s[i+1] == 'R':
field[i] = field[i+1] + 1
for i in range(n):
if s[i] == 'L':
if field[i] % 2 == 0:
ans[i - field[i]] += 1
else:
ans[i - field[i] - 1] += 1
else:
if field[i] % 2 == 0:
ans[i + field[i]] += 1
else:
ans[i + field[i] + 1] += 1
ans = [str(i) for i in ans]
print((" ".join(ans)))
if __name__ == '__main__':
main() | 39 | 34 | 792 | 672 | import sys
s = eval(input())
n = len(s)
l = [0] * n
reverse_s = "".join(list(reversed(s)))
for i in range(n):
state = i
count = 0
while True:
if s[state] == "R" and s[state + 1] == "L":
if count % 2 == 0:
l[state] += 1
else:
l[state + 1] += 1
break
elif s[state] == "L" and s[state - 1] == "R":
if count % 2 == 0:
l[state] += 1
else:
l[state - 1] += 1
break
elif s[state] == "R" and s[state + 1] == "R":
tmp = s.find("L", state, n) - state
state += tmp
count += tmp
elif s[state] == "L" and s[state - 1] == "L":
tmp = reverse_s.find("R", n - state, n) - (n - state)
state -= tmp
count += tmp
else:
print("error")
break
for i in range(n):
sys.stdout.write(str(l[i]))
if i != n - 1:
sys.stdout.write(" ")
| import sys
readline = sys.stdin.readline
def main():
s = eval(input())
n = len(s)
ans = [0 for _ in range(n)]
field = [0 for _ in range(n)]
for i in range(n):
if s[i] == "L" and s[i - 1] == "L":
field[i] = field[i - 1] + 1
for i in reversed(list(range(n))):
if s[i] == "R" and s[i + 1] == "R":
field[i] = field[i + 1] + 1
for i in range(n):
if s[i] == "L":
if field[i] % 2 == 0:
ans[i - field[i]] += 1
else:
ans[i - field[i] - 1] += 1
else:
if field[i] % 2 == 0:
ans[i + field[i]] += 1
else:
ans[i + field[i] + 1] += 1
ans = [str(i) for i in ans]
print((" ".join(ans)))
if __name__ == "__main__":
main()
| false | 12.820513 | [
"-s = eval(input())",
"-n = len(s)",
"-l = [0] * n",
"-reverse_s = \"\".join(list(reversed(s)))",
"-for i in range(n):",
"- state = i",
"- count = 0",
"- while True:",
"- if s[state] == \"R\" and s[state + 1] == \"L\":",
"- if count % 2 == 0:",
"- l[state] += 1",
"+readline = sys.stdin.readline",
"+",
"+",
"+def main():",
"+ s = eval(input())",
"+ n = len(s)",
"+ ans = [0 for _ in range(n)]",
"+ field = [0 for _ in range(n)]",
"+ for i in range(n):",
"+ if s[i] == \"L\" and s[i - 1] == \"L\":",
"+ field[i] = field[i - 1] + 1",
"+ for i in reversed(list(range(n))):",
"+ if s[i] == \"R\" and s[i + 1] == \"R\":",
"+ field[i] = field[i + 1] + 1",
"+ for i in range(n):",
"+ if s[i] == \"L\":",
"+ if field[i] % 2 == 0:",
"+ ans[i - field[i]] += 1",
"- l[state + 1] += 1",
"- break",
"- elif s[state] == \"L\" and s[state - 1] == \"R\":",
"- if count % 2 == 0:",
"- l[state] += 1",
"+ ans[i - field[i] - 1] += 1",
"+ else:",
"+ if field[i] % 2 == 0:",
"+ ans[i + field[i]] += 1",
"- l[state - 1] += 1",
"- break",
"- elif s[state] == \"R\" and s[state + 1] == \"R\":",
"- tmp = s.find(\"L\", state, n) - state",
"- state += tmp",
"- count += tmp",
"- elif s[state] == \"L\" and s[state - 1] == \"L\":",
"- tmp = reverse_s.find(\"R\", n - state, n) - (n - state)",
"- state -= tmp",
"- count += tmp",
"- else:",
"- print(\"error\")",
"- break",
"-for i in range(n):",
"- sys.stdout.write(str(l[i]))",
"- if i != n - 1:",
"- sys.stdout.write(\" \")",
"+ ans[i + field[i] + 1] += 1",
"+ ans = [str(i) for i in ans]",
"+ print((\" \".join(ans)))",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.045901 | 0.064398 | 0.712775 | [
"s254393924",
"s777000085"
]
|
u393253137 | p02983 | python | s640947439 | s075493042 | 638 | 53 | 75,436 | 6,788 | Accepted | Accepted | 91.69 | mod = 2019
l, r = list(map(int, input().split()))
m = min(r, l + mod)
MN=[]
for i in range(l, m):
for j in range(i+1, m+1):
MN.append(i*j%mod)
print((min(MN))) | mod = 2019
l, r = list(map(int, input().split()))
m = min(r, l + mod)
MN=[]
for i in range(l, m):
for j in range(i+1, m+1):
cand = i * j % mod
if cand:
MN.append(cand)
else:
print((0))
exit()
print((min(MN))) | 8 | 13 | 170 | 274 | mod = 2019
l, r = list(map(int, input().split()))
m = min(r, l + mod)
MN = []
for i in range(l, m):
for j in range(i + 1, m + 1):
MN.append(i * j % mod)
print((min(MN)))
| mod = 2019
l, r = list(map(int, input().split()))
m = min(r, l + mod)
MN = []
for i in range(l, m):
for j in range(i + 1, m + 1):
cand = i * j % mod
if cand:
MN.append(cand)
else:
print((0))
exit()
print((min(MN)))
| false | 38.461538 | [
"- MN.append(i * j % mod)",
"+ cand = i * j % mod",
"+ if cand:",
"+ MN.append(cand)",
"+ else:",
"+ print((0))",
"+ exit()"
]
| false | 0.062272 | 0.037147 | 1.676367 | [
"s640947439",
"s075493042"
]
|
u815754241 | p02771 | python | s823042199 | s561930014 | 19 | 17 | 3,060 | 2,940 | Accepted | Accepted | 10.53 | ary = input().split(" ")
a = ary[0]
b = ary[1]
c = ary[2]
if ( a == b and ( a != c or b != c) ) or ( a == c and ( a != b or c != b ) ) or ( b == c and ( b != a or c != a ) ) :
print("Yes")
else :
print("No") | ary = input().split(" ")
if len(set(ary)) == 2 :
print("Yes")
else :
print("No") | 9 | 5 | 221 | 88 | ary = input().split(" ")
a = ary[0]
b = ary[1]
c = ary[2]
if (
(a == b and (a != c or b != c))
or (a == c and (a != b or c != b))
or (b == c and (b != a or c != a))
):
print("Yes")
else:
print("No")
| ary = input().split(" ")
if len(set(ary)) == 2:
print("Yes")
else:
print("No")
| false | 44.444444 | [
"-a = ary[0]",
"-b = ary[1]",
"-c = ary[2]",
"-if (",
"- (a == b and (a != c or b != c))",
"- or (a == c and (a != b or c != b))",
"- or (b == c and (b != a or c != a))",
"-):",
"+if len(set(ary)) == 2:"
]
| false | 0.169321 | 0.042587 | 3.975834 | [
"s823042199",
"s561930014"
]
|
u227082700 | p03274 | python | s351744032 | s855596277 | 83 | 75 | 14,252 | 14,252 | Accepted | Accepted | 9.64 | n,k=list(map(int,input().split()))
k-=1
x=list(map(int,input().split()))
print((min(min(abs(x[i])+abs(x[i+k]-x[i]),abs(x[i+k])+abs(x[i+k]-x[i])) for i in range(n-k)))) | n,k=list(map(int,input().split()))
k-=1
x=list(map(int,input().split()))
print((min(min(abs(x[i]),abs(x[i+k]))+abs(x[i]-x[i+k])for i in range(n-k)))) | 4 | 4 | 162 | 144 | n, k = list(map(int, input().split()))
k -= 1
x = list(map(int, input().split()))
print(
(
min(
min(abs(x[i]) + abs(x[i + k] - x[i]), abs(x[i + k]) + abs(x[i + k] - x[i]))
for i in range(n - k)
)
)
)
| n, k = list(map(int, input().split()))
k -= 1
x = list(map(int, input().split()))
print((min(min(abs(x[i]), abs(x[i + k])) + abs(x[i] - x[i + k]) for i in range(n - k))))
| false | 0 | [
"-print(",
"- (",
"- min(",
"- min(abs(x[i]) + abs(x[i + k] - x[i]), abs(x[i + k]) + abs(x[i + k] - x[i]))",
"- for i in range(n - k)",
"- )",
"- )",
"-)",
"+print((min(min(abs(x[i]), abs(x[i + k])) + abs(x[i] - x[i + k]) for i in range(n - k))))"
]
| false | 0.033722 | 0.094773 | 0.355818 | [
"s351744032",
"s855596277"
]
|
u013629972 | p03252 | python | s749645051 | s714296204 | 148 | 42 | 3,632 | 3,888 | Accepted | Accepted | 71.62 | S = eval(input())
T = eval(input())
s_dict, t_dict = {}, {}
for i in range(len(S)):
if S[i] in list(s_dict.keys()):
if s_dict[S[i]] != T[i]:
print("No")
exit()
else:
s_dict[S[i]] = T[i]
if T[i] in list(t_dict.keys()):
if t_dict[T[i]] != S[i]:
print("No")
exit()
else:
t_dict[T[i]] = S[i]
print("Yes")
| from collections import Counter
S = eval(input())
T = eval(input())
s = Counter(S)
t = Counter(T)
if sorted(s.values()) == sorted(t.values()):
print("Yes")
else:
print("No")
| 21 | 12 | 397 | 187 | S = eval(input())
T = eval(input())
s_dict, t_dict = {}, {}
for i in range(len(S)):
if S[i] in list(s_dict.keys()):
if s_dict[S[i]] != T[i]:
print("No")
exit()
else:
s_dict[S[i]] = T[i]
if T[i] in list(t_dict.keys()):
if t_dict[T[i]] != S[i]:
print("No")
exit()
else:
t_dict[T[i]] = S[i]
print("Yes")
| from collections import Counter
S = eval(input())
T = eval(input())
s = Counter(S)
t = Counter(T)
if sorted(s.values()) == sorted(t.values()):
print("Yes")
else:
print("No")
| false | 42.857143 | [
"+from collections import Counter",
"+",
"-s_dict, t_dict = {}, {}",
"-for i in range(len(S)):",
"- if S[i] in list(s_dict.keys()):",
"- if s_dict[S[i]] != T[i]:",
"- print(\"No\")",
"- exit()",
"- else:",
"- s_dict[S[i]] = T[i]",
"- if T[i] in list(t_dict.keys()):",
"- if t_dict[T[i]] != S[i]:",
"- print(\"No\")",
"- exit()",
"- else:",
"- t_dict[T[i]] = S[i]",
"-print(\"Yes\")",
"+s = Counter(S)",
"+t = Counter(T)",
"+if sorted(s.values()) == sorted(t.values()):",
"+ print(\"Yes\")",
"+else:",
"+ print(\"No\")"
]
| false | 0.167117 | 0.03552 | 4.704893 | [
"s749645051",
"s714296204"
]
|
u346812984 | p03221 | python | s190384782 | s678012379 | 733 | 476 | 38,604 | 30,692 | Accepted | Accepted | 35.06 | N, M = list(map(int, input().split()))
pref = [1] * (N + 1)
iPY = []
for i in range(M):
p, y = list(map(int, input().split()))
iPY.append([i, p, y])
iPY.sort(key=lambda x: x[2])
ans = []
for i, p, y in iPY:
name = str(p).zfill(6) + str(pref[p]).zfill(6)
ans.append((i, name))
pref[p] += 1
ans.sort(key=lambda x: x[0])
for _, name in ans:
print(name)
| import bisect
import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N, M = list(map(int, input().split()))
d = [[] for _ in range(N + 1)]
PY = []
for _ in range(M):
p, y = list(map(int, input().split()))
d[p].append(y)
PY.append((p, y))
for i in range(N + 1):
if not d[i]:
continue
d[i] = sorted(set(d[i]))
for p, y in PY:
order = bisect.bisect_left(d[p], y)
print((str(p).zfill(6) + str(order + 1).zfill(6)))
if __name__ == "__main__":
main()
| 17 | 34 | 380 | 659 | N, M = list(map(int, input().split()))
pref = [1] * (N + 1)
iPY = []
for i in range(M):
p, y = list(map(int, input().split()))
iPY.append([i, p, y])
iPY.sort(key=lambda x: x[2])
ans = []
for i, p, y in iPY:
name = str(p).zfill(6) + str(pref[p]).zfill(6)
ans.append((i, name))
pref[p] += 1
ans.sort(key=lambda x: x[0])
for _, name in ans:
print(name)
| import bisect
import sys
sys.setrecursionlimit(10**6)
INF = float("inf")
MOD = 10**9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N, M = list(map(int, input().split()))
d = [[] for _ in range(N + 1)]
PY = []
for _ in range(M):
p, y = list(map(int, input().split()))
d[p].append(y)
PY.append((p, y))
for i in range(N + 1):
if not d[i]:
continue
d[i] = sorted(set(d[i]))
for p, y in PY:
order = bisect.bisect_left(d[p], y)
print((str(p).zfill(6) + str(order + 1).zfill(6)))
if __name__ == "__main__":
main()
| false | 50 | [
"-N, M = list(map(int, input().split()))",
"-pref = [1] * (N + 1)",
"-iPY = []",
"-for i in range(M):",
"- p, y = list(map(int, input().split()))",
"- iPY.append([i, p, y])",
"-iPY.sort(key=lambda x: x[2])",
"-ans = []",
"-for i, p, y in iPY:",
"- name = str(p).zfill(6) + str(pref[p]).zfill(6)",
"- ans.append((i, name))",
"- pref[p] += 1",
"-ans.sort(key=lambda x: x[0])",
"-for _, name in ans:",
"- print(name)",
"+import bisect",
"+import sys",
"+",
"+sys.setrecursionlimit(10**6)",
"+INF = float(\"inf\")",
"+MOD = 10**9 + 7",
"+",
"+",
"+def input():",
"+ return sys.stdin.readline().strip()",
"+",
"+",
"+def main():",
"+ N, M = list(map(int, input().split()))",
"+ d = [[] for _ in range(N + 1)]",
"+ PY = []",
"+ for _ in range(M):",
"+ p, y = list(map(int, input().split()))",
"+ d[p].append(y)",
"+ PY.append((p, y))",
"+ for i in range(N + 1):",
"+ if not d[i]:",
"+ continue",
"+ d[i] = sorted(set(d[i]))",
"+ for p, y in PY:",
"+ order = bisect.bisect_left(d[p], y)",
"+ print((str(p).zfill(6) + str(order + 1).zfill(6)))",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
]
| false | 0.044059 | 0.037515 | 1.174446 | [
"s190384782",
"s678012379"
]
|
u548545174 | p03574 | python | s254273061 | s519242827 | 38 | 29 | 3,700 | 3,188 | Accepted | Accepted | 23.68 | import copy
H, W = list(map(int, input().split()))
S = [list(eval(input())) for _ in range(H)]
ans = copy.deepcopy(S)
dx = [1, 1, 0, -1, -1, -1, 0, 1]
dy = [0, 1, 1, 1, 0, -1, -1, -1]
for i in range(H):
for j in range(W):
if S[i][j] == ".":
cnt = 0
for dir in range(8):
if 0 <= i + dy[dir] < H and 0 <= j + dx[dir] < W:
cnt += (S[i + dy[dir]][j + dx[dir]] == "#")
ans[i][j] = str(cnt)
for h in range(H):
print(("".join(ans[h])))
| H, W = list(map(int, input().split()))
S = [list(eval(input())) for _ in range(H)]
def bomb_count(hi, wi):
cnt = 0
for i in range(-1, 2):
for j in range(-1, 2):
if (0 <= (hi + i) <= (H-1)) and (0 <= (wi + j) <= (W-1)):
if S[hi+i][wi+j] == "#":
cnt += 1
return cnt
for hi in range(H):
for wi in range(W):
masu = S[hi][wi]
if masu == ".":
S[hi][wi] = str(bomb_count(hi, wi))
for hi in range(H):
row = S[hi]
print(("".join(row))) | 20 | 22 | 542 | 545 | import copy
H, W = list(map(int, input().split()))
S = [list(eval(input())) for _ in range(H)]
ans = copy.deepcopy(S)
dx = [1, 1, 0, -1, -1, -1, 0, 1]
dy = [0, 1, 1, 1, 0, -1, -1, -1]
for i in range(H):
for j in range(W):
if S[i][j] == ".":
cnt = 0
for dir in range(8):
if 0 <= i + dy[dir] < H and 0 <= j + dx[dir] < W:
cnt += S[i + dy[dir]][j + dx[dir]] == "#"
ans[i][j] = str(cnt)
for h in range(H):
print(("".join(ans[h])))
| H, W = list(map(int, input().split()))
S = [list(eval(input())) for _ in range(H)]
def bomb_count(hi, wi):
cnt = 0
for i in range(-1, 2):
for j in range(-1, 2):
if (0 <= (hi + i) <= (H - 1)) and (0 <= (wi + j) <= (W - 1)):
if S[hi + i][wi + j] == "#":
cnt += 1
return cnt
for hi in range(H):
for wi in range(W):
masu = S[hi][wi]
if masu == ".":
S[hi][wi] = str(bomb_count(hi, wi))
for hi in range(H):
row = S[hi]
print(("".join(row)))
| false | 9.090909 | [
"-import copy",
"-",
"-ans = copy.deepcopy(S)",
"-dx = [1, 1, 0, -1, -1, -1, 0, 1]",
"-dy = [0, 1, 1, 1, 0, -1, -1, -1]",
"-for i in range(H):",
"- for j in range(W):",
"- if S[i][j] == \".\":",
"- cnt = 0",
"- for dir in range(8):",
"- if 0 <= i + dy[dir] < H and 0 <= j + dx[dir] < W:",
"- cnt += S[i + dy[dir]][j + dx[dir]] == \"#\"",
"- ans[i][j] = str(cnt)",
"-for h in range(H):",
"- print((\"\".join(ans[h])))",
"+",
"+",
"+def bomb_count(hi, wi):",
"+ cnt = 0",
"+ for i in range(-1, 2):",
"+ for j in range(-1, 2):",
"+ if (0 <= (hi + i) <= (H - 1)) and (0 <= (wi + j) <= (W - 1)):",
"+ if S[hi + i][wi + j] == \"#\":",
"+ cnt += 1",
"+ return cnt",
"+",
"+",
"+for hi in range(H):",
"+ for wi in range(W):",
"+ masu = S[hi][wi]",
"+ if masu == \".\":",
"+ S[hi][wi] = str(bomb_count(hi, wi))",
"+for hi in range(H):",
"+ row = S[hi]",
"+ print((\"\".join(row)))"
]
| false | 0.143972 | 0.036132 | 3.984606 | [
"s254273061",
"s519242827"
]
|
u185297444 | p02597 | python | s090739735 | s189184607 | 54 | 47 | 10,600 | 10,752 | Accepted | Accepted | 12.96 | n = int(eval(input()))
c = list(eval(input()))
r = c.count('R')
w = c.count('W')
ans = 0
for i in range(r):
if c[i] == 'R':
pass
elif c[i] == 'W':
ans += 1
print(ans) | n = int(eval(input()))
c = list(eval(input()))
r = c.count('R')
ans = 0
for i in range(r):
if c[i] == 'W':
ans += 1
print(ans) | 12 | 9 | 190 | 135 | n = int(eval(input()))
c = list(eval(input()))
r = c.count("R")
w = c.count("W")
ans = 0
for i in range(r):
if c[i] == "R":
pass
elif c[i] == "W":
ans += 1
print(ans)
| n = int(eval(input()))
c = list(eval(input()))
r = c.count("R")
ans = 0
for i in range(r):
if c[i] == "W":
ans += 1
print(ans)
| false | 25 | [
"-w = c.count(\"W\")",
"- if c[i] == \"R\":",
"- pass",
"- elif c[i] == \"W\":",
"+ if c[i] == \"W\":"
]
| false | 0.043715 | 0.084783 | 0.515612 | [
"s090739735",
"s189184607"
]
|
u296518383 | p02996 | python | s054843915 | s665659868 | 1,047 | 918 | 55,260 | 53,728 | Accepted | Accepted | 12.32 | N=int(eval(input()))
AB=[list(map(int,input().split())) for _ in range(N)]
#print(AB)
AB=sorted(AB,key= lambda x: x[1])
#print(AB)
res=0
for i in range(N):
res+=AB[i][0]
if res>AB[i][1]:
print("No")
break
if i==N-1:
print("Yes") | N = int(eval(input()))
AB = [list(map(int, input().split())) for _ in range(N)]
AB.sort(key = lambda x: x[1])
sum_a = 0
for a, b in AB:
sum_a += a
if sum_a > b:
print("No")
exit()
print("Yes") | 15 | 12 | 256 | 211 | N = int(eval(input()))
AB = [list(map(int, input().split())) for _ in range(N)]
# print(AB)
AB = sorted(AB, key=lambda x: x[1])
# print(AB)
res = 0
for i in range(N):
res += AB[i][0]
if res > AB[i][1]:
print("No")
break
if i == N - 1:
print("Yes")
| N = int(eval(input()))
AB = [list(map(int, input().split())) for _ in range(N)]
AB.sort(key=lambda x: x[1])
sum_a = 0
for a, b in AB:
sum_a += a
if sum_a > b:
print("No")
exit()
print("Yes")
| false | 20 | [
"-# print(AB)",
"-AB = sorted(AB, key=lambda x: x[1])",
"-# print(AB)",
"-res = 0",
"-for i in range(N):",
"- res += AB[i][0]",
"- if res > AB[i][1]:",
"+AB.sort(key=lambda x: x[1])",
"+sum_a = 0",
"+for a, b in AB:",
"+ sum_a += a",
"+ if sum_a > b:",
"- break",
"- if i == N - 1:",
"- print(\"Yes\")",
"+ exit()",
"+print(\"Yes\")"
]
| false | 0.133278 | 0.094655 | 1.408044 | [
"s054843915",
"s665659868"
]
|
u017810624 | p03055 | python | s478738479 | s061788647 | 1,370 | 1,249 | 137,204 | 137,128 | Accepted | Accepted | 8.83 | def bfs(v):
distance=[-1]*n
distance[v]=0
next=connection[v]
next2=set()
visited=[-1]*n
visited[v]=1
visitct=1
ct=0
while visitct!=n:
ct+=1
for i in range(len(next)):
if visited[next[i]]==-1:
distance[next[i]]=ct
visited[next[i]]=1
visitct+=1
for j in range(len(connection[next[i]])):
if visited[connection[next[i]][j]]==-1:
next2.add(connection[next[i]][j])
next=list(next2)
next2=set()
return distance
n=int(eval(input()))
l=[list(map(int,input().split())) for i in range(n-1)]
connection=[[] for i in range(n)]
for i in range(n-1):
connection[l[i][0]-1].append(l[i][1]-1)
connection[l[i][1]-1].append(l[i][0]-1)
if max(bfs(bfs(0).index(max(bfs(0)))))%3==1:
print('Second')
else:
print('First') | def bfs(v):
distance=[-1]*n
distance[v]=0
next=connection[v]
next2=set()
visited=[-1]*n
visited[v]=1
visitct=1
ct=0
while visitct!=n:
ct+=1
for i in range(len(next)):
distance[next[i]]=ct
visited[next[i]]=1
visitct+=1
for j in range(len(connection[next[i]])):
if visited[connection[next[i]][j]]==-1:
next2.add(connection[next[i]][j])
next=list(next2)
next2=set()
return distance
n=int(eval(input()))
l=[list(map(int,input().split())) for i in range(n-1)]
connection=[[] for i in range(n)]
for i in range(n-1):
connection[l[i][0]-1].append(l[i][1]-1)
connection[l[i][1]-1].append(l[i][0]-1)
if max(bfs(bfs(0).index(max(bfs(0)))))%3==1:
print('Second')
else:
print('First') | 35 | 34 | 837 | 792 | def bfs(v):
distance = [-1] * n
distance[v] = 0
next = connection[v]
next2 = set()
visited = [-1] * n
visited[v] = 1
visitct = 1
ct = 0
while visitct != n:
ct += 1
for i in range(len(next)):
if visited[next[i]] == -1:
distance[next[i]] = ct
visited[next[i]] = 1
visitct += 1
for j in range(len(connection[next[i]])):
if visited[connection[next[i]][j]] == -1:
next2.add(connection[next[i]][j])
next = list(next2)
next2 = set()
return distance
n = int(eval(input()))
l = [list(map(int, input().split())) for i in range(n - 1)]
connection = [[] for i in range(n)]
for i in range(n - 1):
connection[l[i][0] - 1].append(l[i][1] - 1)
connection[l[i][1] - 1].append(l[i][0] - 1)
if max(bfs(bfs(0).index(max(bfs(0))))) % 3 == 1:
print("Second")
else:
print("First")
| def bfs(v):
distance = [-1] * n
distance[v] = 0
next = connection[v]
next2 = set()
visited = [-1] * n
visited[v] = 1
visitct = 1
ct = 0
while visitct != n:
ct += 1
for i in range(len(next)):
distance[next[i]] = ct
visited[next[i]] = 1
visitct += 1
for j in range(len(connection[next[i]])):
if visited[connection[next[i]][j]] == -1:
next2.add(connection[next[i]][j])
next = list(next2)
next2 = set()
return distance
n = int(eval(input()))
l = [list(map(int, input().split())) for i in range(n - 1)]
connection = [[] for i in range(n)]
for i in range(n - 1):
connection[l[i][0] - 1].append(l[i][1] - 1)
connection[l[i][1] - 1].append(l[i][0] - 1)
if max(bfs(bfs(0).index(max(bfs(0))))) % 3 == 1:
print("Second")
else:
print("First")
| false | 2.857143 | [
"- if visited[next[i]] == -1:",
"- distance[next[i]] = ct",
"- visited[next[i]] = 1",
"- visitct += 1",
"- for j in range(len(connection[next[i]])):",
"- if visited[connection[next[i]][j]] == -1:",
"- next2.add(connection[next[i]][j])",
"+ distance[next[i]] = ct",
"+ visited[next[i]] = 1",
"+ visitct += 1",
"+ for j in range(len(connection[next[i]])):",
"+ if visited[connection[next[i]][j]] == -1:",
"+ next2.add(connection[next[i]][j])"
]
| false | 0.106455 | 0.039622 | 2.686729 | [
"s478738479",
"s061788647"
]
|
u054514819 | p02866 | python | s212953662 | s098169023 | 131 | 119 | 98,712 | 98,444 | Accepted | Accepted | 9.16 | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
Ds = list(mapint())
if Ds[0]!=0:
print((0))
exit(0)
Ds.sort()
mod = 998244353
from collections import Counter
c = Counter(Ds)
dmax = Ds[-1]
if c[0]>1:
print((0))
else:
ans = 1
for i in range(1, dmax+1):
ans *= pow(c[i-1], c[i], mod)
ans %= mod
print(ans) | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
Ds = list(mapint())
mod = 998244353
from collections import Counter
c = Counter(Ds)
if Ds[0]!=0:
print((0))
elif c[0]>1:
print((0))
else:
ans = 1
for i in range(1, N):
ans *= pow(c[i-1], c[i], mod)
ans %= mod
print(ans) | 26 | 21 | 472 | 426 | import sys
def input():
return sys.stdin.readline().strip()
def mapint():
return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
Ds = list(mapint())
if Ds[0] != 0:
print((0))
exit(0)
Ds.sort()
mod = 998244353
from collections import Counter
c = Counter(Ds)
dmax = Ds[-1]
if c[0] > 1:
print((0))
else:
ans = 1
for i in range(1, dmax + 1):
ans *= pow(c[i - 1], c[i], mod)
ans %= mod
print(ans)
| import sys
def input():
return sys.stdin.readline().strip()
def mapint():
return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
Ds = list(mapint())
mod = 998244353
from collections import Counter
c = Counter(Ds)
if Ds[0] != 0:
print((0))
elif c[0] > 1:
print((0))
else:
ans = 1
for i in range(1, N):
ans *= pow(c[i - 1], c[i], mod)
ans %= mod
print(ans)
| false | 19.230769 | [
"-if Ds[0] != 0:",
"- print((0))",
"- exit(0)",
"-Ds.sort()",
"-dmax = Ds[-1]",
"-if c[0] > 1:",
"+if Ds[0] != 0:",
"+ print((0))",
"+elif c[0] > 1:",
"- for i in range(1, dmax + 1):",
"+ for i in range(1, N):"
]
| false | 0.170007 | 0.044254 | 3.841633 | [
"s212953662",
"s098169023"
]
|
u816631826 | p02790 | python | s140965698 | s542381483 | 68 | 27 | 61,868 | 9,032 | Accepted | Accepted | 60.29 | x, y = map(int, input().split())
if(x < y):
for i in range(0, y):
print(x, end = '')
else:
for i in range(0, x):
print(y, end = '')
| a = [int(i) for i in input().split()]
if (a[0] <= a[1]):
print((str(a[0])*a[1]))
elif (a[1] < a[0]):
print((str(a[1])*a[0]))
| 11 | 5 | 170 | 129 | x, y = map(int, input().split())
if x < y:
for i in range(0, y):
print(x, end="")
else:
for i in range(0, x):
print(y, end="")
| a = [int(i) for i in input().split()]
if a[0] <= a[1]:
print((str(a[0]) * a[1]))
elif a[1] < a[0]:
print((str(a[1]) * a[0]))
| false | 54.545455 | [
"-x, y = map(int, input().split())",
"-if x < y:",
"- for i in range(0, y):",
"- print(x, end=\"\")",
"-else:",
"- for i in range(0, x):",
"- print(y, end=\"\")",
"+a = [int(i) for i in input().split()]",
"+if a[0] <= a[1]:",
"+ print((str(a[0]) * a[1]))",
"+elif a[1] < a[0]:",
"+ print((str(a[1]) * a[0]))"
]
| false | 0.076298 | 0.037618 | 2.028194 | [
"s140965698",
"s542381483"
]
|
u119148115 | p03078 | python | s659933398 | s129664495 | 662 | 351 | 186,608 | 184,008 | Accepted | Accepted | 46.98 | import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
X,Y,Z,K = MI()
A,B,C = LI(),LI(),LI()
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
ANS = []
for i in range(X):
if i >= K:
break
a = A[i]
for j in range(Y):
if i*j >= K:
break
b = B[j]
for k in range(Z):
if i*j*k >= K:
break
c = C[k]
ANS.append(a+b+c)
ANS.sort(reverse=True)
print(*ANS[:K],sep='\n')
| import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
X,Y,Z,K = MI()
A,B,C = LI(),LI(),LI()
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
ANS = []
for i in range(X):
if i >= K:
break
a = A[i]
for j in range(Y):
if i*j >= K:
break
b = B[j]
for k in range(Z):
if i*j*k >= K:
break
c = C[k]
ANS.append(a+b+c)
ANS.sort(reverse=True)
print(*ANS[:K],sep='\n')
| 35 | 28 | 941 | 608 | import sys
sys.setrecursionlimit(10**7)
def I():
return int(sys.stdin.readline().rstrip())
def MI():
return map(int, sys.stdin.readline().rstrip().split())
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
def LI2():
return list(map(int, sys.stdin.readline().rstrip())) # 空白なし
def S():
return sys.stdin.readline().rstrip()
def LS():
return list(sys.stdin.readline().rstrip().split()) # 空白あり
def LS2():
return list(sys.stdin.readline().rstrip()) # 空白なし
X, Y, Z, K = MI()
A, B, C = LI(), LI(), LI()
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
ANS = []
for i in range(X):
if i >= K:
break
a = A[i]
for j in range(Y):
if i * j >= K:
break
b = B[j]
for k in range(Z):
if i * j * k >= K:
break
c = C[k]
ANS.append(a + b + c)
ANS.sort(reverse=True)
print(*ANS[:K], sep="\n")
| import sys
def MI():
return map(int, sys.stdin.readline().rstrip().split())
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
X, Y, Z, K = MI()
A, B, C = LI(), LI(), LI()
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
ANS = []
for i in range(X):
if i >= K:
break
a = A[i]
for j in range(Y):
if i * j >= K:
break
b = B[j]
for k in range(Z):
if i * j * k >= K:
break
c = C[k]
ANS.append(a + b + c)
ANS.sort(reverse=True)
print(*ANS[:K], sep="\n")
| false | 20 | [
"-",
"-sys.setrecursionlimit(10**7)",
"-",
"-",
"-def I():",
"- return int(sys.stdin.readline().rstrip())",
"-",
"-",
"-def LI2():",
"- return list(map(int, sys.stdin.readline().rstrip())) # 空白なし",
"-",
"-",
"-def S():",
"- return sys.stdin.readline().rstrip()",
"-",
"-",
"-def LS():",
"- return list(sys.stdin.readline().rstrip().split()) # 空白あり",
"-",
"-",
"-def LS2():",
"- return list(sys.stdin.readline().rstrip()) # 空白なし"
]
| false | 0.036547 | 0.061644 | 0.592873 | [
"s659933398",
"s129664495"
]
|
u225388820 | p03033 | python | s242084712 | s979525438 | 1,264 | 1,145 | 248,632 | 231,364 | Accepted | Accepted | 9.41 | import sys
input = sys.stdin.readline
# Segment Tree
class Segment:
def __init__(self, N, init_val):
self.N0 = 2 ** (N - 1).bit_length()
# 0-indexedで管理
self.dat = [identity_element] * (2 * self.N0)
# 値を代入
for i in range(N):
self.dat[i + self.N0 - 1] = init_val[i]
# 構築
for i in range(self.N0 - 2, -1, -1):
self.dat[i] = segfunc(self.dat[2 * i + 1], self.dat[2 * i + 2])
# k番目の要素の値をxに変更
def update(self, k, x):
k += self.N0 - 1
self.dat[k] = x
while k >= 0:
k = (k - 1) // 2
self.dat[k] = segfunc(self.dat[2 * k + 1], self.dat[2 * k + 2])
# 区間[l,r)の最小値を求める
def query(self, l, r):
L = l + self.N0
R = r + self.N0
s = identity_element
# 区間を列挙しながら最小値を求める
while L < R:
if R & 1:
R -= 1
s = segfunc(s, self.dat[R - 1])
if L & 1:
s = segfunc(s, self.dat[L - 1])
L += 1
L >>= 1
R >>= 1
return s
# segfunc : min, +, *, xor, gcd など
# identity_element : 単位元(min:inf, 和:0, 積:1, xor:0, gcd:0)
def segfunc(x, y):
return min(x, y) # 変える
identity_element = 2 ** 31 - 1 # 変える
def compress(arr):
*XS, = set(arr)
XS.sort()
return {e: i for i, e in enumerate(XS)}
n, q = list(map(int, input().split()))
s, t, x = [0] * n, [0] * n, [0] * n
for i in range(n):
s[i], t[i], x[i] = list(map(int, input().split()))
s[i] -= x[i]
t[i] -= x[i]
s[i] = max(s[i], 0)
t[i] = max(t[i], 0)
d = [int(eval(input())) for i in range(q)]
com = compress(s + t + d)
k = len(com) + 1
for i in range(n):
s[i] = com[s[i]]
t[i] = com[t[i]]
for i in range(q):
d[i] = com[d[i]]
INF = 1 << 30
a = [INF] * k
b = [[] for i in range(k)]
c = [[] for i in range(k)]
seg = Segment(n, [INF] * n)
for i in range(n):
b[s[i]].append(i)
c[t[i]].append(i)
for i in range(k):
for j in b[i]:
seg.update(j, x[j])
for j in c[i]:
seg.update(j, INF)
a[i] = seg.query(0, n)
for i in d:
print((-1 if a[i] == INF else a[i]))
| import sys
input = sys.stdin.readline
# Segment Tree
# segfunc : min, +, *, xor, gcd など
# identity_element : 単位元(min:inf, 和:0, 積:1, xor:0, gcd:0)
class Segment:
def __init__(self, N, init_val):
"""[セグメント木]
Args:
N ([int]): [要素数]
init_val ([list]): [初期化する値]
"""
self.identity_element = 2 ** 31 - 1 # 変える
self.N0 = 1 << (N - 1).bit_length()
# 0-indexedで管理
self.dat = [self.identity_element] * (2 * self.N0)
# 値を代入
for i in range(N):
self.dat[i + self.N0 - 1] = init_val[i]
# 構築
for i in range(self.N0 - 2, -1, -1):
self.dat[i] = self.segfunc(self.dat[2 * i + 1], self.dat[2 * i + 2])
# k番目の要素の値をxに変更
def update(self, k, x):
k += self.N0 - 1
self.dat[k] = x
while k >= 0:
k = (k - 1) // 2
self.dat[k] = self.segfunc(self.dat[2 * k + 1], self.dat[2 * k + 2])
# 区間[l,r)の最小値を求める
def query(self, l, r):
L = l + self.N0
R = r + self.N0
s = self.identity_element
# 区間を列挙しながら最小値を求める
while L < R:
if R & 1:
R -= 1
s = self.segfunc(s, self.dat[R - 1])
if L & 1:
s = self.segfunc(s, self.dat[L - 1])
L += 1
L >>= 1
R >>= 1
return s
def segfunc(self, x, y):
return min(x, y) # 変える
def compress(arr):
*XS, = set(arr)
XS.sort()
return {e: i for i, e in enumerate(XS)}
n, q = list(map(int, input().split()))
s, t, x = [0] * n, [0] * n, [0] * n
for i in range(n):
s[i], t[i], x[i] = list(map(int, input().split()))
s[i] -= x[i]
t[i] -= x[i]
s[i] = max(s[i], 0)
t[i] = max(t[i], 0)
d = [int(eval(input())) for i in range(q)]
com = compress(s + t + d)
k = len(com) + 1
for i in range(n):
s[i] = com[s[i]]
t[i] = com[t[i]]
for i in range(q):
d[i] = com[d[i]]
INF = 1 << 30
a = [INF] * k
b = [[] for i in range(k)]
c = [[] for i in range(k)]
seg = Segment(n, [INF] * n)
for i in range(n):
b[s[i]].append(i)
c[t[i]].append(i)
for i in range(k):
for j in b[i]:
seg.update(j, x[j])
for j in c[i]:
seg.update(j, INF)
a[i] = seg.query(0, n)
for i in d:
print((-1 if a[i] == INF else a[i]))
| 97 | 99 | 2,248 | 2,419 | import sys
input = sys.stdin.readline
# Segment Tree
class Segment:
def __init__(self, N, init_val):
self.N0 = 2 ** (N - 1).bit_length()
# 0-indexedで管理
self.dat = [identity_element] * (2 * self.N0)
# 値を代入
for i in range(N):
self.dat[i + self.N0 - 1] = init_val[i]
# 構築
for i in range(self.N0 - 2, -1, -1):
self.dat[i] = segfunc(self.dat[2 * i + 1], self.dat[2 * i + 2])
# k番目の要素の値をxに変更
def update(self, k, x):
k += self.N0 - 1
self.dat[k] = x
while k >= 0:
k = (k - 1) // 2
self.dat[k] = segfunc(self.dat[2 * k + 1], self.dat[2 * k + 2])
# 区間[l,r)の最小値を求める
def query(self, l, r):
L = l + self.N0
R = r + self.N0
s = identity_element
# 区間を列挙しながら最小値を求める
while L < R:
if R & 1:
R -= 1
s = segfunc(s, self.dat[R - 1])
if L & 1:
s = segfunc(s, self.dat[L - 1])
L += 1
L >>= 1
R >>= 1
return s
# segfunc : min, +, *, xor, gcd など
# identity_element : 単位元(min:inf, 和:0, 積:1, xor:0, gcd:0)
def segfunc(x, y):
return min(x, y) # 変える
identity_element = 2**31 - 1 # 変える
def compress(arr):
(*XS,) = set(arr)
XS.sort()
return {e: i for i, e in enumerate(XS)}
n, q = list(map(int, input().split()))
s, t, x = [0] * n, [0] * n, [0] * n
for i in range(n):
s[i], t[i], x[i] = list(map(int, input().split()))
s[i] -= x[i]
t[i] -= x[i]
s[i] = max(s[i], 0)
t[i] = max(t[i], 0)
d = [int(eval(input())) for i in range(q)]
com = compress(s + t + d)
k = len(com) + 1
for i in range(n):
s[i] = com[s[i]]
t[i] = com[t[i]]
for i in range(q):
d[i] = com[d[i]]
INF = 1 << 30
a = [INF] * k
b = [[] for i in range(k)]
c = [[] for i in range(k)]
seg = Segment(n, [INF] * n)
for i in range(n):
b[s[i]].append(i)
c[t[i]].append(i)
for i in range(k):
for j in b[i]:
seg.update(j, x[j])
for j in c[i]:
seg.update(j, INF)
a[i] = seg.query(0, n)
for i in d:
print((-1 if a[i] == INF else a[i]))
| import sys
input = sys.stdin.readline
# Segment Tree
# segfunc : min, +, *, xor, gcd など
# identity_element : 単位元(min:inf, 和:0, 積:1, xor:0, gcd:0)
class Segment:
def __init__(self, N, init_val):
"""[セグメント木]
Args:
N ([int]): [要素数]
init_val ([list]): [初期化する値]
"""
self.identity_element = 2**31 - 1 # 変える
self.N0 = 1 << (N - 1).bit_length()
# 0-indexedで管理
self.dat = [self.identity_element] * (2 * self.N0)
# 値を代入
for i in range(N):
self.dat[i + self.N0 - 1] = init_val[i]
# 構築
for i in range(self.N0 - 2, -1, -1):
self.dat[i] = self.segfunc(self.dat[2 * i + 1], self.dat[2 * i + 2])
# k番目の要素の値をxに変更
def update(self, k, x):
k += self.N0 - 1
self.dat[k] = x
while k >= 0:
k = (k - 1) // 2
self.dat[k] = self.segfunc(self.dat[2 * k + 1], self.dat[2 * k + 2])
# 区間[l,r)の最小値を求める
def query(self, l, r):
L = l + self.N0
R = r + self.N0
s = self.identity_element
# 区間を列挙しながら最小値を求める
while L < R:
if R & 1:
R -= 1
s = self.segfunc(s, self.dat[R - 1])
if L & 1:
s = self.segfunc(s, self.dat[L - 1])
L += 1
L >>= 1
R >>= 1
return s
def segfunc(self, x, y):
return min(x, y) # 変える
def compress(arr):
(*XS,) = set(arr)
XS.sort()
return {e: i for i, e in enumerate(XS)}
n, q = list(map(int, input().split()))
s, t, x = [0] * n, [0] * n, [0] * n
for i in range(n):
s[i], t[i], x[i] = list(map(int, input().split()))
s[i] -= x[i]
t[i] -= x[i]
s[i] = max(s[i], 0)
t[i] = max(t[i], 0)
d = [int(eval(input())) for i in range(q)]
com = compress(s + t + d)
k = len(com) + 1
for i in range(n):
s[i] = com[s[i]]
t[i] = com[t[i]]
for i in range(q):
d[i] = com[d[i]]
INF = 1 << 30
a = [INF] * k
b = [[] for i in range(k)]
c = [[] for i in range(k)]
seg = Segment(n, [INF] * n)
for i in range(n):
b[s[i]].append(i)
c[t[i]].append(i)
for i in range(k):
for j in b[i]:
seg.update(j, x[j])
for j in c[i]:
seg.update(j, INF)
a[i] = seg.query(0, n)
for i in d:
print((-1 if a[i] == INF else a[i]))
| false | 2.020202 | [
"+# segfunc : min, +, *, xor, gcd など",
"+# identity_element : 単位元(min:inf, 和:0, 積:1, xor:0, gcd:0)",
"- self.N0 = 2 ** (N - 1).bit_length()",
"+ \"\"\"[セグメント木]",
"+ Args:",
"+ N ([int]): [要素数]",
"+ init_val ([list]): [初期化する値]",
"+ \"\"\"",
"+ self.identity_element = 2**31 - 1 # 変える",
"+ self.N0 = 1 << (N - 1).bit_length()",
"- self.dat = [identity_element] * (2 * self.N0)",
"+ self.dat = [self.identity_element] * (2 * self.N0)",
"- self.dat[i] = segfunc(self.dat[2 * i + 1], self.dat[2 * i + 2])",
"+ self.dat[i] = self.segfunc(self.dat[2 * i + 1], self.dat[2 * i + 2])",
"- self.dat[k] = segfunc(self.dat[2 * k + 1], self.dat[2 * k + 2])",
"+ self.dat[k] = self.segfunc(self.dat[2 * k + 1], self.dat[2 * k + 2])",
"- s = identity_element",
"+ s = self.identity_element",
"- s = segfunc(s, self.dat[R - 1])",
"+ s = self.segfunc(s, self.dat[R - 1])",
"- s = segfunc(s, self.dat[L - 1])",
"+ s = self.segfunc(s, self.dat[L - 1])",
"-",
"-# segfunc : min, +, *, xor, gcd など",
"-# identity_element : 単位元(min:inf, 和:0, 積:1, xor:0, gcd:0)",
"-def segfunc(x, y):",
"- return min(x, y) # 変える",
"-",
"-",
"-identity_element = 2**31 - 1 # 変える",
"+ def segfunc(self, x, y):",
"+ return min(x, y) # 変える"
]
| false | 0.00813 | 0.079954 | 0.101688 | [
"s242084712",
"s979525438"
]
|
u794173881 | p03832 | python | s982034753 | s223084499 | 1,958 | 1,454 | 102,732 | 102,092 | Accepted | Accepted | 25.74 | class Combination:
"""階乗とその逆元のテーブルをO(N)で事前作成し、組み合わせの計算をO(1)で行う"""
def __init__(self, n, MOD):
self.fact = [1]
for i in range(1, n + 1):
self.fact.append(self.fact[-1] * i % MOD)
self.inv_fact = [0] * (n + 1)
self.inv_fact[n] = pow(self.fact[n], MOD - 2, MOD)
for i in reversed(range(n)):
self.inv_fact[i] = self.inv_fact[i + 1] * (i + 1) % MOD
self.MOD = MOD
def factorial(self, k):
"""k!を求める O(1)"""
return self.fact[k]
def inverse_factorial(self, k):
"""k!の逆元を求める O(1)"""
return self.inv_fact[k]
def permutation(self, k, r):
"""kPrを求める O(1)"""
if k < r:
return 0
return (self.fact[k] * self.inv_fact[k - r]) % self.MOD
def combination(self, k, r):
"""kCrを求める O(1)"""
if k < r:
return 0
return (self.fact[k] * self.inv_fact[k - r] * self.inv_fact[r]) % self.MOD
def combination2(self, k, r):
"""kCrを求める O(r) kが大きいが、r <= nを満たしているときに使用"""
if k < r:
return 0
res = 1
for l in range(r):
res *= (k - l)
res %= self.MOD
return (res * self.inv_fact[r]) % self.MOD
n, a, b, c, d = map(int, input().split())
MOD = 10 ** 9 + 7
comb = Combination(10 ** 5, MOD)
dp = [[0] * (n + 1) for i in range(b - a + 2)]
dp[0][0] = 1
for i in range(b - a + 1):
per_g = i + a
for j in range(0, n + 1):
dp[i + 1][j] = dp[i][j]
for cnt_g in range(c, d + 1):
if j - cnt_g * per_g < 0:
break
dp[i + 1][j] += dp[i][j - cnt_g * per_g] * comb.combination(j, cnt_g * per_g)\
* comb.factorial(cnt_g * per_g) * (pow(comb.inverse_factorial(per_g), cnt_g, MOD))\
* comb.inverse_factorial(cnt_g)
dp[i + 1][j] %= MOD
print(dp[-1][-1])
| class Combination:
"""階乗とその逆元のテーブルをO(N)で事前作成し、組み合わせの計算をO(1)で行う"""
def __init__(self, n, MOD):
self.fact = [1]
for i in range(1, n + 1):
self.fact.append(self.fact[-1] * i % MOD)
self.inv_fact = [0] * (n + 1)
self.inv_fact[n] = pow(self.fact[n], MOD - 2, MOD)
for i in reversed(range(n)):
self.inv_fact[i] = self.inv_fact[i + 1] * (i + 1) % MOD
self.MOD = MOD
def factorial(self, k):
"""k!を求める O(1)"""
return self.fact[k]
def inverse_factorial(self, k):
"""k!の逆元を求める O(1)"""
return self.inv_fact[k]
def permutation(self, k, r):
"""kPrを求める O(1)"""
if k < r:
return 0
return (self.fact[k] * self.inv_fact[k - r]) % self.MOD
def combination(self, k, r):
"""kCrを求める O(1)"""
if k < r:
return 0
return (self.fact[k] * self.inv_fact[k - r] * self.inv_fact[r]) % self.MOD
def combination2(self, k, r):
"""kCrを求める O(r) kが大きいが、r <= nを満たしているときに使用"""
if k < r:
return 0
res = 1
for l in range(r):
res *= (k - l)
res %= self.MOD
return (res * self.inv_fact[r]) % self.MOD
n, a, b, c, d = map(int, input().split())
MOD = 10 ** 9 + 7
comb = Combination(10 ** 5, MOD)
dp = [[0] * (n + 1) for i in range(b - a + 2)]
dp[0][0] = 1
for i in range(b - a + 1):
per_g = i + a
pow_ = pow(comb.inverse_factorial(per_g), c - 1, MOD)
for j in range(0, n + 1):
dp[i + 1][j] = dp[i][j]
p = pow_
for cnt_g in range(c, d + 1):
if j - cnt_g * per_g < 0:
break
p *= comb.inverse_factorial(per_g)
p %= MOD
dp[i + 1][j] += dp[i][j - cnt_g * per_g] * comb.combination(j, cnt_g * per_g)\
* comb.factorial(cnt_g * per_g) * p\
* comb.inverse_factorial(cnt_g)
dp[i + 1][j] %= MOD
print(dp[-1][-1])
| 62 | 66 | 1,978 | 2,078 | class Combination:
"""階乗とその逆元のテーブルをO(N)で事前作成し、組み合わせの計算をO(1)で行う"""
def __init__(self, n, MOD):
self.fact = [1]
for i in range(1, n + 1):
self.fact.append(self.fact[-1] * i % MOD)
self.inv_fact = [0] * (n + 1)
self.inv_fact[n] = pow(self.fact[n], MOD - 2, MOD)
for i in reversed(range(n)):
self.inv_fact[i] = self.inv_fact[i + 1] * (i + 1) % MOD
self.MOD = MOD
def factorial(self, k):
"""k!を求める O(1)"""
return self.fact[k]
def inverse_factorial(self, k):
"""k!の逆元を求める O(1)"""
return self.inv_fact[k]
def permutation(self, k, r):
"""kPrを求める O(1)"""
if k < r:
return 0
return (self.fact[k] * self.inv_fact[k - r]) % self.MOD
def combination(self, k, r):
"""kCrを求める O(1)"""
if k < r:
return 0
return (self.fact[k] * self.inv_fact[k - r] * self.inv_fact[r]) % self.MOD
def combination2(self, k, r):
"""kCrを求める O(r) kが大きいが、r <= nを満たしているときに使用"""
if k < r:
return 0
res = 1
for l in range(r):
res *= k - l
res %= self.MOD
return (res * self.inv_fact[r]) % self.MOD
n, a, b, c, d = map(int, input().split())
MOD = 10**9 + 7
comb = Combination(10**5, MOD)
dp = [[0] * (n + 1) for i in range(b - a + 2)]
dp[0][0] = 1
for i in range(b - a + 1):
per_g = i + a
for j in range(0, n + 1):
dp[i + 1][j] = dp[i][j]
for cnt_g in range(c, d + 1):
if j - cnt_g * per_g < 0:
break
dp[i + 1][j] += (
dp[i][j - cnt_g * per_g]
* comb.combination(j, cnt_g * per_g)
* comb.factorial(cnt_g * per_g)
* (pow(comb.inverse_factorial(per_g), cnt_g, MOD))
* comb.inverse_factorial(cnt_g)
)
dp[i + 1][j] %= MOD
print(dp[-1][-1])
| class Combination:
"""階乗とその逆元のテーブルをO(N)で事前作成し、組み合わせの計算をO(1)で行う"""
def __init__(self, n, MOD):
self.fact = [1]
for i in range(1, n + 1):
self.fact.append(self.fact[-1] * i % MOD)
self.inv_fact = [0] * (n + 1)
self.inv_fact[n] = pow(self.fact[n], MOD - 2, MOD)
for i in reversed(range(n)):
self.inv_fact[i] = self.inv_fact[i + 1] * (i + 1) % MOD
self.MOD = MOD
def factorial(self, k):
"""k!を求める O(1)"""
return self.fact[k]
def inverse_factorial(self, k):
"""k!の逆元を求める O(1)"""
return self.inv_fact[k]
def permutation(self, k, r):
"""kPrを求める O(1)"""
if k < r:
return 0
return (self.fact[k] * self.inv_fact[k - r]) % self.MOD
def combination(self, k, r):
"""kCrを求める O(1)"""
if k < r:
return 0
return (self.fact[k] * self.inv_fact[k - r] * self.inv_fact[r]) % self.MOD
def combination2(self, k, r):
"""kCrを求める O(r) kが大きいが、r <= nを満たしているときに使用"""
if k < r:
return 0
res = 1
for l in range(r):
res *= k - l
res %= self.MOD
return (res * self.inv_fact[r]) % self.MOD
n, a, b, c, d = map(int, input().split())
MOD = 10**9 + 7
comb = Combination(10**5, MOD)
dp = [[0] * (n + 1) for i in range(b - a + 2)]
dp[0][0] = 1
for i in range(b - a + 1):
per_g = i + a
pow_ = pow(comb.inverse_factorial(per_g), c - 1, MOD)
for j in range(0, n + 1):
dp[i + 1][j] = dp[i][j]
p = pow_
for cnt_g in range(c, d + 1):
if j - cnt_g * per_g < 0:
break
p *= comb.inverse_factorial(per_g)
p %= MOD
dp[i + 1][j] += (
dp[i][j - cnt_g * per_g]
* comb.combination(j, cnt_g * per_g)
* comb.factorial(cnt_g * per_g)
* p
* comb.inverse_factorial(cnt_g)
)
dp[i + 1][j] %= MOD
print(dp[-1][-1])
| false | 6.060606 | [
"+ pow_ = pow(comb.inverse_factorial(per_g), c - 1, MOD)",
"+ p = pow_",
"+ p *= comb.inverse_factorial(per_g)",
"+ p %= MOD",
"- * (pow(comb.inverse_factorial(per_g), cnt_g, MOD))",
"+ * p"
]
| false | 0.032327 | 0.037702 | 0.85743 | [
"s982034753",
"s223084499"
]
|
u579699847 | p03253 | python | s400037086 | s622501339 | 167 | 25 | 38,640 | 3,436 | Accepted | Accepted | 85.03 | import collections,sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,M = LI()
ans = 1
def prime_factor(num):
prime_factor = collections.defaultdict(int)
for i in range(2,int(num**0.5)+1):
while num%i==0:
prime_factor[i] += 1
num //= i
if num>1:
prime_factor[num]=1
return prime_factor
def nCr(n,r,mod):
comb_count = 1
for i in range(r):
comb_count *= n-i
comb_count %= mod
for j in range(1,r+1):
comb_count *= pow(j,mod-2,mod)
comb_count %= mod
return comb_count
for v in list(prime_factor(M).values()):
ans *= nCr(v+N-1,v,10**9+7)
ans %= 10**9+7
print(ans)
| import collections,sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,M = LI()
ans = 1
def prime_factor(num):
prime_factor = collections.defaultdict(int)
for i in range(2,int(num**0.5)+1):
while num%i==0:
prime_factor[i] += 1
num //= i
if num>1:
prime_factor[num]=1
return prime_factor
def nCr(n,r,mod):
comb_count = 1
for i in range(r):
comb_count *= n-i
comb_count %= mod
for i in range(1,r+1):
comb_count *= pow(i,mod-2,mod)
comb_count %= mod
return comb_count
for v in list(prime_factor(M).values()):
ans *= nCr(v+N-1,v,10**9+7)
ans %= 10**9+7
print(ans)
| 26 | 26 | 715 | 715 | import collections, sys
def LI():
return list(map(int, sys.stdin.readline().rstrip().split()))
N, M = LI()
ans = 1
def prime_factor(num):
prime_factor = collections.defaultdict(int)
for i in range(2, int(num**0.5) + 1):
while num % i == 0:
prime_factor[i] += 1
num //= i
if num > 1:
prime_factor[num] = 1
return prime_factor
def nCr(n, r, mod):
comb_count = 1
for i in range(r):
comb_count *= n - i
comb_count %= mod
for j in range(1, r + 1):
comb_count *= pow(j, mod - 2, mod)
comb_count %= mod
return comb_count
for v in list(prime_factor(M).values()):
ans *= nCr(v + N - 1, v, 10**9 + 7)
ans %= 10**9 + 7
print(ans)
| import collections, sys
def LI():
return list(map(int, sys.stdin.readline().rstrip().split()))
N, M = LI()
ans = 1
def prime_factor(num):
prime_factor = collections.defaultdict(int)
for i in range(2, int(num**0.5) + 1):
while num % i == 0:
prime_factor[i] += 1
num //= i
if num > 1:
prime_factor[num] = 1
return prime_factor
def nCr(n, r, mod):
comb_count = 1
for i in range(r):
comb_count *= n - i
comb_count %= mod
for i in range(1, r + 1):
comb_count *= pow(i, mod - 2, mod)
comb_count %= mod
return comb_count
for v in list(prime_factor(M).values()):
ans *= nCr(v + N - 1, v, 10**9 + 7)
ans %= 10**9 + 7
print(ans)
| false | 0 | [
"- for j in range(1, r + 1):",
"- comb_count *= pow(j, mod - 2, mod)",
"+ for i in range(1, r + 1):",
"+ comb_count *= pow(i, mod - 2, mod)"
]
| false | 0.154523 | 0.047561 | 3.248943 | [
"s400037086",
"s622501339"
]
|
u515740713 | p02616 | python | s253185704 | s243862356 | 256 | 236 | 31,716 | 27,832 | Accepted | Accepted | 7.81 | MOD = (10 ** 9) + 7
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
negs = [-x for x in a if x < 0]
non_negs = [x for x in a if x >= 0]
if len(non_negs) == 0 and k % 2 == 1:
negs.sort()
ans = 1
for i in range(k):
ans = ans * -negs[i] % MOD
print(ans)
exit()
negs_p, non_negs_p = 0, 0
negs.sort(reverse = True)
non_negs.sort(reverse = True)
for i in range(k):
if negs_p == len(negs):
non_negs_p += 1
elif non_negs_p == len(non_negs):
negs_p += 1
elif negs[negs_p] > non_negs[non_negs_p]:
negs_p += 1
else:
non_negs_p += 1
if negs_p % 2 == 0 or k == n:
ans = 1
for i in range(negs_p):
ans = ans * -negs[i] % MOD
for i in range(non_negs_p):
ans = ans * non_negs[i] % MOD
print(ans)
exit()
if negs_p == len(negs) or non_negs_p == 0:
negs_p -= 1
non_negs_p += 1
ans = 1
for i in range(negs_p):
ans = ans * -negs[i] % MOD
for i in range(non_negs_p):
ans = ans * non_negs[i] % MOD
print(ans)
exit()
if non_negs_p == len(non_negs) or negs_p == 0:
negs_p += 1
non_negs_p -= 1
ans = 1
for i in range(negs_p):
ans = ans * -negs[i] % MOD
for i in range(non_negs_p):
ans = ans * non_negs[i] % MOD
print(ans)
exit()
a = negs[negs_p - 1]
b = negs[negs_p]
c = non_negs[non_negs_p - 1]
d = non_negs[non_negs_p]
if a * b > c * d:
negs_p += 1
non_negs_p -= 1
else:
negs_p -= 1
non_negs_p += 1
ans = 1
for i in range(negs_p):
ans = ans * -negs[i] % MOD
for i in range(non_negs_p):
ans = ans * non_negs[i] % MOD
print(ans) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, K = list(map(int, readline().split()))
A = list(map(int,readline().split()))
MOD = 10**9 +7
B = []
C = []
for a in A:
if a >= 0:
B.append(a)
else:
C.append(-a)
ans = 1
if len(B) == 0 and K % 2 == 1:
C = sorted(C)
for i in range(K):
ans *= -C[i]
ans %= MOD
print(ans)
sys.exit()
negs_p = 0
non_negs_p = 0
B = sorted(B,reverse = True)
C = sorted(C,reverse = True)
for i in range(K):
if negs_p == len(C):
non_negs_p += 1
elif non_negs_p == len(B):
negs_p += 1
elif C[negs_p] > B[non_negs_p]:
negs_p += 1
else:
non_negs_p += 1
if N == K or negs_p % 2 == 0:
for i in range(non_negs_p):
ans = ans * B[i] % MOD
for i in range(negs_p):
ans = ans * -C[i] % MOD
print(ans)
sys.exit()
if negs_p % 2 == 1:
if negs_p == len(C) or non_negs_p == 0:
negs_p -= 1
non_negs_p += 1
for i in range(non_negs_p):
ans = ans * B[i] % MOD
for i in range(negs_p):
ans = ans * -C[i] % MOD
elif non_negs_p == len(B) or negs_p == 0:
negs_p += 1
non_negs_p -= 1
for i in range(non_negs_p):
ans = ans * B[i] % MOD
for i in range(negs_p):
ans = ans * -C[i] % MOD
else:
a,b,c,d = C[negs_p],C[negs_p-1],B[non_negs_p],B[non_negs_p-1]
if a*b > c*d:
negs_p += 1
non_negs_p -= 1
else:
negs_p -= 1
non_negs_p += 1
for i in range(non_negs_p):
ans = ans * B[i] % MOD
for i in range(negs_p):
ans = ans * -C[i] % MOD
print(ans)
| 80 | 81 | 1,750 | 1,916 | MOD = (10**9) + 7
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
negs = [-x for x in a if x < 0]
non_negs = [x for x in a if x >= 0]
if len(non_negs) == 0 and k % 2 == 1:
negs.sort()
ans = 1
for i in range(k):
ans = ans * -negs[i] % MOD
print(ans)
exit()
negs_p, non_negs_p = 0, 0
negs.sort(reverse=True)
non_negs.sort(reverse=True)
for i in range(k):
if negs_p == len(negs):
non_negs_p += 1
elif non_negs_p == len(non_negs):
negs_p += 1
elif negs[negs_p] > non_negs[non_negs_p]:
negs_p += 1
else:
non_negs_p += 1
if negs_p % 2 == 0 or k == n:
ans = 1
for i in range(negs_p):
ans = ans * -negs[i] % MOD
for i in range(non_negs_p):
ans = ans * non_negs[i] % MOD
print(ans)
exit()
if negs_p == len(negs) or non_negs_p == 0:
negs_p -= 1
non_negs_p += 1
ans = 1
for i in range(negs_p):
ans = ans * -negs[i] % MOD
for i in range(non_negs_p):
ans = ans * non_negs[i] % MOD
print(ans)
exit()
if non_negs_p == len(non_negs) or negs_p == 0:
negs_p += 1
non_negs_p -= 1
ans = 1
for i in range(negs_p):
ans = ans * -negs[i] % MOD
for i in range(non_negs_p):
ans = ans * non_negs[i] % MOD
print(ans)
exit()
a = negs[negs_p - 1]
b = negs[negs_p]
c = non_negs[non_negs_p - 1]
d = non_negs[non_negs_p]
if a * b > c * d:
negs_p += 1
non_negs_p -= 1
else:
negs_p -= 1
non_negs_p += 1
ans = 1
for i in range(negs_p):
ans = ans * -negs[i] % MOD
for i in range(non_negs_p):
ans = ans * non_negs[i] % MOD
print(ans)
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, K = list(map(int, readline().split()))
A = list(map(int, readline().split()))
MOD = 10**9 + 7
B = []
C = []
for a in A:
if a >= 0:
B.append(a)
else:
C.append(-a)
ans = 1
if len(B) == 0 and K % 2 == 1:
C = sorted(C)
for i in range(K):
ans *= -C[i]
ans %= MOD
print(ans)
sys.exit()
negs_p = 0
non_negs_p = 0
B = sorted(B, reverse=True)
C = sorted(C, reverse=True)
for i in range(K):
if negs_p == len(C):
non_negs_p += 1
elif non_negs_p == len(B):
negs_p += 1
elif C[negs_p] > B[non_negs_p]:
negs_p += 1
else:
non_negs_p += 1
if N == K or negs_p % 2 == 0:
for i in range(non_negs_p):
ans = ans * B[i] % MOD
for i in range(negs_p):
ans = ans * -C[i] % MOD
print(ans)
sys.exit()
if negs_p % 2 == 1:
if negs_p == len(C) or non_negs_p == 0:
negs_p -= 1
non_negs_p += 1
for i in range(non_negs_p):
ans = ans * B[i] % MOD
for i in range(negs_p):
ans = ans * -C[i] % MOD
elif non_negs_p == len(B) or negs_p == 0:
negs_p += 1
non_negs_p -= 1
for i in range(non_negs_p):
ans = ans * B[i] % MOD
for i in range(negs_p):
ans = ans * -C[i] % MOD
else:
a, b, c, d = C[negs_p], C[negs_p - 1], B[non_negs_p], B[non_negs_p - 1]
if a * b > c * d:
negs_p += 1
non_negs_p -= 1
else:
negs_p -= 1
non_negs_p += 1
for i in range(non_negs_p):
ans = ans * B[i] % MOD
for i in range(negs_p):
ans = ans * -C[i] % MOD
print(ans)
| false | 1.234568 | [
"-MOD = (10**9) + 7",
"-n, k = list(map(int, input().split()))",
"-a = list(map(int, input().split()))",
"-negs = [-x for x in a if x < 0]",
"-non_negs = [x for x in a if x >= 0]",
"-if len(non_negs) == 0 and k % 2 == 1:",
"- negs.sort()",
"- ans = 1",
"- for i in range(k):",
"- ans = ans * -negs[i] % MOD",
"+import sys",
"+",
"+read = sys.stdin.buffer.read",
"+readline = sys.stdin.buffer.readline",
"+readlines = sys.stdin.buffer.readlines",
"+N, K = list(map(int, readline().split()))",
"+A = list(map(int, readline().split()))",
"+MOD = 10**9 + 7",
"+B = []",
"+C = []",
"+for a in A:",
"+ if a >= 0:",
"+ B.append(a)",
"+ else:",
"+ C.append(-a)",
"+ans = 1",
"+if len(B) == 0 and K % 2 == 1:",
"+ C = sorted(C)",
"+ for i in range(K):",
"+ ans *= -C[i]",
"+ ans %= MOD",
"- exit()",
"-negs_p, non_negs_p = 0, 0",
"-negs.sort(reverse=True)",
"-non_negs.sort(reverse=True)",
"-for i in range(k):",
"- if negs_p == len(negs):",
"+ sys.exit()",
"+negs_p = 0",
"+non_negs_p = 0",
"+B = sorted(B, reverse=True)",
"+C = sorted(C, reverse=True)",
"+for i in range(K):",
"+ if negs_p == len(C):",
"- elif non_negs_p == len(non_negs):",
"+ elif non_negs_p == len(B):",
"- elif negs[negs_p] > non_negs[non_negs_p]:",
"+ elif C[negs_p] > B[non_negs_p]:",
"-if negs_p % 2 == 0 or k == n:",
"- ans = 1",
"+if N == K or negs_p % 2 == 0:",
"+ for i in range(non_negs_p):",
"+ ans = ans * B[i] % MOD",
"- ans = ans * -negs[i] % MOD",
"- for i in range(non_negs_p):",
"- ans = ans * non_negs[i] % MOD",
"+ ans = ans * -C[i] % MOD",
"- exit()",
"-if negs_p == len(negs) or non_negs_p == 0:",
"- negs_p -= 1",
"- non_negs_p += 1",
"- ans = 1",
"- for i in range(negs_p):",
"- ans = ans * -negs[i] % MOD",
"- for i in range(non_negs_p):",
"- ans = ans * non_negs[i] % MOD",
"- print(ans)",
"- exit()",
"-if non_negs_p == len(non_negs) or negs_p == 0:",
"- negs_p += 1",
"- non_negs_p -= 1",
"- ans = 1",
"- for i in range(negs_p):",
"- ans = ans * -negs[i] % MOD",
"- for i in range(non_negs_p):",
"- ans = ans * non_negs[i] % MOD",
"- print(ans)",
"- exit()",
"-a = negs[negs_p - 1]",
"-b = negs[negs_p]",
"-c = non_negs[non_negs_p - 1]",
"-d = non_negs[non_negs_p]",
"-if a * b > c * d:",
"- negs_p += 1",
"- non_negs_p -= 1",
"-else:",
"- negs_p -= 1",
"- non_negs_p += 1",
"-ans = 1",
"-for i in range(negs_p):",
"- ans = ans * -negs[i] % MOD",
"-for i in range(non_negs_p):",
"- ans = ans * non_negs[i] % MOD",
"+ sys.exit()",
"+if negs_p % 2 == 1:",
"+ if negs_p == len(C) or non_negs_p == 0:",
"+ negs_p -= 1",
"+ non_negs_p += 1",
"+ for i in range(non_negs_p):",
"+ ans = ans * B[i] % MOD",
"+ for i in range(negs_p):",
"+ ans = ans * -C[i] % MOD",
"+ elif non_negs_p == len(B) or negs_p == 0:",
"+ negs_p += 1",
"+ non_negs_p -= 1",
"+ for i in range(non_negs_p):",
"+ ans = ans * B[i] % MOD",
"+ for i in range(negs_p):",
"+ ans = ans * -C[i] % MOD",
"+ else:",
"+ a, b, c, d = C[negs_p], C[negs_p - 1], B[non_negs_p], B[non_negs_p - 1]",
"+ if a * b > c * d:",
"+ negs_p += 1",
"+ non_negs_p -= 1",
"+ else:",
"+ negs_p -= 1",
"+ non_negs_p += 1",
"+ for i in range(non_negs_p):",
"+ ans = ans * B[i] % MOD",
"+ for i in range(negs_p):",
"+ ans = ans * -C[i] % MOD"
]
| false | 0.112474 | 0.112725 | 0.99778 | [
"s253185704",
"s243862356"
]
|
u761989513 | p03048 | python | s460895814 | s359720417 | 298 | 19 | 41,452 | 3,060 | Accepted | Accepted | 93.62 | R, G, B, n = list(map(int, input().split()))
ans = 0
for r in range(n // R + 1):
for g in range((n - r) // G + 1):
if (n - r * R - g * G) % B == 0:
b = (n - r * R - g * G) / B
if b >= 0:
ans += 1
print(ans) | r, g, b, n = list(map(int, input().split()))
a = [0] * (n + 1)
a[0] = 1
for i in [r, g, b]:
for j in range(n + 1 - i):
a[i + j] += a[j]
print((a[n])) | 9 | 7 | 260 | 159 | R, G, B, n = list(map(int, input().split()))
ans = 0
for r in range(n // R + 1):
for g in range((n - r) // G + 1):
if (n - r * R - g * G) % B == 0:
b = (n - r * R - g * G) / B
if b >= 0:
ans += 1
print(ans)
| r, g, b, n = list(map(int, input().split()))
a = [0] * (n + 1)
a[0] = 1
for i in [r, g, b]:
for j in range(n + 1 - i):
a[i + j] += a[j]
print((a[n]))
| false | 22.222222 | [
"-R, G, B, n = list(map(int, input().split()))",
"-ans = 0",
"-for r in range(n // R + 1):",
"- for g in range((n - r) // G + 1):",
"- if (n - r * R - g * G) % B == 0:",
"- b = (n - r * R - g * G) / B",
"- if b >= 0:",
"- ans += 1",
"-print(ans)",
"+r, g, b, n = list(map(int, input().split()))",
"+a = [0] * (n + 1)",
"+a[0] = 1",
"+for i in [r, g, b]:",
"+ for j in range(n + 1 - i):",
"+ a[i + j] += a[j]",
"+print((a[n]))"
]
| false | 0.141425 | 0.037512 | 3.770112 | [
"s460895814",
"s359720417"
]
|
u652057333 | p02632 | python | s591872987 | s189815195 | 1,654 | 367 | 166,584 | 166,576 | Accepted | Accepted | 77.81 | k = int(eval(input()))
s = eval(input())
MOD = 10**9+7
class Facts():
# O(max_num)
def __init__(self, max_num=10**5, p=10**9 + 7):
self.p = p
self.max_num = max_num
self.fact = [1] * (self.max_num + 1)
for i in range(1, self.max_num + 1):
self.fact[i] = self.fact[i-1] * i
self.fact[i] %= self.p
def comb(self, n, k):
# nCk mod p with memo
# O(log(p))
if n < 0 or k < 0 or n < k:
return 0
if n == 0 or k == 0:
return 1
a = self.fact[n]
b = self.fact[k]
c = self.fact[n-k]
return (a*self.power_func(b, self.p-2) *
self.power_func(c, self.p-2)) % self.p
def power_func(self, a, b):
# a^b mod p
# O(log(b))
ans = 1
while b > 0:
if b & 1:
ans = ans * a % self.p
a = a * a % self.p
b >>= 1
return ans
r26 = [1 for _ in range(k + 1)]
r25 = [1 for _ in range(k + 1)]
for i in range(1, k+1):
r26[i] = (r26[i-1] * 26) % MOD
r25[i] = (r25[i-1] * 25) % MOD
facts = Facts(max_num=len(s)+k+1, p=MOD)
total = len(s) + k
ans = 0
for s_n in range(len(s), total+1):
d = total - s_n
ans += facts.comb(total - d - 1, len(s) - 1) * r25[k-d] * r26[d]
ans %= MOD
print(ans)
| k = int(eval(input()))
s = eval(input())
MOD = 10**9+7
class Facts():
# O(max_num)
def __init__(self, max_num=10**5, p=10**9+7):
self.p = p
self.max_num = max_num
self.fact = [1] * (self.max_num + 1)
self.rev = [1] * (self.max_num + 1)
for i in range(1, self.max_num + 1):
self.fact[i] = (self.fact[i-1] * i) % self.p
self.rev[self.max_num] = self.power_func(self.fact[self.max_num], self.p-2)
for i in range(self.max_num-1, 0, -1):
self.rev[i] = self.rev[i+1] * (i + 1) % self.p
def comb(self, n, k):
if n < 0 or k < 0 or n < k:
return 0
if n == 0 or k == 0:
return 1
res = ((self.fact[n] * self.rev[k] % self.p) *
self.rev[n - k]) % self.p
return res
def power_func(self, a, b):
# a^b mod p
# O(log(b))
ans = 1
while b > 0:
if b & 1:
ans = ans * a % self.p
a = a * a % self.p
b >>= 1
return ans
r26 = [1 for _ in range(k + 1)]
r25 = [1 for _ in range(k + 1)]
for i in range(1, k+1):
r26[i] = (r26[i-1] * 26) % MOD
r25[i] = (r25[i-1] * 25) % MOD
facts = Facts(max_num=len(s)+k+1, p=MOD)
total = len(s) + k
ans = 0
for s_n in range(len(s), total+1):
d = total - s_n
ans += facts.comb(total - d - 1, len(s) - 1) * r25[k-d] * r26[d]
ans %= MOD
print(ans)
| 53 | 52 | 1,381 | 1,415 | k = int(eval(input()))
s = eval(input())
MOD = 10**9 + 7
class Facts:
# O(max_num)
def __init__(self, max_num=10**5, p=10**9 + 7):
self.p = p
self.max_num = max_num
self.fact = [1] * (self.max_num + 1)
for i in range(1, self.max_num + 1):
self.fact[i] = self.fact[i - 1] * i
self.fact[i] %= self.p
def comb(self, n, k):
# nCk mod p with memo
# O(log(p))
if n < 0 or k < 0 or n < k:
return 0
if n == 0 or k == 0:
return 1
a = self.fact[n]
b = self.fact[k]
c = self.fact[n - k]
return (
a * self.power_func(b, self.p - 2) * self.power_func(c, self.p - 2)
) % self.p
def power_func(self, a, b):
# a^b mod p
# O(log(b))
ans = 1
while b > 0:
if b & 1:
ans = ans * a % self.p
a = a * a % self.p
b >>= 1
return ans
r26 = [1 for _ in range(k + 1)]
r25 = [1 for _ in range(k + 1)]
for i in range(1, k + 1):
r26[i] = (r26[i - 1] * 26) % MOD
r25[i] = (r25[i - 1] * 25) % MOD
facts = Facts(max_num=len(s) + k + 1, p=MOD)
total = len(s) + k
ans = 0
for s_n in range(len(s), total + 1):
d = total - s_n
ans += facts.comb(total - d - 1, len(s) - 1) * r25[k - d] * r26[d]
ans %= MOD
print(ans)
| k = int(eval(input()))
s = eval(input())
MOD = 10**9 + 7
class Facts:
# O(max_num)
def __init__(self, max_num=10**5, p=10**9 + 7):
self.p = p
self.max_num = max_num
self.fact = [1] * (self.max_num + 1)
self.rev = [1] * (self.max_num + 1)
for i in range(1, self.max_num + 1):
self.fact[i] = (self.fact[i - 1] * i) % self.p
self.rev[self.max_num] = self.power_func(self.fact[self.max_num], self.p - 2)
for i in range(self.max_num - 1, 0, -1):
self.rev[i] = self.rev[i + 1] * (i + 1) % self.p
def comb(self, n, k):
if n < 0 or k < 0 or n < k:
return 0
if n == 0 or k == 0:
return 1
res = ((self.fact[n] * self.rev[k] % self.p) * self.rev[n - k]) % self.p
return res
def power_func(self, a, b):
# a^b mod p
# O(log(b))
ans = 1
while b > 0:
if b & 1:
ans = ans * a % self.p
a = a * a % self.p
b >>= 1
return ans
r26 = [1 for _ in range(k + 1)]
r25 = [1 for _ in range(k + 1)]
for i in range(1, k + 1):
r26[i] = (r26[i - 1] * 26) % MOD
r25[i] = (r25[i - 1] * 25) % MOD
facts = Facts(max_num=len(s) + k + 1, p=MOD)
total = len(s) + k
ans = 0
for s_n in range(len(s), total + 1):
d = total - s_n
ans += facts.comb(total - d - 1, len(s) - 1) * r25[k - d] * r26[d]
ans %= MOD
print(ans)
| false | 1.886792 | [
"+ self.rev = [1] * (self.max_num + 1)",
"- self.fact[i] = self.fact[i - 1] * i",
"- self.fact[i] %= self.p",
"+ self.fact[i] = (self.fact[i - 1] * i) % self.p",
"+ self.rev[self.max_num] = self.power_func(self.fact[self.max_num], self.p - 2)",
"+ for i in range(self.max_num - 1, 0, -1):",
"+ self.rev[i] = self.rev[i + 1] * (i + 1) % self.p",
"- # nCk mod p with memo",
"- # O(log(p))",
"- a = self.fact[n]",
"- b = self.fact[k]",
"- c = self.fact[n - k]",
"- return (",
"- a * self.power_func(b, self.p - 2) * self.power_func(c, self.p - 2)",
"- ) % self.p",
"+ res = ((self.fact[n] * self.rev[k] % self.p) * self.rev[n - k]) % self.p",
"+ return res"
]
| false | 0.038056 | 0.038076 | 0.999458 | [
"s591872987",
"s189815195"
]
|
u179169725 | p03311 | python | s993412088 | s719119096 | 274 | 122 | 31,356 | 33,104 | Accepted | Accepted | 55.47 | import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
def read_tuple(H):
'''
H is number of rows
'''
ret = []
for _ in range(H):
ret.append(tuple(map(int, read().split())))
return ret
def read_col(H):
'''
H is number of rows
A列、B列が与えられるようなとき
ex1)A,B=read_col(H) ex2) A,=read_col(H) #一列の場合
'''
ret = []
for _ in range(H):
ret.append(list(map(int, read().split())))
return tuple(map(list, list(zip(*ret))))
def read_matrix(H):
'''
H is number of rows
'''
ret = []
for _ in range(H):
ret.append(list(map(int, read().split())))
return ret
# return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため
MOD = 10**9 + 7
INF = 2**31 # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right # , insort_left, insort_right
# https://atcoder.jp/contests/arc100/tasks/arc100_a
N = read_a_int()
A = read_ints()
# Ai-iをBiとする
# Σ|Bi - b|を最小化するはBiの中央値(ということを経験的に知っている)(二部探索してみればいいこと)
B = []
for i, a in enu(A, start=1):
B.append(a - i)
import numpy as np
b = np.median(B)
ans = 0
print((int(np.abs(np.array(B) - b).sum())))
| import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
import numpy as np
from functools import partial
array = partial(np.array, dtype=np.int64)
zeros = partial(np.zeros, dtype=np.int64)
full = partial(np.full, dtype=np.int64)
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと
def a_int(): return int(readline())
def ints(): return np.fromstring(readline(), sep=' ', dtype=np.int64)
def read_matrix(H, W):
'''return np.ndarray shape=(H,W) matrix'''
lines = []
for _ in range(H):
lines.append(read())
lines = ' '.join(lines) # byte同士の結合ができないのでreadlineでなくreadで
return np.fromstring(lines, sep=' ', dtype=np.int64).reshape(H, W)
def read_col(H):
'''H is number of rows
A列、B列が与えられるようなとき
ex1)A,B=read_col(H) ex2) A,=read_col(H) #一列の場合'''
ret = []
for _ in range(H):
ret.append(list(map(int, readline().split())))
return tuple(map(list, zip(*ret)))
def read_tuple(H):
'''H is number of rows'''
ret = []
for _ in range(H):
ret.append(tuple(map(int, readline().split())))
return ret
MOD = 10**9 + 7
INF = 2**31 # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter, xor, add
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right # , insort_left, insort_right
from functools import reduce
from math import gcd
def lcm(a, b):
# 最小公倍数
g = gcd(a, b)
return a // g * b
N = a_int()
A = ints()
B = A - np.arange(1, N + 1)
b = int(np.median(B))
print(np.abs(B - b).sum())
| 70 | 80 | 1,525 | 1,896 | import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
def read_tuple(H):
"""
H is number of rows
"""
ret = []
for _ in range(H):
ret.append(tuple(map(int, read().split())))
return ret
def read_col(H):
"""
H is number of rows
A列、B列が与えられるようなとき
ex1)A,B=read_col(H) ex2) A,=read_col(H) #一列の場合
"""
ret = []
for _ in range(H):
ret.append(list(map(int, read().split())))
return tuple(map(list, list(zip(*ret))))
def read_matrix(H):
"""
H is number of rows
"""
ret = []
for _ in range(H):
ret.append(list(map(int, read().split())))
return ret
# return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため
MOD = 10**9 + 7
INF = 2**31 # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right # , insort_left, insort_right
# https://atcoder.jp/contests/arc100/tasks/arc100_a
N = read_a_int()
A = read_ints()
# Ai-iをBiとする
# Σ|Bi - b|を最小化するはBiの中央値(ということを経験的に知っている)(二部探索してみればいいこと)
B = []
for i, a in enu(A, start=1):
B.append(a - i)
import numpy as np
b = np.median(B)
ans = 0
print((int(np.abs(np.array(B) - b).sum())))
| import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
import numpy as np
from functools import partial
array = partial(np.array, dtype=np.int64)
zeros = partial(np.zeros, dtype=np.int64)
full = partial(np.full, dtype=np.int64)
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1):
return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと
def a_int():
return int(readline())
def ints():
return np.fromstring(readline(), sep=" ", dtype=np.int64)
def read_matrix(H, W):
"""return np.ndarray shape=(H,W) matrix"""
lines = []
for _ in range(H):
lines.append(read())
lines = " ".join(lines) # byte同士の結合ができないのでreadlineでなくreadで
return np.fromstring(lines, sep=" ", dtype=np.int64).reshape(H, W)
def read_col(H):
"""H is number of rows
A列、B列が与えられるようなとき
ex1)A,B=read_col(H) ex2) A,=read_col(H) #一列の場合"""
ret = []
for _ in range(H):
ret.append(list(map(int, readline().split())))
return tuple(map(list, zip(*ret)))
def read_tuple(H):
"""H is number of rows"""
ret = []
for _ in range(H):
ret.append(tuple(map(int, readline().split())))
return ret
MOD = 10**9 + 7
INF = 2**31 # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter, xor, add
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right # , insort_left, insort_right
from functools import reduce
from math import gcd
def lcm(a, b):
# 最小公倍数
g = gcd(a, b)
return a // g * b
N = a_int()
A = ints()
B = A - np.arange(1, N + 1)
b = int(np.median(B))
print(np.abs(B - b).sum())
| false | 12.5 | [
"-read = sys.stdin.readline",
"+readline = sys.stdin.buffer.readline",
"+read = sys.stdin.readline # 文字列読み込む時はこっち",
"+import numpy as np",
"+from functools import partial",
"+",
"+array = partial(np.array, dtype=np.int64)",
"+zeros = partial(np.zeros, dtype=np.int64)",
"+full = partial(np.full, dtype=np.int64)",
"-def read_ints():",
"- return list(map(int, read().split()))",
"+def exit(*argv, **kwarg):",
"+ print(*argv, **kwarg)",
"+ sys.exit()",
"-def read_a_int():",
"- return int(read())",
"+def mina(*argv, sub=1):",
"+ return list(map(lambda x: x - sub, argv))",
"+",
"+",
"+# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと",
"+def a_int():",
"+ return int(readline())",
"+",
"+",
"+def ints():",
"+ return np.fromstring(readline(), sep=\" \", dtype=np.int64)",
"+",
"+",
"+def read_matrix(H, W):",
"+ \"\"\"return np.ndarray shape=(H,W) matrix\"\"\"",
"+ lines = []",
"+ for _ in range(H):",
"+ lines.append(read())",
"+ lines = \" \".join(lines) # byte同士の結合ができないのでreadlineでなくreadで",
"+ return np.fromstring(lines, sep=\" \", dtype=np.int64).reshape(H, W)",
"+",
"+",
"+def read_col(H):",
"+ \"\"\"H is number of rows",
"+ A列、B列が与えられるようなとき",
"+ ex1)A,B=read_col(H) ex2) A,=read_col(H) #一列の場合\"\"\"",
"+ ret = []",
"+ for _ in range(H):",
"+ ret.append(list(map(int, readline().split())))",
"+ return tuple(map(list, zip(*ret)))",
"- \"\"\"",
"- H is number of rows",
"- \"\"\"",
"+ \"\"\"H is number of rows\"\"\"",
"- ret.append(tuple(map(int, read().split())))",
"+ ret.append(tuple(map(int, readline().split())))",
"-",
"-",
"-def read_col(H):",
"- \"\"\"",
"- H is number of rows",
"- A列、B列が与えられるようなとき",
"- ex1)A,B=read_col(H) ex2) A,=read_col(H) #一列の場合",
"- \"\"\"",
"- ret = []",
"- for _ in range(H):",
"- ret.append(list(map(int, read().split())))",
"- return tuple(map(list, list(zip(*ret))))",
"-",
"-",
"-def read_matrix(H):",
"- \"\"\"",
"- H is number of rows",
"- \"\"\"",
"- ret = []",
"- for _ in range(H):",
"- ret.append(list(map(int, read().split())))",
"- return ret",
"- # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため",
"-from operator import itemgetter",
"+from operator import itemgetter, xor, add",
"+from functools import reduce",
"+from math import gcd",
"-# https://atcoder.jp/contests/arc100/tasks/arc100_a",
"-N = read_a_int()",
"-A = read_ints()",
"-# Ai-iをBiとする",
"-# Σ|Bi - b|を最小化するはBiの中央値(ということを経験的に知っている)(二部探索してみればいいこと)",
"-B = []",
"-for i, a in enu(A, start=1):",
"- B.append(a - i)",
"-import numpy as np",
"-b = np.median(B)",
"-ans = 0",
"-print((int(np.abs(np.array(B) - b).sum())))",
"+def lcm(a, b):",
"+ # 最小公倍数",
"+ g = gcd(a, b)",
"+ return a // g * b",
"+",
"+",
"+N = a_int()",
"+A = ints()",
"+B = A - np.arange(1, N + 1)",
"+b = int(np.median(B))",
"+print(np.abs(B - b).sum())"
]
| false | 0.649579 | 0.216962 | 2.993978 | [
"s993412088",
"s719119096"
]
|
u432551953 | p03805 | python | s093906163 | s453493180 | 230 | 203 | 44,600 | 42,972 | Accepted | Accepted | 11.74 | import sys
input = sys.stdin.readline
from operator import itemgetter
lis = []
n = 0
m = 0
ans = 0
def dfs(i, d, fr, used):
global lis, ans
if i in used:
return
if d == n - 1:
ans += 1
return
for j in lis[i]:
if j != fr:
used.append(i)
# print(i+1 , j+1)
dfs(j, d+1, i, used)
used.pop()
def main():
global lis, n, m, ans
n, m = list(map(int, input().strip().split()))
lis = [[] for _ in range(8)]
for _ in range(m):
a, b = list([x-1 for x in list(map(int, input().strip().split()))])
lis[a].append(b)
lis[b].append(a)
# print("##")
dfs(0, 0, -1, [])
print(ans)
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
from operator import itemgetter
lis = []
n = 0
m = 0
ans = 0
visited = []
def dfs(i, d, fr):
global lis, ans, visited
if visited[i] == 1:
return
if d == n - 1:
ans += 1
return
for j in lis[i]:
if j != fr:
visited[i] = 1
# print(i+1 , j+1)
dfs(j, d+1, i)
visited[i] = -1
def main():
global lis, n, m, ans, visited
n, m = list(map(int, input().strip().split()))
lis = [[] for _ in range(n)]
visited = [-1] * n
for _ in range(m):
a, b = list([x-1 for x in list(map(int, input().strip().split()))])
lis[a].append(b)
lis[b].append(a)
# print("##")
dfs(0, 0, -1)
print(ans)
if __name__ == '__main__':
main()
| 38 | 40 | 782 | 833 | import sys
input = sys.stdin.readline
from operator import itemgetter
lis = []
n = 0
m = 0
ans = 0
def dfs(i, d, fr, used):
global lis, ans
if i in used:
return
if d == n - 1:
ans += 1
return
for j in lis[i]:
if j != fr:
used.append(i)
# print(i+1 , j+1)
dfs(j, d + 1, i, used)
used.pop()
def main():
global lis, n, m, ans
n, m = list(map(int, input().strip().split()))
lis = [[] for _ in range(8)]
for _ in range(m):
a, b = list([x - 1 for x in list(map(int, input().strip().split()))])
lis[a].append(b)
lis[b].append(a)
# print("##")
dfs(0, 0, -1, [])
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
from operator import itemgetter
lis = []
n = 0
m = 0
ans = 0
visited = []
def dfs(i, d, fr):
global lis, ans, visited
if visited[i] == 1:
return
if d == n - 1:
ans += 1
return
for j in lis[i]:
if j != fr:
visited[i] = 1
# print(i+1 , j+1)
dfs(j, d + 1, i)
visited[i] = -1
def main():
global lis, n, m, ans, visited
n, m = list(map(int, input().strip().split()))
lis = [[] for _ in range(n)]
visited = [-1] * n
for _ in range(m):
a, b = list([x - 1 for x in list(map(int, input().strip().split()))])
lis[a].append(b)
lis[b].append(a)
# print("##")
dfs(0, 0, -1)
print(ans)
if __name__ == "__main__":
main()
| false | 5 | [
"+visited = []",
"-def dfs(i, d, fr, used):",
"- global lis, ans",
"- if i in used:",
"+def dfs(i, d, fr):",
"+ global lis, ans, visited",
"+ if visited[i] == 1:",
"- used.append(i)",
"+ visited[i] = 1",
"- dfs(j, d + 1, i, used)",
"- used.pop()",
"+ dfs(j, d + 1, i)",
"+ visited[i] = -1",
"- global lis, n, m, ans",
"+ global lis, n, m, ans, visited",
"- lis = [[] for _ in range(8)]",
"+ lis = [[] for _ in range(n)]",
"+ visited = [-1] * n",
"- dfs(0, 0, -1, [])",
"+ dfs(0, 0, -1)"
]
| false | 0.119782 | 0.036349 | 3.295284 | [
"s093906163",
"s453493180"
]
|
u896741788 | p03329 | python | s399871091 | s638726880 | 517 | 351 | 6,900 | 3,064 | Accepted | Accepted | 32.11 | n=int(eval(input()))
dp=[float("INF")]*(n+1)
dp[0]=0
temp=6
cnt=0
while temp<=n:
cnt+=1
dp[temp]=1
temp*=6
l=[0,0]
l[0]=cnt
temp=9
cnt=0
while temp<=n:
cnt+=1
dp[temp]=1
temp*=9
l[1]=cnt
for j,v in zip(l,[6,9]):
for i in range(j+1):
h=pow(v,i)
for d in range(h,n+1):
dp[d]=min(dp[d],dp[d-h]+1)
print((dp[-1])) | n=int(eval(input()))
ans=float("INF")
for i in range(n+1):
d=0
temp=i
while (temp>0):
d+=temp%6
temp//=6
temp=n-i
while(temp>0):
d+=temp%9
temp//=9
ans=min(d,ans)
print(ans) | 24 | 14 | 352 | 208 | n = int(eval(input()))
dp = [float("INF")] * (n + 1)
dp[0] = 0
temp = 6
cnt = 0
while temp <= n:
cnt += 1
dp[temp] = 1
temp *= 6
l = [0, 0]
l[0] = cnt
temp = 9
cnt = 0
while temp <= n:
cnt += 1
dp[temp] = 1
temp *= 9
l[1] = cnt
for j, v in zip(l, [6, 9]):
for i in range(j + 1):
h = pow(v, i)
for d in range(h, n + 1):
dp[d] = min(dp[d], dp[d - h] + 1)
print((dp[-1]))
| n = int(eval(input()))
ans = float("INF")
for i in range(n + 1):
d = 0
temp = i
while temp > 0:
d += temp % 6
temp //= 6
temp = n - i
while temp > 0:
d += temp % 9
temp //= 9
ans = min(d, ans)
print(ans)
| false | 41.666667 | [
"-dp = [float(\"INF\")] * (n + 1)",
"-dp[0] = 0",
"-temp = 6",
"-cnt = 0",
"-while temp <= n:",
"- cnt += 1",
"- dp[temp] = 1",
"- temp *= 6",
"-l = [0, 0]",
"-l[0] = cnt",
"-temp = 9",
"-cnt = 0",
"-while temp <= n:",
"- cnt += 1",
"- dp[temp] = 1",
"- temp *= 9",
"-l[1] = cnt",
"-for j, v in zip(l, [6, 9]):",
"- for i in range(j + 1):",
"- h = pow(v, i)",
"- for d in range(h, n + 1):",
"- dp[d] = min(dp[d], dp[d - h] + 1)",
"-print((dp[-1]))",
"+ans = float(\"INF\")",
"+for i in range(n + 1):",
"+ d = 0",
"+ temp = i",
"+ while temp > 0:",
"+ d += temp % 6",
"+ temp //= 6",
"+ temp = n - i",
"+ while temp > 0:",
"+ d += temp % 9",
"+ temp //= 9",
"+ ans = min(d, ans)",
"+print(ans)"
]
| false | 0.328783 | 0.06506 | 5.053552 | [
"s399871091",
"s638726880"
]
|
u072717685 | p03166 | python | s884740888 | s341657246 | 856 | 495 | 134,800 | 79,456 | Accepted | Accepted | 42.17 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
longs = []
edges = {}
def graph_DP(node_to, long):
global longs
if longs[node_to] != -1:
return longs[node_to]
else:
nodes_next = edges[node_to]
if not nodes_next:
longs[node_to] = 0
return 0
else:
long_max_t = 0
for node_next in nodes_next:
if longs[node_next] != -1:
long_max_t = max(long_max_t, longs[node_next] + 1)
else:
long_max_t = max(long_max_t, graph_DP(node_next, 0) + 1)
longs[node_to] = long_max_t
return long_max_t
def main():
global longs, edges
n, m = list(map(int, input().split()))
edges = {e:set() for e in range(1, n + 1)}
for _ in range(m):
s, g = list(map(int, input().split()))
edges[s].add(g)
longs = [-1] * (n + 1)
for i1 in range(1, n + 1):
if longs[i1] == -1:
graph_DP(i1, 0)
print((max(longs)))
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
longs = []
edges = {}
def graph_DP(node_to):
global longs
if longs[node_to] != -1:
return longs[node_to]
else:
nodes_next = edges[node_to]
if not nodes_next:
longs[node_to] = 0
return 0
else:
long_max_t = 0
for node_next in nodes_next:
if longs[node_next] != -1:
long_max_t = max(long_max_t, longs[node_next] + 1)
else:
long_max_t = max(long_max_t, graph_DP(node_next) + 1)
longs[node_to] = long_max_t
return long_max_t
def main():
global longs, edges
n, m = list(map(int, input().split()))
edges = {e:set() for e in range(1, n + 1)}
for _ in range(m):
s, g = list(map(int, input().split()))
edges[s].add(g)
longs = [-1] * (n + 1)
for i1 in range(1, n + 1):
if longs[i1] == -1:
graph_DP(i1)
print((max(longs)))
if __name__ == '__main__':
main() | 41 | 41 | 1,110 | 1,097 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
longs = []
edges = {}
def graph_DP(node_to, long):
global longs
if longs[node_to] != -1:
return longs[node_to]
else:
nodes_next = edges[node_to]
if not nodes_next:
longs[node_to] = 0
return 0
else:
long_max_t = 0
for node_next in nodes_next:
if longs[node_next] != -1:
long_max_t = max(long_max_t, longs[node_next] + 1)
else:
long_max_t = max(long_max_t, graph_DP(node_next, 0) + 1)
longs[node_to] = long_max_t
return long_max_t
def main():
global longs, edges
n, m = list(map(int, input().split()))
edges = {e: set() for e in range(1, n + 1)}
for _ in range(m):
s, g = list(map(int, input().split()))
edges[s].add(g)
longs = [-1] * (n + 1)
for i1 in range(1, n + 1):
if longs[i1] == -1:
graph_DP(i1, 0)
print((max(longs)))
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
longs = []
edges = {}
def graph_DP(node_to):
global longs
if longs[node_to] != -1:
return longs[node_to]
else:
nodes_next = edges[node_to]
if not nodes_next:
longs[node_to] = 0
return 0
else:
long_max_t = 0
for node_next in nodes_next:
if longs[node_next] != -1:
long_max_t = max(long_max_t, longs[node_next] + 1)
else:
long_max_t = max(long_max_t, graph_DP(node_next) + 1)
longs[node_to] = long_max_t
return long_max_t
def main():
global longs, edges
n, m = list(map(int, input().split()))
edges = {e: set() for e in range(1, n + 1)}
for _ in range(m):
s, g = list(map(int, input().split()))
edges[s].add(g)
longs = [-1] * (n + 1)
for i1 in range(1, n + 1):
if longs[i1] == -1:
graph_DP(i1)
print((max(longs)))
if __name__ == "__main__":
main()
| false | 0 | [
"-def graph_DP(node_to, long):",
"+def graph_DP(node_to):",
"- long_max_t = max(long_max_t, graph_DP(node_next, 0) + 1)",
"+ long_max_t = max(long_max_t, graph_DP(node_next) + 1)",
"- graph_DP(i1, 0)",
"+ graph_DP(i1)"
]
| false | 0.07062 | 0.081058 | 0.871237 | [
"s884740888",
"s341657246"
]
|
u977193988 | p03838 | python | s294969358 | s876143882 | 154 | 18 | 12,496 | 3,064 | Accepted | Accepted | 88.31 | import sys
import numpy as np
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(10 ** 9)
def main():
x, y = list(map(int, input().split()))
if x > 0:
if y > 0:
if x > y:
answer = x - y + 2
else:
answer = y - x
elif y == 0:
answer = x + 1
else:
if -x <= y:
answer = y + x + 1
else:
answer = abs(y) - x + 1
elif x == 0:
if y > 0:
answer = y
else:
answer = -y + 1
else:
if y > 0:
if abs(x) >= y:
answer = abs(x) - y + 1
else:
answer = y - abs(x) + 1
elif y == 0:
answer = abs(x)
else:
if abs(x) > abs(y):
answer = abs(x) - abs(y)
else:
answer = abs(y) - abs(x) + 2
print(answer)
if __name__ == "__main__":
main()
| import sys
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(20000000)
def main():
x, y = list(map(int, input().split()))
if x == y:
print((0))
return
if x == 0:
if y < 0:
print((abs(y) + 1))
return
else:
print(y)
return
if x < 0:
if y > 0:
if abs(x) < y:
print((y - abs(x) + 1))
return
else:
print((abs(x) - y + 1))
return
elif y == 0:
print((abs(x)))
return
else:
if x > y:
print((x - y + 2))
return
else:
print((y - x))
return
else:
if y > 0:
if x < y:
print((y - x))
return
else:
print((x - y + 2))
return
elif y == 0:
print((x + 1))
return
else:
if x < abs(y):
print((abs(y) - x + 1))
return
else:
print((x - abs(y) + 1))
if __name__ == "__main__":
main()
| 49 | 62 | 1,045 | 1,262 | import sys
import numpy as np
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(10**9)
def main():
x, y = list(map(int, input().split()))
if x > 0:
if y > 0:
if x > y:
answer = x - y + 2
else:
answer = y - x
elif y == 0:
answer = x + 1
else:
if -x <= y:
answer = y + x + 1
else:
answer = abs(y) - x + 1
elif x == 0:
if y > 0:
answer = y
else:
answer = -y + 1
else:
if y > 0:
if abs(x) >= y:
answer = abs(x) - y + 1
else:
answer = y - abs(x) + 1
elif y == 0:
answer = abs(x)
else:
if abs(x) > abs(y):
answer = abs(x) - abs(y)
else:
answer = abs(y) - abs(x) + 2
print(answer)
if __name__ == "__main__":
main()
| import sys
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(20000000)
def main():
x, y = list(map(int, input().split()))
if x == y:
print((0))
return
if x == 0:
if y < 0:
print((abs(y) + 1))
return
else:
print(y)
return
if x < 0:
if y > 0:
if abs(x) < y:
print((y - abs(x) + 1))
return
else:
print((abs(x) - y + 1))
return
elif y == 0:
print((abs(x)))
return
else:
if x > y:
print((x - y + 2))
return
else:
print((y - x))
return
else:
if y > 0:
if x < y:
print((y - x))
return
else:
print((x - y + 2))
return
elif y == 0:
print((x + 1))
return
else:
if x < abs(y):
print((abs(y) - x + 1))
return
else:
print((x - abs(y) + 1))
if __name__ == "__main__":
main()
| false | 20.967742 | [
"-import numpy as np",
"-sys.setrecursionlimit(10**9)",
"+sys.setrecursionlimit(20000000)",
"- if x > 0:",
"+ if x == y:",
"+ print((0))",
"+ return",
"+ if x == 0:",
"+ if y < 0:",
"+ print((abs(y) + 1))",
"+ return",
"+ else:",
"+ print(y)",
"+ return",
"+ if x < 0:",
"+ if abs(x) < y:",
"+ print((y - abs(x) + 1))",
"+ return",
"+ else:",
"+ print((abs(x) - y + 1))",
"+ return",
"+ elif y == 0:",
"+ print((abs(x)))",
"+ return",
"+ else:",
"- answer = x - y + 2",
"+ print((x - y + 2))",
"+ return",
"- answer = y - x",
"- elif y == 0:",
"- answer = x + 1",
"- else:",
"- if -x <= y:",
"- answer = y + x + 1",
"- else:",
"- answer = abs(y) - x + 1",
"- elif x == 0:",
"- if y > 0:",
"- answer = y",
"- else:",
"- answer = -y + 1",
"+ print((y - x))",
"+ return",
"- if abs(x) >= y:",
"- answer = abs(x) - y + 1",
"+ if x < y:",
"+ print((y - x))",
"+ return",
"- answer = y - abs(x) + 1",
"+ print((x - y + 2))",
"+ return",
"- answer = abs(x)",
"+ print((x + 1))",
"+ return",
"- if abs(x) > abs(y):",
"- answer = abs(x) - abs(y)",
"+ if x < abs(y):",
"+ print((abs(y) - x + 1))",
"+ return",
"- answer = abs(y) - abs(x) + 2",
"- print(answer)",
"+ print((x - abs(y) + 1))"
]
| false | 0.036037 | 0.035613 | 1.011923 | [
"s294969358",
"s876143882"
]
|
u201928947 | p02889 | python | s418982320 | s574414353 | 1,707 | 870 | 58,524 | 52,572 | Accepted | Accepted | 49.03 | def warshall_floid(d):
for k in range(1,n+1):
for i in range(1,n+1):
for j in range(1,n+1):
d[i][j] = min(d[i][j],d[i][k]+d[k][j])
return d
n,m,l = list(map(int,input().split()))
d = [[10**13]*(n+1) for i in range(n+1)]
for i in range(m):
a,b,c = list(map(int,input().split()))
d[a][b] = c
d[b][a] = c
for i in range(1,n+1):
d[i][i] = 0
d = warshall_floid(d)
for i in range(1,n+1):
for j in range(1,n+1):
if d[i][j] <= l:
d[i][j] = 1
else:
d[i][j] = 10**13
d = warshall_floid(d)
q = int(eval(input()))
for i in range(q):
s,t = list(map(int,input().split()))
if d[s][t] >= 10**13:
print((-1))
else:
print((d[s][t]-1))
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def warshall_floid(d):
for k in range(1,n+1):
for i in range(1,n+1):
for j in range(1,n+1):
d[i][j] = min(d[i][j],d[i][k]+d[k][j])
return d
n,m,l = list(map(int,readline().split()))
d = [[10**12]*(n+1) for i in range(n+1)]
for i in range(m):
a,b,c = list(map(int,readline().split()))
d[a][b] = c
d[b][a] = c
for i in range(1,n+1):
d[i][i] = 0
d = warshall_floid(d)
for i in range(1,n+1):
for j in range(1,n+1):
if d[i][j] <= l:
d[i][j] = 1
else:
d[i][j] = 10**12
d = warshall_floid(d)
q = int(readline())
for i in range(q):
s,t = list(map(int,readline().split()))
if d[s][t] >= 10**12:
print((-1))
else:
print((d[s][t]-1)) | 30 | 34 | 751 | 882 | def warshall_floid(d):
for k in range(1, n + 1):
for i in range(1, n + 1):
for j in range(1, n + 1):
d[i][j] = min(d[i][j], d[i][k] + d[k][j])
return d
n, m, l = list(map(int, input().split()))
d = [[10**13] * (n + 1) for i in range(n + 1)]
for i in range(m):
a, b, c = list(map(int, input().split()))
d[a][b] = c
d[b][a] = c
for i in range(1, n + 1):
d[i][i] = 0
d = warshall_floid(d)
for i in range(1, n + 1):
for j in range(1, n + 1):
if d[i][j] <= l:
d[i][j] = 1
else:
d[i][j] = 10**13
d = warshall_floid(d)
q = int(eval(input()))
for i in range(q):
s, t = list(map(int, input().split()))
if d[s][t] >= 10**13:
print((-1))
else:
print((d[s][t] - 1))
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def warshall_floid(d):
for k in range(1, n + 1):
for i in range(1, n + 1):
for j in range(1, n + 1):
d[i][j] = min(d[i][j], d[i][k] + d[k][j])
return d
n, m, l = list(map(int, readline().split()))
d = [[10**12] * (n + 1) for i in range(n + 1)]
for i in range(m):
a, b, c = list(map(int, readline().split()))
d[a][b] = c
d[b][a] = c
for i in range(1, n + 1):
d[i][i] = 0
d = warshall_floid(d)
for i in range(1, n + 1):
for j in range(1, n + 1):
if d[i][j] <= l:
d[i][j] = 1
else:
d[i][j] = 10**12
d = warshall_floid(d)
q = int(readline())
for i in range(q):
s, t = list(map(int, readline().split()))
if d[s][t] >= 10**12:
print((-1))
else:
print((d[s][t] - 1))
| false | 11.764706 | [
"+import sys",
"+",
"+read = sys.stdin.buffer.read",
"+readline = sys.stdin.buffer.readline",
"+readlines = sys.stdin.buffer.readlines",
"+",
"+",
"-n, m, l = list(map(int, input().split()))",
"-d = [[10**13] * (n + 1) for i in range(n + 1)]",
"+n, m, l = list(map(int, readline().split()))",
"+d = [[10**12] * (n + 1) for i in range(n + 1)]",
"- a, b, c = list(map(int, input().split()))",
"+ a, b, c = list(map(int, readline().split()))",
"- d[i][j] = 10**13",
"+ d[i][j] = 10**12",
"-q = int(eval(input()))",
"+q = int(readline())",
"- s, t = list(map(int, input().split()))",
"- if d[s][t] >= 10**13:",
"+ s, t = list(map(int, readline().split()))",
"+ if d[s][t] >= 10**12:"
]
| false | 0.05997 | 0.034898 | 1.718442 | [
"s418982320",
"s574414353"
]
|
u603921794 | p02923 | python | s313751137 | s988816942 | 135 | 98 | 11,136 | 14,252 | Accepted | Accepted | 27.41 | n=int(eval(input()))
ans=0
now=input().split()
a=0
for i in range(len(now)-1):
if int(now[i])>=int(now[i+1]):
a+=1
else :
a=0
# print(a)
ans=max(ans,a)
print(ans) | from sys import stdin
n=int(stdin.readline())
ans=0
now=list(map(int,stdin.readline().split()))
a=0
for i in range(len(now)-1):
if now[i]>=now[i+1]:
a+=1
else :
a=0
# print(a)
ans=max(ans,a)
print(ans) | 12 | 13 | 199 | 245 | n = int(eval(input()))
ans = 0
now = input().split()
a = 0
for i in range(len(now) - 1):
if int(now[i]) >= int(now[i + 1]):
a += 1
else:
a = 0
# print(a)
ans = max(ans, a)
print(ans)
| from sys import stdin
n = int(stdin.readline())
ans = 0
now = list(map(int, stdin.readline().split()))
a = 0
for i in range(len(now) - 1):
if now[i] >= now[i + 1]:
a += 1
else:
a = 0
# print(a)
ans = max(ans, a)
print(ans)
| false | 7.692308 | [
"-n = int(eval(input()))",
"+from sys import stdin",
"+",
"+n = int(stdin.readline())",
"-now = input().split()",
"+now = list(map(int, stdin.readline().split()))",
"- if int(now[i]) >= int(now[i + 1]):",
"+ if now[i] >= now[i + 1]:"
]
| false | 0.041957 | 0.037331 | 1.12393 | [
"s313751137",
"s988816942"
]
|
u066413086 | p02902 | python | s397029722 | s369267971 | 592 | 42 | 3,692 | 9,616 | Accepted | Accepted | 92.91 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
def find_shortest_cycle(G, s):
dq = deque()
N = len(G)
INF = float('inf')
dist = [INF] * N
dist[s] = 0
parent = [-1] * N
ans_last = None # sからループを探して見つかった時の、ループの最後の頂点番号
dq.append(s)
# BFSで、最短のループを見つける
while dq and ans_last is None:
v = dq.popleft()
d = dist[v]
for n in G[v]:
# 頂点vからいける頂点の中に開始点があったら、ループである
if dist[n] == 0:
ans_last = v
parent[n] = v
break
# まだ探索していない頂点なら次の探索候補にする
elif dist[n] == INF:
dist[n] = d + 1
parent[n] = v
dq.append(n)
# ループが見つかった場合
if ans_last:
# ループの最後の頂点から、元の頂点をたどり、そのルートを逆にする
g = ans_last
route = [g]
while g != s:
g = parent[g]
route.append(g)
return list(reversed(route))
# 見つからなかった場合はNoneを返す
return None
def main():
N, M, *A = map(int, read().split())
G = [[] for i in range(N+1)]
for a, b in zip(A[::2], A[1::2]):
G[a].append(b)
# すべての頂点の入次数が 1、出次数が 1 であるような G の誘導部分グラフ
# [すべての頂点の入次数が 1、出次数が 1 のグラフ] -> ループ
# 有向グラフ G=(V,E) に対し、次のような条件を満たす有向グラフ G′=(V′,E′) を G の誘導部分グラフと呼ぶ。
# V′ は V の (空でない) 部分集合である。
# E′ は、E の辺であって両端点がともに V′ に含まれるものすべてを含む集合である。
# -> ループでも、ショートカットできるようなループはだめ
# 例: 1 -> 2 -> 3 -> 4 -> 5
# ^ | ^ |
# | ----------| |
# ---------------------
# V' = {1, 2, 3, 4, 5} としてしまうと、
# E' = {(1->2), (2->3), (3->4), (2->4), (4->5), (5->1)}
# となってしまい、この誘導部分グラフG'=(V', E')において、
# 頂点2の出次数が2になってしまう。（頂点4の入次数も2になってしまう）
# V' = {1, 2, 4, 5} とすれば、
# E' = {(1->2), (2->4), (4->5), (5->1)}
# となり、すべての頂点の入次数が 1、出次数が 1 となる
# つまり、ショートカットできない最短のループを1つでも見つければよい
min_route = None
for s in range(1, N+1):
# 各頂点を開始点にしてループを探す
route = find_shortest_cycle(G, s)
# ループが複数ある場合、短いほうを採用
if route:
if min_route is None or len(route) < len(min_route):
min_route = route
if min_route:
print(len(min_route), *min_route, sep='\n')
else:
print(-1)
if __name__ == '__main__':
main()
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
def shorten_cycle(G, route):
# ループだとすでに分かってるルートに対して、
# ショートカットが存在する場合はショートカットを行い、
# ルートを短くする
_next = {k: v for k, v in zip(route, route[1:]+route[:1])}
v = route[0]
while True:
# もしvからroute内の、次の点ではない点nにいける場合
for n in G[v]:
# v -> x -> y -> n としていたところを、
# v -> n とする
if n in route and n != _next[v]:
new_route = [n]
s = n
while s != v:
s = _next[s]
new_route.append(s)
_next[v] = n
# 無駄な部分を削除した新しい経路に対して、調査を最初からやり直す
route = new_route
v = route[0]
break
# 点vにショートカットがない場合
else:
# 次の点が最初の点の場合は、もうこれ以上ショートカットできないので終わり
v = _next[v]
if v == route[0]:
break
return route
def find_cycle(G, s):
dq = deque()
N = len(G)
INF = float('inf')
dist = [INF] * N
dist[s] = 0
parent = [-1] * N
ans_last = None # sからループを探して見つかった時の、ループの最後の頂点番号
dq.append(s)
# BFSでループを見つける
while dq and ans_last is None:
v = dq.popleft()
d = dist[v]
for n in G[v]:
# 頂点vからいける頂点の中に開始点があったら、ループである
if dist[n] == 0:
ans_last = v
parent[n] = v
break
# まだ探索していない頂点なら次の探索候補にする
elif dist[n] == INF:
dist[n] = d + 1
parent[n] = v
dq.append(n)
# ループが見つかった場合
if ans_last:
# ループの最後の頂点から、元の頂点をたどり、そのルートを逆にする
g = ans_last
route = [g]
while g != s:
g = parent[g]
route.append(g)
return list(reversed(route))
# 見つからなかった場合はNoneを返す
return None
def main():
N, M, *A = map(int, read().split())
G = [[] for i in range(N+1)]
for a, b in zip(A[::2], A[1::2]):
G[a].append(b)
# すべての頂点の入次数が 1、出次数が 1 であるような G の誘導部分グラフ
# [すべての頂点の入次数が 1、出次数が 1 のグラフ] -> ループ
# 有向グラフ G=(V,E) に対し、次のような条件を満たす有向グラフ G′=(V′,E′) を G の誘導部分グラフと呼ぶ。
# V′ は V の (空でない) 部分集合である。
# E′ は、E の辺であって両端点がともに V′ に含まれるものすべてを含む集合である。
# -> ループでも、ショートカットできるようなループはだめ
# 例: 1 -> 2 -> 3 -> 4 -> 5
# ^ | ^ |
# | ----------| |
# ---------------------
# V' = {1, 2, 3, 4, 5} としてしまうと、
# E' = {(1->2), (2->3), (3->4), (2->4), (4->5), (5->1)}
# となってしまい、この誘導部分グラフG'=(V', E')において、
# 頂点2の出次数が2になってしまう。（頂点4の入次数も2になってしまう）
# V' = {1, 2, 4, 5} とすれば、
# E' = {(1->2), (2->4), (4->5), (5->1)}
# となり、すべての頂点の入次数が 1、出次数が 1 となる
# つまり、ショートカットできない最短のループを1つでも見つければよい
min_route = None
for s in range(1, N+1):
# 各頂点を開始点にしてループを探す
route = find_cycle(G, s)
# ループが見つかった場合、そこからショートカットできる経路を探して終了
if route:
min_route = shorten_cycle(G, route)
break
if min_route:
print(len(min_route), *min_route, sep='\n')
else:
print(-1)
if __name__ == '__main__':
main()
| 92 | 123 | 2,464 | 3,342 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
def find_shortest_cycle(G, s):
dq = deque()
N = len(G)
INF = float("inf")
dist = [INF] * N
dist[s] = 0
parent = [-1] * N
ans_last = None # sからループを探して見つかった時の、ループの最後の頂点番号
dq.append(s)
# BFSで、最短のループを見つける
while dq and ans_last is None:
v = dq.popleft()
d = dist[v]
for n in G[v]:
# 頂点vからいける頂点の中に開始点があったら、ループである
if dist[n] == 0:
ans_last = v
parent[n] = v
break
# まだ探索していない頂点なら次の探索候補にする
elif dist[n] == INF:
dist[n] = d + 1
parent[n] = v
dq.append(n)
# ループが見つかった場合
if ans_last:
# ループの最後の頂点から、元の頂点をたどり、そのルートを逆にする
g = ans_last
route = [g]
while g != s:
g = parent[g]
route.append(g)
return list(reversed(route))
# 見つからなかった場合はNoneを返す
return None
def main():
N, M, *A = map(int, read().split())
G = [[] for i in range(N + 1)]
for a, b in zip(A[::2], A[1::2]):
G[a].append(b)
# すべての頂点の入次数が 1、出次数が 1 であるような G の誘導部分グラフ
# [すべての頂点の入次数が 1、出次数が 1 のグラフ] -> ループ
# 有向グラフ G=(V,E) に対し、次のような条件を満たす有向グラフ G′=(V′,E′) を G の誘導部分グラフと呼ぶ。
# V′ は V の (空でない) 部分集合である。
# E′ は、E の辺であって両端点がともに V′ に含まれるものすべてを含む集合である。
# -> ループでも、ショートカットできるようなループはだめ
# 例: 1 -> 2 -> 3 -> 4 -> 5
# ^ | ^ |
# | ----------| |
# ---------------------
# V' = {1, 2, 3, 4, 5} としてしまうと、
# E' = {(1->2), (2->3), (3->4), (2->4), (4->5), (5->1)}
# となってしまい、この誘導部分グラフG'=(V', E')において、
# 頂点2の出次数が2になってしまう。（頂点4の入次数も2になってしまう）
# V' = {1, 2, 4, 5} とすれば、
# E' = {(1->2), (2->4), (4->5), (5->1)}
# となり、すべての頂点の入次数が 1、出次数が 1 となる
# つまり、ショートカットできない最短のループを1つでも見つければよい
min_route = None
for s in range(1, N + 1):
# 各頂点を開始点にしてループを探す
route = find_shortest_cycle(G, s)
# ループが複数ある場合、短いほうを採用
if route:
if min_route is None or len(route) < len(min_route):
min_route = route
if min_route:
print(len(min_route), *min_route, sep="\n")
else:
print(-1)
if __name__ == "__main__":
main()
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
def shorten_cycle(G, route):
# ループだとすでに分かってるルートに対して、
# ショートカットが存在する場合はショートカットを行い、
# ルートを短くする
_next = {k: v for k, v in zip(route, route[1:] + route[:1])}
v = route[0]
while True:
# もしvからroute内の、次の点ではない点nにいける場合
for n in G[v]:
# v -> x -> y -> n としていたところを、
# v -> n とする
if n in route and n != _next[v]:
new_route = [n]
s = n
while s != v:
s = _next[s]
new_route.append(s)
_next[v] = n
# 無駄な部分を削除した新しい経路に対して、調査を最初からやり直す
route = new_route
v = route[0]
break
# 点vにショートカットがない場合
else:
# 次の点が最初の点の場合は、もうこれ以上ショートカットできないので終わり
v = _next[v]
if v == route[0]:
break
return route
def find_cycle(G, s):
dq = deque()
N = len(G)
INF = float("inf")
dist = [INF] * N
dist[s] = 0
parent = [-1] * N
ans_last = None # sからループを探して見つかった時の、ループの最後の頂点番号
dq.append(s)
# BFSでループを見つける
while dq and ans_last is None:
v = dq.popleft()
d = dist[v]
for n in G[v]:
# 頂点vからいける頂点の中に開始点があったら、ループである
if dist[n] == 0:
ans_last = v
parent[n] = v
break
# まだ探索していない頂点なら次の探索候補にする
elif dist[n] == INF:
dist[n] = d + 1
parent[n] = v
dq.append(n)
# ループが見つかった場合
if ans_last:
# ループの最後の頂点から、元の頂点をたどり、そのルートを逆にする
g = ans_last
route = [g]
while g != s:
g = parent[g]
route.append(g)
return list(reversed(route))
# 見つからなかった場合はNoneを返す
return None
def main():
N, M, *A = map(int, read().split())
G = [[] for i in range(N + 1)]
for a, b in zip(A[::2], A[1::2]):
G[a].append(b)
# すべての頂点の入次数が 1、出次数が 1 であるような G の誘導部分グラフ
# [すべての頂点の入次数が 1、出次数が 1 のグラフ] -> ループ
# 有向グラフ G=(V,E) に対し、次のような条件を満たす有向グラフ G′=(V′,E′) を G の誘導部分グラフと呼ぶ。
# V′ は V の (空でない) 部分集合である。
# E′ は、E の辺であって両端点がともに V′ に含まれるものすべてを含む集合である。
# -> ループでも、ショートカットできるようなループはだめ
# 例: 1 -> 2 -> 3 -> 4 -> 5
# ^ | ^ |
# | ----------| |
# ---------------------
# V' = {1, 2, 3, 4, 5} としてしまうと、
# E' = {(1->2), (2->3), (3->4), (2->4), (4->5), (5->1)}
# となってしまい、この誘導部分グラフG'=(V', E')において、
# 頂点2の出次数が2になってしまう。（頂点4の入次数も2になってしまう）
# V' = {1, 2, 4, 5} とすれば、
# E' = {(1->2), (2->4), (4->5), (5->1)}
# となり、すべての頂点の入次数が 1、出次数が 1 となる
# つまり、ショートカットできない最短のループを1つでも見つければよい
min_route = None
for s in range(1, N + 1):
# 各頂点を開始点にしてループを探す
route = find_cycle(G, s)
# ループが見つかった場合、そこからショートカットできる経路を探して終了
if route:
min_route = shorten_cycle(G, route)
break
if min_route:
print(len(min_route), *min_route, sep="\n")
else:
print(-1)
if __name__ == "__main__":
main()
| false | 25.203252 | [
"-def find_shortest_cycle(G, s):",
"+def shorten_cycle(G, route):",
"+ # ループだとすでに分かってるルートに対して、",
"+ # ショートカットが存在する場合はショートカットを行い、",
"+ # ルートを短くする",
"+ _next = {k: v for k, v in zip(route, route[1:] + route[:1])}",
"+ v = route[0]",
"+ while True:",
"+ # もしvからroute内の、次の点ではない点nにいける場合",
"+ for n in G[v]:",
"+ # v -> x -> y -> n としていたところを、",
"+ # v -> n とする",
"+ if n in route and n != _next[v]:",
"+ new_route = [n]",
"+ s = n",
"+ while s != v:",
"+ s = _next[s]",
"+ new_route.append(s)",
"+ _next[v] = n",
"+ # 無駄な部分を削除した新しい経路に対して、調査を最初からやり直す",
"+ route = new_route",
"+ v = route[0]",
"+ break",
"+ # 点vにショートカットがない場合",
"+ else:",
"+ # 次の点が最初の点の場合は、もうこれ以上ショートカットできないので終わり",
"+ v = _next[v]",
"+ if v == route[0]:",
"+ break",
"+ return route",
"+",
"+",
"+def find_cycle(G, s):",
"- # BFSで、最短のループを見つける",
"+ # BFSでループを見つける",
"- route = find_shortest_cycle(G, s)",
"- # ループが複数ある場合、短いほうを採用",
"+ route = find_cycle(G, s)",
"+ # ループが見つかった場合、そこからショートカットできる経路を探して終了",
"- if min_route is None or len(route) < len(min_route):",
"- min_route = route",
"+ min_route = shorten_cycle(G, route)",
"+ break"
]
| false | 0.060356 | 0.036892 | 1.635989 | [
"s397029722",
"s369267971"
]
|
u910632349 | p03434 | python | s906013230 | s845781643 | 31 | 28 | 8,984 | 9,140 | Accepted | Accepted | 9.68 | n=int(eval(input()))
a=sorted(list(map(int,input().split())),reverse=True)
alice=sum(a[::2])
bob=sum(a[1::2])
print((alice-bob)) | n=int(eval(input()))
a=sorted(list(map(int,input().split())),reverse=True)
print((sum(a[::2])-sum(a[1::2]))) | 5 | 3 | 124 | 102 | n = int(eval(input()))
a = sorted(list(map(int, input().split())), reverse=True)
alice = sum(a[::2])
bob = sum(a[1::2])
print((alice - bob))
| n = int(eval(input()))
a = sorted(list(map(int, input().split())), reverse=True)
print((sum(a[::2]) - sum(a[1::2])))
| false | 40 | [
"-alice = sum(a[::2])",
"-bob = sum(a[1::2])",
"-print((alice - bob))",
"+print((sum(a[::2]) - sum(a[1::2])))"
]
| false | 0.049637 | 0.045577 | 1.089077 | [
"s906013230",
"s845781643"
]
|
u054514819 | p02701 | python | s682569226 | s637923753 | 260 | 133 | 35,580 | 104,048 | Accepted | Accepted | 48.85 | N = int(eval(input()))
lis = [eval(input()) for _ in range(N)]
print((len(set(lis)))) | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
Ss = [eval(input()) for _ in range(N)]
print((len(set(Ss[:N])))) | 4 | 8 | 75 | 217 | N = int(eval(input()))
lis = [eval(input()) for _ in range(N)]
print((len(set(lis))))
| import sys
def input():
return sys.stdin.readline().strip()
def mapint():
return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
Ss = [eval(input()) for _ in range(N)]
print((len(set(Ss[:N]))))
| false | 50 | [
"+import sys",
"+",
"+",
"+def input():",
"+ return sys.stdin.readline().strip()",
"+",
"+",
"+def mapint():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+sys.setrecursionlimit(10**9)",
"-lis = [eval(input()) for _ in range(N)]",
"-print((len(set(lis))))",
"+Ss = [eval(input()) for _ in range(N)]",
"+print((len(set(Ss[:N]))))"
]
| false | 0.033878 | 0.040946 | 0.827387 | [
"s682569226",
"s637923753"
]
|
u936735179 | p02859 | python | s990391291 | s168053484 | 149 | 17 | 12,420 | 2,940 | Accepted | Accepted | 88.59 | import numpy
print((int(eval(input()))**2)) | print((int(eval(input()))**2)) | 2 | 1 | 36 | 22 | import numpy
print((int(eval(input())) ** 2))
| print((int(eval(input())) ** 2))
| false | 50 | [
"-import numpy",
"-"
]
| false | 0.038798 | 0.040114 | 0.967201 | [
"s990391291",
"s168053484"
]
|
u678167152 | p02815 | python | s521678397 | s428686101 | 152 | 129 | 31,748 | 105,100 | Accepted | Accepted | 15.13 | def solve():
ans = 0
N = int(eval(input()))
C = list(map(int, input().split()))
C.sort()
mod = 10**9+7
for i in range(N):
ans += C[i]*(N+1-i)
ans %= mod
ans = ans*pow(2,2*N-2,mod)%mod
return ans
print((solve())) | def solve():
ans = 0
N = int(eval(input()))
C = list(map(int, input().split()))
C.sort()
mod = 10**9+7
for i in range(N):
ans += C[i]*(N+1-i)
ans = ans*pow(2,2*N-2)%mod
return ans
print((solve())) | 12 | 11 | 238 | 218 | def solve():
ans = 0
N = int(eval(input()))
C = list(map(int, input().split()))
C.sort()
mod = 10**9 + 7
for i in range(N):
ans += C[i] * (N + 1 - i)
ans %= mod
ans = ans * pow(2, 2 * N - 2, mod) % mod
return ans
print((solve()))
| def solve():
ans = 0
N = int(eval(input()))
C = list(map(int, input().split()))
C.sort()
mod = 10**9 + 7
for i in range(N):
ans += C[i] * (N + 1 - i)
ans = ans * pow(2, 2 * N - 2) % mod
return ans
print((solve()))
| false | 8.333333 | [
"- ans %= mod",
"- ans = ans * pow(2, 2 * N - 2, mod) % mod",
"+ ans = ans * pow(2, 2 * N - 2) % mod"
]
| false | 0.09634 | 0.035335 | 2.726493 | [
"s521678397",
"s428686101"
]
|
u575431498 | p02803 | python | s193069935 | s741726366 | 665 | 560 | 3,436 | 3,444 | Accepted | Accepted | 15.79 | from collections import deque
from copy import deepcopy
H, W = list(map(int, input().split()))
S = [list(eval(input())) for _ in range(H)]
dxs = [0, 0, 1, -1]
dys = [1, -1, 0, 0]
cand = []
field_org = [[-1] * W for _ in range(H)]
for j in range(H):
for i in range(W):
if S[j][i] == '#':
continue
q = deque()
q.append((i, j, 0))
field = deepcopy(field_org)
field[j][i] = 0
while q:
p = q.popleft()
for dx, dy in zip(dxs, dys):
x, y = p[0] + dx, p[1] + dy
if not (0 <= x < W) or not (0 <= y < H) or S[y][x] == '#' or field[y][x] != -1:
continue
field[y][x] = p[2] + 1
q.append((x, y, p[2] + 1))
cand.append(max(max(row) for row in field))
print((max(cand))) | from collections import deque
from copy import copy
H, W = list(map(int, input().split()))
S = [list(eval(input())) for _ in range(H)]
dxs = [0, 0, 1, -1]
dys = [1, -1, 0, 0]
cand = []
field_org = [-1] * (W * H)
for j in range(H):
for i in range(W):
if S[j][i] == '#':
continue
q = deque()
q.append((i, j, 0))
field = copy(field_org)
field[j * W + i] = 0
while q:
p = q.popleft()
for dx, dy in zip(dxs, dys):
x, y = p[0] + dx, p[1] + dy
f_idx = y * W + x
if not (0 <= x < W) or not (0 <= y < H) or S[y][x] == '#' or field[f_idx] != -1:
continue
field[f_idx] = p[2] + 1
q.append((x, y, p[2] + 1))
cand.append(max(field))
print((max(cand)))
| 28 | 29 | 850 | 851 | from collections import deque
from copy import deepcopy
H, W = list(map(int, input().split()))
S = [list(eval(input())) for _ in range(H)]
dxs = [0, 0, 1, -1]
dys = [1, -1, 0, 0]
cand = []
field_org = [[-1] * W for _ in range(H)]
for j in range(H):
for i in range(W):
if S[j][i] == "#":
continue
q = deque()
q.append((i, j, 0))
field = deepcopy(field_org)
field[j][i] = 0
while q:
p = q.popleft()
for dx, dy in zip(dxs, dys):
x, y = p[0] + dx, p[1] + dy
if (
not (0 <= x < W)
or not (0 <= y < H)
or S[y][x] == "#"
or field[y][x] != -1
):
continue
field[y][x] = p[2] + 1
q.append((x, y, p[2] + 1))
cand.append(max(max(row) for row in field))
print((max(cand)))
| from collections import deque
from copy import copy
H, W = list(map(int, input().split()))
S = [list(eval(input())) for _ in range(H)]
dxs = [0, 0, 1, -1]
dys = [1, -1, 0, 0]
cand = []
field_org = [-1] * (W * H)
for j in range(H):
for i in range(W):
if S[j][i] == "#":
continue
q = deque()
q.append((i, j, 0))
field = copy(field_org)
field[j * W + i] = 0
while q:
p = q.popleft()
for dx, dy in zip(dxs, dys):
x, y = p[0] + dx, p[1] + dy
f_idx = y * W + x
if (
not (0 <= x < W)
or not (0 <= y < H)
or S[y][x] == "#"
or field[f_idx] != -1
):
continue
field[f_idx] = p[2] + 1
q.append((x, y, p[2] + 1))
cand.append(max(field))
print((max(cand)))
| false | 3.448276 | [
"-from copy import deepcopy",
"+from copy import copy",
"-field_org = [[-1] * W for _ in range(H)]",
"+field_org = [-1] * (W * H)",
"- field = deepcopy(field_org)",
"- field[j][i] = 0",
"+ field = copy(field_org)",
"+ field[j * W + i] = 0",
"+ f_idx = y * W + x",
"- or field[y][x] != -1",
"+ or field[f_idx] != -1",
"- field[y][x] = p[2] + 1",
"+ field[f_idx] = p[2] + 1",
"- cand.append(max(max(row) for row in field))",
"+ cand.append(max(field))"
]
| false | 0.133491 | 0.069481 | 1.921245 | [
"s193069935",
"s741726366"
]
|
u836939578 | p02571 | python | s228679458 | s256002506 | 118 | 68 | 73,420 | 73,036 | Accepted | Accepted | 42.37 | S = eval(input())
T = eval(input())
ans = 0
for i in range(len(S)-len(T)+1):
tmp = 0
pos = i
for j in range(len(T)):
if pos < len(S):
if S[pos] == T[j]:
tmp += 1
pos += 1
ans = max(tmp, ans)
print((len(T)-ans)) | S = eval(input())
T = eval(input())
ans = len(S)
for i in range(len(S)-len(T)+1):
tmp = 0
for j in range(len(T)):
if S[i+j] != T[j]:
tmp += 1
ans = min(ans, tmp)
print(ans) | 15 | 13 | 272 | 207 | S = eval(input())
T = eval(input())
ans = 0
for i in range(len(S) - len(T) + 1):
tmp = 0
pos = i
for j in range(len(T)):
if pos < len(S):
if S[pos] == T[j]:
tmp += 1
pos += 1
ans = max(tmp, ans)
print((len(T) - ans))
| S = eval(input())
T = eval(input())
ans = len(S)
for i in range(len(S) - len(T) + 1):
tmp = 0
for j in range(len(T)):
if S[i + j] != T[j]:
tmp += 1
ans = min(ans, tmp)
print(ans)
| false | 13.333333 | [
"-ans = 0",
"+ans = len(S)",
"- pos = i",
"- if pos < len(S):",
"- if S[pos] == T[j]:",
"- tmp += 1",
"- pos += 1",
"- ans = max(tmp, ans)",
"-print((len(T) - ans))",
"+ if S[i + j] != T[j]:",
"+ tmp += 1",
"+ ans = min(ans, tmp)",
"+print(ans)"
]
| false | 0.045528 | 0.036662 | 1.241829 | [
"s228679458",
"s256002506"
]
|
u539969758 | p02726 | python | s771719766 | s781997359 | 1,792 | 1,399 | 3,444 | 3,444 | Accepted | Accepted | 21.93 | N, X, Y = list(map(int,input().split()))
k_list = [0]*N
for p in range(1, N):
for q in range(p, N+1):
p2X = abs(p - X)
p2Y = abs(p - Y)
q2X = abs(q - X)
q2Y = abs(q - Y)
distance = min(q-p, p2X+1+q2Y)
k_list[distance] += 1
for k in range(1, N):
print((k_list[k])) | N, X, Y = list(map(int,input().split()))
k_list = [0]*N
for p in range(1, N):
for q in range(p, N+1):
p2X = abs(p - X)
q2Y = abs(q - Y)
distance = min(q-p, p2X+1+q2Y)
k_list[distance] += 1
for k in range(1, N):
print((k_list[k])) | 15 | 13 | 328 | 276 | N, X, Y = list(map(int, input().split()))
k_list = [0] * N
for p in range(1, N):
for q in range(p, N + 1):
p2X = abs(p - X)
p2Y = abs(p - Y)
q2X = abs(q - X)
q2Y = abs(q - Y)
distance = min(q - p, p2X + 1 + q2Y)
k_list[distance] += 1
for k in range(1, N):
print((k_list[k]))
| N, X, Y = list(map(int, input().split()))
k_list = [0] * N
for p in range(1, N):
for q in range(p, N + 1):
p2X = abs(p - X)
q2Y = abs(q - Y)
distance = min(q - p, p2X + 1 + q2Y)
k_list[distance] += 1
for k in range(1, N):
print((k_list[k]))
| false | 13.333333 | [
"- p2Y = abs(p - Y)",
"- q2X = abs(q - X)"
]
| false | 0.046621 | 0.038044 | 1.225468 | [
"s771719766",
"s781997359"
]
|
u026155812 | p03476 | python | s354605246 | s982338049 | 854 | 328 | 14,440 | 27,236 | Accepted | Accepted | 61.59 | from itertools import accumulate
Q = int(eval(input()))
def prime(n):
# 素数列挙
# nまでの素数をリストで返す(nを含む)
primes = set(range(2, n+1))
for i in range(2, int(n**0.5+1)):
primes.difference_update(list(range(i*2, n+1, i)))
primes=list(primes)
return primes
prime_set = set(prime(10**5))
ans = []
for i in range(10**5+1):
if i%2 == 0:
ans.append(0)
else:
if i in prime_set and (i+1)//2 in prime_set:
ans.append(1)
else:
ans.append(0)
ans = list(accumulate(ans))
for i in range(Q):
l, r = list(map(int, input().split()))
print((ans[r] - ans[l-1])) | from itertools import accumulate
Q = int(eval(input()))
m = 0
ls = []
for i in range(Q):
l, r = list(map(int, input().split()))
m = max(m, max(l, r))
ls.append((l, r))
def sieve_eratosthenes(n):
primes = [0, 1] * (n // 2 + 1)
if n % 2 == 0:
primes.pop()
primes[1] = 0
primes[2] = 1
for p in range(3, n + 1, 2):
if primes[p]:
for q in range(p * p, n + 1, 2 * p):
primes[q] = 0
return primes
a = sieve_eratosthenes(m)
b = [0 for i in range(m+1)]
for i in range(2, m+1):
if i%2 == 1 and a[i] == 1 and a[(i+1)//2] == 1:
b[i] = 1
c = list(accumulate(b))
for l, r in ls:
print((c[r] - c[l-1]))
| 28 | 29 | 641 | 700 | from itertools import accumulate
Q = int(eval(input()))
def prime(n):
# 素数列挙
# nまでの素数をリストで返す(nを含む)
primes = set(range(2, n + 1))
for i in range(2, int(n**0.5 + 1)):
primes.difference_update(list(range(i * 2, n + 1, i)))
primes = list(primes)
return primes
prime_set = set(prime(10**5))
ans = []
for i in range(10**5 + 1):
if i % 2 == 0:
ans.append(0)
else:
if i in prime_set and (i + 1) // 2 in prime_set:
ans.append(1)
else:
ans.append(0)
ans = list(accumulate(ans))
for i in range(Q):
l, r = list(map(int, input().split()))
print((ans[r] - ans[l - 1]))
| from itertools import accumulate
Q = int(eval(input()))
m = 0
ls = []
for i in range(Q):
l, r = list(map(int, input().split()))
m = max(m, max(l, r))
ls.append((l, r))
def sieve_eratosthenes(n):
primes = [0, 1] * (n // 2 + 1)
if n % 2 == 0:
primes.pop()
primes[1] = 0
primes[2] = 1
for p in range(3, n + 1, 2):
if primes[p]:
for q in range(p * p, n + 1, 2 * p):
primes[q] = 0
return primes
a = sieve_eratosthenes(m)
b = [0 for i in range(m + 1)]
for i in range(2, m + 1):
if i % 2 == 1 and a[i] == 1 and a[(i + 1) // 2] == 1:
b[i] = 1
c = list(accumulate(b))
for l, r in ls:
print((c[r] - c[l - 1]))
| false | 3.448276 | [
"+m = 0",
"+ls = []",
"+for i in range(Q):",
"+ l, r = list(map(int, input().split()))",
"+ m = max(m, max(l, r))",
"+ ls.append((l, r))",
"-def prime(n):",
"- # 素数列挙",
"- # nまでの素数をリストで返す(nを含む)",
"- primes = set(range(2, n + 1))",
"- for i in range(2, int(n**0.5 + 1)):",
"- primes.difference_update(list(range(i * 2, n + 1, i)))",
"- primes = list(primes)",
"+def sieve_eratosthenes(n):",
"+ primes = [0, 1] * (n // 2 + 1)",
"+ if n % 2 == 0:",
"+ primes.pop()",
"+ primes[1] = 0",
"+ primes[2] = 1",
"+ for p in range(3, n + 1, 2):",
"+ if primes[p]:",
"+ for q in range(p * p, n + 1, 2 * p):",
"+ primes[q] = 0",
"-prime_set = set(prime(10**5))",
"-ans = []",
"-for i in range(10**5 + 1):",
"- if i % 2 == 0:",
"- ans.append(0)",
"- else:",
"- if i in prime_set and (i + 1) // 2 in prime_set:",
"- ans.append(1)",
"- else:",
"- ans.append(0)",
"-ans = list(accumulate(ans))",
"-for i in range(Q):",
"- l, r = list(map(int, input().split()))",
"- print((ans[r] - ans[l - 1]))",
"+a = sieve_eratosthenes(m)",
"+b = [0 for i in range(m + 1)]",
"+for i in range(2, m + 1):",
"+ if i % 2 == 1 and a[i] == 1 and a[(i + 1) // 2] == 1:",
"+ b[i] = 1",
"+c = list(accumulate(b))",
"+for l, r in ls:",
"+ print((c[r] - c[l - 1]))"
]
| false | 0.147991 | 0.046694 | 3.169345 | [
"s354605246",
"s982338049"
]
|
u815763296 | p02596 | python | s439739877 | s676912381 | 236 | 208 | 9,016 | 9,068 | Accepted | Accepted | 11.86 | K = int(eval(input()))
like = 7
ans = -1
for i in range(K):
if like % K == 0:
ans = i+1
break
like = (like*10+7) % K
print(ans)
| K = int(eval(input()))
ans = -1
N = 7
for i in range(K):
if N % K == 0:
ans = i+1
break
N = (N*10+7) % K
print(ans)
| 9 | 9 | 154 | 142 | K = int(eval(input()))
like = 7
ans = -1
for i in range(K):
if like % K == 0:
ans = i + 1
break
like = (like * 10 + 7) % K
print(ans)
| K = int(eval(input()))
ans = -1
N = 7
for i in range(K):
if N % K == 0:
ans = i + 1
break
N = (N * 10 + 7) % K
print(ans)
| false | 0 | [
"-like = 7",
"+N = 7",
"- if like % K == 0:",
"+ if N % K == 0:",
"- like = (like * 10 + 7) % K",
"+ N = (N * 10 + 7) % K"
]
| false | 0.120169 | 0.071754 | 1.674733 | [
"s439739877",
"s676912381"
]
|
u482982507 | p03965 | python | s318760890 | s701586785 | 45 | 32 | 3,316 | 3,316 | Accepted | Accepted | 28.89 | s = eval(input())
score = 0
for i in range(len(s)):
if i % 2 == 0:
if s[i] == 'p': score -= 1
else:
if s[i] == 'g': score += 1
print(score) | s = eval(input())
p = 0
for i in range(len(s)):
if s[i] == 'p': p += 1
print((-p + len(s) // 2)) | 8 | 5 | 164 | 96 | s = eval(input())
score = 0
for i in range(len(s)):
if i % 2 == 0:
if s[i] == "p":
score -= 1
else:
if s[i] == "g":
score += 1
print(score)
| s = eval(input())
p = 0
for i in range(len(s)):
if s[i] == "p":
p += 1
print((-p + len(s) // 2))
| false | 37.5 | [
"-score = 0",
"+p = 0",
"- if i % 2 == 0:",
"- if s[i] == \"p\":",
"- score -= 1",
"- else:",
"- if s[i] == \"g\":",
"- score += 1",
"-print(score)",
"+ if s[i] == \"p\":",
"+ p += 1",
"+print((-p + len(s) // 2))"
]
| false | 0.041612 | 0.034939 | 1.190966 | [
"s318760890",
"s701586785"
]
|
u914797917 | p03555 | python | s001839009 | s136879509 | 20 | 17 | 3,060 | 2,940 | Accepted | Accepted | 15 | c = [eval(input()) for i in range(2)]
c0=[]
for i in range(3):
c0.append(c[0][i])
c1=[]
for i in range(3):
c1.append(c[1][i])
if c0[0]==c1[2] and c0[1]==c1[1] and c0[2]==c1[0]:
print('YES')
else:
print('NO') | c1=eval(input())
c2=eval(input())
print(('YES' if c1[0]==c2[2] and c1[1]==c2[1] and c1[2]==c2[0] else 'NO')) | 13 | 3 | 225 | 96 | c = [eval(input()) for i in range(2)]
c0 = []
for i in range(3):
c0.append(c[0][i])
c1 = []
for i in range(3):
c1.append(c[1][i])
if c0[0] == c1[2] and c0[1] == c1[1] and c0[2] == c1[0]:
print("YES")
else:
print("NO")
| c1 = eval(input())
c2 = eval(input())
print(("YES" if c1[0] == c2[2] and c1[1] == c2[1] and c1[2] == c2[0] else "NO"))
| false | 76.923077 | [
"-c = [eval(input()) for i in range(2)]",
"-c0 = []",
"-for i in range(3):",
"- c0.append(c[0][i])",
"-c1 = []",
"-for i in range(3):",
"- c1.append(c[1][i])",
"-if c0[0] == c1[2] and c0[1] == c1[1] and c0[2] == c1[0]:",
"- print(\"YES\")",
"-else:",
"- print(\"NO\")",
"+c1 = eval(input())",
"+c2 = eval(input())",
"+print((\"YES\" if c1[0] == c2[2] and c1[1] == c2[1] and c1[2] == c2[0] else \"NO\"))"
]
| false | 0.047432 | 0.049393 | 0.960289 | [
"s001839009",
"s136879509"
]
|
u445624660 | p03355 | python | s194663185 | s399815975 | 75 | 48 | 74,036 | 11,192 | Accepted | Accepted | 36 | # kが極端に少ないので、下位K個を管理してよさそうな気がする
# -> なんかダメ
# じゃ決め打ちして全探索することにしてみる どうせ長さは最大でKなので
# 時間的に間に合うか微妙な気がする
# -> はい
s = list(eval(input()))
k = int(eval(input()))
d = {}
for i in range(len(s)):
for j in range(i, min(i + k, len(s))):
t = "".join(s[i:j + 1])
if t not in d:
d[t] = True
dk = sorted(d.keys())
print((dk[k - 1]))
| s = eval(input())
k = int(eval(input()))
lis = []
for i in range(len(s)):
for j in range(k):
lis.append("".join(s[i:i + j + 1]))
lis = sorted(list(set(lis)))
print((lis[k - 1]))
| 16 | 10 | 350 | 187 | # kが極端に少ないので、下位K個を管理してよさそうな気がする
# -> なんかダメ
# じゃ決め打ちして全探索することにしてみる どうせ長さは最大でKなので
# 時間的に間に合うか微妙な気がする
# -> はい
s = list(eval(input()))
k = int(eval(input()))
d = {}
for i in range(len(s)):
for j in range(i, min(i + k, len(s))):
t = "".join(s[i : j + 1])
if t not in d:
d[t] = True
dk = sorted(d.keys())
print((dk[k - 1]))
| s = eval(input())
k = int(eval(input()))
lis = []
for i in range(len(s)):
for j in range(k):
lis.append("".join(s[i : i + j + 1]))
lis = sorted(list(set(lis)))
print((lis[k - 1]))
| false | 37.5 | [
"-# kが極端に少ないので、下位K個を管理してよさそうな気がする",
"-# -> なんかダメ",
"-# じゃ決め打ちして全探索することにしてみる どうせ長さは最大でKなので",
"-# 時間的に間に合うか微妙な気がする",
"-# -> はい",
"-s = list(eval(input()))",
"+s = eval(input())",
"-d = {}",
"+lis = []",
"- for j in range(i, min(i + k, len(s))):",
"- t = \"\".join(s[i : j + 1])",
"- if t not in d:",
"- d[t] = True",
"-dk = sorted(d.keys())",
"-print((dk[k - 1]))",
"+ for j in range(k):",
"+ lis.append(\"\".join(s[i : i + j + 1]))",
"+lis = sorted(list(set(lis)))",
"+print((lis[k - 1]))"
]
| false | 0.046002 | 0.144252 | 0.3189 | [
"s194663185",
"s399815975"
]
|
u312025627 | p02994 | python | s247565576 | s108080491 | 184 | 17 | 38,384 | 3,060 | Accepted | Accepted | 90.76 | def main():
N, L = (int(i) for i in input().split())
s = 0
li = []
for i in range(1, N+1):
s += L + i - 1
li.append((abs(L + i - 1), i))
li.sort()
print((s - (L + li[0][1] - 1)))
if __name__ == '__main__':
main()
| def main():
N, L = (int(i) for i in input().split())
s = sum(L+i-1 for i in range(1, N+1))
mi = 10**5
ans = -1
for i in range(1, N+1):
cur = L + i - 1
eat = s - cur
if abs(s - eat) < mi:
mi = abs(s - eat)
ans = eat
print(ans)
if __name__ == '__main__':
main()
| 14 | 16 | 271 | 353 | def main():
N, L = (int(i) for i in input().split())
s = 0
li = []
for i in range(1, N + 1):
s += L + i - 1
li.append((abs(L + i - 1), i))
li.sort()
print((s - (L + li[0][1] - 1)))
if __name__ == "__main__":
main()
| def main():
N, L = (int(i) for i in input().split())
s = sum(L + i - 1 for i in range(1, N + 1))
mi = 10**5
ans = -1
for i in range(1, N + 1):
cur = L + i - 1
eat = s - cur
if abs(s - eat) < mi:
mi = abs(s - eat)
ans = eat
print(ans)
if __name__ == "__main__":
main()
| false | 12.5 | [
"- s = 0",
"- li = []",
"+ s = sum(L + i - 1 for i in range(1, N + 1))",
"+ mi = 10**5",
"+ ans = -1",
"- s += L + i - 1",
"- li.append((abs(L + i - 1), i))",
"- li.sort()",
"- print((s - (L + li[0][1] - 1)))",
"+ cur = L + i - 1",
"+ eat = s - cur",
"+ if abs(s - eat) < mi:",
"+ mi = abs(s - eat)",
"+ ans = eat",
"+ print(ans)"
]
| false | 0.036551 | 0.03509 | 1.041636 | [
"s247565576",
"s108080491"
]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.