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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u693933222
|
p03102
|
python
|
s385734002
|
s354606781
| 19 | 17 | 3,188 | 3,060 |
Accepted
|
Accepted
| 10.53 |
lx = list(map(int,input().split(" ")))
lb = list(map(int,input().split(" ")))
#la = [li[0]][li[1]]
la = []
cnt = 0
for i in range(0, lx[0]):
tmp = lx[2]
la.append(list(map(int,input().split(" "))))
for j in range(0, lx[1]):
tmp += la[i][j] * lb[j]
if (tmp > 0):
cnt += 1
print(cnt)
|
n, m, c = list(map(int, input().split()))
b = list(map(int, input().split()))
#la = [li[0]][li[1]]
cnt = 0
for i in range(n):
a = list(map(int, input().split()))
tmp = c
for j in range(0, m):
tmp += a[j] * b[j]
if (tmp > 0):
cnt += 1
print(cnt)
| 15 | 15 | 329 | 287 |
lx = list(map(int, input().split(" ")))
lb = list(map(int, input().split(" ")))
# la = [li[0]][li[1]]
la = []
cnt = 0
for i in range(0, lx[0]):
tmp = lx[2]
la.append(list(map(int, input().split(" "))))
for j in range(0, lx[1]):
tmp += la[i][j] * lb[j]
if tmp > 0:
cnt += 1
print(cnt)
|
n, m, c = list(map(int, input().split()))
b = list(map(int, input().split()))
# la = [li[0]][li[1]]
cnt = 0
for i in range(n):
a = list(map(int, input().split()))
tmp = c
for j in range(0, m):
tmp += a[j] * b[j]
if tmp > 0:
cnt += 1
print(cnt)
| false | 0 |
[
"-lx = list(map(int, input().split(\" \")))",
"-lb = list(map(int, input().split(\" \")))",
"+n, m, c = list(map(int, input().split()))",
"+b = list(map(int, input().split()))",
"-la = []",
"-for i in range(0, lx[0]):",
"- tmp = lx[2]",
"- la.append(list(map(int, input().split(\" \"))))",
"- for j in range(0, lx[1]):",
"- tmp += la[i][j] * lb[j]",
"+for i in range(n):",
"+ a = list(map(int, input().split()))",
"+ tmp = c",
"+ for j in range(0, m):",
"+ tmp += a[j] * b[j]"
] | false | 0.079041 | 0.061701 | 1.281031 |
[
"s385734002",
"s354606781"
] |
u067983636
|
p03673
|
python
|
s567389314
|
s928229314
| 139 | 72 | 31,780 | 25,232 |
Accepted
|
Accepted
| 48.2 |
n = int(eval(input()))
A = list(map(int, input().split()))
if n == 1:
print((A[0]))
exit()
elif n % 2 == 0:
l1 = [str(A[n - 2 * i - 1]) for i in range(n//2)]
l2 = [str(A[2 * j]) for j in range(n//2)]
else:
l1 = [str(A[n - 2 * i - 1]) for i in range(n//2 + 1)]
l2 = [str(A[2 * j + 1]) for j in range(n//2)]
print((" ".join(l1), " ".join(l2)))
|
n = int(eval(input()))
A = input().split()
if n == 1:
print((A[0]))
exit()
elif n % 2 == 0:
l1 = [A[n - 2 * i - 1] for i in range(n//2)]
l2 = [A[2 * j] for j in range(n//2)]
else:
l1 = [A[n - 2 * i - 1] for i in range(n//2 + 1)]
l2 = [A[2 * j + 1] for j in range(n//2)]
print((" ".join(l1), " ".join(l2)))
| 16 | 16 | 374 | 339 |
n = int(eval(input()))
A = list(map(int, input().split()))
if n == 1:
print((A[0]))
exit()
elif n % 2 == 0:
l1 = [str(A[n - 2 * i - 1]) for i in range(n // 2)]
l2 = [str(A[2 * j]) for j in range(n // 2)]
else:
l1 = [str(A[n - 2 * i - 1]) for i in range(n // 2 + 1)]
l2 = [str(A[2 * j + 1]) for j in range(n // 2)]
print((" ".join(l1), " ".join(l2)))
|
n = int(eval(input()))
A = input().split()
if n == 1:
print((A[0]))
exit()
elif n % 2 == 0:
l1 = [A[n - 2 * i - 1] for i in range(n // 2)]
l2 = [A[2 * j] for j in range(n // 2)]
else:
l1 = [A[n - 2 * i - 1] for i in range(n // 2 + 1)]
l2 = [A[2 * j + 1] for j in range(n // 2)]
print((" ".join(l1), " ".join(l2)))
| false | 0 |
[
"-A = list(map(int, input().split()))",
"+A = input().split()",
"- l1 = [str(A[n - 2 * i - 1]) for i in range(n // 2)]",
"- l2 = [str(A[2 * j]) for j in range(n // 2)]",
"+ l1 = [A[n - 2 * i - 1] for i in range(n // 2)]",
"+ l2 = [A[2 * j] for j in range(n // 2)]",
"- l1 = [str(A[n - 2 * i - 1]) for i in range(n // 2 + 1)]",
"- l2 = [str(A[2 * j + 1]) for j in range(n // 2)]",
"+ l1 = [A[n - 2 * i - 1] for i in range(n // 2 + 1)]",
"+ l2 = [A[2 * j + 1] for j in range(n // 2)]"
] | false | 0.082124 | 0.057632 | 1.424975 |
[
"s567389314",
"s928229314"
] |
u580273604
|
p02684
|
python
|
s102408439
|
s109487847
| 143 | 130 | 32,288 | 32,296 |
Accepted
|
Accepted
| 9.09 |
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
B=[0]*(N+1)
B[0]=1
if B[0] in A:c=B[0]
for i in range(1,N+1):
B[i]=A[B[i-1]-1]
d=B.index(B[-1])+1
if K<=N:print((B[K]));exit()
print((B[d-1+(K+1-d)%(N+1-d)]))
|
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
B=[0]*N
B[0]=1
if B[0] in A:c=B[0]
for i in range(1,N):
B[i]=A[B[i-1]-1]
d=B.index(B[-1])+1
if K<=N:print((B[K]));exit()
print((B[d-1+(K+1-d)%(N-d)]))
| 11 | 11 | 230 | 222 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = [0] * (N + 1)
B[0] = 1
if B[0] in A:
c = B[0]
for i in range(1, N + 1):
B[i] = A[B[i - 1] - 1]
d = B.index(B[-1]) + 1
if K <= N:
print((B[K]))
exit()
print((B[d - 1 + (K + 1 - d) % (N + 1 - d)]))
|
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = [0] * N
B[0] = 1
if B[0] in A:
c = B[0]
for i in range(1, N):
B[i] = A[B[i - 1] - 1]
d = B.index(B[-1]) + 1
if K <= N:
print((B[K]))
exit()
print((B[d - 1 + (K + 1 - d) % (N - d)]))
| false | 0 |
[
"-B = [0] * (N + 1)",
"+B = [0] * N",
"-for i in range(1, N + 1):",
"+for i in range(1, N):",
"-print((B[d - 1 + (K + 1 - d) % (N + 1 - d)]))",
"+print((B[d - 1 + (K + 1 - d) % (N - d)]))"
] | false | 0.042677 | 0.042183 | 1.01171 |
[
"s102408439",
"s109487847"
] |
u057109575
|
p02732
|
python
|
s803024704
|
s179067959
| 461 | 198 | 92,056 | 109,392 |
Accepted
|
Accepted
| 57.05 |
from collections import Counter
N, *A = list(map(int, open(0).read().split()))
ctr = Counter(A)
total = sum(v * (v - 1) // 2 for v in list(ctr.values()))
for v in A:
c = ctr[v]
print((total - (c * (c - 1) // 2) + max(0, (c - 1) * (c - 2) // 2)))
|
from collections import Counter
N = int(eval(input()))
X = list(map(int, input().split()))
ctr = Counter(X)
ans = 0
for v in list(ctr.values()):
ans += v * (v - 1) // 2
for i in range(N):
val = ctr[X[i]]
print((ans - val * (val - 1) // 2 + (val - 1) * (val - 2) // 2))
| 8 | 14 | 248 | 284 |
from collections import Counter
N, *A = list(map(int, open(0).read().split()))
ctr = Counter(A)
total = sum(v * (v - 1) // 2 for v in list(ctr.values()))
for v in A:
c = ctr[v]
print((total - (c * (c - 1) // 2) + max(0, (c - 1) * (c - 2) // 2)))
|
from collections import Counter
N = int(eval(input()))
X = list(map(int, input().split()))
ctr = Counter(X)
ans = 0
for v in list(ctr.values()):
ans += v * (v - 1) // 2
for i in range(N):
val = ctr[X[i]]
print((ans - val * (val - 1) // 2 + (val - 1) * (val - 2) // 2))
| false | 42.857143 |
[
"-N, *A = list(map(int, open(0).read().split()))",
"-ctr = Counter(A)",
"-total = sum(v * (v - 1) // 2 for v in list(ctr.values()))",
"-for v in A:",
"- c = ctr[v]",
"- print((total - (c * (c - 1) // 2) + max(0, (c - 1) * (c - 2) // 2)))",
"+N = int(eval(input()))",
"+X = list(map(int, input().split()))",
"+ctr = Counter(X)",
"+ans = 0",
"+for v in list(ctr.values()):",
"+ ans += v * (v - 1) // 2",
"+for i in range(N):",
"+ val = ctr[X[i]]",
"+ print((ans - val * (val - 1) // 2 + (val - 1) * (val - 2) // 2))"
] | false | 0.036188 | 0.036352 | 0.995487 |
[
"s803024704",
"s179067959"
] |
u367701763
|
p02709
|
python
|
s851384855
|
s795711777
| 120 | 99 | 74,840 | 73,960 |
Accepted
|
Accepted
| 17.5 |
N = int(eval(input()))
D = []
for i, a in enumerate(map(int, input().split())):
D.append((a<<11) + i)
D.sort(reverse=True)
dp = [0]*(N+1)
for i, d in enumerate(D,start=1):
x, a = d%(1<<11),d>>11
for j in reversed(list(range(0, i+1))):
dp[j] = max((dp[j-1]+a*abs(x-(j-1)))*(j-1>=0), (dp[j]+a*abs(N-(i-j)-x))*(j<=i-1))
print((max(dp)))
|
N = int(eval(input()))
D = []
for i, a in enumerate(map(int, input().split())):
D.append((a<<11) + i)
D.sort(reverse=True)
dp = [0]*(N+1)
for i, d in enumerate(D,start=1):
x, a = d%(1<<11),d>>11
for j in reversed(list(range(0, i+1))):
dp[j] = max((dp[j-1]+a*(x-(j-1)))*(j-1>=0), (dp[j]+a*(N-(i-j)-x))*(j<=i-1))
print((max(dp)))
| 11 | 11 | 349 | 343 |
N = int(eval(input()))
D = []
for i, a in enumerate(map(int, input().split())):
D.append((a << 11) + i)
D.sort(reverse=True)
dp = [0] * (N + 1)
for i, d in enumerate(D, start=1):
x, a = d % (1 << 11), d >> 11
for j in reversed(list(range(0, i + 1))):
dp[j] = max(
(dp[j - 1] + a * abs(x - (j - 1))) * (j - 1 >= 0),
(dp[j] + a * abs(N - (i - j) - x)) * (j <= i - 1),
)
print((max(dp)))
|
N = int(eval(input()))
D = []
for i, a in enumerate(map(int, input().split())):
D.append((a << 11) + i)
D.sort(reverse=True)
dp = [0] * (N + 1)
for i, d in enumerate(D, start=1):
x, a = d % (1 << 11), d >> 11
for j in reversed(list(range(0, i + 1))):
dp[j] = max(
(dp[j - 1] + a * (x - (j - 1))) * (j - 1 >= 0),
(dp[j] + a * (N - (i - j) - x)) * (j <= i - 1),
)
print((max(dp)))
| false | 0 |
[
"- (dp[j - 1] + a * abs(x - (j - 1))) * (j - 1 >= 0),",
"- (dp[j] + a * abs(N - (i - j) - x)) * (j <= i - 1),",
"+ (dp[j - 1] + a * (x - (j - 1))) * (j - 1 >= 0),",
"+ (dp[j] + a * (N - (i - j) - x)) * (j <= i - 1),"
] | false | 0.113727 | 0.113566 | 1.001415 |
[
"s851384855",
"s795711777"
] |
u117541450
|
p02703
|
python
|
s244434239
|
s507752198
| 1,330 | 1,205 | 97,040 | 98,464 |
Accepted
|
Accepted
| 9.4 |
import math
import heapq
N,M,S=list(map(int,input().split()))
Us=[0]*M
Vs=[0]*M
As=[0]*M
Bs=[0]*M
for i in range(M):
Us[i],Vs[i],As[i],Bs[i] = list(map(int,input().split()))
Us[i] -= 1
Vs[i] -= 1
# ---
V={}
Ns = max(As)*N
Nv=N*(Ns+1)
cnt=0
for i in range(N):
for ns in range(Ns+1):
V[(i,ns)]=cnt
cnt+=1
G=[[] for _ in range(Nv)]
if S > Ns:
S = Ns
# U <-> V
for _ in range(M):
u = Us.pop()
v = Vs.pop()
a = As.pop()
b = Bs.pop()
#
for i in range(Ns+1): # i = 0,..,Ns
ns_s = Ns - i
ns_g = ns_s - a
if ns_g >= 0:
# U -> V
G[ V[(u,ns_s)] ].append( (V[(v,ns_g)],b) )
# V -> U
G[ V[(v,ns_s)] ].append( (V[(u,ns_g)],b) )
#print(u,v,a,b,ns_s,ns_g,V[(u,ns_s)],V[(v,ns_g)])
# -----
for i in range(N):
c,d = list(map(int,input().split()))
for j in range(Ns): # j = 0,...,Ns-1
ns_s = j
ns_g = j + c
if ns_g > Ns:
ns_g = Ns
G[ V[(i,ns_s)] ].append( (V[(i,ns_g)],d) )
# -----
D=[math.inf]*Nv
q=[]
# -----
s=V[(0,S)]
D[s] = 0
heapq.heappush(q,(0,s))
while len(q) > 0:
p_cost,p_v = heapq.heappop(q)
if D[p_v] < p_cost:
continue
for e_to,e_cost in G[p_v]:
if D[ e_to ] > D[p_v] + e_cost:
D[e_to] = D[p_v] + e_cost
heapq.heappush(q, (D[e_to], e_to))
for i in range(1,N):
ans = min([D[i*(Ns+1)+v] for v in range(Ns+1)])
print(ans)
|
from scipy.sparse import coo_matrix
from scipy.sparse.csgraph import dijkstra
import numpy as np
N,M,S=list(map(int,input().split()))
Us=[0]*M
Vs=[0]*M
As=[0]*M
Bs=[0]*M
for i in range(M):
Us[i],Vs[i],As[i],Bs[i] = list(map(int,input().split()))
Us[i] -= 1
Vs[i] -= 1
# ---
V={}
Ns = max(As)*N
Nv=N*(Ns+1)
cnt=0
for i in range(N):
for ns in range(Ns+1):
V[(i,ns)]=cnt
cnt+=1
row=[]
col=[]
data=[]
if S > Ns:
S = Ns
# U <-> V
for _ in range(M):
u = Us.pop()
v = Vs.pop()
a = As.pop()
b = Bs.pop()
#
for i in range(Ns+1): # i = 0,..,Ns
ns_s = Ns - i
ns_g = ns_s - a
if ns_g >= 0:
# U -> V
row.append( V[(u,ns_s) ])
col.append( V[(v,ns_g)] )
data.append( b )
# V -> U
row.append( V[(v,ns_s) ])
col.append( V[(u,ns_g)] )
data.append( b )
# -----
for i in range(N):
c,d = list(map(int,input().split()))
for j in range(Ns): # j = 0,...,Ns-1
ns_s = j
ns_g = j + c
if ns_g > Ns:
ns_g = Ns
row.append( V[(i,ns_s) ])
col.append( V[(i,ns_g)] )
data.append( d )
graph=coo_matrix((data, (row, col)), shape=(Nv,Nv))
s=V[(0,S)]
dist_matrix = dijkstra(csgraph=graph, directed=True, indices = s)
for i in range(1,N):
ans = min([dist_matrix[i*(Ns+1)+v] for v in range(Ns+1)])
print((int(ans)))
| 78 | 73 | 1,538 | 1,494 |
import math
import heapq
N, M, S = list(map(int, input().split()))
Us = [0] * M
Vs = [0] * M
As = [0] * M
Bs = [0] * M
for i in range(M):
Us[i], Vs[i], As[i], Bs[i] = list(map(int, input().split()))
Us[i] -= 1
Vs[i] -= 1
# ---
V = {}
Ns = max(As) * N
Nv = N * (Ns + 1)
cnt = 0
for i in range(N):
for ns in range(Ns + 1):
V[(i, ns)] = cnt
cnt += 1
G = [[] for _ in range(Nv)]
if S > Ns:
S = Ns
# U <-> V
for _ in range(M):
u = Us.pop()
v = Vs.pop()
a = As.pop()
b = Bs.pop()
#
for i in range(Ns + 1): # i = 0,..,Ns
ns_s = Ns - i
ns_g = ns_s - a
if ns_g >= 0:
# U -> V
G[V[(u, ns_s)]].append((V[(v, ns_g)], b))
# V -> U
G[V[(v, ns_s)]].append((V[(u, ns_g)], b))
# print(u,v,a,b,ns_s,ns_g,V[(u,ns_s)],V[(v,ns_g)])
# -----
for i in range(N):
c, d = list(map(int, input().split()))
for j in range(Ns): # j = 0,...,Ns-1
ns_s = j
ns_g = j + c
if ns_g > Ns:
ns_g = Ns
G[V[(i, ns_s)]].append((V[(i, ns_g)], d))
# -----
D = [math.inf] * Nv
q = []
# -----
s = V[(0, S)]
D[s] = 0
heapq.heappush(q, (0, s))
while len(q) > 0:
p_cost, p_v = heapq.heappop(q)
if D[p_v] < p_cost:
continue
for e_to, e_cost in G[p_v]:
if D[e_to] > D[p_v] + e_cost:
D[e_to] = D[p_v] + e_cost
heapq.heappush(q, (D[e_to], e_to))
for i in range(1, N):
ans = min([D[i * (Ns + 1) + v] for v in range(Ns + 1)])
print(ans)
|
from scipy.sparse import coo_matrix
from scipy.sparse.csgraph import dijkstra
import numpy as np
N, M, S = list(map(int, input().split()))
Us = [0] * M
Vs = [0] * M
As = [0] * M
Bs = [0] * M
for i in range(M):
Us[i], Vs[i], As[i], Bs[i] = list(map(int, input().split()))
Us[i] -= 1
Vs[i] -= 1
# ---
V = {}
Ns = max(As) * N
Nv = N * (Ns + 1)
cnt = 0
for i in range(N):
for ns in range(Ns + 1):
V[(i, ns)] = cnt
cnt += 1
row = []
col = []
data = []
if S > Ns:
S = Ns
# U <-> V
for _ in range(M):
u = Us.pop()
v = Vs.pop()
a = As.pop()
b = Bs.pop()
#
for i in range(Ns + 1): # i = 0,..,Ns
ns_s = Ns - i
ns_g = ns_s - a
if ns_g >= 0:
# U -> V
row.append(V[(u, ns_s)])
col.append(V[(v, ns_g)])
data.append(b)
# V -> U
row.append(V[(v, ns_s)])
col.append(V[(u, ns_g)])
data.append(b)
# -----
for i in range(N):
c, d = list(map(int, input().split()))
for j in range(Ns): # j = 0,...,Ns-1
ns_s = j
ns_g = j + c
if ns_g > Ns:
ns_g = Ns
row.append(V[(i, ns_s)])
col.append(V[(i, ns_g)])
data.append(d)
graph = coo_matrix((data, (row, col)), shape=(Nv, Nv))
s = V[(0, S)]
dist_matrix = dijkstra(csgraph=graph, directed=True, indices=s)
for i in range(1, N):
ans = min([dist_matrix[i * (Ns + 1) + v] for v in range(Ns + 1)])
print((int(ans)))
| false | 6.410256 |
[
"-import math",
"-import heapq",
"+from scipy.sparse import coo_matrix",
"+from scipy.sparse.csgraph import dijkstra",
"+import numpy as np",
"-G = [[] for _ in range(Nv)]",
"+row = []",
"+col = []",
"+data = []",
"- G[V[(u, ns_s)]].append((V[(v, ns_g)], b))",
"+ row.append(V[(u, ns_s)])",
"+ col.append(V[(v, ns_g)])",
"+ data.append(b)",
"- G[V[(v, ns_s)]].append((V[(u, ns_g)], b))",
"- # print(u,v,a,b,ns_s,ns_g,V[(u,ns_s)],V[(v,ns_g)])",
"+ row.append(V[(v, ns_s)])",
"+ col.append(V[(u, ns_g)])",
"+ data.append(b)",
"- G[V[(i, ns_s)]].append((V[(i, ns_g)], d))",
"-D = [math.inf] * Nv",
"-q = []",
"+ row.append(V[(i, ns_s)])",
"+ col.append(V[(i, ns_g)])",
"+ data.append(d)",
"+graph = coo_matrix((data, (row, col)), shape=(Nv, Nv))",
"-D[s] = 0",
"-heapq.heappush(q, (0, s))",
"-while len(q) > 0:",
"- p_cost, p_v = heapq.heappop(q)",
"- if D[p_v] < p_cost:",
"- continue",
"- for e_to, e_cost in G[p_v]:",
"- if D[e_to] > D[p_v] + e_cost:",
"- D[e_to] = D[p_v] + e_cost",
"- heapq.heappush(q, (D[e_to], e_to))",
"+dist_matrix = dijkstra(csgraph=graph, directed=True, indices=s)",
"- ans = min([D[i * (Ns + 1) + v] for v in range(Ns + 1)])",
"- print(ans)",
"+ ans = min([dist_matrix[i * (Ns + 1) + v] for v in range(Ns + 1)])",
"+ print((int(ans)))"
] | false | 0.082822 | 0.55717 | 0.148648 |
[
"s244434239",
"s507752198"
] |
u371132735
|
p02748
|
python
|
s811654175
|
s429270083
| 473 | 417 | 24,804 | 18,736 |
Accepted
|
Accepted
| 11.84 |
# hitachi2020_b.py
_, _, M = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
X = []
Y = []
C = []
amin = min(A)
bmin = min(B)
for i in range(M):
x, y, c = list(map(int, input().split()))
X.append(x)
Y.append(y)
C.append(c)
ans = amin+bmin
for i in range(M):
if ans >= A[X[i]-1]+B[Y[i]-1]-C[i]:
ans = A[X[i]-1]+B[Y[i]-1]-C[i]
print(ans)
|
A,B,M = list(map(int,input().split()))
Ai = list(map(int,input().split()))
Bi = list(map(int,input().split()))
amin = min(Ai)
bmin= min(Bi)
min = amin+bmin
for i in range(M):
xi,yi,ci = list(map(int,input().split()))
if Ai[xi-1] + Bi[yi-1] - ci < min:
min = Ai[xi-1] + Bi[yi-1] - ci
print(min)
| 20 | 11 | 428 | 295 |
# hitachi2020_b.py
_, _, M = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
X = []
Y = []
C = []
amin = min(A)
bmin = min(B)
for i in range(M):
x, y, c = list(map(int, input().split()))
X.append(x)
Y.append(y)
C.append(c)
ans = amin + bmin
for i in range(M):
if ans >= A[X[i] - 1] + B[Y[i] - 1] - C[i]:
ans = A[X[i] - 1] + B[Y[i] - 1] - C[i]
print(ans)
|
A, B, M = list(map(int, input().split()))
Ai = list(map(int, input().split()))
Bi = list(map(int, input().split()))
amin = min(Ai)
bmin = min(Bi)
min = amin + bmin
for i in range(M):
xi, yi, ci = list(map(int, input().split()))
if Ai[xi - 1] + Bi[yi - 1] - ci < min:
min = Ai[xi - 1] + Bi[yi - 1] - ci
print(min)
| false | 45 |
[
"-# hitachi2020_b.py",
"-_, _, M = list(map(int, input().split()))",
"-A = list(map(int, input().split()))",
"-B = list(map(int, input().split()))",
"-X = []",
"-Y = []",
"-C = []",
"-amin = min(A)",
"-bmin = min(B)",
"+A, B, M = list(map(int, input().split()))",
"+Ai = list(map(int, input().split()))",
"+Bi = list(map(int, input().split()))",
"+amin = min(Ai)",
"+bmin = min(Bi)",
"+min = amin + bmin",
"- x, y, c = list(map(int, input().split()))",
"- X.append(x)",
"- Y.append(y)",
"- C.append(c)",
"-ans = amin + bmin",
"-for i in range(M):",
"- if ans >= A[X[i] - 1] + B[Y[i] - 1] - C[i]:",
"- ans = A[X[i] - 1] + B[Y[i] - 1] - C[i]",
"-print(ans)",
"+ xi, yi, ci = list(map(int, input().split()))",
"+ if Ai[xi - 1] + Bi[yi - 1] - ci < min:",
"+ min = Ai[xi - 1] + Bi[yi - 1] - ci",
"+print(min)"
] | false | 0.040657 | 0.041896 | 0.970436 |
[
"s811654175",
"s429270083"
] |
u902641880
|
p02910
|
python
|
s037939433
|
s805821198
| 170 | 17 | 38,384 | 2,940 |
Accepted
|
Accepted
| 90 |
order = eval(input())
if "R" in order[1::2] or "L" in order[::2]:
print("No")
else:
print("Yes")
|
n = eval(input())
if "L" in n[::2] or "R" in n[1::2]:
print("No")
else:
print("Yes")
| 5 | 5 | 98 | 92 |
order = eval(input())
if "R" in order[1::2] or "L" in order[::2]:
print("No")
else:
print("Yes")
|
n = eval(input())
if "L" in n[::2] or "R" in n[1::2]:
print("No")
else:
print("Yes")
| false | 0 |
[
"-order = eval(input())",
"-if \"R\" in order[1::2] or \"L\" in order[::2]:",
"+n = eval(input())",
"+if \"L\" in n[::2] or \"R\" in n[1::2]:"
] | false | 0.044037 | 0.044365 | 0.992609 |
[
"s037939433",
"s805821198"
] |
u292746386
|
p02888
|
python
|
s152569451
|
s104058421
| 1,888 | 1,192 | 3,316 | 3,188 |
Accepted
|
Accepted
| 36.86 |
from bisect import bisect_right
N = int(eval(input()))
L = list(map(int, input().split()))
L_sorted = sorted(L)
count = 0
for i in range(N): # longest stick
for j in range(i): # second longest stick
r = bisect_right(L_sorted, L_sorted[i] - L_sorted[j])
count += max(0, j - r)
print(count)
|
from bisect import bisect_right
N = int(eval(input()))
L = list(map(int, input().split()))
L_sorted = sorted(L)
count = 0
for i in range(N): # longest stick
for j in reversed(list(range(i))): # second longest stick
r = bisect_right(L_sorted, L_sorted[i] - L_sorted[j])
if j <= r:
break
else:
count += j - r
print(count)
| 14 | 18 | 321 | 383 |
from bisect import bisect_right
N = int(eval(input()))
L = list(map(int, input().split()))
L_sorted = sorted(L)
count = 0
for i in range(N): # longest stick
for j in range(i): # second longest stick
r = bisect_right(L_sorted, L_sorted[i] - L_sorted[j])
count += max(0, j - r)
print(count)
|
from bisect import bisect_right
N = int(eval(input()))
L = list(map(int, input().split()))
L_sorted = sorted(L)
count = 0
for i in range(N): # longest stick
for j in reversed(list(range(i))): # second longest stick
r = bisect_right(L_sorted, L_sorted[i] - L_sorted[j])
if j <= r:
break
else:
count += j - r
print(count)
| false | 22.222222 |
[
"- for j in range(i): # second longest stick",
"+ for j in reversed(list(range(i))): # second longest stick",
"- count += max(0, j - r)",
"+ if j <= r:",
"+ break",
"+ else:",
"+ count += j - r"
] | false | 0.112043 | 0.040228 | 2.785181 |
[
"s152569451",
"s104058421"
] |
u519939795
|
p03338
|
python
|
s796539383
|
s008070710
| 26 | 21 | 3,480 | 3,064 |
Accepted
|
Accepted
| 19.23 |
n=int(eval(input()))
s=eval(input())
t=""
k=""
ans=0
l=[]
for i in range(1,n):
ans1=0
t=sorted(set(s[:i]))
k=sorted(set(s[i:]))
for i in t:
for j in k:
if i==j:
ans1+=1
l.append(ans1)
print((max(l)))
|
n=int(eval(input()))
s=eval(input())
t=""
k=""
ans=0
l=[]
for i in range(1,n):
ans1=0
t=sorted(set(s[:i]))
k=sorted(set(s[i:]))
for i in t:
for j in k:
if i==j:
ans1+=1
l.append(ans1)
print((max(l)))
| 16 | 16 | 264 | 256 |
n = int(eval(input()))
s = eval(input())
t = ""
k = ""
ans = 0
l = []
for i in range(1, n):
ans1 = 0
t = sorted(set(s[:i]))
k = sorted(set(s[i:]))
for i in t:
for j in k:
if i == j:
ans1 += 1
l.append(ans1)
print((max(l)))
|
n = int(eval(input()))
s = eval(input())
t = ""
k = ""
ans = 0
l = []
for i in range(1, n):
ans1 = 0
t = sorted(set(s[:i]))
k = sorted(set(s[i:]))
for i in t:
for j in k:
if i == j:
ans1 += 1
l.append(ans1)
print((max(l)))
| false | 0 |
[
"- l.append(ans1)",
"+ l.append(ans1)"
] | false | 0.077387 | 0.063649 | 1.215837 |
[
"s796539383",
"s008070710"
] |
u452512115
|
p03221
|
python
|
s672123841
|
s105395158
| 678 | 580 | 44,012 | 35,944 |
Accepted
|
Accepted
| 14.45 |
N,M = map(int,input().split())
PY = [tuple(map(int,input().split())) for i in range(M)]
#こういう書き方ができると暗記する
ypi = sorted((y,p,i) for i,(p,y) in enumerate(PY))
from collections import defaultdict
d = defaultdict(lambda: 0)
#list初期化
ans = [None] * M
for y,p,i in ypi:
d[p] += 1
#lenがMのansのlistに添字ではなくて、意図的に、iでインデックス指定で入れる。
#こうすることで、わざわざ探す処理なく、順番も入れ替えることなく処理が可能
ans[i] = str(p).zfill(6) + str(d[p]).zfill(6)
print(*ans, sep='\n')
|
N,M = list(map(int, input().split()))
piys = [[] for _ in range(N)]
for i in range(M):
p, y = list(map(int, input().split()))
piys[p-1].append((y,i))
ans = [None]*M
for p,iys in enumerate(piys):
iys.sort()
for k,(y,i) in enumerate(iys):
ans[i] = "%06d%06d" % (p+1,k+1)
for i in ans:
print(i)
| 19 | 14 | 464 | 346 |
N, M = map(int, input().split())
PY = [tuple(map(int, input().split())) for i in range(M)]
# こういう書き方ができると暗記する
ypi = sorted((y, p, i) for i, (p, y) in enumerate(PY))
from collections import defaultdict
d = defaultdict(lambda: 0)
# list初期化
ans = [None] * M
for y, p, i in ypi:
d[p] += 1
# lenがMのansのlistに添字ではなくて、意図的に、iでインデックス指定で入れる。
# こうすることで、わざわざ探す処理なく、順番も入れ替えることなく処理が可能
ans[i] = str(p).zfill(6) + str(d[p]).zfill(6)
print(*ans, sep="\n")
|
N, M = list(map(int, input().split()))
piys = [[] for _ in range(N)]
for i in range(M):
p, y = list(map(int, input().split()))
piys[p - 1].append((y, i))
ans = [None] * M
for p, iys in enumerate(piys):
iys.sort()
for k, (y, i) in enumerate(iys):
ans[i] = "%06d%06d" % (p + 1, k + 1)
for i in ans:
print(i)
| false | 26.315789 |
[
"-N, M = map(int, input().split())",
"-PY = [tuple(map(int, input().split())) for i in range(M)]",
"-# こういう書き方ができると暗記する",
"-ypi = sorted((y, p, i) for i, (p, y) in enumerate(PY))",
"-from collections import defaultdict",
"-",
"-d = defaultdict(lambda: 0)",
"-# list初期化",
"+N, M = list(map(int, input().split()))",
"+piys = [[] for _ in range(N)]",
"+for i in range(M):",
"+ p, y = list(map(int, input().split()))",
"+ piys[p - 1].append((y, i))",
"-for y, p, i in ypi:",
"- d[p] += 1",
"- # lenがMのansのlistに添字ではなくて、意図的に、iでインデックス指定で入れる。",
"- # こうすることで、わざわざ探す処理なく、順番も入れ替えることなく処理が可能",
"- ans[i] = str(p).zfill(6) + str(d[p]).zfill(6)",
"-print(*ans, sep=\"\\n\")",
"+for p, iys in enumerate(piys):",
"+ iys.sort()",
"+ for k, (y, i) in enumerate(iys):",
"+ ans[i] = \"%06d%06d\" % (p + 1, k + 1)",
"+for i in ans:",
"+ print(i)"
] | false | 0.095765 | 0.129034 | 0.742166 |
[
"s672123841",
"s105395158"
] |
u985929170
|
p02578
|
python
|
s395019627
|
s133449498
| 117 | 108 | 94,188 | 105,248 |
Accepted
|
Accepted
| 7.69 |
N = int(eval(input()))
li = list(map(int,input().split()))
humi = li[0]
ans = 0
for l in li[1:]:
if l <= humi:
ans += humi - l
else:
humi = l
print(ans)
|
N = int(eval(input()))
li = list(map(int,input().split()))
ans = 0
h = li[0]
for l in li[1:]:
h = max(h,l)
ans += h-l
print(ans)
| 10 | 8 | 179 | 137 |
N = int(eval(input()))
li = list(map(int, input().split()))
humi = li[0]
ans = 0
for l in li[1:]:
if l <= humi:
ans += humi - l
else:
humi = l
print(ans)
|
N = int(eval(input()))
li = list(map(int, input().split()))
ans = 0
h = li[0]
for l in li[1:]:
h = max(h, l)
ans += h - l
print(ans)
| false | 20 |
[
"-humi = li[0]",
"+h = li[0]",
"- if l <= humi:",
"- ans += humi - l",
"- else:",
"- humi = l",
"+ h = max(h, l)",
"+ ans += h - l"
] | false | 0.114978 | 0.043176 | 2.663017 |
[
"s395019627",
"s133449498"
] |
u565149926
|
p03457
|
python
|
s163423588
|
s144546480
| 392 | 320 | 27,300 | 3,060 |
Accepted
|
Accepted
| 18.37 |
N = int(eval(input()))
p = [list(map(int, input().split())) for _ in range(N)]
ans = True
for i in range(N):
if p[i][1] + p[i][2] > p[i][0]:
ans = False
break
if (p[i][1] + p[i][2]) % 2 != p[i][0] % 2:
ans = False
break
if ans:
print("Yes")
else:
print("No")
|
N = int(eval(input()))
for i in range(N):
t, x, y = list(map(int, input().split()))
if x + y > t or (x + y) % 2 != t % 2:
print("No")
exit()
print("Yes")
| 14 | 7 | 314 | 172 |
N = int(eval(input()))
p = [list(map(int, input().split())) for _ in range(N)]
ans = True
for i in range(N):
if p[i][1] + p[i][2] > p[i][0]:
ans = False
break
if (p[i][1] + p[i][2]) % 2 != p[i][0] % 2:
ans = False
break
if ans:
print("Yes")
else:
print("No")
|
N = int(eval(input()))
for i in range(N):
t, x, y = list(map(int, input().split()))
if x + y > t or (x + y) % 2 != t % 2:
print("No")
exit()
print("Yes")
| false | 50 |
[
"-p = [list(map(int, input().split())) for _ in range(N)]",
"-ans = True",
"- if p[i][1] + p[i][2] > p[i][0]:",
"- ans = False",
"- break",
"- if (p[i][1] + p[i][2]) % 2 != p[i][0] % 2:",
"- ans = False",
"- break",
"-if ans:",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"+ t, x, y = list(map(int, input().split()))",
"+ if x + y > t or (x + y) % 2 != t % 2:",
"+ print(\"No\")",
"+ exit()",
"+print(\"Yes\")"
] | false | 0.041687 | 0.042584 | 0.978933 |
[
"s163423588",
"s144546480"
] |
u652286295
|
p03693
|
python
|
s427752949
|
s326975505
| 21 | 17 | 3,316 | 2,940 |
Accepted
|
Accepted
| 19.05 |
r, g, b = input().split()
string = r + g + b
num = int(string)
if num % 4 == 0:
print("YES")
else:
print("NO")
|
r, g, b = input().split()
if int(r + g + b) % 4 == 0:
print("YES")
else:
print("NO")
| 7 | 5 | 124 | 96 |
r, g, b = input().split()
string = r + g + b
num = int(string)
if num % 4 == 0:
print("YES")
else:
print("NO")
|
r, g, b = input().split()
if int(r + g + b) % 4 == 0:
print("YES")
else:
print("NO")
| false | 28.571429 |
[
"-string = r + g + b",
"-num = int(string)",
"-if num % 4 == 0:",
"+if int(r + g + b) % 4 == 0:"
] | false | 0.0442 | 0.045969 | 0.961514 |
[
"s427752949",
"s326975505"
] |
u077291787
|
p03164
|
python
|
s280423963
|
s630103769
| 352 | 212 | 68,956 | 40,176 |
Accepted
|
Accepted
| 39.77 |
# E - Knapsack 2
from collections import defaultdict
def knapsack_heavy(limit: int, weight: list, value: list) -> int:
dp = defaultdict(lambda: 1 << 30) # dp[i] := minimum weight at value i
dp[0] = 0
for w, v in zip(weight, value):
for cur_v, cur_w in tuple(dp.items()):
if w + cur_w <= limit:
dp[v + cur_v] = min(dp[v + cur_v], w + cur_w)
return max(dp.keys())
def main():
N, W, *WV = list(map(int, open(0).read().split()))
print((knapsack_heavy(W, WV[::2], WV[1::2])))
if __name__ == "__main__":
main()
|
# E - Knapsack 2
def knapsack_heavy(weight_limit: int, weights: list, values: list) -> int:
max_value = sum(values)
dp = [0] + [1 << 30] * max_value # dp[i] := minimum weight at value i
for w, v in zip(weights, values):
for cur_v in range(max_value, v - 1, -1):
if dp[cur_v - v] + w < dp[cur_v]:
dp[cur_v] = dp[cur_v - v] + w
return max(v for v, w in enumerate(dp) if w <= weight_limit)
def main():
N, W, *WV = list(map(int, open(0).read().split()))
print((knapsack_heavy(W, WV[::2], WV[1::2])))
if __name__ == "__main__":
main()
| 21 | 18 | 588 | 608 |
# E - Knapsack 2
from collections import defaultdict
def knapsack_heavy(limit: int, weight: list, value: list) -> int:
dp = defaultdict(lambda: 1 << 30) # dp[i] := minimum weight at value i
dp[0] = 0
for w, v in zip(weight, value):
for cur_v, cur_w in tuple(dp.items()):
if w + cur_w <= limit:
dp[v + cur_v] = min(dp[v + cur_v], w + cur_w)
return max(dp.keys())
def main():
N, W, *WV = list(map(int, open(0).read().split()))
print((knapsack_heavy(W, WV[::2], WV[1::2])))
if __name__ == "__main__":
main()
|
# E - Knapsack 2
def knapsack_heavy(weight_limit: int, weights: list, values: list) -> int:
max_value = sum(values)
dp = [0] + [1 << 30] * max_value # dp[i] := minimum weight at value i
for w, v in zip(weights, values):
for cur_v in range(max_value, v - 1, -1):
if dp[cur_v - v] + w < dp[cur_v]:
dp[cur_v] = dp[cur_v - v] + w
return max(v for v, w in enumerate(dp) if w <= weight_limit)
def main():
N, W, *WV = list(map(int, open(0).read().split()))
print((knapsack_heavy(W, WV[::2], WV[1::2])))
if __name__ == "__main__":
main()
| false | 14.285714 |
[
"-from collections import defaultdict",
"-",
"-",
"-def knapsack_heavy(limit: int, weight: list, value: list) -> int:",
"- dp = defaultdict(lambda: 1 << 30) # dp[i] := minimum weight at value i",
"- dp[0] = 0",
"- for w, v in zip(weight, value):",
"- for cur_v, cur_w in tuple(dp.items()):",
"- if w + cur_w <= limit:",
"- dp[v + cur_v] = min(dp[v + cur_v], w + cur_w)",
"- return max(dp.keys())",
"+def knapsack_heavy(weight_limit: int, weights: list, values: list) -> int:",
"+ max_value = sum(values)",
"+ dp = [0] + [1 << 30] * max_value # dp[i] := minimum weight at value i",
"+ for w, v in zip(weights, values):",
"+ for cur_v in range(max_value, v - 1, -1):",
"+ if dp[cur_v - v] + w < dp[cur_v]:",
"+ dp[cur_v] = dp[cur_v - v] + w",
"+ return max(v for v, w in enumerate(dp) if w <= weight_limit)"
] | false | 0.037971 | 0.042108 | 0.90174 |
[
"s280423963",
"s630103769"
] |
u882564128
|
p03031
|
python
|
s808333188
|
s541549809
| 55 | 45 | 9,176 | 9,096 |
Accepted
|
Accepted
| 18.18 |
n, m = list(map(int, input().split(' ')))
k = []
s = []
for i in range(m):
a = list(map(int, input().split(' ')))
k.append(a[0])
s.append(a[1:])
p = list(map(int, input().split(' ')))
ans = 0
for i in range(2**n):
ri_cnt = 0
for j in range(m):
sw_cnt = 0
for l in range(k[j]):
if (i >> (s[j][l]-1)) & 1:
sw_cnt += 1
if sw_cnt % 2 == p[j]:
ri_cnt += 1
if ri_cnt == m:
ans += 1
print(ans)
|
n, m = list(map(int, input().split(' ')))
K = []
S = []
for i in range(m):
l = list(map(int, input().split(' ')))
K.append(l[0])
S.append(l[1:])
p = list(map(int, input().split(' ')))
ans = 0
for i in range(2**n):
light = 0
for j in range(m):
sw = 0
for s in S[j]:
if (i>>(s-1))&1:
sw += 1
if sw%2 == p[j]:
light+=1
if light == m:
ans += 1
print(ans)
| 22 | 21 | 499 | 460 |
n, m = list(map(int, input().split(" ")))
k = []
s = []
for i in range(m):
a = list(map(int, input().split(" ")))
k.append(a[0])
s.append(a[1:])
p = list(map(int, input().split(" ")))
ans = 0
for i in range(2**n):
ri_cnt = 0
for j in range(m):
sw_cnt = 0
for l in range(k[j]):
if (i >> (s[j][l] - 1)) & 1:
sw_cnt += 1
if sw_cnt % 2 == p[j]:
ri_cnt += 1
if ri_cnt == m:
ans += 1
print(ans)
|
n, m = list(map(int, input().split(" ")))
K = []
S = []
for i in range(m):
l = list(map(int, input().split(" ")))
K.append(l[0])
S.append(l[1:])
p = list(map(int, input().split(" ")))
ans = 0
for i in range(2**n):
light = 0
for j in range(m):
sw = 0
for s in S[j]:
if (i >> (s - 1)) & 1:
sw += 1
if sw % 2 == p[j]:
light += 1
if light == m:
ans += 1
print(ans)
| false | 4.545455 |
[
"-k = []",
"-s = []",
"+K = []",
"+S = []",
"- a = list(map(int, input().split(\" \")))",
"- k.append(a[0])",
"- s.append(a[1:])",
"+ l = list(map(int, input().split(\" \")))",
"+ K.append(l[0])",
"+ S.append(l[1:])",
"- ri_cnt = 0",
"+ light = 0",
"- sw_cnt = 0",
"- for l in range(k[j]):",
"- if (i >> (s[j][l] - 1)) & 1:",
"- sw_cnt += 1",
"- if sw_cnt % 2 == p[j]:",
"- ri_cnt += 1",
"- if ri_cnt == m:",
"+ sw = 0",
"+ for s in S[j]:",
"+ if (i >> (s - 1)) & 1:",
"+ sw += 1",
"+ if sw % 2 == p[j]:",
"+ light += 1",
"+ if light == m:"
] | false | 0.046329 | 0.050461 | 0.918121 |
[
"s808333188",
"s541549809"
] |
u699089116
|
p03379
|
python
|
s207488519
|
s903181029
| 413 | 183 | 93,780 | 104,664 |
Accepted
|
Accepted
| 55.69 |
n = int(eval(input()))
x = list(map(int, input().split()))
x_sorted = sorted(x)
cs = x_sorted[n // 2 - 1]
cb = x_sorted[n // 2]
for i, v in enumerate(x):
if v <= cs:
print(cb)
else:
print(cs)
|
n = int(eval(input()))
X = list(map(int, input().split()))
sort_x = sorted(X)
smaller = sort_x[n//2-1]
bigger = sort_x[n//2]
for x in X:
if x <= smaller:
print(bigger)
else:
print(smaller)
| 12 | 12 | 222 | 219 |
n = int(eval(input()))
x = list(map(int, input().split()))
x_sorted = sorted(x)
cs = x_sorted[n // 2 - 1]
cb = x_sorted[n // 2]
for i, v in enumerate(x):
if v <= cs:
print(cb)
else:
print(cs)
|
n = int(eval(input()))
X = list(map(int, input().split()))
sort_x = sorted(X)
smaller = sort_x[n // 2 - 1]
bigger = sort_x[n // 2]
for x in X:
if x <= smaller:
print(bigger)
else:
print(smaller)
| false | 0 |
[
"-x = list(map(int, input().split()))",
"-x_sorted = sorted(x)",
"-cs = x_sorted[n // 2 - 1]",
"-cb = x_sorted[n // 2]",
"-for i, v in enumerate(x):",
"- if v <= cs:",
"- print(cb)",
"+X = list(map(int, input().split()))",
"+sort_x = sorted(X)",
"+smaller = sort_x[n // 2 - 1]",
"+bigger = sort_x[n // 2]",
"+for x in X:",
"+ if x <= smaller:",
"+ print(bigger)",
"- print(cs)",
"+ print(smaller)"
] | false | 0.04475 | 0.080555 | 0.555526 |
[
"s207488519",
"s903181029"
] |
u647766105
|
p02258
|
python
|
s680351273
|
s846747492
| 1,550 | 450 | 4,216 | 15,656 |
Accepted
|
Accepted
| 70.97 |
mini = pre = float("inf")
def f(n):
global mini, pre
mini = min(mini, pre)
pre = n
return n - mini
print(max(f(eval(input())) for _ in range(eval(input()))))
|
from itertools import islice
def maximum_profit(rate):
ret = -float("inf")
mi = rate[0]
for r in islice(rate, 1, len(rate)):
ret = max(ret, r - mi)
mi = min(mi, r)
return ret
if __name__ == "__main__":
R = [int(eval(input())) for _ in range(int(eval(input())))]
print((maximum_profit(R)))
| 7 | 14 | 167 | 330 |
mini = pre = float("inf")
def f(n):
global mini, pre
mini = min(mini, pre)
pre = n
return n - mini
print(max(f(eval(input())) for _ in range(eval(input()))))
|
from itertools import islice
def maximum_profit(rate):
ret = -float("inf")
mi = rate[0]
for r in islice(rate, 1, len(rate)):
ret = max(ret, r - mi)
mi = min(mi, r)
return ret
if __name__ == "__main__":
R = [int(eval(input())) for _ in range(int(eval(input())))]
print((maximum_profit(R)))
| false | 50 |
[
"-mini = pre = float(\"inf\")",
"+from itertools import islice",
"-def f(n):",
"- global mini, pre",
"- mini = min(mini, pre)",
"- pre = n",
"- return n - mini",
"+def maximum_profit(rate):",
"+ ret = -float(\"inf\")",
"+ mi = rate[0]",
"+ for r in islice(rate, 1, len(rate)):",
"+ ret = max(ret, r - mi)",
"+ mi = min(mi, r)",
"+ return ret",
"-print(max(f(eval(input())) for _ in range(eval(input()))))",
"+if __name__ == \"__main__\":",
"+ R = [int(eval(input())) for _ in range(int(eval(input())))]",
"+ print((maximum_profit(R)))"
] | false | 0.051949 | 0.036087 | 1.439527 |
[
"s680351273",
"s846747492"
] |
u350248178
|
p03682
|
python
|
s700341917
|
s074403262
| 1,625 | 1,446 | 91,088 | 90,952 |
Accepted
|
Accepted
| 11.02 |
import numpy as np
from scipy.sparse import csr_matrix
from scipy.sparse.csgraph import minimum_spanning_tree
from operator import itemgetter
n=int(eval(input()))
lx=[]
ly=[]
XY = [[i] + [int(x) for x in input().split()] for i in range(n)]
edge = set()
for key in [itemgetter(1),itemgetter(2)]:
XY.sort(key = key)
for i in range(n-1):
i1,x1,y1 = XY[i]
i2,x2,y2 = XY[i+1]
d = min(abs(x1-x2),abs(y1-y2))
edge.add((i1,i2,d))
row,col,value = list(zip(*edge))
value = np.array(value,dtype=int)
graph = csr_matrix((value,(row,col)),shape=(n,n))
tree = minimum_spanning_tree(graph,overwrite = True).astype(int)
print((tree.sum()))
|
import numpy as np
from scipy.sparse import csr_matrix
from scipy.sparse.csgraph import minimum_spanning_tree
from operator import itemgetter
import sys
input = sys.stdin.readline
n=int(eval(input()))
lx=[]
ly=[]
XY = [[i] + [int(x) for x in input().split()] for i in range(n)]
edge = set()
for key in [itemgetter(1),itemgetter(2)]:
XY.sort(key = key)
for i in range(n-1):
i1,x1,y1 = XY[i]
i2,x2,y2 = XY[i+1]
d = min(abs(x1-x2),abs(y1-y2))
edge.add((i1,i2,d))
row,col,value = list(zip(*edge))
value = np.array(value,dtype=int)
graph = csr_matrix((value,(row,col)),shape=(n,n))
tree = minimum_spanning_tree(graph,overwrite = True).astype(int)
print((tree.sum()))
| 23 | 25 | 674 | 714 |
import numpy as np
from scipy.sparse import csr_matrix
from scipy.sparse.csgraph import minimum_spanning_tree
from operator import itemgetter
n = int(eval(input()))
lx = []
ly = []
XY = [[i] + [int(x) for x in input().split()] for i in range(n)]
edge = set()
for key in [itemgetter(1), itemgetter(2)]:
XY.sort(key=key)
for i in range(n - 1):
i1, x1, y1 = XY[i]
i2, x2, y2 = XY[i + 1]
d = min(abs(x1 - x2), abs(y1 - y2))
edge.add((i1, i2, d))
row, col, value = list(zip(*edge))
value = np.array(value, dtype=int)
graph = csr_matrix((value, (row, col)), shape=(n, n))
tree = minimum_spanning_tree(graph, overwrite=True).astype(int)
print((tree.sum()))
|
import numpy as np
from scipy.sparse import csr_matrix
from scipy.sparse.csgraph import minimum_spanning_tree
from operator import itemgetter
import sys
input = sys.stdin.readline
n = int(eval(input()))
lx = []
ly = []
XY = [[i] + [int(x) for x in input().split()] for i in range(n)]
edge = set()
for key in [itemgetter(1), itemgetter(2)]:
XY.sort(key=key)
for i in range(n - 1):
i1, x1, y1 = XY[i]
i2, x2, y2 = XY[i + 1]
d = min(abs(x1 - x2), abs(y1 - y2))
edge.add((i1, i2, d))
row, col, value = list(zip(*edge))
value = np.array(value, dtype=int)
graph = csr_matrix((value, (row, col)), shape=(n, n))
tree = minimum_spanning_tree(graph, overwrite=True).astype(int)
print((tree.sum()))
| false | 8 |
[
"+import sys",
"+input = sys.stdin.readline"
] | false | 0.332217 | 0.667723 | 0.497537 |
[
"s700341917",
"s074403262"
] |
u758815106
|
p03160
|
python
|
s555295853
|
s895008218
| 125 | 97 | 20,648 | 84,804 |
Accepted
|
Accepted
| 22.4 |
#import math
#import numpy as np
N =int(eval(input()))
#=input()
#=map(int, input().split())
h =list(map(int, input().split()))
#=[input(), input()]
dp = [0] * N
dp[1] = abs(h[1] - h[0])
for i in range(2, N):
t1 = dp[i - 1] + abs(h[i] - h[i - 1])
t2 = dp[i - 2] + abs(h[i] - h[i - 2])
dp[i] = min(t1, t2)
print((dp[-1]))
|
#!/usr/bin/env python3
#import
#import math
#import numpy as np
N = int(eval(input()))
H = list(map(int, input().split()))
dp = [10**9] * N
dp[0] = 0
for i in range(N - 1):
dp[i + 1] = min(dp[i + 1], dp[i] + abs(H[i + 1] - H[i]))
if i < N - 2:
dp[i + 2] = min(dp[i + 2], dp[i] + abs(H[i + 2] - H[i]))
print((dp[-1]))
| 18 | 17 | 346 | 348 |
# import math
# import numpy as np
N = int(eval(input()))
# =input()
# =map(int, input().split())
h = list(map(int, input().split()))
# =[input(), input()]
dp = [0] * N
dp[1] = abs(h[1] - h[0])
for i in range(2, N):
t1 = dp[i - 1] + abs(h[i] - h[i - 1])
t2 = dp[i - 2] + abs(h[i] - h[i - 2])
dp[i] = min(t1, t2)
print((dp[-1]))
|
#!/usr/bin/env python3
# import
# import math
# import numpy as np
N = int(eval(input()))
H = list(map(int, input().split()))
dp = [10**9] * N
dp[0] = 0
for i in range(N - 1):
dp[i + 1] = min(dp[i + 1], dp[i] + abs(H[i + 1] - H[i]))
if i < N - 2:
dp[i + 2] = min(dp[i + 2], dp[i] + abs(H[i + 2] - H[i]))
print((dp[-1]))
| false | 5.555556 |
[
"+#!/usr/bin/env python3",
"+# import",
"-# =input()",
"-# =map(int, input().split())",
"-h = list(map(int, input().split()))",
"-# =[input(), input()]",
"-dp = [0] * N",
"-dp[1] = abs(h[1] - h[0])",
"-for i in range(2, N):",
"- t1 = dp[i - 1] + abs(h[i] - h[i - 1])",
"- t2 = dp[i - 2] + abs(h[i] - h[i - 2])",
"- dp[i] = min(t1, t2)",
"+H = list(map(int, input().split()))",
"+dp = [10**9] * N",
"+dp[0] = 0",
"+for i in range(N - 1):",
"+ dp[i + 1] = min(dp[i + 1], dp[i] + abs(H[i + 1] - H[i]))",
"+ if i < N - 2:",
"+ dp[i + 2] = min(dp[i + 2], dp[i] + abs(H[i + 2] - H[i]))"
] | false | 0.046646 | 0.046811 | 0.996466 |
[
"s555295853",
"s895008218"
] |
u691018832
|
p03639
|
python
|
s501446767
|
s955966143
| 71 | 64 | 14,252 | 12,496 |
Accepted
|
Accepted
| 9.86 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
cnt_0 = 0
cnt_2 = 0
for i in range(n):
if a[i] % 4 == 0:
cnt_2 += 1
elif a[i] % 2 == 1:
cnt_0 += 1
if (cnt_2 >= cnt_0 - 1 and cnt_2 + cnt_0 == n) or cnt_2 >= cnt_0:
print('Yes')
else:
print('No')
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n = int(readline())
a = list(map(int, readline().split()))
cnt = 0
memo = 0
for aa in a:
if aa % 4 == 0:
cnt += 1
elif aa % 2 == 1:
memo += 1
print(('Yes' if (cnt >= memo - 1 and cnt + memo == n) or cnt >= memo else 'No'))
| 16 | 16 | 335 | 408 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
cnt_0 = 0
cnt_2 = 0
for i in range(n):
if a[i] % 4 == 0:
cnt_2 += 1
elif a[i] % 2 == 1:
cnt_0 += 1
if (cnt_2 >= cnt_0 - 1 and cnt_2 + cnt_0 == n) or cnt_2 >= cnt_0:
print("Yes")
else:
print("No")
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
n = int(readline())
a = list(map(int, readline().split()))
cnt = 0
memo = 0
for aa in a:
if aa % 4 == 0:
cnt += 1
elif aa % 2 == 1:
memo += 1
print(("Yes" if (cnt >= memo - 1 and cnt + memo == n) or cnt >= memo else "No"))
| false | 0 |
[
"-input = sys.stdin.readline",
"-n = int(eval(input()))",
"-a = list(map(int, input().split()))",
"-cnt_0 = 0",
"-cnt_2 = 0",
"-for i in range(n):",
"- if a[i] % 4 == 0:",
"- cnt_2 += 1",
"- elif a[i] % 2 == 1:",
"- cnt_0 += 1",
"-if (cnt_2 >= cnt_0 - 1 and cnt_2 + cnt_0 == n) or cnt_2 >= cnt_0:",
"- print(\"Yes\")",
"-else:",
"- print(\"No\")",
"+read = sys.stdin.buffer.read",
"+readline = sys.stdin.buffer.readline",
"+readlines = sys.stdin.buffer.readlines",
"+sys.setrecursionlimit(10**7)",
"+n = int(readline())",
"+a = list(map(int, readline().split()))",
"+cnt = 0",
"+memo = 0",
"+for aa in a:",
"+ if aa % 4 == 0:",
"+ cnt += 1",
"+ elif aa % 2 == 1:",
"+ memo += 1",
"+print((\"Yes\" if (cnt >= memo - 1 and cnt + memo == n) or cnt >= memo else \"No\"))"
] | false | 0.044958 | 0.04581 | 0.981411 |
[
"s501446767",
"s955966143"
] |
u465900169
|
p03557
|
python
|
s670967865
|
s153473286
| 1,825 | 1,667 | 23,328 | 24,052 |
Accepted
|
Accepted
| 8.66 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort()
B.sort()
C.sort()
AB = [0]*N
total = 0
for i in range(N):
left = -1
right = N
while right-left>1:
mid = left + (right-left)//2
if A[mid]>=B[i]:
right = mid
else:
left = mid
AB[i]=right
for i in range(1,N):
AB[i]+=AB[i-1]
for i in range(N):
left = -1
right = N
while right-left>1:
mid = left + (right-left)//2
if B[mid]>=C[i]:
right = mid
else:
left = mid
if right!=0:
total+=AB[right-1]
print(total)
|
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort()
B.sort()
C.sort()
total = 0
for i in range(N):
left = -1
right = N
while right-left>1:
mid = left + (right-left)//2
if A[mid]>=B[i]:
right = mid
else:
left = mid
left2 = -1
right2 = N
while right2-left2>1:
mid2 = left2 + (right2-left2)//2
if C[mid2]>B[i]:
right2 = mid2
else:
left2 = mid2
total+=right*(N-right2)
print(total)
| 33 | 27 | 635 | 547 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort()
B.sort()
C.sort()
AB = [0] * N
total = 0
for i in range(N):
left = -1
right = N
while right - left > 1:
mid = left + (right - left) // 2
if A[mid] >= B[i]:
right = mid
else:
left = mid
AB[i] = right
for i in range(1, N):
AB[i] += AB[i - 1]
for i in range(N):
left = -1
right = N
while right - left > 1:
mid = left + (right - left) // 2
if B[mid] >= C[i]:
right = mid
else:
left = mid
if right != 0:
total += AB[right - 1]
print(total)
|
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort()
B.sort()
C.sort()
total = 0
for i in range(N):
left = -1
right = N
while right - left > 1:
mid = left + (right - left) // 2
if A[mid] >= B[i]:
right = mid
else:
left = mid
left2 = -1
right2 = N
while right2 - left2 > 1:
mid2 = left2 + (right2 - left2) // 2
if C[mid2] > B[i]:
right2 = mid2
else:
left2 = mid2
total += right * (N - right2)
print(total)
| false | 18.181818 |
[
"-AB = [0] * N",
"- AB[i] = right",
"-for i in range(1, N):",
"- AB[i] += AB[i - 1]",
"-for i in range(N):",
"- left = -1",
"- right = N",
"- while right - left > 1:",
"- mid = left + (right - left) // 2",
"- if B[mid] >= C[i]:",
"- right = mid",
"+ left2 = -1",
"+ right2 = N",
"+ while right2 - left2 > 1:",
"+ mid2 = left2 + (right2 - left2) // 2",
"+ if C[mid2] > B[i]:",
"+ right2 = mid2",
"- left = mid",
"- if right != 0:",
"- total += AB[right - 1]",
"+ left2 = mid2",
"+ total += right * (N - right2)"
] | false | 0.059461 | 0.055932 | 1.063105 |
[
"s670967865",
"s153473286"
] |
u623814058
|
p03999
|
python
|
s476034525
|
s409544614
| 36 | 32 | 8,924 | 9,072 |
Accepted
|
Accepted
| 11.11 |
S=eval(input())
l=len(S)
ls=[i for i in range(1,l)]
import itertools as it
a=0
for i in range(l):
for j in it.combinations(ls, i):
t='';p=0
for k in j:
t+=S[p:k]+'+'
p=k
t+=S[p:]
a+=eval(''.join(t))
print(a)
|
S=eval(input())
l=len(S)
import itertools as it
a=0
for i in range(l):
for j in it.combinations(list(range(1,l)), i):
t='';p=0
for k in j:
t+=S[p:k]+'+'
p=k
t+=S[p:]
a+=eval(''.join(t))
print(a)
| 15 | 14 | 237 | 213 |
S = eval(input())
l = len(S)
ls = [i for i in range(1, l)]
import itertools as it
a = 0
for i in range(l):
for j in it.combinations(ls, i):
t = ""
p = 0
for k in j:
t += S[p:k] + "+"
p = k
t += S[p:]
a += eval("".join(t))
print(a)
|
S = eval(input())
l = len(S)
import itertools as it
a = 0
for i in range(l):
for j in it.combinations(list(range(1, l)), i):
t = ""
p = 0
for k in j:
t += S[p:k] + "+"
p = k
t += S[p:]
a += eval("".join(t))
print(a)
| false | 6.666667 |
[
"-ls = [i for i in range(1, l)]",
"- for j in it.combinations(ls, i):",
"+ for j in it.combinations(list(range(1, l)), i):"
] | false | 0.036529 | 0.035483 | 1.029495 |
[
"s476034525",
"s409544614"
] |
u994988729
|
p03208
|
python
|
s646852780
|
s223977389
| 512 | 261 | 50,264 | 7,384 |
Accepted
|
Accepted
| 49.02 |
N, K = list(map(int, input().split()))
H = list(int(eval(input())) for _ in range(N))
H.sort()
ans = 10 ** 18
for i in range(N - K + 1):
tmp = H[i + K - 1] - H[i]
ans = min(ans, tmp)
print(ans)
|
N, K = list(map(int, input().split()))
H = [int(eval(input())) for _ in range(N)]
H.sort()
ans = 10 ** 18
for i in range(N - K + 1):
h1 = H[i]
h2 = H[i + K - 1]
ans = min(ans, h2 - h1)
print(ans)
| 8 | 9 | 197 | 203 |
N, K = list(map(int, input().split()))
H = list(int(eval(input())) for _ in range(N))
H.sort()
ans = 10**18
for i in range(N - K + 1):
tmp = H[i + K - 1] - H[i]
ans = min(ans, tmp)
print(ans)
|
N, K = list(map(int, input().split()))
H = [int(eval(input())) for _ in range(N)]
H.sort()
ans = 10**18
for i in range(N - K + 1):
h1 = H[i]
h2 = H[i + K - 1]
ans = min(ans, h2 - h1)
print(ans)
| false | 11.111111 |
[
"-H = list(int(eval(input())) for _ in range(N))",
"+H = [int(eval(input())) for _ in range(N)]",
"- tmp = H[i + K - 1] - H[i]",
"- ans = min(ans, tmp)",
"+ h1 = H[i]",
"+ h2 = H[i + K - 1]",
"+ ans = min(ans, h2 - h1)"
] | false | 0.092494 | 0.046669 | 1.981917 |
[
"s646852780",
"s223977389"
] |
u644907318
|
p03827
|
python
|
s003511840
|
s249446761
| 172 | 29 | 38,384 | 9,168 |
Accepted
|
Accepted
| 83.14 |
N = int(eval(input()))
S = input().strip()
cmax = 0
cnt = 0
for i in range(N):
if S[i]=="I":
cnt += 1
else:
cnt -= 1
cmax = max(cmax,cnt)
print(cmax)
|
N = int(eval(input()))
S = input().strip()
x = 0
xmax = 0
for i in range(N):
if S[i]=="I":
x += 1
xmax = max(xmax,x)
else:
x -= 1
print(xmax)
| 11 | 11 | 181 | 177 |
N = int(eval(input()))
S = input().strip()
cmax = 0
cnt = 0
for i in range(N):
if S[i] == "I":
cnt += 1
else:
cnt -= 1
cmax = max(cmax, cnt)
print(cmax)
|
N = int(eval(input()))
S = input().strip()
x = 0
xmax = 0
for i in range(N):
if S[i] == "I":
x += 1
xmax = max(xmax, x)
else:
x -= 1
print(xmax)
| false | 0 |
[
"-cmax = 0",
"-cnt = 0",
"+x = 0",
"+xmax = 0",
"- cnt += 1",
"+ x += 1",
"+ xmax = max(xmax, x)",
"- cnt -= 1",
"- cmax = max(cmax, cnt)",
"-print(cmax)",
"+ x -= 1",
"+print(xmax)"
] | false | 0.098269 | 0.035272 | 2.78607 |
[
"s003511840",
"s249446761"
] |
u347600233
|
p03208
|
python
|
s756880462
|
s139753166
| 250 | 228 | 8,280 | 8,280 |
Accepted
|
Accepted
| 8.8 |
n, k = list(map(int, input().split()))
h = sorted([int(eval(input())) for _ in range(n)])
min_diff = 10**9
for i in range(n - k + 1):
min_diff = min(min_diff, h[i + k - 1] - h[i])
print(min_diff)
|
n, k = list(map(int, input().split()))
h = sorted([int(eval(input())) for _ in range(n)])
print((min(h[i + k - 1] - h[i] for i in range(n - k + 1))))
| 6 | 3 | 192 | 137 |
n, k = list(map(int, input().split()))
h = sorted([int(eval(input())) for _ in range(n)])
min_diff = 10**9
for i in range(n - k + 1):
min_diff = min(min_diff, h[i + k - 1] - h[i])
print(min_diff)
|
n, k = list(map(int, input().split()))
h = sorted([int(eval(input())) for _ in range(n)])
print((min(h[i + k - 1] - h[i] for i in range(n - k + 1))))
| false | 50 |
[
"-min_diff = 10**9",
"-for i in range(n - k + 1):",
"- min_diff = min(min_diff, h[i + k - 1] - h[i])",
"-print(min_diff)",
"+print((min(h[i + k - 1] - h[i] for i in range(n - k + 1))))"
] | false | 0.039226 | 0.036171 | 1.08448 |
[
"s756880462",
"s139753166"
] |
u191874006
|
p02845
|
python
|
s741532565
|
s011353131
| 214 | 92 | 53,028 | 86,468 |
Accepted
|
Accepted
| 57.01 |
#!/usr/bin/env python3
#三井住友信託銀行プログラミングコンテスト2019 E
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n = I()
a = LI()
cnt = [0]*n
ans = 1
tmp = 3
for i in range(n):
if a[i] == 0:
ans *= tmp
ans %= mod
tmp -= 1
else:
ans *= cnt[a[i]-1]
ans %= mod
cnt[a[i]-1] -= 1
cnt[a[i]] += 1
print(ans)
|
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n = I()
a = LI()
ans = 1
cnt = [0] * (n+1)
for i in range(n):
if a[i] == 0:
ans *= 3 - cnt[0]
ans %= mod
else:
ans *= cnt[a[i]-1] - cnt[a[i]]
ans %= mod
cnt[a[i]] += 1
print(ans)
| 36 | 32 | 848 | 794 |
#!/usr/bin/env python3
# 三井住友信託銀行プログラミングコンテスト2019 E
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop, heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float("inf")
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
n = I()
a = LI()
cnt = [0] * n
ans = 1
tmp = 3
for i in range(n):
if a[i] == 0:
ans *= tmp
ans %= mod
tmp -= 1
else:
ans *= cnt[a[i] - 1]
ans %= mod
cnt[a[i] - 1] -= 1
cnt[a[i]] += 1
print(ans)
|
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop, heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float("inf")
def I():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
n = I()
a = LI()
ans = 1
cnt = [0] * (n + 1)
for i in range(n):
if a[i] == 0:
ans *= 3 - cnt[0]
ans %= mod
else:
ans *= cnt[a[i] - 1] - cnt[a[i]]
ans %= mod
cnt[a[i]] += 1
print(ans)
| false | 11.111111 |
[
"-# 三井住友信託銀行プログラミングコンテスト2019 E",
"-sys.setrecursionlimit(1000000)",
"+sys.setrecursionlimit(2147483647)",
"-cnt = [0] * n",
"-tmp = 3",
"+cnt = [0] * (n + 1)",
"- ans *= tmp",
"+ ans *= 3 - cnt[0]",
"- tmp -= 1",
"- ans *= cnt[a[i] - 1]",
"+ ans *= cnt[a[i] - 1] - cnt[a[i]]",
"- cnt[a[i] - 1] -= 1"
] | false | 0.117184 | 0.043954 | 2.66603 |
[
"s741532565",
"s011353131"
] |
u994988729
|
p02684
|
python
|
s912778340
|
s250690947
| 1,489 | 1,270 | 207,224 | 207,420 |
Accepted
|
Accepted
| 14.71 |
N, K = list(map(int, input().split()))
D = K.bit_length()
to = [[0] * D for _ in range(N)]
for i, a in enumerate(map(int, input().split())):
to[i][0] = a - 1
for j in range(D - 1):
for i in range(N):
h = to[i][j]
to[i][j+1] = to[h][j]
v = 0
for i in reversed(list(range(D))):
x = 1 << i
if x <= K:
v = to[v][i]
K -= x
print((v + 1))
|
N, K = list(map(int, input().split()))
D = K.bit_length()
to = [[0] * D for _ in range(N)]
for i, a in enumerate(map(int, input().split())):
to[i][0] = a - 1
for j in range(D - 1):
for i in range(N):
h = to[i][j]
to[i][j+1] = to[h][j]
v = 0
for i in reversed(list(range(D))):
if (K >> i) & 1:
v = to[v][i]
print((v + 1))
| 20 | 18 | 389 | 363 |
N, K = list(map(int, input().split()))
D = K.bit_length()
to = [[0] * D for _ in range(N)]
for i, a in enumerate(map(int, input().split())):
to[i][0] = a - 1
for j in range(D - 1):
for i in range(N):
h = to[i][j]
to[i][j + 1] = to[h][j]
v = 0
for i in reversed(list(range(D))):
x = 1 << i
if x <= K:
v = to[v][i]
K -= x
print((v + 1))
|
N, K = list(map(int, input().split()))
D = K.bit_length()
to = [[0] * D for _ in range(N)]
for i, a in enumerate(map(int, input().split())):
to[i][0] = a - 1
for j in range(D - 1):
for i in range(N):
h = to[i][j]
to[i][j + 1] = to[h][j]
v = 0
for i in reversed(list(range(D))):
if (K >> i) & 1:
v = to[v][i]
print((v + 1))
| false | 10 |
[
"- x = 1 << i",
"- if x <= K:",
"+ if (K >> i) & 1:",
"- K -= x"
] | false | 0.044613 | 0.04502 | 0.990966 |
[
"s912778340",
"s250690947"
] |
u324174308
|
p02402
|
python
|
s720942068
|
s027388469
| 140 | 30 | 5,004 | 4,972 |
Accepted
|
Accepted
| 78.57 |
n = int(input())
a = list(map(int, input().split()))
sm = 0
h = len(a) / 2
while h > 0:
for x in range(0,len(a)):
y = x
tmp = a[y]
while y - h >= 0 and a[y-h] > tmp:
a[y] = a[y-h]
y = y - h
a[y] = tmp
if h == 1:
h = 0
elif h / 2 != 0:
h = h / 2
else:
h = 1
for x in range(0,len(a)):
sm = sm + a[x]
print(a[0], a[len(a)-1], sm)
|
n = int(input())
a = list(map(int, input().split()))
a_ = sorted(a)
sum = 0
for e in a_:
sum += e
print("%d %d %d" %(a_[0], a_[-1], sum))
| 25 | 10 | 384 | 151 |
n = int(input())
a = list(map(int, input().split()))
sm = 0
h = len(a) / 2
while h > 0:
for x in range(0, len(a)):
y = x
tmp = a[y]
while y - h >= 0 and a[y - h] > tmp:
a[y] = a[y - h]
y = y - h
a[y] = tmp
if h == 1:
h = 0
elif h / 2 != 0:
h = h / 2
else:
h = 1
for x in range(0, len(a)):
sm = sm + a[x]
print(a[0], a[len(a) - 1], sm)
|
n = int(input())
a = list(map(int, input().split()))
a_ = sorted(a)
sum = 0
for e in a_:
sum += e
print("%d %d %d" % (a_[0], a_[-1], sum))
| false | 60 |
[
"-sm = 0",
"-h = len(a) / 2",
"-while h > 0:",
"- for x in range(0, len(a)):",
"- y = x",
"- tmp = a[y]",
"- while y - h >= 0 and a[y - h] > tmp:",
"- a[y] = a[y - h]",
"- y = y - h",
"- a[y] = tmp",
"- if h == 1:",
"- h = 0",
"- elif h / 2 != 0:",
"- h = h / 2",
"- else:",
"- h = 1",
"-for x in range(0, len(a)):",
"- sm = sm + a[x]",
"-print(a[0], a[len(a) - 1], sm)",
"+a_ = sorted(a)",
"+sum = 0",
"+for e in a_:",
"+ sum += e",
"+print(\"%d %d %d\" % (a_[0], a_[-1], sum))"
] | false | 0.083547 | 0.037908 | 2.203929 |
[
"s720942068",
"s027388469"
] |
u288147331
|
p03339
|
python
|
s984446511
|
s298642753
| 316 | 188 | 17,644 | 17,444 |
Accepted
|
Accepted
| 40.51 |
N = int(eval(input()))
S = eval(input())
wc = [0]
ec = [0]
for i in range(N):
if S[i] == "W":
wc.append(wc[i]+1)
ec.append(ec[i])
else:
wc.append(wc[i])
ec.append(ec[i]+1)
#print("wc : {}, ec : {}".format(wc, ec))
ans = ec[N]
for i in range(1, N):
#W -> cnt, E -> sum - cnt
tmp = wc[i] + ec[N] - ec[i+1]
ans = min(tmp, ans)
print(ans)
|
N = int(eval(input()))
S = list(eval(input()))
ans = [0] * N
#リーダーより東の東向きの人
ans[0] = S[1:].count("E")
#リーダーを東にずらしていく
for i in range(1, N):
ans[i] = ans[i-1]
if S[i-1] == "W":
ans[i] += 1
if S[i] == "E":
ans[i] -= 1
#print("ans : {}".format(ans))
print((min(ans)))
| 23 | 17 | 401 | 296 |
N = int(eval(input()))
S = eval(input())
wc = [0]
ec = [0]
for i in range(N):
if S[i] == "W":
wc.append(wc[i] + 1)
ec.append(ec[i])
else:
wc.append(wc[i])
ec.append(ec[i] + 1)
# print("wc : {}, ec : {}".format(wc, ec))
ans = ec[N]
for i in range(1, N):
# W -> cnt, E -> sum - cnt
tmp = wc[i] + ec[N] - ec[i + 1]
ans = min(tmp, ans)
print(ans)
|
N = int(eval(input()))
S = list(eval(input()))
ans = [0] * N
# リーダーより東の東向きの人
ans[0] = S[1:].count("E")
# リーダーを東にずらしていく
for i in range(1, N):
ans[i] = ans[i - 1]
if S[i - 1] == "W":
ans[i] += 1
if S[i] == "E":
ans[i] -= 1
# print("ans : {}".format(ans))
print((min(ans)))
| false | 26.086957 |
[
"-S = eval(input())",
"-wc = [0]",
"-ec = [0]",
"-for i in range(N):",
"- if S[i] == \"W\":",
"- wc.append(wc[i] + 1)",
"- ec.append(ec[i])",
"- else:",
"- wc.append(wc[i])",
"- ec.append(ec[i] + 1)",
"-# print(\"wc : {}, ec : {}\".format(wc, ec))",
"-ans = ec[N]",
"+S = list(eval(input()))",
"+ans = [0] * N",
"+# リーダーより東の東向きの人",
"+ans[0] = S[1:].count(\"E\")",
"+# リーダーを東にずらしていく",
"- # W -> cnt, E -> sum - cnt",
"- tmp = wc[i] + ec[N] - ec[i + 1]",
"- ans = min(tmp, ans)",
"-print(ans)",
"+ ans[i] = ans[i - 1]",
"+ if S[i - 1] == \"W\":",
"+ ans[i] += 1",
"+ if S[i] == \"E\":",
"+ ans[i] -= 1",
"+# print(\"ans : {}\".format(ans))",
"+print((min(ans)))"
] | false | 0.036458 | 0.038085 | 0.957276 |
[
"s984446511",
"s298642753"
] |
u442396147
|
p03171
|
python
|
s794962269
|
s278858605
| 1,299 | 611 | 173,448 | 120,032 |
Accepted
|
Accepted
| 52.96 |
# input
N = int(eval(input()))
As = list(map(int, input().split()))
# Nの偶奇。区間幅がNの偶奇と一致すれば太郎君目線
oe = N % 2
# def print_list(lis):
# for l in lis:
# print(l)
# score[i][j][p] : Asのi番目を左端、j番目を右端とした時の最終スコア
# p = 0 が太郎君目線、p = 1 が次郎くん目線
score = [[None for _ in range(N)] for _ in range(N)]
for i in range(N):
# 初期化
# 区間長さ1であれば1通りしかない
if oe == 1:
score[i][i] = As[i]
else:
score[i][i] = -As[i]
# print_list(score)
for k in range(1, N):
# 配列の幅を広げながら計算を進める
for i in range(0, N-k):
# if k == 0:
# continue
j = i + k
if i == N - 1:
if (k + 1) % 2 == oe:
score[i][j] = score[i][j-1] + As[j]
else:
score[i][j] = score[i][j-1] - As[j]
else:
# print(i,j)
if (k + 1) % 2 == oe:
score[i][j] = max(score[i+1][j] + As[i], score[i][j-1] + As[j])
else:
score[i][j] = min(score[i+1][j] - As[i], score[i][j-1] - As[j])
# print_list(score)
print((score[0][N-1]))
|
# input
N = int(eval(input()))
As = list(map(int, input().split()))
# Nの偶奇。区間幅がNの偶奇と一致すれば太郎君目線
oe = N % 2
# def print_list(lis):
# for l in lis:
# print(l)
# score[i][j][p] : Asのi番目を左端、j番目を右端とした時の最終スコア
# p = 0 が太郎君目線、p = 1 が次郎くん目線
score = [[0 for _ in range(N)] for _ in range(N)]
for i in range(N):
# 初期化
# 区間長さ1であれば1通りしかない
if oe == 1:
score[i][i] = As[i]
else:
score[i][i] = -As[i]
# print_list(score)
for k in range(1, N):
# 配列の幅を広げながら計算を進める
for i in range(0, N-k):
# if k == 0:
# continue
j = i + k
if i == N - 1:
if (k + 1) % 2 == oe:
score[i][j] = score[i][j-1] + As[j]
else:
score[i][j] = score[i][j-1] - As[j]
else:
# print(i,j)
if (k + 1) % 2 == oe:
score[i][j] = max(score[i+1][j] + As[i], score[i][j-1] + As[j])
else:
score[i][j] = min(score[i+1][j] - As[i], score[i][j-1] - As[j])
# print_list(score)
print((score[0][N-1]))
| 46 | 46 | 1,015 | 1,012 |
# input
N = int(eval(input()))
As = list(map(int, input().split()))
# Nの偶奇。区間幅がNの偶奇と一致すれば太郎君目線
oe = N % 2
# def print_list(lis):
# for l in lis:
# print(l)
# score[i][j][p] : Asのi番目を左端、j番目を右端とした時の最終スコア
# p = 0 が太郎君目線、p = 1 が次郎くん目線
score = [[None for _ in range(N)] for _ in range(N)]
for i in range(N):
# 初期化
# 区間長さ1であれば1通りしかない
if oe == 1:
score[i][i] = As[i]
else:
score[i][i] = -As[i]
# print_list(score)
for k in range(1, N):
# 配列の幅を広げながら計算を進める
for i in range(0, N - k):
# if k == 0:
# continue
j = i + k
if i == N - 1:
if (k + 1) % 2 == oe:
score[i][j] = score[i][j - 1] + As[j]
else:
score[i][j] = score[i][j - 1] - As[j]
else:
# print(i,j)
if (k + 1) % 2 == oe:
score[i][j] = max(score[i + 1][j] + As[i], score[i][j - 1] + As[j])
else:
score[i][j] = min(score[i + 1][j] - As[i], score[i][j - 1] - As[j])
# print_list(score)
print((score[0][N - 1]))
|
# input
N = int(eval(input()))
As = list(map(int, input().split()))
# Nの偶奇。区間幅がNの偶奇と一致すれば太郎君目線
oe = N % 2
# def print_list(lis):
# for l in lis:
# print(l)
# score[i][j][p] : Asのi番目を左端、j番目を右端とした時の最終スコア
# p = 0 が太郎君目線、p = 1 が次郎くん目線
score = [[0 for _ in range(N)] for _ in range(N)]
for i in range(N):
# 初期化
# 区間長さ1であれば1通りしかない
if oe == 1:
score[i][i] = As[i]
else:
score[i][i] = -As[i]
# print_list(score)
for k in range(1, N):
# 配列の幅を広げながら計算を進める
for i in range(0, N - k):
# if k == 0:
# continue
j = i + k
if i == N - 1:
if (k + 1) % 2 == oe:
score[i][j] = score[i][j - 1] + As[j]
else:
score[i][j] = score[i][j - 1] - As[j]
else:
# print(i,j)
if (k + 1) % 2 == oe:
score[i][j] = max(score[i + 1][j] + As[i], score[i][j - 1] + As[j])
else:
score[i][j] = min(score[i + 1][j] - As[i], score[i][j - 1] - As[j])
# print_list(score)
print((score[0][N - 1]))
| false | 0 |
[
"-score = [[None for _ in range(N)] for _ in range(N)]",
"+score = [[0 for _ in range(N)] for _ in range(N)]"
] | false | 0.032343 | 0.036825 | 0.878292 |
[
"s794962269",
"s278858605"
] |
u133936772
|
p02989
|
python
|
s508023141
|
s290742037
| 78 | 66 | 13,956 | 20,396 |
Accepted
|
Accepted
| 15.38 |
n,*l=list(map(int,open(0).read().split()));n//=2;l.sort();print((l[n]-l[~n]))
|
n,*d=list(map(int,open(0).read().split()))
l,r=sorted(d)[n//2-1:n//2+1]
print((r-l))
| 1 | 3 | 69 | 78 |
n, *l = list(map(int, open(0).read().split()))
n //= 2
l.sort()
print((l[n] - l[~n]))
|
n, *d = list(map(int, open(0).read().split()))
l, r = sorted(d)[n // 2 - 1 : n // 2 + 1]
print((r - l))
| false | 66.666667 |
[
"-n, *l = list(map(int, open(0).read().split()))",
"-n //= 2",
"-l.sort()",
"-print((l[n] - l[~n]))",
"+n, *d = list(map(int, open(0).read().split()))",
"+l, r = sorted(d)[n // 2 - 1 : n // 2 + 1]",
"+print((r - l))"
] | false | 0.040671 | 0.048143 | 0.844801 |
[
"s508023141",
"s290742037"
] |
u775681539
|
p02996
|
python
|
s230128286
|
s418294093
| 554 | 261 | 61,904 | 36,392 |
Accepted
|
Accepted
| 52.89 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from operator import itemgetter
def main():
N = int(readline())
tasks = []
for _ in range(N):
a, b = list(map(int, readline().split()))
tasks.append((a, b))
tasks.sort(key=itemgetter(1))
time = 0
for a, b in tasks:
time += a
if time > b:
print('No')
return
print('Yes')
if __name__ == '__main__':
main()
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
def main():
N = int(readline())
tasks = np.array(read().split(), np.int64).reshape((-1, 2))
tasks = tasks[np.argsort(tasks[..., 1]), ...]
tasks[..., 0] = np.add.accumulate(tasks[..., 0], axis=0)
tmp = tasks[..., 1]-tasks[..., 0]
if np.all(tmp>=0):
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| 22 | 18 | 527 | 514 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from operator import itemgetter
def main():
N = int(readline())
tasks = []
for _ in range(N):
a, b = list(map(int, readline().split()))
tasks.append((a, b))
tasks.sort(key=itemgetter(1))
time = 0
for a, b in tasks:
time += a
if time > b:
print("No")
return
print("Yes")
if __name__ == "__main__":
main()
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
def main():
N = int(readline())
tasks = np.array(read().split(), np.int64).reshape((-1, 2))
tasks = tasks[np.argsort(tasks[..., 1]), ...]
tasks[..., 0] = np.add.accumulate(tasks[..., 0], axis=0)
tmp = tasks[..., 1] - tasks[..., 0]
if np.all(tmp >= 0):
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
| false | 18.181818 |
[
"-from operator import itemgetter",
"+import numpy as np",
"- tasks = []",
"- for _ in range(N):",
"- a, b = list(map(int, readline().split()))",
"- tasks.append((a, b))",
"- tasks.sort(key=itemgetter(1))",
"- time = 0",
"- for a, b in tasks:",
"- time += a",
"- if time > b:",
"- print(\"No\")",
"- return",
"- print(\"Yes\")",
"+ tasks = np.array(read().split(), np.int64).reshape((-1, 2))",
"+ tasks = tasks[np.argsort(tasks[..., 1]), ...]",
"+ tasks[..., 0] = np.add.accumulate(tasks[..., 0], axis=0)",
"+ tmp = tasks[..., 1] - tasks[..., 0]",
"+ if np.all(tmp >= 0):",
"+ print(\"Yes\")",
"+ else:",
"+ print(\"No\")"
] | false | 0.045674 | 0.179235 | 0.254829 |
[
"s230128286",
"s418294093"
] |
u968166680
|
p02882
|
python
|
s210714553
|
s583294345
| 188 | 17 | 38,256 | 3,060 |
Accepted
|
Accepted
| 90.96 |
import sys
from math import atan, pi
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
a, b, x = list(map(int, readline().split()))
if x > a * a * b / 2:
angle = atan(2 * (a * a * b - x) / a ** 3)
else:
angle = atan(a * b * b / (2 * x))
print((angle / pi * 180))
return
if __name__ == '__main__':
main()
|
import sys
from math import atan, degrees
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
a, b, x = list(map(int, readline().split()))
if x > a * a * b / 2:
print((degrees(atan(2 * (a * a * b - x) / a ** 3))))
else:
print((degrees(atan(a * b * b / (2 * x)))))
return
if __name__ == '__main__':
main()
| 23 | 22 | 455 | 447 |
import sys
from math import atan, pi
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
def main():
a, b, x = list(map(int, readline().split()))
if x > a * a * b / 2:
angle = atan(2 * (a * a * b - x) / a**3)
else:
angle = atan(a * b * b / (2 * x))
print((angle / pi * 180))
return
if __name__ == "__main__":
main()
|
import sys
from math import atan, degrees
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
def main():
a, b, x = list(map(int, readline().split()))
if x > a * a * b / 2:
print((degrees(atan(2 * (a * a * b - x) / a**3))))
else:
print((degrees(atan(a * b * b / (2 * x)))))
return
if __name__ == "__main__":
main()
| false | 4.347826 |
[
"-from math import atan, pi",
"+from math import atan, degrees",
"- angle = atan(2 * (a * a * b - x) / a**3)",
"+ print((degrees(atan(2 * (a * a * b - x) / a**3))))",
"- angle = atan(a * b * b / (2 * x))",
"- print((angle / pi * 180))",
"+ print((degrees(atan(a * b * b / (2 * x)))))"
] | false | 0.044869 | 0.035542 | 1.26242 |
[
"s210714553",
"s583294345"
] |
u170201762
|
p03546
|
python
|
s608490204
|
s737789478
| 49 | 42 | 3,952 | 3,952 |
Accepted
|
Accepted
| 14.29 |
H,W = list(map(int,input().split()))
c = [list(map(int,input().split())) for i in range(10)]
import queue
def dist(i):
res = c[i][1]
que = queue.Queue()
path = []
for j in range(10):
if j != i and j != 1:
path.append(j)
for j in range(10):
if j != 1 and j != i and c[i][j] < res:
jpath = path.copy()
jpath.pop(jpath.index(j))
que.put((j,c[i][j],jpath))
while que.qsize():
j,cost,path = que.get()
if cost + c[j][1] < res:
res = cost + c[j][1]
for k in path:
if k != 1 and cost+c[j][k] < res:
kpath = path.copy()
kpath.pop(kpath.index(k))
que.put((k,cost+c[j][k],kpath))
return res
cost = []
for i in range(10):
cost.append(dist(i))
ans = 0
for i in range(H):
A = list(map(int,input().split()))
for j in range(W):
if A[j] != -1:
ans += cost[A[j]]
print(ans)
|
H,W = list(map(int,input().split()))
c = [list(map(int,input().split())) for i in range(10)]
import queue
d = c.copy()
for k in range(10):
for i in range(10):
for j in range(10):
if d[i][j] > d[i][k]+d[k][j]:
d[i][j] = d[i][k]+d[k][j]
cost = []
for i in range(10):
cost.append(d[i][1])
ans = 0
for i in range(H):
A = list(map(int,input().split()))
for j in range(W):
if A[j] != -1:
ans += cost[A[j]]
print(ans)
| 38 | 24 | 1,009 | 504 |
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for i in range(10)]
import queue
def dist(i):
res = c[i][1]
que = queue.Queue()
path = []
for j in range(10):
if j != i and j != 1:
path.append(j)
for j in range(10):
if j != 1 and j != i and c[i][j] < res:
jpath = path.copy()
jpath.pop(jpath.index(j))
que.put((j, c[i][j], jpath))
while que.qsize():
j, cost, path = que.get()
if cost + c[j][1] < res:
res = cost + c[j][1]
for k in path:
if k != 1 and cost + c[j][k] < res:
kpath = path.copy()
kpath.pop(kpath.index(k))
que.put((k, cost + c[j][k], kpath))
return res
cost = []
for i in range(10):
cost.append(dist(i))
ans = 0
for i in range(H):
A = list(map(int, input().split()))
for j in range(W):
if A[j] != -1:
ans += cost[A[j]]
print(ans)
|
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for i in range(10)]
import queue
d = c.copy()
for k in range(10):
for i in range(10):
for j in range(10):
if d[i][j] > d[i][k] + d[k][j]:
d[i][j] = d[i][k] + d[k][j]
cost = []
for i in range(10):
cost.append(d[i][1])
ans = 0
for i in range(H):
A = list(map(int, input().split()))
for j in range(W):
if A[j] != -1:
ans += cost[A[j]]
print(ans)
| false | 36.842105 |
[
"-",
"-def dist(i):",
"- res = c[i][1]",
"- que = queue.Queue()",
"- path = []",
"- for j in range(10):",
"- if j != i and j != 1:",
"- path.append(j)",
"- for j in range(10):",
"- if j != 1 and j != i and c[i][j] < res:",
"- jpath = path.copy()",
"- jpath.pop(jpath.index(j))",
"- que.put((j, c[i][j], jpath))",
"- while que.qsize():",
"- j, cost, path = que.get()",
"- if cost + c[j][1] < res:",
"- res = cost + c[j][1]",
"- for k in path:",
"- if k != 1 and cost + c[j][k] < res:",
"- kpath = path.copy()",
"- kpath.pop(kpath.index(k))",
"- que.put((k, cost + c[j][k], kpath))",
"- return res",
"-",
"-",
"+d = c.copy()",
"+for k in range(10):",
"+ for i in range(10):",
"+ for j in range(10):",
"+ if d[i][j] > d[i][k] + d[k][j]:",
"+ d[i][j] = d[i][k] + d[k][j]",
"- cost.append(dist(i))",
"+ cost.append(d[i][1])"
] | false | 0.038796 | 0.037902 | 1.023577 |
[
"s608490204",
"s737789478"
] |
u484229314
|
p03634
|
python
|
s122652647
|
s506849764
| 1,549 | 592 | 83,488 | 74,544 |
Accepted
|
Accepted
| 61.78 |
from collections import deque
import sys
sys.setrecursionlimit(10 ** 9)
N = int(eval(input()))
G = [[] for _ in range(N + 1)]
for i in range(N - 1):
a, b, c = [int(_) for _ in input().split()]
G[a].append((b, c))
G[b].append((a, c))
Q, K = [int(_) for _ in input().split()]
# make tree
G2 = [10 ** 12] * (N + 1)
G2[K] = 0
def f():
que = deque()
que.append((K, 0))
while que:
v, p = que.pop()
for nv, nc in G[v]:
if nv == p: continue
G2[nv] = G2[v] + nc
que.append((nv, v))
f()
for i in range(Q):
x, y = [int(_) for _ in input().split()]
print((G2[x] + G2[y]))
|
from collections import deque
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
G = [[] for _ in range(N + 1)]
for i in range(N - 1):
a, b, c = [int(_) for _ in input().split()]
G[a].append((b, c))
G[b].append((a, c))
Q, K = [int(_) for _ in input().split()]
# make tree
G2 = [10 ** 12] * (N + 1)
G2[K] = 0
def f():
que = deque()
que.append((K, 0))
while que:
v, p = que.pop()
for nv, nc in G[v]:
if nv == p: continue
G2[nv] = G2[v] + nc
que.append((nv, v))
f()
for i in range(Q):
x, y = [int(_) for _ in input().split()]
print((G2[x] + G2[y]))
| 36 | 38 | 681 | 711 |
from collections import deque
import sys
sys.setrecursionlimit(10**9)
N = int(eval(input()))
G = [[] for _ in range(N + 1)]
for i in range(N - 1):
a, b, c = [int(_) for _ in input().split()]
G[a].append((b, c))
G[b].append((a, c))
Q, K = [int(_) for _ in input().split()]
# make tree
G2 = [10**12] * (N + 1)
G2[K] = 0
def f():
que = deque()
que.append((K, 0))
while que:
v, p = que.pop()
for nv, nc in G[v]:
if nv == p:
continue
G2[nv] = G2[v] + nc
que.append((nv, v))
f()
for i in range(Q):
x, y = [int(_) for _ in input().split()]
print((G2[x] + G2[y]))
|
from collections import deque
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
N = int(eval(input()))
G = [[] for _ in range(N + 1)]
for i in range(N - 1):
a, b, c = [int(_) for _ in input().split()]
G[a].append((b, c))
G[b].append((a, c))
Q, K = [int(_) for _ in input().split()]
# make tree
G2 = [10**12] * (N + 1)
G2[K] = 0
def f():
que = deque()
que.append((K, 0))
while que:
v, p = que.pop()
for nv, nc in G[v]:
if nv == p:
continue
G2[nv] = G2[v] + nc
que.append((nv, v))
f()
for i in range(Q):
x, y = [int(_) for _ in input().split()]
print((G2[x] + G2[y]))
| false | 5.263158 |
[
"-sys.setrecursionlimit(10**9)",
"+input = sys.stdin.readline",
"+sys.setrecursionlimit(10**7)"
] | false | 0.038218 | 0.036475 | 1.047792 |
[
"s122652647",
"s506849764"
] |
u272028993
|
p03821
|
python
|
s093620071
|
s019900910
| 407 | 312 | 18,308 | 9,012 |
Accepted
|
Accepted
| 23.34 |
n=int(input())
ab=[list(map(int,input().split())) for _ in range(n)]
cnt=0
for i in range(n-1,-1,-1):
a,b=ab[i][0],ab[i][1]
if (a+cnt)%b==0:continue
cnt+=b-(a+cnt)%b
print(cnt)
|
n=int(input())
a=[]
b=[]
for i in range(n):
A,B=list(map(int,input().split()))
a.append(A)
b.append(B)
ans=0
for i in range(n-1,-1,-1):
if (a[i]+ans)%b[i]!=0:
ans+=b[i]-(a[i]+ans)%b[i]
print(ans)
| 8 | 12 | 199 | 233 |
n = int(input())
ab = [list(map(int, input().split())) for _ in range(n)]
cnt = 0
for i in range(n - 1, -1, -1):
a, b = ab[i][0], ab[i][1]
if (a + cnt) % b == 0:
continue
cnt += b - (a + cnt) % b
print(cnt)
|
n = int(input())
a = []
b = []
for i in range(n):
A, B = list(map(int, input().split()))
a.append(A)
b.append(B)
ans = 0
for i in range(n - 1, -1, -1):
if (a[i] + ans) % b[i] != 0:
ans += b[i] - (a[i] + ans) % b[i]
print(ans)
| false | 33.333333 |
[
"-ab = [list(map(int, input().split())) for _ in range(n)]",
"-cnt = 0",
"+a = []",
"+b = []",
"+for i in range(n):",
"+ A, B = list(map(int, input().split()))",
"+ a.append(A)",
"+ b.append(B)",
"+ans = 0",
"- a, b = ab[i][0], ab[i][1]",
"- if (a + cnt) % b == 0:",
"- continue",
"- cnt += b - (a + cnt) % b",
"-print(cnt)",
"+ if (a[i] + ans) % b[i] != 0:",
"+ ans += b[i] - (a[i] + ans) % b[i]",
"+print(ans)"
] | false | 0.095903 | 0.109305 | 0.877388 |
[
"s093620071",
"s019900910"
] |
u102445737
|
p02762
|
python
|
s955445005
|
s063356584
| 1,962 | 1,783 | 125,548 | 127,136 |
Accepted
|
Accepted
| 9.12 |
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
def ufinit(n):
global ufsz, ufances
ufsz = [1] * n
ufances = [0] * n
for i in range(n):
ufances[i] = i
def ufroot(x):
global ufances
a = []
y = x
while ufances[y] != y:
a.append(y)
y = ufances[y]
for z in a:
ufances[z] = y
return y
def ufconn(x,y):
global ufsz, ufances
i = ufroot(x)
j = ufroot(y)
if i==j:
return
#k = [i,j].min
k = j if (ufsz[i]<ufsz[j]) else i
if k==j:
ufances[i] = j
else:
ufances[j] = i
ufsz[k] = ufsz[i] + ufsz[j]
n,m,k = inm()
ufinit(n+1)
friend = [{} for i in range(n+1)]
for i in range(m):
a,b = inm()
friend[a][b] = 1
friend[b][a] = 1
ufconn(a,b)
blk = [{} for i in range(n+1)]
for i in range(k):
a,b = inm()
blk[a][b] = 1
blk[b][a] = 1
gr = {}
for i in range(1,n+1):
r = ufroot(i)
if r in gr:
gr[r] += 1
else:
gr[r] = 1
for i in range(1,n+1):
r = ufroot(i)
x = gr[r]-1
for f in friend[i]:
if ufroot(f)==r:
x -= 1
for f in blk[i]:
if ufroot(f)==r:
x -= 1
printn(str(x)+' ')
print("")
|
# # # # unionfind.py # # # #
# usage: uf = Unionfind(n) ; x = uf.root(y); uf.conn(a,b)
class Unionfind:
def __init__(s,n):
s.sz = [1] * n
s.ances = [i for i in range(n)]
def root(s,x):
a = []
y = x
while s.ances[y] != y:
a.append(y)
y = s.ances[y]
for z in a:
s.ances[z] = y
return y
def conn(s,x,y):
i = s.root(x)
j = s.root(y)
if i==j:
return
#k = [i,j].min
k = j if (s.sz[i]<s.sz[j]) else i
if k==j:
s.ances[i] = j
else:
s.ances[j] = i
s.sz[k] = s.sz[i] + s.sz[j]
# # # # end unionfind.py # # # #
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
n,m,k = inm()
uf = Unionfind(n+1)
friend = [{} for i in range(n+1)]
for i in range(m):
a,b = inm()
friend[a][b] = 1
friend[b][a] = 1
uf.conn(a,b)
blk = [{} for i in range(n+1)]
for i in range(k):
a,b = inm()
blk[a][b] = 1
blk[b][a] = 1
gr = {}
for i in range(1,n+1):
r = uf.root(i)
if r in gr:
gr[r] += 1
else:
gr[r] = 1
for i in range(1,n+1):
r = uf.root(i)
x = gr[r]-1
for f in friend[i]:
if uf.root(f)==r:
x -= 1
for f in blk[i]:
if uf.root(f)==r:
x -= 1
printn(str(x)+' ')
print("")
| 76 | 81 | 1,452 | 1,582 |
printn = lambda x: print(x, end="")
inn = lambda: int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda: input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
def ufinit(n):
global ufsz, ufances
ufsz = [1] * n
ufances = [0] * n
for i in range(n):
ufances[i] = i
def ufroot(x):
global ufances
a = []
y = x
while ufances[y] != y:
a.append(y)
y = ufances[y]
for z in a:
ufances[z] = y
return y
def ufconn(x, y):
global ufsz, ufances
i = ufroot(x)
j = ufroot(y)
if i == j:
return
# k = [i,j].min
k = j if (ufsz[i] < ufsz[j]) else i
if k == j:
ufances[i] = j
else:
ufances[j] = i
ufsz[k] = ufsz[i] + ufsz[j]
n, m, k = inm()
ufinit(n + 1)
friend = [{} for i in range(n + 1)]
for i in range(m):
a, b = inm()
friend[a][b] = 1
friend[b][a] = 1
ufconn(a, b)
blk = [{} for i in range(n + 1)]
for i in range(k):
a, b = inm()
blk[a][b] = 1
blk[b][a] = 1
gr = {}
for i in range(1, n + 1):
r = ufroot(i)
if r in gr:
gr[r] += 1
else:
gr[r] = 1
for i in range(1, n + 1):
r = ufroot(i)
x = gr[r] - 1
for f in friend[i]:
if ufroot(f) == r:
x -= 1
for f in blk[i]:
if ufroot(f) == r:
x -= 1
printn(str(x) + " ")
print("")
|
# # # # unionfind.py # # # #
# usage: uf = Unionfind(n) ; x = uf.root(y); uf.conn(a,b)
class Unionfind:
def __init__(s, n):
s.sz = [1] * n
s.ances = [i for i in range(n)]
def root(s, x):
a = []
y = x
while s.ances[y] != y:
a.append(y)
y = s.ances[y]
for z in a:
s.ances[z] = y
return y
def conn(s, x, y):
i = s.root(x)
j = s.root(y)
if i == j:
return
# k = [i,j].min
k = j if (s.sz[i] < s.sz[j]) else i
if k == j:
s.ances[i] = j
else:
s.ances[j] = i
s.sz[k] = s.sz[i] + s.sz[j]
# # # # end unionfind.py # # # #
printn = lambda x: print(x, end="")
inn = lambda: int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda: input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
n, m, k = inm()
uf = Unionfind(n + 1)
friend = [{} for i in range(n + 1)]
for i in range(m):
a, b = inm()
friend[a][b] = 1
friend[b][a] = 1
uf.conn(a, b)
blk = [{} for i in range(n + 1)]
for i in range(k):
a, b = inm()
blk[a][b] = 1
blk[b][a] = 1
gr = {}
for i in range(1, n + 1):
r = uf.root(i)
if r in gr:
gr[r] += 1
else:
gr[r] = 1
for i in range(1, n + 1):
r = uf.root(i)
x = gr[r] - 1
for f in friend[i]:
if uf.root(f) == r:
x -= 1
for f in blk[i]:
if uf.root(f) == r:
x -= 1
printn(str(x) + " ")
print("")
| false | 6.17284 |
[
"+# # # # unionfind.py # # # #",
"+# usage: uf = Unionfind(n) ; x = uf.root(y); uf.conn(a,b)",
"+class Unionfind:",
"+ def __init__(s, n):",
"+ s.sz = [1] * n",
"+ s.ances = [i for i in range(n)]",
"+",
"+ def root(s, x):",
"+ a = []",
"+ y = x",
"+ while s.ances[y] != y:",
"+ a.append(y)",
"+ y = s.ances[y]",
"+ for z in a:",
"+ s.ances[z] = y",
"+ return y",
"+",
"+ def conn(s, x, y):",
"+ i = s.root(x)",
"+ j = s.root(y)",
"+ if i == j:",
"+ return",
"+ # k = [i,j].min",
"+ k = j if (s.sz[i] < s.sz[j]) else i",
"+ if k == j:",
"+ s.ances[i] = j",
"+ else:",
"+ s.ances[j] = i",
"+ s.sz[k] = s.sz[i] + s.sz[j]",
"+",
"+",
"+# # # # end unionfind.py # # # #",
"-def ufinit(n):",
"- global ufsz, ufances",
"- ufsz = [1] * n",
"- ufances = [0] * n",
"- for i in range(n):",
"- ufances[i] = i",
"-",
"-",
"-def ufroot(x):",
"- global ufances",
"- a = []",
"- y = x",
"- while ufances[y] != y:",
"- a.append(y)",
"- y = ufances[y]",
"- for z in a:",
"- ufances[z] = y",
"- return y",
"-",
"-",
"-def ufconn(x, y):",
"- global ufsz, ufances",
"- i = ufroot(x)",
"- j = ufroot(y)",
"- if i == j:",
"- return",
"- # k = [i,j].min",
"- k = j if (ufsz[i] < ufsz[j]) else i",
"- if k == j:",
"- ufances[i] = j",
"- else:",
"- ufances[j] = i",
"- ufsz[k] = ufsz[i] + ufsz[j]",
"-",
"-",
"-ufinit(n + 1)",
"+uf = Unionfind(n + 1)",
"- ufconn(a, b)",
"+ uf.conn(a, b)",
"- r = ufroot(i)",
"+ r = uf.root(i)",
"- r = ufroot(i)",
"+ r = uf.root(i)",
"- if ufroot(f) == r:",
"+ if uf.root(f) == r:",
"- if ufroot(f) == r:",
"+ if uf.root(f) == r:"
] | false | 0.035663 | 0.058677 | 0.607794 |
[
"s955445005",
"s063356584"
] |
u595375942
|
p03127
|
python
|
s492290399
|
s712576150
| 725 | 88 | 14,508 | 16,296 |
Accepted
|
Accepted
| 87.86 |
from collections import deque
N = int(eval(input()))
A = deque(sorted(list(map(int, input().split()))))
while True:
if len(A) == 1:
break
while A[0] == 0:
A.popleft()
mod = A[0]
for i in range(1, len(A)):
A[i] = A[i]%mod
A = deque(sorted(A))
print((A[0]))
|
from fractions import gcd
N = int(eval(input()))
A = list(map(int, input().split()))
g = gcd(A[0], A[1])
for a in A[2:]:
g = gcd(g, a)
print(g)
| 15 | 9 | 307 | 151 |
from collections import deque
N = int(eval(input()))
A = deque(sorted(list(map(int, input().split()))))
while True:
if len(A) == 1:
break
while A[0] == 0:
A.popleft()
mod = A[0]
for i in range(1, len(A)):
A[i] = A[i] % mod
A = deque(sorted(A))
print((A[0]))
|
from fractions import gcd
N = int(eval(input()))
A = list(map(int, input().split()))
g = gcd(A[0], A[1])
for a in A[2:]:
g = gcd(g, a)
print(g)
| false | 40 |
[
"-from collections import deque",
"+from fractions import gcd",
"-A = deque(sorted(list(map(int, input().split()))))",
"-while True:",
"- if len(A) == 1:",
"- break",
"- while A[0] == 0:",
"- A.popleft()",
"- mod = A[0]",
"- for i in range(1, len(A)):",
"- A[i] = A[i] % mod",
"- A = deque(sorted(A))",
"-print((A[0]))",
"+A = list(map(int, input().split()))",
"+g = gcd(A[0], A[1])",
"+for a in A[2:]:",
"+ g = gcd(g, a)",
"+print(g)"
] | false | 0.040892 | 0.099533 | 0.410837 |
[
"s492290399",
"s712576150"
] |
u599114793
|
p02762
|
python
|
s212352522
|
s552125646
| 1,678 | 1,423 | 114,080 | 93,784 |
Accepted
|
Accepted
| 15.2 |
# UnionFind
class UnionFind():
def __init__(self, n):
# uf.parentsで各ノードの親をリストで返す
self.n = n
self.parents = [-1] * n
def find(self, x):
# uf.find(x)で処理を行う
# 要素xが属するグループの根を返す（経路圧縮）
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
# uf.union(x,y)で処理を行う
# 要素xが属するグループと要素yが属するグループを併合する
# 小さい部分木を大きい部分木にくっつける
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
# uf.size(x)で処理を行う
# 要素xが属するグループの要素数を返す
return -self.parents[self.find(x)]
def same(self, x, y):
# uf.same(x,y)で処理を行う
# 要素x,yが同じグループに属するかどうかを返す
return self.find(x) == self.find(y)
def members(self, x):
# uf.members(x)で処理を行う
# 要素xが属するグループに属する要素をリストで返す
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
# uf.roots()で処理を行う
# すべての根の要素をリストで返す
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
# uf.group_count()で処理を行う
# グループの数を返す
return len(self.roots())
def all_group_members(self):
# all_group_members()で処理を行う
# ｛ルート要素：[グループに属する要素のリスト]｝をdict型で返す
return {r: self.members(r) for r in self.roots()}
def __str__(self):
# ルート要素：[グループに属する要素のリスト]を文字列で返す
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
n,m,k = list(map(int,input().split()))
uf = UnionFind(n)
edge = []
anti_edge = [0]*(n+1)
for i in range(n+1):
edge.append([])
for i in range(m):
a,b = list(map(int,input().split()))
edge[a].append(b)
edge[b].append(a)
uf.union(a-1,b-1)
for i in range(k):
c,d = list(map(int,input().split()))
if uf.same(c-1,d-1):
anti_edge[c] += 1
anti_edge[d] += 1
for i in range(n):
size = uf.size(i)
friend = len(edge[i+1])
block = anti_edge[i+1]
print((size-1-friend-block))
|
# UnionFind
class UnionFind():
def __init__(self, n):
# uf.parentsで各ノードの親をリストで返す
self.n = n
self.parents = [-1] * n
def find(self, x):
# uf.find(x)で処理を行う
# 要素xが属するグループの根を返す（経路圧縮）
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
# uf.union(x,y)で処理を行う
# 要素xが属するグループと要素yが属するグループを併合する
# 小さい部分木を大きい部分木にくっつける
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
# uf.size(x)で処理を行う
# 要素xが属するグループの要素数を返す
return -self.parents[self.find(x)]
def same(self, x, y):
# uf.same(x,y)で処理を行う
# 要素x,yが同じグループに属するかどうかを返す
return self.find(x) == self.find(y)
def members(self, x):
# uf.members(x)で処理を行う
# 要素xが属するグループに属する要素をリストで返す
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
# uf.roots()で処理を行う
# すべての根の要素をリストで返す
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
# uf.group_count()で処理を行う
# グループの数を返す
return len(self.roots())
def all_group_members(self):
# all_group_members()で処理を行う
# ｛ルート要素：[グループに属する要素のリスト]｝をdict型で返す
return {r: self.members(r) for r in self.roots()}
def __str__(self):
# ルート要素：[グループに属する要素のリスト]を文字列で返す
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
n,m,k = list(map(int,input().split()))
uf = UnionFind(n)
edge = [0]*(n+1)
anti_edge = [0]*(n+1)
for i in range(m):
a,b = list(map(int,input().split()))
edge[a] += 1
edge[b] += 1
uf.union(a-1,b-1)
for i in range(k):
c,d = list(map(int,input().split()))
if uf.same(c-1,d-1):
anti_edge[c] += 1
anti_edge[d] += 1
for i in range(n):
size = uf.size(i)
friend = edge[i+1]
block = anti_edge[i+1]
print((size-1-friend-block))
| 92 | 90 | 2,360 | 2,309 |
# UnionFind
class UnionFind:
def __init__(self, n):
# uf.parentsで各ノードの親をリストで返す
self.n = n
self.parents = [-1] * n
def find(self, x):
# uf.find(x)で処理を行う
# 要素xが属するグループの根を返す（経路圧縮）
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
# uf.union(x,y)で処理を行う
# 要素xが属するグループと要素yが属するグループを併合する
# 小さい部分木を大きい部分木にくっつける
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
# uf.size(x)で処理を行う
# 要素xが属するグループの要素数を返す
return -self.parents[self.find(x)]
def same(self, x, y):
# uf.same(x,y)で処理を行う
# 要素x,yが同じグループに属するかどうかを返す
return self.find(x) == self.find(y)
def members(self, x):
# uf.members(x)で処理を行う
# 要素xが属するグループに属する要素をリストで返す
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
# uf.roots()で処理を行う
# すべての根の要素をリストで返す
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
# uf.group_count()で処理を行う
# グループの数を返す
return len(self.roots())
def all_group_members(self):
# all_group_members()で処理を行う
# ｛ルート要素：[グループに属する要素のリスト]｝をdict型で返す
return {r: self.members(r) for r in self.roots()}
def __str__(self):
# ルート要素：[グループに属する要素のリスト]を文字列で返す
return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots())
n, m, k = list(map(int, input().split()))
uf = UnionFind(n)
edge = []
anti_edge = [0] * (n + 1)
for i in range(n + 1):
edge.append([])
for i in range(m):
a, b = list(map(int, input().split()))
edge[a].append(b)
edge[b].append(a)
uf.union(a - 1, b - 1)
for i in range(k):
c, d = list(map(int, input().split()))
if uf.same(c - 1, d - 1):
anti_edge[c] += 1
anti_edge[d] += 1
for i in range(n):
size = uf.size(i)
friend = len(edge[i + 1])
block = anti_edge[i + 1]
print((size - 1 - friend - block))
|
# UnionFind
class UnionFind:
def __init__(self, n):
# uf.parentsで各ノードの親をリストで返す
self.n = n
self.parents = [-1] * n
def find(self, x):
# uf.find(x)で処理を行う
# 要素xが属するグループの根を返す（経路圧縮）
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
# uf.union(x,y)で処理を行う
# 要素xが属するグループと要素yが属するグループを併合する
# 小さい部分木を大きい部分木にくっつける
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
# uf.size(x)で処理を行う
# 要素xが属するグループの要素数を返す
return -self.parents[self.find(x)]
def same(self, x, y):
# uf.same(x,y)で処理を行う
# 要素x,yが同じグループに属するかどうかを返す
return self.find(x) == self.find(y)
def members(self, x):
# uf.members(x)で処理を行う
# 要素xが属するグループに属する要素をリストで返す
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
# uf.roots()で処理を行う
# すべての根の要素をリストで返す
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
# uf.group_count()で処理を行う
# グループの数を返す
return len(self.roots())
def all_group_members(self):
# all_group_members()で処理を行う
# ｛ルート要素：[グループに属する要素のリスト]｝をdict型で返す
return {r: self.members(r) for r in self.roots()}
def __str__(self):
# ルート要素：[グループに属する要素のリスト]を文字列で返す
return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots())
n, m, k = list(map(int, input().split()))
uf = UnionFind(n)
edge = [0] * (n + 1)
anti_edge = [0] * (n + 1)
for i in range(m):
a, b = list(map(int, input().split()))
edge[a] += 1
edge[b] += 1
uf.union(a - 1, b - 1)
for i in range(k):
c, d = list(map(int, input().split()))
if uf.same(c - 1, d - 1):
anti_edge[c] += 1
anti_edge[d] += 1
for i in range(n):
size = uf.size(i)
friend = edge[i + 1]
block = anti_edge[i + 1]
print((size - 1 - friend - block))
| false | 2.173913 |
[
"-edge = []",
"+edge = [0] * (n + 1)",
"-for i in range(n + 1):",
"- edge.append([])",
"- edge[a].append(b)",
"- edge[b].append(a)",
"+ edge[a] += 1",
"+ edge[b] += 1",
"- friend = len(edge[i + 1])",
"+ friend = edge[i + 1]"
] | false | 0.040395 | 0.04283 | 0.943154 |
[
"s212352522",
"s552125646"
] |
u380412651
|
p02732
|
python
|
s820688489
|
s054735994
| 380 | 314 | 81,872 | 24,980 |
Accepted
|
Accepted
| 17.37 |
import sys
myin = [x.rstrip() for x in sys.stdin.readlines()]
n = int(myin[0])
a = [int(x) for x in myin[1].split()]
cnt = [0] * (n+1)
for v in a:
cnt[v] += 1
tmp = 0
for c in cnt:
tmp += c * (c-1) // 2
for v in a:
print((tmp - cnt[v] + 1))
|
import sys
myin = sys.stdin.readlines()
n = int(myin[0])
a = [int(x) for x in myin[1].split()]
cnt = [0] * (n+1)
for v in a:
cnt[v] += 1
tmp = 0
for c in cnt:
tmp += c * (c-1) // 2
for v in a:
print((tmp - cnt[v] + 1))
| 15 | 15 | 267 | 245 |
import sys
myin = [x.rstrip() for x in sys.stdin.readlines()]
n = int(myin[0])
a = [int(x) for x in myin[1].split()]
cnt = [0] * (n + 1)
for v in a:
cnt[v] += 1
tmp = 0
for c in cnt:
tmp += c * (c - 1) // 2
for v in a:
print((tmp - cnt[v] + 1))
|
import sys
myin = sys.stdin.readlines()
n = int(myin[0])
a = [int(x) for x in myin[1].split()]
cnt = [0] * (n + 1)
for v in a:
cnt[v] += 1
tmp = 0
for c in cnt:
tmp += c * (c - 1) // 2
for v in a:
print((tmp - cnt[v] + 1))
| false | 0 |
[
"-myin = [x.rstrip() for x in sys.stdin.readlines()]",
"+myin = sys.stdin.readlines()"
] | false | 0.045212 | 0.046686 | 0.968419 |
[
"s820688489",
"s054735994"
] |
u912237403
|
p00112
|
python
|
s223020370
|
s035349573
| 160 | 40 | 4,540 | 4,536 |
Accepted
|
Accepted
| 75 |
while 1:
n=eval(input())
if n==0: break
x=sorted([eval(input()) for _ in [0]*n])
s=0
a=0
for e in x[:-1]: a+=e; s+=a
print(s)
|
while 1:
n=eval(input())
if n==0: break
x=sorted([int(input()) for _ in [0]*n])
s=0
a=0
for e in x[:-1]: a+=e; s+=a
print(s)
| 8 | 8 | 133 | 142 |
while 1:
n = eval(input())
if n == 0:
break
x = sorted([eval(input()) for _ in [0] * n])
s = 0
a = 0
for e in x[:-1]:
a += e
s += a
print(s)
|
while 1:
n = eval(input())
if n == 0:
break
x = sorted([int(input()) for _ in [0] * n])
s = 0
a = 0
for e in x[:-1]:
a += e
s += a
print(s)
| false | 0 |
[
"- x = sorted([eval(input()) for _ in [0] * n])",
"+ x = sorted([int(input()) for _ in [0] * n])"
] | false | 0.036498 | 0.040438 | 0.902567 |
[
"s223020370",
"s035349573"
] |
u143322814
|
p02641
|
python
|
s751595955
|
s532808237
| 29 | 25 | 9,132 | 9,116 |
Accepted
|
Accepted
| 13.79 |
def main():
x, n = list(map(int, input().split()))
p = set(map(int, input().split()))
if not x in p:
print(x)
else:
a = [abs(x-i) if not i in p else 1000 for i in range(-1, 102)]
print((a.index(min(a))-1))
if __name__ == "__main__":
main()
|
x, n = list(map(int, input().split()))
p = set(map(int, input().split()))
if not x in p:
print(x)
else:
a = [abs(x-i) if not i in p else 1000 for i in range(-1, 102)]
print((a.index(min(a))-1))
| 11 | 7 | 286 | 197 |
def main():
x, n = list(map(int, input().split()))
p = set(map(int, input().split()))
if not x in p:
print(x)
else:
a = [abs(x - i) if not i in p else 1000 for i in range(-1, 102)]
print((a.index(min(a)) - 1))
if __name__ == "__main__":
main()
|
x, n = list(map(int, input().split()))
p = set(map(int, input().split()))
if not x in p:
print(x)
else:
a = [abs(x - i) if not i in p else 1000 for i in range(-1, 102)]
print((a.index(min(a)) - 1))
| false | 36.363636 |
[
"-def main():",
"- x, n = list(map(int, input().split()))",
"- p = set(map(int, input().split()))",
"- if not x in p:",
"- print(x)",
"- else:",
"- a = [abs(x - i) if not i in p else 1000 for i in range(-1, 102)]",
"- print((a.index(min(a)) - 1))",
"-",
"-",
"-if __name__ == \"__main__\":",
"- main()",
"+x, n = list(map(int, input().split()))",
"+p = set(map(int, input().split()))",
"+if not x in p:",
"+ print(x)",
"+else:",
"+ a = [abs(x - i) if not i in p else 1000 for i in range(-1, 102)]",
"+ print((a.index(min(a)) - 1))"
] | false | 0.037497 | 0.096714 | 0.387713 |
[
"s751595955",
"s532808237"
] |
u788137651
|
p03329
|
python
|
s400810419
|
s065163230
| 350 | 216 | 3,956 | 3,828 |
Accepted
|
Accepted
| 38.29 |
N = int(eval(input()))
# DPだと思ったけど、2次元じゃなくて1次元だった
# けんちょんさん曰く、1次元でできないときに2次元で考える
sixes = [6 ** i for i in range(1, 7)]
nines = [9 ** i for i in range(1, 6)]
coin = [1] + sixes + nines
INF = 10**6
dp = [INF] * 100010
dp[0] = 0 # dp[i]:i円引き出すのに必要な回数
for money in range(1, N + 1):
dp_candidate = []
for coin_ in coin:
if money < coin_:
continue
else:
dp_candidate.append(dp[money-coin_] + 1)
dp[money] = min(dp_candidate)
print((dp[N]))
|
N = int(eval(input()))
sixes = [6 ** i for i in range(1, 7)]
nines = [9 ** i for i in range(1, 6)]
coin = [1] + sixes + nines
INF = 10**6
dp = [INF] * 100010
dp[0] = 0 # dp[i]:i円引き出すのに必要な回数
for money in range(1, N + 1):
dp[money] = min([dp[money-i] + 1 for i in coin if i <= money])
print((dp[N]))
| 18 | 10 | 496 | 304 |
N = int(eval(input()))
# DPだと思ったけど、2次元じゃなくて1次元だった
# けんちょんさん曰く、1次元でできないときに2次元で考える
sixes = [6**i for i in range(1, 7)]
nines = [9**i for i in range(1, 6)]
coin = [1] + sixes + nines
INF = 10**6
dp = [INF] * 100010
dp[0] = 0 # dp[i]:i円引き出すのに必要な回数
for money in range(1, N + 1):
dp_candidate = []
for coin_ in coin:
if money < coin_:
continue
else:
dp_candidate.append(dp[money - coin_] + 1)
dp[money] = min(dp_candidate)
print((dp[N]))
|
N = int(eval(input()))
sixes = [6**i for i in range(1, 7)]
nines = [9**i for i in range(1, 6)]
coin = [1] + sixes + nines
INF = 10**6
dp = [INF] * 100010
dp[0] = 0 # dp[i]:i円引き出すのに必要な回数
for money in range(1, N + 1):
dp[money] = min([dp[money - i] + 1 for i in coin if i <= money])
print((dp[N]))
| false | 44.444444 |
[
"-# DPだと思ったけど、2次元じゃなくて1次元だった",
"-# けんちょんさん曰く、1次元でできないときに2次元で考える",
"- dp_candidate = []",
"- for coin_ in coin:",
"- if money < coin_:",
"- continue",
"- else:",
"- dp_candidate.append(dp[money - coin_] + 1)",
"- dp[money] = min(dp_candidate)",
"+ dp[money] = min([dp[money - i] + 1 for i in coin if i <= money])"
] | false | 0.102881 | 0.061746 | 1.666211 |
[
"s400810419",
"s065163230"
] |
u923279197
|
p03294
|
python
|
s272948883
|
s924135734
| 170 | 20 | 5,344 | 3,316 |
Accepted
|
Accepted
| 88.24 |
import fractions
from functools import reduce
def lcm_base(x, y):
return (x * y) // fractions.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
n=int(eval(input()))
numbers=list(map(int,input().split()))
m=lcm(*numbers)-1
ans=0
for i in range(n):
ans+=m%numbers[i]
print(ans)
|
n=int(eval(input()))
numbers=list(map(int,input().split()))
ans=0
for i in range(n):
ans+=numbers[i]-1
print(ans)
| 13 | 6 | 308 | 116 |
import fractions
from functools import reduce
def lcm_base(x, y):
return (x * y) // fractions.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
n = int(eval(input()))
numbers = list(map(int, input().split()))
m = lcm(*numbers) - 1
ans = 0
for i in range(n):
ans += m % numbers[i]
print(ans)
|
n = int(eval(input()))
numbers = list(map(int, input().split()))
ans = 0
for i in range(n):
ans += numbers[i] - 1
print(ans)
| false | 53.846154 |
[
"-import fractions",
"-from functools import reduce",
"-",
"-",
"-def lcm_base(x, y):",
"- return (x * y) // fractions.gcd(x, y)",
"-",
"-",
"-def lcm(*numbers):",
"- return reduce(lcm_base, numbers, 1)",
"-",
"-",
"-m = lcm(*numbers) - 1",
"- ans += m % numbers[i]",
"+ ans += numbers[i] - 1"
] | false | 0.047642 | 0.070872 | 0.67222 |
[
"s272948883",
"s924135734"
] |
u692746605
|
p02803
|
python
|
s460847485
|
s331767934
| 855 | 548 | 3,444 | 3,188 |
Accepted
|
Accepted
| 35.91 |
H,W=list(map(int,input().split()))
S=[list(eval(input())) for i in range(H)]
m=0
for y in range(H):
for x in range(W):
if S[y][x]=="#":
continue
D=[[400]*W for i in range(H)]
D[y][x]=0
q=[]
q.append([x,y])
while len(q)>0:
c=list(q.pop(0))
for dx,dy in [[-1,0],[1,0],[0,-1],[0,1]]:
if c[1]+dy<0 or c[1]+dy>=H:
continue
if c[0]+dx<0 or c[0]+dx>=W:
continue
if S[c[1]+dy][c[0]+dx]==".":
if D[c[1]+dy][c[0]+dx]>D[c[1]][c[0]]+1:
D[c[1]+dy][c[0]+dx]=D[c[1]][c[0]]+1
q.append([c[0]+dx,c[1]+dy])
A=[[D[y][x] if D[y][x]!=400 else -1 for x in range(W)] for y in range(H)]
for i in range(H):
m=max(m,max(A[i]))
print(m)
|
INF=10**9+7
H,W=list(map(int,input().split()))
S=list()
q=list()
S.append(["#"]*(W+2))
for i in range(H):
S.append(["#"]+list(eval(input()))+["#"])
S.append(["#"]*(W+2))
m=0
for y in range(1,H+1):
for x in range(1,W+1):
if S[y][x]=="#":
continue
D=[[INF]*(W+2) for _ in range(H+2)]
D[y][x]=0
q.clear()
q.append([x,y])
while len(q)>0:
c=list(q.pop(0))
for dx,dy in [[-1,0],[1,0],[0,-1],[0,1]]:
ny,nx=c[1]+dy,c[0]+dx
if S[ny][nx]=="." and D[ny][nx]==INF:
D[ny][nx]=D[c[1]][c[0]]+1
q.append([nx,ny])
m=max(m,D[ny][nx])
print(m)
| 27 | 29 | 759 | 636 |
H, W = list(map(int, input().split()))
S = [list(eval(input())) for i in range(H)]
m = 0
for y in range(H):
for x in range(W):
if S[y][x] == "#":
continue
D = [[400] * W for i in range(H)]
D[y][x] = 0
q = []
q.append([x, y])
while len(q) > 0:
c = list(q.pop(0))
for dx, dy in [[-1, 0], [1, 0], [0, -1], [0, 1]]:
if c[1] + dy < 0 or c[1] + dy >= H:
continue
if c[0] + dx < 0 or c[0] + dx >= W:
continue
if S[c[1] + dy][c[0] + dx] == ".":
if D[c[1] + dy][c[0] + dx] > D[c[1]][c[0]] + 1:
D[c[1] + dy][c[0] + dx] = D[c[1]][c[0]] + 1
q.append([c[0] + dx, c[1] + dy])
A = [[D[y][x] if D[y][x] != 400 else -1 for x in range(W)] for y in range(H)]
for i in range(H):
m = max(m, max(A[i]))
print(m)
|
INF = 10**9 + 7
H, W = list(map(int, input().split()))
S = list()
q = list()
S.append(["#"] * (W + 2))
for i in range(H):
S.append(["#"] + list(eval(input())) + ["#"])
S.append(["#"] * (W + 2))
m = 0
for y in range(1, H + 1):
for x in range(1, W + 1):
if S[y][x] == "#":
continue
D = [[INF] * (W + 2) for _ in range(H + 2)]
D[y][x] = 0
q.clear()
q.append([x, y])
while len(q) > 0:
c = list(q.pop(0))
for dx, dy in [[-1, 0], [1, 0], [0, -1], [0, 1]]:
ny, nx = c[1] + dy, c[0] + dx
if S[ny][nx] == "." and D[ny][nx] == INF:
D[ny][nx] = D[c[1]][c[0]] + 1
q.append([nx, ny])
m = max(m, D[ny][nx])
print(m)
| false | 6.896552 |
[
"+INF = 10**9 + 7",
"-S = [list(eval(input())) for i in range(H)]",
"+S = list()",
"+q = list()",
"+S.append([\"#\"] * (W + 2))",
"+for i in range(H):",
"+ S.append([\"#\"] + list(eval(input())) + [\"#\"])",
"+S.append([\"#\"] * (W + 2))",
"-for y in range(H):",
"- for x in range(W):",
"+for y in range(1, H + 1):",
"+ for x in range(1, W + 1):",
"- D = [[400] * W for i in range(H)]",
"+ D = [[INF] * (W + 2) for _ in range(H + 2)]",
"- q = []",
"+ q.clear()",
"- if c[1] + dy < 0 or c[1] + dy >= H:",
"- continue",
"- if c[0] + dx < 0 or c[0] + dx >= W:",
"- continue",
"- if S[c[1] + dy][c[0] + dx] == \".\":",
"- if D[c[1] + dy][c[0] + dx] > D[c[1]][c[0]] + 1:",
"- D[c[1] + dy][c[0] + dx] = D[c[1]][c[0]] + 1",
"- q.append([c[0] + dx, c[1] + dy])",
"- A = [[D[y][x] if D[y][x] != 400 else -1 for x in range(W)] for y in range(H)]",
"- for i in range(H):",
"- m = max(m, max(A[i]))",
"+ ny, nx = c[1] + dy, c[0] + dx",
"+ if S[ny][nx] == \".\" and D[ny][nx] == INF:",
"+ D[ny][nx] = D[c[1]][c[0]] + 1",
"+ q.append([nx, ny])",
"+ m = max(m, D[ny][nx])"
] | false | 0.037206 | 0.038304 | 0.971325 |
[
"s460847485",
"s331767934"
] |
u933341648
|
p03273
|
python
|
s942394529
|
s956983913
| 29 | 18 | 4,468 | 3,060 |
Accepted
|
Accepted
| 37.93 |
h, w = map(int, input().split())
a = [input() for i in range(h)]
list_h = []
for i in range(len(a)):
if '#' not in a[i]:
list_h.append(i)
list_w = []
for i in range(len(a[0])):
if a[0][i] == '.':
for j in range(len(a)):
if a[j][i] == '#':
break
else:
list_w.append(i)
for i in range(len(a)):
if i not in list_h:
for j in range(len(a[0])):
if j not in list_w:
print(a[i][j], end='')
else:
print('')
|
h, w = list(map(int, input().split()))
a = [j for j in [eval(input()) for i in range(h)] if '#' in j]
a = [i for i in zip(*a) if '#' in i]
for i in zip(*a):
print((''.join(i)))
| 24 | 5 | 555 | 170 |
h, w = map(int, input().split())
a = [input() for i in range(h)]
list_h = []
for i in range(len(a)):
if "#" not in a[i]:
list_h.append(i)
list_w = []
for i in range(len(a[0])):
if a[0][i] == ".":
for j in range(len(a)):
if a[j][i] == "#":
break
else:
list_w.append(i)
for i in range(len(a)):
if i not in list_h:
for j in range(len(a[0])):
if j not in list_w:
print(a[i][j], end="")
else:
print("")
|
h, w = list(map(int, input().split()))
a = [j for j in [eval(input()) for i in range(h)] if "#" in j]
a = [i for i in zip(*a) if "#" in i]
for i in zip(*a):
print(("".join(i)))
| false | 79.166667 |
[
"-h, w = map(int, input().split())",
"-a = [input() for i in range(h)]",
"-list_h = []",
"-for i in range(len(a)):",
"- if \"#\" not in a[i]:",
"- list_h.append(i)",
"-list_w = []",
"-for i in range(len(a[0])):",
"- if a[0][i] == \".\":",
"- for j in range(len(a)):",
"- if a[j][i] == \"#\":",
"- break",
"- else:",
"- list_w.append(i)",
"-for i in range(len(a)):",
"- if i not in list_h:",
"- for j in range(len(a[0])):",
"- if j not in list_w:",
"- print(a[i][j], end=\"\")",
"- else:",
"- print(\"\")",
"+h, w = list(map(int, input().split()))",
"+a = [j for j in [eval(input()) for i in range(h)] if \"#\" in j]",
"+a = [i for i in zip(*a) if \"#\" in i]",
"+for i in zip(*a):",
"+ print((\"\".join(i)))"
] | false | 0.044499 | 0.045254 | 0.983324 |
[
"s942394529",
"s956983913"
] |
u073549161
|
p03699
|
python
|
s312295859
|
s330353131
| 179 | 124 | 38,384 | 4,268 |
Accepted
|
Accepted
| 30.73 |
n = int(eval(input()))
dat_s = []
for i in range(n):
dat_s.append(int(eval(input())))
total = sum(dat_s)
f = True
if total % 10 != 0:
print(total)
f = False
else:
dat_s.sort()
for i in range(len(dat_s)):
if dat_s[i] % 10 != 0:
print((total - dat_s[i]))
f = False
break
if f:
print("0")
|
n = int(eval(input()))
dat_s = []
for i in range(n):
dat_s.append(int(eval(input())))
# 0個選択したときのスコア(重複は意味がないのでset)
scores = set([0])
# 1～n問まで回す
for i in range(n):
# ここまでで可能性のあるスコアをbufferにいれて
b = set(scores)
while len(b) != 0:
# いまのn問目のスコアをこのスコアに足していく
scores.add(dat_s[i] + b.pop())
# 可能性のあるスコアの中から10で割り切れるスコアは消す(=0にする)
scores = [0 if x % 10 == 0 else x for x in scores]
print((max(scores)))
| 20 | 19 | 360 | 436 |
n = int(eval(input()))
dat_s = []
for i in range(n):
dat_s.append(int(eval(input())))
total = sum(dat_s)
f = True
if total % 10 != 0:
print(total)
f = False
else:
dat_s.sort()
for i in range(len(dat_s)):
if dat_s[i] % 10 != 0:
print((total - dat_s[i]))
f = False
break
if f:
print("0")
|
n = int(eval(input()))
dat_s = []
for i in range(n):
dat_s.append(int(eval(input())))
# 0個選択したときのスコア(重複は意味がないのでset)
scores = set([0])
# 1～n問まで回す
for i in range(n):
# ここまでで可能性のあるスコアをbufferにいれて
b = set(scores)
while len(b) != 0:
# いまのn問目のスコアをこのスコアに足していく
scores.add(dat_s[i] + b.pop())
# 可能性のあるスコアの中から10で割り切れるスコアは消す(=0にする)
scores = [0 if x % 10 == 0 else x for x in scores]
print((max(scores)))
| false | 5 |
[
"-total = sum(dat_s)",
"-f = True",
"-if total % 10 != 0:",
"- print(total)",
"- f = False",
"-else:",
"- dat_s.sort()",
"- for i in range(len(dat_s)):",
"- if dat_s[i] % 10 != 0:",
"- print((total - dat_s[i]))",
"- f = False",
"- break",
"-if f:",
"- print(\"0\")",
"+# 0個選択したときのスコア(重複は意味がないのでset)",
"+scores = set([0])",
"+# 1～n問まで回す",
"+for i in range(n):",
"+ # ここまでで可能性のあるスコアをbufferにいれて",
"+ b = set(scores)",
"+ while len(b) != 0:",
"+ # いまのn問目のスコアをこのスコアに足していく",
"+ scores.add(dat_s[i] + b.pop())",
"+# 可能性のあるスコアの中から10で割り切れるスコアは消す(=0にする)",
"+scores = [0 if x % 10 == 0 else x for x in scores]",
"+print((max(scores)))"
] | false | 0.033725 | 0.037008 | 0.911273 |
[
"s312295859",
"s330353131"
] |
u353919145
|
p03212
|
python
|
s915985278
|
s962399799
| 231 | 40 | 42,352 | 3,064 |
Accepted
|
Accepted
| 82.68 |
def dfs(s,flag):
if s>N:
return 0
ret =1 if flag==7 else 0
ret+=dfs(s*10+3,flag|1)
ret+=dfs(s*10+5,flag|2)
ret+=dfs(s*10+7,flag|4)
return ret
N=int(eval(input()))
print((dfs(0,0)))
|
def dfs(s,flag):
if s>upbd:
return 0
ret =1 if flag==7 else 0
ret+=dfs(s*10+3,flag|1)
ret+=dfs(s*10+5,flag|2)
ret+=dfs(s*10+7,flag|4)
return ret
upbd=int(eval(input()))
print((dfs(0,0)))
| 11 | 11 | 220 | 225 |
def dfs(s, flag):
if s > N:
return 0
ret = 1 if flag == 7 else 0
ret += dfs(s * 10 + 3, flag | 1)
ret += dfs(s * 10 + 5, flag | 2)
ret += dfs(s * 10 + 7, flag | 4)
return ret
N = int(eval(input()))
print((dfs(0, 0)))
|
def dfs(s, flag):
if s > upbd:
return 0
ret = 1 if flag == 7 else 0
ret += dfs(s * 10 + 3, flag | 1)
ret += dfs(s * 10 + 5, flag | 2)
ret += dfs(s * 10 + 7, flag | 4)
return ret
upbd = int(eval(input()))
print((dfs(0, 0)))
| false | 0 |
[
"- if s > N:",
"+ if s > upbd:",
"-N = int(eval(input()))",
"+upbd = int(eval(input()))"
] | false | 0.046803 | 0.041876 | 1.117671 |
[
"s915985278",
"s962399799"
] |
u346812984
|
p02936
|
python
|
s208259771
|
s684805594
| 1,950 | 1,729 | 266,800 | 268,436 |
Accepted
|
Accepted
| 11.33 |
import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N, Q = list(map(int, input().split()))
edges = [[] for _ in range(N + 1)]
nums = [0 for _ in range(N + 1)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
edges[a].append(b)
edges[b].append(a)
for _ in range(Q):
p, x = list(map(int, input().split()))
nums[p] += x
def dfs(now, parent):
for i in edges[now]:
if i != parent:
nums[i] += nums[now]
dfs(i, now)
dfs(1, 0)
for n in nums[1:]:
print(n)
if __name__ == "__main__":
main()
|
import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N, Q = map(int, input().split())
edges = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = map(lambda x: int(x) - 1, input().split())
edges[a].append(b)
edges[b].append(a)
counter = [0] * N
for _ in range(Q):
p, x = map(int, input().split())
p -= 1
counter[p] += x
def dfs(cur, par):
for nex in edges[cur]:
if nex == par:
continue
counter[nex] += counter[cur]
dfs(nex, cur)
dfs(0, -1)
print(*counter, sep=" ")
if __name__ == "__main__":
main()
| 38 | 38 | 752 | 782 |
import sys
sys.setrecursionlimit(10**6)
INF = float("inf")
MOD = 10**9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N, Q = list(map(int, input().split()))
edges = [[] for _ in range(N + 1)]
nums = [0 for _ in range(N + 1)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
edges[a].append(b)
edges[b].append(a)
for _ in range(Q):
p, x = list(map(int, input().split()))
nums[p] += x
def dfs(now, parent):
for i in edges[now]:
if i != parent:
nums[i] += nums[now]
dfs(i, now)
dfs(1, 0)
for n in nums[1:]:
print(n)
if __name__ == "__main__":
main()
|
import sys
sys.setrecursionlimit(10**6)
INF = float("inf")
MOD = 10**9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N, Q = map(int, input().split())
edges = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = map(lambda x: int(x) - 1, input().split())
edges[a].append(b)
edges[b].append(a)
counter = [0] * N
for _ in range(Q):
p, x = map(int, input().split())
p -= 1
counter[p] += x
def dfs(cur, par):
for nex in edges[cur]:
if nex == par:
continue
counter[nex] += counter[cur]
dfs(nex, cur)
dfs(0, -1)
print(*counter, sep=" ")
if __name__ == "__main__":
main()
| false | 0 |
[
"- N, Q = list(map(int, input().split()))",
"- edges = [[] for _ in range(N + 1)]",
"- nums = [0 for _ in range(N + 1)]",
"+ N, Q = map(int, input().split())",
"+ edges = [[] for _ in range(N)]",
"- a, b = list(map(int, input().split()))",
"+ a, b = map(lambda x: int(x) - 1, input().split())",
"+ counter = [0] * N",
"- p, x = list(map(int, input().split()))",
"- nums[p] += x",
"+ p, x = map(int, input().split())",
"+ p -= 1",
"+ counter[p] += x",
"- def dfs(now, parent):",
"- for i in edges[now]:",
"- if i != parent:",
"- nums[i] += nums[now]",
"- dfs(i, now)",
"+ def dfs(cur, par):",
"+ for nex in edges[cur]:",
"+ if nex == par:",
"+ continue",
"+ counter[nex] += counter[cur]",
"+ dfs(nex, cur)",
"- dfs(1, 0)",
"- for n in nums[1:]:",
"- print(n)",
"+ dfs(0, -1)",
"+ print(*counter, sep=\" \")"
] | false | 0.053393 | 0.036707 | 1.454569 |
[
"s208259771",
"s684805594"
] |
u124498235
|
p02887
|
python
|
s274640980
|
s410605394
| 53 | 45 | 3,316 | 4,084 |
Accepted
|
Accepted
| 15.09 |
n = int(eval(input()))
s = eval(input())
a = s[0]
b = s[0]
for i in range(n):
if b != s[i]:
b = s[i]
a += s[i]
print((len(a)))
|
n = int(eval(input()))
s = eval(input())
a = []
ss = list(s)
old = ""
ans = ""
for i in ss:
if old != i:
ans += i
old = i
print((len(ans)))
| 9 | 11 | 127 | 141 |
n = int(eval(input()))
s = eval(input())
a = s[0]
b = s[0]
for i in range(n):
if b != s[i]:
b = s[i]
a += s[i]
print((len(a)))
|
n = int(eval(input()))
s = eval(input())
a = []
ss = list(s)
old = ""
ans = ""
for i in ss:
if old != i:
ans += i
old = i
print((len(ans)))
| false | 18.181818 |
[
"-a = s[0]",
"-b = s[0]",
"-for i in range(n):",
"- if b != s[i]:",
"- b = s[i]",
"- a += s[i]",
"-print((len(a)))",
"+a = []",
"+ss = list(s)",
"+old = \"\"",
"+ans = \"\"",
"+for i in ss:",
"+ if old != i:",
"+ ans += i",
"+ old = i",
"+print((len(ans)))"
] | false | 0.041706 | 0.046409 | 0.898646 |
[
"s274640980",
"s410605394"
] |
u996665352
|
p02784
|
python
|
s210370051
|
s861292338
| 41 | 37 | 13,964 | 10,420 |
Accepted
|
Accepted
| 9.76 |
h,n=list(map(int,input().split()))
a=list(map(int,input().split()))
print(("Yes" if sum(a)>=h else "No"))
|
h,n=list(map(int,input().split()))
a=sum(map(int,input().split()))
print(("Yes" if a>=h else "No"))
| 3 | 3 | 99 | 93 |
h, n = list(map(int, input().split()))
a = list(map(int, input().split()))
print(("Yes" if sum(a) >= h else "No"))
|
h, n = list(map(int, input().split()))
a = sum(map(int, input().split()))
print(("Yes" if a >= h else "No"))
| false | 0 |
[
"-a = list(map(int, input().split()))",
"-print((\"Yes\" if sum(a) >= h else \"No\"))",
"+a = sum(map(int, input().split()))",
"+print((\"Yes\" if a >= h else \"No\"))"
] | false | 0.045513 | 0.044527 | 1.022139 |
[
"s210370051",
"s861292338"
] |
u285492845
|
p02657
|
python
|
s617435069
|
s634890644
| 24 | 22 | 9,152 | 9,136 |
Accepted
|
Accepted
| 8.33 |
s = input().split()
s = [int(i) for i in s]
print((s[0] * s[1]))
|
s = input().split()
s = [float(i) for i in s]
tmp = int(s[0] * ((s[1]*100) //100))
print(tmp)
| 3 | 6 | 65 | 100 |
s = input().split()
s = [int(i) for i in s]
print((s[0] * s[1]))
|
s = input().split()
s = [float(i) for i in s]
tmp = int(s[0] * ((s[1] * 100) // 100))
print(tmp)
| false | 50 |
[
"-s = [int(i) for i in s]",
"-print((s[0] * s[1]))",
"+s = [float(i) for i in s]",
"+tmp = int(s[0] * ((s[1] * 100) // 100))",
"+print(tmp)"
] | false | 0.107863 | 0.007212 | 14.955306 |
[
"s617435069",
"s634890644"
] |
u671060652
|
p02880
|
python
|
s969290709
|
s444659948
| 184 | 65 | 38,384 | 61,844 |
Accepted
|
Accepted
| 64.67 |
n = int(eval(input()))
def judge(n):
for i in range(1, 10):
for j in range(1, 10):
if n == i * j:
print("Yes")
return
print("No")
judge(n)
|
n = int(eval(input()))
for i in range(1,10):
if n % i == 0 and n / i <= 9:
print("Yes")
quit()
print("No")
| 14 | 8 | 210 | 129 |
n = int(eval(input()))
def judge(n):
for i in range(1, 10):
for j in range(1, 10):
if n == i * j:
print("Yes")
return
print("No")
judge(n)
|
n = int(eval(input()))
for i in range(1, 10):
if n % i == 0 and n / i <= 9:
print("Yes")
quit()
print("No")
| false | 42.857143 |
[
"-",
"-",
"-def judge(n):",
"- for i in range(1, 10):",
"- for j in range(1, 10):",
"- if n == i * j:",
"- print(\"Yes\")",
"- return",
"- print(\"No\")",
"-",
"-",
"-judge(n)",
"+for i in range(1, 10):",
"+ if n % i == 0 and n / i <= 9:",
"+ print(\"Yes\")",
"+ quit()",
"+print(\"No\")"
] | false | 0.04287 | 0.057409 | 0.746746 |
[
"s969290709",
"s444659948"
] |
u270681687
|
p03220
|
python
|
s115799527
|
s391594000
| 20 | 18 | 3,064 | 3,060 |
Accepted
|
Accepted
| 10 |
n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
temp = 10**6
index = 0
for i in range(n):
if temp > abs(a - (t - h[i] * 0.006)):
temp = abs(a - (t - h[i] * 0.006))
index = i + 1
print(index)
|
n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
diff = float('inf')
ans = 0
for i in range(n):
if abs(t - h[i] * 0.006 - a) < diff:
diff = abs(t - h[i] * 0.006 - a)
ans = i + 1
print(ans)
| 12 | 13 | 261 | 260 |
n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
temp = 10**6
index = 0
for i in range(n):
if temp > abs(a - (t - h[i] * 0.006)):
temp = abs(a - (t - h[i] * 0.006))
index = i + 1
print(index)
|
n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
diff = float("inf")
ans = 0
for i in range(n):
if abs(t - h[i] * 0.006 - a) < diff:
diff = abs(t - h[i] * 0.006 - a)
ans = i + 1
print(ans)
| false | 7.692308 |
[
"-temp = 10**6",
"-index = 0",
"+diff = float(\"inf\")",
"+ans = 0",
"- if temp > abs(a - (t - h[i] * 0.006)):",
"- temp = abs(a - (t - h[i] * 0.006))",
"- index = i + 1",
"-print(index)",
"+ if abs(t - h[i] * 0.006 - a) < diff:",
"+ diff = abs(t - h[i] * 0.006 - a)",
"+ ans = i + 1",
"+print(ans)"
] | false | 0.043929 | 0.045749 | 0.960224 |
[
"s115799527",
"s391594000"
] |
u977661421
|
p02784
|
python
|
s730863421
|
s406953596
| 57 | 44 | 13,836 | 13,836 |
Accepted
|
Accepted
| 22.81 |
# -*- coding: utf-8 -*-
h, n = list(map(int,input().split()))
a = [int(i) for i in input().split()]
for i in range(n):
h -= a[i]
if h <= 0:
print("Yes")
else:
print("No")
|
# -*- coding: utf-8 -*-
h, n = list(map(int,input().split()))
a = [int(i) for i in input().split()]
"""
for i in range(n):
h -= a[i]
"""
h -= sum(a)
if h <= 0:
print("Yes")
else:
print("No")
| 10 | 14 | 188 | 213 |
# -*- coding: utf-8 -*-
h, n = list(map(int, input().split()))
a = [int(i) for i in input().split()]
for i in range(n):
h -= a[i]
if h <= 0:
print("Yes")
else:
print("No")
|
# -*- coding: utf-8 -*-
h, n = list(map(int, input().split()))
a = [int(i) for i in input().split()]
"""
for i in range(n):
h -= a[i]
"""
h -= sum(a)
if h <= 0:
print("Yes")
else:
print("No")
| false | 28.571429 |
[
"+\"\"\"",
"+\"\"\"",
"+h -= sum(a)"
] | false | 0.045934 | 0.043653 | 1.052255 |
[
"s730863421",
"s406953596"
] |
u361381049
|
p03007
|
python
|
s154344161
|
s276397893
| 180 | 152 | 97,832 | 85,700 |
Accepted
|
Accepted
| 15.56 |
from collections import deque
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
if len(A) == 2:
print((A[1]-A[0]))
print((A[1],A[0]))
exit()
posi = deque([])
nega = deque([])
for i in A:
if i < 0:
nega.append(i)
else:
posi.append(i)
ans = []
if len(posi) == 0:
x = nega.pop()
y = nega.pop()
posi.append(x-y)
ans.append([x,y])
if len(nega) == 0:
x = posi.popleft()
y = posi.popleft()
nega.append(x-y)
ans.append([x,y])
while len(posi) > 1:
x = nega.pop()
y = posi.pop()
ans.append([x,y])
nega.append(x-y)
while len(nega) > 0:
x = posi.pop()
y = nega.pop()
ans.append([x,y])
posi.append(x-y)
print((posi[0]))
for i in range(N-1):
print((' '.join(map(str,ans[i]))))
|
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort()
p = 0
ans = -A[0]
for i in range(1,N-1):
if A[i] < 0:
p += 1
ans -= A[i]
else:
ans += A[i]
ans += A[-1]
print(ans)
for i in range(p+1,N-1):
print((A[p],A[i]))
A[p] -= A[i]
for i in range(p+1):
print((A[-1],A[i]))
A[-1] -= A[i]
| 41 | 19 | 812 | 350 |
from collections import deque
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
if len(A) == 2:
print((A[1] - A[0]))
print((A[1], A[0]))
exit()
posi = deque([])
nega = deque([])
for i in A:
if i < 0:
nega.append(i)
else:
posi.append(i)
ans = []
if len(posi) == 0:
x = nega.pop()
y = nega.pop()
posi.append(x - y)
ans.append([x, y])
if len(nega) == 0:
x = posi.popleft()
y = posi.popleft()
nega.append(x - y)
ans.append([x, y])
while len(posi) > 1:
x = nega.pop()
y = posi.pop()
ans.append([x, y])
nega.append(x - y)
while len(nega) > 0:
x = posi.pop()
y = nega.pop()
ans.append([x, y])
posi.append(x - y)
print((posi[0]))
for i in range(N - 1):
print((" ".join(map(str, ans[i]))))
|
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
p = 0
ans = -A[0]
for i in range(1, N - 1):
if A[i] < 0:
p += 1
ans -= A[i]
else:
ans += A[i]
ans += A[-1]
print(ans)
for i in range(p + 1, N - 1):
print((A[p], A[i]))
A[p] -= A[i]
for i in range(p + 1):
print((A[-1], A[i]))
A[-1] -= A[i]
| false | 53.658537 |
[
"-from collections import deque",
"-",
"-if len(A) == 2:",
"- print((A[1] - A[0]))",
"- print((A[1], A[0]))",
"- exit()",
"-posi = deque([])",
"-nega = deque([])",
"-for i in A:",
"- if i < 0:",
"- nega.append(i)",
"+p = 0",
"+ans = -A[0]",
"+for i in range(1, N - 1):",
"+ if A[i] < 0:",
"+ p += 1",
"+ ans -= A[i]",
"- posi.append(i)",
"-ans = []",
"-if len(posi) == 0:",
"- x = nega.pop()",
"- y = nega.pop()",
"- posi.append(x - y)",
"- ans.append([x, y])",
"-if len(nega) == 0:",
"- x = posi.popleft()",
"- y = posi.popleft()",
"- nega.append(x - y)",
"- ans.append([x, y])",
"-while len(posi) > 1:",
"- x = nega.pop()",
"- y = posi.pop()",
"- ans.append([x, y])",
"- nega.append(x - y)",
"-while len(nega) > 0:",
"- x = posi.pop()",
"- y = nega.pop()",
"- ans.append([x, y])",
"- posi.append(x - y)",
"-print((posi[0]))",
"-for i in range(N - 1):",
"- print((\" \".join(map(str, ans[i]))))",
"+ ans += A[i]",
"+ans += A[-1]",
"+print(ans)",
"+for i in range(p + 1, N - 1):",
"+ print((A[p], A[i]))",
"+ A[p] -= A[i]",
"+for i in range(p + 1):",
"+ print((A[-1], A[i]))",
"+ A[-1] -= A[i]"
] | false | 0.097259 | 0.035018 | 2.777373 |
[
"s154344161",
"s276397893"
] |
u241159583
|
p03611
|
python
|
s607096766
|
s041467721
| 173 | 138 | 21,832 | 14,548 |
Accepted
|
Accepted
| 20.23 |
import numpy as np
N = int(eval(input()))
A = np.array(input().split(), dtype = np.int32)
counter = np.bincount(A)
B = counter.copy()
B[1:] += counter[:-1]
B[:-1] += counter[1:]
ans = B.max()
print(ans)
|
from collections import Counter
n = int(eval(input()))
a = Counter(sorted(list(map(int, input().split()))))
ans = 0
p = 0
for x, y in list(a.items()):
p = y
if x-1 in a: p += a[x-1]
if x+1 in a: p += a[x+1]
if p > ans: ans = p
print(ans)
| 11 | 12 | 208 | 253 |
import numpy as np
N = int(eval(input()))
A = np.array(input().split(), dtype=np.int32)
counter = np.bincount(A)
B = counter.copy()
B[1:] += counter[:-1]
B[:-1] += counter[1:]
ans = B.max()
print(ans)
|
from collections import Counter
n = int(eval(input()))
a = Counter(sorted(list(map(int, input().split()))))
ans = 0
p = 0
for x, y in list(a.items()):
p = y
if x - 1 in a:
p += a[x - 1]
if x + 1 in a:
p += a[x + 1]
if p > ans:
ans = p
print(ans)
| false | 8.333333 |
[
"-import numpy as np",
"+from collections import Counter",
"-N = int(eval(input()))",
"-A = np.array(input().split(), dtype=np.int32)",
"-counter = np.bincount(A)",
"-B = counter.copy()",
"-B[1:] += counter[:-1]",
"-B[:-1] += counter[1:]",
"-ans = B.max()",
"+n = int(eval(input()))",
"+a = Counter(sorted(list(map(int, input().split()))))",
"+ans = 0",
"+p = 0",
"+for x, y in list(a.items()):",
"+ p = y",
"+ if x - 1 in a:",
"+ p += a[x - 1]",
"+ if x + 1 in a:",
"+ p += a[x + 1]",
"+ if p > ans:",
"+ ans = p"
] | false | 0.458283 | 0.110952 | 4.130481 |
[
"s607096766",
"s041467721"
] |
u934442292
|
p03262
|
python
|
s727587190
|
s184966432
| 123 | 91 | 16,280 | 16,276 |
Accepted
|
Accepted
| 26.02 |
import sys
from fractions import gcd
input = sys.stdin.readline
def main():
N, X = list(map(int, input().split()))
x = list(map(int, input().split()))
x.append(X)
x.sort()
ans = x[1] - x[0]
for i in range(1, N):
ans = gcd(ans, x[i + 1] - x[i])
print(ans)
if __name__ == "__main__":
main()
|
import sys
from fractions import gcd
input = sys.stdin.readline
def main():
N, X = list(map(int, input().split()))
x = list(map(int, input().split()))
y = [abs(i - X) for i in x]
ans = y[0]
for i in range(1, N):
ans = gcd(ans, y[i])
print(ans)
if __name__ == "__main__":
main()
| 21 | 20 | 350 | 334 |
import sys
from fractions import gcd
input = sys.stdin.readline
def main():
N, X = list(map(int, input().split()))
x = list(map(int, input().split()))
x.append(X)
x.sort()
ans = x[1] - x[0]
for i in range(1, N):
ans = gcd(ans, x[i + 1] - x[i])
print(ans)
if __name__ == "__main__":
main()
|
import sys
from fractions import gcd
input = sys.stdin.readline
def main():
N, X = list(map(int, input().split()))
x = list(map(int, input().split()))
y = [abs(i - X) for i in x]
ans = y[0]
for i in range(1, N):
ans = gcd(ans, y[i])
print(ans)
if __name__ == "__main__":
main()
| false | 4.761905 |
[
"- x.append(X)",
"- x.sort()",
"- ans = x[1] - x[0]",
"+ y = [abs(i - X) for i in x]",
"+ ans = y[0]",
"- ans = gcd(ans, x[i + 1] - x[i])",
"+ ans = gcd(ans, y[i])"
] | false | 0.051143 | 0.060656 | 0.843172 |
[
"s727587190",
"s184966432"
] |
u653041271
|
p02813
|
python
|
s039135902
|
s010209932
| 158 | 144 | 31,100 | 31,204 |
Accepted
|
Accepted
| 8.86 |
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(eval(input()))
def inpm(): return list(map(int,input().split()))
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(eval(input())) for _ in range(n))
def inplL(n): return [list(eval(input())) for _ in range(n)]
def inplT(n): return [tuple(eval(input())) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])
n = inp()
A = inpl()
B = inpl()
aa = 0
bb = 0
i = 0
for tmp in itertools.permutations(list(range(1,n+1))):
i += 1
if list(tmp) == A:
aa = i
if list(tmp) == B:
bb = i
print((abs(aa - bb)))
|
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline.rstrip()
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(eval(input()))
def inpm(): return list(map(int,input().split()))
def inpl(): return tuple(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(eval(input())) for _ in range(n))
def inplL(n): return [list(eval(input())) for _ in range(n)]
def inplT(n): return [tuple(eval(input())) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplt(n): return [tuple(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])
n = inp()
P = inpl()
Q = inpl()
i = 0
a = 0
b = 0
for p in permutations(list(range(1,n+1))):
i += 1
if p == P:
a = i
if p == Q:
b = i
print((abs(a-b)))
| 32 | 35 | 1,027 | 1,080 |
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter, defaultdict, deque
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
def inp():
return int(eval(input()))
def inpm():
return list(map(int, input().split()))
def inpl():
return list(map(int, input().split()))
def inpls():
return list(input().split())
def inplm(n):
return list(int(eval(input())) for _ in range(n))
def inplL(n):
return [list(eval(input())) for _ in range(n)]
def inplT(n):
return [tuple(eval(input())) for _ in range(n)]
def inpll(n):
return [list(map(int, input().split())) for _ in range(n)]
def inplls(n):
return sorted([list(map(int, input().split())) for _ in range(n)])
n = inp()
A = inpl()
B = inpl()
aa = 0
bb = 0
i = 0
for tmp in itertools.permutations(list(range(1, n + 1))):
i += 1
if list(tmp) == A:
aa = i
if list(tmp) == B:
bb = i
print((abs(aa - bb)))
|
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter, defaultdict, deque
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline.rstrip()
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
def inp():
return int(eval(input()))
def inpm():
return list(map(int, input().split()))
def inpl():
return tuple(map(int, input().split()))
def inpls():
return list(input().split())
def inplm(n):
return list(int(eval(input())) for _ in range(n))
def inplL(n):
return [list(eval(input())) for _ in range(n)]
def inplT(n):
return [tuple(eval(input())) for _ in range(n)]
def inpll(n):
return [list(map(int, input().split())) for _ in range(n)]
def inplt(n):
return [tuple(map(int, input().split())) for _ in range(n)]
def inplls(n):
return sorted([list(map(int, input().split())) for _ in range(n)])
n = inp()
P = inpl()
Q = inpl()
i = 0
a = 0
b = 0
for p in permutations(list(range(1, n + 1))):
i += 1
if p == P:
a = i
if p == Q:
b = i
print((abs(a - b)))
| false | 8.571429 |
[
"-# input = sys.stdin.readline",
"+# input = sys.stdin.readline.rstrip()",
"- return list(map(int, input().split()))",
"+ return tuple(map(int, input().split()))",
"+def inplt(n):",
"+ return [tuple(map(int, input().split())) for _ in range(n)]",
"+",
"+",
"-A = inpl()",
"-B = inpl()",
"-aa = 0",
"-bb = 0",
"+P = inpl()",
"+Q = inpl()",
"-for tmp in itertools.permutations(list(range(1, n + 1))):",
"+a = 0",
"+b = 0",
"+for p in permutations(list(range(1, n + 1))):",
"- if list(tmp) == A:",
"- aa = i",
"- if list(tmp) == B:",
"- bb = i",
"-print((abs(aa - bb)))",
"+ if p == P:",
"+ a = i",
"+ if p == Q:",
"+ b = i",
"+print((abs(a - b)))"
] | false | 0.043614 | 0.043781 | 0.996195 |
[
"s039135902",
"s010209932"
] |
u633068244
|
p00441
|
python
|
s075905588
|
s076485885
| 20,590 | 12,580 | 5,828 | 5,792 |
Accepted
|
Accepted
| 38.9 |
p = 100
while 1:
n = eval(input())
if n == 0: break
xy = sorted([list(map(int,input().split())) for i in range(n)])
S = set(map(tuple,xy))
ans = 0
for i in range(n):
x1,y1 = xy[i]
xy = xy[:i] + sorted(xy[i:], key = lambda XY:(XY[0]-x1)**2 + (XY[1]-y1)**2)
cur = 0
for j in range(n-1,i,-1):
x2,y2 = xy[j]
a = (x2-y2+y1,y2+x2-x1)
b = (x1-y2+y1,y1+x2-x1)
if a in S and b in S:
cur = (x1-x2)**2 + (y1-y2)**2
break
ans = max(ans,cur)
print(ans)
|
while 1:
n = eval(input())
if n == 0: break
xy = [list(map(int,input().split())) for i in range(n)]
S = set(map(tuple,xy))
ans = 0
for i in range(n):
x1,y1 = xy[i]
for j in range(n-1,i,-1):
x2,y2 = xy[j]
a = (x2-y2+y1,y2+x2-x1)
b = (x1-y2+y1,y1+x2-x1)
if a in S and b in S:
ans = max(ans,(x1-x2)**2 + (y1-y2)**2)
print(ans)
| 20 | 15 | 486 | 355 |
p = 100
while 1:
n = eval(input())
if n == 0:
break
xy = sorted([list(map(int, input().split())) for i in range(n)])
S = set(map(tuple, xy))
ans = 0
for i in range(n):
x1, y1 = xy[i]
xy = xy[:i] + sorted(
xy[i:], key=lambda XY: (XY[0] - x1) ** 2 + (XY[1] - y1) ** 2
)
cur = 0
for j in range(n - 1, i, -1):
x2, y2 = xy[j]
a = (x2 - y2 + y1, y2 + x2 - x1)
b = (x1 - y2 + y1, y1 + x2 - x1)
if a in S and b in S:
cur = (x1 - x2) ** 2 + (y1 - y2) ** 2
break
ans = max(ans, cur)
print(ans)
|
while 1:
n = eval(input())
if n == 0:
break
xy = [list(map(int, input().split())) for i in range(n)]
S = set(map(tuple, xy))
ans = 0
for i in range(n):
x1, y1 = xy[i]
for j in range(n - 1, i, -1):
x2, y2 = xy[j]
a = (x2 - y2 + y1, y2 + x2 - x1)
b = (x1 - y2 + y1, y1 + x2 - x1)
if a in S and b in S:
ans = max(ans, (x1 - x2) ** 2 + (y1 - y2) ** 2)
print(ans)
| false | 25 |
[
"-p = 100",
"- xy = sorted([list(map(int, input().split())) for i in range(n)])",
"+ xy = [list(map(int, input().split())) for i in range(n)]",
"- xy = xy[:i] + sorted(",
"- xy[i:], key=lambda XY: (XY[0] - x1) ** 2 + (XY[1] - y1) ** 2",
"- )",
"- cur = 0",
"- cur = (x1 - x2) ** 2 + (y1 - y2) ** 2",
"- break",
"- ans = max(ans, cur)",
"+ ans = max(ans, (x1 - x2) ** 2 + (y1 - y2) ** 2)"
] | false | 0.040516 | 0.034723 | 1.166831 |
[
"s075905588",
"s076485885"
] |
u421674761
|
p02726
|
python
|
s946161344
|
s511519584
| 1,737 | 1,334 | 9,172 | 9,128 |
Accepted
|
Accepted
| 23.2 |
n,x,y = list(map(int,input().split()))
b = [0]*n
for i in range(1,n+1):
for j in range(i+1,n+1):
dist1 = j-i
dist2 = abs(x-i)+abs(y-j)+1
dist3 = abs(y-i)+abs(x-j)+1
d = min(dist1,dist2,dist3)
b[d] += 1
for i in range(1,n):
print((b[i]))
|
n,x,y = list(map(int,input().split()))
ans = [0]*n
for i in range(1,n+1):
for j in range(i+1,n+1):
if i <= x and j >= y:
a = abs(j-i)-abs(y-x)+1
b = abs(i-x)+abs(j-y)+1
ans[min(a,b)] += 1
else:
c = abs(x-i)+abs(y-j)+1
d = abs(j-i)
ans[min(c,d)] += 1
for i in range(1,n):
print((ans[i]))
| 13 | 16 | 291 | 392 |
n, x, y = list(map(int, input().split()))
b = [0] * n
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
dist1 = j - i
dist2 = abs(x - i) + abs(y - j) + 1
dist3 = abs(y - i) + abs(x - j) + 1
d = min(dist1, dist2, dist3)
b[d] += 1
for i in range(1, n):
print((b[i]))
|
n, x, y = list(map(int, input().split()))
ans = [0] * n
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
if i <= x and j >= y:
a = abs(j - i) - abs(y - x) + 1
b = abs(i - x) + abs(j - y) + 1
ans[min(a, b)] += 1
else:
c = abs(x - i) + abs(y - j) + 1
d = abs(j - i)
ans[min(c, d)] += 1
for i in range(1, n):
print((ans[i]))
| false | 18.75 |
[
"-b = [0] * n",
"+ans = [0] * n",
"- dist1 = j - i",
"- dist2 = abs(x - i) + abs(y - j) + 1",
"- dist3 = abs(y - i) + abs(x - j) + 1",
"- d = min(dist1, dist2, dist3)",
"- b[d] += 1",
"+ if i <= x and j >= y:",
"+ a = abs(j - i) - abs(y - x) + 1",
"+ b = abs(i - x) + abs(j - y) + 1",
"+ ans[min(a, b)] += 1",
"+ else:",
"+ c = abs(x - i) + abs(y - j) + 1",
"+ d = abs(j - i)",
"+ ans[min(c, d)] += 1",
"- print((b[i]))",
"+ print((ans[i]))"
] | false | 0.043108 | 0.041511 | 1.038473 |
[
"s946161344",
"s511519584"
] |
u367130284
|
p03111
|
python
|
s083348758
|
s346717941
| 367 | 325 | 3,064 | 3,188 |
Accepted
|
Accepted
| 11.44 |
from itertools import*
n,a,b,c,*l=list(map(int,open(0).read().split()))
d=[a,b,c]
ans=float("inf")
for i in product(list(range(4)),repeat=n):
take=[[],[],[]]
for k,j in enumerate(i): #0を捨てる
if j!=0:
take[j-1].append(l[k])
if all(take):
take2=list(map(sum,take))
#print(sum(abs(s-t)for s,t in zip(d,take2)),(sum(map(len,take))-3)*10)
ans=min(ans,sum(abs(s-t)for s,t in zip(d,take2))+(sum(map(len,take))-3)*10)
print(ans)
|
from itertools import*
n,a,b,c,*l=list(map(int,open(0).read().split()))
ans=float("inf")
for i in product(list(range(4)),repeat=n): #3を捨てる
take=[[],[],[]]
for k,j in enumerate(i):
if j==3:
continue
take[j].append(l[k])
*tmp,=list(map(len,take))
if all(tmp):
x,y,z=list(map(sum,take))
ans=min(ans, (sum(tmp)-3)*10 + abs(x-a) + abs(y-b) + abs(z-c) )
print(ans)
| 14 | 14 | 477 | 407 |
from itertools import *
n, a, b, c, *l = list(map(int, open(0).read().split()))
d = [a, b, c]
ans = float("inf")
for i in product(list(range(4)), repeat=n):
take = [[], [], []]
for k, j in enumerate(i): # 0を捨てる
if j != 0:
take[j - 1].append(l[k])
if all(take):
take2 = list(map(sum, take))
# print(sum(abs(s-t)for s,t in zip(d,take2)),(sum(map(len,take))-3)*10)
ans = min(
ans,
sum(abs(s - t) for s, t in zip(d, take2)) + (sum(map(len, take)) - 3) * 10,
)
print(ans)
|
from itertools import *
n, a, b, c, *l = list(map(int, open(0).read().split()))
ans = float("inf")
for i in product(list(range(4)), repeat=n): # 3を捨てる
take = [[], [], []]
for k, j in enumerate(i):
if j == 3:
continue
take[j].append(l[k])
(*tmp,) = list(map(len, take))
if all(tmp):
x, y, z = list(map(sum, take))
ans = min(ans, (sum(tmp) - 3) * 10 + abs(x - a) + abs(y - b) + abs(z - c))
print(ans)
| false | 0 |
[
"-d = [a, b, c]",
"-for i in product(list(range(4)), repeat=n):",
"+for i in product(list(range(4)), repeat=n): # 3を捨てる",
"- for k, j in enumerate(i): # 0を捨てる",
"- if j != 0:",
"- take[j - 1].append(l[k])",
"- if all(take):",
"- take2 = list(map(sum, take))",
"- # print(sum(abs(s-t)for s,t in zip(d,take2)),(sum(map(len,take))-3)*10)",
"- ans = min(",
"- ans,",
"- sum(abs(s - t) for s, t in zip(d, take2)) + (sum(map(len, take)) - 3) * 10,",
"- )",
"+ for k, j in enumerate(i):",
"+ if j == 3:",
"+ continue",
"+ take[j].append(l[k])",
"+ (*tmp,) = list(map(len, take))",
"+ if all(tmp):",
"+ x, y, z = list(map(sum, take))",
"+ ans = min(ans, (sum(tmp) - 3) * 10 + abs(x - a) + abs(y - b) + abs(z - c))"
] | false | 0.622917 | 0.175101 | 3.557475 |
[
"s083348758",
"s346717941"
] |
u419877586
|
p02948
|
python
|
s458434435
|
s090190982
| 915 | 512 | 77,912 | 27,652 |
Accepted
|
Accepted
| 44.04 |
import heapq
from collections import deque
N, M=list(map(int,input().split()))
AB=[list(map(int,input().split())) for _ in range(N)]
AB.sort(key=lambda x:x[0])
d=deque(AB)
h=[]
ans=0
for i in range(M+1):
while d and d[0][0]<=i:
heapq.heappush(h, -d.popleft()[1])
if h:
ans-=heapq.heappop(h)
print(ans)
|
import heapq
from collections import defaultdict
N, M = list(map(int, input().split()))
d = defaultdict(list)
for i in range(N):
A, B = list(map(int, input().split()))
d[A].append(-B)
ans = 0
work = []
for i in range(1, M+1):
for j in range(len(d[i])):
heapq.heappush(work, d[i][j])
if len(work):
ans -= heapq.heappop(work)
print(ans)
| 15 | 17 | 334 | 372 |
import heapq
from collections import deque
N, M = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
AB.sort(key=lambda x: x[0])
d = deque(AB)
h = []
ans = 0
for i in range(M + 1):
while d and d[0][0] <= i:
heapq.heappush(h, -d.popleft()[1])
if h:
ans -= heapq.heappop(h)
print(ans)
|
import heapq
from collections import defaultdict
N, M = list(map(int, input().split()))
d = defaultdict(list)
for i in range(N):
A, B = list(map(int, input().split()))
d[A].append(-B)
ans = 0
work = []
for i in range(1, M + 1):
for j in range(len(d[i])):
heapq.heappush(work, d[i][j])
if len(work):
ans -= heapq.heappop(work)
print(ans)
| false | 11.764706 |
[
"-from collections import deque",
"+from collections import defaultdict",
"-AB = [list(map(int, input().split())) for _ in range(N)]",
"-AB.sort(key=lambda x: x[0])",
"-d = deque(AB)",
"-h = []",
"+d = defaultdict(list)",
"+for i in range(N):",
"+ A, B = list(map(int, input().split()))",
"+ d[A].append(-B)",
"-for i in range(M + 1):",
"- while d and d[0][0] <= i:",
"- heapq.heappush(h, -d.popleft()[1])",
"- if h:",
"- ans -= heapq.heappop(h)",
"+work = []",
"+for i in range(1, M + 1):",
"+ for j in range(len(d[i])):",
"+ heapq.heappush(work, d[i][j])",
"+ if len(work):",
"+ ans -= heapq.heappop(work)"
] | false | 0.070539 | 0.040536 | 1.74017 |
[
"s458434435",
"s090190982"
] |
u263830634
|
p03566
|
python
|
s444096117
|
s952282260
| 1,327 | 18 | 45,940 | 3,064 |
Accepted
|
Accepted
| 98.64 |
N = int(eval(input()))
t = list(map(int, input().split()))
v = list(map(int, input().split()))
# if N == 1: #最初の1区間だけ
# if t[0] % 2 == 1: #奇数秒
# if t[0]/2 < v[0]:
# print ((t[0]/2) ** 2)
# exit()
# print ('t', t)
# print ('v', v)
N_INF = - 10 ** 15
DP = [[N_INF] * (102) for _ in range(100 * 200 + 2)] #DP[T][V] := 時刻Tに速度Dで走っているときの時刻Tまでの走行距離の最大値
DP[0][0] = 0
# print (DP[0][0:5])
time = 1
for i in range(N):
# print (i)
# print ('time', time)
for j in range(time, time + t[i]): #時刻
# print (j, end = ' ')
for k in range(0, v[i] + 1): #速度
if k == 0: #速度0-->加速して速度0になることはない
# print (j, k)
# print (max(DP[j - 1][0], DP[j - 1][1] + 1/2))
DP[j][k] = max(DP[j - 1][0] + 0.25, DP[j - 1][1] + 1/2)
elif k != v[i]: #加速してくるときも減速してくることもある
DP[j][k] = max(DP[j - 1][k -1] + k - 1/2, DP[j - 1][k] + k + 0.25, DP[j - 1][k + 1] + k + 1/2)
else: #(k == v[i] and j != time) #減速してくることはない
DP[j][k] = max(DP[j - 1][k -1] + k - 1/2, DP[j - 1][k] + k)
# print (DP[j][0:5])
time += t[i]
# print (time)
print((DP[time - 1][0]))
# print ('T = 6, V = 6', DP[6][6])
# print ('T = 12, V = 2', DP[12][2])
# print ('T = 12, V = 3', DP[12][3])
# print ('T = 13, V = 2', DP[13][2])
# print ('T = 26 V = 2', DP[26][2])
# print ('T = 27 V = 2', DP[27][2])
|
N = int(eval(input()))
t = [0] + list(map(int, input().split()))
v = [0] + list(map(int, input().split()))
max_speed_from_left = [0] * (N + 1) #index i = t[i] とt[i + 1]の間
max_speed_from_right = [0] * (N + 1) #index i = t[i] とt[i + 1]の間
for i in range(1, N):
start = max_speed_from_left[i - 1]
max_speed_from_left[i] = min(start + t[i], v[i], v[i + 1])
for i in range(N - 1, 0, -1):
start = max_speed_from_right[i + 1]
max_speed_from_right[i] = min(start + t[i + 1], v[i], v[i + 1])
speed = [min(x, y) for x, y in zip(max_speed_from_left, max_speed_from_right)]
def dist(left_speed, right_speed, t, v):
x = (v - left_speed) + (v - right_speed)
if x >= t:
v = (left_speed + right_speed + t)/2
x = t
#最高速度vに到達してt-x余る
d = (left_speed + v) * (v - left_speed)/2
d += v * (t - x)
d += (right_speed + v) * (v - right_speed)/2
return d
ans = 0
for i in range(1, N + 1):
ans += dist(speed[i -1], speed[i], t[i], v[i])
print (ans)
| 42 | 34 | 1,460 | 1,024 |
N = int(eval(input()))
t = list(map(int, input().split()))
v = list(map(int, input().split()))
# if N == 1: #最初の1区間だけ
# if t[0] % 2 == 1: #奇数秒
# if t[0]/2 < v[0]:
# print ((t[0]/2) ** 2)
# exit()
# print ('t', t)
# print ('v', v)
N_INF = -(10**15)
DP = [
[N_INF] * (102) for _ in range(100 * 200 + 2)
] # DP[T][V] := 時刻Tに速度Dで走っているときの時刻Tまでの走行距離の最大値
DP[0][0] = 0
# print (DP[0][0:5])
time = 1
for i in range(N):
# print (i)
# print ('time', time)
for j in range(time, time + t[i]): # 時刻
# print (j, end = ' ')
for k in range(0, v[i] + 1): # 速度
if k == 0: # 速度0-->加速して速度0になることはない
# print (j, k)
# print (max(DP[j - 1][0], DP[j - 1][1] + 1/2))
DP[j][k] = max(DP[j - 1][0] + 0.25, DP[j - 1][1] + 1 / 2)
elif k != v[i]: # 加速してくるときも減速してくることもある
DP[j][k] = max(
DP[j - 1][k - 1] + k - 1 / 2,
DP[j - 1][k] + k + 0.25,
DP[j - 1][k + 1] + k + 1 / 2,
)
else: # (k == v[i] and j != time) #減速してくることはない
DP[j][k] = max(DP[j - 1][k - 1] + k - 1 / 2, DP[j - 1][k] + k)
# print (DP[j][0:5])
time += t[i]
# print (time)
print((DP[time - 1][0]))
# print ('T = 6, V = 6', DP[6][6])
# print ('T = 12, V = 2', DP[12][2])
# print ('T = 12, V = 3', DP[12][3])
# print ('T = 13, V = 2', DP[13][2])
# print ('T = 26 V = 2', DP[26][2])
# print ('T = 27 V = 2', DP[27][2])
|
N = int(eval(input()))
t = [0] + list(map(int, input().split()))
v = [0] + list(map(int, input().split()))
max_speed_from_left = [0] * (N + 1) # index i = t[i] とt[i + 1]の間
max_speed_from_right = [0] * (N + 1) # index i = t[i] とt[i + 1]の間
for i in range(1, N):
start = max_speed_from_left[i - 1]
max_speed_from_left[i] = min(start + t[i], v[i], v[i + 1])
for i in range(N - 1, 0, -1):
start = max_speed_from_right[i + 1]
max_speed_from_right[i] = min(start + t[i + 1], v[i], v[i + 1])
speed = [min(x, y) for x, y in zip(max_speed_from_left, max_speed_from_right)]
def dist(left_speed, right_speed, t, v):
x = (v - left_speed) + (v - right_speed)
if x >= t:
v = (left_speed + right_speed + t) / 2
x = t
# 最高速度vに到達してt-x余る
d = (left_speed + v) * (v - left_speed) / 2
d += v * (t - x)
d += (right_speed + v) * (v - right_speed) / 2
return d
ans = 0
for i in range(1, N + 1):
ans += dist(speed[i - 1], speed[i], t[i], v[i])
print(ans)
| false | 19.047619 |
[
"-t = list(map(int, input().split()))",
"-v = list(map(int, input().split()))",
"-# if N == 1: #最初の1区間だけ",
"-# if t[0] % 2 == 1: #奇数秒",
"-# if t[0]/2 < v[0]:",
"-# print ((t[0]/2) ** 2)",
"-# exit()",
"-# print ('t', t)",
"-# print ('v', v)",
"-N_INF = -(10**15)",
"-DP = [",
"- [N_INF] * (102) for _ in range(100 * 200 + 2)",
"-] # DP[T][V] := 時刻Tに速度Dで走っているときの時刻Tまでの走行距離の最大値",
"-DP[0][0] = 0",
"-# print (DP[0][0:5])",
"-time = 1",
"-for i in range(N):",
"- # print (i)",
"- # print ('time', time)",
"- for j in range(time, time + t[i]): # 時刻",
"- # print (j, end = ' ')",
"- for k in range(0, v[i] + 1): # 速度",
"- if k == 0: # 速度0-->加速して速度0になることはない",
"- # print (j, k)",
"- # print (max(DP[j - 1][0], DP[j - 1][1] + 1/2))",
"- DP[j][k] = max(DP[j - 1][0] + 0.25, DP[j - 1][1] + 1 / 2)",
"- elif k != v[i]: # 加速してくるときも減速してくることもある",
"- DP[j][k] = max(",
"- DP[j - 1][k - 1] + k - 1 / 2,",
"- DP[j - 1][k] + k + 0.25,",
"- DP[j - 1][k + 1] + k + 1 / 2,",
"- )",
"- else: # (k == v[i] and j != time) #減速してくることはない",
"- DP[j][k] = max(DP[j - 1][k - 1] + k - 1 / 2, DP[j - 1][k] + k)",
"- # print (DP[j][0:5])",
"- time += t[i]",
"-# print (time)",
"-print((DP[time - 1][0]))",
"-# print ('T = 6, V = 6', DP[6][6])",
"-# print ('T = 12, V = 2', DP[12][2])",
"-# print ('T = 12, V = 3', DP[12][3])",
"-# print ('T = 13, V = 2', DP[13][2])",
"-# print ('T = 26 V = 2', DP[26][2])",
"-# print ('T = 27 V = 2', DP[27][2])",
"+t = [0] + list(map(int, input().split()))",
"+v = [0] + list(map(int, input().split()))",
"+max_speed_from_left = [0] * (N + 1) # index i = t[i] とt[i + 1]の間",
"+max_speed_from_right = [0] * (N + 1) # index i = t[i] とt[i + 1]の間",
"+for i in range(1, N):",
"+ start = max_speed_from_left[i - 1]",
"+ max_speed_from_left[i] = min(start + t[i], v[i], v[i + 1])",
"+for i in range(N - 1, 0, -1):",
"+ start = max_speed_from_right[i + 1]",
"+ max_speed_from_right[i] = min(start + t[i + 1], v[i], v[i + 1])",
"+speed = [min(x, y) for x, y in zip(max_speed_from_left, max_speed_from_right)]",
"+",
"+",
"+def dist(left_speed, right_speed, t, v):",
"+ x = (v - left_speed) + (v - right_speed)",
"+ if x >= t:",
"+ v = (left_speed + right_speed + t) / 2",
"+ x = t",
"+ # 最高速度vに到達してt-x余る",
"+ d = (left_speed + v) * (v - left_speed) / 2",
"+ d += v * (t - x)",
"+ d += (right_speed + v) * (v - right_speed) / 2",
"+ return d",
"+",
"+",
"+ans = 0",
"+for i in range(1, N + 1):",
"+ ans += dist(speed[i - 1], speed[i], t[i], v[i])",
"+print(ans)"
] | false | 0.174129 | 0.047428 | 3.671456 |
[
"s444096117",
"s952282260"
] |
u089230684
|
p03556
|
python
|
s506791955
|
s404715892
| 30 | 18 | 2,940 | 2,940 |
Accepted
|
Accepted
| 40 |
n=eval(input())
i=1
while (i*i)<=int(n):
i=i+1
m=(i-1)*(i-1)
print(m)
|
#dbvDSbvdIvdbidvbdibvdibvdi
print((int(float(int(eval(input()))**0.5))**2))
| 6 | 4 | 74 | 72 |
n = eval(input())
i = 1
while (i * i) <= int(n):
i = i + 1
m = (i - 1) * (i - 1)
print(m)
|
# dbvDSbvdIvdbidvbdibvdibvdi
print((int(float(int(eval(input())) ** 0.5)) ** 2))
| false | 33.333333 |
[
"-n = eval(input())",
"-i = 1",
"-while (i * i) <= int(n):",
"- i = i + 1",
"-m = (i - 1) * (i - 1)",
"-print(m)",
"+# dbvDSbvdIvdbidvbdibvdibvdi",
"+print((int(float(int(eval(input())) ** 0.5)) ** 2))"
] | false | 0.045205 | 0.007199 | 6.279474 |
[
"s506791955",
"s404715892"
] |
u877415670
|
p03163
|
python
|
s803532341
|
s041908370
| 686 | 558 | 120,300 | 120,812 |
Accepted
|
Accepted
| 18.66 |
N,W=list(map(int,input().split()))
wv=[list(map(int,input().split())) for _ in range(N)]
dp=[[0]*(W+1) for _ in range(N+1)]
for w in range(W+1):
for n in range(N):
if w>=wv[n][0]:
dp[n+1][w] += max(dp[n][w-wv[n][0]]+wv[n][1], dp[n][w])
else:
dp[n+1][w]=dp[n][w]
print((dp[-1][-1]))
|
N,W=list(map(int,input().split()))
w=[0]*N
v=[0]*N
for i in range(N):
w[i],v[i]=list(map(int,input().split()))
dp=[[0]*(W+1) for i in range(N+1)]
for i in range(W+1):
for g in range(N):
if i>=w[g]:
dp[g+1][i]=max(dp[g][i],v[g]+dp[g][i-w[g]])
else:
dp[g+1][i]=dp[g][i]
print((dp[N][W]))
| 14 | 17 | 335 | 343 |
N, W = list(map(int, input().split()))
wv = [list(map(int, input().split())) for _ in range(N)]
dp = [[0] * (W + 1) for _ in range(N + 1)]
for w in range(W + 1):
for n in range(N):
if w >= wv[n][0]:
dp[n + 1][w] += max(dp[n][w - wv[n][0]] + wv[n][1], dp[n][w])
else:
dp[n + 1][w] = dp[n][w]
print((dp[-1][-1]))
|
N, W = list(map(int, input().split()))
w = [0] * N
v = [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = [[0] * (W + 1) for i in range(N + 1)]
for i in range(W + 1):
for g in range(N):
if i >= w[g]:
dp[g + 1][i] = max(dp[g][i], v[g] + dp[g][i - w[g]])
else:
dp[g + 1][i] = dp[g][i]
print((dp[N][W]))
| false | 17.647059 |
[
"-wv = [list(map(int, input().split())) for _ in range(N)]",
"-dp = [[0] * (W + 1) for _ in range(N + 1)]",
"-for w in range(W + 1):",
"- for n in range(N):",
"- if w >= wv[n][0]:",
"- dp[n + 1][w] += max(dp[n][w - wv[n][0]] + wv[n][1], dp[n][w])",
"+w = [0] * N",
"+v = [0] * N",
"+for i in range(N):",
"+ w[i], v[i] = list(map(int, input().split()))",
"+dp = [[0] * (W + 1) for i in range(N + 1)]",
"+for i in range(W + 1):",
"+ for g in range(N):",
"+ if i >= w[g]:",
"+ dp[g + 1][i] = max(dp[g][i], v[g] + dp[g][i - w[g]])",
"- dp[n + 1][w] = dp[n][w]",
"-print((dp[-1][-1]))",
"+ dp[g + 1][i] = dp[g][i]",
"+print((dp[N][W]))"
] | false | 0.039037 | 0.038796 | 1.006215 |
[
"s803532341",
"s041908370"
] |
u747602774
|
p03745
|
python
|
s868943339
|
s017263521
| 86 | 78 | 14,252 | 14,252 |
Accepted
|
Accepted
| 9.3 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 1
#state0は未定、1は広義単調増加、2は広義単調減少
state = 0
m = A[0]
i = 1
while i <= N-1:
if m < A[i]:
if state == 0:
state = 1
elif state == 2:
ans += 1
state = 0
elif m > A[i]:
if state == 0:
state = 2
elif state == 1:
ans += 1
state = 0
m = A[i]
i += 1
print(ans)
|
N = int(eval(input()))
A = list(map(int,input().split()))
#state0は未定、1は広義単調増加、2は広義単調減少
state = 0
m = A[0]
ans = 1
for i in range(1,N):
if m < A[i]:
if state == 0:
state = 1
elif state == 2:
ans += 1
state = 0
elif m > A[i]:
if state == 0:
state = 2
elif state == 1:
ans += 1
state = 0
m = A[i]
print(ans)
| 27 | 23 | 457 | 439 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
# state0は未定、1は広義単調増加、2は広義単調減少
state = 0
m = A[0]
i = 1
while i <= N - 1:
if m < A[i]:
if state == 0:
state = 1
elif state == 2:
ans += 1
state = 0
elif m > A[i]:
if state == 0:
state = 2
elif state == 1:
ans += 1
state = 0
m = A[i]
i += 1
print(ans)
|
N = int(eval(input()))
A = list(map(int, input().split()))
# state0は未定、1は広義単調増加、2は広義単調減少
state = 0
m = A[0]
ans = 1
for i in range(1, N):
if m < A[i]:
if state == 0:
state = 1
elif state == 2:
ans += 1
state = 0
elif m > A[i]:
if state == 0:
state = 2
elif state == 1:
ans += 1
state = 0
m = A[i]
print(ans)
| false | 14.814815 |
[
"-ans = 1",
"-i = 1",
"-while i <= N - 1:",
"+ans = 1",
"+for i in range(1, N):",
"- i += 1"
] | false | 0.121255 | 0.11501 | 1.054307 |
[
"s868943339",
"s017263521"
] |
u580362735
|
p03012
|
python
|
s623034386
|
s458386104
| 24 | 17 | 3,064 | 3,060 |
Accepted
|
Accepted
| 29.17 |
N = int(eval(input()))
w = list(map(int,input().split()))
sum_w = sum(w)
ans = sum_w
T = 0
for i in range(N):
if abs(sum(w[:i+1])-sum(w[i+1:]))<ans:
ans = abs(sum(w[:i+1])-sum(w[i+1:]))
print(ans)
|
N = int(eval(input()))
W = list(map(int,input().split()))
ans = 10**9
for i in range(N):
tmp = abs(sum(W[:i])-sum(W[i:]))
if ans > tmp:
ans = tmp
print(ans)
| 9 | 8 | 204 | 165 |
N = int(eval(input()))
w = list(map(int, input().split()))
sum_w = sum(w)
ans = sum_w
T = 0
for i in range(N):
if abs(sum(w[: i + 1]) - sum(w[i + 1 :])) < ans:
ans = abs(sum(w[: i + 1]) - sum(w[i + 1 :]))
print(ans)
|
N = int(eval(input()))
W = list(map(int, input().split()))
ans = 10**9
for i in range(N):
tmp = abs(sum(W[:i]) - sum(W[i:]))
if ans > tmp:
ans = tmp
print(ans)
| false | 11.111111 |
[
"-w = list(map(int, input().split()))",
"-sum_w = sum(w)",
"-ans = sum_w",
"-T = 0",
"+W = list(map(int, input().split()))",
"+ans = 10**9",
"- if abs(sum(w[: i + 1]) - sum(w[i + 1 :])) < ans:",
"- ans = abs(sum(w[: i + 1]) - sum(w[i + 1 :]))",
"+ tmp = abs(sum(W[:i]) - sum(W[i:]))",
"+ if ans > tmp:",
"+ ans = tmp"
] | false | 0.034934 | 0.035367 | 0.987764 |
[
"s623034386",
"s458386104"
] |
u877415670
|
p03111
|
python
|
s224328741
|
s934870696
| 291 | 65 | 10,996 | 9,044 |
Accepted
|
Accepted
| 77.66 |
import itertools
N,A,B,C=list(map(int,input().split()))
l=[int(eval(input())) for _ in range(N)]
d=list(itertools.product([0,1,2,3], repeat=N))
MIN=10**10
for i in range(len(d)):
ans=0
a_num=0
b_num=0
c_num=0
a_kadomatu=A
b_kadomatu=B
c_kadomatu=C
if {0,1,2} <= set(d[i]):
for g in range(len(d[i])):
if d[i][g]==0:
a_num+=1
a_kadomatu-=l[g]
elif d[i][g]==1:
b_num+=1
b_kadomatu-=l[g]
elif d[i][g]==2:
c_num+=1
c_kadomatu-=l[g]
ans=abs(a_kadomatu)+abs(b_kadomatu)+abs(c_kadomatu)+10*(a_num-1)+10*(b_num-1)+10*(c_num-1)
MIN=min(MIN,ans)
print(MIN)
|
def dfs(ka, kb, kc, cnta, cntb, cntc, phase):
global ans
if phase == n:
if 0 < cnta and 0 < cntb and 0 < cntc:
ans = min(ans, abs(a-ka) + abs(b-kb) + abs(c-kc) + 10*(cnta+cntb+cntc-3))
return
dfs(ka+l[phase], kb, kc, cnta+1, cntb, cntc, phase+1)
dfs(ka, kb+l[phase], kc, cnta, cntb+1, cntc, phase+1)
dfs(ka, kb, kc+l[phase], cnta, cntb, cntc+1, phase+1)
dfs(ka, kb, kc, cnta, cntb, cntc, phase+1)
n,a,b,c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
ans = 10**9
dfs(0,0,0,0,0,0,0)
print(ans)
| 30 | 17 | 753 | 581 |
import itertools
N, A, B, C = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(N)]
d = list(itertools.product([0, 1, 2, 3], repeat=N))
MIN = 10**10
for i in range(len(d)):
ans = 0
a_num = 0
b_num = 0
c_num = 0
a_kadomatu = A
b_kadomatu = B
c_kadomatu = C
if {0, 1, 2} <= set(d[i]):
for g in range(len(d[i])):
if d[i][g] == 0:
a_num += 1
a_kadomatu -= l[g]
elif d[i][g] == 1:
b_num += 1
b_kadomatu -= l[g]
elif d[i][g] == 2:
c_num += 1
c_kadomatu -= l[g]
ans = (
abs(a_kadomatu)
+ abs(b_kadomatu)
+ abs(c_kadomatu)
+ 10 * (a_num - 1)
+ 10 * (b_num - 1)
+ 10 * (c_num - 1)
)
MIN = min(MIN, ans)
print(MIN)
|
def dfs(ka, kb, kc, cnta, cntb, cntc, phase):
global ans
if phase == n:
if 0 < cnta and 0 < cntb and 0 < cntc:
ans = min(
ans,
abs(a - ka) + abs(b - kb) + abs(c - kc) + 10 * (cnta + cntb + cntc - 3),
)
return
dfs(ka + l[phase], kb, kc, cnta + 1, cntb, cntc, phase + 1)
dfs(ka, kb + l[phase], kc, cnta, cntb + 1, cntc, phase + 1)
dfs(ka, kb, kc + l[phase], cnta, cntb, cntc + 1, phase + 1)
dfs(ka, kb, kc, cnta, cntb, cntc, phase + 1)
n, a, b, c = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(n)]
ans = 10**9
dfs(0, 0, 0, 0, 0, 0, 0)
print(ans)
| false | 43.333333 |
[
"-import itertools",
"+def dfs(ka, kb, kc, cnta, cntb, cntc, phase):",
"+ global ans",
"+ if phase == n:",
"+ if 0 < cnta and 0 < cntb and 0 < cntc:",
"+ ans = min(",
"+ ans,",
"+ abs(a - ka) + abs(b - kb) + abs(c - kc) + 10 * (cnta + cntb + cntc - 3),",
"+ )",
"+ return",
"+ dfs(ka + l[phase], kb, kc, cnta + 1, cntb, cntc, phase + 1)",
"+ dfs(ka, kb + l[phase], kc, cnta, cntb + 1, cntc, phase + 1)",
"+ dfs(ka, kb, kc + l[phase], cnta, cntb, cntc + 1, phase + 1)",
"+ dfs(ka, kb, kc, cnta, cntb, cntc, phase + 1)",
"-N, A, B, C = list(map(int, input().split()))",
"-l = [int(eval(input())) for _ in range(N)]",
"-d = list(itertools.product([0, 1, 2, 3], repeat=N))",
"-MIN = 10**10",
"-for i in range(len(d)):",
"- ans = 0",
"- a_num = 0",
"- b_num = 0",
"- c_num = 0",
"- a_kadomatu = A",
"- b_kadomatu = B",
"- c_kadomatu = C",
"- if {0, 1, 2} <= set(d[i]):",
"- for g in range(len(d[i])):",
"- if d[i][g] == 0:",
"- a_num += 1",
"- a_kadomatu -= l[g]",
"- elif d[i][g] == 1:",
"- b_num += 1",
"- b_kadomatu -= l[g]",
"- elif d[i][g] == 2:",
"- c_num += 1",
"- c_kadomatu -= l[g]",
"- ans = (",
"- abs(a_kadomatu)",
"- + abs(b_kadomatu)",
"- + abs(c_kadomatu)",
"- + 10 * (a_num - 1)",
"- + 10 * (b_num - 1)",
"- + 10 * (c_num - 1)",
"- )",
"- MIN = min(MIN, ans)",
"-print(MIN)",
"+",
"+n, a, b, c = list(map(int, input().split()))",
"+l = [int(eval(input())) for _ in range(n)]",
"+ans = 10**9",
"+dfs(0, 0, 0, 0, 0, 0, 0)",
"+print(ans)"
] | false | 0.378369 | 0.08765 | 4.316811 |
[
"s224328741",
"s934870696"
] |
u554784585
|
p03720
|
python
|
s234881954
|
s009697964
| 34 | 25 | 9,064 | 9,092 |
Accepted
|
Accepted
| 26.47 |
N,M=list(map(int,input().split()))
li=[]
for i in range(M):
a,b=list(map(int,input().split()))
li.append(a)
li.append(b)
ans=[0]*N
for j in range(1,N+1):
cj=li.count(j)
ans[j-1]=cj
for k in range(N):
print((ans[k]))
|
N,M=list(map(int,input().split()))
li=[0]*N
for i in range(M):
a,b=list(map(int,input().split()))
li[a-1]+=1
li[b-1]+=1
for j in range(N):
print((li[j]))
| 12 | 8 | 237 | 163 |
N, M = list(map(int, input().split()))
li = []
for i in range(M):
a, b = list(map(int, input().split()))
li.append(a)
li.append(b)
ans = [0] * N
for j in range(1, N + 1):
cj = li.count(j)
ans[j - 1] = cj
for k in range(N):
print((ans[k]))
|
N, M = list(map(int, input().split()))
li = [0] * N
for i in range(M):
a, b = list(map(int, input().split()))
li[a - 1] += 1
li[b - 1] += 1
for j in range(N):
print((li[j]))
| false | 33.333333 |
[
"-li = []",
"+li = [0] * N",
"- li.append(a)",
"- li.append(b)",
"-ans = [0] * N",
"-for j in range(1, N + 1):",
"- cj = li.count(j)",
"- ans[j - 1] = cj",
"-for k in range(N):",
"- print((ans[k]))",
"+ li[a - 1] += 1",
"+ li[b - 1] += 1",
"+for j in range(N):",
"+ print((li[j]))"
] | false | 0.043529 | 0.044393 | 0.980558 |
[
"s234881954",
"s009697964"
] |
u036914910
|
p03680
|
python
|
s830231268
|
s835283634
| 222 | 174 | 7,852 | 16,924 |
Accepted
|
Accepted
| 21.62 |
N = int(eval(input()))
A = []
ex = [0]*N
light = 0
c = 0
for i in range(N) :
A.append(int(eval(input())))
while light != 1 :
if ex[light] == 1 :
print('-1')
exit()
ex[light] = 1
light = A[light]-1
c += 1
print(c)
|
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
A = list([x-1 for x in A])
ex = [0]*10**5
light = 0
for i in range(N) :
if light == 1 :
print(i)
exit()
elif ex[light] == 1 :
print('-1')
exit()
ex[light] = 1
light = A[light]
print('-1')
| 18 | 16 | 260 | 309 |
N = int(eval(input()))
A = []
ex = [0] * N
light = 0
c = 0
for i in range(N):
A.append(int(eval(input())))
while light != 1:
if ex[light] == 1:
print("-1")
exit()
ex[light] = 1
light = A[light] - 1
c += 1
print(c)
|
N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
A = list([x - 1 for x in A])
ex = [0] * 10**5
light = 0
for i in range(N):
if light == 1:
print(i)
exit()
elif ex[light] == 1:
print("-1")
exit()
ex[light] = 1
light = A[light]
print("-1")
| false | 11.111111 |
[
"-A = []",
"-ex = [0] * N",
"+A = [int(eval(input())) for _ in range(N)]",
"+A = list([x - 1 for x in A])",
"+ex = [0] * 10**5",
"-c = 0",
"- A.append(int(eval(input())))",
"-while light != 1:",
"- if ex[light] == 1:",
"+ if light == 1:",
"+ print(i)",
"+ exit()",
"+ elif ex[light] == 1:",
"- light = A[light] - 1",
"- c += 1",
"-print(c)",
"+ light = A[light]",
"+print(\"-1\")"
] | false | 0.036565 | 0.068265 | 0.535632 |
[
"s830231268",
"s835283634"
] |
u678167152
|
p03543
|
python
|
s421363688
|
s278612466
| 169 | 17 | 38,256 | 2,940 |
Accepted
|
Accepted
| 89.94 |
N = eval(input())
ans = 'No'
if (N[0]==N[1] or N[2]==N[3]) and N[1]==N[2]:
ans = 'Yes'
print(ans)
|
def check():
S = list(eval(input()))
if len(set(S[:-1]))==1 or len(set(S[1:]))==1:
return 'Yes'
return 'No'
print((check()))
| 5 | 6 | 99 | 141 |
N = eval(input())
ans = "No"
if (N[0] == N[1] or N[2] == N[3]) and N[1] == N[2]:
ans = "Yes"
print(ans)
|
def check():
S = list(eval(input()))
if len(set(S[:-1])) == 1 or len(set(S[1:])) == 1:
return "Yes"
return "No"
print((check()))
| false | 16.666667 |
[
"-N = eval(input())",
"-ans = \"No\"",
"-if (N[0] == N[1] or N[2] == N[3]) and N[1] == N[2]:",
"- ans = \"Yes\"",
"-print(ans)",
"+def check():",
"+ S = list(eval(input()))",
"+ if len(set(S[:-1])) == 1 or len(set(S[1:])) == 1:",
"+ return \"Yes\"",
"+ return \"No\"",
"+",
"+",
"+print((check()))"
] | false | 0.170147 | 0.043043 | 3.952967 |
[
"s421363688",
"s278612466"
] |
u067447457
|
p02773
|
python
|
s257506829
|
s461429649
| 637 | 577 | 35,572 | 35,824 |
Accepted
|
Accepted
| 9.42 |
from collections import Counter
n=int(eval(input()))
l=[eval(input()) for i in range(n)]
c=Counter(l)
d=max(c.values())
max_list=[k for k,v in list(c.items()) if v==d]
max_list.sort()
for j in max_list:
print(j)
|
from collections import Counter
n=int(input())
l=[input() for i in range(n)]
c=Counter(l)
d=max(c.values())
max_list=[k for k,v in c.items() if v==d]
max_list.sort()
print(*max_list,sep="\n")
| 10 | 9 | 205 | 200 |
from collections import Counter
n = int(eval(input()))
l = [eval(input()) for i in range(n)]
c = Counter(l)
d = max(c.values())
max_list = [k for k, v in list(c.items()) if v == d]
max_list.sort()
for j in max_list:
print(j)
|
from collections import Counter
n = int(input())
l = [input() for i in range(n)]
c = Counter(l)
d = max(c.values())
max_list = [k for k, v in c.items() if v == d]
max_list.sort()
print(*max_list, sep="\n")
| false | 10 |
[
"-n = int(eval(input()))",
"-l = [eval(input()) for i in range(n)]",
"+n = int(input())",
"+l = [input() for i in range(n)]",
"-max_list = [k for k, v in list(c.items()) if v == d]",
"+max_list = [k for k, v in c.items() if v == d]",
"-for j in max_list:",
"- print(j)",
"+print(*max_list, sep=\"\\n\")"
] | false | 0.043775 | 0.042774 | 1.023405 |
[
"s257506829",
"s461429649"
] |
u247680229
|
p02641
|
python
|
s921152261
|
s027537628
| 32 | 28 | 9,028 | 9,176 |
Accepted
|
Accepted
| 12.5 |
X,N = list(map(int,input().split()))
p = list(map(int,input().split()))
import sys
for i in range(200):
if X-i not in p:
print((X-i))
sys.exit()
elif X+i not in p:
print((X+i))
sys.exit()
|
X,N = list(map(int,input().split()))
p = list(map(int,input().split()))
import sys
for i in range(102):
if X-i not in p:
print((X-i))
sys.exit()
elif X+i not in p:
print((X+i))
sys.exit()
| 13 | 13 | 237 | 237 |
X, N = list(map(int, input().split()))
p = list(map(int, input().split()))
import sys
for i in range(200):
if X - i not in p:
print((X - i))
sys.exit()
elif X + i not in p:
print((X + i))
sys.exit()
|
X, N = list(map(int, input().split()))
p = list(map(int, input().split()))
import sys
for i in range(102):
if X - i not in p:
print((X - i))
sys.exit()
elif X + i not in p:
print((X + i))
sys.exit()
| false | 0 |
[
"-for i in range(200):",
"+for i in range(102):"
] | false | 0.109004 | 0.157476 | 0.692192 |
[
"s921152261",
"s027537628"
] |
u038408819
|
p02719
|
python
|
s711321059
|
s047573451
| 19 | 17 | 3,188 | 2,940 |
Accepted
|
Accepted
| 10.53 |
N, K = list(map(int, input().split()))
import math
if N > K:
s = N // K
print((min(abs(N - s * K), abs(N - (s + 1) * K))))
elif N == K:
print((0))
else:
print((min(N, abs(N - K))))
|
N, K = list(map(int, input().split()))
s = N // K
ans = min(abs(N - s * K), abs(N - (s + 1) * K))
print(ans)
| 9 | 4 | 192 | 105 |
N, K = list(map(int, input().split()))
import math
if N > K:
s = N // K
print((min(abs(N - s * K), abs(N - (s + 1) * K))))
elif N == K:
print((0))
else:
print((min(N, abs(N - K))))
|
N, K = list(map(int, input().split()))
s = N // K
ans = min(abs(N - s * K), abs(N - (s + 1) * K))
print(ans)
| false | 55.555556 |
[
"-import math",
"-",
"-if N > K:",
"- s = N // K",
"- print((min(abs(N - s * K), abs(N - (s + 1) * K))))",
"-elif N == K:",
"- print((0))",
"-else:",
"- print((min(N, abs(N - K))))",
"+s = N // K",
"+ans = min(abs(N - s * K), abs(N - (s + 1) * K))",
"+print(ans)"
] | false | 0.043165 | 0.057969 | 0.744622 |
[
"s711321059",
"s047573451"
] |
u923662841
|
p03212
|
python
|
s144637124
|
s487885786
| 124 | 78 | 3,060 | 9,156 |
Accepted
|
Accepted
| 37.1 |
N = eval(input())
def dfs(A):
if int(A) > int(N):
return 0
if all(A.count(c) for c in "753") >0:
ans = 1
else:
ans = 0
for i in "357":
A += i
ans += dfs(A)
A = A[:-1]
return ans
print((dfs("0")))
|
import itertools
N = eval(input())
keta = len(N)
s = 0
for i in range(3,keta+1):
a = itertools.product([3,5,7],repeat=i)
for j in a:
if 3 in j and 5 in j and 7 in j:
if int("".join(map(str,j)))<= int(N):
s +=1
print(s)
| 18 | 11 | 292 | 266 |
N = eval(input())
def dfs(A):
if int(A) > int(N):
return 0
if all(A.count(c) for c in "753") > 0:
ans = 1
else:
ans = 0
for i in "357":
A += i
ans += dfs(A)
A = A[:-1]
return ans
print((dfs("0")))
|
import itertools
N = eval(input())
keta = len(N)
s = 0
for i in range(3, keta + 1):
a = itertools.product([3, 5, 7], repeat=i)
for j in a:
if 3 in j and 5 in j and 7 in j:
if int("".join(map(str, j))) <= int(N):
s += 1
print(s)
| false | 38.888889 |
[
"+import itertools",
"+",
"-",
"-",
"-def dfs(A):",
"- if int(A) > int(N):",
"- return 0",
"- if all(A.count(c) for c in \"753\") > 0:",
"- ans = 1",
"- else:",
"- ans = 0",
"- for i in \"357\":",
"- A += i",
"- ans += dfs(A)",
"- A = A[:-1]",
"- return ans",
"-",
"-",
"-print((dfs(\"0\")))",
"+keta = len(N)",
"+s = 0",
"+for i in range(3, keta + 1):",
"+ a = itertools.product([3, 5, 7], repeat=i)",
"+ for j in a:",
"+ if 3 in j and 5 in j and 7 in j:",
"+ if int(\"\".join(map(str, j))) <= int(N):",
"+ s += 1",
"+print(s)"
] | false | 0.050586 | 0.037033 | 1.365994 |
[
"s144637124",
"s487885786"
] |
u018679195
|
p02676
|
python
|
s126061225
|
s108311650
| 29 | 26 | 9,100 | 9,096 |
Accepted
|
Accepted
| 10.34 |
#K input for the range of S
K = int(eval(input()))
#input of lowercase english letters
S = eval(input())
if len(S) > K:
print((S[:K] + "..."))
else:
print(S)
|
K=int(eval(input()))
S=eval(input())
if len(S) > K :
print((S[0:K]+'...'))
else:
print(S)
| 8 | 11 | 158 | 100 |
# K input for the range of S
K = int(eval(input()))
# input of lowercase english letters
S = eval(input())
if len(S) > K:
print((S[:K] + "..."))
else:
print(S)
|
K = int(eval(input()))
S = eval(input())
if len(S) > K:
print((S[0:K] + "..."))
else:
print(S)
| false | 27.272727 |
[
"-# K input for the range of S",
"-# input of lowercase english letters",
"- print((S[:K] + \"...\"))",
"+ print((S[0:K] + \"...\"))"
] | false | 0.045746 | 0.046901 | 0.975372 |
[
"s126061225",
"s108311650"
] |
u761320129
|
p02949
|
python
|
s650300891
|
s717217081
| 1,061 | 474 | 55,128 | 76,200 |
Accepted
|
Accepted
| 55.33 |
N,M,P = list(map(int,input().split()))
ABC = [tuple(map(int,input().split())) for i in range(M)]
es = [[] for _ in range(N)]
bs = [[] for _ in range(N)]
for a,b,c in ABC:
a,b = a-1,b-1
es[a].append((b,c-P))
bs[b].append((a,c-P))
go_set = set([0])
stack = [0]
while stack:
v = stack.pop()
for to,_ in es[v]:
if to in go_set: continue
go_set.add(to)
stack.append(to)
bk_set = set([N-1])
stack = [N-1]
while stack:
v = stack.pop()
for to,_ in bs[v]:
if to in bk_set: continue
bk_set.add(to)
stack.append(to)
use = go_set & bk_set
K = len(use)
INF = float('inf')
d = [INF] * N
d[0] = 0
for i in range(K):
for v in range(N):
if v not in use: continue
for to,c in es[v]:
if to not in use: continue
if d[to] > d[v] - c:
d[to] = d[v] - c
if i==K-1:
print((-1))
exit()
print((max(0, -d[-1])))
|
import sys
input = sys.stdin.readline
N,M,P = list(map(int,input().split()))
ABC = [tuple(map(int,input().split())) for i in range(M)]
es = [[] for _ in range(N)]
rs = [[] for _ in range(N)]
for a,b,c in ABC:
a,b = a-1,b-1
es[a].append(b)
rs[b].append(a)
stack = [0]
vis_go = set([0])
while stack:
v = stack.pop()
for to in es[v]:
if to in vis_go: continue
vis_go.add(to)
stack.append(to)
stack = [N-1]
vis_bk = set([N-1])
while stack:
v = stack.pop()
for to in rs[v]:
if to in vis_bk: continue
vis_bk.add(to)
stack.append(to)
use = vis_go & vis_bk
INF = float('inf')
dist = [INF] * N
dist[0] = 0
for i in range(len(use)):
for a,b,c in ABC:
a,b,c = a-1,b-1,P-c
if a not in use or b not in use: continue
if dist[b] > dist[a] + c:
dist[b] = dist[a] + c
if i==len(use)-1:
print((-1))
exit()
print((max(0,-dist[-1])))
| 44 | 43 | 1,012 | 1,008 |
N, M, P = list(map(int, input().split()))
ABC = [tuple(map(int, input().split())) for i in range(M)]
es = [[] for _ in range(N)]
bs = [[] for _ in range(N)]
for a, b, c in ABC:
a, b = a - 1, b - 1
es[a].append((b, c - P))
bs[b].append((a, c - P))
go_set = set([0])
stack = [0]
while stack:
v = stack.pop()
for to, _ in es[v]:
if to in go_set:
continue
go_set.add(to)
stack.append(to)
bk_set = set([N - 1])
stack = [N - 1]
while stack:
v = stack.pop()
for to, _ in bs[v]:
if to in bk_set:
continue
bk_set.add(to)
stack.append(to)
use = go_set & bk_set
K = len(use)
INF = float("inf")
d = [INF] * N
d[0] = 0
for i in range(K):
for v in range(N):
if v not in use:
continue
for to, c in es[v]:
if to not in use:
continue
if d[to] > d[v] - c:
d[to] = d[v] - c
if i == K - 1:
print((-1))
exit()
print((max(0, -d[-1])))
|
import sys
input = sys.stdin.readline
N, M, P = list(map(int, input().split()))
ABC = [tuple(map(int, input().split())) for i in range(M)]
es = [[] for _ in range(N)]
rs = [[] for _ in range(N)]
for a, b, c in ABC:
a, b = a - 1, b - 1
es[a].append(b)
rs[b].append(a)
stack = [0]
vis_go = set([0])
while stack:
v = stack.pop()
for to in es[v]:
if to in vis_go:
continue
vis_go.add(to)
stack.append(to)
stack = [N - 1]
vis_bk = set([N - 1])
while stack:
v = stack.pop()
for to in rs[v]:
if to in vis_bk:
continue
vis_bk.add(to)
stack.append(to)
use = vis_go & vis_bk
INF = float("inf")
dist = [INF] * N
dist[0] = 0
for i in range(len(use)):
for a, b, c in ABC:
a, b, c = a - 1, b - 1, P - c
if a not in use or b not in use:
continue
if dist[b] > dist[a] + c:
dist[b] = dist[a] + c
if i == len(use) - 1:
print((-1))
exit()
print((max(0, -dist[-1])))
| false | 2.272727 |
[
"+import sys",
"+",
"+input = sys.stdin.readline",
"-bs = [[] for _ in range(N)]",
"+rs = [[] for _ in range(N)]",
"- es[a].append((b, c - P))",
"- bs[b].append((a, c - P))",
"-go_set = set([0])",
"+ es[a].append(b)",
"+ rs[b].append(a)",
"+vis_go = set([0])",
"- for to, _ in es[v]:",
"- if to in go_set:",
"+ for to in es[v]:",
"+ if to in vis_go:",
"- go_set.add(to)",
"+ vis_go.add(to)",
"-bk_set = set([N - 1])",
"+vis_bk = set([N - 1])",
"- for to, _ in bs[v]:",
"- if to in bk_set:",
"+ for to in rs[v]:",
"+ if to in vis_bk:",
"- bk_set.add(to)",
"+ vis_bk.add(to)",
"-use = go_set & bk_set",
"-K = len(use)",
"+use = vis_go & vis_bk",
"-d = [INF] * N",
"-d[0] = 0",
"-for i in range(K):",
"- for v in range(N):",
"- if v not in use:",
"+dist = [INF] * N",
"+dist[0] = 0",
"+for i in range(len(use)):",
"+ for a, b, c in ABC:",
"+ a, b, c = a - 1, b - 1, P - c",
"+ if a not in use or b not in use:",
"- for to, c in es[v]:",
"- if to not in use:",
"- continue",
"- if d[to] > d[v] - c:",
"- d[to] = d[v] - c",
"- if i == K - 1:",
"- print((-1))",
"- exit()",
"-print((max(0, -d[-1])))",
"+ if dist[b] > dist[a] + c:",
"+ dist[b] = dist[a] + c",
"+ if i == len(use) - 1:",
"+ print((-1))",
"+ exit()",
"+print((max(0, -dist[-1])))"
] | false | 0.032226 | 0.037628 | 0.856416 |
[
"s650300891",
"s717217081"
] |
u344065503
|
p03436
|
python
|
s164068813
|
s777040719
| 191 | 87 | 40,688 | 74,192 |
Accepted
|
Accepted
| 54.45 |
from collections import deque
def bfs():
d=[[float("inf")]*m for _ in range(n)]
dx=[1,0,-1,0]
dy=[0,1,0,-1]
que=deque([])
que.append((0,0))
d[0][0]=0
while que:
p = que.popleft()
if p[0]==n-1 and p[1]==m-1:
break
for i in range(4):
nx=p[0]+dx[i]
ny=p[1]+dy[i]
if 0 <= nx < n and 0 <= ny < m and c[nx][ny] != "#" and d[nx][ny] == float("inf"):
# 移動できるならキューに入れ、その点の距離を p からの距離 +1 で確定する
que.append((nx, ny))
d[nx][ny] = d[p[0]][p[1]] + 1
return d[n-1][m-1]
n, m = list(map(int, input().split()))
c = [list(eval(input())) for i in range(n)]
count=0
for i in range(n):
for j in range(m):
if c[i][j]=="#":
count+=1
g=bfs()
if 0<g<float("inf"):
print((n*m-g-1-count))
else:
print((-1))
|
from collections import deque
h,w=list(map(int,input().split()))
c=[list(eval(input())) for _ in range(h)]
dhdw = [[-1,0],[1,0],[0,-1],[0,1]]
min_dis=[[-1]*w for _ in range(h)]
que=deque()
def bfs(x,y):
que.append([x,y])
min_dis[x][y]=0
while que:
sh,sw=que.popleft()
for dh,dw in dhdw:
nh,nw = sh+dh,sw+dw
if not(0<=nh<=h-1) or not(0<=nw<=w-1) or min_dis[nh][nw]!=-1 or c[nh][nw]=='#':
continue
min_dis[nh][nw]=min_dis[sh][sw]+1
que.append([nh,nw])
if [nh,nw]==[h-1,w-1]:
return min_dis[sh][sw]+1
a=bfs(0,0) or 0
if a==0:
print((-1))
exit()
ans=0
for i in c:
ans+=i.count(".")
print((ans-1-a))
| 36 | 27 | 819 | 670 |
from collections import deque
def bfs():
d = [[float("inf")] * m for _ in range(n)]
dx = [1, 0, -1, 0]
dy = [0, 1, 0, -1]
que = deque([])
que.append((0, 0))
d[0][0] = 0
while que:
p = que.popleft()
if p[0] == n - 1 and p[1] == m - 1:
break
for i in range(4):
nx = p[0] + dx[i]
ny = p[1] + dy[i]
if (
0 <= nx < n
and 0 <= ny < m
and c[nx][ny] != "#"
and d[nx][ny] == float("inf")
):
# 移動できるならキューに入れ、その点の距離を p からの距離 +1 で確定する
que.append((nx, ny))
d[nx][ny] = d[p[0]][p[1]] + 1
return d[n - 1][m - 1]
n, m = list(map(int, input().split()))
c = [list(eval(input())) for i in range(n)]
count = 0
for i in range(n):
for j in range(m):
if c[i][j] == "#":
count += 1
g = bfs()
if 0 < g < float("inf"):
print((n * m - g - 1 - count))
else:
print((-1))
|
from collections import deque
h, w = list(map(int, input().split()))
c = [list(eval(input())) for _ in range(h)]
dhdw = [[-1, 0], [1, 0], [0, -1], [0, 1]]
min_dis = [[-1] * w for _ in range(h)]
que = deque()
def bfs(x, y):
que.append([x, y])
min_dis[x][y] = 0
while que:
sh, sw = que.popleft()
for dh, dw in dhdw:
nh, nw = sh + dh, sw + dw
if (
not (0 <= nh <= h - 1)
or not (0 <= nw <= w - 1)
or min_dis[nh][nw] != -1
or c[nh][nw] == "#"
):
continue
min_dis[nh][nw] = min_dis[sh][sw] + 1
que.append([nh, nw])
if [nh, nw] == [h - 1, w - 1]:
return min_dis[sh][sw] + 1
a = bfs(0, 0) or 0
if a == 0:
print((-1))
exit()
ans = 0
for i in c:
ans += i.count(".")
print((ans - 1 - a))
| false | 25 |
[
"-",
"-def bfs():",
"- d = [[float(\"inf\")] * m for _ in range(n)]",
"- dx = [1, 0, -1, 0]",
"- dy = [0, 1, 0, -1]",
"- que = deque([])",
"- que.append((0, 0))",
"- d[0][0] = 0",
"- while que:",
"- p = que.popleft()",
"- if p[0] == n - 1 and p[1] == m - 1:",
"- break",
"- for i in range(4):",
"- nx = p[0] + dx[i]",
"- ny = p[1] + dy[i]",
"- if (",
"- 0 <= nx < n",
"- and 0 <= ny < m",
"- and c[nx][ny] != \"#\"",
"- and d[nx][ny] == float(\"inf\")",
"- ):",
"- # 移動できるならキューに入れ、その点の距離を p からの距離 +1 で確定する",
"- que.append((nx, ny))",
"- d[nx][ny] = d[p[0]][p[1]] + 1",
"- return d[n - 1][m - 1]",
"+h, w = list(map(int, input().split()))",
"+c = [list(eval(input())) for _ in range(h)]",
"+dhdw = [[-1, 0], [1, 0], [0, -1], [0, 1]]",
"+min_dis = [[-1] * w for _ in range(h)]",
"+que = deque()",
"-n, m = list(map(int, input().split()))",
"-c = [list(eval(input())) for i in range(n)]",
"-count = 0",
"-for i in range(n):",
"- for j in range(m):",
"- if c[i][j] == \"#\":",
"- count += 1",
"-g = bfs()",
"-if 0 < g < float(\"inf\"):",
"- print((n * m - g - 1 - count))",
"-else:",
"+def bfs(x, y):",
"+ que.append([x, y])",
"+ min_dis[x][y] = 0",
"+ while que:",
"+ sh, sw = que.popleft()",
"+ for dh, dw in dhdw:",
"+ nh, nw = sh + dh, sw + dw",
"+ if (",
"+ not (0 <= nh <= h - 1)",
"+ or not (0 <= nw <= w - 1)",
"+ or min_dis[nh][nw] != -1",
"+ or c[nh][nw] == \"#\"",
"+ ):",
"+ continue",
"+ min_dis[nh][nw] = min_dis[sh][sw] + 1",
"+ que.append([nh, nw])",
"+ if [nh, nw] == [h - 1, w - 1]:",
"+ return min_dis[sh][sw] + 1",
"+",
"+",
"+a = bfs(0, 0) or 0",
"+if a == 0:",
"+ exit()",
"+ans = 0",
"+for i in c:",
"+ ans += i.count(\".\")",
"+print((ans - 1 - a))"
] | false | 0.045107 | 0.047822 | 0.943237 |
[
"s164068813",
"s777040719"
] |
u340781749
|
p02994
|
python
|
s266798759
|
s931179156
| 20 | 18 | 3,060 | 2,940 |
Accepted
|
Accepted
| 10 |
n, l = list(map(int, input().split()))
apples = list(range(l, l + n))
if 0 in apples:
print((sum(apples)))
elif l < 0:
print((sum(apples) - max(apples)))
else:
print((sum(apples) - min(apples)))
|
n, l = list(map(int, input().split()))
apples = list(range(l, l + n))
print((sum(apples) - min(apples, key=abs)))
| 8 | 3 | 202 | 108 |
n, l = list(map(int, input().split()))
apples = list(range(l, l + n))
if 0 in apples:
print((sum(apples)))
elif l < 0:
print((sum(apples) - max(apples)))
else:
print((sum(apples) - min(apples)))
|
n, l = list(map(int, input().split()))
apples = list(range(l, l + n))
print((sum(apples) - min(apples, key=abs)))
| false | 62.5 |
[
"-if 0 in apples:",
"- print((sum(apples)))",
"-elif l < 0:",
"- print((sum(apples) - max(apples)))",
"-else:",
"- print((sum(apples) - min(apples)))",
"+print((sum(apples) - min(apples, key=abs)))"
] | false | 0.044042 | 0.042221 | 1.04311 |
[
"s266798759",
"s931179156"
] |
u509739538
|
p02947
|
python
|
s893966605
|
s716990018
| 893 | 468 | 30,536 | 29,848 |
Accepted
|
Accepted
| 47.59 |
from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
def comb(n,r):
return math.factorial(n)//math.factorial(r)//math.factorial(max(1,n-r))
def con(t):
ans = ""
for i in t:
ans+=i[0]+str(i[1])
return ans
n = readInt()
d = defaultdict(int)
for i in [eval(input()) for i in range(n)]:
t = defaultdict(int)
for j in i:
t[j]+=1
d[con(sorted(t.items()))]+=1
ans = 0
for i in d:
ans+=comb(d[i],2)
print(ans)
|
from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
n = readInt()
d = defaultdict(int)
for i in [eval(input()) for j in range(n)]:
d["".join(sorted(i))]+=1
from math import factorial as f
ans = 0
for i in d:
if d[i]>1:
ans+=f(d[i])//f(2)//f(d[i]-2)
print(ans)
| 36 | 28 | 702 | 537 |
from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
def comb(n, r):
return math.factorial(n) // math.factorial(r) // math.factorial(max(1, n - r))
def con(t):
ans = ""
for i in t:
ans += i[0] + str(i[1])
return ans
n = readInt()
d = defaultdict(int)
for i in [eval(input()) for i in range(n)]:
t = defaultdict(int)
for j in i:
t[j] += 1
d[con(sorted(t.items()))] += 1
ans = 0
for i in d:
ans += comb(d[i], 2)
print(ans)
|
from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChar():
return eval(input())
def readChars():
return input().split()
n = readInt()
d = defaultdict(int)
for i in [eval(input()) for j in range(n)]:
d["".join(sorted(i))] += 1
from math import factorial as f
ans = 0
for i in d:
if d[i] > 1:
ans += f(d[i]) // f(2) // f(d[i] - 2)
print(ans)
| false | 22.222222 |
[
"-def comb(n, r):",
"- return math.factorial(n) // math.factorial(r) // math.factorial(max(1, n - r))",
"-",
"-",
"-def con(t):",
"- ans = \"\"",
"- for i in t:",
"- ans += i[0] + str(i[1])",
"- return ans",
"-",
"-",
"-for i in [eval(input()) for i in range(n)]:",
"- t = defaultdict(int)",
"- for j in i:",
"- t[j] += 1",
"- d[con(sorted(t.items()))] += 1",
"+for i in [eval(input()) for j in range(n)]:",
"+ d[\"\".join(sorted(i))] += 1",
"+from math import factorial as f",
"+",
"- ans += comb(d[i], 2)",
"+ if d[i] > 1:",
"+ ans += f(d[i]) // f(2) // f(d[i] - 2)"
] | false | 0.086838 | 0.036738 | 2.363693 |
[
"s893966605",
"s716990018"
] |
u047796752
|
p02713
|
python
|
s865334326
|
s310070152
| 524 | 478 | 67,660 | 68,912 |
Accepted
|
Accepted
| 8.78 |
from math import gcd
K = int(eval(input()))
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
ans += gcd(gcd(i, j), k)
print(ans)
|
from math import *
K = int(eval(input()))
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
ans += gcd(gcd(i, j), k)
print(ans)
| 11 | 11 | 202 | 188 |
from math import gcd
K = int(eval(input()))
ans = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
for k in range(1, K + 1):
ans += gcd(gcd(i, j), k)
print(ans)
|
from math import *
K = int(eval(input()))
ans = 0
for i in range(1, K + 1):
for j in range(1, K + 1):
for k in range(1, K + 1):
ans += gcd(gcd(i, j), k)
print(ans)
| false | 0 |
[
"-from math import gcd",
"+from math import *"
] | false | 0.007916 | 0.042861 | 0.184697 |
[
"s865334326",
"s310070152"
] |
u192154323
|
p03557
|
python
|
s242004869
|
s633132912
| 1,277 | 233 | 23,328 | 105,600 |
Accepted
|
Accepted
| 81.75 |
n = int(eval(input()))
a_ls = list(map(int, input().split()))
b_ls = list(map(int, input().split()))
c_ls = list(map(int, input().split()))
a_ls.sort()
b_ls.sort()
c_ls.sort()
# 「-より大きい」
def isOK_1(ind, key, ls):
if ls[ind] > key:
return True
else: # if ls[ind] <= key
return False
def connect_b2c_minind(key, ls):
ok = len(ls)
ng = -1
while ok - ng > 1:
mid = ng + (ok-ng) // 2
if isOK_1(mid, key, ls):
ok = mid
else:
ng = mid
return len(ls) - ok
def isOK_2(ind, key, ls):
if ls[ind] < key:
return True
else: # if ls[ind] >= key
return False
def connect_a2b_maxind(key, ls):
ok = -1
ng = len(ls)
while ng - ok > 1:
mid = ok + (ng - ok) // 2
if isOK_2(mid, key, ls):
ok = mid
else:
ng = mid
return ok + 1
ans = 0
for i in range(n):
ans += connect_a2b_maxind(b_ls[i], a_ls) * connect_b2c_minind(b_ls[i], c_ls)
print(ans)
|
n = int(eval(input()))
a_ls = list(map(int, input().split()))
b_ls = list(map(int, input().split()))
c_ls = list(map(int, input().split()))
for ls in [a_ls,b_ls,c_ls]:
ls.sort()
def is_not_less_than(ls, ind, key):
if ls[ind] >= key:
return True
else:
return False
def return_min_ind_whose_value_not_less_than(ls,key):
r = len(ls)
l = -1
while True:
next_ind = (r+l) // 2
if is_not_less_than(ls, next_ind, key):
r = next_ind
else:
l = next_ind
if r - l == 1:
return r
def is_more_than(ls, ind, key):
if ls[ind] > key:
return True
else:
return False
def return_min_ind_whose_value_more_than(ls,key):
r = len(ls)
l = -1
while True:
next_ind = (r+l) // 2
if is_more_than(ls, next_ind, key):
r = next_ind
else:
l = next_ind
if r - l == 1:
return r
ans = 0
for i in range(n):
b_c = n - return_min_ind_whose_value_more_than(c_ls, b_ls[i])
a_b = return_min_ind_whose_value_not_less_than(a_ls, b_ls[i])
ans += b_c*a_b
print(ans)
| 48 | 49 | 1,046 | 1,191 |
n = int(eval(input()))
a_ls = list(map(int, input().split()))
b_ls = list(map(int, input().split()))
c_ls = list(map(int, input().split()))
a_ls.sort()
b_ls.sort()
c_ls.sort()
# 「-より大きい」
def isOK_1(ind, key, ls):
if ls[ind] > key:
return True
else: # if ls[ind] <= key
return False
def connect_b2c_minind(key, ls):
ok = len(ls)
ng = -1
while ok - ng > 1:
mid = ng + (ok - ng) // 2
if isOK_1(mid, key, ls):
ok = mid
else:
ng = mid
return len(ls) - ok
def isOK_2(ind, key, ls):
if ls[ind] < key:
return True
else: # if ls[ind] >= key
return False
def connect_a2b_maxind(key, ls):
ok = -1
ng = len(ls)
while ng - ok > 1:
mid = ok + (ng - ok) // 2
if isOK_2(mid, key, ls):
ok = mid
else:
ng = mid
return ok + 1
ans = 0
for i in range(n):
ans += connect_a2b_maxind(b_ls[i], a_ls) * connect_b2c_minind(b_ls[i], c_ls)
print(ans)
|
n = int(eval(input()))
a_ls = list(map(int, input().split()))
b_ls = list(map(int, input().split()))
c_ls = list(map(int, input().split()))
for ls in [a_ls, b_ls, c_ls]:
ls.sort()
def is_not_less_than(ls, ind, key):
if ls[ind] >= key:
return True
else:
return False
def return_min_ind_whose_value_not_less_than(ls, key):
r = len(ls)
l = -1
while True:
next_ind = (r + l) // 2
if is_not_less_than(ls, next_ind, key):
r = next_ind
else:
l = next_ind
if r - l == 1:
return r
def is_more_than(ls, ind, key):
if ls[ind] > key:
return True
else:
return False
def return_min_ind_whose_value_more_than(ls, key):
r = len(ls)
l = -1
while True:
next_ind = (r + l) // 2
if is_more_than(ls, next_ind, key):
r = next_ind
else:
l = next_ind
if r - l == 1:
return r
ans = 0
for i in range(n):
b_c = n - return_min_ind_whose_value_more_than(c_ls, b_ls[i])
a_b = return_min_ind_whose_value_not_less_than(a_ls, b_ls[i])
ans += b_c * a_b
print(ans)
| false | 2.040816 |
[
"-a_ls.sort()",
"-b_ls.sort()",
"-c_ls.sort()",
"-# 「-より大きい」",
"-def isOK_1(ind, key, ls):",
"- if ls[ind] > key:",
"+for ls in [a_ls, b_ls, c_ls]:",
"+ ls.sort()",
"+",
"+",
"+def is_not_less_than(ls, ind, key):",
"+ if ls[ind] >= key:",
"- else: # if ls[ind] <= key",
"+ else:",
"-def connect_b2c_minind(key, ls):",
"- ok = len(ls)",
"- ng = -1",
"- while ok - ng > 1:",
"- mid = ng + (ok - ng) // 2",
"- if isOK_1(mid, key, ls):",
"- ok = mid",
"+def return_min_ind_whose_value_not_less_than(ls, key):",
"+ r = len(ls)",
"+ l = -1",
"+ while True:",
"+ next_ind = (r + l) // 2",
"+ if is_not_less_than(ls, next_ind, key):",
"+ r = next_ind",
"- ng = mid",
"- return len(ls) - ok",
"+ l = next_ind",
"+ if r - l == 1:",
"+ return r",
"-def isOK_2(ind, key, ls):",
"- if ls[ind] < key:",
"+def is_more_than(ls, ind, key):",
"+ if ls[ind] > key:",
"- else: # if ls[ind] >= key",
"+ else:",
"-def connect_a2b_maxind(key, ls):",
"- ok = -1",
"- ng = len(ls)",
"- while ng - ok > 1:",
"- mid = ok + (ng - ok) // 2",
"- if isOK_2(mid, key, ls):",
"- ok = mid",
"+def return_min_ind_whose_value_more_than(ls, key):",
"+ r = len(ls)",
"+ l = -1",
"+ while True:",
"+ next_ind = (r + l) // 2",
"+ if is_more_than(ls, next_ind, key):",
"+ r = next_ind",
"- ng = mid",
"- return ok + 1",
"+ l = next_ind",
"+ if r - l == 1:",
"+ return r",
"- ans += connect_a2b_maxind(b_ls[i], a_ls) * connect_b2c_minind(b_ls[i], c_ls)",
"+ b_c = n - return_min_ind_whose_value_more_than(c_ls, b_ls[i])",
"+ a_b = return_min_ind_whose_value_not_less_than(a_ls, b_ls[i])",
"+ ans += b_c * a_b"
] | false | 0.038848 | 0.036777 | 1.056326 |
[
"s242004869",
"s633132912"
] |
u599114793
|
p02837
|
python
|
s952293876
|
s101157098
| 1,502 | 1,375 | 5,672 | 5,416 |
Accepted
|
Accepted
| 8.46 |
n = int(eval(input()))
lst = [(bin(i)[2:]).zfill(n) for i in range(2**n)]
num_list = []
A_list = []
xy_list = []
for i in range(n):
a = int(eval(input()))
A_list.append(a)
for j in range(a):
x,y = list(map(int,input().split()))
xy_list.append([x,y])
for i in range(len(lst)):
choose = lst[i]
one_count = choose.count("1")
a_count = 0
flag = True
for num, j in enumerate(A_list):
a_count += j
for k in range(a_count-j, a_count):
x,y = xy_list[k][0],xy_list[k][1]
if choose[num] == "1" and choose[x-1] != str(y):
flag = False
break
if flag:
num_list.append(one_count)
else:
num_list.append(0)
print((max(num_list)))
|
n = int(eval(input()))
lst = [(bin(i)[2:]).zfill(n) for i in range(2**n)]
ans = 0
A_list = []
xy_list = []
for i in range(n):
a = int(eval(input()))
A_list.append(a)
for j in range(a):
x,y = list(map(int,input().split()))
xy_list.append([x,y])
for i in range(len(lst)):
choose = lst[i]
one_count = choose.count("1")
a_count = 0
flag = True
for num, j in enumerate(A_list):
a_count += j
for k in range(a_count-j, a_count):
x,y = xy_list[k][0],xy_list[k][1]
if choose[num] == "1" and choose[x-1] != str(y):
flag = False
break
if flag:
ans = max(ans,one_count)
print(ans)
| 28 | 26 | 765 | 708 |
n = int(eval(input()))
lst = [(bin(i)[2:]).zfill(n) for i in range(2**n)]
num_list = []
A_list = []
xy_list = []
for i in range(n):
a = int(eval(input()))
A_list.append(a)
for j in range(a):
x, y = list(map(int, input().split()))
xy_list.append([x, y])
for i in range(len(lst)):
choose = lst[i]
one_count = choose.count("1")
a_count = 0
flag = True
for num, j in enumerate(A_list):
a_count += j
for k in range(a_count - j, a_count):
x, y = xy_list[k][0], xy_list[k][1]
if choose[num] == "1" and choose[x - 1] != str(y):
flag = False
break
if flag:
num_list.append(one_count)
else:
num_list.append(0)
print((max(num_list)))
|
n = int(eval(input()))
lst = [(bin(i)[2:]).zfill(n) for i in range(2**n)]
ans = 0
A_list = []
xy_list = []
for i in range(n):
a = int(eval(input()))
A_list.append(a)
for j in range(a):
x, y = list(map(int, input().split()))
xy_list.append([x, y])
for i in range(len(lst)):
choose = lst[i]
one_count = choose.count("1")
a_count = 0
flag = True
for num, j in enumerate(A_list):
a_count += j
for k in range(a_count - j, a_count):
x, y = xy_list[k][0], xy_list[k][1]
if choose[num] == "1" and choose[x - 1] != str(y):
flag = False
break
if flag:
ans = max(ans, one_count)
print(ans)
| false | 7.142857 |
[
"-num_list = []",
"+ans = 0",
"- num_list.append(one_count)",
"- else:",
"- num_list.append(0)",
"-print((max(num_list)))",
"+ ans = max(ans, one_count)",
"+print(ans)"
] | false | 0.034174 | 0.036098 | 0.946704 |
[
"s952293876",
"s101157098"
] |
u111365362
|
p02579
|
python
|
s640409060
|
s828930469
| 516 | 427 | 108,336 | 107,652 |
Accepted
|
Accepted
| 17.25 |
h,w = list(map(int,input().split()))
s = list(map(int,input().split()))
g = list(map(int,input().split()))
s[0] -= 1
s[1] -= 1
g[0] -= 1
g[1] -= 1
raw = []
seen = []
for _ in range(h):
tmp = eval(input())
raw.append(tmp)
t = []
for j in range(w):
if tmp[j] == '.':
t.append(0)
else:
t.append(1)
seen.append(t)
#print(seen)
now = [s]
ans = 0
def check(ii,jj):
if 0 <= ii < h and 0 <= jj < w:
if seen[ii][jj] == 0:
seen[ii][jj] = 1
now.append([ii,jj])
seen[s[0]][s[1]] = 1
from collections import deque
now = deque([s])
while now:
for i in range(10**6):
try:
a,b = now[i]
check(a-1,b)
check(a+1,b)
check(a,b-1)
check(a,b+1)
except:
break
if seen[g[0]][g[1]] == 1:
print(ans)
break
#print(now)
ans += 1
last = now
now = deque()
for x in last:
a,b = x
for di in range(-2,3):
for dj in range(-2,3):
check(a+di,b+dj)
#print(now)
else:
print((-1))
|
h,w = list(map(int,input().split()))
s = list(map(int,input().split()))
g = list(map(int,input().split()))
s[0] -= 1
s[1] -= 1
g[0] -= 1
g[1] -= 1
raw = []
seen = []
for _ in range(h):
tmp = eval(input())
raw.append(tmp)
t = []
for j in range(w):
if tmp[j] == '.':
t.append(0)
else:
t.append(1)
seen.append(t)
#print(seen)
now = [s]
ans = 0
def check(ii,jj):
if 0 <= ii < h and 0 <= jj < w:
if seen[ii][jj] == 0:
seen[ii][jj] = 1
now.append([ii,jj])
while now:
for x in now:
a,b = x
check(a-1,b)
check(a+1,b)
check(a,b-1)
check(a,b+1)
if seen[g[0]][g[1]] == 1:
print(ans)
break
ans += 1
last = now
now = []
for x in last:
a,b = x
for di in range(-2,3):
for dj in range(-2,3):
check(a+di,b+dj)
else:
print((-1))
| 55 | 47 | 1,020 | 854 |
h, w = list(map(int, input().split()))
s = list(map(int, input().split()))
g = list(map(int, input().split()))
s[0] -= 1
s[1] -= 1
g[0] -= 1
g[1] -= 1
raw = []
seen = []
for _ in range(h):
tmp = eval(input())
raw.append(tmp)
t = []
for j in range(w):
if tmp[j] == ".":
t.append(0)
else:
t.append(1)
seen.append(t)
# print(seen)
now = [s]
ans = 0
def check(ii, jj):
if 0 <= ii < h and 0 <= jj < w:
if seen[ii][jj] == 0:
seen[ii][jj] = 1
now.append([ii, jj])
seen[s[0]][s[1]] = 1
from collections import deque
now = deque([s])
while now:
for i in range(10**6):
try:
a, b = now[i]
check(a - 1, b)
check(a + 1, b)
check(a, b - 1)
check(a, b + 1)
except:
break
if seen[g[0]][g[1]] == 1:
print(ans)
break
# print(now)
ans += 1
last = now
now = deque()
for x in last:
a, b = x
for di in range(-2, 3):
for dj in range(-2, 3):
check(a + di, b + dj)
# print(now)
else:
print((-1))
|
h, w = list(map(int, input().split()))
s = list(map(int, input().split()))
g = list(map(int, input().split()))
s[0] -= 1
s[1] -= 1
g[0] -= 1
g[1] -= 1
raw = []
seen = []
for _ in range(h):
tmp = eval(input())
raw.append(tmp)
t = []
for j in range(w):
if tmp[j] == ".":
t.append(0)
else:
t.append(1)
seen.append(t)
# print(seen)
now = [s]
ans = 0
def check(ii, jj):
if 0 <= ii < h and 0 <= jj < w:
if seen[ii][jj] == 0:
seen[ii][jj] = 1
now.append([ii, jj])
while now:
for x in now:
a, b = x
check(a - 1, b)
check(a + 1, b)
check(a, b - 1)
check(a, b + 1)
if seen[g[0]][g[1]] == 1:
print(ans)
break
ans += 1
last = now
now = []
for x in last:
a, b = x
for di in range(-2, 3):
for dj in range(-2, 3):
check(a + di, b + dj)
else:
print((-1))
| false | 14.545455 |
[
"-seen[s[0]][s[1]] = 1",
"-from collections import deque",
"-",
"-now = deque([s])",
"- for i in range(10**6):",
"- try:",
"- a, b = now[i]",
"- check(a - 1, b)",
"- check(a + 1, b)",
"- check(a, b - 1)",
"- check(a, b + 1)",
"- except:",
"- break",
"+ for x in now:",
"+ a, b = x",
"+ check(a - 1, b)",
"+ check(a + 1, b)",
"+ check(a, b - 1)",
"+ check(a, b + 1)",
"- # print(now)",
"- now = deque()",
"+ now = []",
"- # print(now)"
] | false | 0.143683 | 0.042613 | 3.371767 |
[
"s640409060",
"s828930469"
] |
u546338822
|
p02691
|
python
|
s999206910
|
s123756377
| 238 | 219 | 56,624 | 41,540 |
Accepted
|
Accepted
| 7.98 |
def main():
n = int(eval(input()))
a = list(map(int,input().split()))
Ilis = {}
Jlis = {}
for i in range(n):
k = a[i]+i+1
l = i-a[i]+1
if k not in list(Ilis.keys()):
Ilis[k] = 1
else:
Ilis[k]+=1
if l not in list(Jlis.keys()):
Jlis[l]=1
else:
Jlis[l]+=1
ans = 0
for i in list(Ilis.keys()):
if i in list(Jlis.keys()):
ans += Ilis[i]*Jlis[i]
print(ans)
if __name__ == "__main__":
main()
|
def main():
n = int(eval(input()))
a = list(map(int,input().split()))
sa,wa = {},{}
for i in range(n):
if a[i]+i+1 not in list(wa.keys()):
wa[a[i]+i+1]=1
else:
wa[a[i]+i+1]+=1
if i-a[i] >0:
if i+1-a[i] not in list(sa.keys()):
sa[i+1-a[i]]=1
else:
sa[i+1-a[i]]+=1
ans = 0
for k in list(sa.keys()):
if k in list(wa.keys()):
ans += sa[k]*wa[k]
print(ans)
if __name__ == "__main__":
main()
| 24 | 23 | 530 | 536 |
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
Ilis = {}
Jlis = {}
for i in range(n):
k = a[i] + i + 1
l = i - a[i] + 1
if k not in list(Ilis.keys()):
Ilis[k] = 1
else:
Ilis[k] += 1
if l not in list(Jlis.keys()):
Jlis[l] = 1
else:
Jlis[l] += 1
ans = 0
for i in list(Ilis.keys()):
if i in list(Jlis.keys()):
ans += Ilis[i] * Jlis[i]
print(ans)
if __name__ == "__main__":
main()
|
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
sa, wa = {}, {}
for i in range(n):
if a[i] + i + 1 not in list(wa.keys()):
wa[a[i] + i + 1] = 1
else:
wa[a[i] + i + 1] += 1
if i - a[i] > 0:
if i + 1 - a[i] not in list(sa.keys()):
sa[i + 1 - a[i]] = 1
else:
sa[i + 1 - a[i]] += 1
ans = 0
for k in list(sa.keys()):
if k in list(wa.keys()):
ans += sa[k] * wa[k]
print(ans)
if __name__ == "__main__":
main()
| false | 4.166667 |
[
"- Ilis = {}",
"- Jlis = {}",
"+ sa, wa = {}, {}",
"- k = a[i] + i + 1",
"- l = i - a[i] + 1",
"- if k not in list(Ilis.keys()):",
"- Ilis[k] = 1",
"+ if a[i] + i + 1 not in list(wa.keys()):",
"+ wa[a[i] + i + 1] = 1",
"- Ilis[k] += 1",
"- if l not in list(Jlis.keys()):",
"- Jlis[l] = 1",
"- else:",
"- Jlis[l] += 1",
"+ wa[a[i] + i + 1] += 1",
"+ if i - a[i] > 0:",
"+ if i + 1 - a[i] not in list(sa.keys()):",
"+ sa[i + 1 - a[i]] = 1",
"+ else:",
"+ sa[i + 1 - a[i]] += 1",
"- for i in list(Ilis.keys()):",
"- if i in list(Jlis.keys()):",
"- ans += Ilis[i] * Jlis[i]",
"+ for k in list(sa.keys()):",
"+ if k in list(wa.keys()):",
"+ ans += sa[k] * wa[k]"
] | false | 0.034042 | 0.033912 | 1.003836 |
[
"s999206910",
"s123756377"
] |
u925626880
|
p03448
|
python
|
s895208388
|
s228880112
| 28 | 17 | 3,060 | 3,060 |
Accepted
|
Accepted
| 39.29 |
def main():
a = int(eval(input())) # 500
b = int(eval(input())) # 100
c = int(eval(input())) # 50
x = int(eval(input()))
ans = 0
for i in range(a+1):
I = i*500
if I > x:
break
for j in range(b+1):
J = j*100
if I+J > x:
break
for k in range(c+1):
K = k*50
if I+J+K == x:
ans +=1
print(ans)
if __name__ == '__main__':
main()
|
def main():
a = int(eval(input())) # 500
b = int(eval(input())) # 100
c = int(eval(input())) # 50
x = int(eval(input()))
ans = 0
kmax = c * 50
for i in range(a+1):
I = i*500
if I > x:
break
for j in range(b+1):
IJ = I + j*100
if IJ > x:
break
if x <= IJ + kmax:
ans +=1
print(ans)
if __name__ == '__main__':
main()
| 25 | 24 | 500 | 459 |
def main():
a = int(eval(input())) # 500
b = int(eval(input())) # 100
c = int(eval(input())) # 50
x = int(eval(input()))
ans = 0
for i in range(a + 1):
I = i * 500
if I > x:
break
for j in range(b + 1):
J = j * 100
if I + J > x:
break
for k in range(c + 1):
K = k * 50
if I + J + K == x:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
def main():
a = int(eval(input())) # 500
b = int(eval(input())) # 100
c = int(eval(input())) # 50
x = int(eval(input()))
ans = 0
kmax = c * 50
for i in range(a + 1):
I = i * 500
if I > x:
break
for j in range(b + 1):
IJ = I + j * 100
if IJ > x:
break
if x <= IJ + kmax:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| false | 4 |
[
"+ kmax = c * 50",
"- J = j * 100",
"- if I + J > x:",
"+ IJ = I + j * 100",
"+ if IJ > x:",
"- for k in range(c + 1):",
"- K = k * 50",
"- if I + J + K == x:",
"- ans += 1",
"+ if x <= IJ + kmax:",
"+ ans += 1"
] | false | 0.038529 | 0.037391 | 1.030438 |
[
"s895208388",
"s228880112"
] |
u049182844
|
p02712
|
python
|
s185453434
|
s576529570
| 170 | 157 | 29,992 | 8,940 |
Accepted
|
Accepted
| 7.65 |
N = int(eval(input()))
SUM = []
for i in range(1,N+1):
if i % 3 == 0 or i % 5 ==0:
pass
else:
SUM.append(i)
print((sum(SUM)))
|
N = int(eval(input()))
count = 0
for i in range(1,N+1):
if not(i % 3== 0 or i % 5 == 0):
count += i
print(count)
| 9 | 6 | 151 | 117 |
N = int(eval(input()))
SUM = []
for i in range(1, N + 1):
if i % 3 == 0 or i % 5 == 0:
pass
else:
SUM.append(i)
print((sum(SUM)))
|
N = int(eval(input()))
count = 0
for i in range(1, N + 1):
if not (i % 3 == 0 or i % 5 == 0):
count += i
print(count)
| false | 33.333333 |
[
"-SUM = []",
"+count = 0",
"- if i % 3 == 0 or i % 5 == 0:",
"- pass",
"- else:",
"- SUM.append(i)",
"-print((sum(SUM)))",
"+ if not (i % 3 == 0 or i % 5 == 0):",
"+ count += i",
"+print(count)"
] | false | 0.172569 | 0.199432 | 0.865303 |
[
"s185453434",
"s576529570"
] |
u836939578
|
p02597
|
python
|
s410713186
|
s826823562
| 87 | 64 | 67,920 | 64,880 |
Accepted
|
Accepted
| 26.44 |
import sys
input = lambda: sys.stdin.readline().rstrip()
N = int(eval(input()))
c = eval(input())
a = c.count('R')
b = 0
ans = max(a, b)
for i in range(len(c)):
if c[i] == 'R':
a -= 1
else:
b += 1
now = max(a, b)
ans = min(ans, now)
print(ans)
|
N = int(eval(input()))
A = eval(input())
r_cnt = A.count('R')
ans = 0
for i in range(r_cnt):
if A[i] != 'R':
ans += 1
print(ans)
| 21 | 11 | 293 | 141 |
import sys
input = lambda: sys.stdin.readline().rstrip()
N = int(eval(input()))
c = eval(input())
a = c.count("R")
b = 0
ans = max(a, b)
for i in range(len(c)):
if c[i] == "R":
a -= 1
else:
b += 1
now = max(a, b)
ans = min(ans, now)
print(ans)
|
N = int(eval(input()))
A = eval(input())
r_cnt = A.count("R")
ans = 0
for i in range(r_cnt):
if A[i] != "R":
ans += 1
print(ans)
| false | 47.619048 |
[
"-import sys",
"-",
"-input = lambda: sys.stdin.readline().rstrip()",
"-c = eval(input())",
"-a = c.count(\"R\")",
"-b = 0",
"-ans = max(a, b)",
"-for i in range(len(c)):",
"- if c[i] == \"R\":",
"- a -= 1",
"- else:",
"- b += 1",
"- now = max(a, b)",
"- ans = min(ans, now)",
"+A = eval(input())",
"+r_cnt = A.count(\"R\")",
"+ans = 0",
"+for i in range(r_cnt):",
"+ if A[i] != \"R\":",
"+ ans += 1"
] | false | 0.147045 | 0.119134 | 1.234284 |
[
"s410713186",
"s826823562"
] |
u886747123
|
p03171
|
python
|
s414719446
|
s102168803
| 1,624 | 578 | 308,360 | 113,500 |
Accepted
|
Accepted
| 64.41 |
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
a = list(map(int, input().split()))
# dp[i][j] 区間a[i,j)だけ残った時点で互いの点数を一旦0とし、ゲームを最後まで続けた場合のX-Yの値
dp = [[float("inf")]*(N+1) for _ in range(N+1)]
for i in range(N+1):
dp[i][i] = 0
# こちらもメモ化再帰ではpypy3でも間に合わない
# j==i+1, i+2, ...とループしてdpテーブルの上三角部分を対角線と平行に埋めていく。jをshift_iと書き換えてループ
for shift_i in range(1, N+1):
for i in range(N+1):
if i+shift_i >= N+1:
continue
elif ((i+shift_i)-i)%2 == N%2: # 先手番
dp[i][(i+shift_i)] = max(a[i] + dp[i+1][(i+shift_i)], a[(i+shift_i)-1] + dp[i][(i+shift_i)-1])
else:
dp[i][(i+shift_i)] = min(-a[i] + dp[i+1][(i+shift_i)], -a[(i+shift_i)-1] + dp[i][(i+shift_i)-1])
print((dp[0][N]))
|
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
a = list(map(int, input().split()))
# dp[i][j] 区間a[i,j)だけ残った時点で互いの点数を一旦0とし、ゲームを最後まで続けた場合のX-Yの値
dp = [[0]*(N+1) for _ in range(N+1)] # 初期値を対角成分だけ0、その他をfloat("inf")にすると1000ms程度遅くなる
# こちらもメモ化再帰ではpypy3でも間に合わない
# j==i+1, i+2, ...とループしてdpテーブルの上三角部分を対角線と平行に埋めていく。jをshift_iと書き換えてループ
for shift_i in range(1, N+1):
for i in range(N+1):
if i+shift_i >= N+1:
continue
elif ((i+shift_i)-i)%2 == N%2: # 先手番
dp[i][(i+shift_i)] = max(a[i] + dp[i+1][(i+shift_i)], a[(i+shift_i)-1] + dp[i][(i+shift_i)-1])
else:
dp[i][(i+shift_i)] = min(-a[i] + dp[i+1][(i+shift_i)], -a[(i+shift_i)-1] + dp[i][(i+shift_i)-1])
print((dp[0][N]))
| 23 | 21 | 760 | 756 |
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
a = list(map(int, input().split()))
# dp[i][j] 区間a[i,j)だけ残った時点で互いの点数を一旦0とし、ゲームを最後まで続けた場合のX-Yの値
dp = [[float("inf")] * (N + 1) for _ in range(N + 1)]
for i in range(N + 1):
dp[i][i] = 0
# こちらもメモ化再帰ではpypy3でも間に合わない
# j==i+1, i+2, ...とループしてdpテーブルの上三角部分を対角線と平行に埋めていく。jをshift_iと書き換えてループ
for shift_i in range(1, N + 1):
for i in range(N + 1):
if i + shift_i >= N + 1:
continue
elif ((i + shift_i) - i) % 2 == N % 2: # 先手番
dp[i][(i + shift_i)] = max(
a[i] + dp[i + 1][(i + shift_i)],
a[(i + shift_i) - 1] + dp[i][(i + shift_i) - 1],
)
else:
dp[i][(i + shift_i)] = min(
-a[i] + dp[i + 1][(i + shift_i)],
-a[(i + shift_i) - 1] + dp[i][(i + shift_i) - 1],
)
print((dp[0][N]))
|
import sys
input = sys.stdin.buffer.readline
N = int(eval(input()))
a = list(map(int, input().split()))
# dp[i][j] 区間a[i,j)だけ残った時点で互いの点数を一旦0とし、ゲームを最後まで続けた場合のX-Yの値
dp = [
[0] * (N + 1) for _ in range(N + 1)
] # 初期値を対角成分だけ0、その他をfloat("inf")にすると1000ms程度遅くなる
# こちらもメモ化再帰ではpypy3でも間に合わない
# j==i+1, i+2, ...とループしてdpテーブルの上三角部分を対角線と平行に埋めていく。jをshift_iと書き換えてループ
for shift_i in range(1, N + 1):
for i in range(N + 1):
if i + shift_i >= N + 1:
continue
elif ((i + shift_i) - i) % 2 == N % 2: # 先手番
dp[i][(i + shift_i)] = max(
a[i] + dp[i + 1][(i + shift_i)],
a[(i + shift_i) - 1] + dp[i][(i + shift_i) - 1],
)
else:
dp[i][(i + shift_i)] = min(
-a[i] + dp[i + 1][(i + shift_i)],
-a[(i + shift_i) - 1] + dp[i][(i + shift_i) - 1],
)
print((dp[0][N]))
| false | 8.695652 |
[
"-dp = [[float(\"inf\")] * (N + 1) for _ in range(N + 1)]",
"-for i in range(N + 1):",
"- dp[i][i] = 0",
"+dp = [",
"+ [0] * (N + 1) for _ in range(N + 1)",
"+] # 初期値を対角成分だけ0、その他をfloat(\"inf\")にすると1000ms程度遅くなる"
] | false | 0.037225 | 0.033091 | 1.124946 |
[
"s414719446",
"s102168803"
] |
u537782349
|
p02971
|
python
|
s515206986
|
s071771812
| 700 | 547 | 15,732 | 14,876 |
Accepted
|
Accepted
| 21.86 |
a = int(eval(input()))
b = [int(eval(input())) for _ in range(a)]
c = [0] * a
c[0] = b[0]
c[1] = max(b[1], c[0])
d = [0] * a
d[0] = b[-1]
d[1] = max(b[-2], d[0])
for i in range(2, len(b)):
c[i] = max(c[i-1], b[i])
d[i] = max(d[i-1], b[-i-1])
c.insert(0, 0)
d.insert(0, 0)
for i in range(len(c)-1):
print((max(c[i], d[-i-2])))
|
a = int(eval(input()))
b = [int(eval(input())) for _ in range(a)]
c = b.copy()
c = sorted(c, reverse=True)
for i in b:
if i == c[0]:
print((c[1]))
else:
print((c[0]))
| 15 | 9 | 338 | 183 |
a = int(eval(input()))
b = [int(eval(input())) for _ in range(a)]
c = [0] * a
c[0] = b[0]
c[1] = max(b[1], c[0])
d = [0] * a
d[0] = b[-1]
d[1] = max(b[-2], d[0])
for i in range(2, len(b)):
c[i] = max(c[i - 1], b[i])
d[i] = max(d[i - 1], b[-i - 1])
c.insert(0, 0)
d.insert(0, 0)
for i in range(len(c) - 1):
print((max(c[i], d[-i - 2])))
|
a = int(eval(input()))
b = [int(eval(input())) for _ in range(a)]
c = b.copy()
c = sorted(c, reverse=True)
for i in b:
if i == c[0]:
print((c[1]))
else:
print((c[0]))
| false | 40 |
[
"-c = [0] * a",
"-c[0] = b[0]",
"-c[1] = max(b[1], c[0])",
"-d = [0] * a",
"-d[0] = b[-1]",
"-d[1] = max(b[-2], d[0])",
"-for i in range(2, len(b)):",
"- c[i] = max(c[i - 1], b[i])",
"- d[i] = max(d[i - 1], b[-i - 1])",
"-c.insert(0, 0)",
"-d.insert(0, 0)",
"-for i in range(len(c) - 1):",
"- print((max(c[i], d[-i - 2])))",
"+c = b.copy()",
"+c = sorted(c, reverse=True)",
"+for i in b:",
"+ if i == c[0]:",
"+ print((c[1]))",
"+ else:",
"+ print((c[0]))"
] | false | 0.048745 | 0.048057 | 1.014319 |
[
"s515206986",
"s071771812"
] |
u332385682
|
p03796
|
python
|
s852416051
|
s257142163
| 231 | 35 | 4,092 | 2,940 |
Accepted
|
Accepted
| 84.85 |
import sys
from math import factorial
MOD = 10**9 + 7
def solve():
N = int(input())
ans = factorial(N) % MOD
print(ans)
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
if __name__ == '__main__':
solve()
|
N = int(eval(input()))
ans = 1
mod = 10**9 + 7
for i in range(1, N + 1):
ans = (ans * i) % mod
print(ans)
| 19 | 9 | 370 | 114 |
import sys
from math import factorial
MOD = 10**9 + 7
def solve():
N = int(input())
ans = factorial(N) % MOD
print(ans)
def debug(x, table):
for name, val in table.items():
if x is val:
print("DEBUG:{} -> {}".format(name, val), file=sys.stderr)
return None
if __name__ == "__main__":
solve()
|
N = int(eval(input()))
ans = 1
mod = 10**9 + 7
for i in range(1, N + 1):
ans = (ans * i) % mod
print(ans)
| false | 52.631579 |
[
"-import sys",
"-from math import factorial",
"-",
"-MOD = 10**9 + 7",
"-",
"-",
"-def solve():",
"- N = int(input())",
"- ans = factorial(N) % MOD",
"- print(ans)",
"-",
"-",
"-def debug(x, table):",
"- for name, val in table.items():",
"- if x is val:",
"- print(\"DEBUG:{} -> {}\".format(name, val), file=sys.stderr)",
"- return None",
"-",
"-",
"-if __name__ == \"__main__\":",
"- solve()",
"+N = int(eval(input()))",
"+ans = 1",
"+mod = 10**9 + 7",
"+for i in range(1, N + 1):",
"+ ans = (ans * i) % mod",
"+print(ans)"
] | false | 0.138848 | 0.043116 | 3.220289 |
[
"s852416051",
"s257142163"
] |
u863370423
|
p03261
|
python
|
s212730240
|
s368168817
| 19 | 17 | 3,060 | 3,060 |
Accepted
|
Accepted
| 10.53 |
n = int(eval(input()))
w = [eval(input()) for i in range(n)]
flag = 1
for i in range(n):
for j in range(n):
if i == j:
continue
if w[i] == w[j]:
flag = flag *0
break
for i in range(n):
if i == 0:
continue
if w[i-1][-1] == w[i][0]:
flag = flag * 1
else:
flag = flag * 0
if flag == 1:
print("Yes")
else:
print("No")
|
N = int(eval(input()))
words = []
for i in range(N) :
words.append(eval(input()))
win = False
for j in range(1, N) :
if words[j].startswith(words[j-1][-1]) and words[j] not in words[:j]:
win = True
else :
win = False
break
if win == True :
print("Yes")
else :
print("No")
| 22 | 17 | 378 | 321 |
n = int(eval(input()))
w = [eval(input()) for i in range(n)]
flag = 1
for i in range(n):
for j in range(n):
if i == j:
continue
if w[i] == w[j]:
flag = flag * 0
break
for i in range(n):
if i == 0:
continue
if w[i - 1][-1] == w[i][0]:
flag = flag * 1
else:
flag = flag * 0
if flag == 1:
print("Yes")
else:
print("No")
|
N = int(eval(input()))
words = []
for i in range(N):
words.append(eval(input()))
win = False
for j in range(1, N):
if words[j].startswith(words[j - 1][-1]) and words[j] not in words[:j]:
win = True
else:
win = False
break
if win == True:
print("Yes")
else:
print("No")
| false | 22.727273 |
[
"-n = int(eval(input()))",
"-w = [eval(input()) for i in range(n)]",
"-flag = 1",
"-for i in range(n):",
"- for j in range(n):",
"- if i == j:",
"- continue",
"- if w[i] == w[j]:",
"- flag = flag * 0",
"- break",
"-for i in range(n):",
"- if i == 0:",
"- continue",
"- if w[i - 1][-1] == w[i][0]:",
"- flag = flag * 1",
"+N = int(eval(input()))",
"+words = []",
"+for i in range(N):",
"+ words.append(eval(input()))",
"+win = False",
"+for j in range(1, N):",
"+ if words[j].startswith(words[j - 1][-1]) and words[j] not in words[:j]:",
"+ win = True",
"- flag = flag * 0",
"-if flag == 1:",
"+ win = False",
"+ break",
"+if win == True:"
] | false | 0.044015 | 0.061878 | 0.71132 |
[
"s212730240",
"s368168817"
] |
u872887731
|
p03044
|
python
|
s544376205
|
s228664038
| 894 | 788 | 41,816 | 43,088 |
Accepted
|
Accepted
| 11.86 |
n = int(eval(input()))
data = [[] for _ in range(n)]
for _ in range(n-1):
a,b,c = list(map(int,input().split()))
data[a-1].append([b-1,c % 2])
data[b-1].append([a-1,c % 2])
que = []
color = [-1 for _ in range(n)]
def dfs(a,data):
# pop last index
#a : current state
if color[a] == -1:
color[a] = 0
que.append(a)
else:
return 0
while len(que):
a = que.pop()
for i in data[a]:
#i[0] is edge
#i[1] is cost
if color[i[0]] != -1:continue
if i[1] == 0:
color[i[0]] = color[a]
else:
color[i[0]] = 1 - color[a]
que.append(i[0])
for i in range(n):
dfs(i,data)
for i in range(n):
print((color[i]))
|
def main():
ii = lambda : int(eval(input()))
mi = lambda : list(map(int,input().split()))
li = lambda : list(map(int,input().split()))
n = ii()
v = [[] for _ in range(n)]
for i in range(n-1):
u,vv,w = mi()
v[u-1].append([vv -1,w % 2])
v[vv-1].append([u -1,w % 2])
flag = [0] * n
flag[0] = 1
ans = [-1] * n
from collections import deque
q = deque()
q.append((0,0))
ans[0] = 0
while q:
ima,ima_col = q.popleft()
for lis in v[ima]:
if flag[lis[0]] :continue
flag[lis[0]] = 1
if lis[1]:
ans[lis[0]] = lis[1] - ima_col
q.append((lis[0],lis[1] - ima_col))
else:
ans[lis[0]] = ima_col
q.append((lis[0],ima_col))
for i in range(n):
print((ans[i]))
main()
| 35 | 33 | 813 | 894 |
n = int(eval(input()))
data = [[] for _ in range(n)]
for _ in range(n - 1):
a, b, c = list(map(int, input().split()))
data[a - 1].append([b - 1, c % 2])
data[b - 1].append([a - 1, c % 2])
que = []
color = [-1 for _ in range(n)]
def dfs(a, data):
# pop last index
# a : current state
if color[a] == -1:
color[a] = 0
que.append(a)
else:
return 0
while len(que):
a = que.pop()
for i in data[a]:
# i[0] is edge
# i[1] is cost
if color[i[0]] != -1:
continue
if i[1] == 0:
color[i[0]] = color[a]
else:
color[i[0]] = 1 - color[a]
que.append(i[0])
for i in range(n):
dfs(i, data)
for i in range(n):
print((color[i]))
|
def main():
ii = lambda: int(eval(input()))
mi = lambda: list(map(int, input().split()))
li = lambda: list(map(int, input().split()))
n = ii()
v = [[] for _ in range(n)]
for i in range(n - 1):
u, vv, w = mi()
v[u - 1].append([vv - 1, w % 2])
v[vv - 1].append([u - 1, w % 2])
flag = [0] * n
flag[0] = 1
ans = [-1] * n
from collections import deque
q = deque()
q.append((0, 0))
ans[0] = 0
while q:
ima, ima_col = q.popleft()
for lis in v[ima]:
if flag[lis[0]]:
continue
flag[lis[0]] = 1
if lis[1]:
ans[lis[0]] = lis[1] - ima_col
q.append((lis[0], lis[1] - ima_col))
else:
ans[lis[0]] = ima_col
q.append((lis[0], ima_col))
for i in range(n):
print((ans[i]))
main()
| false | 5.714286 |
[
"-n = int(eval(input()))",
"-data = [[] for _ in range(n)]",
"-for _ in range(n - 1):",
"- a, b, c = list(map(int, input().split()))",
"- data[a - 1].append([b - 1, c % 2])",
"- data[b - 1].append([a - 1, c % 2])",
"-que = []",
"-color = [-1 for _ in range(n)]",
"+def main():",
"+ ii = lambda: int(eval(input()))",
"+ mi = lambda: list(map(int, input().split()))",
"+ li = lambda: list(map(int, input().split()))",
"+ n = ii()",
"+ v = [[] for _ in range(n)]",
"+ for i in range(n - 1):",
"+ u, vv, w = mi()",
"+ v[u - 1].append([vv - 1, w % 2])",
"+ v[vv - 1].append([u - 1, w % 2])",
"+ flag = [0] * n",
"+ flag[0] = 1",
"+ ans = [-1] * n",
"+ from collections import deque",
"+",
"+ q = deque()",
"+ q.append((0, 0))",
"+ ans[0] = 0",
"+ while q:",
"+ ima, ima_col = q.popleft()",
"+ for lis in v[ima]:",
"+ if flag[lis[0]]:",
"+ continue",
"+ flag[lis[0]] = 1",
"+ if lis[1]:",
"+ ans[lis[0]] = lis[1] - ima_col",
"+ q.append((lis[0], lis[1] - ima_col))",
"+ else:",
"+ ans[lis[0]] = ima_col",
"+ q.append((lis[0], ima_col))",
"+ for i in range(n):",
"+ print((ans[i]))",
"-def dfs(a, data):",
"- # pop last index",
"- # a : current state",
"- if color[a] == -1:",
"- color[a] = 0",
"- que.append(a)",
"- else:",
"- return 0",
"- while len(que):",
"- a = que.pop()",
"- for i in data[a]:",
"- # i[0] is edge",
"- # i[1] is cost",
"- if color[i[0]] != -1:",
"- continue",
"- if i[1] == 0:",
"- color[i[0]] = color[a]",
"- else:",
"- color[i[0]] = 1 - color[a]",
"- que.append(i[0])",
"-",
"-",
"-for i in range(n):",
"- dfs(i, data)",
"-for i in range(n):",
"- print((color[i]))",
"+main()"
] | false | 0.04261 | 0.041732 | 1.021047 |
[
"s544376205",
"s228664038"
] |
u319725914
|
p00223
|
python
|
s359474187
|
s334322803
| 7,610 | 4,560 | 35,868 | 35,884 |
Accepted
|
Accepted
| 40.08 |
from collections import deque
while(True):
W, H = list(map(int, input().split()))
if not W: break
tx,ty = list(map(int, input().split()))
kx,ky = list(map(int, input().split()))
ma = [[False]*(W+2) for _ in range(H+2)]
for i in range(1,H+1):
for j,a in enumerate(input().split()):
ma[i][j+1] = bool(1-int(a))
from pprint import pprint
que = deque([[tx,ty,kx,ky,0]])
pas = set()
ans = "NA"
while(que):
tx,ty,kx,ky,c = que.popleft()
if c > 100: break
if tx == kx and ty == ky:
ans = c
break
for dx,dy in [[-1,0],[0,-1],[1,0],[0,1]]:
tdx, tdy = [ dx, dy] if ma[ty+dy][tx+dx] else [0,0]
kdx, kdy = [-dx,-dy] if ma[ky-dy][kx-dx] else [0,0]
if (tx+tdx,ty+tdy,kx+kdx,ky+kdy) in pas: continue
que.append([tx+tdx,ty+tdy,kx+kdx,ky+kdy,c+1])
pas.add((tx+tdx,ty+tdy,kx+kdx,ky+kdy))
print(ans)
|
# from line_profiler import LineProfiler
from collections import deque
def main():
while(True):
W, H = list(map(int, input().split()))
if not W: break
tx,ty = list(map(int, input().split()))
kx,ky = list(map(int, input().split()))
ma = [[False]*(W+2) for _ in range(H+2)]
for i in range(1,H+1):
for j,a in enumerate(input().split()):
ma[i][j+1] = bool(1-int(a))
from pprint import pprint
que = deque([[tx,ty,kx,ky,0]])
pas = set()
ans = "NA"
while(que):
tx,ty,kx,ky,c = que.popleft()
if c > 100: break
if tx == kx and ty == ky:
ans = c
break
for dx,dy in [[-1,0],[0,-1],[1,0],[0,1]]:
tdx, tdy = [ dx, dy] if ma[ty+dy][tx+dx] else [0,0]
kdx, kdy = [-dx,-dy] if ma[ky-dy][kx-dx] else [0,0]
if (tx+tdx,ty+tdy,kx+kdx,ky+kdy) in pas: continue
que.append([tx+tdx,ty+tdy,kx+kdx,ky+kdy,c+1])
pas.add((tx+tdx,ty+tdy,kx+kdx,ky+kdy))
print(ans)
if __name__ == "__main__":
# prf = LineProfiler()
# prf.add_function(main)
# prf.runcall(main)
# prf.print_stats()
main()
| 29 | 37 | 977 | 1,284 |
from collections import deque
while True:
W, H = list(map(int, input().split()))
if not W:
break
tx, ty = list(map(int, input().split()))
kx, ky = list(map(int, input().split()))
ma = [[False] * (W + 2) for _ in range(H + 2)]
for i in range(1, H + 1):
for j, a in enumerate(input().split()):
ma[i][j + 1] = bool(1 - int(a))
from pprint import pprint
que = deque([[tx, ty, kx, ky, 0]])
pas = set()
ans = "NA"
while que:
tx, ty, kx, ky, c = que.popleft()
if c > 100:
break
if tx == kx and ty == ky:
ans = c
break
for dx, dy in [[-1, 0], [0, -1], [1, 0], [0, 1]]:
tdx, tdy = [dx, dy] if ma[ty + dy][tx + dx] else [0, 0]
kdx, kdy = [-dx, -dy] if ma[ky - dy][kx - dx] else [0, 0]
if (tx + tdx, ty + tdy, kx + kdx, ky + kdy) in pas:
continue
que.append([tx + tdx, ty + tdy, kx + kdx, ky + kdy, c + 1])
pas.add((tx + tdx, ty + tdy, kx + kdx, ky + kdy))
print(ans)
|
# from line_profiler import LineProfiler
from collections import deque
def main():
while True:
W, H = list(map(int, input().split()))
if not W:
break
tx, ty = list(map(int, input().split()))
kx, ky = list(map(int, input().split()))
ma = [[False] * (W + 2) for _ in range(H + 2)]
for i in range(1, H + 1):
for j, a in enumerate(input().split()):
ma[i][j + 1] = bool(1 - int(a))
from pprint import pprint
que = deque([[tx, ty, kx, ky, 0]])
pas = set()
ans = "NA"
while que:
tx, ty, kx, ky, c = que.popleft()
if c > 100:
break
if tx == kx and ty == ky:
ans = c
break
for dx, dy in [[-1, 0], [0, -1], [1, 0], [0, 1]]:
tdx, tdy = [dx, dy] if ma[ty + dy][tx + dx] else [0, 0]
kdx, kdy = [-dx, -dy] if ma[ky - dy][kx - dx] else [0, 0]
if (tx + tdx, ty + tdy, kx + kdx, ky + kdy) in pas:
continue
que.append([tx + tdx, ty + tdy, kx + kdx, ky + kdy, c + 1])
pas.add((tx + tdx, ty + tdy, kx + kdx, ky + kdy))
print(ans)
if __name__ == "__main__":
# prf = LineProfiler()
# prf.add_function(main)
# prf.runcall(main)
# prf.print_stats()
main()
| false | 21.621622 |
[
"+# from line_profiler import LineProfiler",
"-while True:",
"- W, H = list(map(int, input().split()))",
"- if not W:",
"- break",
"- tx, ty = list(map(int, input().split()))",
"- kx, ky = list(map(int, input().split()))",
"- ma = [[False] * (W + 2) for _ in range(H + 2)]",
"- for i in range(1, H + 1):",
"- for j, a in enumerate(input().split()):",
"- ma[i][j + 1] = bool(1 - int(a))",
"- from pprint import pprint",
"- que = deque([[tx, ty, kx, ky, 0]])",
"- pas = set()",
"- ans = \"NA\"",
"- while que:",
"- tx, ty, kx, ky, c = que.popleft()",
"- if c > 100:",
"+def main():",
"+ while True:",
"+ W, H = list(map(int, input().split()))",
"+ if not W:",
"- if tx == kx and ty == ky:",
"- ans = c",
"- break",
"- for dx, dy in [[-1, 0], [0, -1], [1, 0], [0, 1]]:",
"- tdx, tdy = [dx, dy] if ma[ty + dy][tx + dx] else [0, 0]",
"- kdx, kdy = [-dx, -dy] if ma[ky - dy][kx - dx] else [0, 0]",
"- if (tx + tdx, ty + tdy, kx + kdx, ky + kdy) in pas:",
"- continue",
"- que.append([tx + tdx, ty + tdy, kx + kdx, ky + kdy, c + 1])",
"- pas.add((tx + tdx, ty + tdy, kx + kdx, ky + kdy))",
"- print(ans)",
"+ tx, ty = list(map(int, input().split()))",
"+ kx, ky = list(map(int, input().split()))",
"+ ma = [[False] * (W + 2) for _ in range(H + 2)]",
"+ for i in range(1, H + 1):",
"+ for j, a in enumerate(input().split()):",
"+ ma[i][j + 1] = bool(1 - int(a))",
"+ from pprint import pprint",
"+",
"+ que = deque([[tx, ty, kx, ky, 0]])",
"+ pas = set()",
"+ ans = \"NA\"",
"+ while que:",
"+ tx, ty, kx, ky, c = que.popleft()",
"+ if c > 100:",
"+ break",
"+ if tx == kx and ty == ky:",
"+ ans = c",
"+ break",
"+ for dx, dy in [[-1, 0], [0, -1], [1, 0], [0, 1]]:",
"+ tdx, tdy = [dx, dy] if ma[ty + dy][tx + dx] else [0, 0]",
"+ kdx, kdy = [-dx, -dy] if ma[ky - dy][kx - dx] else [0, 0]",
"+ if (tx + tdx, ty + tdy, kx + kdx, ky + kdy) in pas:",
"+ continue",
"+ que.append([tx + tdx, ty + tdy, kx + kdx, ky + kdy, c + 1])",
"+ pas.add((tx + tdx, ty + tdy, kx + kdx, ky + kdy))",
"+ print(ans)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ # prf = LineProfiler()",
"+ # prf.add_function(main)",
"+ # prf.runcall(main)",
"+ # prf.print_stats()",
"+ main()"
] | false | 0.047606 | 0.038199 | 1.246269 |
[
"s359474187",
"s334322803"
] |
u973295667
|
p03160
|
python
|
s390587359
|
s248172194
| 117 | 105 | 20,376 | 90,108 |
Accepted
|
Accepted
| 10.26 |
size = int(eval(input()))
arr = list(map(int, input().split()))
dp = [0]*(size)
dp[0] = 0
dp[1] = abs(arr[1] - arr[0])
for i in range(2,size):
dp[i] = min(dp[i-1] + abs(arr[i-1]-arr[i]), dp[i-2] + abs(arr[i-2]- arr[i]))
print((dp[size-1]))
|
n = int(eval(input()))
arr = list(map(int, input().split()))
dp = [0 for i in range(n)]
sum = 0
dp[1] = abs(arr[1]-arr[0])
for i in range(2, len(arr)):
dp[i] = min(dp[i-1]+abs(arr[i]-arr[i-1]), dp[i-2]+abs(arr[i]-arr[i-2]))
print((dp[-1]))
| 9 | 8 | 245 | 243 |
size = int(eval(input()))
arr = list(map(int, input().split()))
dp = [0] * (size)
dp[0] = 0
dp[1] = abs(arr[1] - arr[0])
for i in range(2, size):
dp[i] = min(
dp[i - 1] + abs(arr[i - 1] - arr[i]), dp[i - 2] + abs(arr[i - 2] - arr[i])
)
print((dp[size - 1]))
|
n = int(eval(input()))
arr = list(map(int, input().split()))
dp = [0 for i in range(n)]
sum = 0
dp[1] = abs(arr[1] - arr[0])
for i in range(2, len(arr)):
dp[i] = min(
dp[i - 1] + abs(arr[i] - arr[i - 1]), dp[i - 2] + abs(arr[i] - arr[i - 2])
)
print((dp[-1]))
| false | 11.111111 |
[
"-size = int(eval(input()))",
"+n = int(eval(input()))",
"-dp = [0] * (size)",
"-dp[0] = 0",
"+dp = [0 for i in range(n)]",
"+sum = 0",
"-for i in range(2, size):",
"+for i in range(2, len(arr)):",
"- dp[i - 1] + abs(arr[i - 1] - arr[i]), dp[i - 2] + abs(arr[i - 2] - arr[i])",
"+ dp[i - 1] + abs(arr[i] - arr[i - 1]), dp[i - 2] + abs(arr[i] - arr[i - 2])",
"-print((dp[size - 1]))",
"+print((dp[-1]))"
] | false | 0.038551 | 0.040243 | 0.957953 |
[
"s390587359",
"s248172194"
] |
u072053884
|
p02264
|
python
|
s932853568
|
s633770118
| 760 | 240 | 18,792 | 16,052 |
Accepted
|
Accepted
| 68.42 |
class Process_Queue:
class Process:
def __init__(self, name, r_time, link = None):
self.name = name
self.r_time = r_time
self.link = link
def __init__(self, q):
self.e_time = 0
self.q = q
self.front = None
self.rear = None
def enqueue(self, name, r_time):
if self.front == self.rear == None:
self.front = self.rear = Process_Queue.Process(name, r_time)
else:
new_process = Process_Queue.Process(name, r_time)
self.rear.link = new_process
self.rear = new_process
def dequeue(self):
if self.front == self.rear == None:
raise Exception("queue underflow")
elif self.front.r_time > self.q:
self.enqueue(self.front.name, self.front.r_time - self.q)
self.front = self.front.link
self.e_time += self.q
else:
p_name = self.front.name
self.e_time += self.front.r_time
print((p_name, self.e_time))
self.front = self.front.link
if self.front == None:
self.rear = None
n, q = list(map(int, input().split()))
p_queue = Process_Queue(q)
for i in range(n):
p = input().split()
p_queue.enqueue(p[0], int(p[1]))
while not p_queue.front == p_queue.rear == None:
p_queue.dequeue()
|
import collections
import sys
p_q = collections.deque(maxlen = 100000)
e_time = 0
n, q = list(map(int, sys.stdin.readline().split()))
for i in range(n):
p_name, r_time = sys.stdin.readline().split()
p_q.append([p_name, int(r_time)])
while p_q:
t_p = p_q.popleft()
if t_p[1] > q:
t_p[1] -= q
e_time += q
p_q.append(t_p)
else:
e_time += t_p[1]
print((t_p[0], e_time))
| 46 | 22 | 1,413 | 443 |
class Process_Queue:
class Process:
def __init__(self, name, r_time, link=None):
self.name = name
self.r_time = r_time
self.link = link
def __init__(self, q):
self.e_time = 0
self.q = q
self.front = None
self.rear = None
def enqueue(self, name, r_time):
if self.front == self.rear == None:
self.front = self.rear = Process_Queue.Process(name, r_time)
else:
new_process = Process_Queue.Process(name, r_time)
self.rear.link = new_process
self.rear = new_process
def dequeue(self):
if self.front == self.rear == None:
raise Exception("queue underflow")
elif self.front.r_time > self.q:
self.enqueue(self.front.name, self.front.r_time - self.q)
self.front = self.front.link
self.e_time += self.q
else:
p_name = self.front.name
self.e_time += self.front.r_time
print((p_name, self.e_time))
self.front = self.front.link
if self.front == None:
self.rear = None
n, q = list(map(int, input().split()))
p_queue = Process_Queue(q)
for i in range(n):
p = input().split()
p_queue.enqueue(p[0], int(p[1]))
while not p_queue.front == p_queue.rear == None:
p_queue.dequeue()
|
import collections
import sys
p_q = collections.deque(maxlen=100000)
e_time = 0
n, q = list(map(int, sys.stdin.readline().split()))
for i in range(n):
p_name, r_time = sys.stdin.readline().split()
p_q.append([p_name, int(r_time)])
while p_q:
t_p = p_q.popleft()
if t_p[1] > q:
t_p[1] -= q
e_time += q
p_q.append(t_p)
else:
e_time += t_p[1]
print((t_p[0], e_time))
| false | 52.173913 |
[
"-class Process_Queue:",
"- class Process:",
"- def __init__(self, name, r_time, link=None):",
"- self.name = name",
"- self.r_time = r_time",
"- self.link = link",
"+import collections",
"+import sys",
"- def __init__(self, q):",
"- self.e_time = 0",
"- self.q = q",
"- self.front = None",
"- self.rear = None",
"-",
"- def enqueue(self, name, r_time):",
"- if self.front == self.rear == None:",
"- self.front = self.rear = Process_Queue.Process(name, r_time)",
"- else:",
"- new_process = Process_Queue.Process(name, r_time)",
"- self.rear.link = new_process",
"- self.rear = new_process",
"-",
"- def dequeue(self):",
"- if self.front == self.rear == None:",
"- raise Exception(\"queue underflow\")",
"- elif self.front.r_time > self.q:",
"- self.enqueue(self.front.name, self.front.r_time - self.q)",
"- self.front = self.front.link",
"- self.e_time += self.q",
"- else:",
"- p_name = self.front.name",
"- self.e_time += self.front.r_time",
"- print((p_name, self.e_time))",
"- self.front = self.front.link",
"- if self.front == None:",
"- self.rear = None",
"-",
"-",
"-n, q = list(map(int, input().split()))",
"-p_queue = Process_Queue(q)",
"+p_q = collections.deque(maxlen=100000)",
"+e_time = 0",
"+n, q = list(map(int, sys.stdin.readline().split()))",
"- p = input().split()",
"- p_queue.enqueue(p[0], int(p[1]))",
"-while not p_queue.front == p_queue.rear == None:",
"- p_queue.dequeue()",
"+ p_name, r_time = sys.stdin.readline().split()",
"+ p_q.append([p_name, int(r_time)])",
"+while p_q:",
"+ t_p = p_q.popleft()",
"+ if t_p[1] > q:",
"+ t_p[1] -= q",
"+ e_time += q",
"+ p_q.append(t_p)",
"+ else:",
"+ e_time += t_p[1]",
"+ print((t_p[0], e_time))"
] | false | 0.089424 | 0.046281 | 1.93221 |
[
"s932853568",
"s633770118"
] |
u941047297
|
p03160
|
python
|
s149826573
|
s345942540
| 142 | 129 | 13,980 | 13,928 |
Accepted
|
Accepted
| 9.15 |
n = int(eval(input()))
h = list(map(int, input().split()))
dp = [0] * n
dp[0] = 0
for i in range(1, n):
if i == 1:
dp[i] = dp[0] + abs(h[i] - h[i - 1])
else:
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[n - 1]))
|
n = int(eval(input()))
H = list(map(int, input().split()))
dp = [0] * n
dp[1] = abs(H[1] - H[0])
for i in range(2, n):
dp[i] = min(dp[i - 2] + abs(H[i - 2] - H[i]), dp[i - 1] + abs(H[i - 1] - H[i]))
print((dp[n - 1]))
| 10 | 7 | 281 | 219 |
n = int(eval(input()))
h = list(map(int, input().split()))
dp = [0] * n
dp[0] = 0
for i in range(1, n):
if i == 1:
dp[i] = dp[0] + abs(h[i] - h[i - 1])
else:
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[n - 1]))
|
n = int(eval(input()))
H = list(map(int, input().split()))
dp = [0] * n
dp[1] = abs(H[1] - H[0])
for i in range(2, n):
dp[i] = min(dp[i - 2] + abs(H[i - 2] - H[i]), dp[i - 1] + abs(H[i - 1] - H[i]))
print((dp[n - 1]))
| false | 30 |
[
"-h = list(map(int, input().split()))",
"+H = list(map(int, input().split()))",
"-dp[0] = 0",
"-for i in range(1, n):",
"- if i == 1:",
"- dp[i] = dp[0] + abs(h[i] - h[i - 1])",
"- else:",
"- dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]))",
"+dp[1] = abs(H[1] - H[0])",
"+for i in range(2, n):",
"+ dp[i] = min(dp[i - 2] + abs(H[i - 2] - H[i]), dp[i - 1] + abs(H[i - 1] - H[i]))"
] | false | 0.037303 | 0.034792 | 1.072183 |
[
"s149826573",
"s345942540"
] |
u130900604
|
p02707
|
python
|
s314296581
|
s839146271
| 145 | 126 | 31,648 | 31,680 |
Accepted
|
Accepted
| 13.1 |
n,*a=list(map(int,open(0).read().split()));c=[0]*n
for q in a:c[q-1]+=1
for d in c:print(d)
|
n,*a=list(map(int,open(0).read().split()));c=[0]*n
for q in a:c[q-1]+=1
print((*c))
| 3 | 3 | 87 | 77 |
n, *a = list(map(int, open(0).read().split()))
c = [0] * n
for q in a:
c[q - 1] += 1
for d in c:
print(d)
|
n, *a = list(map(int, open(0).read().split()))
c = [0] * n
for q in a:
c[q - 1] += 1
print((*c))
| false | 0 |
[
"-for d in c:",
"- print(d)",
"+print((*c))"
] | false | 0.109988 | 0.033295 | 3.30345 |
[
"s314296581",
"s839146271"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.