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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
u606045429
|
p03241
|
python
|
s518523798
|
s434182177
| 24
| 20
| 3,060
| 3,060
|
Accepted
|
Accepted
| 16.67
|
def divisors(N):
i = 1
U = int(N ** 0.5)
res = []
for i in range(1, U):
if N % i == 0:
res += [i, N // i]
if N % i == 0:
res.append(i)
res.sort()
return res
N, M = list(map(int, input().split()))
print((max(d for d in divisors(M) if d * N <= M)))
|
def divisors(N):
U = int(N ** 0.5)
res = []
for i in range(1, U):
if N % i == 0:
res += [i, N // i]
if N % U == 0:
res.append(U)
res.sort()
return res
N, M = list(map(int, input().split()))
print((max(d for d in divisors(M) if d * N <= M)))
| 14
| 13
| 309
| 298
|
def divisors(N):
i = 1
U = int(N**0.5)
res = []
for i in range(1, U):
if N % i == 0:
res += [i, N // i]
if N % i == 0:
res.append(i)
res.sort()
return res
N, M = list(map(int, input().split()))
print((max(d for d in divisors(M) if d * N <= M)))
|
def divisors(N):
U = int(N**0.5)
res = []
for i in range(1, U):
if N % i == 0:
res += [i, N // i]
if N % U == 0:
res.append(U)
res.sort()
return res
N, M = list(map(int, input().split()))
print((max(d for d in divisors(M) if d * N <= M)))
| false
| 7.142857
|
[
"- i = 1",
"- if N % i == 0:",
"- res.append(i)",
"+ if N % U == 0:",
"+ res.append(U)"
] | false
| 0.039915
| 0.039834
| 1.002035
|
[
"s518523798",
"s434182177"
] |
u585482323
|
p02715
|
python
|
s465994827
|
s290851582
| 109
| 98
| 75,640
| 75,300
|
Accepted
|
Accepted
| 10.09
|
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
n,k = LI()
f = [-1]*(k+1)
p = 2
while p <= k:
x = 2*p
while x <= k:
f[x] -= f[p]
x += p
p += 1
ans = 0
p = [1]
for i in range(1,k+1):
p.append(pow(k//i,n,mod))
for i in range(1,k+1):
res = p[i]
x = 2*i
j = 2
while x <= k:
res += p[x]*f[j]
x += i
j += 1
ans += i*res
ans %= mod
print((ans%mod))
|
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
n,k = LI()
if k == 2:
print(((pow(2,n,mod)+1)%mod))
elif k == 3:
print(((pow(3,n,mod)+3)%mod))
elif k == 4:
print(((pow(4,n,mod)+pow(2,n,mod)+4)%mod))
elif k == 5:
print(((pow(5,n,mod)+pow(2,n,mod)+8)%mod))
else:
f = [-1]*(k+1)
p = 2
while p <= k:
x = 2*p
while x <= k:
f[x] -= f[p]
x += p
p += 1
ans = 0
p = [1]
for i in range(1,k+1):
p.append(pow(k//i,n,mod))
for i in range(1,k+1):
res = p[i]
x = 2*i
j = 2
while x <= k:
res += p[x]*f[j]
x += i
j += 1
ans += i*res
ans %= mod
print(ans)
return
#Solve
if __name__ == "__main__":
solve()
| 51
| 66
| 1,138
| 1,654
|
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI():
return [int(x) for x in sys.stdin.buffer.readline().split()]
def I():
return int(sys.stdin.buffer.readline())
def LS():
return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
n, k = LI()
f = [-1] * (k + 1)
p = 2
while p <= k:
x = 2 * p
while x <= k:
f[x] -= f[p]
x += p
p += 1
ans = 0
p = [1]
for i in range(1, k + 1):
p.append(pow(k // i, n, mod))
for i in range(1, k + 1):
res = p[i]
x = 2 * i
j = 2
while x <= k:
res += p[x] * f[j]
x += i
j += 1
ans += i * res
ans %= mod
print((ans % mod))
|
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI():
return [int(x) for x in sys.stdin.buffer.readline().split()]
def I():
return int(sys.stdin.buffer.readline())
def LS():
return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
n, k = LI()
if k == 2:
print(((pow(2, n, mod) + 1) % mod))
elif k == 3:
print(((pow(3, n, mod) + 3) % mod))
elif k == 4:
print(((pow(4, n, mod) + pow(2, n, mod) + 4) % mod))
elif k == 5:
print(((pow(5, n, mod) + pow(2, n, mod) + 8) % mod))
else:
f = [-1] * (k + 1)
p = 2
while p <= k:
x = 2 * p
while x <= k:
f[x] -= f[p]
x += p
p += 1
ans = 0
p = [1]
for i in range(1, k + 1):
p.append(pow(k // i, n, mod))
for i in range(1, k + 1):
res = p[i]
x = 2 * i
j = 2
while x <= k:
res += p[x] * f[j]
x += i
j += 1
ans += i * res
ans %= mod
print(ans)
return
# Solve
if __name__ == "__main__":
solve()
| false
| 22.727273
|
[
"-n, k = LI()",
"-f = [-1] * (k + 1)",
"-p = 2",
"-while p <= k:",
"- x = 2 * p",
"- while x <= k:",
"- f[x] -= f[p]",
"- x += p",
"- p += 1",
"-ans = 0",
"-p = [1]",
"-for i in range(1, k + 1):",
"- p.append(pow(k // i, n, mod))",
"-for i in range(1, k + 1):",
"- res = p[i]",
"- x = 2 * i",
"- j = 2",
"- while x <= k:",
"- res += p[x] * f[j]",
"- x += i",
"- j += 1",
"- ans += i * res",
"- ans %= mod",
"-print((ans % mod))",
"+",
"+",
"+def solve():",
"+ n, k = LI()",
"+ if k == 2:",
"+ print(((pow(2, n, mod) + 1) % mod))",
"+ elif k == 3:",
"+ print(((pow(3, n, mod) + 3) % mod))",
"+ elif k == 4:",
"+ print(((pow(4, n, mod) + pow(2, n, mod) + 4) % mod))",
"+ elif k == 5:",
"+ print(((pow(5, n, mod) + pow(2, n, mod) + 8) % mod))",
"+ else:",
"+ f = [-1] * (k + 1)",
"+ p = 2",
"+ while p <= k:",
"+ x = 2 * p",
"+ while x <= k:",
"+ f[x] -= f[p]",
"+ x += p",
"+ p += 1",
"+ ans = 0",
"+ p = [1]",
"+ for i in range(1, k + 1):",
"+ p.append(pow(k // i, n, mod))",
"+ for i in range(1, k + 1):",
"+ res = p[i]",
"+ x = 2 * i",
"+ j = 2",
"+ while x <= k:",
"+ res += p[x] * f[j]",
"+ x += i",
"+ j += 1",
"+ ans += i * res",
"+ ans %= mod",
"+ print(ans)",
"+ return",
"+",
"+",
"+# Solve",
"+if __name__ == \"__main__\":",
"+ solve()"
] | false
| 0.565972
| 0.211471
| 2.676363
|
[
"s465994827",
"s290851582"
] |
u281303342
|
p03965
|
python
|
s296964218
|
s396695619
| 45
| 28
| 3,316
| 3,188
|
Accepted
|
Accepted
| 37.78
|
cp,score = 0,0
for s in eval(input()):
if s == "g":
if cp > 0:
score += 1
cp -= 1
else:
cp += 1
elif s == "p":
if cp > 0:
cp -= 1
else:
score -= 1
cp += 1
print(score)
|
S = eval(input())
cntP = 0
for s in S:
if s=="p":
cntP += 1
print((len(S)//2 - cntP))
| 15
| 8
| 287
| 99
|
cp, score = 0, 0
for s in eval(input()):
if s == "g":
if cp > 0:
score += 1
cp -= 1
else:
cp += 1
elif s == "p":
if cp > 0:
cp -= 1
else:
score -= 1
cp += 1
print(score)
|
S = eval(input())
cntP = 0
for s in S:
if s == "p":
cntP += 1
print((len(S) // 2 - cntP))
| false
| 46.666667
|
[
"-cp, score = 0, 0",
"-for s in eval(input()):",
"- if s == \"g\":",
"- if cp > 0:",
"- score += 1",
"- cp -= 1",
"- else:",
"- cp += 1",
"- elif s == \"p\":",
"- if cp > 0:",
"- cp -= 1",
"- else:",
"- score -= 1",
"- cp += 1",
"-print(score)",
"+S = eval(input())",
"+cntP = 0",
"+for s in S:",
"+ if s == \"p\":",
"+ cntP += 1",
"+print((len(S) // 2 - cntP))"
] | false
| 0.044189
| 0.044857
| 0.985105
|
[
"s296964218",
"s396695619"
] |
u163320134
|
p02839
|
python
|
s776160144
|
s653481988
| 975
| 856
| 236,936
| 229,768
|
Accepted
|
Accepted
| 12.21
|
h,w=list(map(int,input().split()))
arr=[list(map(int,input().split())) for _ in range(2*h)]
board=[[0]*w for _ in range(h)]
for i in range(h):
for j in range(w):
board[i][j]+=arr[i][j]
for i in range(h):
for j in range(w):
board[i][j]=abs(board[i][j]-arr[h+i][j])
dp=[[set() for _ in range(w)] for _ in range(h)]
dp[0][0].add(board[0][0])
for i in range(h):
for j in range(w):
if i!=0:
for k in dp[i-1][j]:
dp[i][j].add((k+board[i][j])%800)
dp[i][j].add(abs(k-board[i][j])%800)
if j!=0:
for k in dp[i][j-1]:
dp[i][j].add((k+board[i][j])%800)
dp[i][j].add(abs(k-board[i][j])%800)
print((min(dp[h-1][w-1])))
|
h,w=list(map(int,input().split()))
arr=[list(map(int,input().split())) for _ in range(2*h)]
board=[[0]*w for _ in range(h)]
for i in range(h):
for j in range(w):
board[i][j]+=arr[i][j]
for i in range(h):
for j in range(w):
board[i][j]=abs(board[i][j]-arr[h+i][j])
dp=[[set() for _ in range(w)] for _ in range(h)]
dp[0][0].add(board[0][0])
for i in range(h):
for j in range(w):
if i!=0:
for k in dp[i-1][j]:
dp[i][j].add((k+board[i][j])%640)
dp[i][j].add(abs(k-board[i][j])%640)
if j!=0:
for k in dp[i][j-1]:
dp[i][j].add((k+board[i][j])%640)
dp[i][j].add(abs(k-board[i][j])%640)
print((min(dp[h-1][w-1])))
| 22
| 22
| 684
| 684
|
h, w = list(map(int, input().split()))
arr = [list(map(int, input().split())) for _ in range(2 * h)]
board = [[0] * w for _ in range(h)]
for i in range(h):
for j in range(w):
board[i][j] += arr[i][j]
for i in range(h):
for j in range(w):
board[i][j] = abs(board[i][j] - arr[h + i][j])
dp = [[set() for _ in range(w)] for _ in range(h)]
dp[0][0].add(board[0][0])
for i in range(h):
for j in range(w):
if i != 0:
for k in dp[i - 1][j]:
dp[i][j].add((k + board[i][j]) % 800)
dp[i][j].add(abs(k - board[i][j]) % 800)
if j != 0:
for k in dp[i][j - 1]:
dp[i][j].add((k + board[i][j]) % 800)
dp[i][j].add(abs(k - board[i][j]) % 800)
print((min(dp[h - 1][w - 1])))
|
h, w = list(map(int, input().split()))
arr = [list(map(int, input().split())) for _ in range(2 * h)]
board = [[0] * w for _ in range(h)]
for i in range(h):
for j in range(w):
board[i][j] += arr[i][j]
for i in range(h):
for j in range(w):
board[i][j] = abs(board[i][j] - arr[h + i][j])
dp = [[set() for _ in range(w)] for _ in range(h)]
dp[0][0].add(board[0][0])
for i in range(h):
for j in range(w):
if i != 0:
for k in dp[i - 1][j]:
dp[i][j].add((k + board[i][j]) % 640)
dp[i][j].add(abs(k - board[i][j]) % 640)
if j != 0:
for k in dp[i][j - 1]:
dp[i][j].add((k + board[i][j]) % 640)
dp[i][j].add(abs(k - board[i][j]) % 640)
print((min(dp[h - 1][w - 1])))
| false
| 0
|
[
"- dp[i][j].add((k + board[i][j]) % 800)",
"- dp[i][j].add(abs(k - board[i][j]) % 800)",
"+ dp[i][j].add((k + board[i][j]) % 640)",
"+ dp[i][j].add(abs(k - board[i][j]) % 640)",
"- dp[i][j].add((k + board[i][j]) % 800)",
"- dp[i][j].add(abs(k - board[i][j]) % 800)",
"+ dp[i][j].add((k + board[i][j]) % 640)",
"+ dp[i][j].add(abs(k - board[i][j]) % 640)"
] | false
| 0.047898
| 0.04668
| 1.026097
|
[
"s776160144",
"s653481988"
] |
u644907318
|
p03565
|
python
|
s983136819
|
s122667416
| 167
| 74
| 38,768
| 63,216
|
Accepted
|
Accepted
| 55.69
|
S1 = list(input().strip())
T = list(input().strip())
n = len(S1)
k = len(T)
G = []
for i in range(n-k+1):
flag = 0
for j in range(i,i+k):
if S1[j]!="?" and S1[j]!=T[j-i]:
flag = 1
break
if flag==0:
A = S1[:]
A[i:i+k] = T[:]
for j in range(n):
if A[j]=="?":
A[j] = "a"
G.append(A)
G = sorted(G)
if len(G)>0:
print(("".join(G[0])))
else:
print("UNRESTORABLE")
|
S = input().strip()
N=len(S)
T = input().strip()
M=len(T)
A = []
for i in range(N-M+1):
flag = 0
for j in range(i,i+M):
if S[j]=="?" or S[j]==T[j-i]:continue
else:
flag=1
break
if flag==0:
X = list(S)
for j in range(i,i+M):
X[j] = T[j-i]
for i in range(N):
if X[i]=="?":
X[i]="a"
A.append(X)
if len(A)==0:
print("UNRESTORABLE")
else:
A = sorted(A)
print(("".join(A[0])))
| 23
| 25
| 489
| 528
|
S1 = list(input().strip())
T = list(input().strip())
n = len(S1)
k = len(T)
G = []
for i in range(n - k + 1):
flag = 0
for j in range(i, i + k):
if S1[j] != "?" and S1[j] != T[j - i]:
flag = 1
break
if flag == 0:
A = S1[:]
A[i : i + k] = T[:]
for j in range(n):
if A[j] == "?":
A[j] = "a"
G.append(A)
G = sorted(G)
if len(G) > 0:
print(("".join(G[0])))
else:
print("UNRESTORABLE")
|
S = input().strip()
N = len(S)
T = input().strip()
M = len(T)
A = []
for i in range(N - M + 1):
flag = 0
for j in range(i, i + M):
if S[j] == "?" or S[j] == T[j - i]:
continue
else:
flag = 1
break
if flag == 0:
X = list(S)
for j in range(i, i + M):
X[j] = T[j - i]
for i in range(N):
if X[i] == "?":
X[i] = "a"
A.append(X)
if len(A) == 0:
print("UNRESTORABLE")
else:
A = sorted(A)
print(("".join(A[0])))
| false
| 8
|
[
"-S1 = list(input().strip())",
"-T = list(input().strip())",
"-n = len(S1)",
"-k = len(T)",
"-G = []",
"-for i in range(n - k + 1):",
"+S = input().strip()",
"+N = len(S)",
"+T = input().strip()",
"+M = len(T)",
"+A = []",
"+for i in range(N - M + 1):",
"- for j in range(i, i + k):",
"- if S1[j] != \"?\" and S1[j] != T[j - i]:",
"+ for j in range(i, i + M):",
"+ if S[j] == \"?\" or S[j] == T[j - i]:",
"+ continue",
"+ else:",
"- A = S1[:]",
"- A[i : i + k] = T[:]",
"- for j in range(n):",
"- if A[j] == \"?\":",
"- A[j] = \"a\"",
"- G.append(A)",
"-G = sorted(G)",
"-if len(G) > 0:",
"- print((\"\".join(G[0])))",
"+ X = list(S)",
"+ for j in range(i, i + M):",
"+ X[j] = T[j - i]",
"+ for i in range(N):",
"+ if X[i] == \"?\":",
"+ X[i] = \"a\"",
"+ A.append(X)",
"+if len(A) == 0:",
"+ print(\"UNRESTORABLE\")",
"- print(\"UNRESTORABLE\")",
"+ A = sorted(A)",
"+ print((\"\".join(A[0])))"
] | false
| 0.047854
| 0.044971
| 1.064105
|
[
"s983136819",
"s122667416"
] |
u426534722
|
p02270
|
python
|
s704235668
|
s556262516
| 1,130
| 910
| 9,596
| 9,560
|
Accepted
|
Accepted
| 19.47
|
import sys
readline = sys.stdin.readline
n, k = list(map(int, input().split()))
v = tuple(int(readline()) for _ in range(n))
lo = max(v) - 1
hi = int(1e10)
while hi - lo > 1:
p = P = (lo + hi) // 2
m = 1
for i in range(n):
if v[i] > p:
p = P
m += 1
p -= v[i]
if m <= k:
hi = P
else:
lo = P
print(hi)
|
import sys
readline = sys.stdin.readline
n, k = list(map(int, readline().split()))
v = [int(readline()) for _ in range(n)]
lo = max(v) - 1
hi = sum(v)
while hi - lo > 1:
p = P = (lo + hi) // 2
m = 1
for i in range(n):
if v[i] > p:
p = P
m += 1
p -= v[i]
if m <= k:
hi = P
else:
lo = P
print(hi)
| 20
| 20
| 390
| 385
|
import sys
readline = sys.stdin.readline
n, k = list(map(int, input().split()))
v = tuple(int(readline()) for _ in range(n))
lo = max(v) - 1
hi = int(1e10)
while hi - lo > 1:
p = P = (lo + hi) // 2
m = 1
for i in range(n):
if v[i] > p:
p = P
m += 1
p -= v[i]
if m <= k:
hi = P
else:
lo = P
print(hi)
|
import sys
readline = sys.stdin.readline
n, k = list(map(int, readline().split()))
v = [int(readline()) for _ in range(n)]
lo = max(v) - 1
hi = sum(v)
while hi - lo > 1:
p = P = (lo + hi) // 2
m = 1
for i in range(n):
if v[i] > p:
p = P
m += 1
p -= v[i]
if m <= k:
hi = P
else:
lo = P
print(hi)
| false
| 0
|
[
"-n, k = list(map(int, input().split()))",
"-v = tuple(int(readline()) for _ in range(n))",
"+n, k = list(map(int, readline().split()))",
"+v = [int(readline()) for _ in range(n)]",
"-hi = int(1e10)",
"+hi = sum(v)"
] | false
| 0.036784
| 0.03715
| 0.990146
|
[
"s704235668",
"s556262516"
] |
u225388820
|
p03425
|
python
|
s302072069
|
s224996179
| 151
| 124
| 3,064
| 68,080
|
Accepted
|
Accepted
| 17.88
|
import sys
input = sys.stdin.readline
n=int(eval(input()))
a=["M","A","R","C","H"]
cnt=[0]*5
for i in range(n):
s=eval(input())
for i in range(5):
if s[0]==a[i]:
cnt[i]+=1
ans=0
for i in range(3):
for j in range(i+1,4):
for k in range(j+1,5):
ans+=cnt[i]*cnt[j]*cnt[k]
print(ans)
|
import sys
input = sys.stdin.readline
n=int(eval(input()))
a="MARCH"
cnt=[0]*5
for i in range(n):
s=eval(input())
for i in range(5):
if s[0]==a[i]:
cnt[i]+=1
ans=0
for i in range(3):
for j in range(i+1,4):
for k in range(j+1,5):
ans+=cnt[i]*cnt[j]*cnt[k]
print(ans)
| 17
| 17
| 325
| 311
|
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = ["M", "A", "R", "C", "H"]
cnt = [0] * 5
for i in range(n):
s = eval(input())
for i in range(5):
if s[0] == a[i]:
cnt[i] += 1
ans = 0
for i in range(3):
for j in range(i + 1, 4):
for k in range(j + 1, 5):
ans += cnt[i] * cnt[j] * cnt[k]
print(ans)
|
import sys
input = sys.stdin.readline
n = int(eval(input()))
a = "MARCH"
cnt = [0] * 5
for i in range(n):
s = eval(input())
for i in range(5):
if s[0] == a[i]:
cnt[i] += 1
ans = 0
for i in range(3):
for j in range(i + 1, 4):
for k in range(j + 1, 5):
ans += cnt[i] * cnt[j] * cnt[k]
print(ans)
| false
| 0
|
[
"-a = [\"M\", \"A\", \"R\", \"C\", \"H\"]",
"+a = \"MARCH\""
] | false
| 0.0354
| 0.097937
| 0.361461
|
[
"s302072069",
"s224996179"
] |
u025501820
|
p02901
|
python
|
s654843016
|
s957420303
| 1,063
| 932
| 138,120
| 138,504
|
Accepted
|
Accepted
| 12.32
|
N, M = list(map(int, input().split()))
dp =[[float("inf") for _ in range(2 ** N)] for _ in range(M + 1)]
dp[0][0] = 0
for i in range(M):
A, B = list(map(int, input().split()))
C = list(map(int, input().split()))
tmp = [0 for _ in range(N)]
for c in C:
tmp[c - 1] = 1
x = int("".join(map(str, tmp)), 2)
for j in range(2 ** N):
dp[i + 1][x|j] = min(dp[i][x|j], dp[i][j] + A, dp[i + 1][x|j])
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
ans = dp[M][2 ** N - 1]
if ans != float("inf"):
print(ans)
else:
print((-1))
|
N, M = list(map(int, input().split()))
dp =[[float("inf") for _ in range(2 ** N)] for _ in range(M + 1)]
dp[0][0] = 0
for i in range(M):
A, B = list(map(int, input().split()))
C = list(map(int, input().split()))
x = sum([2 ** (c - 1) for c in C])
for j in range(2 ** N):
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
dp[i + 1][x|j] = min(dp[i][j] + A, dp[i + 1][x|j])
ans = dp[M][2 ** N - 1]
if ans != float("inf"):
print(ans)
else:
print((-1))
| 21
| 18
| 573
| 487
|
N, M = list(map(int, input().split()))
dp = [[float("inf") for _ in range(2**N)] for _ in range(M + 1)]
dp[0][0] = 0
for i in range(M):
A, B = list(map(int, input().split()))
C = list(map(int, input().split()))
tmp = [0 for _ in range(N)]
for c in C:
tmp[c - 1] = 1
x = int("".join(map(str, tmp)), 2)
for j in range(2**N):
dp[i + 1][x | j] = min(dp[i][x | j], dp[i][j] + A, dp[i + 1][x | j])
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
ans = dp[M][2**N - 1]
if ans != float("inf"):
print(ans)
else:
print((-1))
|
N, M = list(map(int, input().split()))
dp = [[float("inf") for _ in range(2**N)] for _ in range(M + 1)]
dp[0][0] = 0
for i in range(M):
A, B = list(map(int, input().split()))
C = list(map(int, input().split()))
x = sum([2 ** (c - 1) for c in C])
for j in range(2**N):
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
dp[i + 1][x | j] = min(dp[i][j] + A, dp[i + 1][x | j])
ans = dp[M][2**N - 1]
if ans != float("inf"):
print(ans)
else:
print((-1))
| false
| 14.285714
|
[
"- tmp = [0 for _ in range(N)]",
"- for c in C:",
"- tmp[c - 1] = 1",
"- x = int(\"\".join(map(str, tmp)), 2)",
"+ x = sum([2 ** (c - 1) for c in C])",
"- dp[i + 1][x | j] = min(dp[i][x | j], dp[i][j] + A, dp[i + 1][x | j])",
"+ dp[i + 1][x | j] = min(dp[i][j] + A, dp[i + 1][x | j])"
] | false
| 0.043521
| 0.039031
| 1.115018
|
[
"s654843016",
"s957420303"
] |
u729133443
|
p02573
|
python
|
s732256370
|
s964749320
| 66
| 44
| 9,900
| 9,860
|
Accepted
|
Accepted
| 33.33
|
import sys
if sys.argv[-1] == 'ONLINE_JUDGE':
import os, zlib, base64
open('solve.pyx', 'wb').write(zlib.decompress(base64.b85decode("c${5PL2iRE5WFMthv^{+v?dBYMx`G~IoQTdEE$80tEzo{*Wd=yz1W_eo!MP$KlHFh$m0~eaaTywkAn~BRX?eaXF3w(ceoAiIC9UeRrXFAJ$F}?NJ*tL!#zJq?ldEsaY5&q?34ywFR!N<Eyg@se2S5wsu`99o-vspHRyuKWw{o@D&8p{Vek@exEg!TGf)_f@xoiY;dF*q;nO?tB{k#CUu}GqOCr%Cvhi>XJp*SD42B^v$UK`TDGs}C*Bu!4#M$?xq6ZH{RcR9i70yjHb(#A5S4gsZk?i@}6i0<R!D5BQ2BrZyo*IZGydC<T4$*EBF#_rEM<_aqM<}|56`JK<nptm)igr=^x*4nBl9fZ%puYE4jTaZ2k!MJv&(Aztem}0@!_f*P&GQQng{I2")))
os.system('cythonize -i -3 -b solve.pyx')
import solve
|
import sys
if sys.argv[-1] == 'ONLINE_JUDGE':
import os, zlib, base64
open('solve.pyx', 'wb').write(zlib.decompress(base64.b85decode("c$`&I!ES>v480@q58h!atm#yy9VRsPBOM1P1R4zjN;6H{*Uu)DfG;HPJ=@O?ts4jEja1J!?~Lt0nPD28hd~cF?bD=Xf%^5=(LPV;u<v!hiYAA)(~D@S(wK4OJMGmKogksHzD*O==oaXBc{y{`Fr`W8luZIog@8c76Wq+79@~t>c^(s~w9Rs`V`us@O@LyhqyPmKoCExGHNA#n5phT&7e`qhVbc=x4zF(|NT=~DGF(lOmEsIX(ws;WNT>a`v!FJ<dX0^CY!`6vkLphstf|Ghyk}ydX1u!R@-5#rU}V$73K#^S;7N@DFW7-)le`q#WIVQ`14Bv66J?Y)d#Z|jv4v55U(V)=(H7F+#YVNjas$(d2oDv=a<|rbybt=wdP8t{s)KuoJIX!8-F$@Ra>r_}w?$<gs;x7Jk!>Cy;51zfTT$iwsPi>V!e5yk9-B{lpk>lD|KRh>h5")))
os.system('cythonize -i -3 -b solve.pyx')
import solve
| 6
| 6
| 604
| 662
|
import sys
if sys.argv[-1] == "ONLINE_JUDGE":
import os, zlib, base64
open("solve.pyx", "wb").write(
zlib.decompress(
base64.b85decode(
"c${5PL2iRE5WFMthv^{+v?dBYMx`G~IoQTdEE$80tEzo{*Wd=yz1W_eo!MP$KlHFh$m0~eaaTywkAn~BRX?eaXF3w(ceoAiIC9UeRrXFAJ$F}?NJ*tL!#zJq?ldEsaY5&q?34ywFR!N<Eyg@se2S5wsu`99o-vspHRyuKWw{o@D&8p{Vek@exEg!TGf)_f@xoiY;dF*q;nO?tB{k#CUu}GqOCr%Cvhi>XJp*SD42B^v$UK`TDGs}C*Bu!4#M$?xq6ZH{RcR9i70yjHb(#A5S4gsZk?i@}6i0<R!D5BQ2BrZyo*IZGydC<T4$*EBF#_rEM<_aqM<}|56`JK<nptm)igr=^x*4nBl9fZ%puYE4jTaZ2k!MJv&(Aztem}0@!_f*P&GQQng{I2"
)
)
)
os.system("cythonize -i -3 -b solve.pyx")
import solve
|
import sys
if sys.argv[-1] == "ONLINE_JUDGE":
import os, zlib, base64
open("solve.pyx", "wb").write(
zlib.decompress(
base64.b85decode(
"c$`&I!ES>v480@q58h!atm#yy9VRsPBOM1P1R4zjN;6H{*Uu)DfG;HPJ=@O?ts4jEja1J!?~Lt0nPD28hd~cF?bD=Xf%^5=(LPV;u<v!hiYAA)(~D@S(wK4OJMGmKogksHzD*O==oaXBc{y{`Fr`W8luZIog@8c76Wq+79@~t>c^(s~w9Rs`V`us@O@LyhqyPmKoCExGHNA#n5phT&7e`qhVbc=x4zF(|NT=~DGF(lOmEsIX(ws;WNT>a`v!FJ<dX0^CY!`6vkLphstf|Ghyk}ydX1u!R@-5#rU}V$73K#^S;7N@DFW7-)le`q#WIVQ`14Bv66J?Y)d#Z|jv4v55U(V)=(H7F+#YVNjas$(d2oDv=a<|rbybt=wdP8t{s)KuoJIX!8-F$@Ra>r_}w?$<gs;x7Jk!>Cy;51zfTT$iwsPi>V!e5yk9-B{lpk>lD|KRh>h5"
)
)
)
os.system("cythonize -i -3 -b solve.pyx")
import solve
| false
| 0
|
[
"- \"c${5PL2iRE5WFMthv^{+v?dBYMx`G~IoQTdEE$80tEzo{*Wd=yz1W_eo!MP$KlHFh$m0~eaaTywkAn~BRX?eaXF3w(ceoAiIC9UeRrXFAJ$F}?NJ*tL!#zJq?ldEsaY5&q?34ywFR!N<Eyg@se2S5wsu`99o-vspHRyuKWw{o@D&8p{Vek@exEg!TGf)_f@xoiY;dF*q;nO?tB{k#CUu}GqOCr%Cvhi>XJp*SD42B^v$UK`TDGs}C*Bu!4#M$?xq6ZH{RcR9i70yjHb(#A5S4gsZk?i@}6i0<R!D5BQ2BrZyo*IZGydC<T4$*EBF#_rEM<_aqM<}|56`JK<nptm)igr=^x*4nBl9fZ%puYE4jTaZ2k!MJv&(Aztem}0@!_f*P&GQQng{I2\"",
"+ \"c$`&I!ES>v480@q58h!atm#yy9VRsPBOM1P1R4zjN;6H{*Uu)DfG;HPJ=@O?ts4jEja1J!?~Lt0nPD28hd~cF?bD=Xf%^5=(LPV;u<v!hiYAA)(~D@S(wK4OJMGmKogksHzD*O==oaXBc{y{`Fr`W8luZIog@8c76Wq+79@~t>c^(s~w9Rs`V`us@O@LyhqyPmKoCExGHNA#n5phT&7e`qhVbc=x4zF(|NT=~DGF(lOmEsIX(ws;WNT>a`v!FJ<dX0^CY!`6vkLphstf|Ghyk}ydX1u!R@-5#rU}V$73K#^S;7N@DFW7-)le`q#WIVQ`14Bv66J?Y)d#Z|jv4v55U(V)=(H7F+#YVNjas$(d2oDv=a<|rbybt=wdP8t{s)KuoJIX!8-F$@Ra>r_}w?$<gs;x7Jk!>Cy;51zfTT$iwsPi>V!e5yk9-B{lpk>lD|KRh>h5\""
] | false
| 0.063765
| 0.040817
| 1.562223
|
[
"s732256370",
"s964749320"
] |
u796942881
|
p03945
|
python
|
s067875022
|
s235490638
| 26
| 18
| 3,188
| 3,188
|
Accepted
|
Accepted
| 30.77
|
def main():
S = eval(input())
ans = -1
pre = ""
for s in S:
if pre != s:
ans += 1
pre = s
print(ans)
return
main()
|
def main():
S = eval(input())
print((S.count("WB") + S.count("BW")))
return
main()
| 13
| 7
| 179
| 95
|
def main():
S = eval(input())
ans = -1
pre = ""
for s in S:
if pre != s:
ans += 1
pre = s
print(ans)
return
main()
|
def main():
S = eval(input())
print((S.count("WB") + S.count("BW")))
return
main()
| false
| 46.153846
|
[
"- ans = -1",
"- pre = \"\"",
"- for s in S:",
"- if pre != s:",
"- ans += 1",
"- pre = s",
"- print(ans)",
"+ print((S.count(\"WB\") + S.count(\"BW\")))"
] | false
| 0.086963
| 0.036235
| 2.399959
|
[
"s067875022",
"s235490638"
] |
u396495667
|
p02934
|
python
|
s810824506
|
s927339201
| 165
| 17
| 38,384
| 3,060
|
Accepted
|
Accepted
| 89.7
|
n = int(eval(input()))
a = list(map(int, input().split()))
t = 0
for i in range(n):
t = t + 1/a[i]
ans = 1/t
print(ans)
|
n = int(eval(input()))
a =[int(_) for _ in input().split()]
for i in range(len(a)):
a[i] = 1/a[i]
b = sum(a)
print((1/b))
| 9
| 7
| 127
| 122
|
n = int(eval(input()))
a = list(map(int, input().split()))
t = 0
for i in range(n):
t = t + 1 / a[i]
ans = 1 / t
print(ans)
|
n = int(eval(input()))
a = [int(_) for _ in input().split()]
for i in range(len(a)):
a[i] = 1 / a[i]
b = sum(a)
print((1 / b))
| false
| 22.222222
|
[
"-a = list(map(int, input().split()))",
"-t = 0",
"-for i in range(n):",
"- t = t + 1 / a[i]",
"-ans = 1 / t",
"-print(ans)",
"+a = [int(_) for _ in input().split()]",
"+for i in range(len(a)):",
"+ a[i] = 1 / a[i]",
"+b = sum(a)",
"+print((1 / b))"
] | false
| 0.123764
| 0.038581
| 3.207921
|
[
"s810824506",
"s927339201"
] |
u692453235
|
p03474
|
python
|
s968977812
|
s062918725
| 28
| 24
| 9,120
| 9,068
|
Accepted
|
Accepted
| 14.29
|
A, B = list(map(int, input().split()))
S = eval(input())
D = [ str(i) for i in range(10)]
T = S[:A] + S[A+1:]
if S[A] == "-" and all( t in D for t in T):
print("Yes")
else:
print("No")
|
A, B = list(map(int, input().split()))
S = eval(input())
if S.find("-") == S.rfind("-") == A:
print("Yes")
else:
print("No")
| 9
| 7
| 185
| 123
|
A, B = list(map(int, input().split()))
S = eval(input())
D = [str(i) for i in range(10)]
T = S[:A] + S[A + 1 :]
if S[A] == "-" and all(t in D for t in T):
print("Yes")
else:
print("No")
|
A, B = list(map(int, input().split()))
S = eval(input())
if S.find("-") == S.rfind("-") == A:
print("Yes")
else:
print("No")
| false
| 22.222222
|
[
"-D = [str(i) for i in range(10)]",
"-T = S[:A] + S[A + 1 :]",
"-if S[A] == \"-\" and all(t in D for t in T):",
"+if S.find(\"-\") == S.rfind(\"-\") == A:"
] | false
| 0.097757
| 0.038888
| 2.513777
|
[
"s968977812",
"s062918725"
] |
u745561510
|
p02780
|
python
|
s493857792
|
s730951467
| 270
| 155
| 25,732
| 24,804
|
Accepted
|
Accepted
| 42.59
|
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
sum_k = [0] * N
tmp = 0
for i in range(K):
tmp += p[i]
sum_k[0] = tmp
max_sum = tmp
candidate = 0
for i in range(len(p)-K):
sum_k[i+1] = sum_k[i] - p[i] + p[i+K]
if max_sum < sum_k[i+1]:
max_sum = sum_k[i+1]
candidate = i+1
dice = [-1] * 10000
ans = 0
for i in range(candidate, candidate + K):
tmp = 0
if dice[p[i]+1] != -1:
ans += dice[p[i]+1]
continue
for j in range(1, p[i]+1):
tmp += j * (1 / p[i])
dice[p[i]+1] = tmp
ans += tmp
print(ans)
|
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
sum_k = [0] * N
tmp = 0
for i in range(K):
tmp += p[i]
sum_k[0] = tmp
max_sum = tmp
candidate = 0
for i in range(len(p)-K):
sum_k[i+1] = sum_k[i] - p[i] + p[i+K]
if max_sum < sum_k[i+1]:
max_sum = sum_k[i+1]
candidate = i+1
ans = 0
for i in range(candidate, candidate + K):
ans += (1 + p[i]) / 2
print(ans)
| 30
| 21
| 617
| 430
|
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
sum_k = [0] * N
tmp = 0
for i in range(K):
tmp += p[i]
sum_k[0] = tmp
max_sum = tmp
candidate = 0
for i in range(len(p) - K):
sum_k[i + 1] = sum_k[i] - p[i] + p[i + K]
if max_sum < sum_k[i + 1]:
max_sum = sum_k[i + 1]
candidate = i + 1
dice = [-1] * 10000
ans = 0
for i in range(candidate, candidate + K):
tmp = 0
if dice[p[i] + 1] != -1:
ans += dice[p[i] + 1]
continue
for j in range(1, p[i] + 1):
tmp += j * (1 / p[i])
dice[p[i] + 1] = tmp
ans += tmp
print(ans)
|
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
sum_k = [0] * N
tmp = 0
for i in range(K):
tmp += p[i]
sum_k[0] = tmp
max_sum = tmp
candidate = 0
for i in range(len(p) - K):
sum_k[i + 1] = sum_k[i] - p[i] + p[i + K]
if max_sum < sum_k[i + 1]:
max_sum = sum_k[i + 1]
candidate = i + 1
ans = 0
for i in range(candidate, candidate + K):
ans += (1 + p[i]) / 2
print(ans)
| false
| 30
|
[
"-dice = [-1] * 10000",
"- tmp = 0",
"- if dice[p[i] + 1] != -1:",
"- ans += dice[p[i] + 1]",
"- continue",
"- for j in range(1, p[i] + 1):",
"- tmp += j * (1 / p[i])",
"- dice[p[i] + 1] = tmp",
"- ans += tmp",
"+ ans += (1 + p[i]) / 2"
] | false
| 0.084431
| 0.037954
| 2.2246
|
[
"s493857792",
"s730951467"
] |
u538632589
|
p03221
|
python
|
s356828084
|
s272237463
| 1,100
| 689
| 57,404
| 45,512
|
Accepted
|
Accepted
| 37.36
|
N, M = list(map(int, input().split()))
P = []
Y = []
for i in range(M):
p, y = list(map(int, input().split()))
P.append(p)
Y.append(y)
pref_map = {}
for i in range(1, N+1):
pref_map[i] = []
for i in range(M):
pref_map[P[i]].append([i, Y[i]])
city_list = []
for k in list(pref_map.keys()):
pref_map[k].sort(key=lambda x: x[1])
idx = 1
for c in pref_map[k]:
city_list.append([c[0], k, idx])
idx += 1
city_list.sort(key=lambda x:x[0])
for city in city_list:
print((format(city[1], '06d') + format(city[2], '06d')))
|
import bisect
N, M = list(map(int, input().split()))
py_list = [list(map(int, input().split())) for i in range(M)]
pref_city_map = {}
for i in range(N+1):
pref_city_map[i] = []
for py in py_list:
p = py[0]
pref_city_map[p].append(py[1])
for k in list(pref_city_map.keys()):
pref_city_map[k].sort()
for py in py_list:
p = py[0]
y = py[1]
p_str = str(p).zfill(6)
idx = bisect.bisect(pref_city_map[p], y)
idx_str = str(idx).zfill(6)
print((p_str + idx_str))
| 29
| 25
| 578
| 513
|
N, M = list(map(int, input().split()))
P = []
Y = []
for i in range(M):
p, y = list(map(int, input().split()))
P.append(p)
Y.append(y)
pref_map = {}
for i in range(1, N + 1):
pref_map[i] = []
for i in range(M):
pref_map[P[i]].append([i, Y[i]])
city_list = []
for k in list(pref_map.keys()):
pref_map[k].sort(key=lambda x: x[1])
idx = 1
for c in pref_map[k]:
city_list.append([c[0], k, idx])
idx += 1
city_list.sort(key=lambda x: x[0])
for city in city_list:
print((format(city[1], "06d") + format(city[2], "06d")))
|
import bisect
N, M = list(map(int, input().split()))
py_list = [list(map(int, input().split())) for i in range(M)]
pref_city_map = {}
for i in range(N + 1):
pref_city_map[i] = []
for py in py_list:
p = py[0]
pref_city_map[p].append(py[1])
for k in list(pref_city_map.keys()):
pref_city_map[k].sort()
for py in py_list:
p = py[0]
y = py[1]
p_str = str(p).zfill(6)
idx = bisect.bisect(pref_city_map[p], y)
idx_str = str(idx).zfill(6)
print((p_str + idx_str))
| false
| 13.793103
|
[
"+import bisect",
"+",
"-P = []",
"-Y = []",
"-for i in range(M):",
"- p, y = list(map(int, input().split()))",
"- P.append(p)",
"- Y.append(y)",
"-pref_map = {}",
"-for i in range(1, N + 1):",
"- pref_map[i] = []",
"-for i in range(M):",
"- pref_map[P[i]].append([i, Y[i]])",
"-city_list = []",
"-for k in list(pref_map.keys()):",
"- pref_map[k].sort(key=lambda x: x[1])",
"- idx = 1",
"- for c in pref_map[k]:",
"- city_list.append([c[0], k, idx])",
"- idx += 1",
"-city_list.sort(key=lambda x: x[0])",
"-for city in city_list:",
"- print((format(city[1], \"06d\") + format(city[2], \"06d\")))",
"+py_list = [list(map(int, input().split())) for i in range(M)]",
"+pref_city_map = {}",
"+for i in range(N + 1):",
"+ pref_city_map[i] = []",
"+for py in py_list:",
"+ p = py[0]",
"+ pref_city_map[p].append(py[1])",
"+for k in list(pref_city_map.keys()):",
"+ pref_city_map[k].sort()",
"+for py in py_list:",
"+ p = py[0]",
"+ y = py[1]",
"+ p_str = str(p).zfill(6)",
"+ idx = bisect.bisect(pref_city_map[p], y)",
"+ idx_str = str(idx).zfill(6)",
"+ print((p_str + idx_str))"
] | false
| 0.044841
| 0.045247
| 0.991036
|
[
"s356828084",
"s272237463"
] |
u647999897
|
p03779
|
python
|
s741838496
|
s274512146
| 175
| 101
| 38,384
| 62,024
|
Accepted
|
Accepted
| 42.29
|
def solve():
X = int(eval(input()))
sm = 0
n = 0
while sm < X:
n += 1
sm += n
print(n)
if __name__ == '__main__':
solve()
|
def solve():
X = int(eval(input()))
cnt = 0
sm = 0
while sm < X:
sm += cnt + 1
cnt += 1
print(cnt)
if __name__ == '__main__':
solve()
| 12
| 12
| 172
| 180
|
def solve():
X = int(eval(input()))
sm = 0
n = 0
while sm < X:
n += 1
sm += n
print(n)
if __name__ == "__main__":
solve()
|
def solve():
X = int(eval(input()))
cnt = 0
sm = 0
while sm < X:
sm += cnt + 1
cnt += 1
print(cnt)
if __name__ == "__main__":
solve()
| false
| 0
|
[
"+ cnt = 0",
"- n = 0",
"- n += 1",
"- sm += n",
"- print(n)",
"+ sm += cnt + 1",
"+ cnt += 1",
"+ print(cnt)"
] | false
| 0.038879
| 0.039259
| 0.990325
|
[
"s741838496",
"s274512146"
] |
u006326793
|
p02388
|
python
|
s290967953
|
s923951480
| 30
| 20
| 7,684
| 5,576
|
Accepted
|
Accepted
| 33.33
|
# -*- coding utf-8 -*-
x = int(eval(input()))
print((x**3))
|
# -*- coding: utf-8 -*-
x = int(eval(input()))
xcubic = x * x * x
print(xcubic)
| 3
| 6
| 53
| 81
|
# -*- coding utf-8 -*-
x = int(eval(input()))
print((x**3))
|
# -*- coding: utf-8 -*-
x = int(eval(input()))
xcubic = x * x * x
print(xcubic)
| false
| 50
|
[
"-# -*- coding utf-8 -*-",
"+# -*- coding: utf-8 -*-",
"-print((x**3))",
"+xcubic = x * x * x",
"+print(xcubic)"
] | false
| 0.038968
| 0.039059
| 0.997677
|
[
"s290967953",
"s923951480"
] |
u780698286
|
p03031
|
python
|
s735364106
|
s909142564
| 40
| 36
| 9,168
| 9,208
|
Accepted
|
Accepted
| 10
|
n, m = list(map(int, input().split()))
ks = [list(map(int, input().split())) for i in range(m)]
p = list(map(int, input().split()))
ans = 0
for i in range(2 ** n):
onswichi = [False] * n
onlight = [0] * m
for j in range(n):
if (i >> j) & 1:
onswichi[j] = True
for k in range(m):
cnt = 0
for f in ks[k][1:]:
if onswichi[f-1]:
cnt += 1
if cnt % 2 == p[k]:
onlight[k] = 1
if sum(onlight) == m:
ans += 1
print(ans)
|
n, m = list(map(int, input().split()))
ks = [list(map(int, input().split())) for i in range(m)]
p = list(map(int, input().split()))
ans = 0
for i in range(2**n):
l = [False] * n
for j in range(n):
if (i>>j) & 1:
l[j] = True
for j in range(m):
if [l[k-1] for k in ks[j][1:]].count(True) % 2 != p[j]:
break
else:
ans += 1
print(ans)
| 20
| 15
| 479
| 402
|
n, m = list(map(int, input().split()))
ks = [list(map(int, input().split())) for i in range(m)]
p = list(map(int, input().split()))
ans = 0
for i in range(2**n):
onswichi = [False] * n
onlight = [0] * m
for j in range(n):
if (i >> j) & 1:
onswichi[j] = True
for k in range(m):
cnt = 0
for f in ks[k][1:]:
if onswichi[f - 1]:
cnt += 1
if cnt % 2 == p[k]:
onlight[k] = 1
if sum(onlight) == m:
ans += 1
print(ans)
|
n, m = list(map(int, input().split()))
ks = [list(map(int, input().split())) for i in range(m)]
p = list(map(int, input().split()))
ans = 0
for i in range(2**n):
l = [False] * n
for j in range(n):
if (i >> j) & 1:
l[j] = True
for j in range(m):
if [l[k - 1] for k in ks[j][1:]].count(True) % 2 != p[j]:
break
else:
ans += 1
print(ans)
| false
| 25
|
[
"- onswichi = [False] * n",
"- onlight = [0] * m",
"+ l = [False] * n",
"- onswichi[j] = True",
"- for k in range(m):",
"- cnt = 0",
"- for f in ks[k][1:]:",
"- if onswichi[f - 1]:",
"- cnt += 1",
"- if cnt % 2 == p[k]:",
"- onlight[k] = 1",
"- if sum(onlight) == m:",
"+ l[j] = True",
"+ for j in range(m):",
"+ if [l[k - 1] for k in ks[j][1:]].count(True) % 2 != p[j]:",
"+ break",
"+ else:"
] | false
| 0.052829
| 0.047855
| 1.103946
|
[
"s735364106",
"s909142564"
] |
u528388170
|
p03262
|
python
|
s925060850
|
s012139542
| 118
| 96
| 14,224
| 14,252
|
Accepted
|
Accepted
| 18.64
|
N,X = list(map(int,input().split()))
x = [int(i) for i in input().split()]
x = [i-X for i in x]
Min = min([abs(i) for i in x])
flag = False
for i in range(1,Min+1):
if flag == True:
break
flag = True
if Min%i==0:
ans = Min//i
for j in x:
if j%ans!=0:
flag = False
else:
flag = False
print(ans)
|
N,X = list(map(int,input().split()))
x = [int(i) for i in input().split()]
def main():
global X
global x
print((answer(pre(X,x))))
def pre(a,b):
b = [i-a for i in b]
return b
def answer(k):
Min = min([abs(i) for i in k])
flag = False
for i in range(1,Min+1):
if flag == True:
break
flag = True
if Min%i==0:
ans = Min//i
for j in k:
if j%ans!=0:
flag = False
else:
flag = False
return ans
main()
| 17
| 25
| 379
| 638
|
N, X = list(map(int, input().split()))
x = [int(i) for i in input().split()]
x = [i - X for i in x]
Min = min([abs(i) for i in x])
flag = False
for i in range(1, Min + 1):
if flag == True:
break
flag = True
if Min % i == 0:
ans = Min // i
for j in x:
if j % ans != 0:
flag = False
else:
flag = False
print(ans)
|
N, X = list(map(int, input().split()))
x = [int(i) for i in input().split()]
def main():
global X
global x
print((answer(pre(X, x))))
def pre(a, b):
b = [i - a for i in b]
return b
def answer(k):
Min = min([abs(i) for i in k])
flag = False
for i in range(1, Min + 1):
if flag == True:
break
flag = True
if Min % i == 0:
ans = Min // i
for j in k:
if j % ans != 0:
flag = False
else:
flag = False
return ans
main()
| false
| 32
|
[
"-x = [i - X for i in x]",
"-Min = min([abs(i) for i in x])",
"-flag = False",
"-for i in range(1, Min + 1):",
"- if flag == True:",
"- break",
"- flag = True",
"- if Min % i == 0:",
"- ans = Min // i",
"- for j in x:",
"- if j % ans != 0:",
"- flag = False",
"- else:",
"- flag = False",
"-print(ans)",
"+",
"+",
"+def main():",
"+ global X",
"+ global x",
"+ print((answer(pre(X, x))))",
"+",
"+",
"+def pre(a, b):",
"+ b = [i - a for i in b]",
"+ return b",
"+",
"+",
"+def answer(k):",
"+ Min = min([abs(i) for i in k])",
"+ flag = False",
"+ for i in range(1, Min + 1):",
"+ if flag == True:",
"+ break",
"+ flag = True",
"+ if Min % i == 0:",
"+ ans = Min // i",
"+ for j in k:",
"+ if j % ans != 0:",
"+ flag = False",
"+ else:",
"+ flag = False",
"+ return ans",
"+",
"+",
"+main()"
] | false
| 0.041394
| 0.047023
| 0.880294
|
[
"s925060850",
"s012139542"
] |
u399352520
|
p03597
|
python
|
s094910132
|
s054873336
| 30
| 27
| 9,016
| 9,136
|
Accepted
|
Accepted
| 10
|
N=int(eval(input()))
print(((N*N)-int(eval(input()))))
|
N=int(eval(input()))
A=int(eval(input()))
print(((N**2)-A))
| 3
| 5
| 43
| 51
|
N = int(eval(input()))
print(((N * N) - int(eval(input()))))
|
N = int(eval(input()))
A = int(eval(input()))
print(((N**2) - A))
| false
| 40
|
[
"-print(((N * N) - int(eval(input()))))",
"+A = int(eval(input()))",
"+print(((N**2) - A))"
] | false
| 0.040768
| 0.036149
| 1.127782
|
[
"s094910132",
"s054873336"
] |
u203843959
|
p03073
|
python
|
s374221231
|
s570397602
| 104
| 70
| 6,316
| 5,420
|
Accepted
|
Accepted
| 32.69
|
s = list(eval(input()))
sl = list(map(int,s))
l1 = []
l2 = []
for i in range(len(sl)):
l1.append(i%2)
l2.append((i+1)%2)
d1 = 0
d2 = 0
for i in range(len(sl)):
if sl[i] != l1[i]:
d1 += 1
if sl[i] != l2[i]:
d2 += 1
print((min(d1,d2)))
|
s = list(eval(input()))
sl = list(map(int,s))
l1 = []
for i in range(len(sl)):
l1.append(i%2)
d1 = 0
for i in range(len(sl)):
if sl[i] != l1[i]:
d1 += 1
print((min(d1,len(sl)-d1)))
| 18
| 13
| 261
| 195
|
s = list(eval(input()))
sl = list(map(int, s))
l1 = []
l2 = []
for i in range(len(sl)):
l1.append(i % 2)
l2.append((i + 1) % 2)
d1 = 0
d2 = 0
for i in range(len(sl)):
if sl[i] != l1[i]:
d1 += 1
if sl[i] != l2[i]:
d2 += 1
print((min(d1, d2)))
|
s = list(eval(input()))
sl = list(map(int, s))
l1 = []
for i in range(len(sl)):
l1.append(i % 2)
d1 = 0
for i in range(len(sl)):
if sl[i] != l1[i]:
d1 += 1
print((min(d1, len(sl) - d1)))
| false
| 27.777778
|
[
"-l2 = []",
"- l2.append((i + 1) % 2)",
"-d2 = 0",
"- if sl[i] != l2[i]:",
"- d2 += 1",
"-print((min(d1, d2)))",
"+print((min(d1, len(sl) - d1)))"
] | false
| 0.04585
| 0.00783
| 5.855486
|
[
"s374221231",
"s570397602"
] |
u934442292
|
p02936
|
python
|
s992443009
|
s990369830
| 1,589
| 1,441
| 232,212
| 232,212
|
Accepted
|
Accepted
| 9.31
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def dfs(G, v, p, point):
"""G: graph, v: vertex, p: parent"""
# Loop for each child
for c in G[v]:
if c == p:
continue
point[c] += point[v]
dfs(G, c, v, point)
def main():
N, Q = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
point = [0] * N
for i in range(Q):
p, x = list(map(int, input().split()))
p -= 1
point[p] += x
dfs(G, 0, -1, point)
print((" ".join(map(str, point))))
if __name__ == "__main__":
main()
|
import sys
input = sys.stdin.readline # NOQA
sys.setrecursionlimit(10 ** 7) # NOQA
def dfs(G, v, p, counter):
"""G: graph, v: vertex, p: parent"""
# Loop for each child
counter_v = counter[v]
for c in G[v]:
if c == p:
continue # Avoid multiple access to parent
counter[c] += counter_v
dfs(G, c, v, counter)
def main():
N, Q = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
counter = [0] * N
for _ in range(Q):
p, x = list(map(int, input().split()))
p -= 1
counter[p] += x
dfs(G, 0, -1, counter)
# print(*counter)
print((" ".join(map(str, counter))))
if __name__ == "__main__":
main()
| 38
| 39
| 768
| 883
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
def dfs(G, v, p, point):
"""G: graph, v: vertex, p: parent"""
# Loop for each child
for c in G[v]:
if c == p:
continue
point[c] += point[v]
dfs(G, c, v, point)
def main():
N, Q = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
point = [0] * N
for i in range(Q):
p, x = list(map(int, input().split()))
p -= 1
point[p] += x
dfs(G, 0, -1, point)
print((" ".join(map(str, point))))
if __name__ == "__main__":
main()
|
import sys
input = sys.stdin.readline # NOQA
sys.setrecursionlimit(10**7) # NOQA
def dfs(G, v, p, counter):
"""G: graph, v: vertex, p: parent"""
# Loop for each child
counter_v = counter[v]
for c in G[v]:
if c == p:
continue # Avoid multiple access to parent
counter[c] += counter_v
dfs(G, c, v, counter)
def main():
N, Q = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
counter = [0] * N
for _ in range(Q):
p, x = list(map(int, input().split()))
p -= 1
counter[p] += x
dfs(G, 0, -1, counter)
# print(*counter)
print((" ".join(map(str, counter))))
if __name__ == "__main__":
main()
| false
| 2.564103
|
[
"-input = sys.stdin.readline",
"-sys.setrecursionlimit(10**7)",
"+input = sys.stdin.readline # NOQA",
"+sys.setrecursionlimit(10**7) # NOQA",
"-def dfs(G, v, p, point):",
"+def dfs(G, v, p, counter):",
"+ counter_v = counter[v]",
"- continue",
"- point[c] += point[v]",
"- dfs(G, c, v, point)",
"+ continue # Avoid multiple access to parent",
"+ counter[c] += counter_v",
"+ dfs(G, c, v, counter)",
"- point = [0] * N",
"- for i in range(Q):",
"+ counter = [0] * N",
"+ for _ in range(Q):",
"- point[p] += x",
"- dfs(G, 0, -1, point)",
"- print((\" \".join(map(str, point))))",
"+ counter[p] += x",
"+ dfs(G, 0, -1, counter)",
"+ # print(*counter)",
"+ print((\" \".join(map(str, counter))))"
] | false
| 0.04343
| 0.039509
| 1.099244
|
[
"s992443009",
"s990369830"
] |
u546285759
|
p00019
|
python
|
s737726447
|
s186636699
| 30
| 20
| 8,252
| 5,640
|
Accepted
|
Accepted
| 33.33
|
from functools import reduce as R
print((R(lambda x, y: x*y, list(range(1, int(eval(input()))+1)))))
|
import math
print((math.factorial(int(eval(input())))))
| 2
| 2
| 87
| 49
|
from functools import reduce as R
print((R(lambda x, y: x * y, list(range(1, int(eval(input())) + 1)))))
|
import math
print((math.factorial(int(eval(input())))))
| false
| 0
|
[
"-from functools import reduce as R",
"+import math",
"-print((R(lambda x, y: x * y, list(range(1, int(eval(input())) + 1)))))",
"+print((math.factorial(int(eval(input())))))"
] | false
| 0.04002
| 0.043547
| 0.919015
|
[
"s737726447",
"s186636699"
] |
u600402037
|
p03415
|
python
|
s710763531
|
s792644701
| 272
| 30
| 18,680
| 8,792
|
Accepted
|
Accepted
| 88.97
|
import sys
import numpy as np
stdin = sys.stdin
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split()))
rs = lambda: stdin.readline().rstrip() # ignore trailing spaces
C = [rs() for _ in range(3)]
answer = C[0][0] + C[1][1] + C[2][2]
print(answer)
|
# coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
C = [sr() for _ in range(3)]
answer = ''
for i in range(3):
answer += C[i][i]
print(answer)
| 12
| 13
| 285
| 246
|
import sys
import numpy as np
stdin = sys.stdin
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split()))
rs = lambda: stdin.readline().rstrip() # ignore trailing spaces
C = [rs() for _ in range(3)]
answer = C[0][0] + C[1][1] + C[2][2]
print(answer)
|
# coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
C = [sr() for _ in range(3)]
answer = ""
for i in range(3):
answer += C[i][i]
print(answer)
| false
| 7.692308
|
[
"+# coding: utf-8",
"-import numpy as np",
"-stdin = sys.stdin",
"-ri = lambda: int(rs())",
"-rl = lambda: list(map(int, stdin.readline().split()))",
"-rs = lambda: stdin.readline().rstrip() # ignore trailing spaces",
"-C = [rs() for _ in range(3)]",
"-answer = C[0][0] + C[1][1] + C[2][2]",
"+sr = lambda: sys.stdin.readline().rstrip()",
"+ir = lambda: int(sr())",
"+lr = lambda: list(map(int, sr().split()))",
"+C = [sr() for _ in range(3)]",
"+answer = \"\"",
"+for i in range(3):",
"+ answer += C[i][i]"
] | false
| 0.101683
| 0.038263
| 2.657463
|
[
"s710763531",
"s792644701"
] |
u442877951
|
p03262
|
python
|
s962464849
|
s565370534
| 293
| 137
| 62,576
| 16,308
|
Accepted
|
Accepted
| 53.24
|
N,X = list(map(int,input().split()))
W = list(map(int,input().split())) + [X]
W = sorted(W)
dist = 10**18
if len(W) == 2:
print((W[1]-W[0]))
exit()
for i in range(1,N+1):
dist = min(dist, W[i]-W[i-1])
while (W[i]-W[i-1])%dist != 0:
dist -= 1
if dist == 1:
break
print(dist)
|
from functools import reduce
from fractions import gcd
N,X = list(map(int,input().split()))
W = list(map(int,input().split())) + [X]
W = sorted(W)
sa_w = [W[i+1] - W[i] for i in range(N)]
ans = reduce(gcd, sa_w)
print(ans)
| 14
| 8
| 296
| 223
|
N, X = list(map(int, input().split()))
W = list(map(int, input().split())) + [X]
W = sorted(W)
dist = 10**18
if len(W) == 2:
print((W[1] - W[0]))
exit()
for i in range(1, N + 1):
dist = min(dist, W[i] - W[i - 1])
while (W[i] - W[i - 1]) % dist != 0:
dist -= 1
if dist == 1:
break
print(dist)
|
from functools import reduce
from fractions import gcd
N, X = list(map(int, input().split()))
W = list(map(int, input().split())) + [X]
W = sorted(W)
sa_w = [W[i + 1] - W[i] for i in range(N)]
ans = reduce(gcd, sa_w)
print(ans)
| false
| 42.857143
|
[
"+from functools import reduce",
"+from fractions import gcd",
"+",
"-dist = 10**18",
"-if len(W) == 2:",
"- print((W[1] - W[0]))",
"- exit()",
"-for i in range(1, N + 1):",
"- dist = min(dist, W[i] - W[i - 1])",
"- while (W[i] - W[i - 1]) % dist != 0:",
"- dist -= 1",
"- if dist == 1:",
"- break",
"-print(dist)",
"+sa_w = [W[i + 1] - W[i] for i in range(N)]",
"+ans = reduce(gcd, sa_w)",
"+print(ans)"
] | false
| 0.073622
| 0.120064
| 0.61319
|
[
"s962464849",
"s565370534"
] |
u189326411
|
p03208
|
python
|
s091664470
|
s524000842
| 338
| 265
| 19,172
| 10,592
|
Accepted
|
Accepted
| 21.6
|
n,k = list(map(int, input().split()))
h = [[] for i in range(n)]
for i in range(n):
h[i] = int(eval(input()))
h.sort()
diff = [[] for i in range(n-1)]
for i in range(n-1):
diff[i] = h[i+1]-h[i]
t = [[] for i in range(n-1)]
t[0] = diff[0]
for i in range(1,n-1):
t[i] = t[i-1]+diff[i]
t = [0] + t
# print(h)
# print(diff)
# print(t)
ans = float("inf")
for i in range(n-k+1):
a = t[i+k-1]-t[i]
ans = min(ans, a)
print(ans)
|
n,k = list(map(int, input().split()))
h = [[] for i in range(n)]
for i in range(n):
h[i] = int(eval(input()))
h.sort()
ans = float("inf")
for i in range(n-k+1):
a = h[i+k-1]-h[i]
ans = min(ans, a)
print(ans)
| 26
| 11
| 458
| 219
|
n, k = list(map(int, input().split()))
h = [[] for i in range(n)]
for i in range(n):
h[i] = int(eval(input()))
h.sort()
diff = [[] for i in range(n - 1)]
for i in range(n - 1):
diff[i] = h[i + 1] - h[i]
t = [[] for i in range(n - 1)]
t[0] = diff[0]
for i in range(1, n - 1):
t[i] = t[i - 1] + diff[i]
t = [0] + t
# print(h)
# print(diff)
# print(t)
ans = float("inf")
for i in range(n - k + 1):
a = t[i + k - 1] - t[i]
ans = min(ans, a)
print(ans)
|
n, k = list(map(int, input().split()))
h = [[] for i in range(n)]
for i in range(n):
h[i] = int(eval(input()))
h.sort()
ans = float("inf")
for i in range(n - k + 1):
a = h[i + k - 1] - h[i]
ans = min(ans, a)
print(ans)
| false
| 57.692308
|
[
"-diff = [[] for i in range(n - 1)]",
"-for i in range(n - 1):",
"- diff[i] = h[i + 1] - h[i]",
"-t = [[] for i in range(n - 1)]",
"-t[0] = diff[0]",
"-for i in range(1, n - 1):",
"- t[i] = t[i - 1] + diff[i]",
"-t = [0] + t",
"-# print(h)",
"-# print(diff)",
"-# print(t)",
"- a = t[i + k - 1] - t[i]",
"+ a = h[i + k - 1] - h[i]"
] | false
| 0.036176
| 0.040534
| 0.892493
|
[
"s091664470",
"s524000842"
] |
u297447724
|
p03351
|
python
|
s458305516
|
s729544005
| 26
| 24
| 9,192
| 9,136
|
Accepted
|
Accepted
| 7.69
|
data = eval(input())
data1,data2,data3,data4 = data.split()
data1 = int(data1)
data2 = int(data2)
data3 = int(data3)
data4 = int(data4)
if abs(data1 - data3) <= data4:
print('Yes')
elif abs(data1 - data2) <= data4 and abs(data2 - data3) <= data4:
print('Yes')
else:
print('No')
|
data_a,data_b,data_c,data_d = [int(x) for x in input().split()]
length_1 = abs(data_a - data_b)
length_2 = abs(data_b - data_c)
length_3 = abs(data_a - data_c)
if length_3 <= data_d:
print('Yes')
elif length_1 <= data_d and length_2 <= data_d:
print('Yes')
else:
print('No')
| 14
| 13
| 298
| 301
|
data = eval(input())
data1, data2, data3, data4 = data.split()
data1 = int(data1)
data2 = int(data2)
data3 = int(data3)
data4 = int(data4)
if abs(data1 - data3) <= data4:
print("Yes")
elif abs(data1 - data2) <= data4 and abs(data2 - data3) <= data4:
print("Yes")
else:
print("No")
|
data_a, data_b, data_c, data_d = [int(x) for x in input().split()]
length_1 = abs(data_a - data_b)
length_2 = abs(data_b - data_c)
length_3 = abs(data_a - data_c)
if length_3 <= data_d:
print("Yes")
elif length_1 <= data_d and length_2 <= data_d:
print("Yes")
else:
print("No")
| false
| 7.142857
|
[
"-data = eval(input())",
"-data1, data2, data3, data4 = data.split()",
"-data1 = int(data1)",
"-data2 = int(data2)",
"-data3 = int(data3)",
"-data4 = int(data4)",
"-if abs(data1 - data3) <= data4:",
"+data_a, data_b, data_c, data_d = [int(x) for x in input().split()]",
"+length_1 = abs(data_a - data_b)",
"+length_2 = abs(data_b - data_c)",
"+length_3 = abs(data_a - data_c)",
"+if length_3 <= data_d:",
"-elif abs(data1 - data2) <= data4 and abs(data2 - data3) <= data4:",
"+elif length_1 <= data_d and length_2 <= data_d:"
] | false
| 0.044356
| 0.067013
| 0.661905
|
[
"s458305516",
"s729544005"
] |
u263830634
|
p03141
|
python
|
s464296269
|
s458266649
| 713
| 385
| 43,724
| 7,388
|
Accepted
|
Accepted
| 46
|
import sys
input = sys.stdin.readline
N = int(eval(input()))
lst_A = []
l_A_append = lst_A.append
lst_B = []
l_B_append = lst_B.append
for i in range(N):
A, B = list(map(int, input().split()))
l_A_append([A + B, A, B, i])
l_B_append([A + B, B, A, i])
lst_A.sort(reverse = True)
lst_B.sort(reverse = True)
# print (lst)
ans = 0
check_lst = [False] * N
index_A = 0
index_B = 0
count = 0
while count < N:
if count % 2 == 0: #高橋くんの番
while check_lst[lst_A[index_A][3]]: #使われているとき-->index_Aを増やす
index_A += 1
ans += lst_A[index_A][1]
check_lst[lst_A[index_A][3]] = True
index_A += 1
else: #青木さんの番
while check_lst[lst_B[index_B][3]]: #使われていないとき -->index_Bを増やす
index_B += 1
ans -= lst_B[index_B][1]
check_lst[lst_B[index_B][3]] = True
index_B += 1
count += 1
print (ans)
|
N = int(eval(input()))
lst = []
l_append = lst.append
ans = 0
for i in range(N):
A, B = list(map(int, input().split()))
l_append(A + B)
ans -= B
lst.sort(reverse = True)
for i in range(N):
if i % 2 == 0:
ans += lst[i]
else:
pass
print (ans)
| 38
| 19
| 907
| 288
|
import sys
input = sys.stdin.readline
N = int(eval(input()))
lst_A = []
l_A_append = lst_A.append
lst_B = []
l_B_append = lst_B.append
for i in range(N):
A, B = list(map(int, input().split()))
l_A_append([A + B, A, B, i])
l_B_append([A + B, B, A, i])
lst_A.sort(reverse=True)
lst_B.sort(reverse=True)
# print (lst)
ans = 0
check_lst = [False] * N
index_A = 0
index_B = 0
count = 0
while count < N:
if count % 2 == 0: # 高橋くんの番
while check_lst[lst_A[index_A][3]]: # 使われているとき-->index_Aを増やす
index_A += 1
ans += lst_A[index_A][1]
check_lst[lst_A[index_A][3]] = True
index_A += 1
else: # 青木さんの番
while check_lst[lst_B[index_B][3]]: # 使われていないとき -->index_Bを増やす
index_B += 1
ans -= lst_B[index_B][1]
check_lst[lst_B[index_B][3]] = True
index_B += 1
count += 1
print(ans)
|
N = int(eval(input()))
lst = []
l_append = lst.append
ans = 0
for i in range(N):
A, B = list(map(int, input().split()))
l_append(A + B)
ans -= B
lst.sort(reverse=True)
for i in range(N):
if i % 2 == 0:
ans += lst[i]
else:
pass
print(ans)
| false
| 50
|
[
"-import sys",
"-",
"-input = sys.stdin.readline",
"-lst_A = []",
"-l_A_append = lst_A.append",
"-lst_B = []",
"-l_B_append = lst_B.append",
"+lst = []",
"+l_append = lst.append",
"+ans = 0",
"- l_A_append([A + B, A, B, i])",
"- l_B_append([A + B, B, A, i])",
"-lst_A.sort(reverse=True)",
"-lst_B.sort(reverse=True)",
"-# print (lst)",
"-ans = 0",
"-check_lst = [False] * N",
"-index_A = 0",
"-index_B = 0",
"-count = 0",
"-while count < N:",
"- if count % 2 == 0: # 高橋くんの番",
"- while check_lst[lst_A[index_A][3]]: # 使われているとき-->index_Aを増やす",
"- index_A += 1",
"- ans += lst_A[index_A][1]",
"- check_lst[lst_A[index_A][3]] = True",
"- index_A += 1",
"- else: # 青木さんの番",
"- while check_lst[lst_B[index_B][3]]: # 使われていないとき -->index_Bを増やす",
"- index_B += 1",
"- ans -= lst_B[index_B][1]",
"- check_lst[lst_B[index_B][3]] = True",
"- index_B += 1",
"- count += 1",
"+ l_append(A + B)",
"+ ans -= B",
"+lst.sort(reverse=True)",
"+for i in range(N):",
"+ if i % 2 == 0:",
"+ ans += lst[i]",
"+ else:",
"+ pass"
] | false
| 0.037055
| 0.04926
| 0.752228
|
[
"s464296269",
"s458266649"
] |
u228223940
|
p03946
|
python
|
s704700208
|
s404733487
| 304
| 233
| 65,132
| 62,832
|
Accepted
|
Accepted
| 23.36
|
import heapq
n,t = list(map(int,input().split()))
ai = [int(i) for i in input().split()]
rev_ai = [ai[n-1]*(-1)]
ans = [0,0]
heapq.heapify(rev_ai)
#print(rev_ai)
for i in range(1,n):
#print(ai[n-1-i])
dif = rev_ai[0]*(-1) - ai[n-1-i]
if dif > ans[0]:
ans = [dif,1]
elif dif == ans[0]:
ans[1] += 1
#print(rev_ai[0])
heapq.heappush(rev_ai,ai[n-1-i]*(-1))
print((ans[1]))
|
#import heapq
n,t = list(map(int,input().split()))
ai = [int(i) for i in input().split()]
#rev_ai = [ai[n-1]*(-1)]
ans = [0,0]
max_ai = ai[n-1]
#heapq.heapify(rev_ai)
#print(rev_ai)
for i in range(1,n):
#print(ai[n-1-i])
dif = max_ai - ai[n-1-i]
if dif > ans[0]:
ans = [dif,1]
elif dif == ans[0]:
ans[1] += 1
#print(rev_ai[0])
#heapq.heappush(rev_ai,ai[n-1-i]*(-1))
max_ai = max(max_ai,ai[n-1-i])
print((ans[1]))
| 22
| 25
| 426
| 478
|
import heapq
n, t = list(map(int, input().split()))
ai = [int(i) for i in input().split()]
rev_ai = [ai[n - 1] * (-1)]
ans = [0, 0]
heapq.heapify(rev_ai)
# print(rev_ai)
for i in range(1, n):
# print(ai[n-1-i])
dif = rev_ai[0] * (-1) - ai[n - 1 - i]
if dif > ans[0]:
ans = [dif, 1]
elif dif == ans[0]:
ans[1] += 1
# print(rev_ai[0])
heapq.heappush(rev_ai, ai[n - 1 - i] * (-1))
print((ans[1]))
|
# import heapq
n, t = list(map(int, input().split()))
ai = [int(i) for i in input().split()]
# rev_ai = [ai[n-1]*(-1)]
ans = [0, 0]
max_ai = ai[n - 1]
# heapq.heapify(rev_ai)
# print(rev_ai)
for i in range(1, n):
# print(ai[n-1-i])
dif = max_ai - ai[n - 1 - i]
if dif > ans[0]:
ans = [dif, 1]
elif dif == ans[0]:
ans[1] += 1
# print(rev_ai[0])
# heapq.heappush(rev_ai,ai[n-1-i]*(-1))
max_ai = max(max_ai, ai[n - 1 - i])
print((ans[1]))
| false
| 12
|
[
"-import heapq",
"-",
"+# import heapq",
"-rev_ai = [ai[n - 1] * (-1)]",
"+# rev_ai = [ai[n-1]*(-1)]",
"-heapq.heapify(rev_ai)",
"+max_ai = ai[n - 1]",
"+# heapq.heapify(rev_ai)",
"- dif = rev_ai[0] * (-1) - ai[n - 1 - i]",
"+ dif = max_ai - ai[n - 1 - i]",
"- heapq.heappush(rev_ai, ai[n - 1 - i] * (-1))",
"+ # heapq.heappush(rev_ai,ai[n-1-i]*(-1))",
"+ max_ai = max(max_ai, ai[n - 1 - i])"
] | false
| 0.038412
| 0.035249
| 1.089732
|
[
"s704700208",
"s404733487"
] |
u488127128
|
p03624
|
python
|
s642057558
|
s770121177
| 21
| 18
| 3,188
| 3,188
|
Accepted
|
Accepted
| 14.29
|
a = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
s = set(eval(input()))
for i in a:
if i not in s:
print(i)
break
else:
print('None')
|
a = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
s = eval(input())
for i in a:
if i not in s:
print(i)
break
else:
print('None')
| 8
| 8
| 219
| 214
|
a = [
"a",
"b",
"c",
"d",
"e",
"f",
"g",
"h",
"i",
"j",
"k",
"l",
"m",
"n",
"o",
"p",
"q",
"r",
"s",
"t",
"u",
"v",
"w",
"x",
"y",
"z",
]
s = set(eval(input()))
for i in a:
if i not in s:
print(i)
break
else:
print("None")
|
a = [
"a",
"b",
"c",
"d",
"e",
"f",
"g",
"h",
"i",
"j",
"k",
"l",
"m",
"n",
"o",
"p",
"q",
"r",
"s",
"t",
"u",
"v",
"w",
"x",
"y",
"z",
]
s = eval(input())
for i in a:
if i not in s:
print(i)
break
else:
print("None")
| false
| 0
|
[
"-s = set(eval(input()))",
"+s = eval(input())"
] | false
| 0.124263
| 0.045942
| 2.704777
|
[
"s642057558",
"s770121177"
] |
u757030836
|
p02848
|
python
|
s830314252
|
s789986027
| 23
| 20
| 3,316
| 3,060
|
Accepted
|
Accepted
| 13.04
|
n = int(eval(input()))
s = eval(input())
a = list("ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ")
x = ""
for i in s:
x += a[a.index(i)+n]
print(x)
|
N = int(eval(input()))
S = eval(input())
print(("".join(chr(65+(ord(s)-65+N)%26) for s in S)))
| 8
| 3
| 155
| 82
|
n = int(eval(input()))
s = eval(input())
a = list("ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ")
x = ""
for i in s:
x += a[a.index(i) + n]
print(x)
|
N = int(eval(input()))
S = eval(input())
print(("".join(chr(65 + (ord(s) - 65 + N) % 26) for s in S)))
| false
| 62.5
|
[
"-n = int(eval(input()))",
"-s = eval(input())",
"-a = list(\"ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ\")",
"-x = \"\"",
"-for i in s:",
"- x += a[a.index(i) + n]",
"-print(x)",
"+N = int(eval(input()))",
"+S = eval(input())",
"+print((\"\".join(chr(65 + (ord(s) - 65 + N) % 26) for s in S)))"
] | false
| 0.085964
| 0.078681
| 1.09256
|
[
"s830314252",
"s789986027"
] |
u411203878
|
p02732
|
python
|
s522914756
|
s142071938
| 405
| 172
| 82,564
| 92,096
|
Accepted
|
Accepted
| 57.53
|
n=int(eval(input()))
t = list(map(int,input().split()))
memo = [0]*(2*(10**5)+1)
for i in t:
memo[i]+=1
sumv=0
for j in memo:
sumv+=j*(j-1)//2
for i in t:
print((sumv-(memo[i]*(memo[i]-1))//2+((memo[i]-2)*(memo[i]-1)//2)))
|
n=int(eval(input()))
t = list(map(int,input().split()))
memo = [0]*(2*10**5+1)
for i in t:
memo[i] += 1
ans = 0
for i in memo:
ans += i*(i-1)//2
for i in t:
print((ans-(memo[i]*(memo[i]-1)//2)+((memo[i]-1)*(memo[i]-2)//2)))
| 16
| 17
| 248
| 255
|
n = int(eval(input()))
t = list(map(int, input().split()))
memo = [0] * (2 * (10**5) + 1)
for i in t:
memo[i] += 1
sumv = 0
for j in memo:
sumv += j * (j - 1) // 2
for i in t:
print(
(sumv - (memo[i] * (memo[i] - 1)) // 2 + ((memo[i] - 2) * (memo[i] - 1) // 2))
)
|
n = int(eval(input()))
t = list(map(int, input().split()))
memo = [0] * (2 * 10**5 + 1)
for i in t:
memo[i] += 1
ans = 0
for i in memo:
ans += i * (i - 1) // 2
for i in t:
print((ans - (memo[i] * (memo[i] - 1) // 2) + ((memo[i] - 1) * (memo[i] - 2) // 2)))
| false
| 5.882353
|
[
"-memo = [0] * (2 * (10**5) + 1)",
"+memo = [0] * (2 * 10**5 + 1)",
"-sumv = 0",
"-for j in memo:",
"- sumv += j * (j - 1) // 2",
"+ans = 0",
"+for i in memo:",
"+ ans += i * (i - 1) // 2",
"- print(",
"- (sumv - (memo[i] * (memo[i] - 1)) // 2 + ((memo[i] - 2) * (memo[i] - 1) // 2))",
"- )",
"+ print((ans - (memo[i] * (memo[i] - 1) // 2) + ((memo[i] - 1) * (memo[i] - 2) // 2)))"
] | false
| 0.106485
| 0.099647
| 1.06862
|
[
"s522914756",
"s142071938"
] |
u618101737
|
p02726
|
python
|
s483871441
|
s637104087
| 324
| 235
| 231,184
| 43,120
|
Accepted
|
Accepted
| 27.47
|
import numpy as np
inf = np.iinfo(np.uint32).max
# def solve():
# dists_y = [abs(y-a) for a in range(0,n+1)]
# dists_x = [abs(x-a) for a in range(0,n+1)]
# count_dists = np.zeros(n+1, dtype=int)
# for a in range(1,n+1):
# for b in range(1,a+1):
# dis = min(abs(b-a), dists_x[a] + dists_y[b] + 1, dists_y[a] + dists_x[b] + 1)
# count_dists[dis] += 1
# #print(min_dists)
# for j in range(1,n):
# print(count_dists[j])
def solve():
dists_y = [abs(y-a) for a in range(1,n+1)]
dists_x = [abs(x-a) for a in range(1,n+1)]
aa = np.tile(np.arange(1, n+1), (n, 1))
bb = aa.transpose().copy()
base_dists = np.abs(aa-bb).copy()
aa = np.tile(dists_y, (n, 1))
bb = np.tile(dists_x, (n, 1)).transpose().copy()
ab_dists = aa + bb + 1
ba_dists = ab_dists.transpose().copy()
min_dists = np.minimum(ab_dists, ba_dists)
min_dists = np.minimum(min_dists, base_dists)
count_dists = np.bincount(min_dists.reshape(n**2))
for j in range(1,n):
if j+1>len(count_dists):
print((0))
else:
print((count_dists[j]//2))
#
# def ceildiv(a, b):
# return a // b + a % b
n, x, y = [int(i) for i in input().split(" ")]
# import time
# t = time.time()
# n, x, y = 2000, 200, 600
solve()
#print(time.time()- t)
|
def solve():
dists_y = [abs(y-a) for a in range(0,n+1)]
dists_x = [abs(x-a) for a in range(0,n+1)]
count_dists = [0]*(n+1)
for a in range(1,n+1):
for b in range(1,a+1):
dis = min(abs(b-a), dists_x[a] + dists_y[b] + 1, dists_y[a] + dists_x[b] + 1)
count_dists[dis] += 1
#print(min_dists)
for j in range(1,n):
print((count_dists[j]))
#
# def ceildiv(a, b):
# return a // b + a % b
n, x, y = [int(i) for i in input().split(" ")]
# import time
# t = time.time()
#n, x, y = 2000, 200, 600
solve()
#print(time.time()- t)
| 55
| 30
| 1,395
| 619
|
import numpy as np
inf = np.iinfo(np.uint32).max
# def solve():
# dists_y = [abs(y-a) for a in range(0,n+1)]
# dists_x = [abs(x-a) for a in range(0,n+1)]
# count_dists = np.zeros(n+1, dtype=int)
# for a in range(1,n+1):
# for b in range(1,a+1):
# dis = min(abs(b-a), dists_x[a] + dists_y[b] + 1, dists_y[a] + dists_x[b] + 1)
# count_dists[dis] += 1
# #print(min_dists)
# for j in range(1,n):
# print(count_dists[j])
def solve():
dists_y = [abs(y - a) for a in range(1, n + 1)]
dists_x = [abs(x - a) for a in range(1, n + 1)]
aa = np.tile(np.arange(1, n + 1), (n, 1))
bb = aa.transpose().copy()
base_dists = np.abs(aa - bb).copy()
aa = np.tile(dists_y, (n, 1))
bb = np.tile(dists_x, (n, 1)).transpose().copy()
ab_dists = aa + bb + 1
ba_dists = ab_dists.transpose().copy()
min_dists = np.minimum(ab_dists, ba_dists)
min_dists = np.minimum(min_dists, base_dists)
count_dists = np.bincount(min_dists.reshape(n**2))
for j in range(1, n):
if j + 1 > len(count_dists):
print((0))
else:
print((count_dists[j] // 2))
#
# def ceildiv(a, b):
# return a // b + a % b
n, x, y = [int(i) for i in input().split(" ")]
# import time
# t = time.time()
# n, x, y = 2000, 200, 600
solve()
# print(time.time()- t)
|
def solve():
dists_y = [abs(y - a) for a in range(0, n + 1)]
dists_x = [abs(x - a) for a in range(0, n + 1)]
count_dists = [0] * (n + 1)
for a in range(1, n + 1):
for b in range(1, a + 1):
dis = min(
abs(b - a), dists_x[a] + dists_y[b] + 1, dists_y[a] + dists_x[b] + 1
)
count_dists[dis] += 1
# print(min_dists)
for j in range(1, n):
print((count_dists[j]))
#
# def ceildiv(a, b):
# return a // b + a % b
n, x, y = [int(i) for i in input().split(" ")]
# import time
# t = time.time()
# n, x, y = 2000, 200, 600
solve()
# print(time.time()- t)
| false
| 45.454545
|
[
"-import numpy as np",
"-",
"-inf = np.iinfo(np.uint32).max",
"-# def solve():",
"-# dists_y = [abs(y-a) for a in range(0,n+1)]",
"-# dists_x = [abs(x-a) for a in range(0,n+1)]",
"-# count_dists = np.zeros(n+1, dtype=int)",
"-# for a in range(1,n+1):",
"-# for b in range(1,a+1):",
"-# dis = min(abs(b-a), dists_x[a] + dists_y[b] + 1, dists_y[a] + dists_x[b] + 1)",
"-# count_dists[dis] += 1",
"-# #print(min_dists)",
"-# for j in range(1,n):",
"-# print(count_dists[j])",
"- dists_y = [abs(y - a) for a in range(1, n + 1)]",
"- dists_x = [abs(x - a) for a in range(1, n + 1)]",
"- aa = np.tile(np.arange(1, n + 1), (n, 1))",
"- bb = aa.transpose().copy()",
"- base_dists = np.abs(aa - bb).copy()",
"- aa = np.tile(dists_y, (n, 1))",
"- bb = np.tile(dists_x, (n, 1)).transpose().copy()",
"- ab_dists = aa + bb + 1",
"- ba_dists = ab_dists.transpose().copy()",
"- min_dists = np.minimum(ab_dists, ba_dists)",
"- min_dists = np.minimum(min_dists, base_dists)",
"- count_dists = np.bincount(min_dists.reshape(n**2))",
"+ dists_y = [abs(y - a) for a in range(0, n + 1)]",
"+ dists_x = [abs(x - a) for a in range(0, n + 1)]",
"+ count_dists = [0] * (n + 1)",
"+ for a in range(1, n + 1):",
"+ for b in range(1, a + 1):",
"+ dis = min(",
"+ abs(b - a), dists_x[a] + dists_y[b] + 1, dists_y[a] + dists_x[b] + 1",
"+ )",
"+ count_dists[dis] += 1",
"+ # print(min_dists)",
"- if j + 1 > len(count_dists):",
"- print((0))",
"- else:",
"- print((count_dists[j] // 2))",
"+ print((count_dists[j]))"
] | false
| 0.634808
| 0.035813
| 17.725549
|
[
"s483871441",
"s637104087"
] |
u011062360
|
p02785
|
python
|
s732813378
|
s857769549
| 171
| 156
| 26,180
| 25,768
|
Accepted
|
Accepted
| 8.77
|
n, h = list(map(int, input().split()))
list_score = list(map(int, input().split()))
list_score.sort()
if h >= len(list_score):
h = len(list_score)
for i in range(h):
list_score.pop(-1)
ans = sum(list_score)
print(ans)
|
n, h = list(map(int, input().split()))
list_score = list(map(int, input().split()))
list_score.sort()
if h > n:
print((0))
else:
ans = sum(list_score[:n-h])
print(ans)
| 14
| 9
| 237
| 180
|
n, h = list(map(int, input().split()))
list_score = list(map(int, input().split()))
list_score.sort()
if h >= len(list_score):
h = len(list_score)
for i in range(h):
list_score.pop(-1)
ans = sum(list_score)
print(ans)
|
n, h = list(map(int, input().split()))
list_score = list(map(int, input().split()))
list_score.sort()
if h > n:
print((0))
else:
ans = sum(list_score[: n - h])
print(ans)
| false
| 35.714286
|
[
"-if h >= len(list_score):",
"- h = len(list_score)",
"-for i in range(h):",
"- list_score.pop(-1)",
"-ans = sum(list_score)",
"-print(ans)",
"+if h > n:",
"+ print((0))",
"+else:",
"+ ans = sum(list_score[: n - h])",
"+ print(ans)"
] | false
| 0.044121
| 0.047116
| 0.93644
|
[
"s732813378",
"s857769549"
] |
u186838327
|
p03356
|
python
|
s809650511
|
s342429915
| 1,029
| 723
| 93,676
| 86,672
|
Accepted
|
Accepted
| 29.74
|
n, m = list(map(int, input().split()))
P = list(map(int, input().split()))
P = [p-1 for p in P]
def Find(x, par):
if par[x] < 0:
return x
else:
# 経路圧縮
par[x] = Find(par[x], par)
return par[x]
def Unite(x, y, par, rank):
x = Find(x, par)
y = Find(y, par)
if x != y:
# rankの低い方を高い方につなげる
if rank[x] < rank[y]:
par[y] += par[x]
par[x] = y
else:
par[x] += par[y]
par[y] = x
if rank[x] == rank[y]:
rank[x] += 1
def Same(x, y, par):
return Find(x, par) == Find(y, par)
def Size(x, par):
return -par[Find(x, par)]
par = [-1]* n
rank = [0]*n
for i in range(m):
x, y = list(map(int, input().split()))
x, y = x-1, y-1
Unite(x, y, par, rank)
ans = 0
for i in range(n):
if Same(i, P[i], par):
ans += 1
print(ans)
|
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
P = list(map(int, input().split()))
P = [p-1 for p in P]
def Find(x, par):
if par[x] < 0:
return x
else:
par[x] = Find(par[x], par)
return par[x]
def Unite(x, y, par, rank):
x = Find(x, par)
y = Find(y, par)
if x != y:
if rank[x] < rank[y]:
par[y] += par[x]
par[x] = y
else:
par[x] += par[y]
par[y] = x
if rank[x] == rank[y]:
rank[x] += 1
def Same(x, y, par):
return Find(x, par) == Find(y, par)
def Size(x, par):
return -par[Find(x, par)]
par = [-1]* n
rank = [0]*n
for i in range(m):
x, y = list(map(int, input().split()))
x, y = x-1, y-1
Unite(x, y, par, rank)
ans = 0
for i, p in enumerate(P):
if Same(i, p, par):
ans += 1
print(ans)
| 46
| 46
| 844
| 924
|
n, m = list(map(int, input().split()))
P = list(map(int, input().split()))
P = [p - 1 for p in P]
def Find(x, par):
if par[x] < 0:
return x
else:
# 経路圧縮
par[x] = Find(par[x], par)
return par[x]
def Unite(x, y, par, rank):
x = Find(x, par)
y = Find(y, par)
if x != y:
# rankの低い方を高い方につなげる
if rank[x] < rank[y]:
par[y] += par[x]
par[x] = y
else:
par[x] += par[y]
par[y] = x
if rank[x] == rank[y]:
rank[x] += 1
def Same(x, y, par):
return Find(x, par) == Find(y, par)
def Size(x, par):
return -par[Find(x, par)]
par = [-1] * n
rank = [0] * n
for i in range(m):
x, y = list(map(int, input().split()))
x, y = x - 1, y - 1
Unite(x, y, par, rank)
ans = 0
for i in range(n):
if Same(i, P[i], par):
ans += 1
print(ans)
|
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
P = list(map(int, input().split()))
P = [p - 1 for p in P]
def Find(x, par):
if par[x] < 0:
return x
else:
par[x] = Find(par[x], par)
return par[x]
def Unite(x, y, par, rank):
x = Find(x, par)
y = Find(y, par)
if x != y:
if rank[x] < rank[y]:
par[y] += par[x]
par[x] = y
else:
par[x] += par[y]
par[y] = x
if rank[x] == rank[y]:
rank[x] += 1
def Same(x, y, par):
return Find(x, par) == Find(y, par)
def Size(x, par):
return -par[Find(x, par)]
par = [-1] * n
rank = [0] * n
for i in range(m):
x, y = list(map(int, input().split()))
x, y = x - 1, y - 1
Unite(x, y, par, rank)
ans = 0
for i, p in enumerate(P):
if Same(i, p, par):
ans += 1
print(ans)
| false
| 0
|
[
"+import sys",
"+",
"+input = sys.stdin.readline",
"- # 経路圧縮",
"- # rankの低い方を高い方につなげる",
"-for i in range(n):",
"- if Same(i, P[i], par):",
"+for i, p in enumerate(P):",
"+ if Same(i, p, par):"
] | false
| 0.054616
| 0.038763
| 1.408957
|
[
"s809650511",
"s342429915"
] |
u513081876
|
p03221
|
python
|
s966995418
|
s566995558
| 729
| 630
| 36,392
| 32,160
|
Accepted
|
Accepted
| 13.58
|
N, M = list(map(int, input().split()))
cnt = [0 for i in range(N + 1)]
check = []
ans = []
for i in range(M):
p, y = list(map(int, input().split()))
check.append((y, p, i))
check.sort()
for y, p, i in check:
cnt[p] += 1
ans.append((i,str(p).zfill(6)+str(cnt[p]).zfill(6)))
ans.sort()
for aa, bb in ans:
print(bb)
|
N, M = list(map(int, input().split()))
data = [[] for i in range(M)]
ans = [""] * M
num = [0] * N
for i in range(M):
ken, year = list(map(int, input().split()))
data[i] = [ken, year, i]
data.sort(key=lambda x:x[1])
for p, y, i in data:
num[p-1] += 1
ans[i] = str(p).zfill(6) + str(num[p-1]).zfill(6)
for i in ans:
print(i)
| 19
| 16
| 344
| 352
|
N, M = list(map(int, input().split()))
cnt = [0 for i in range(N + 1)]
check = []
ans = []
for i in range(M):
p, y = list(map(int, input().split()))
check.append((y, p, i))
check.sort()
for y, p, i in check:
cnt[p] += 1
ans.append((i, str(p).zfill(6) + str(cnt[p]).zfill(6)))
ans.sort()
for aa, bb in ans:
print(bb)
|
N, M = list(map(int, input().split()))
data = [[] for i in range(M)]
ans = [""] * M
num = [0] * N
for i in range(M):
ken, year = list(map(int, input().split()))
data[i] = [ken, year, i]
data.sort(key=lambda x: x[1])
for p, y, i in data:
num[p - 1] += 1
ans[i] = str(p).zfill(6) + str(num[p - 1]).zfill(6)
for i in ans:
print(i)
| false
| 15.789474
|
[
"-cnt = [0 for i in range(N + 1)]",
"-check = []",
"-ans = []",
"+data = [[] for i in range(M)]",
"+ans = [\"\"] * M",
"+num = [0] * N",
"- p, y = list(map(int, input().split()))",
"- check.append((y, p, i))",
"-check.sort()",
"-for y, p, i in check:",
"- cnt[p] += 1",
"- ans.append((i, str(p).zfill(6) + str(cnt[p]).zfill(6)))",
"-ans.sort()",
"-for aa, bb in ans:",
"- print(bb)",
"+ ken, year = list(map(int, input().split()))",
"+ data[i] = [ken, year, i]",
"+data.sort(key=lambda x: x[1])",
"+for p, y, i in data:",
"+ num[p - 1] += 1",
"+ ans[i] = str(p).zfill(6) + str(num[p - 1]).zfill(6)",
"+for i in ans:",
"+ print(i)"
] | false
| 0.039016
| 0.135904
| 0.287084
|
[
"s966995418",
"s566995558"
] |
u102461423
|
p03016
|
python
|
s376160185
|
s566238269
| 33
| 18
| 3,940
| 3,064
|
Accepted
|
Accepted
| 45.45
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from functools import lru_cache
L,A,B,MOD = list(map(int,read().split()))
@lru_cache(None)
def F(r,n,MOD):
# 1+r+...+r^{n-1} をダブリングで求める
if n == 0:
return 0
q = n//2
x = F(r,q,MOD)
# 1+r^qをかける
x *= 1 + pow(r,q,MOD); x %= MOD
if n&1:
x *= r; x += 1; x %= MOD
return x
@lru_cache(None)
def G(r,n,MOD):
# sum ir^i をダブリングで求める
if n == 0:
return 0
q = n//2
x = G(r,q,MOD)
# 1+r^qをかける
x *= 1 + pow(r,q,MOD); x %= MOD
# q(r^q+...+r^{2q-1})を加える
x += F(r,q,MOD) * pow(r,q,MOD) * q % MOD
if n&1:
x *= r; x += F(r,n,MOD); x -= 1; x %= MOD
return x
S = 0
for d in range(1,20):
# d桁の最初、最後、項数
lower = 10**(d-1)
upper = 10**d-1
# lower <= A+nB <= upper
nlower = (lower-A+B-1)//B
nupper = (upper-A)//B
if nlower < 0:
nlower = 0
if nupper >=L:
nupper = L-1
if nlower > nupper:
continue
items = nupper - nlower + 1
r = (10**d) % MOD
last = A+B*nupper
x = last * F(r,items,MOD)
x -= B * G(r,items,MOD)
length = d*items
S *= pow(10,length,MOD); S += x
S %= MOD
print(S)
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
L,A,B,MOD = list(map(int,read().split()))
def geom_seq_sum(r,n,MOD):
"""
return \sum_{i=0}^{n-1} r^i mod MOD
"""
if r == 1:
return n%MOD
r1 = r-1
return ((pow(r,n,r1*MOD)-1)//r1)% MOD
def geom_seq_sum_1(r,n,MOD):
"""
return \sum_{i=0}^{n-1} ir^i mod MOD
"""
if r == 1:
return n*(n-1)//2%MOD
r1 = r-1
x = pow(r,n,r1*r1*MOD)
return (-(x-1)//r1 + (n-1)*x + 1)//r1 % MOD
S = 0
for d in range(1,20):
# d桁の最初、最後、項数
lower = 10**(d-1)
upper = 10**d-1
# lower <= A+nB <= upper
nlower = (lower-A+B-1)//B
nupper = (upper-A)//B
if nlower < 0:
nlower = 0
if nupper >=L:
nupper = L-1
if nlower > nupper:
continue
items = nupper - nlower + 1
r = (10**d) % MOD
last = A+B*nupper
x = last * geom_seq_sum(r,items,MOD)
x -= B * geom_seq_sum_1(r,items,MOD)
length = d*items
S *= pow(10,length,MOD); S += x
S %= MOD
print(S)
| 62
| 50
| 1,322
| 1,127
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from functools import lru_cache
L, A, B, MOD = list(map(int, read().split()))
@lru_cache(None)
def F(r, n, MOD):
# 1+r+...+r^{n-1} をダブリングで求める
if n == 0:
return 0
q = n // 2
x = F(r, q, MOD)
# 1+r^qをかける
x *= 1 + pow(r, q, MOD)
x %= MOD
if n & 1:
x *= r
x += 1
x %= MOD
return x
@lru_cache(None)
def G(r, n, MOD):
# sum ir^i をダブリングで求める
if n == 0:
return 0
q = n // 2
x = G(r, q, MOD)
# 1+r^qをかける
x *= 1 + pow(r, q, MOD)
x %= MOD
# q(r^q+...+r^{2q-1})を加える
x += F(r, q, MOD) * pow(r, q, MOD) * q % MOD
if n & 1:
x *= r
x += F(r, n, MOD)
x -= 1
x %= MOD
return x
S = 0
for d in range(1, 20):
# d桁の最初、最後、項数
lower = 10 ** (d - 1)
upper = 10**d - 1
# lower <= A+nB <= upper
nlower = (lower - A + B - 1) // B
nupper = (upper - A) // B
if nlower < 0:
nlower = 0
if nupper >= L:
nupper = L - 1
if nlower > nupper:
continue
items = nupper - nlower + 1
r = (10**d) % MOD
last = A + B * nupper
x = last * F(r, items, MOD)
x -= B * G(r, items, MOD)
length = d * items
S *= pow(10, length, MOD)
S += x
S %= MOD
print(S)
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
L, A, B, MOD = list(map(int, read().split()))
def geom_seq_sum(r, n, MOD):
"""
return \sum_{i=0}^{n-1} r^i mod MOD
"""
if r == 1:
return n % MOD
r1 = r - 1
return ((pow(r, n, r1 * MOD) - 1) // r1) % MOD
def geom_seq_sum_1(r, n, MOD):
"""
return \sum_{i=0}^{n-1} ir^i mod MOD
"""
if r == 1:
return n * (n - 1) // 2 % MOD
r1 = r - 1
x = pow(r, n, r1 * r1 * MOD)
return (-(x - 1) // r1 + (n - 1) * x + 1) // r1 % MOD
S = 0
for d in range(1, 20):
# d桁の最初、最後、項数
lower = 10 ** (d - 1)
upper = 10**d - 1
# lower <= A+nB <= upper
nlower = (lower - A + B - 1) // B
nupper = (upper - A) // B
if nlower < 0:
nlower = 0
if nupper >= L:
nupper = L - 1
if nlower > nupper:
continue
items = nupper - nlower + 1
r = (10**d) % MOD
last = A + B * nupper
x = last * geom_seq_sum(r, items, MOD)
x -= B * geom_seq_sum_1(r, items, MOD)
length = d * items
S *= pow(10, length, MOD)
S += x
S %= MOD
print(S)
| false
| 19.354839
|
[
"-from functools import lru_cache",
"-",
"-@lru_cache(None)",
"-def F(r, n, MOD):",
"- # 1+r+...+r^{n-1} をダブリングで求める",
"- if n == 0:",
"- return 0",
"- q = n // 2",
"- x = F(r, q, MOD)",
"- # 1+r^qをかける",
"- x *= 1 + pow(r, q, MOD)",
"- x %= MOD",
"- if n & 1:",
"- x *= r",
"- x += 1",
"- x %= MOD",
"- return x",
"+def geom_seq_sum(r, n, MOD):",
"+ \"\"\"",
"+ return \\sum_{i=0}^{n-1} r^i mod MOD",
"+ \"\"\"",
"+ if r == 1:",
"+ return n % MOD",
"+ r1 = r - 1",
"+ return ((pow(r, n, r1 * MOD) - 1) // r1) % MOD",
"-@lru_cache(None)",
"-def G(r, n, MOD):",
"- # sum ir^i をダブリングで求める",
"- if n == 0:",
"- return 0",
"- q = n // 2",
"- x = G(r, q, MOD)",
"- # 1+r^qをかける",
"- x *= 1 + pow(r, q, MOD)",
"- x %= MOD",
"- # q(r^q+...+r^{2q-1})を加える",
"- x += F(r, q, MOD) * pow(r, q, MOD) * q % MOD",
"- if n & 1:",
"- x *= r",
"- x += F(r, n, MOD)",
"- x -= 1",
"- x %= MOD",
"- return x",
"+def geom_seq_sum_1(r, n, MOD):",
"+ \"\"\"",
"+ return \\sum_{i=0}^{n-1} ir^i mod MOD",
"+ \"\"\"",
"+ if r == 1:",
"+ return n * (n - 1) // 2 % MOD",
"+ r1 = r - 1",
"+ x = pow(r, n, r1 * r1 * MOD)",
"+ return (-(x - 1) // r1 + (n - 1) * x + 1) // r1 % MOD",
"- x = last * F(r, items, MOD)",
"- x -= B * G(r, items, MOD)",
"+ x = last * geom_seq_sum(r, items, MOD)",
"+ x -= B * geom_seq_sum_1(r, items, MOD)"
] | false
| 0.038837
| 0.038763
| 1.001905
|
[
"s376160185",
"s566238269"
] |
u747602774
|
p02983
|
python
|
s584522648
|
s212501109
| 876
| 56
| 3,060
| 9,172
|
Accepted
|
Accepted
| 93.61
|
L,R = list(map(int,input().split()))
a = [False for i in range(2019)]
for i in range(L,min(L+2019,R)+1):
a[i%2019] = True
ans = 4000
for i in range(2019):
if not a[i]:
continue
for j in range(i+1,2019):
if not a[j]:
continue
ans = min(ans,i*j%2019)
print(ans)
|
L,R = list(map(int,input().split()))
ans = 4000
for i in range(L,R+1):
for j in range(i+1,R+1):
ans = min(ans,i*j%2019)
if ans == 0:
break
else:
continue
break
print(ans)
| 14
| 12
| 316
| 225
|
L, R = list(map(int, input().split()))
a = [False for i in range(2019)]
for i in range(L, min(L + 2019, R) + 1):
a[i % 2019] = True
ans = 4000
for i in range(2019):
if not a[i]:
continue
for j in range(i + 1, 2019):
if not a[j]:
continue
ans = min(ans, i * j % 2019)
print(ans)
|
L, R = list(map(int, input().split()))
ans = 4000
for i in range(L, R + 1):
for j in range(i + 1, R + 1):
ans = min(ans, i * j % 2019)
if ans == 0:
break
else:
continue
break
print(ans)
| false
| 14.285714
|
[
"-a = [False for i in range(2019)]",
"-for i in range(L, min(L + 2019, R) + 1):",
"- a[i % 2019] = True",
"-for i in range(2019):",
"- if not a[i]:",
"+for i in range(L, R + 1):",
"+ for j in range(i + 1, R + 1):",
"+ ans = min(ans, i * j % 2019)",
"+ if ans == 0:",
"+ break",
"+ else:",
"- for j in range(i + 1, 2019):",
"- if not a[j]:",
"- continue",
"- ans = min(ans, i * j % 2019)",
"+ break"
] | false
| 0.176155
| 0.037138
| 4.743211
|
[
"s584522648",
"s212501109"
] |
u844558673
|
p02687
|
python
|
s779522450
|
s212406847
| 23
| 21
| 8,896
| 9,012
|
Accepted
|
Accepted
| 8.7
|
s = eval(input())
if s == 'ABC':
print('ARC')
else:
print('ABC')
|
s = eval(input())
list = ['ABC','ARC']
if s == 'ABC':
print((list[1]))
else:
print((list[0]))
| 5
| 6
| 65
| 91
|
s = eval(input())
if s == "ABC":
print("ARC")
else:
print("ABC")
|
s = eval(input())
list = ["ABC", "ARC"]
if s == "ABC":
print((list[1]))
else:
print((list[0]))
| false
| 16.666667
|
[
"+list = [\"ABC\", \"ARC\"]",
"- print(\"ARC\")",
"+ print((list[1]))",
"- print(\"ABC\")",
"+ print((list[0]))"
] | false
| 0.038799
| 0.075992
| 0.510573
|
[
"s779522450",
"s212406847"
] |
u211706121
|
p02711
|
python
|
s796495595
|
s048326264
| 22
| 20
| 9,004
| 8,960
|
Accepted
|
Accepted
| 9.09
|
x=eval(input())
if x[0] == "7" or x[1] == "7" or x[2] == "7":
print("Yes")
else:
print("No")
|
s=eval(input())
if s[0]=='7' or s[1]=='7' or s[2]=='7':
print("Yes")
else:
print("No")
| 5
| 6
| 98
| 90
|
x = eval(input())
if x[0] == "7" or x[1] == "7" or x[2] == "7":
print("Yes")
else:
print("No")
|
s = eval(input())
if s[0] == "7" or s[1] == "7" or s[2] == "7":
print("Yes")
else:
print("No")
| false
| 16.666667
|
[
"-x = eval(input())",
"-if x[0] == \"7\" or x[1] == \"7\" or x[2] == \"7\":",
"+s = eval(input())",
"+if s[0] == \"7\" or s[1] == \"7\" or s[2] == \"7\":"
] | false
| 0.118351
| 0.0407
| 2.907869
|
[
"s796495595",
"s048326264"
] |
u138546245
|
p02374
|
python
|
s056092151
|
s761677221
| 6,510
| 5,790
| 44,480
| 40,128
|
Accepted
|
Accepted
| 11.06
|
#!/usr/bin/env python3
# GRL_5_D: Tree - Range Query on Tree
class Edge:
__slots__ = ('v', 'w')
def __init__(self, v, w):
self.v = v
self.w = w
def either(self):
return self.v
def other(self, v):
if v == self.v:
return self.w
else:
return self.v
class Graph:
def __init__(self, v):
self.v = v
self._edges = [[] for _ in range(v)]
def add(self, e):
self._edges[e.v].append(e)
self._edges[e.w].append(e)
def adj(self, v):
return self._edges[v]
def edges(self):
for es in self._edges:
for e in es:
yield e
class RAQ:
"""Segment Tree
"""
def __init__(self, n, initial=0):
size = 1
while size < n:
size *= 2
self.size = 2*size - 1
self.data = [initial] * self.size
def add(self, i, j, v):
def _add(r, lo, hi):
if hi < i or lo > j:
return
elif i <= lo and hi <= j:
self.data[r] += v
else:
mid = lo + (hi - lo)//2
_add(r*2 + 1, lo, mid)
_add(r*2 + 2, mid+1, hi)
return _add(0, 0, self.size//2)
def get(self, i):
def _get(r, lo, hi, v):
v += self.data[r]
if lo == hi:
return v
mid = lo + (hi - lo)//2
if mid >= i:
return _get(r*2 + 1, lo, mid, v)
else:
return _get(r*2 + 2, mid+1, hi, v)
return _get(0, 0, self.size//2, 0)
class PathSum:
def __init__(self, graph, root):
self.seg = RAQ(graph.v * 2)
self._in = [0] * graph.v
self._out = [0] * graph.v
self.dfs(graph, root)
def dfs(self, graph, root):
visited = [False] * graph.v
stack = [root]
i = 0
while stack:
v = stack.pop()
if not visited[v]:
visited[v] = True
self._in[v] = i
i += 1
stack.append(v)
for e in graph.adj(v):
w = e.other(v)
if not visited[w]:
stack.append(w)
else:
self._out[v] = i
i += 1
def add(self, v, val):
i = self._in[v]
j = self._out[v]
self.seg.add(i, j, val)
def get(self, v):
return self.seg.get(self._in[v])
def run():
n = int(eval(input()))
g = Graph(n)
for i in range(n):
k, *cs = [int(i) for i in input().split()]
if k > 0:
for j in cs:
g.add(Edge(i, j))
raq = PathSum(g, 0)
q = int(eval(input()))
for _ in range(q):
com, *args = [int(i) for i in input().split()]
if com == 0:
u, val = args
raq.add(u, val)
elif com == 1:
u, = args
print((raq.get(u)))
else:
raise ValueError('invalid command')
if __name__ == '__main__':
run()
|
#!/usr/bin/env python3
# GRL_5_D: Tree - Range Query on Tree
# Eular Tour Technique
# DFSの結果でサブツリーの範囲がわかるので、range add queryを利用して
# add/getを行う
class Edge:
__slots__ = ('v', 'w')
def __init__(self, v, w):
self.v = v
self.w = w
def either(self):
return self.v
def other(self, v):
if v == self.v:
return self.w
else:
return self.v
class Graph:
def __init__(self, v):
self.v = v
self._edges = [[] for _ in range(v)]
def add(self, e):
self._edges[e.v].append(e)
self._edges[e.w].append(e)
def adj(self, v):
return self._edges[v]
def edges(self):
for es in self._edges:
for e in es:
yield e
class RAQ:
"""Segment Tree
"""
def __init__(self, n, initial=0):
size = 1
while size < n:
size *= 2
self.size = 2*size - 1
self.data = [initial] * self.size
def add(self, i, j, v):
def _add(r, lo, hi):
if hi < i or lo > j:
return
elif i <= lo and hi <= j:
self.data[r] += v
else:
mid = lo + (hi - lo)//2
_add(r*2 + 1, lo, mid)
_add(r*2 + 2, mid+1, hi)
return _add(0, 0, self.size//2)
def get(self, i):
def _get(r, lo, hi, v):
v += self.data[r]
if lo == hi:
return v
mid = lo + (hi - lo)//2
if mid >= i:
return _get(r*2 + 1, lo, mid, v)
else:
return _get(r*2 + 2, mid+1, hi, v)
return _get(0, 0, self.size//2, 0)
class PathSum:
def __init__(self, graph, root):
self.seg = RAQ(graph.v)
self._in = [0] * graph.v
self._out = [0] * graph.v
self.dfs(graph, root)
def dfs(self, graph, root):
visited = [False] * graph.v
stack = [root]
i = 0
while stack:
v = stack.pop()
if not visited[v]:
visited[v] = True
self._in[v] = i
i += 1
stack.append(v)
for e in graph.adj(v):
w = e.other(v)
if not visited[w]:
stack.append(w)
else:
self._out[v] = i - 1
def add(self, v, val):
i = self._in[v]
j = self._out[v]
self.seg.add(i, j, val)
def get(self, v):
return self.seg.get(self._in[v])
def run():
n = int(eval(input()))
g = Graph(n)
for i in range(n):
k, *cs = [int(i) for i in input().split()]
if k > 0:
for j in cs:
g.add(Edge(i, j))
raq = PathSum(g, 0)
q = int(eval(input()))
for _ in range(q):
com, *args = [int(i) for i in input().split()]
if com == 0:
u, val = args
raq.add(u, val)
elif com == 1:
u, = args
print((raq.get(u)))
else:
raise ValueError('invalid command')
if __name__ == '__main__':
run()
| 138
| 140
| 3,233
| 3,293
|
#!/usr/bin/env python3
# GRL_5_D: Tree - Range Query on Tree
class Edge:
__slots__ = ("v", "w")
def __init__(self, v, w):
self.v = v
self.w = w
def either(self):
return self.v
def other(self, v):
if v == self.v:
return self.w
else:
return self.v
class Graph:
def __init__(self, v):
self.v = v
self._edges = [[] for _ in range(v)]
def add(self, e):
self._edges[e.v].append(e)
self._edges[e.w].append(e)
def adj(self, v):
return self._edges[v]
def edges(self):
for es in self._edges:
for e in es:
yield e
class RAQ:
"""Segment Tree"""
def __init__(self, n, initial=0):
size = 1
while size < n:
size *= 2
self.size = 2 * size - 1
self.data = [initial] * self.size
def add(self, i, j, v):
def _add(r, lo, hi):
if hi < i or lo > j:
return
elif i <= lo and hi <= j:
self.data[r] += v
else:
mid = lo + (hi - lo) // 2
_add(r * 2 + 1, lo, mid)
_add(r * 2 + 2, mid + 1, hi)
return _add(0, 0, self.size // 2)
def get(self, i):
def _get(r, lo, hi, v):
v += self.data[r]
if lo == hi:
return v
mid = lo + (hi - lo) // 2
if mid >= i:
return _get(r * 2 + 1, lo, mid, v)
else:
return _get(r * 2 + 2, mid + 1, hi, v)
return _get(0, 0, self.size // 2, 0)
class PathSum:
def __init__(self, graph, root):
self.seg = RAQ(graph.v * 2)
self._in = [0] * graph.v
self._out = [0] * graph.v
self.dfs(graph, root)
def dfs(self, graph, root):
visited = [False] * graph.v
stack = [root]
i = 0
while stack:
v = stack.pop()
if not visited[v]:
visited[v] = True
self._in[v] = i
i += 1
stack.append(v)
for e in graph.adj(v):
w = e.other(v)
if not visited[w]:
stack.append(w)
else:
self._out[v] = i
i += 1
def add(self, v, val):
i = self._in[v]
j = self._out[v]
self.seg.add(i, j, val)
def get(self, v):
return self.seg.get(self._in[v])
def run():
n = int(eval(input()))
g = Graph(n)
for i in range(n):
k, *cs = [int(i) for i in input().split()]
if k > 0:
for j in cs:
g.add(Edge(i, j))
raq = PathSum(g, 0)
q = int(eval(input()))
for _ in range(q):
com, *args = [int(i) for i in input().split()]
if com == 0:
u, val = args
raq.add(u, val)
elif com == 1:
(u,) = args
print((raq.get(u)))
else:
raise ValueError("invalid command")
if __name__ == "__main__":
run()
|
#!/usr/bin/env python3
# GRL_5_D: Tree - Range Query on Tree
# Eular Tour Technique
# DFSの結果でサブツリーの範囲がわかるので、range add queryを利用して
# add/getを行う
class Edge:
__slots__ = ("v", "w")
def __init__(self, v, w):
self.v = v
self.w = w
def either(self):
return self.v
def other(self, v):
if v == self.v:
return self.w
else:
return self.v
class Graph:
def __init__(self, v):
self.v = v
self._edges = [[] for _ in range(v)]
def add(self, e):
self._edges[e.v].append(e)
self._edges[e.w].append(e)
def adj(self, v):
return self._edges[v]
def edges(self):
for es in self._edges:
for e in es:
yield e
class RAQ:
"""Segment Tree"""
def __init__(self, n, initial=0):
size = 1
while size < n:
size *= 2
self.size = 2 * size - 1
self.data = [initial] * self.size
def add(self, i, j, v):
def _add(r, lo, hi):
if hi < i or lo > j:
return
elif i <= lo and hi <= j:
self.data[r] += v
else:
mid = lo + (hi - lo) // 2
_add(r * 2 + 1, lo, mid)
_add(r * 2 + 2, mid + 1, hi)
return _add(0, 0, self.size // 2)
def get(self, i):
def _get(r, lo, hi, v):
v += self.data[r]
if lo == hi:
return v
mid = lo + (hi - lo) // 2
if mid >= i:
return _get(r * 2 + 1, lo, mid, v)
else:
return _get(r * 2 + 2, mid + 1, hi, v)
return _get(0, 0, self.size // 2, 0)
class PathSum:
def __init__(self, graph, root):
self.seg = RAQ(graph.v)
self._in = [0] * graph.v
self._out = [0] * graph.v
self.dfs(graph, root)
def dfs(self, graph, root):
visited = [False] * graph.v
stack = [root]
i = 0
while stack:
v = stack.pop()
if not visited[v]:
visited[v] = True
self._in[v] = i
i += 1
stack.append(v)
for e in graph.adj(v):
w = e.other(v)
if not visited[w]:
stack.append(w)
else:
self._out[v] = i - 1
def add(self, v, val):
i = self._in[v]
j = self._out[v]
self.seg.add(i, j, val)
def get(self, v):
return self.seg.get(self._in[v])
def run():
n = int(eval(input()))
g = Graph(n)
for i in range(n):
k, *cs = [int(i) for i in input().split()]
if k > 0:
for j in cs:
g.add(Edge(i, j))
raq = PathSum(g, 0)
q = int(eval(input()))
for _ in range(q):
com, *args = [int(i) for i in input().split()]
if com == 0:
u, val = args
raq.add(u, val)
elif com == 1:
(u,) = args
print((raq.get(u)))
else:
raise ValueError("invalid command")
if __name__ == "__main__":
run()
| false
| 1.428571
|
[
"+# Eular Tour Technique",
"+# DFSの結果でサブツリーの範囲がわかるので、range add queryを利用して",
"+# add/getを行う",
"- self.seg = RAQ(graph.v * 2)",
"+ self.seg = RAQ(graph.v)",
"- self._out[v] = i",
"- i += 1",
"+ self._out[v] = i - 1"
] | false
| 0.109157
| 0.038191
| 2.858165
|
[
"s056092151",
"s761677221"
] |
u484229314
|
p03805
|
python
|
s019482914
|
s427212691
| 62
| 34
| 3,064
| 3,064
|
Accepted
|
Accepted
| 45.16
|
N, M = [int(v) for v in input().split()]
tbl = [[0] * (N + 1) for _ in range(N+1)]
for _ in range(M):
a, b = [int(v) for v in input().split()]
tbl[a][b] = 1
tbl[b][a] = 1
ans = 0
paths = [[1, ]]
while paths:
p = paths.pop()
for i in range(1, N + 1):
if p[-1] == i: continue
if tbl[p[-1]][i] and i not in p:
np = p + [i]
if len(np) == N:
ans += 1
paths.append(np)
print(ans)
|
N, M = [int(v) for v in input().split()]
tbl = [[0] * (N + 1) for _ in range(N + 1)]
def dfs(v, visited):
if len(visited) == N:
return 1
ans = 0
for i in range(1, N + 1):
if i == v: continue
if tbl[i][v] == 1 and i not in visited:
visited.append(i)
ans += dfs(i, visited)
visited.pop()
return ans
for _ in range(M):
a, b = [int(v) for v in input().split()]
tbl[a][b] = 1
tbl[b][a] = 1
paths = [1, ]
print((dfs(1, paths)))
| 20
| 25
| 482
| 537
|
N, M = [int(v) for v in input().split()]
tbl = [[0] * (N + 1) for _ in range(N + 1)]
for _ in range(M):
a, b = [int(v) for v in input().split()]
tbl[a][b] = 1
tbl[b][a] = 1
ans = 0
paths = [
[
1,
]
]
while paths:
p = paths.pop()
for i in range(1, N + 1):
if p[-1] == i:
continue
if tbl[p[-1]][i] and i not in p:
np = p + [i]
if len(np) == N:
ans += 1
paths.append(np)
print(ans)
|
N, M = [int(v) for v in input().split()]
tbl = [[0] * (N + 1) for _ in range(N + 1)]
def dfs(v, visited):
if len(visited) == N:
return 1
ans = 0
for i in range(1, N + 1):
if i == v:
continue
if tbl[i][v] == 1 and i not in visited:
visited.append(i)
ans += dfs(i, visited)
visited.pop()
return ans
for _ in range(M):
a, b = [int(v) for v in input().split()]
tbl[a][b] = 1
tbl[b][a] = 1
paths = [
1,
]
print((dfs(1, paths)))
| false
| 20
|
[
"+",
"+",
"+def dfs(v, visited):",
"+ if len(visited) == N:",
"+ return 1",
"+ ans = 0",
"+ for i in range(1, N + 1):",
"+ if i == v:",
"+ continue",
"+ if tbl[i][v] == 1 and i not in visited:",
"+ visited.append(i)",
"+ ans += dfs(i, visited)",
"+ visited.pop()",
"+ return ans",
"+",
"+",
"-ans = 0",
"- [",
"- 1,",
"- ]",
"+ 1,",
"-while paths:",
"- p = paths.pop()",
"- for i in range(1, N + 1):",
"- if p[-1] == i:",
"- continue",
"- if tbl[p[-1]][i] and i not in p:",
"- np = p + [i]",
"- if len(np) == N:",
"- ans += 1",
"- paths.append(np)",
"-print(ans)",
"+print((dfs(1, paths)))"
] | false
| 0.052319
| 0.041057
| 1.274317
|
[
"s019482914",
"s427212691"
] |
u753803401
|
p04043
|
python
|
s327613120
|
s200757923
| 193
| 166
| 38,512
| 38,256
|
Accepted
|
Accepted
| 13.99
|
def slove():
import sys, collections
input = sys.stdin.readline
a = dict(collections.Counter(list(map(int, input().rstrip('\n').split()))).most_common())
print(("YES" if a[5] == 2 and a[7] == 1 else "NO"))
if __name__ == '__main__':
slove()
|
def slove():
import sys
input = sys.stdin.readline
a = "".join(sorted(list(map(str, str(input().rstrip('\n')).split()))))
print(("YES" if a == "557" else "NO"))
if __name__ == '__main__':
slove()
| 9
| 9
| 269
| 224
|
def slove():
import sys, collections
input = sys.stdin.readline
a = dict(
collections.Counter(list(map(int, input().rstrip("\n").split()))).most_common()
)
print(("YES" if a[5] == 2 and a[7] == 1 else "NO"))
if __name__ == "__main__":
slove()
|
def slove():
import sys
input = sys.stdin.readline
a = "".join(sorted(list(map(str, str(input().rstrip("\n")).split()))))
print(("YES" if a == "557" else "NO"))
if __name__ == "__main__":
slove()
| false
| 0
|
[
"- import sys, collections",
"+ import sys",
"- a = dict(",
"- collections.Counter(list(map(int, input().rstrip(\"\\n\").split()))).most_common()",
"- )",
"- print((\"YES\" if a[5] == 2 and a[7] == 1 else \"NO\"))",
"+ a = \"\".join(sorted(list(map(str, str(input().rstrip(\"\\n\")).split()))))",
"+ print((\"YES\" if a == \"557\" else \"NO\"))"
] | false
| 0.036561
| 0.036509
| 1.001426
|
[
"s327613120",
"s200757923"
] |
u788703383
|
p02954
|
python
|
s321374813
|
s288918554
| 146
| 110
| 6,424
| 6,400
|
Accepted
|
Accepted
| 24.66
|
s = eval(input())
lenn = len(s)
n_bef = -1
l = []
def add_l(m,n):
global n_bef
p = m - n_bef
q = n-m
l.extend([0] * (p-1))
l.append(-~p//2+q//2)
l.append(p//2+(-~q)//2)
l.extend([0] * (q-1))
n_bef = n
for i in range(lenn-1):
if s[i] == 'R' and s[i+1] == 'L':
m = i
if s[i] == 'L' and s[i+1] == 'R':
n = i
add_l(m,n)
if i == lenn - 2:
n = i + 1
add_l(m,n)
print((*l))
|
s = eval(input())
n = len(s)
answer = [1] * n
for i in range(0,n-2):
if s[i] == 'R' and s[i+1] == 'R':
answer[i+2] += answer[i]
answer[i] = 0
for i in range(n-1,-1,-1):
if s[i] == 'L' and s[i-1] == 'L':
answer[i-2] += answer[i]
answer[i] = 0
print((*answer))
| 24
| 12
| 404
| 276
|
s = eval(input())
lenn = len(s)
n_bef = -1
l = []
def add_l(m, n):
global n_bef
p = m - n_bef
q = n - m
l.extend([0] * (p - 1))
l.append(-~p // 2 + q // 2)
l.append(p // 2 + (-~q) // 2)
l.extend([0] * (q - 1))
n_bef = n
for i in range(lenn - 1):
if s[i] == "R" and s[i + 1] == "L":
m = i
if s[i] == "L" and s[i + 1] == "R":
n = i
add_l(m, n)
if i == lenn - 2:
n = i + 1
add_l(m, n)
print((*l))
|
s = eval(input())
n = len(s)
answer = [1] * n
for i in range(0, n - 2):
if s[i] == "R" and s[i + 1] == "R":
answer[i + 2] += answer[i]
answer[i] = 0
for i in range(n - 1, -1, -1):
if s[i] == "L" and s[i - 1] == "L":
answer[i - 2] += answer[i]
answer[i] = 0
print((*answer))
| false
| 50
|
[
"-lenn = len(s)",
"-n_bef = -1",
"-l = []",
"-",
"-",
"-def add_l(m, n):",
"- global n_bef",
"- p = m - n_bef",
"- q = n - m",
"- l.extend([0] * (p - 1))",
"- l.append(-~p // 2 + q // 2)",
"- l.append(p // 2 + (-~q) // 2)",
"- l.extend([0] * (q - 1))",
"- n_bef = n",
"-",
"-",
"-for i in range(lenn - 1):",
"- if s[i] == \"R\" and s[i + 1] == \"L\":",
"- m = i",
"- if s[i] == \"L\" and s[i + 1] == \"R\":",
"- n = i",
"- add_l(m, n)",
"- if i == lenn - 2:",
"- n = i + 1",
"- add_l(m, n)",
"-print((*l))",
"+n = len(s)",
"+answer = [1] * n",
"+for i in range(0, n - 2):",
"+ if s[i] == \"R\" and s[i + 1] == \"R\":",
"+ answer[i + 2] += answer[i]",
"+ answer[i] = 0",
"+for i in range(n - 1, -1, -1):",
"+ if s[i] == \"L\" and s[i - 1] == \"L\":",
"+ answer[i - 2] += answer[i]",
"+ answer[i] = 0",
"+print((*answer))"
] | false
| 0.048408
| 0.044543
| 1.086763
|
[
"s321374813",
"s288918554"
] |
u780962115
|
p02763
|
python
|
s376856008
|
s895519982
| 1,632
| 1,278
| 391,856
| 604,848
|
Accepted
|
Accepted
| 21.69
|
#セグメント木のverify
class SegTree():
def __init__(self, lists, function, basement):
self.n = len(lists)
self.K = (self.n-1).bit_length()
self.func = function
self.basement = basement
self.seg = [basement]*2**(self.K+1)
for i in range(self.n):
self.seg[i+2**self.K-1] = lists[i]
for i in range(2**(self.K)-2, -1, -1):
self.seg[i] = self.func(self.seg[2*i+1], self.seg[2*i+2])
def update(self, k, value):
# 0-indexでa[k]の値をvalueに変更
k += 2**self.K-1
self.seg[k] = value
while k:
k = (k-1)//2
self.seg[k] = self.func(self.seg[k*2+1], self.seg[k*2+2])
def query(self, p, q):
# 0-indexで[p,q)の値を取得する
if q <= p:
return self.basement
num = 2**self.K
p += num-1
q += num-2
res = self.basement
while q-p > 1:
if p & 1 == 0:
res = self.func(res, self.seg[p])
if q & 1 == 1:
res = self.func(res, self.seg[q])
q -= 1
p = p//2
q = (q-1)//2
if p == q:
res = self.func(res, self.seg[p])
else:
res = self.func(self.func(res, self.seg[p]), self.seg[q])
return res
import sys
input=sys.stdin.readline
N=int(eval(input()))
S=list(eval(input()))
Q=int(eval(input()))
que=[tuple(input().split()) for i in range(Q)]
alpha="abcdefghijklmnopqrstuvwxyz"
Data={alpha[i]:[0]*N for i in range(26)}
for i in range(N):
Data[S[i]][i]+=1
SEG={alpha[i]:SegTree(Data[alpha[i]],max,0) for i in range(26)}
for X,u,v in que:
if X=="1":
u=int(u)-1
NOW=S[u]
S[u]=v
SEG[NOW].update(u,0)
SEG[v].update(u,1)
else:
u,v=int(u)-1,int(v)-1
res=0
for j in range(26):
res+=SEG[alpha[j]].query(u,v+1)
print(res)
|
class SegTree():
def __init__(self, lists, function, basement):
self.n = len(lists)
self.K = (self.n-1).bit_length()
self.func = function
self.basement = basement
self.seg = [basement]*2**(self.K+1)
self.lazy_seg = [basement]*2**(self.K+1)
X=2**self.K
for i,v in enumerate(lists):
self.seg[i+X-1] = v
for i in range(2*X-2, 0, -2):
self.seg[(i-1)>>1] = self.func(self.seg[i], self.seg[i-1])
def update(self, k, value):
# 0-indexでa[k]の値をvalueに変更
X=2**self.K
k += X-1
self.seg[k] = value
while k:
k = (k-1)>>1
self.seg[k] = self.func(self.seg[(k<<1)+1], self.seg[(k<<1)+2])
def query(self, p, q):
# 0-indexで[p,q)の値を取得する
if q <= p:
return self.basement
num = 2**self.K
p += num-1
q += num-2
res = self.basement
while q-p > 1:
if p & 1 == 0:
res = self.func(res, self.seg[p])
if q & 1 == 1:
res = self.func(res, self.seg[q])
q -= 1
p = p>>1
q = (q-1)>>1
if p == q:
res = self.func(res, self.seg[p])
else:
res = self.func(self.func(res, self.seg[p]), self.seg[q])
return res
import sys
input=sys.stdin.readline
N=int(eval(input()))
S=list(eval(input()))
Q=int(eval(input()))
que=[tuple(input().split()) for i in range(Q)]
alpha="abcdefghijklmnopqrstuvwxyz"
Data={alpha[i]:[0]*N for i in range(26)}
for i in range(N):
Data[S[i]][i]+=1
SEG={alpha[i]:SegTree(Data[alpha[i]],max,0) for i in range(26)}
for X,u,v in que:
if X=="1":
u=int(u)-1
NOW=S[u]
S[u]=v
SEG[NOW].update(u,0)
SEG[v].update(u,1)
else:
u,v=int(u)-1,int(v)-1
res=0
for j in range(26):
res+=SEG[alpha[j]].query(u,v+1)
print(res)
| 74
| 76
| 2,003
| 2,072
|
# セグメント木のverify
class SegTree:
def __init__(self, lists, function, basement):
self.n = len(lists)
self.K = (self.n - 1).bit_length()
self.func = function
self.basement = basement
self.seg = [basement] * 2 ** (self.K + 1)
for i in range(self.n):
self.seg[i + 2**self.K - 1] = lists[i]
for i in range(2 ** (self.K) - 2, -1, -1):
self.seg[i] = self.func(self.seg[2 * i + 1], self.seg[2 * i + 2])
def update(self, k, value):
# 0-indexでa[k]の値をvalueに変更
k += 2**self.K - 1
self.seg[k] = value
while k:
k = (k - 1) // 2
self.seg[k] = self.func(self.seg[k * 2 + 1], self.seg[k * 2 + 2])
def query(self, p, q):
# 0-indexで[p,q)の値を取得する
if q <= p:
return self.basement
num = 2**self.K
p += num - 1
q += num - 2
res = self.basement
while q - p > 1:
if p & 1 == 0:
res = self.func(res, self.seg[p])
if q & 1 == 1:
res = self.func(res, self.seg[q])
q -= 1
p = p // 2
q = (q - 1) // 2
if p == q:
res = self.func(res, self.seg[p])
else:
res = self.func(self.func(res, self.seg[p]), self.seg[q])
return res
import sys
input = sys.stdin.readline
N = int(eval(input()))
S = list(eval(input()))
Q = int(eval(input()))
que = [tuple(input().split()) for i in range(Q)]
alpha = "abcdefghijklmnopqrstuvwxyz"
Data = {alpha[i]: [0] * N for i in range(26)}
for i in range(N):
Data[S[i]][i] += 1
SEG = {alpha[i]: SegTree(Data[alpha[i]], max, 0) for i in range(26)}
for X, u, v in que:
if X == "1":
u = int(u) - 1
NOW = S[u]
S[u] = v
SEG[NOW].update(u, 0)
SEG[v].update(u, 1)
else:
u, v = int(u) - 1, int(v) - 1
res = 0
for j in range(26):
res += SEG[alpha[j]].query(u, v + 1)
print(res)
|
class SegTree:
def __init__(self, lists, function, basement):
self.n = len(lists)
self.K = (self.n - 1).bit_length()
self.func = function
self.basement = basement
self.seg = [basement] * 2 ** (self.K + 1)
self.lazy_seg = [basement] * 2 ** (self.K + 1)
X = 2**self.K
for i, v in enumerate(lists):
self.seg[i + X - 1] = v
for i in range(2 * X - 2, 0, -2):
self.seg[(i - 1) >> 1] = self.func(self.seg[i], self.seg[i - 1])
def update(self, k, value):
# 0-indexでa[k]の値をvalueに変更
X = 2**self.K
k += X - 1
self.seg[k] = value
while k:
k = (k - 1) >> 1
self.seg[k] = self.func(self.seg[(k << 1) + 1], self.seg[(k << 1) + 2])
def query(self, p, q):
# 0-indexで[p,q)の値を取得する
if q <= p:
return self.basement
num = 2**self.K
p += num - 1
q += num - 2
res = self.basement
while q - p > 1:
if p & 1 == 0:
res = self.func(res, self.seg[p])
if q & 1 == 1:
res = self.func(res, self.seg[q])
q -= 1
p = p >> 1
q = (q - 1) >> 1
if p == q:
res = self.func(res, self.seg[p])
else:
res = self.func(self.func(res, self.seg[p]), self.seg[q])
return res
import sys
input = sys.stdin.readline
N = int(eval(input()))
S = list(eval(input()))
Q = int(eval(input()))
que = [tuple(input().split()) for i in range(Q)]
alpha = "abcdefghijklmnopqrstuvwxyz"
Data = {alpha[i]: [0] * N for i in range(26)}
for i in range(N):
Data[S[i]][i] += 1
SEG = {alpha[i]: SegTree(Data[alpha[i]], max, 0) for i in range(26)}
for X, u, v in que:
if X == "1":
u = int(u) - 1
NOW = S[u]
S[u] = v
SEG[NOW].update(u, 0)
SEG[v].update(u, 1)
else:
u, v = int(u) - 1, int(v) - 1
res = 0
for j in range(26):
res += SEG[alpha[j]].query(u, v + 1)
print(res)
| false
| 2.631579
|
[
"-# セグメント木のverify",
"- for i in range(self.n):",
"- self.seg[i + 2**self.K - 1] = lists[i]",
"- for i in range(2 ** (self.K) - 2, -1, -1):",
"- self.seg[i] = self.func(self.seg[2 * i + 1], self.seg[2 * i + 2])",
"+ self.lazy_seg = [basement] * 2 ** (self.K + 1)",
"+ X = 2**self.K",
"+ for i, v in enumerate(lists):",
"+ self.seg[i + X - 1] = v",
"+ for i in range(2 * X - 2, 0, -2):",
"+ self.seg[(i - 1) >> 1] = self.func(self.seg[i], self.seg[i - 1])",
"- k += 2**self.K - 1",
"+ X = 2**self.K",
"+ k += X - 1",
"- k = (k - 1) // 2",
"- self.seg[k] = self.func(self.seg[k * 2 + 1], self.seg[k * 2 + 2])",
"+ k = (k - 1) >> 1",
"+ self.seg[k] = self.func(self.seg[(k << 1) + 1], self.seg[(k << 1) + 2])",
"- p = p // 2",
"- q = (q - 1) // 2",
"+ p = p >> 1",
"+ q = (q - 1) >> 1"
] | false
| 0.068232
| 0.037105
| 1.838921
|
[
"s376856008",
"s895519982"
] |
u726615467
|
p03575
|
python
|
s971368537
|
s568620457
| 1,933
| 590
| 3,064
| 3,064
|
Accepted
|
Accepted
| 69.48
|
# encoding: utf-8
N, M = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(M)]
route = [[] for i in range(N)]
for ai, bi in ab:
route[ai - 1].append(bi - 1)
route[bi - 1].append(ai - 1)
def walk(pos, pos_prev, footprint):
# print("#", pos, footprint)
footprint = (2 ** pos) | footprint
ret = footprint
for pos_next in route[pos]:
# print("##", pos_next, (2 ** pos_next) & footprint)
if (2 ** pos_next) & footprint > 0: continue
ret = ret | walk(pos_next, pos, footprint)
return ret
ans = 0
for ai, bi in ab:
# temporary remove
route[ai - 1].remove(bi - 1)
route[bi - 1].remove(ai - 1)
# connection check
if walk(0, -1, 0) < (2 ** N - 1): ans += 1
# recovery
route[ai - 1].append(bi - 1)
route[bi - 1].append(ai - 1)
print(ans)
|
# encoding: utf-8
N, M = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(M)]
route = [[] for i in range(N)]
for ai, bi in ab:
route[ai - 1].append(bi - 1)
route[bi - 1].append(ai - 1)
def walk(pos, pos_prev, footprint):
# print("#", pos, footprint)
footprint = (2 ** pos) | footprint
ret = footprint
for pos_next in route[pos]:
# print("##", pos_next, (2 ** pos_next) & footprint)
if (2 ** pos_next) & footprint > 0: continue
ret = ret | walk(pos_next, pos, footprint)
if ret == (2 ** N - 1): return 2 ** N - 1 # speed test
return ret
ans = 0
for ai, bi in ab:
# temporary remove
route[ai - 1].remove(bi - 1)
route[bi - 1].remove(ai - 1)
# connection check
if walk(0, -1, 0) < (2 ** N - 1): ans += 1
# recovery
route[ai - 1].append(bi - 1)
route[bi - 1].append(ai - 1)
print(ans)
| 32
| 33
| 876
| 940
|
# encoding: utf-8
N, M = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(M)]
route = [[] for i in range(N)]
for ai, bi in ab:
route[ai - 1].append(bi - 1)
route[bi - 1].append(ai - 1)
def walk(pos, pos_prev, footprint):
# print("#", pos, footprint)
footprint = (2**pos) | footprint
ret = footprint
for pos_next in route[pos]:
# print("##", pos_next, (2 ** pos_next) & footprint)
if (2**pos_next) & footprint > 0:
continue
ret = ret | walk(pos_next, pos, footprint)
return ret
ans = 0
for ai, bi in ab:
# temporary remove
route[ai - 1].remove(bi - 1)
route[bi - 1].remove(ai - 1)
# connection check
if walk(0, -1, 0) < (2**N - 1):
ans += 1
# recovery
route[ai - 1].append(bi - 1)
route[bi - 1].append(ai - 1)
print(ans)
|
# encoding: utf-8
N, M = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(M)]
route = [[] for i in range(N)]
for ai, bi in ab:
route[ai - 1].append(bi - 1)
route[bi - 1].append(ai - 1)
def walk(pos, pos_prev, footprint):
# print("#", pos, footprint)
footprint = (2**pos) | footprint
ret = footprint
for pos_next in route[pos]:
# print("##", pos_next, (2 ** pos_next) & footprint)
if (2**pos_next) & footprint > 0:
continue
ret = ret | walk(pos_next, pos, footprint)
if ret == (2**N - 1):
return 2**N - 1 # speed test
return ret
ans = 0
for ai, bi in ab:
# temporary remove
route[ai - 1].remove(bi - 1)
route[bi - 1].remove(ai - 1)
# connection check
if walk(0, -1, 0) < (2**N - 1):
ans += 1
# recovery
route[ai - 1].append(bi - 1)
route[bi - 1].append(ai - 1)
print(ans)
| false
| 3.030303
|
[
"+ if ret == (2**N - 1):",
"+ return 2**N - 1 # speed test"
] | false
| 0.038008
| 0.007188
| 5.287847
|
[
"s971368537",
"s568620457"
] |
u644907318
|
p03524
|
python
|
s086056783
|
s828273342
| 171
| 69
| 39,280
| 73,060
|
Accepted
|
Accepted
| 59.65
|
S = input().strip()
N = len(S)
C = {"a":0,"b":0,"c":0}
for i in range(N):
C[S[i]] += 1
na = C["a"]
nb = C["b"]
nc = C["c"]
if max(na,nb,nc)-min(na,nb,nc)<=1:
print("YES")
else:
print("NO")
|
S = input().strip()
if len(S)==1:
print("YES")
elif len(S)==2:
if S[0]!=S[1]:
print("YES")
else:
print("NO")
elif len(S)==3:
if S[0]!=S[1] and S[1]!=S[2] and S[2]!=S[0]:
print("YES")
else:
print("NO")
else:
C = {"a":0,"b":0,"c":0}
for i in range(len(S)):
C[S[i]] += 1
if len(S)%3==0:
if C["a"]==C["b"]==C["c"]:
print("YES")
else:
print("NO")
else:
if max(C["a"],C["b"],C["c"])==len(S)//3+1 and min(C["a"],C["b"],C["c"])==len(S)//3:
print("YES")
else:
print("NO")
| 12
| 28
| 211
| 654
|
S = input().strip()
N = len(S)
C = {"a": 0, "b": 0, "c": 0}
for i in range(N):
C[S[i]] += 1
na = C["a"]
nb = C["b"]
nc = C["c"]
if max(na, nb, nc) - min(na, nb, nc) <= 1:
print("YES")
else:
print("NO")
|
S = input().strip()
if len(S) == 1:
print("YES")
elif len(S) == 2:
if S[0] != S[1]:
print("YES")
else:
print("NO")
elif len(S) == 3:
if S[0] != S[1] and S[1] != S[2] and S[2] != S[0]:
print("YES")
else:
print("NO")
else:
C = {"a": 0, "b": 0, "c": 0}
for i in range(len(S)):
C[S[i]] += 1
if len(S) % 3 == 0:
if C["a"] == C["b"] == C["c"]:
print("YES")
else:
print("NO")
else:
if (
max(C["a"], C["b"], C["c"]) == len(S) // 3 + 1
and min(C["a"], C["b"], C["c"]) == len(S) // 3
):
print("YES")
else:
print("NO")
| false
| 57.142857
|
[
"-N = len(S)",
"-C = {\"a\": 0, \"b\": 0, \"c\": 0}",
"-for i in range(N):",
"- C[S[i]] += 1",
"-na = C[\"a\"]",
"-nb = C[\"b\"]",
"-nc = C[\"c\"]",
"-if max(na, nb, nc) - min(na, nb, nc) <= 1:",
"+if len(S) == 1:",
"+elif len(S) == 2:",
"+ if S[0] != S[1]:",
"+ print(\"YES\")",
"+ else:",
"+ print(\"NO\")",
"+elif len(S) == 3:",
"+ if S[0] != S[1] and S[1] != S[2] and S[2] != S[0]:",
"+ print(\"YES\")",
"+ else:",
"+ print(\"NO\")",
"- print(\"NO\")",
"+ C = {\"a\": 0, \"b\": 0, \"c\": 0}",
"+ for i in range(len(S)):",
"+ C[S[i]] += 1",
"+ if len(S) % 3 == 0:",
"+ if C[\"a\"] == C[\"b\"] == C[\"c\"]:",
"+ print(\"YES\")",
"+ else:",
"+ print(\"NO\")",
"+ else:",
"+ if (",
"+ max(C[\"a\"], C[\"b\"], C[\"c\"]) == len(S) // 3 + 1",
"+ and min(C[\"a\"], C[\"b\"], C[\"c\"]) == len(S) // 3",
"+ ):",
"+ print(\"YES\")",
"+ else:",
"+ print(\"NO\")"
] | false
| 0.185087
| 0.057647
| 3.210669
|
[
"s086056783",
"s828273342"
] |
u419686324
|
p03089
|
python
|
s896643172
|
s883369066
| 93
| 19
| 3,804
| 3,064
|
Accepted
|
Accepted
| 79.57
|
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import sys
from itertools import chain
from functools import reduce
from collections import OrderedDict, Counter, deque
import operator
def IA(): return [int(x) for x in input().split()]
def IM(N): return [IA() for _ in range(N)]
N = int(input())
B = IA()
sys.setrecursionlimit(500)
def f(b, n):
if n == 0:
return []
for i, x in enumerate(b, 1):
if i < x or n < x:
return None
for i, x in enumerate(b, 1):
if i == x:
ret = f(tuple(b[:i-1] + b[i:]), n-1)
if ret is not None:
return ret + [i]
return None
ans = f(B, N)
if ans:
print(*ans, sep="\n")
else:
print(-1)
|
#!/bin/env python3
IS = lambda: int(input())
IA = lambda: [int(x) for x in input().split()]
N = IS()
B = IA()
def f(b, n):
ans = []
while b:
for i in range(len(b), 0, -1):
j = i - 1
if i == b[j]:
ans.append(i)
b = b[:j] + b[j+1:]
break
else:
return None
return list(reversed(ans))
ans = f(B, N)
if ans:
print(*ans, sep="\n")
else:
print(-1)
| 41
| 26
| 762
| 490
|
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import sys
from itertools import chain
from functools import reduce
from collections import OrderedDict, Counter, deque
import operator
def IA():
return [int(x) for x in input().split()]
def IM(N):
return [IA() for _ in range(N)]
N = int(input())
B = IA()
sys.setrecursionlimit(500)
def f(b, n):
if n == 0:
return []
for i, x in enumerate(b, 1):
if i < x or n < x:
return None
for i, x in enumerate(b, 1):
if i == x:
ret = f(tuple(b[: i - 1] + b[i:]), n - 1)
if ret is not None:
return ret + [i]
return None
ans = f(B, N)
if ans:
print(*ans, sep="\n")
else:
print(-1)
|
#!/bin/env python3
IS = lambda: int(input())
IA = lambda: [int(x) for x in input().split()]
N = IS()
B = IA()
def f(b, n):
ans = []
while b:
for i in range(len(b), 0, -1):
j = i - 1
if i == b[j]:
ans.append(i)
b = b[:j] + b[j + 1 :]
break
else:
return None
return list(reversed(ans))
ans = f(B, N)
if ans:
print(*ans, sep="\n")
else:
print(-1)
| false
| 36.585366
|
[
"-#!/usr/bin/env python3",
"-# -*- coding: utf-8 -*-",
"-import sys",
"-from itertools import chain",
"-from functools import reduce",
"-from collections import OrderedDict, Counter, deque",
"-import operator",
"-",
"-",
"-def IA():",
"- return [int(x) for x in input().split()]",
"-",
"-",
"-def IM(N):",
"- return [IA() for _ in range(N)]",
"-",
"-",
"-N = int(input())",
"+#!/bin/env python3",
"+IS = lambda: int(input())",
"+IA = lambda: [int(x) for x in input().split()]",
"+N = IS()",
"-sys.setrecursionlimit(500)",
"- if n == 0:",
"- return []",
"- for i, x in enumerate(b, 1):",
"- if i < x or n < x:",
"+ ans = []",
"+ while b:",
"+ for i in range(len(b), 0, -1):",
"+ j = i - 1",
"+ if i == b[j]:",
"+ ans.append(i)",
"+ b = b[:j] + b[j + 1 :]",
"+ break",
"+ else:",
"- for i, x in enumerate(b, 1):",
"- if i == x:",
"- ret = f(tuple(b[: i - 1] + b[i:]), n - 1)",
"- if ret is not None:",
"- return ret + [i]",
"- return None",
"+ return list(reversed(ans))"
] | false
| 0.034966
| 0.044675
| 0.782672
|
[
"s896643172",
"s883369066"
] |
u557565572
|
p02761
|
python
|
s946239247
|
s071977312
| 286
| 17
| 20,000
| 3,064
|
Accepted
|
Accepted
| 94.06
|
# import math
# import bisect
# import heapq
# from collections import deque
import numpy as np
n, m = list(map(int, input().split()))
s, c = [0] * m, [0] * m
for i in range(m):
s[i], c[i] = list(map(int, input().split()))
# replace = [False] * n
number = ['a'] * n
ans = 0
for i in range(m):
if number[s[i]-1] != 'a' and str(c[i]) != number[s[i]-1]:
ans = -1
break
number[s[i]-1] = str(c[i])
if not ans == -1:
for i in range(n):
if i == 0 and number[i] == 'a' and len(number) != 1:
number[0] = '1'
elif number[i] == 'a':
number[i] = '0'
ans = ''.join(number)
if n != 1 and number[0] == '0':
ans = -1
print(ans)
|
# import math
# import bisect
# import heapq
# from collections import deque
# import numpy as np
n, m = list(map(int, input().split()))
ans = [-1] * n
safe = True
for i in range(m):
s,c = list(map(int, input().split()))
if (n!=1 and s==1 and c==0) or (ans[s-1]!=-1 and c != ans[s-1]):
safe = False
ans[s-1] = c
if safe:
for i in range(n):
if n!=1 and ans[0]==-1 and i==0:
ans[0] = 1
elif ans[i] == -1:
ans[i] = 0
print((''.join(str(n) for n in ans)))
else: print((-1))
| 35
| 30
| 730
| 560
|
# import math
# import bisect
# import heapq
# from collections import deque
import numpy as np
n, m = list(map(int, input().split()))
s, c = [0] * m, [0] * m
for i in range(m):
s[i], c[i] = list(map(int, input().split()))
# replace = [False] * n
number = ["a"] * n
ans = 0
for i in range(m):
if number[s[i] - 1] != "a" and str(c[i]) != number[s[i] - 1]:
ans = -1
break
number[s[i] - 1] = str(c[i])
if not ans == -1:
for i in range(n):
if i == 0 and number[i] == "a" and len(number) != 1:
number[0] = "1"
elif number[i] == "a":
number[i] = "0"
ans = "".join(number)
if n != 1 and number[0] == "0":
ans = -1
print(ans)
|
# import math
# import bisect
# import heapq
# from collections import deque
# import numpy as np
n, m = list(map(int, input().split()))
ans = [-1] * n
safe = True
for i in range(m):
s, c = list(map(int, input().split()))
if (n != 1 and s == 1 and c == 0) or (ans[s - 1] != -1 and c != ans[s - 1]):
safe = False
ans[s - 1] = c
if safe:
for i in range(n):
if n != 1 and ans[0] == -1 and i == 0:
ans[0] = 1
elif ans[i] == -1:
ans[i] = 0
print(("".join(str(n) for n in ans)))
else:
print((-1))
| false
| 14.285714
|
[
"-import numpy as np",
"-",
"+# import numpy as np",
"-s, c = [0] * m, [0] * m",
"+ans = [-1] * n",
"+safe = True",
"- s[i], c[i] = list(map(int, input().split()))",
"-# replace = [False] * n",
"-number = [\"a\"] * n",
"-ans = 0",
"-for i in range(m):",
"- if number[s[i] - 1] != \"a\" and str(c[i]) != number[s[i] - 1]:",
"- ans = -1",
"- break",
"- number[s[i] - 1] = str(c[i])",
"-if not ans == -1:",
"+ s, c = list(map(int, input().split()))",
"+ if (n != 1 and s == 1 and c == 0) or (ans[s - 1] != -1 and c != ans[s - 1]):",
"+ safe = False",
"+ ans[s - 1] = c",
"+if safe:",
"- if i == 0 and number[i] == \"a\" and len(number) != 1:",
"- number[0] = \"1\"",
"- elif number[i] == \"a\":",
"- number[i] = \"0\"",
"- ans = \"\".join(number)",
"- if n != 1 and number[0] == \"0\":",
"- ans = -1",
"-print(ans)",
"+ if n != 1 and ans[0] == -1 and i == 0:",
"+ ans[0] = 1",
"+ elif ans[i] == -1:",
"+ ans[i] = 0",
"+ print((\"\".join(str(n) for n in ans)))",
"+else:",
"+ print((-1))"
] | false
| 0.074837
| 0.036063
| 2.075184
|
[
"s946239247",
"s071977312"
] |
u054825571
|
p03045
|
python
|
s740897615
|
s957705293
| 435
| 355
| 19,136
| 13,488
|
Accepted
|
Accepted
| 18.39
|
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1]*n
self.rank = [0]*n
def find(self, x):
if self.root[x-1] < 0:
return x
else:
self.root[x-1] = self.find(self.root[x-1])
return self.root[x-1]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x==y:
return
elif self.rank[x-1] > self.rank[y-1]:
self.root[x-1] += self.root[y-1]
self.root[y-1] = x
else:
self.root[y-1] += self.root[x-1]
self.root[x-1] = y
if self.rank[x-1] == self.rank[y-1]:
self.rank[y-1] += 1
def same(self, x, y):
return self.find(x)==self.find(y)
def count(self, x):
return -self.root[self.find(x)-1]
N,M=list(map(int,input().split()))
uf=UnionFind(N)
for i in range(M):
x,y,z=list(map(int,input().split()))
uf.unite(x,y)
s=set()
ans=0
for i in range(1,N+1):
if uf.find(i) not in s:
s.add(uf.find(i))
ans+=1
print(ans)
|
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1]*n
self.rank = [0]*n
def find(self, x):
if self.root[x-1] < 0:
return x
else:
self.root[x-1] = self.find(self.root[x-1])
return self.root[x-1]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x==y:
return
elif self.rank[x-1] > self.rank[y-1]:
self.root[x-1] += self.root[y-1]
self.root[y-1] = x
self.n-=1
else:
self.n-=1
self.root[y-1] += self.root[x-1]
self.root[x-1] = y
if self.rank[x-1] == self.rank[y-1]:
self.rank[y-1] += 1
def same(self, x, y):
return self.find(x)==self.find(y)
def count(self, x):
return -self.root[self.find(x)-1]
def num(self):
return self.n
N,M=list(map(int,input().split()))
uf=UnionFind(N)
for i in range(M):
x,y,z=list(map(int,input().split()))
uf.unite(x,y)
print((uf.num()))
| 45
| 43
| 1,122
| 1,105
|
class UnionFind:
def __init__(self, n):
self.n = n
self.root = [-1] * n
self.rank = [0] * n
def find(self, x):
if self.root[x - 1] < 0:
return x
else:
self.root[x - 1] = self.find(self.root[x - 1])
return self.root[x - 1]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
elif self.rank[x - 1] > self.rank[y - 1]:
self.root[x - 1] += self.root[y - 1]
self.root[y - 1] = x
else:
self.root[y - 1] += self.root[x - 1]
self.root[x - 1] = y
if self.rank[x - 1] == self.rank[y - 1]:
self.rank[y - 1] += 1
def same(self, x, y):
return self.find(x) == self.find(y)
def count(self, x):
return -self.root[self.find(x) - 1]
N, M = list(map(int, input().split()))
uf = UnionFind(N)
for i in range(M):
x, y, z = list(map(int, input().split()))
uf.unite(x, y)
s = set()
ans = 0
for i in range(1, N + 1):
if uf.find(i) not in s:
s.add(uf.find(i))
ans += 1
print(ans)
|
class UnionFind:
def __init__(self, n):
self.n = n
self.root = [-1] * n
self.rank = [0] * n
def find(self, x):
if self.root[x - 1] < 0:
return x
else:
self.root[x - 1] = self.find(self.root[x - 1])
return self.root[x - 1]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
elif self.rank[x - 1] > self.rank[y - 1]:
self.root[x - 1] += self.root[y - 1]
self.root[y - 1] = x
self.n -= 1
else:
self.n -= 1
self.root[y - 1] += self.root[x - 1]
self.root[x - 1] = y
if self.rank[x - 1] == self.rank[y - 1]:
self.rank[y - 1] += 1
def same(self, x, y):
return self.find(x) == self.find(y)
def count(self, x):
return -self.root[self.find(x) - 1]
def num(self):
return self.n
N, M = list(map(int, input().split()))
uf = UnionFind(N)
for i in range(M):
x, y, z = list(map(int, input().split()))
uf.unite(x, y)
print((uf.num()))
| false
| 4.444444
|
[
"+ self.n -= 1",
"+ self.n -= 1",
"+ def num(self):",
"+ return self.n",
"+",
"-s = set()",
"-ans = 0",
"-for i in range(1, N + 1):",
"- if uf.find(i) not in s:",
"- s.add(uf.find(i))",
"- ans += 1",
"-print(ans)",
"+print((uf.num()))"
] | false
| 0.049688
| 0.040542
| 1.225608
|
[
"s740897615",
"s957705293"
] |
u808799019
|
p02796
|
python
|
s736916529
|
s594595674
| 433
| 294
| 16,988
| 16,960
|
Accepted
|
Accepted
| 32.1
|
N = int(eval(input()))
robots, count = [], 0
for x in range(N):
X, L = list(map(int, input().split()))
robots.append((X+L, X-L))
robots.sort()
node = -10**12
for end, start in robots:
if start >= node:
node = end
count += 1
print(count)
|
import sys
input = sys.stdin.readline
n = int(eval(input()))
robots = []
for i in range(n):
x, l = [int(item) for item in input().split()]
robots.append((x+l, x-l))
robots.sort()
cnt = 0
node = -10**12
for end, start in robots:
if start >= node:
node = end
cnt += 1
print(cnt)
| 12
| 18
| 263
| 321
|
N = int(eval(input()))
robots, count = [], 0
for x in range(N):
X, L = list(map(int, input().split()))
robots.append((X + L, X - L))
robots.sort()
node = -(10**12)
for end, start in robots:
if start >= node:
node = end
count += 1
print(count)
|
import sys
input = sys.stdin.readline
n = int(eval(input()))
robots = []
for i in range(n):
x, l = [int(item) for item in input().split()]
robots.append((x + l, x - l))
robots.sort()
cnt = 0
node = -(10**12)
for end, start in robots:
if start >= node:
node = end
cnt += 1
print(cnt)
| false
| 33.333333
|
[
"-N = int(eval(input()))",
"-robots, count = [], 0",
"-for x in range(N):",
"- X, L = list(map(int, input().split()))",
"- robots.append((X + L, X - L))",
"+import sys",
"+",
"+input = sys.stdin.readline",
"+n = int(eval(input()))",
"+robots = []",
"+for i in range(n):",
"+ x, l = [int(item) for item in input().split()]",
"+ robots.append((x + l, x - l))",
"+cnt = 0",
"- count += 1",
"-print(count)",
"+ cnt += 1",
"+print(cnt)"
] | false
| 0.036392
| 0.036418
| 0.999293
|
[
"s736916529",
"s594595674"
] |
u187516587
|
p02762
|
python
|
s178276602
|
s937856328
| 956
| 853
| 38,744
| 13,340
|
Accepted
|
Accepted
| 10.77
|
import sys
def input():
return sys.stdin.readline()[:-1]
sys.setrecursionlimit(200000)
class uf:
def __init__(self,n):
self.n=n
self.l=[-1]*n
def ro(self,n):
if self.l[n]<0:
return n
r=self.ro(self.l[n])
self.l[n]=r
return r
def me(self,a,b):
ra=self.ro(a)
rb=self.ro(b)
if ra!=rb:
self.l[ra]+=self.l[rb]
self.l[rb]=ra
def size(self,n):
return -self.l[self.ro(n)]
def sa(self,a,b):
return self.ro(a)==self.ro(b)
N,M,K=list(map(int,input().split()))
u=uf(N)
l=[-1]*N
for i in range(M):
A,B=[int(x)-1 for x in input().split()]
u.me(A,B)
l[A]-=1
l[B]-=1
for i in range(N):
l[i]+=u.size(i)
for i in range(K):
C,D=[int(x)-1 for x in input().split()]
if u.sa(C,D):
l[C]-=1
l[D]-=1
print((*l))
|
import sys
def input():
return sys.stdin.readline()[:-1]
sys.setrecursionlimit(200000)
class uf:
def __init__(self,n):
self.n=n
self.l=[-1]*n
def ro(self,n):
if self.l[n]<0:
return n
r=self.ro(self.l[n])
self.l[n]=r
return r
def me(self,a,b):
ra=self.ro(a)
rb=self.ro(b)
if self.l[ra]>self.l[rb]:
ra,rb=rb,ra
if ra!=rb:
self.l[ra]+=self.l[rb]
self.l[rb]=ra
def size(self,n):
return -self.l[self.ro(n)]
def sa(self,a,b):
return self.ro(a)==self.ro(b)
N,M,K=list(map(int,input().split()))
u=uf(N)
l=[-1]*N
for i in range(M):
A,B=[int(x)-1 for x in input().split()]
u.me(A,B)
l[A]-=1
l[B]-=1
for i in range(N):
l[i]+=u.size(i)
for i in range(K):
C,D=[int(x)-1 for x in input().split()]
if u.sa(C,D):
l[C]-=1
l[D]-=1
print((*l))
| 40
| 42
| 918
| 977
|
import sys
def input():
return sys.stdin.readline()[:-1]
sys.setrecursionlimit(200000)
class uf:
def __init__(self, n):
self.n = n
self.l = [-1] * n
def ro(self, n):
if self.l[n] < 0:
return n
r = self.ro(self.l[n])
self.l[n] = r
return r
def me(self, a, b):
ra = self.ro(a)
rb = self.ro(b)
if ra != rb:
self.l[ra] += self.l[rb]
self.l[rb] = ra
def size(self, n):
return -self.l[self.ro(n)]
def sa(self, a, b):
return self.ro(a) == self.ro(b)
N, M, K = list(map(int, input().split()))
u = uf(N)
l = [-1] * N
for i in range(M):
A, B = [int(x) - 1 for x in input().split()]
u.me(A, B)
l[A] -= 1
l[B] -= 1
for i in range(N):
l[i] += u.size(i)
for i in range(K):
C, D = [int(x) - 1 for x in input().split()]
if u.sa(C, D):
l[C] -= 1
l[D] -= 1
print((*l))
|
import sys
def input():
return sys.stdin.readline()[:-1]
sys.setrecursionlimit(200000)
class uf:
def __init__(self, n):
self.n = n
self.l = [-1] * n
def ro(self, n):
if self.l[n] < 0:
return n
r = self.ro(self.l[n])
self.l[n] = r
return r
def me(self, a, b):
ra = self.ro(a)
rb = self.ro(b)
if self.l[ra] > self.l[rb]:
ra, rb = rb, ra
if ra != rb:
self.l[ra] += self.l[rb]
self.l[rb] = ra
def size(self, n):
return -self.l[self.ro(n)]
def sa(self, a, b):
return self.ro(a) == self.ro(b)
N, M, K = list(map(int, input().split()))
u = uf(N)
l = [-1] * N
for i in range(M):
A, B = [int(x) - 1 for x in input().split()]
u.me(A, B)
l[A] -= 1
l[B] -= 1
for i in range(N):
l[i] += u.size(i)
for i in range(K):
C, D = [int(x) - 1 for x in input().split()]
if u.sa(C, D):
l[C] -= 1
l[D] -= 1
print((*l))
| false
| 4.761905
|
[
"+ if self.l[ra] > self.l[rb]:",
"+ ra, rb = rb, ra"
] | false
| 0.156899
| 0.050151
| 3.128546
|
[
"s178276602",
"s937856328"
] |
u823513038
|
p02394
|
python
|
s305228234
|
s489782367
| 60
| 20
| 7,652
| 5,592
|
Accepted
|
Accepted
| 66.67
|
w, h, x, y, r = list(map(int, input().split()))
if(min([x, y, w - x, h - y]) >= r):
print("Yes")
else:
print("No")
|
W, H, x, y, r = list(map(int, input().split()))
if x < r or y < r or W - x < r or H - y < r:
print("No")
else:
print("Yes")
| 5
| 5
| 120
| 124
|
w, h, x, y, r = list(map(int, input().split()))
if min([x, y, w - x, h - y]) >= r:
print("Yes")
else:
print("No")
|
W, H, x, y, r = list(map(int, input().split()))
if x < r or y < r or W - x < r or H - y < r:
print("No")
else:
print("Yes")
| false
| 0
|
[
"-w, h, x, y, r = list(map(int, input().split()))",
"-if min([x, y, w - x, h - y]) >= r:",
"+W, H, x, y, r = list(map(int, input().split()))",
"+if x < r or y < r or W - x < r or H - y < r:",
"+ print(\"No\")",
"+else:",
"-else:",
"- print(\"No\")"
] | false
| 0.076367
| 0.04335
| 1.761647
|
[
"s305228234",
"s489782367"
] |
u279955105
|
p02394
|
python
|
s897863786
|
s818339803
| 50
| 20
| 7,576
| 7,672
|
Accepted
|
Accepted
| 60
|
W,H,x,y,r = list(map(int, input().split()))
if ((0 <= x-r) and (r+x <= W)) and ((0 <= y-r) and (r+y <= H)):
print("Yes")
else:
print("No")
|
W,H,x,y,r = list(map(int, input().split()))
if (0 <= x-r and x+r <= W) and (0 <= y-r and y+r <= H):
print('Yes')
else:
print('No')
| 5
| 5
| 144
| 142
|
W, H, x, y, r = list(map(int, input().split()))
if ((0 <= x - r) and (r + x <= W)) and ((0 <= y - r) and (r + y <= H)):
print("Yes")
else:
print("No")
|
W, H, x, y, r = list(map(int, input().split()))
if (0 <= x - r and x + r <= W) and (0 <= y - r and y + r <= H):
print("Yes")
else:
print("No")
| false
| 0
|
[
"-if ((0 <= x - r) and (r + x <= W)) and ((0 <= y - r) and (r + y <= H)):",
"+if (0 <= x - r and x + r <= W) and (0 <= y - r and y + r <= H):"
] | false
| 0.059193
| 0.074022
| 0.799671
|
[
"s897863786",
"s818339803"
] |
u048868255
|
p03238
|
python
|
s130822897
|
s277991679
| 21
| 18
| 3,060
| 2,940
|
Accepted
|
Accepted
| 14.29
|
N = eval(input())
if int(N) == 1:
print("Hello World")
else:
A = int(eval(input()))
B = int(eval(input()))
print((A + B))
|
N = int(eval(input()))
if N == 1:
print("Hello World")
else:
A = int(eval(input()))
B = int(eval(input()))
print((A + B))
| 8
| 8
| 133
| 133
|
N = eval(input())
if int(N) == 1:
print("Hello World")
else:
A = int(eval(input()))
B = int(eval(input()))
print((A + B))
|
N = int(eval(input()))
if N == 1:
print("Hello World")
else:
A = int(eval(input()))
B = int(eval(input()))
print((A + B))
| false
| 0
|
[
"-N = eval(input())",
"-if int(N) == 1:",
"+N = int(eval(input()))",
"+if N == 1:"
] | false
| 0.007892
| 0.036518
| 0.216103
|
[
"s130822897",
"s277991679"
] |
u498487134
|
p02937
|
python
|
s660767133
|
s069038734
| 269
| 98
| 46,188
| 79,628
|
Accepted
|
Accepted
| 63.57
|
#dictでよかったかも？
import bisect
s=eval(input())
t=eval(input())
#a,b,cの出てきたところを小さい順にメモ
alp=[[] for i in range(26)]
for i in range(len(s)):
alp[ord(s[i])-ord("a")].append(i)
#alp[w]の中からnow以降のものを探す．なければ一番手前を．
def bi_search(now,w):
r=0
if now>=alp[w][-1]:
now=-1
r=1
ne_i=bisect.bisect_right(alp[w],now)
ne=alp[w][ne_i]
return ne,r
ans=0
rep=0
now=-1#s上の何文字目か
for i in range(len(t)):
num=ord(t[i])-ord("a")
if len(alp[num])==0:
ans=-1
break
now,r=bi_search(now,num)
rep+=r
if ans==-1:
print(ans)
else:
ans=rep*len(s)+now+1
print(ans)
|
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
import bisect
mod=10**9+7
s=eval(input())
t=eval(input())
L=[[]for _ in range(26)]
N=len(s)
for i in range(N):
c=ord(s[i])-97
L[c].append(i)
cur=-1
rep=0
M=len(t)
for i in range(M):
c=ord(t[i])-97
if len(L[c])==0:
print((-1))
exit()
num=bisect.bisect_right(L[c],cur)
if num>=len(L[c]):
rep+=1
num=0
cur=L[c][num]
ans=N*rep + cur + 1
print(ans)
main()
| 38
| 42
| 645
| 748
|
# dictでよかったかも？
import bisect
s = eval(input())
t = eval(input())
# a,b,cの出てきたところを小さい順にメモ
alp = [[] for i in range(26)]
for i in range(len(s)):
alp[ord(s[i]) - ord("a")].append(i)
# alp[w]の中からnow以降のものを探す．なければ一番手前を．
def bi_search(now, w):
r = 0
if now >= alp[w][-1]:
now = -1
r = 1
ne_i = bisect.bisect_right(alp[w], now)
ne = alp[w][ne_i]
return ne, r
ans = 0
rep = 0
now = -1 # s上の何文字目か
for i in range(len(t)):
num = ord(t[i]) - ord("a")
if len(alp[num]) == 0:
ans = -1
break
now, r = bi_search(now, num)
rep += r
if ans == -1:
print(ans)
else:
ans = rep * len(s) + now + 1
print(ans)
|
def I():
return int(eval(input()))
def MI():
return list(map(int, input().split()))
def LI():
return list(map(int, input().split()))
def main():
import bisect
mod = 10**9 + 7
s = eval(input())
t = eval(input())
L = [[] for _ in range(26)]
N = len(s)
for i in range(N):
c = ord(s[i]) - 97
L[c].append(i)
cur = -1
rep = 0
M = len(t)
for i in range(M):
c = ord(t[i]) - 97
if len(L[c]) == 0:
print((-1))
exit()
num = bisect.bisect_right(L[c], cur)
if num >= len(L[c]):
rep += 1
num = 0
cur = L[c][num]
ans = N * rep + cur + 1
print(ans)
main()
| false
| 9.52381
|
[
"-# dictでよかったかも？",
"-import bisect",
"-",
"-s = eval(input())",
"-t = eval(input())",
"-# a,b,cの出てきたところを小さい順にメモ",
"-alp = [[] for i in range(26)]",
"-for i in range(len(s)):",
"- alp[ord(s[i]) - ord(\"a\")].append(i)",
"-# alp[w]の中からnow以降のものを探す．なければ一番手前を．",
"-def bi_search(now, w):",
"- r = 0",
"- if now >= alp[w][-1]:",
"- now = -1",
"- r = 1",
"- ne_i = bisect.bisect_right(alp[w], now)",
"- ne = alp[w][ne_i]",
"- return ne, r",
"+def I():",
"+ return int(eval(input()))",
"-ans = 0",
"-rep = 0",
"-now = -1 # s上の何文字目か",
"-for i in range(len(t)):",
"- num = ord(t[i]) - ord(\"a\")",
"- if len(alp[num]) == 0:",
"- ans = -1",
"- break",
"- now, r = bi_search(now, num)",
"- rep += r",
"-if ans == -1:",
"+def MI():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def LI():",
"+ return list(map(int, input().split()))",
"+",
"+",
"+def main():",
"+ import bisect",
"+",
"+ mod = 10**9 + 7",
"+ s = eval(input())",
"+ t = eval(input())",
"+ L = [[] for _ in range(26)]",
"+ N = len(s)",
"+ for i in range(N):",
"+ c = ord(s[i]) - 97",
"+ L[c].append(i)",
"+ cur = -1",
"+ rep = 0",
"+ M = len(t)",
"+ for i in range(M):",
"+ c = ord(t[i]) - 97",
"+ if len(L[c]) == 0:",
"+ print((-1))",
"+ exit()",
"+ num = bisect.bisect_right(L[c], cur)",
"+ if num >= len(L[c]):",
"+ rep += 1",
"+ num = 0",
"+ cur = L[c][num]",
"+ ans = N * rep + cur + 1",
"-else:",
"- ans = rep * len(s) + now + 1",
"- print(ans)",
"+",
"+",
"+main()"
] | false
| 0.038673
| 0.046514
| 0.831417
|
[
"s660767133",
"s069038734"
] |
u826785572
|
p02688
|
python
|
s828542780
|
s969006761
| 27
| 24
| 9,180
| 9,196
|
Accepted
|
Accepted
| 11.11
|
n, k = list(map(int, input().split()))
s = set()
for _ in range(k):
d = int(eval(input()))
t = list(map(int, input().split()))
for i in range(len(t)):
s.add(t[i])
print((n - len(s)))
|
n, k = list(map(int, input().split()))
A = [-1] * n
for i in range(k):
d = int(eval(input()))
a = list(map(int, input().split()))
for j in range(d):
x = a[j]-1
if A[x] == -1:
A[x] = 1
ans = 0
for i in range(n):
if A[i] == -1:
ans += 1
print(ans)
| 11
| 19
| 202
| 309
|
n, k = list(map(int, input().split()))
s = set()
for _ in range(k):
d = int(eval(input()))
t = list(map(int, input().split()))
for i in range(len(t)):
s.add(t[i])
print((n - len(s)))
|
n, k = list(map(int, input().split()))
A = [-1] * n
for i in range(k):
d = int(eval(input()))
a = list(map(int, input().split()))
for j in range(d):
x = a[j] - 1
if A[x] == -1:
A[x] = 1
ans = 0
for i in range(n):
if A[i] == -1:
ans += 1
print(ans)
| false
| 42.105263
|
[
"-s = set()",
"-for _ in range(k):",
"+A = [-1] * n",
"+for i in range(k):",
"- t = list(map(int, input().split()))",
"- for i in range(len(t)):",
"- s.add(t[i])",
"-print((n - len(s)))",
"+ a = list(map(int, input().split()))",
"+ for j in range(d):",
"+ x = a[j] - 1",
"+ if A[x] == -1:",
"+ A[x] = 1",
"+ans = 0",
"+for i in range(n):",
"+ if A[i] == -1:",
"+ ans += 1",
"+print(ans)"
] | false
| 0.033924
| 0.085952
| 0.394679
|
[
"s828542780",
"s969006761"
] |
u075012704
|
p03032
|
python
|
s823715118
|
s126857045
| 203
| 37
| 41,964
| 3,064
|
Accepted
|
Accepted
| 81.77
|
N, K = list(map(int, input().split()))
V = list(map(int, input().split()))
ans = 0
for l_pop in range(K + 1):
for r_pop in range(K + 1):
X = []
if (l_pop + r_pop > K) or (l_pop + r_pop > N):
continue
else:
X.extend(V[:l_pop])
X.extend(V[::-1][:r_pop])
X.sort()
tmp = sum(X)
for k in range(K - l_pop - r_pop):
if k > len(X) - 1:
break
else:
if X[k] < 0:
tmp -= X[k]
ans = max(ans, tmp)
print(ans)
|
N, K = list(map(int, input().split()))
V = list(map(int, input().split()))
# 最終的に「持っているもの」の価値の合計を高めたい
# Dから取り出すことをpop、Dに詰めることをenqueueとする
ans = 0
for pop_cnt in range(K + 1):
enqueue_cnt = K - pop_cnt
if pop_cnt > N:
continue
for l in range(pop_cnt + 1):
holding = []
r = pop_cnt - l
holding += V[:l]
holding += V[N - r:]
holding.sort()
tmp_ans = sum(holding)
for e in range(enqueue_cnt):
if e >= len(holding):
break
if holding[e] < 0:
tmp_ans += -holding[e]
ans = max(ans, tmp_ans)
print(ans)
| 25
| 32
| 590
| 667
|
N, K = list(map(int, input().split()))
V = list(map(int, input().split()))
ans = 0
for l_pop in range(K + 1):
for r_pop in range(K + 1):
X = []
if (l_pop + r_pop > K) or (l_pop + r_pop > N):
continue
else:
X.extend(V[:l_pop])
X.extend(V[::-1][:r_pop])
X.sort()
tmp = sum(X)
for k in range(K - l_pop - r_pop):
if k > len(X) - 1:
break
else:
if X[k] < 0:
tmp -= X[k]
ans = max(ans, tmp)
print(ans)
|
N, K = list(map(int, input().split()))
V = list(map(int, input().split()))
# 最終的に「持っているもの」の価値の合計を高めたい
# Dから取り出すことをpop、Dに詰めることをenqueueとする
ans = 0
for pop_cnt in range(K + 1):
enqueue_cnt = K - pop_cnt
if pop_cnt > N:
continue
for l in range(pop_cnt + 1):
holding = []
r = pop_cnt - l
holding += V[:l]
holding += V[N - r :]
holding.sort()
tmp_ans = sum(holding)
for e in range(enqueue_cnt):
if e >= len(holding):
break
if holding[e] < 0:
tmp_ans += -holding[e]
ans = max(ans, tmp_ans)
print(ans)
| false
| 21.875
|
[
"+# 最終的に「持っているもの」の価値の合計を高めたい",
"+# Dから取り出すことをpop、Dに詰めることをenqueueとする",
"-for l_pop in range(K + 1):",
"- for r_pop in range(K + 1):",
"- X = []",
"- if (l_pop + r_pop > K) or (l_pop + r_pop > N):",
"- continue",
"- else:",
"- X.extend(V[:l_pop])",
"- X.extend(V[::-1][:r_pop])",
"- X.sort()",
"- tmp = sum(X)",
"- for k in range(K - l_pop - r_pop):",
"- if k > len(X) - 1:",
"+for pop_cnt in range(K + 1):",
"+ enqueue_cnt = K - pop_cnt",
"+ if pop_cnt > N:",
"+ continue",
"+ for l in range(pop_cnt + 1):",
"+ holding = []",
"+ r = pop_cnt - l",
"+ holding += V[:l]",
"+ holding += V[N - r :]",
"+ holding.sort()",
"+ tmp_ans = sum(holding)",
"+ for e in range(enqueue_cnt):",
"+ if e >= len(holding):",
"- else:",
"- if X[k] < 0:",
"- tmp -= X[k]",
"- ans = max(ans, tmp)",
"+ if holding[e] < 0:",
"+ tmp_ans += -holding[e]",
"+ ans = max(ans, tmp_ans)"
] | false
| 0.051385
| 0.034989
| 1.468597
|
[
"s823715118",
"s126857045"
] |
u648868410
|
p02590
|
python
|
s786614834
|
s733692537
| 1,890
| 1,392
| 73,036
| 89,536
|
Accepted
|
Accepted
| 26.35
|
import numpy as np
if __name__ == "__main__":
N=int(eval(input()))
A=list(map(int,input().split()))
P=200_003
rootP=2
order=[1]
x=rootP
while x!=1:
order.append(x)
x *= rootP
x %= P
ORDER_SIZE=len(order) # 200_002
where=np.zeros(P,int)
for i in range(ORDER_SIZE):
where[ order[i] ] = i
prevCnt = np.zeros(P,int)
resCnt = np.zeros(P,int)
for n in range(N):
if A[n] != 0:
prevCnt[ where[A[n]] ] += 1
resCnt[ (A[n] * A[n]) % P ] -= 1
N_=1
while N_ < 2*len(prevCnt): N_ *= 2
nf = np.zeros(N_,int)
nf[:len(prevCnt)]=prevCnt
nf=np.fft.rfft(nf)
fftRes = np.rint( np.fft.irfft(nf*nf) )
for r in range(len(fftRes)):
if fftRes[r] != 0:
resCnt[ order[ r % ORDER_SIZE ] ] += fftRes[r]
ans = 0
for p in range(P):
if resCnt[p] != 0:
ans += (resCnt[p] // 2) * p
print(ans)
|
import numpy as np
class FastFourierTransform:
"""FFT
"""
def multiply(self, F,G):
""" multiply by FFT
"""
N=1
# 1.N > deg(g) + deg(h)となる2の冪乗を選ぶ
while N < len(F) + len(G):
N *= 2
# 2. 離散フーリエ変換の計算
nf = np.zeros(N,int)
nf[:len(F)]=F
ng = np.zeros(N,int)
ng[:len(G)]=G
nf=np.fft.fft(nf)
ng=np.fft.fft(ng)
# for n in range(N):
# nf[n] *= ng[n]
nf *= ng
# 3. 離散フーリエ逆変換
nf=np.fft.ifft(nf)
ans = np.zeros(N,int)
for n in range(N):
# 係数を1/N倍 => np.fftの場合、すでに実行済
#ans.append( round(nf[n].real / N) )
ans[n] = int(nf[n].real + 0.5)
return ans
if __name__ == "__main__":
N=int(eval(input()))
A=list(map(int,input().split()))
P=200_003
rootP=2
# order of 1 to P-1 after fft
order=[1]
x=rootP
while x!=1:
order.append(x)
x *= rootP
x %= P
ORDER_SIZE=len(order) # 200_002
# create order index
where=np.zeros(P,int)
for i in range(ORDER_SIZE):
where[ order[i] ] = i
# count non zero items
prevCnt = np.zeros(P,int)
resCnt = np.zeros(P,int)
# prevCnt2 = [ 0 for _ in range(P)]
# resCnt = [ 0 for _ in range(P)]
for n in range(N):
if A[n] != 0:
prevCnt[ where[A[n]] ] += 1
# prevCnt2[ where[A[n]] ] += 1
# remove Ax * Ax pattern count
resCnt[ (A[n] * A[n]) % P ] -= 1
# fft to cnt (calc nC2 and all Ax * Ay)
clsFFT = FastFourierTransform()
fftRes = clsFFT.multiply(prevCnt,prevCnt)
for r in range(len(fftRes)):
if fftRes[r] != 0:
# get result(Ax*Ay==resCnt.index) Cnt by summary fftRes
resCnt[ order[ r % ORDER_SIZE ] ] += fftRes[r]
ans = 0
for p in range(P):
if resCnt[p] != 0:
# print(p,resCnt[p])
# remove j <= i pattern count
# and
# calc summary value((Ax * Ay cnt) * (Ax * Ay)))
ans += (resCnt[p] // 2) * p
print(ans)
| 46
| 95
| 856
| 1,846
|
import numpy as np
if __name__ == "__main__":
N = int(eval(input()))
A = list(map(int, input().split()))
P = 200_003
rootP = 2
order = [1]
x = rootP
while x != 1:
order.append(x)
x *= rootP
x %= P
ORDER_SIZE = len(order) # 200_002
where = np.zeros(P, int)
for i in range(ORDER_SIZE):
where[order[i]] = i
prevCnt = np.zeros(P, int)
resCnt = np.zeros(P, int)
for n in range(N):
if A[n] != 0:
prevCnt[where[A[n]]] += 1
resCnt[(A[n] * A[n]) % P] -= 1
N_ = 1
while N_ < 2 * len(prevCnt):
N_ *= 2
nf = np.zeros(N_, int)
nf[: len(prevCnt)] = prevCnt
nf = np.fft.rfft(nf)
fftRes = np.rint(np.fft.irfft(nf * nf))
for r in range(len(fftRes)):
if fftRes[r] != 0:
resCnt[order[r % ORDER_SIZE]] += fftRes[r]
ans = 0
for p in range(P):
if resCnt[p] != 0:
ans += (resCnt[p] // 2) * p
print(ans)
|
import numpy as np
class FastFourierTransform:
"""FFT"""
def multiply(self, F, G):
"""multiply by FFT"""
N = 1
# 1.N > deg(g) + deg(h)となる2の冪乗を選ぶ
while N < len(F) + len(G):
N *= 2
# 2. 離散フーリエ変換の計算
nf = np.zeros(N, int)
nf[: len(F)] = F
ng = np.zeros(N, int)
ng[: len(G)] = G
nf = np.fft.fft(nf)
ng = np.fft.fft(ng)
# for n in range(N):
# nf[n] *= ng[n]
nf *= ng
# 3. 離散フーリエ逆変換
nf = np.fft.ifft(nf)
ans = np.zeros(N, int)
for n in range(N):
# 係数を1/N倍 => np.fftの場合、すでに実行済
# ans.append( round(nf[n].real / N) )
ans[n] = int(nf[n].real + 0.5)
return ans
if __name__ == "__main__":
N = int(eval(input()))
A = list(map(int, input().split()))
P = 200_003
rootP = 2
# order of 1 to P-1 after fft
order = [1]
x = rootP
while x != 1:
order.append(x)
x *= rootP
x %= P
ORDER_SIZE = len(order) # 200_002
# create order index
where = np.zeros(P, int)
for i in range(ORDER_SIZE):
where[order[i]] = i
# count non zero items
prevCnt = np.zeros(P, int)
resCnt = np.zeros(P, int)
# prevCnt2 = [ 0 for _ in range(P)]
# resCnt = [ 0 for _ in range(P)]
for n in range(N):
if A[n] != 0:
prevCnt[where[A[n]]] += 1
# prevCnt2[ where[A[n]] ] += 1
# remove Ax * Ax pattern count
resCnt[(A[n] * A[n]) % P] -= 1
# fft to cnt (calc nC2 and all Ax * Ay)
clsFFT = FastFourierTransform()
fftRes = clsFFT.multiply(prevCnt, prevCnt)
for r in range(len(fftRes)):
if fftRes[r] != 0:
# get result(Ax*Ay==resCnt.index) Cnt by summary fftRes
resCnt[order[r % ORDER_SIZE]] += fftRes[r]
ans = 0
for p in range(P):
if resCnt[p] != 0:
# print(p,resCnt[p])
# remove j <= i pattern count
# and
# calc summary value((Ax * Ay cnt) * (Ax * Ay)))
ans += (resCnt[p] // 2) * p
print(ans)
| false
| 51.578947
|
[
"+",
"+",
"+class FastFourierTransform:",
"+ \"\"\"FFT\"\"\"",
"+",
"+ def multiply(self, F, G):",
"+ \"\"\"multiply by FFT\"\"\"",
"+ N = 1",
"+ # 1.N > deg(g) + deg(h)となる2の冪乗を選ぶ",
"+ while N < len(F) + len(G):",
"+ N *= 2",
"+ # 2. 離散フーリエ変換の計算",
"+ nf = np.zeros(N, int)",
"+ nf[: len(F)] = F",
"+ ng = np.zeros(N, int)",
"+ ng[: len(G)] = G",
"+ nf = np.fft.fft(nf)",
"+ ng = np.fft.fft(ng)",
"+ # for n in range(N):",
"+ # nf[n] *= ng[n]",
"+ nf *= ng",
"+ # 3. 離散フーリエ逆変換",
"+ nf = np.fft.ifft(nf)",
"+ ans = np.zeros(N, int)",
"+ for n in range(N):",
"+ # 係数を1/N倍 => np.fftの場合、すでに実行済",
"+ # ans.append( round(nf[n].real / N) )",
"+ ans[n] = int(nf[n].real + 0.5)",
"+ return ans",
"+",
"+ # order of 1 to P-1 after fft",
"+ # create order index",
"+ # count non zero items",
"+ # prevCnt2 = [ 0 for _ in range(P)]",
"+ # resCnt = [ 0 for _ in range(P)]",
"+ # prevCnt2[ where[A[n]] ] += 1",
"+ # remove Ax * Ax pattern count",
"- N_ = 1",
"- while N_ < 2 * len(prevCnt):",
"- N_ *= 2",
"- nf = np.zeros(N_, int)",
"- nf[: len(prevCnt)] = prevCnt",
"- nf = np.fft.rfft(nf)",
"- fftRes = np.rint(np.fft.irfft(nf * nf))",
"+ # fft to cnt (calc nC2 and all Ax * Ay)",
"+ clsFFT = FastFourierTransform()",
"+ fftRes = clsFFT.multiply(prevCnt, prevCnt)",
"+ # get result(Ax*Ay==resCnt.index) Cnt by summary fftRes",
"+ # print(p,resCnt[p])",
"+ # remove j <= i pattern count",
"+ # and",
"+ # calc summary value((Ax * Ay cnt) * (Ax * Ay)))"
] | false
| 1.04721
| 1.442219
| 0.72611
|
[
"s786614834",
"s733692537"
] |
u304146411
|
p03959
|
python
|
s855635151
|
s429453603
| 221
| 162
| 18,540
| 19,012
|
Accepted
|
Accepted
| 26.7
|
N = int(eval(input()))
T = list(map(int,input().split()))
A = list(map(int,input().split()))
A.append(1)
count = 0
Tmax = 1
Amax = 1
T2 = [0] * N
A2 = [0] * N
ans = 1
for i in range(N):
if T[i] > Tmax and A[i] > A[i+1] and T[i] != A[i]:
ans = 0
break
elif T[i] > Tmax and A[i] > A[i+1] and T[i] == A[i]:
count = 1
Tmax = T[i]
Amax = A[i+1]
elif T[i] > Tmax and A[i] == A[i+1] and T[i] > A[i]:
ans = 0
break
elif T[i] > Tmax and A[i] == A[i+1] and T[i] <= A[i]:
count = 1
Tmax = T[i]
elif T[i] == Tmax and A[i] > A[i+1] and A[i] > T[i]:
ans = 0
break
elif T[i] == Tmax and A[i] > A[i+1] and A[i] <= T[i]:
count = 1
Amax = A[i+1]
else:
count = min(A[i],T[i])
ans *= count
ans = ans % (10**9+7)
print(ans)
|
N = int(eval(input()))
T = list(map(int,input().split()))
A = list(map(int,input().split()))
A.append(1)
count = 0
Tmax = 1
Amax = 1
T2 = [0] * N
A2 = [0] * N
ans = 1
for i in range(N):
if T[i] > Tmax:
Tmax = T[i]
if A[i] > A[i+1]:
Amax = A[i+1]
if T[i] == A[i]:
count = 1
else:
ans = 0
break
else:
if T[i] > A[i]:
ans = 0
break
else:
count = 1
else:
if A[i] > A[i+1]:
Amax = A[i+1]
if A[i] > T[i]:
ans = 0
break
else:
count = 1
else:
count = min(A[i],T[i])
ans *= count
ans = ans % (10**9+7)
print(ans)
| 36
| 40
| 880
| 845
|
N = int(eval(input()))
T = list(map(int, input().split()))
A = list(map(int, input().split()))
A.append(1)
count = 0
Tmax = 1
Amax = 1
T2 = [0] * N
A2 = [0] * N
ans = 1
for i in range(N):
if T[i] > Tmax and A[i] > A[i + 1] and T[i] != A[i]:
ans = 0
break
elif T[i] > Tmax and A[i] > A[i + 1] and T[i] == A[i]:
count = 1
Tmax = T[i]
Amax = A[i + 1]
elif T[i] > Tmax and A[i] == A[i + 1] and T[i] > A[i]:
ans = 0
break
elif T[i] > Tmax and A[i] == A[i + 1] and T[i] <= A[i]:
count = 1
Tmax = T[i]
elif T[i] == Tmax and A[i] > A[i + 1] and A[i] > T[i]:
ans = 0
break
elif T[i] == Tmax and A[i] > A[i + 1] and A[i] <= T[i]:
count = 1
Amax = A[i + 1]
else:
count = min(A[i], T[i])
ans *= count
ans = ans % (10**9 + 7)
print(ans)
|
N = int(eval(input()))
T = list(map(int, input().split()))
A = list(map(int, input().split()))
A.append(1)
count = 0
Tmax = 1
Amax = 1
T2 = [0] * N
A2 = [0] * N
ans = 1
for i in range(N):
if T[i] > Tmax:
Tmax = T[i]
if A[i] > A[i + 1]:
Amax = A[i + 1]
if T[i] == A[i]:
count = 1
else:
ans = 0
break
else:
if T[i] > A[i]:
ans = 0
break
else:
count = 1
else:
if A[i] > A[i + 1]:
Amax = A[i + 1]
if A[i] > T[i]:
ans = 0
break
else:
count = 1
else:
count = min(A[i], T[i])
ans *= count
ans = ans % (10**9 + 7)
print(ans)
| false
| 10
|
[
"- if T[i] > Tmax and A[i] > A[i + 1] and T[i] != A[i]:",
"- ans = 0",
"- break",
"- elif T[i] > Tmax and A[i] > A[i + 1] and T[i] == A[i]:",
"- count = 1",
"+ if T[i] > Tmax:",
"- Amax = A[i + 1]",
"- elif T[i] > Tmax and A[i] == A[i + 1] and T[i] > A[i]:",
"- ans = 0",
"- break",
"- elif T[i] > Tmax and A[i] == A[i + 1] and T[i] <= A[i]:",
"- count = 1",
"- Tmax = T[i]",
"- elif T[i] == Tmax and A[i] > A[i + 1] and A[i] > T[i]:",
"- ans = 0",
"- break",
"- elif T[i] == Tmax and A[i] > A[i + 1] and A[i] <= T[i]:",
"- count = 1",
"- Amax = A[i + 1]",
"+ if A[i] > A[i + 1]:",
"+ Amax = A[i + 1]",
"+ if T[i] == A[i]:",
"+ count = 1",
"+ else:",
"+ ans = 0",
"+ break",
"+ else:",
"+ if T[i] > A[i]:",
"+ ans = 0",
"+ break",
"+ else:",
"+ count = 1",
"- count = min(A[i], T[i])",
"+ if A[i] > A[i + 1]:",
"+ Amax = A[i + 1]",
"+ if A[i] > T[i]:",
"+ ans = 0",
"+ break",
"+ else:",
"+ count = 1",
"+ else:",
"+ count = min(A[i], T[i])"
] | false
| 0.00702
| 0.113922
| 0.061624
|
[
"s855635151",
"s429453603"
] |
u576320075
|
p03317
|
python
|
s189387079
|
s208210919
| 40
| 19
| 13,812
| 3,060
|
Accepted
|
Accepted
| 52.5
|
import math
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
n -= 1
k -= 1
ans = (n + k - 1) // k
print(ans)
|
import math
n, k = list(map(int, input().split()))
# a = list(map(int, input().split()))
n -= 1
k -= 1
ans = (n + k - 1) // k
print(ans)
| 10
| 10
| 141
| 143
|
import math
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
n -= 1
k -= 1
ans = (n + k - 1) // k
print(ans)
|
import math
n, k = list(map(int, input().split()))
# a = list(map(int, input().split()))
n -= 1
k -= 1
ans = (n + k - 1) // k
print(ans)
| false
| 0
|
[
"-a = list(map(int, input().split()))",
"+# a = list(map(int, input().split()))"
] | false
| 0.008243
| 0.037095
| 0.222217
|
[
"s189387079",
"s208210919"
] |
u367130284
|
p03716
|
python
|
s118574270
|
s868148590
| 789
| 682
| 127,704
| 127,704
|
Accepted
|
Accepted
| 13.56
|
def f(a):
q=a[:n];s=sum(q);heapify(q);yield s
for e in a[n:2*n]:s+=e-heappushpop(q,e);yield s
from heapq import*;n,*a=list(map(int,open(0).read().split()));print((max(list(map(sum,list(zip(f(a),list(f([-e for e in a[::-1]]))[::-1])))))))
|
def f(l,a):
q=a[:n];s=sum(q);heapify(q);l+=[s]
for e in a[n:2*n]:s+=e-heappushpop(q,e);l+=[s]
from heapq import*;n,*a=list(map(int,open(0).read().split()));l=[];f(l,a);f(l,[-i for i in a[::-1]]);m=len(l)//2;print((max(l[i]+l[-i-1]for i in range(m))))
| 4
| 4
| 222
| 247
|
def f(a):
q = a[:n]
s = sum(q)
heapify(q)
yield s
for e in a[n : 2 * n]:
s += e - heappushpop(q, e)
yield s
from heapq import *
n, *a = list(map(int, open(0).read().split()))
print((max(list(map(sum, list(zip(f(a), list(f([-e for e in a[::-1]]))[::-1])))))))
|
def f(l, a):
q = a[:n]
s = sum(q)
heapify(q)
l += [s]
for e in a[n : 2 * n]:
s += e - heappushpop(q, e)
l += [s]
from heapq import *
n, *a = list(map(int, open(0).read().split()))
l = []
f(l, a)
f(l, [-i for i in a[::-1]])
m = len(l) // 2
print((max(l[i] + l[-i - 1] for i in range(m))))
| false
| 0
|
[
"-def f(a):",
"+def f(l, a):",
"- yield s",
"+ l += [s]",
"- yield s",
"+ l += [s]",
"-print((max(list(map(sum, list(zip(f(a), list(f([-e for e in a[::-1]]))[::-1])))))))",
"+l = []",
"+f(l, a)",
"+f(l, [-i for i in a[::-1]])",
"+m = len(l) // 2",
"+print((max(l[i] + l[-i - 1] for i in range(m))))"
] | false
| 0.04275
| 0.04005
| 1.067399
|
[
"s118574270",
"s868148590"
] |
u363421241
|
p02690
|
python
|
s802040498
|
s997250599
| 50
| 46
| 9,108
| 9,052
|
Accepted
|
Accepted
| 8
|
x = int(eval(input()))
for a in range(-118, 120):
for b in range(-119, 119):
if a**5 - b**5 == x:
print((a, b))
exit()
|
x = int(eval(input()))
for a in range(-121,121):
for b in range(-121, 121):
if a**5 - b**5 == x:
print((a, b))
exit()
| 7
| 7
| 153
| 152
|
x = int(eval(input()))
for a in range(-118, 120):
for b in range(-119, 119):
if a**5 - b**5 == x:
print((a, b))
exit()
|
x = int(eval(input()))
for a in range(-121, 121):
for b in range(-121, 121):
if a**5 - b**5 == x:
print((a, b))
exit()
| false
| 0
|
[
"-for a in range(-118, 120):",
"- for b in range(-119, 119):",
"+for a in range(-121, 121):",
"+ for b in range(-121, 121):"
] | false
| 0.050261
| 0.078397
| 0.641109
|
[
"s802040498",
"s997250599"
] |
u623231048
|
p03576
|
python
|
s291586500
|
s627577345
| 1,962
| 34
| 52,572
| 3,064
|
Accepted
|
Accepted
| 98.27
|
def main():
n,k = list(map(int,input().split()))
xy = [list(map(int,input().split())) for _ in range(n)]
ans = 10 ** 20
for i in range(n):
for j in range(i+1, n):
for ii in range(n):
for jj in range(ii+1, n):
l = min(xy[i][0], xy[j][0])
r = max(xy[i][0], xy[j][0])
d = min(xy[ii][1], xy[jj][1])
u = max(xy[ii][1], xy[jj][1])
cnt = 0
for x,y in xy:
if l <= x <= r and d <= y <= u:
cnt += 1
if cnt >= k:
ans = min(ans, (r-l) * (u - d))
print(ans)
if __name__ == '__main__':
main()
|
n,k = list(map(int,input().split()))
xy = [list(map(int,input().split())) for _ in range(n)]
xy.sort()
ans = 10**20
for i in range(n):
for j in range(i,n):
xy_tmp = xy[i:j+1]
if len(xy_tmp) >= k:
l1 = xy_tmp[0][0]
r1 = xy_tmp[-1][0]
xy_tmp.sort(key = lambda x: x[1])
for jj in range(len(xy_tmp) - k + 1):
ans = min(ans, (r1-l1) * (xy_tmp[k+jj-1][1] - xy_tmp[jj][1]))
print(ans)
| 25
| 17
| 777
| 475
|
def main():
n, k = list(map(int, input().split()))
xy = [list(map(int, input().split())) for _ in range(n)]
ans = 10**20
for i in range(n):
for j in range(i + 1, n):
for ii in range(n):
for jj in range(ii + 1, n):
l = min(xy[i][0], xy[j][0])
r = max(xy[i][0], xy[j][0])
d = min(xy[ii][1], xy[jj][1])
u = max(xy[ii][1], xy[jj][1])
cnt = 0
for x, y in xy:
if l <= x <= r and d <= y <= u:
cnt += 1
if cnt >= k:
ans = min(ans, (r - l) * (u - d))
print(ans)
if __name__ == "__main__":
main()
|
n, k = list(map(int, input().split()))
xy = [list(map(int, input().split())) for _ in range(n)]
xy.sort()
ans = 10**20
for i in range(n):
for j in range(i, n):
xy_tmp = xy[i : j + 1]
if len(xy_tmp) >= k:
l1 = xy_tmp[0][0]
r1 = xy_tmp[-1][0]
xy_tmp.sort(key=lambda x: x[1])
for jj in range(len(xy_tmp) - k + 1):
ans = min(ans, (r1 - l1) * (xy_tmp[k + jj - 1][1] - xy_tmp[jj][1]))
print(ans)
| false
| 32
|
[
"-def main():",
"- n, k = list(map(int, input().split()))",
"- xy = [list(map(int, input().split())) for _ in range(n)]",
"- ans = 10**20",
"- for i in range(n):",
"- for j in range(i + 1, n):",
"- for ii in range(n):",
"- for jj in range(ii + 1, n):",
"- l = min(xy[i][0], xy[j][0])",
"- r = max(xy[i][0], xy[j][0])",
"- d = min(xy[ii][1], xy[jj][1])",
"- u = max(xy[ii][1], xy[jj][1])",
"- cnt = 0",
"- for x, y in xy:",
"- if l <= x <= r and d <= y <= u:",
"- cnt += 1",
"- if cnt >= k:",
"- ans = min(ans, (r - l) * (u - d))",
"- print(ans)",
"-",
"-",
"-if __name__ == \"__main__\":",
"- main()",
"+n, k = list(map(int, input().split()))",
"+xy = [list(map(int, input().split())) for _ in range(n)]",
"+xy.sort()",
"+ans = 10**20",
"+for i in range(n):",
"+ for j in range(i, n):",
"+ xy_tmp = xy[i : j + 1]",
"+ if len(xy_tmp) >= k:",
"+ l1 = xy_tmp[0][0]",
"+ r1 = xy_tmp[-1][0]",
"+ xy_tmp.sort(key=lambda x: x[1])",
"+ for jj in range(len(xy_tmp) - k + 1):",
"+ ans = min(ans, (r1 - l1) * (xy_tmp[k + jj - 1][1] - xy_tmp[jj][1]))",
"+print(ans)"
] | false
| 0.044614
| 0.048875
| 0.912803
|
[
"s291586500",
"s627577345"
] |
u363074342
|
p03363
|
python
|
s666348463
|
s818204419
| 1,534
| 424
| 54,996
| 54,780
|
Accepted
|
Accepted
| 72.36
|
import math
n = int(eval(input()))
a = list(map(int,input().split()))
dic_S = {0:[0]}
S = 0
ans = 0
for i in range(n):
S += a[i]
if S not in dic_S:
dic_S[S] = []
else:
pass
dic_S[S].append(a[i])
for k in list(dic_S.keys()):
I = len(dic_S[k])
if 3 <= I:
ans += math.factorial(I) // (math.factorial(I-2)*2)
elif I == 2:
ans += 1
else:
pass
print(ans)
|
n = int(eval(input()))
a = list(map(int,input().split()))
dic_S = {0:[0]}
S = 0
ans = 0
for i in range(n):
S += a[i]
if S not in dic_S:
dic_S[S] = []
else:
pass
dic_S[S].append(a[i])
for k in list(dic_S.keys()):
I = len(dic_S[k])
if 3 <= I:
ans += (I*(I-1))// 2
elif I == 2:
ans += 1
else:
pass
print(ans)
| 24
| 23
| 438
| 394
|
import math
n = int(eval(input()))
a = list(map(int, input().split()))
dic_S = {0: [0]}
S = 0
ans = 0
for i in range(n):
S += a[i]
if S not in dic_S:
dic_S[S] = []
else:
pass
dic_S[S].append(a[i])
for k in list(dic_S.keys()):
I = len(dic_S[k])
if 3 <= I:
ans += math.factorial(I) // (math.factorial(I - 2) * 2)
elif I == 2:
ans += 1
else:
pass
print(ans)
|
n = int(eval(input()))
a = list(map(int, input().split()))
dic_S = {0: [0]}
S = 0
ans = 0
for i in range(n):
S += a[i]
if S not in dic_S:
dic_S[S] = []
else:
pass
dic_S[S].append(a[i])
for k in list(dic_S.keys()):
I = len(dic_S[k])
if 3 <= I:
ans += (I * (I - 1)) // 2
elif I == 2:
ans += 1
else:
pass
print(ans)
| false
| 4.166667
|
[
"-import math",
"-",
"- ans += math.factorial(I) // (math.factorial(I - 2) * 2)",
"+ ans += (I * (I - 1)) // 2"
] | false
| 0.062839
| 0.061999
| 1.013544
|
[
"s666348463",
"s818204419"
] |
u644907318
|
p03088
|
python
|
s259975038
|
s953272929
| 308
| 133
| 51,824
| 69,800
|
Accepted
|
Accepted
| 56.82
|
p = 10**9+7
N = int(input())
dp = [[[[[0 for _ in range(4)] for _ in range(4)] for _ in range(4)] for _ in range(4)] for _ in range(N+1)]
for j in range(4):
for k in range(4):
for l in range(4):
if not(j==0 and k==1 and l==2) and not(j==0 and k==2 and l==1) and not(j==1 and k==0 and l==2):
dp[3][0][j][k][l] = 1
for n in range(4,N+1):
for i in range(4):
for j in range(4):
for k in range(4):
for l in range(4):
if not(j==0 and k==1 and l==2) and not(j==0 and k==2 and l==1) and not(j==1 and k==0 and l==2) \
and not(i==0 and k==1 and l==2) and not(i==0 and j==1 and l==2):
dp[n][i][j][k][l] = 0
for m in range(4):
dp[n][i][j][k][l] = (dp[n][i][j][k][l]+dp[n-1][m][i][j][k])%p
tot = 0
for i in range(4):
for j in range(4):
for k in range(4):
for l in range(4):
tot = (tot + dp[N][i][j][k][l])%p
print(tot)
|
p = 10**9+7
N = int(eval(input()))
dp = [[[[[0 for _ in range(4)] for _ in range(4)] for _ in range(4)] for _ in range(4)] for _ in range(N+1)]
for i in range(4):
for j in range(4):
for k in range(4):
for l in range(4):
if i==0:
dp[3][i][j][k][l] = 1
for i in range(4):
dp[3][i][0][1][2] = 0
dp[3][i][1][0][2] = 0
dp[3][i][0][2][1] = 0
for n in range(4,N+1):
for i in range(4):
for j in range(4):
for k in range(4):
for l in range(4):
for x in range(4):
dp[n][i][j][k][l] = (dp[n][i][j][k][l]+dp[n-1][x][i][j][k]*(str(j)+str(k)+str(l)!="012")\
*(str(j)+str(k)+str(l)!="102")*(str(j)+str(k)+str(l)!="021")\
*(str(i)+str(k)+str(l)!="012")*(str(i)+str(j)+str(l)!="012"))%p
cnt = 0
for i in range(4):
for j in range(4):
for k in range(4):
for l in range(4):
cnt = (cnt+dp[N][i][j][k][l])%p
print(cnt)
| 25
| 29
| 1,065
| 1,070
|
p = 10**9 + 7
N = int(input())
dp = [
[[[[0 for _ in range(4)] for _ in range(4)] for _ in range(4)] for _ in range(4)]
for _ in range(N + 1)
]
for j in range(4):
for k in range(4):
for l in range(4):
if (
not (j == 0 and k == 1 and l == 2)
and not (j == 0 and k == 2 and l == 1)
and not (j == 1 and k == 0 and l == 2)
):
dp[3][0][j][k][l] = 1
for n in range(4, N + 1):
for i in range(4):
for j in range(4):
for k in range(4):
for l in range(4):
if (
not (j == 0 and k == 1 and l == 2)
and not (j == 0 and k == 2 and l == 1)
and not (j == 1 and k == 0 and l == 2)
and not (i == 0 and k == 1 and l == 2)
and not (i == 0 and j == 1 and l == 2)
):
dp[n][i][j][k][l] = 0
for m in range(4):
dp[n][i][j][k][l] = (
dp[n][i][j][k][l] + dp[n - 1][m][i][j][k]
) % p
tot = 0
for i in range(4):
for j in range(4):
for k in range(4):
for l in range(4):
tot = (tot + dp[N][i][j][k][l]) % p
print(tot)
|
p = 10**9 + 7
N = int(eval(input()))
dp = [
[[[[0 for _ in range(4)] for _ in range(4)] for _ in range(4)] for _ in range(4)]
for _ in range(N + 1)
]
for i in range(4):
for j in range(4):
for k in range(4):
for l in range(4):
if i == 0:
dp[3][i][j][k][l] = 1
for i in range(4):
dp[3][i][0][1][2] = 0
dp[3][i][1][0][2] = 0
dp[3][i][0][2][1] = 0
for n in range(4, N + 1):
for i in range(4):
for j in range(4):
for k in range(4):
for l in range(4):
for x in range(4):
dp[n][i][j][k][l] = (
dp[n][i][j][k][l]
+ dp[n - 1][x][i][j][k]
* (str(j) + str(k) + str(l) != "012")
* (str(j) + str(k) + str(l) != "102")
* (str(j) + str(k) + str(l) != "021")
* (str(i) + str(k) + str(l) != "012")
* (str(i) + str(j) + str(l) != "012")
) % p
cnt = 0
for i in range(4):
for j in range(4):
for k in range(4):
for l in range(4):
cnt = (cnt + dp[N][i][j][k][l]) % p
print(cnt)
| false
| 13.793103
|
[
"-N = int(input())",
"+N = int(eval(input()))",
"-for j in range(4):",
"- for k in range(4):",
"- for l in range(4):",
"- if (",
"- not (j == 0 and k == 1 and l == 2)",
"- and not (j == 0 and k == 2 and l == 1)",
"- and not (j == 1 and k == 0 and l == 2)",
"- ):",
"- dp[3][0][j][k][l] = 1",
"+for i in range(4):",
"+ for j in range(4):",
"+ for k in range(4):",
"+ for l in range(4):",
"+ if i == 0:",
"+ dp[3][i][j][k][l] = 1",
"+for i in range(4):",
"+ dp[3][i][0][1][2] = 0",
"+ dp[3][i][1][0][2] = 0",
"+ dp[3][i][0][2][1] = 0",
"- if (",
"- not (j == 0 and k == 1 and l == 2)",
"- and not (j == 0 and k == 2 and l == 1)",
"- and not (j == 1 and k == 0 and l == 2)",
"- and not (i == 0 and k == 1 and l == 2)",
"- and not (i == 0 and j == 1 and l == 2)",
"- ):",
"- dp[n][i][j][k][l] = 0",
"- for m in range(4):",
"- dp[n][i][j][k][l] = (",
"- dp[n][i][j][k][l] + dp[n - 1][m][i][j][k]",
"- ) % p",
"-tot = 0",
"+ for x in range(4):",
"+ dp[n][i][j][k][l] = (",
"+ dp[n][i][j][k][l]",
"+ + dp[n - 1][x][i][j][k]",
"+ * (str(j) + str(k) + str(l) != \"012\")",
"+ * (str(j) + str(k) + str(l) != \"102\")",
"+ * (str(j) + str(k) + str(l) != \"021\")",
"+ * (str(i) + str(k) + str(l) != \"012\")",
"+ * (str(i) + str(j) + str(l) != \"012\")",
"+ ) % p",
"+cnt = 0",
"- tot = (tot + dp[N][i][j][k][l]) % p",
"-print(tot)",
"+ cnt = (cnt + dp[N][i][j][k][l]) % p",
"+print(cnt)"
] | false
| 0.039519
| 0.262341
| 0.15064
|
[
"s259975038",
"s953272929"
] |
u761320129
|
p03665
|
python
|
s104584507
|
s704934732
| 20
| 17
| 3,188
| 3,060
|
Accepted
|
Accepted
| 15
|
N,P = list(map(int, input().split()))
bs = list(map(int, input().split()))
even = 0
for i in range(N):
if bs[i]%2 == 0: even += 1
odd = N-even
f = [1]
for n in range(1, N+2):
f.append(f[-1] * n)
def ncr(n,r):
return f[n] // f[n-r] // f[r]
oddc = 0
for i in range(odd+1):
if i%2 != P : continue
oddc += ncr(odd,i)
print((pow(2,even) * oddc))
|
N,P = list(map(int,input().split()))
src = list(map(int,input().split()))
if all(a%2==0 for a in src):
if P:
print((0))
else:
print((2**N))
exit()
print((2**(N-1)))
| 20
| 10
| 377
| 190
|
N, P = list(map(int, input().split()))
bs = list(map(int, input().split()))
even = 0
for i in range(N):
if bs[i] % 2 == 0:
even += 1
odd = N - even
f = [1]
for n in range(1, N + 2):
f.append(f[-1] * n)
def ncr(n, r):
return f[n] // f[n - r] // f[r]
oddc = 0
for i in range(odd + 1):
if i % 2 != P:
continue
oddc += ncr(odd, i)
print((pow(2, even) * oddc))
|
N, P = list(map(int, input().split()))
src = list(map(int, input().split()))
if all(a % 2 == 0 for a in src):
if P:
print((0))
else:
print((2**N))
exit()
print((2 ** (N - 1)))
| false
| 50
|
[
"-bs = list(map(int, input().split()))",
"-even = 0",
"-for i in range(N):",
"- if bs[i] % 2 == 0:",
"- even += 1",
"-odd = N - even",
"-f = [1]",
"-for n in range(1, N + 2):",
"- f.append(f[-1] * n)",
"-",
"-",
"-def ncr(n, r):",
"- return f[n] // f[n - r] // f[r]",
"-",
"-",
"-oddc = 0",
"-for i in range(odd + 1):",
"- if i % 2 != P:",
"- continue",
"- oddc += ncr(odd, i)",
"-print((pow(2, even) * oddc))",
"+src = list(map(int, input().split()))",
"+if all(a % 2 == 0 for a in src):",
"+ if P:",
"+ print((0))",
"+ else:",
"+ print((2**N))",
"+ exit()",
"+print((2 ** (N - 1)))"
] | false
| 0.045003
| 0.042923
| 1.048481
|
[
"s104584507",
"s704934732"
] |
u285681431
|
p02983
|
python
|
s557480105
|
s628991096
| 644
| 65
| 9,156
| 65,392
|
Accepted
|
Accepted
| 89.91
|
L, R = list(map(int, input().split()))
# R-L>=2019なら、[L,R]に2019の倍数が必ず存在する
# すなわちiやjが2019の倍数をとりうる
if R - L >= 2019:
print((0))
else:
ans = 2019
for i in range(L, R + 1): # L<=i<=R
for j in range(i + 1, R + 1): # i<j<=R
ans = min(ans, i * j % 2019)
print(ans)
|
L, R = list(map(int, input().split()))
# R-L>=2019なら、[L,R]に2019の倍数が必ず存在する
if R - L >= 2019:
print((0))
else:
ans = 10**9
for i in range(L, R + 1): # L<=i<=R
for j in range(i + 1, R + 1): # i<j<=R
ans = min(ans, (i * j) % 2019)
print(ans)
| 11
| 10
| 298
| 277
|
L, R = list(map(int, input().split()))
# R-L>=2019なら、[L,R]に2019の倍数が必ず存在する
# すなわちiやjが2019の倍数をとりうる
if R - L >= 2019:
print((0))
else:
ans = 2019
for i in range(L, R + 1): # L<=i<=R
for j in range(i + 1, R + 1): # i<j<=R
ans = min(ans, i * j % 2019)
print(ans)
|
L, R = list(map(int, input().split()))
# R-L>=2019なら、[L,R]に2019の倍数が必ず存在する
if R - L >= 2019:
print((0))
else:
ans = 10**9
for i in range(L, R + 1): # L<=i<=R
for j in range(i + 1, R + 1): # i<j<=R
ans = min(ans, (i * j) % 2019)
print(ans)
| false
| 9.090909
|
[
"-# すなわちiやjが2019の倍数をとりうる",
"- ans = 2019",
"+ ans = 10**9",
"- ans = min(ans, i * j % 2019)",
"+ ans = min(ans, (i * j) % 2019)"
] | false
| 0.05066
| 0.044802
| 1.130746
|
[
"s557480105",
"s628991096"
] |
u997053690
|
p03401
|
python
|
s754964164
|
s758200014
| 1,229
| 172
| 18,728
| 11,132
|
Accepted
|
Accepted
| 86
|
# -*- coding: utf-8 -*-
import numpy as np
N = eval(input())
A = np.array(list(map(int, input().split())))
A = np.append(np.append([0], A), [0])
total_sum = 0
for i in range(0, len(A) - 1):
total_sum += np.abs(A[i + 1] - A[i])
for i in range(1, len(A) - 1):
partial_sum = total_sum - np.abs(A[i + 1] - A[i]) - np.abs(A[i] - A[i - 1]) + np.abs(A[i + 1] - A[i - 1])
print(partial_sum)
|
N = eval(input())
A = list(map(int, input().split()))
A = [0] + A + [0]
total_sum = 0
for i in range(0, len(A) - 1):
total_sum += abs(A[i + 1] - A[i])
for i in range(1, len(A) - 1):
partial_sum = total_sum - abs(A[i + 1] - A[i]) - abs(A[i] - A[i - 1]) + abs(A[i + 1] - A[i - 1])
print(partial_sum)
| 15
| 13
| 404
| 317
|
# -*- coding: utf-8 -*-
import numpy as np
N = eval(input())
A = np.array(list(map(int, input().split())))
A = np.append(np.append([0], A), [0])
total_sum = 0
for i in range(0, len(A) - 1):
total_sum += np.abs(A[i + 1] - A[i])
for i in range(1, len(A) - 1):
partial_sum = (
total_sum
- np.abs(A[i + 1] - A[i])
- np.abs(A[i] - A[i - 1])
+ np.abs(A[i + 1] - A[i - 1])
)
print(partial_sum)
|
N = eval(input())
A = list(map(int, input().split()))
A = [0] + A + [0]
total_sum = 0
for i in range(0, len(A) - 1):
total_sum += abs(A[i + 1] - A[i])
for i in range(1, len(A) - 1):
partial_sum = (
total_sum
- abs(A[i + 1] - A[i])
- abs(A[i] - A[i - 1])
+ abs(A[i + 1] - A[i - 1])
)
print(partial_sum)
| false
| 13.333333
|
[
"-# -*- coding: utf-8 -*-",
"-import numpy as np",
"-",
"-A = np.array(list(map(int, input().split())))",
"-A = np.append(np.append([0], A), [0])",
"+A = list(map(int, input().split()))",
"+A = [0] + A + [0]",
"- total_sum += np.abs(A[i + 1] - A[i])",
"+ total_sum += abs(A[i + 1] - A[i])",
"- - np.abs(A[i + 1] - A[i])",
"- - np.abs(A[i] - A[i - 1])",
"- + np.abs(A[i + 1] - A[i - 1])",
"+ - abs(A[i + 1] - A[i])",
"+ - abs(A[i] - A[i - 1])",
"+ + abs(A[i + 1] - A[i - 1])"
] | false
| 0.217393
| 0.074378
| 2.922794
|
[
"s754964164",
"s758200014"
] |
u281610856
|
p02715
|
python
|
s205018281
|
s235735660
| 348
| 87
| 15,580
| 74,548
|
Accepted
|
Accepted
| 75
|
n, k = list(map(int, input().split()))
MOD = 10 ** 9 + 7
cnt = [0] * (k + 1)
for gcd in range(1, k + 1):
cnt[gcd] = pow(k // gcd, n, MOD)
for gcd in range(k, 0, -1):
for i in range(2, k // gcd + 1):
cnt[gcd] -= cnt[gcd * i]
ans = sum([num * c for num, c in enumerate(cnt)]) % MOD
print(ans)
|
def main():
n, k = list(map(int, input().split()))
MOD = 10 ** 9 + 7
ans = 0
cnt = [0] * (k + 1)
for i in range(1, k + 1):
cnt[i] = pow(k // i, n, MOD)
for i in range(k, 0, -1):
for j in range(2, k // i + 1):
cnt[i] -= cnt[i * j]
ans = 0
for i, c in enumerate(cnt):
ans += i * c
ans %= MOD
print(ans)
if __name__ == '__main__':
main()
| 13
| 19
| 315
| 436
|
n, k = list(map(int, input().split()))
MOD = 10**9 + 7
cnt = [0] * (k + 1)
for gcd in range(1, k + 1):
cnt[gcd] = pow(k // gcd, n, MOD)
for gcd in range(k, 0, -1):
for i in range(2, k // gcd + 1):
cnt[gcd] -= cnt[gcd * i]
ans = sum([num * c for num, c in enumerate(cnt)]) % MOD
print(ans)
|
def main():
n, k = list(map(int, input().split()))
MOD = 10**9 + 7
ans = 0
cnt = [0] * (k + 1)
for i in range(1, k + 1):
cnt[i] = pow(k // i, n, MOD)
for i in range(k, 0, -1):
for j in range(2, k // i + 1):
cnt[i] -= cnt[i * j]
ans = 0
for i, c in enumerate(cnt):
ans += i * c
ans %= MOD
print(ans)
if __name__ == "__main__":
main()
| false
| 31.578947
|
[
"-n, k = list(map(int, input().split()))",
"-MOD = 10**9 + 7",
"-cnt = [0] * (k + 1)",
"-for gcd in range(1, k + 1):",
"- cnt[gcd] = pow(k // gcd, n, MOD)",
"-for gcd in range(k, 0, -1):",
"- for i in range(2, k // gcd + 1):",
"- cnt[gcd] -= cnt[gcd * i]",
"-ans = sum([num * c for num, c in enumerate(cnt)]) % MOD",
"-print(ans)",
"+def main():",
"+ n, k = list(map(int, input().split()))",
"+ MOD = 10**9 + 7",
"+ ans = 0",
"+ cnt = [0] * (k + 1)",
"+ for i in range(1, k + 1):",
"+ cnt[i] = pow(k // i, n, MOD)",
"+ for i in range(k, 0, -1):",
"+ for j in range(2, k // i + 1):",
"+ cnt[i] -= cnt[i * j]",
"+ ans = 0",
"+ for i, c in enumerate(cnt):",
"+ ans += i * c",
"+ ans %= MOD",
"+ print(ans)",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ main()"
] | false
| 0.183883
| 0.623614
| 0.294867
|
[
"s205018281",
"s235735660"
] |
u816488327
|
p02819
|
python
|
s080101577
|
s383119825
| 225
| 151
| 18,804
| 13,284
|
Accepted
|
Accepted
| 32.89
|
M = 10 ** 6
e = 10 ** 3
# the sieve of Eratosthenes
primes = [True] * (M + 1)
primes[0] = False
primes[1] = False
for i in range(2, e):
if primes[i]:
for j in range(i * 2, M + 1, i):
primes[j] = False
X = int(eval(input()))
print((X + primes[X:].index(1)))
|
# Primality test
import numpy as np
n = 100003 # limit
primes = np.ones((n + 1,), dtype=int)
primes[0] = 0
primes[1] = 0
primes[2*2::2] = 0
primes[3*2::3] = 0
m = 5
l = n ** 0.5
while m <= l:
if primes[m]:
primes[m * 2::m] = 0
if m % 6 == 5:
m += 2
else:
m += 4
primes = primes.nonzero()[0]
# solve
X = int(eval(input()))
idx = np.where(primes >= X)[0][0]
print((primes[idx]))
| 15
| 26
| 289
| 433
|
M = 10**6
e = 10**3
# the sieve of Eratosthenes
primes = [True] * (M + 1)
primes[0] = False
primes[1] = False
for i in range(2, e):
if primes[i]:
for j in range(i * 2, M + 1, i):
primes[j] = False
X = int(eval(input()))
print((X + primes[X:].index(1)))
|
# Primality test
import numpy as np
n = 100003 # limit
primes = np.ones((n + 1,), dtype=int)
primes[0] = 0
primes[1] = 0
primes[2 * 2 :: 2] = 0
primes[3 * 2 :: 3] = 0
m = 5
l = n**0.5
while m <= l:
if primes[m]:
primes[m * 2 :: m] = 0
if m % 6 == 5:
m += 2
else:
m += 4
primes = primes.nonzero()[0]
# solve
X = int(eval(input()))
idx = np.where(primes >= X)[0][0]
print((primes[idx]))
| false
| 42.307692
|
[
"-M = 10**6",
"-e = 10**3",
"-# the sieve of Eratosthenes",
"-primes = [True] * (M + 1)",
"-primes[0] = False",
"-primes[1] = False",
"-for i in range(2, e):",
"- if primes[i]:",
"- for j in range(i * 2, M + 1, i):",
"- primes[j] = False",
"+# Primality test",
"+import numpy as np",
"+",
"+n = 100003 # limit",
"+primes = np.ones((n + 1,), dtype=int)",
"+primes[0] = 0",
"+primes[1] = 0",
"+primes[2 * 2 :: 2] = 0",
"+primes[3 * 2 :: 3] = 0",
"+m = 5",
"+l = n**0.5",
"+while m <= l:",
"+ if primes[m]:",
"+ primes[m * 2 :: m] = 0",
"+ if m % 6 == 5:",
"+ m += 2",
"+ else:",
"+ m += 4",
"+primes = primes.nonzero()[0]",
"+# solve",
"-print((X + primes[X:].index(1)))",
"+idx = np.where(primes >= X)[0][0]",
"+print((primes[idx]))"
] | false
| 0.679417
| 0.826069
| 0.82247
|
[
"s080101577",
"s383119825"
] |
u600402037
|
p02732
|
python
|
s289188912
|
s400803973
| 671
| 301
| 115,464
| 51,644
|
Accepted
|
Accepted
| 55.14
|
# coding: utf-8
import sys
from math import factorial
from collections import Counter, defaultdict
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def comb(n, r): # 組み合わせ
if n <= 0 or r > n: return 0
return factorial(n) // factorial(n - r) // factorial(r)
N = ir()
A = lr()
counter = Counter(A)
case = 0
dic = defaultdict(int)
for k, v in list(counter.items()):
dic[k] = v
case += comb(v, 2)
for a in A:
num = dic[a]
answer = case - (num - 1)
print(answer)
|
# coding: utf-8
import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = np.array(lr(), dtype=np.int32)
counter = np.bincount(A)
case = (counter * (counter-1) // 2).sum()
answer = case - (counter[A] - 1)
print(('\n'.join(map(str, answer))))
| 26
| 14
| 569
| 348
|
# coding: utf-8
import sys
from math import factorial
from collections import Counter, defaultdict
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def comb(n, r): # 組み合わせ
if n <= 0 or r > n:
return 0
return factorial(n) // factorial(n - r) // factorial(r)
N = ir()
A = lr()
counter = Counter(A)
case = 0
dic = defaultdict(int)
for k, v in list(counter.items()):
dic[k] = v
case += comb(v, 2)
for a in A:
num = dic[a]
answer = case - (num - 1)
print(answer)
|
# coding: utf-8
import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = np.array(lr(), dtype=np.int32)
counter = np.bincount(A)
case = (counter * (counter - 1) // 2).sum()
answer = case - (counter[A] - 1)
print(("\n".join(map(str, answer))))
| false
| 46.153846
|
[
"-from math import factorial",
"-from collections import Counter, defaultdict",
"+import numpy as np",
"-",
"-",
"-def comb(n, r): # 組み合わせ",
"- if n <= 0 or r > n:",
"- return 0",
"- return factorial(n) // factorial(n - r) // factorial(r)",
"-",
"-",
"-A = lr()",
"-counter = Counter(A)",
"-case = 0",
"-dic = defaultdict(int)",
"-for k, v in list(counter.items()):",
"- dic[k] = v",
"- case += comb(v, 2)",
"-for a in A:",
"- num = dic[a]",
"- answer = case - (num - 1)",
"- print(answer)",
"+A = np.array(lr(), dtype=np.int32)",
"+counter = np.bincount(A)",
"+case = (counter * (counter - 1) // 2).sum()",
"+answer = case - (counter[A] - 1)",
"+print((\"\\n\".join(map(str, answer))))"
] | false
| 0.038285
| 0.281399
| 0.136051
|
[
"s289188912",
"s400803973"
] |
u108934099
|
p03387
|
python
|
s034045598
|
s028059938
| 28
| 24
| 9,032
| 9,076
|
Accepted
|
Accepted
| 14.29
|
a = list(map(int,input().split()))
a.sort()
if (a[1]-a[0]) % 2 == 0:
print(((a[1]-a[0])//2 + (a[2]-a[1])))
else:
print(((a[2]-a[1])//2 + (a[2]-a[1])%2 + (a[2]-a[0]+1)//2 + 1))
|
a = list(map(int,input().split()))
M = max(a)
if (3 * M - sum(a))%2 == 0:
print(((3 * M - sum(a))//2))
else:
print(((3 * (M+1) - sum(a))//2))
| 6
| 6
| 188
| 150
|
a = list(map(int, input().split()))
a.sort()
if (a[1] - a[0]) % 2 == 0:
print(((a[1] - a[0]) // 2 + (a[2] - a[1])))
else:
print(((a[2] - a[1]) // 2 + (a[2] - a[1]) % 2 + (a[2] - a[0] + 1) // 2 + 1))
|
a = list(map(int, input().split()))
M = max(a)
if (3 * M - sum(a)) % 2 == 0:
print(((3 * M - sum(a)) // 2))
else:
print(((3 * (M + 1) - sum(a)) // 2))
| false
| 0
|
[
"-a.sort()",
"-if (a[1] - a[0]) % 2 == 0:",
"- print(((a[1] - a[0]) // 2 + (a[2] - a[1])))",
"+M = max(a)",
"+if (3 * M - sum(a)) % 2 == 0:",
"+ print(((3 * M - sum(a)) // 2))",
"- print(((a[2] - a[1]) // 2 + (a[2] - a[1]) % 2 + (a[2] - a[0] + 1) // 2 + 1))",
"+ print(((3 * (M + 1) - sum(a)) // 2))"
] | false
| 0.038989
| 0.037196
| 1.048198
|
[
"s034045598",
"s028059938"
] |
u125269142
|
p03720
|
python
|
s960438044
|
s492256131
| 30
| 26
| 9,164
| 9,120
|
Accepted
|
Accepted
| 13.33
|
n, m = list(map(int, input().split()))
route_lists = [input().split() for i in range(m)]
new_lists = []
for i in route_lists:
for j in range(2):
new_lists.append(i[j])
new_lists.sort()
for i in range(1, n+1, 1):
print((new_lists.count(str(i))))
|
n, m = list(map(int, input().split()))
route_lists = [input().split() for i in range(m)]
new_lists = []
for i in route_lists:
for j in range(2):
new_lists.append(i[j])
for i in range(1, n+1, 1):
print((new_lists.count(str(i))))
| 10
| 9
| 538
| 500
|
n, m = list(map(int, input().split()))
route_lists = [input().split() for i in range(m)]
new_lists = []
for i in route_lists:
for j in range(2):
new_lists.append(i[j])
new_lists.sort()
for i in range(1, n + 1, 1):
print((new_lists.count(str(i))))
|
n, m = list(map(int, input().split()))
route_lists = [input().split() for i in range(m)]
new_lists = []
for i in route_lists:
for j in range(2):
new_lists.append(i[j])
for i in range(1, n + 1, 1):
print((new_lists.count(str(i))))
| false
| 10
|
[
"-new_lists.sort()"
] | false
| 0.035875
| 0.035809
| 1.001834
|
[
"s960438044",
"s492256131"
] |
u881590806
|
p02256
|
python
|
s428874800
|
s765609615
| 30
| 10
| 6,388
| 6,400
|
Accepted
|
Accepted
| 66.67
|
def gcd(a,b):
if b == 1:
return 1
elif b == 0:
return a
else:
return gcd(b,a%b)
a,b = list(map(int, input().split(' ')))
if a > b:
print(gcd(a,b))
else:
print(gcd(b,a))
|
a,b = list(map(int,input().split(' ')))
def gcd(a,b):
if a < b:
a,b = b,a
if a%b==0:
return b
else:
return gcd(b,a%b)
print(gcd(a,b))
| 13
| 11
| 221
| 178
|
def gcd(a, b):
if b == 1:
return 1
elif b == 0:
return a
else:
return gcd(b, a % b)
a, b = list(map(int, input().split(" ")))
if a > b:
print(gcd(a, b))
else:
print(gcd(b, a))
|
a, b = list(map(int, input().split(" ")))
def gcd(a, b):
if a < b:
a, b = b, a
if a % b == 0:
return b
else:
return gcd(b, a % b)
print(gcd(a, b))
| false
| 15.384615
|
[
"+a, b = list(map(int, input().split(\" \")))",
"+",
"+",
"- if b == 1:",
"- return 1",
"- elif b == 0:",
"- return a",
"+ if a < b:",
"+ a, b = b, a",
"+ if a % b == 0:",
"+ return b",
"-a, b = list(map(int, input().split(\" \")))",
"-if a > b:",
"- print(gcd(a, b))",
"-else:",
"- print(gcd(b, a))",
"+print(gcd(a, b))"
] | false
| 0.036223
| 0.0368
| 0.984308
|
[
"s428874800",
"s765609615"
] |
u242031676
|
p02953
|
python
|
s653931928
|
s720134649
| 94
| 74
| 14,108
| 14,180
|
Accepted
|
Accepted
| 21.28
|
n, *a = list(map(int, open(0).read().split()))
for i in range(n): a[i] -= a[0]
mx = cant = 0
for i in range(n):
mx = max(mx, a[i])
if a[i]<mx-1: cant = True
print(("YNeos"[cant::2]))
|
n, *k = list(map(int, open(0).read().split()))
mx = cant = 0
for i in k:
mx = max(mx, i)
if mx-i>1: cant = True
print(("YNeos"[cant::2]))
| 9
| 6
| 192
| 150
|
n, *a = list(map(int, open(0).read().split()))
for i in range(n):
a[i] -= a[0]
mx = cant = 0
for i in range(n):
mx = max(mx, a[i])
if a[i] < mx - 1:
cant = True
print(("YNeos"[cant::2]))
|
n, *k = list(map(int, open(0).read().split()))
mx = cant = 0
for i in k:
mx = max(mx, i)
if mx - i > 1:
cant = True
print(("YNeos"[cant::2]))
| false
| 33.333333
|
[
"-n, *a = list(map(int, open(0).read().split()))",
"-for i in range(n):",
"- a[i] -= a[0]",
"+n, *k = list(map(int, open(0).read().split()))",
"-for i in range(n):",
"- mx = max(mx, a[i])",
"- if a[i] < mx - 1:",
"+for i in k:",
"+ mx = max(mx, i)",
"+ if mx - i > 1:"
] | false
| 0.040582
| 0.042414
| 0.956814
|
[
"s653931928",
"s720134649"
] |
u175034939
|
p02881
|
python
|
s607194010
|
s294539190
| 195
| 155
| 3,064
| 3,060
|
Accepted
|
Accepted
| 20.51
|
n = int(eval(input()))
def is_prime(num):
import math
if num == 2:
return True
elif num < 3 or num % 2 == 0:
return False
for i in range(3, int(math.sqrt(num)) + 1, 2):
if num % i == 0:
return False
return True
if is_prime(n):
print((n-1))
exit()
ans = float('inf')
for i in range(int(n**0.5), 0, -1):
if n%i == 0:
ans = min(ans, (i-1)+(n//i-1))
print(ans)
|
n = int(eval(input()))
ans = float('inf')
for i in range(int(n**0.5), 0, -1):
if n%i == 0:
ans = min(ans, (i-1)+(n//i-1))
print(ans)
| 21
| 6
| 447
| 143
|
n = int(eval(input()))
def is_prime(num):
import math
if num == 2:
return True
elif num < 3 or num % 2 == 0:
return False
for i in range(3, int(math.sqrt(num)) + 1, 2):
if num % i == 0:
return False
return True
if is_prime(n):
print((n - 1))
exit()
ans = float("inf")
for i in range(int(n**0.5), 0, -1):
if n % i == 0:
ans = min(ans, (i - 1) + (n // i - 1))
print(ans)
|
n = int(eval(input()))
ans = float("inf")
for i in range(int(n**0.5), 0, -1):
if n % i == 0:
ans = min(ans, (i - 1) + (n // i - 1))
print(ans)
| false
| 71.428571
|
[
"-",
"-",
"-def is_prime(num):",
"- import math",
"-",
"- if num == 2:",
"- return True",
"- elif num < 3 or num % 2 == 0:",
"- return False",
"- for i in range(3, int(math.sqrt(num)) + 1, 2):",
"- if num % i == 0:",
"- return False",
"- return True",
"-",
"-",
"-if is_prime(n):",
"- print((n - 1))",
"- exit()"
] | false
| 0.124505
| 0.098329
| 1.266211
|
[
"s607194010",
"s294539190"
] |
u888100977
|
p02936
|
python
|
s927707325
|
s418448666
| 1,884
| 1,706
| 268,436
| 268,436
|
Accepted
|
Accepted
| 9.45
|
import sys
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
n, q = list(map(int,input().split()))
g = [[] for _ in range(n+1)]
for _ in range(n-1):
a,b = list(map(int,input().split()))
g[a].append(b)
g[b].append(a)
points = [0]*(n+1)
for _ in range(q):
p, x = list(map(int,input().split()))
points[p] += x
# print(g)
# print(points)
def dfs(e,preve = -1):
for nexte in g[e]:
# print(nexte)
if nexte == preve:
continue
points[nexte] = points[nexte] + points[e]
dfs(nexte,e)
dfs(1)
print((*points[1:]))
|
import sys
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()
n, q = list(map(int,input().split()))
g = [[] for _ in range(n+1)]
for _ in range(n-1):
a,b = list(map(int,input().split()))
g[a].append(b)
g[b].append(a)
points = [0]*(n+1)
for _ in range(q):
p, x = list(map(int,input().split()))
points[p] += x
# print(g)
# print(points)
def dfs(e,preve = -1):
for nexte in g[e]:
# print(nexte)
if nexte == preve:
continue
points[nexte] = points[nexte] + points[e]
dfs(nexte,e)
dfs(1)
print((*points[1:]))
| 28
| 28
| 610
| 605
|
import sys
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
n, q = list(map(int, input().split()))
g = [[] for _ in range(n + 1)]
for _ in range(n - 1):
a, b = list(map(int, input().split()))
g[a].append(b)
g[b].append(a)
points = [0] * (n + 1)
for _ in range(q):
p, x = list(map(int, input().split()))
points[p] += x
# print(g)
# print(points)
def dfs(e, preve=-1):
for nexte in g[e]:
# print(nexte)
if nexte == preve:
continue
points[nexte] = points[nexte] + points[e]
dfs(nexte, e)
dfs(1)
print((*points[1:]))
|
import sys
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()
n, q = list(map(int, input().split()))
g = [[] for _ in range(n + 1)]
for _ in range(n - 1):
a, b = list(map(int, input().split()))
g[a].append(b)
g[b].append(a)
points = [0] * (n + 1)
for _ in range(q):
p, x = list(map(int, input().split()))
points[p] += x
# print(g)
# print(points)
def dfs(e, preve=-1):
for nexte in g[e]:
# print(nexte)
if nexte == preve:
continue
points[nexte] = points[nexte] + points[e]
dfs(nexte, e)
dfs(1)
print((*points[1:]))
| false
| 0
|
[
"- return sys.stdin.readline()[:-1]",
"+ return sys.stdin.readline()"
] | false
| 0.039394
| 0.045457
| 0.866631
|
[
"s927707325",
"s418448666"
] |
u411203878
|
p03774
|
python
|
s941254405
|
s520004909
| 182
| 65
| 39,280
| 68,436
|
Accepted
|
Accepted
| 64.29
|
n,m = list(map(int,input().split()))
ab = []
for _ in range(n):
a, b = (int(x) for x in input().split())
ab.append([a, b])
cd = []
for _ in range(m):
c, d = (int(x) for x in input().split())
cd.append([c, d])
for a,b in ab:
ans = 10000000000000000000000
for k,c in enumerate(cd):
memo = abs(a-c[0])+abs(b-c[1])
if memo<ans:
ans=memo
ansnum=k
print((ansnum+1))
|
N,M = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(N)]
CD = [list(map(int,input().split())) for _ in range(M)]
for a,b in AB:
tmp_point = -1
tmp_root = 100000000000
for i,cd in enumerate(CD):
c,d = cd
if abs(a-c)+abs(b-d) < tmp_root:
tmp_root = abs(a-c)+abs(b-d)
tmp_point = i+1
print(tmp_point)
| 18
| 15
| 437
| 400
|
n, m = list(map(int, input().split()))
ab = []
for _ in range(n):
a, b = (int(x) for x in input().split())
ab.append([a, b])
cd = []
for _ in range(m):
c, d = (int(x) for x in input().split())
cd.append([c, d])
for a, b in ab:
ans = 10000000000000000000000
for k, c in enumerate(cd):
memo = abs(a - c[0]) + abs(b - c[1])
if memo < ans:
ans = memo
ansnum = k
print((ansnum + 1))
|
N, M = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
CD = [list(map(int, input().split())) for _ in range(M)]
for a, b in AB:
tmp_point = -1
tmp_root = 100000000000
for i, cd in enumerate(CD):
c, d = cd
if abs(a - c) + abs(b - d) < tmp_root:
tmp_root = abs(a - c) + abs(b - d)
tmp_point = i + 1
print(tmp_point)
| false
| 16.666667
|
[
"-n, m = list(map(int, input().split()))",
"-ab = []",
"-for _ in range(n):",
"- a, b = (int(x) for x in input().split())",
"- ab.append([a, b])",
"-cd = []",
"-for _ in range(m):",
"- c, d = (int(x) for x in input().split())",
"- cd.append([c, d])",
"-for a, b in ab:",
"- ans = 10000000000000000000000",
"- for k, c in enumerate(cd):",
"- memo = abs(a - c[0]) + abs(b - c[1])",
"- if memo < ans:",
"- ans = memo",
"- ansnum = k",
"- print((ansnum + 1))",
"+N, M = list(map(int, input().split()))",
"+AB = [list(map(int, input().split())) for _ in range(N)]",
"+CD = [list(map(int, input().split())) for _ in range(M)]",
"+for a, b in AB:",
"+ tmp_point = -1",
"+ tmp_root = 100000000000",
"+ for i, cd in enumerate(CD):",
"+ c, d = cd",
"+ if abs(a - c) + abs(b - d) < tmp_root:",
"+ tmp_root = abs(a - c) + abs(b - d)",
"+ tmp_point = i + 1",
"+ print(tmp_point)"
] | false
| 0.037087
| 0.007788
| 4.761914
|
[
"s941254405",
"s520004909"
] |
u968166680
|
p02820
|
python
|
s654352661
|
s140431552
| 263
| 123
| 22,764
| 94,304
|
Accepted
|
Accepted
| 53.23
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K = list(map(int, readline().split()))
point = list(map(int, readline().split()))
T = readline().strip()
T = list(map(int, T.translate(str.maketrans('rsp', '012'))))
ans = 0
for i in range(K):
M = (N - i + K - 1) // K
dp = [[0] * 3 for _ in range(M + 1)]
for j in range(M):
for k in range(3):
dp[j + 1][k] = max(dp[j][(k + 1) % 3], dp[j][(k + 2) % 3])
if (k + 1) % 3 == T[i + j * K]:
dp[j + 1][k] += point[k]
ans += max(dp[M])
print(ans)
return
if __name__ == '__main__':
main()
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K = list(map(int, readline().split()))
point = list(map(int, readline().split()))
T = readline().strip()
T = T.translate(str.maketrans('rsp', '012'))
T = list(map(int, T))
ans = 0
for i in range(K):
vec = T[i::K]
M = len(vec)
dp = [[0] * 3 for _ in range(M + 1)]
for j in range(M):
for k in range(3):
dp[j + 1][k] = max(dp[j][(k + 1) % 3], dp[j][(k + 2) % 3])
if (k + 1) % 3 == vec[j]:
dp[j + 1][k] += point[k]
ans += max(dp[M])
print(ans)
return
if __name__ == '__main__':
main()
| 34
| 37
| 818
| 836
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K = list(map(int, readline().split()))
point = list(map(int, readline().split()))
T = readline().strip()
T = list(map(int, T.translate(str.maketrans("rsp", "012"))))
ans = 0
for i in range(K):
M = (N - i + K - 1) // K
dp = [[0] * 3 for _ in range(M + 1)]
for j in range(M):
for k in range(3):
dp[j + 1][k] = max(dp[j][(k + 1) % 3], dp[j][(k + 2) % 3])
if (k + 1) % 3 == T[i + j * K]:
dp[j + 1][k] += point[k]
ans += max(dp[M])
print(ans)
return
if __name__ == "__main__":
main()
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K = list(map(int, readline().split()))
point = list(map(int, readline().split()))
T = readline().strip()
T = T.translate(str.maketrans("rsp", "012"))
T = list(map(int, T))
ans = 0
for i in range(K):
vec = T[i::K]
M = len(vec)
dp = [[0] * 3 for _ in range(M + 1)]
for j in range(M):
for k in range(3):
dp[j + 1][k] = max(dp[j][(k + 1) % 3], dp[j][(k + 2) % 3])
if (k + 1) % 3 == vec[j]:
dp[j + 1][k] += point[k]
ans += max(dp[M])
print(ans)
return
if __name__ == "__main__":
main()
| false
| 8.108108
|
[
"- T = list(map(int, T.translate(str.maketrans(\"rsp\", \"012\"))))",
"+ T = T.translate(str.maketrans(\"rsp\", \"012\"))",
"+ T = list(map(int, T))",
"- M = (N - i + K - 1) // K",
"+ vec = T[i::K]",
"+ M = len(vec)",
"- if (k + 1) % 3 == T[i + j * K]:",
"+ if (k + 1) % 3 == vec[j]:"
] | false
| 0.106125
| 0.178897
| 0.593215
|
[
"s654352661",
"s140431552"
] |
u379629675
|
p02839
|
python
|
s179123859
|
s026171571
| 282
| 215
| 59,356
| 51,548
|
Accepted
|
Accepted
| 23.76
|
H, W = [int(x) for x in input().split()]
A = [[0]*W for i in range(H)]
for c in [1, -1]:
for i in range(H):
arr = [int(x) for x in input().split()]
for j in range(W):
A[i][j] += arr[j] * c
M = 160*80
dp = [[0]*W for i in range(H)]
dp[0][0] = 1 << M
for i in range(H):
for j in range(W):
if i > 0:
dp[i][j] |= dp[i-1][j]
if j > 0:
dp[i][j] |= dp[i][j-1]
a = abs(A[i][j])
dp[i][j] = (dp[i][j] << a) | (dp[i][j] >> a)
ans = M
for i in range(2*M):
if dp[H-1][W-1] & (1 << i) > 0:
ans = min(ans, abs(M-i))
print(ans)
|
# -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# template
def resolve():
ofs = 6400
h, w = list(map(int, readline().split()))
A = [list(map(int, readline().split())) for _ in range(h)]
B = [list(map(int, readline().split())) for _ in range(h)]
dp = [[0]*w for _ in range(h)]
x = abs(A[0][0]-B[0][0])
dp[0][0] |= ((1 << (ofs+x)) | (1 << (ofs-x)))
from itertools import product
for i, j in product(list(range(h)), list(range(w))):
x = abs(A[i][j]-B[i][j])
t = 0
if(i-1 >= 0):
t |= dp[i-1][j]
if(j-1 >= 0):
t |= dp[i][j-1]
dp[i][j] |= ((t << x) | (t >> x))
for i, s in enumerate(bin(dp[-1][-1])[-ofs-1:]):
if(s == '1'):
print(i)
return
if __name__ == "__main__":
INF = float("inf")
MOD = 10**9+7
resolve()
| 26
| 37
| 644
| 968
|
H, W = [int(x) for x in input().split()]
A = [[0] * W for i in range(H)]
for c in [1, -1]:
for i in range(H):
arr = [int(x) for x in input().split()]
for j in range(W):
A[i][j] += arr[j] * c
M = 160 * 80
dp = [[0] * W for i in range(H)]
dp[0][0] = 1 << M
for i in range(H):
for j in range(W):
if i > 0:
dp[i][j] |= dp[i - 1][j]
if j > 0:
dp[i][j] |= dp[i][j - 1]
a = abs(A[i][j])
dp[i][j] = (dp[i][j] << a) | (dp[i][j] >> a)
ans = M
for i in range(2 * M):
if dp[H - 1][W - 1] & (1 << i) > 0:
ans = min(ans, abs(M - i))
print(ans)
|
# -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# template
def resolve():
ofs = 6400
h, w = list(map(int, readline().split()))
A = [list(map(int, readline().split())) for _ in range(h)]
B = [list(map(int, readline().split())) for _ in range(h)]
dp = [[0] * w for _ in range(h)]
x = abs(A[0][0] - B[0][0])
dp[0][0] |= (1 << (ofs + x)) | (1 << (ofs - x))
from itertools import product
for i, j in product(list(range(h)), list(range(w))):
x = abs(A[i][j] - B[i][j])
t = 0
if i - 1 >= 0:
t |= dp[i - 1][j]
if j - 1 >= 0:
t |= dp[i][j - 1]
dp[i][j] |= (t << x) | (t >> x)
for i, s in enumerate(bin(dp[-1][-1])[-ofs - 1 :]):
if s == "1":
print(i)
return
if __name__ == "__main__":
INF = float("inf")
MOD = 10**9 + 7
resolve()
| false
| 29.72973
|
[
"-H, W = [int(x) for x in input().split()]",
"-A = [[0] * W for i in range(H)]",
"-for c in [1, -1]:",
"- for i in range(H):",
"- arr = [int(x) for x in input().split()]",
"- for j in range(W):",
"- A[i][j] += arr[j] * c",
"-M = 160 * 80",
"-dp = [[0] * W for i in range(H)]",
"-dp[0][0] = 1 << M",
"-for i in range(H):",
"- for j in range(W):",
"- if i > 0:",
"- dp[i][j] |= dp[i - 1][j]",
"- if j > 0:",
"- dp[i][j] |= dp[i][j - 1]",
"- a = abs(A[i][j])",
"- dp[i][j] = (dp[i][j] << a) | (dp[i][j] >> a)",
"-ans = M",
"-for i in range(2 * M):",
"- if dp[H - 1][W - 1] & (1 << i) > 0:",
"- ans = min(ans, abs(M - i))",
"-print(ans)",
"+# -*- coding: utf-8 -*-",
"+import sys",
"+",
"+read = sys.stdin.buffer.read",
"+readline = sys.stdin.buffer.readline",
"+readlines = sys.stdin.buffer.readlines",
"+# template",
"+def resolve():",
"+ ofs = 6400",
"+ h, w = list(map(int, readline().split()))",
"+ A = [list(map(int, readline().split())) for _ in range(h)]",
"+ B = [list(map(int, readline().split())) for _ in range(h)]",
"+ dp = [[0] * w for _ in range(h)]",
"+ x = abs(A[0][0] - B[0][0])",
"+ dp[0][0] |= (1 << (ofs + x)) | (1 << (ofs - x))",
"+ from itertools import product",
"+",
"+ for i, j in product(list(range(h)), list(range(w))):",
"+ x = abs(A[i][j] - B[i][j])",
"+ t = 0",
"+ if i - 1 >= 0:",
"+ t |= dp[i - 1][j]",
"+ if j - 1 >= 0:",
"+ t |= dp[i][j - 1]",
"+ dp[i][j] |= (t << x) | (t >> x)",
"+ for i, s in enumerate(bin(dp[-1][-1])[-ofs - 1 :]):",
"+ if s == \"1\":",
"+ print(i)",
"+ return",
"+",
"+",
"+if __name__ == \"__main__\":",
"+ INF = float(\"inf\")",
"+ MOD = 10**9 + 7",
"+ resolve()"
] | false
| 0.083306
| 0.042272
| 1.970722
|
[
"s179123859",
"s026171571"
] |
u074220993
|
p03803
|
python
|
s906992489
|
s273281320
| 29
| 25
| 9,080
| 9,024
|
Accepted
|
Accepted
| 13.79
|
A, B = list(map(int, input().split()))
if A == 1 and B == 13:
winner = "Alice"
elif A == 13 and B == 1:
winner = "Bob"
elif A > B:
winner = "Alice"
elif A < B:
winner = "Bob"
else:
winner = "Draw"
print(winner)
|
A, B = [int(x) if int(x)> 1 else 14 for x in input().split()]
if A > B:
print('Alice')
if A == B:
print('Draw')
if A < B:
print('Bob')
| 12
| 7
| 235
| 156
|
A, B = list(map(int, input().split()))
if A == 1 and B == 13:
winner = "Alice"
elif A == 13 and B == 1:
winner = "Bob"
elif A > B:
winner = "Alice"
elif A < B:
winner = "Bob"
else:
winner = "Draw"
print(winner)
|
A, B = [int(x) if int(x) > 1 else 14 for x in input().split()]
if A > B:
print("Alice")
if A == B:
print("Draw")
if A < B:
print("Bob")
| false
| 41.666667
|
[
"-A, B = list(map(int, input().split()))",
"-if A == 1 and B == 13:",
"- winner = \"Alice\"",
"-elif A == 13 and B == 1:",
"- winner = \"Bob\"",
"-elif A > B:",
"- winner = \"Alice\"",
"-elif A < B:",
"- winner = \"Bob\"",
"-else:",
"- winner = \"Draw\"",
"-print(winner)",
"+A, B = [int(x) if int(x) > 1 else 14 for x in input().split()]",
"+if A > B:",
"+ print(\"Alice\")",
"+if A == B:",
"+ print(\"Draw\")",
"+if A < B:",
"+ print(\"Bob\")"
] | false
| 0.006823
| 0.042884
| 0.159098
|
[
"s906992489",
"s273281320"
] |
u608088992
|
p03361
|
python
|
s693177962
|
s126760101
| 22
| 18
| 3,064
| 3,064
|
Accepted
|
Accepted
| 18.18
|
H, W = list(map(int, input().split()))
S = [eval(input()) for i in range(H)]
def singleB(i, j):
search = [(-1, 0), (1, 0), (0, -1), (0, 1)]
single = True
for s in search:
if 0 <= i+s[0] <= H-1 and 0 <= j+s[1] <= W-1:
if S[i+s[0]][j+s[1]] == "#":
single = False
return single
Success = True
for i in range(H):
for j in range(W):
if S[i][j] == "#":
if singleB(i, j):
Success = False
print(("Yes" if Success else "No"))
|
import sys
def solve():
H, W = list(map(int, input().split()))
S = [eval(input()) for _ in range(H)]
search = [(-1, 0), (1, 0), (0, -1), (0, 1)]
possible = True
for h in range(H):
for w in range(W):
if S[h][w] == "#":
for dh, dw in search:
if 0 <= h + dh < H and 0 <= w + dw < W:
if S[h+dh][w+dw] == "#":
break
else:
possible = False
break
if not possible: break
print(("Yes" if possible else "No"))
return 0
if __name__ == "__main__":
solve()
| 19
| 24
| 526
| 663
|
H, W = list(map(int, input().split()))
S = [eval(input()) for i in range(H)]
def singleB(i, j):
search = [(-1, 0), (1, 0), (0, -1), (0, 1)]
single = True
for s in search:
if 0 <= i + s[0] <= H - 1 and 0 <= j + s[1] <= W - 1:
if S[i + s[0]][j + s[1]] == "#":
single = False
return single
Success = True
for i in range(H):
for j in range(W):
if S[i][j] == "#":
if singleB(i, j):
Success = False
print(("Yes" if Success else "No"))
|
import sys
def solve():
H, W = list(map(int, input().split()))
S = [eval(input()) for _ in range(H)]
search = [(-1, 0), (1, 0), (0, -1), (0, 1)]
possible = True
for h in range(H):
for w in range(W):
if S[h][w] == "#":
for dh, dw in search:
if 0 <= h + dh < H and 0 <= w + dw < W:
if S[h + dh][w + dw] == "#":
break
else:
possible = False
break
if not possible:
break
print(("Yes" if possible else "No"))
return 0
if __name__ == "__main__":
solve()
| false
| 20.833333
|
[
"-H, W = list(map(int, input().split()))",
"-S = [eval(input()) for i in range(H)]",
"+import sys",
"-def singleB(i, j):",
"+def solve():",
"+ H, W = list(map(int, input().split()))",
"+ S = [eval(input()) for _ in range(H)]",
"- single = True",
"- for s in search:",
"- if 0 <= i + s[0] <= H - 1 and 0 <= j + s[1] <= W - 1:",
"- if S[i + s[0]][j + s[1]] == \"#\":",
"- single = False",
"- return single",
"+ possible = True",
"+ for h in range(H):",
"+ for w in range(W):",
"+ if S[h][w] == \"#\":",
"+ for dh, dw in search:",
"+ if 0 <= h + dh < H and 0 <= w + dw < W:",
"+ if S[h + dh][w + dw] == \"#\":",
"+ break",
"+ else:",
"+ possible = False",
"+ break",
"+ if not possible:",
"+ break",
"+ print((\"Yes\" if possible else \"No\"))",
"+ return 0",
"-Success = True",
"-for i in range(H):",
"- for j in range(W):",
"- if S[i][j] == \"#\":",
"- if singleB(i, j):",
"- Success = False",
"-print((\"Yes\" if Success else \"No\"))",
"+if __name__ == \"__main__\":",
"+ solve()"
] | false
| 0.045183
| 0.085993
| 0.525431
|
[
"s693177962",
"s126760101"
] |
u620480037
|
p03724
|
python
|
s043894927
|
s370891742
| 326
| 211
| 3,888
| 9,992
|
Accepted
|
Accepted
| 35.28
|
N,M=list(map(int,input().split()))
L=[0 for i in range(N+1)]
for i in range(M):
a,b=list(map(int,input().split()))
L[a]+=1
L[b]+=1
for _ in range(N+1):
if L[_]%2==1:
print("NO")
exit()
print("YES")
|
N,M=list(map(int,input().split()))
L=[0 for i in range(N+1)]
for i in range(M):
a,b=list(map(int,input().split()))
L[a]+=1
L[b]+=1
for i in range(1,len(L)):
if L[i]%2==1:
print("NO")
exit()
print("YES")
| 12
| 12
| 229
| 234
|
N, M = list(map(int, input().split()))
L = [0 for i in range(N + 1)]
for i in range(M):
a, b = list(map(int, input().split()))
L[a] += 1
L[b] += 1
for _ in range(N + 1):
if L[_] % 2 == 1:
print("NO")
exit()
print("YES")
|
N, M = list(map(int, input().split()))
L = [0 for i in range(N + 1)]
for i in range(M):
a, b = list(map(int, input().split()))
L[a] += 1
L[b] += 1
for i in range(1, len(L)):
if L[i] % 2 == 1:
print("NO")
exit()
print("YES")
| false
| 0
|
[
"-for _ in range(N + 1):",
"- if L[_] % 2 == 1:",
"+for i in range(1, len(L)):",
"+ if L[i] % 2 == 1:"
] | false
| 0.095252
| 0.105155
| 0.905825
|
[
"s043894927",
"s370891742"
] |
u626467464
|
p03478
|
python
|
s424444544
|
s473282531
| 50
| 34
| 3,564
| 3,424
|
Accepted
|
Accepted
| 32
|
line = list(map(int,input().split()))
n = line[0]
a = line[1]
b = line[2]
nums = []
for num in range(n+1):
sowa = 0
count = len(str(num))
for i in range(count):
num = str(num)
sowa += int(num[i])
if a <= sowa and sowa <= b:
nums.append(num)
answer = 0
for j in nums:
answer += int(j)
print(answer)
|
n,a,b = list(map(int,input().split()))
nums = []
for i in range(1,n+1):
summ = sum(list(map(int,str(i))))
if a <= summ <= b:
nums.append(i)
print((sum(nums)))
| 18
| 7
| 337
| 164
|
line = list(map(int, input().split()))
n = line[0]
a = line[1]
b = line[2]
nums = []
for num in range(n + 1):
sowa = 0
count = len(str(num))
for i in range(count):
num = str(num)
sowa += int(num[i])
if a <= sowa and sowa <= b:
nums.append(num)
answer = 0
for j in nums:
answer += int(j)
print(answer)
|
n, a, b = list(map(int, input().split()))
nums = []
for i in range(1, n + 1):
summ = sum(list(map(int, str(i))))
if a <= summ <= b:
nums.append(i)
print((sum(nums)))
| false
| 61.111111
|
[
"-line = list(map(int, input().split()))",
"-n = line[0]",
"-a = line[1]",
"-b = line[2]",
"+n, a, b = list(map(int, input().split()))",
"-for num in range(n + 1):",
"- sowa = 0",
"- count = len(str(num))",
"- for i in range(count):",
"- num = str(num)",
"- sowa += int(num[i])",
"- if a <= sowa and sowa <= b:",
"- nums.append(num)",
"-answer = 0",
"-for j in nums:",
"- answer += int(j)",
"-print(answer)",
"+for i in range(1, n + 1):",
"+ summ = sum(list(map(int, str(i))))",
"+ if a <= summ <= b:",
"+ nums.append(i)",
"+print((sum(nums)))"
] | false
| 0.052963
| 0.03272
| 1.618702
|
[
"s424444544",
"s473282531"
] |
u385244248
|
p02861
|
python
|
s520333693
|
s834070794
| 418
| 189
| 9,972
| 15,156
|
Accepted
|
Accepted
| 54.78
|
import sys
import math
import fractions
import itertools
from collections import deque
import copy
import bisect
MOD = 10 ** 9 + 7
INF = 10 ** 18 + 7
input = lambda: sys.stdin.readline().strip()
N = int(eval(input()))
xy = [list(map(int,input().split())) for _ in range(N)]
L = list(itertools.permutations(xy))
ans = 0
for i in L:
dis = 0
for l in range(N-1):
dis += math.sqrt((i[l][0]-i[l+1][0])**2 + (i[l][1] - i[l+1][1])**2)
ans += dis
print((ans / len(L)))
|
import sys
import math
from scipy.misc import comb # atcoderではspecial→misc, permは使えない
MOD = 10 ** 9 + 7
INF = 10 ** 18 + 7
input = lambda: sys.stdin.readline().strip()
N = int(eval(input()))
xy = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for i in range(N - 1):
for l in range(i + 1, N):
ans += math.sqrt((xy[i][0] - xy[l][0]) ** 2 + (xy[i][1] - xy[l][1]) ** 2)
ans *= (N - 1) / comb(N, 2)
print(ans)
| 22
| 16
| 495
| 442
|
import sys
import math
import fractions
import itertools
from collections import deque
import copy
import bisect
MOD = 10**9 + 7
INF = 10**18 + 7
input = lambda: sys.stdin.readline().strip()
N = int(eval(input()))
xy = [list(map(int, input().split())) for _ in range(N)]
L = list(itertools.permutations(xy))
ans = 0
for i in L:
dis = 0
for l in range(N - 1):
dis += math.sqrt((i[l][0] - i[l + 1][0]) ** 2 + (i[l][1] - i[l + 1][1]) ** 2)
ans += dis
print((ans / len(L)))
|
import sys
import math
from scipy.misc import comb # atcoderではspecial→misc, permは使えない
MOD = 10**9 + 7
INF = 10**18 + 7
input = lambda: sys.stdin.readline().strip()
N = int(eval(input()))
xy = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for i in range(N - 1):
for l in range(i + 1, N):
ans += math.sqrt((xy[i][0] - xy[l][0]) ** 2 + (xy[i][1] - xy[l][1]) ** 2)
ans *= (N - 1) / comb(N, 2)
print(ans)
| false
| 27.272727
|
[
"-import fractions",
"-import itertools",
"-from collections import deque",
"-import copy",
"-import bisect",
"+from scipy.misc import comb # atcoderではspecial→misc, permは使えない",
"-L = list(itertools.permutations(xy))",
"-for i in L:",
"- dis = 0",
"- for l in range(N - 1):",
"- dis += math.sqrt((i[l][0] - i[l + 1][0]) ** 2 + (i[l][1] - i[l + 1][1]) ** 2)",
"- ans += dis",
"-print((ans / len(L)))",
"+for i in range(N - 1):",
"+ for l in range(i + 1, N):",
"+ ans += math.sqrt((xy[i][0] - xy[l][0]) ** 2 + (xy[i][1] - xy[l][1]) ** 2)",
"+ans *= (N - 1) / comb(N, 2)",
"+print(ans)"
] | false
| 0.047886
| 0.500872
| 0.095605
|
[
"s520333693",
"s834070794"
] |
u620084012
|
p03612
|
python
|
s577924369
|
s180463128
| 99
| 82
| 14,008
| 14,008
|
Accepted
|
Accepted
| 17.17
|
# ABC 072 D
N = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
r = [0 for k in range(N)]
for k in range(N):
if p[k] == k+1:
r[k] = 1
for k in range(1,N):
if r[k] > 0:
r[k] += r[k-1]
r = r + [0]
for k in range(1,N+1):
if r[k] == 0:
ans += (r[k-1]+1)//2
print(ans)
|
N = int(eval(input()))
p = list(map(int,input().split()))
l = [0 for k in range(N+2)]
for k in range(N):
if p[k] == k+1:
l[k+1] = 1
t = 0
ans = 0
for e in l:
if e == 1:
t += 1
else:
ans += (t+1)//2
t = 0
print(ans)
| 20
| 17
| 331
| 271
|
# ABC 072 D
N = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
r = [0 for k in range(N)]
for k in range(N):
if p[k] == k + 1:
r[k] = 1
for k in range(1, N):
if r[k] > 0:
r[k] += r[k - 1]
r = r + [0]
for k in range(1, N + 1):
if r[k] == 0:
ans += (r[k - 1] + 1) // 2
print(ans)
|
N = int(eval(input()))
p = list(map(int, input().split()))
l = [0 for k in range(N + 2)]
for k in range(N):
if p[k] == k + 1:
l[k + 1] = 1
t = 0
ans = 0
for e in l:
if e == 1:
t += 1
else:
ans += (t + 1) // 2
t = 0
print(ans)
| false
| 15
|
[
"-# ABC 072 D",
"-ans = 0",
"-r = [0 for k in range(N)]",
"+l = [0 for k in range(N + 2)]",
"- r[k] = 1",
"-for k in range(1, N):",
"- if r[k] > 0:",
"- r[k] += r[k - 1]",
"-r = r + [0]",
"-for k in range(1, N + 1):",
"- if r[k] == 0:",
"- ans += (r[k - 1] + 1) // 2",
"+ l[k + 1] = 1",
"+t = 0",
"+ans = 0",
"+for e in l:",
"+ if e == 1:",
"+ t += 1",
"+ else:",
"+ ans += (t + 1) // 2",
"+ t = 0"
] | false
| 0.042227
| 0.037199
| 1.13517
|
[
"s577924369",
"s180463128"
] |
u100858029
|
p02573
|
python
|
s479715484
|
s285458456
| 754
| 693
| 210,764
| 210,860
|
Accepted
|
Accepted
| 8.09
|
'''
We can show that if u and v belong to the same connected component, then they are friends w/ each other
So everyone in a given connected component is friends with one another
So everyone in a given connected component must be separated into different groups
If we have a CC of with sz nodes in it, then we need at least sz different groups
So, the minimum number of groups needed is max sz(CC)
'''
import sys
sys.setrecursionlimit(4*10**5)
n, m = list(map(int,input().split()))
adj = [[] for u in range(n+1)]
for i in range(m):
u, v = list(map(int,input().split()))
adj[u].append(v)
adj[v].append(u)
vis = [False for u in range(n+1)]
def dfs(u):
if vis[u]:
return 0
vis[u] = True
sz = 1
for v in adj[u]:
sz += dfs(v)
return sz
CCs = []
for u in range(1,n+1):
if not vis[u]:
CCs.append(dfs(u))
print((max(CCs)))
|
'''
We can show that if u and v belong to the same connected component, then they are friends w/ each other
So everyone in a given connected component is friends with one another
So everyone in a given connected component must be separated into different groups
If we have a CC of with sz nodes in it, then we need at least sz different groups
So, the minimum number of groups needed is max sz(CC)
'''
import sys
sys.setrecursionlimit(2*10**5+5)
n, m = list(map(int,input().split()))
adj = [[] for u in range(n+1)]
for i in range(m):
u, v = list(map(int,input().split()))
adj[u].append(v)
adj[v].append(u)
vis = [False for u in range(n+1)]
def dfs(u):
if vis[u]:
return 0
vis[u] = True
sz = 1
for v in adj[u]:
sz += dfs(v)
return sz
CCs = []
for u in range(1,n+1):
if not vis[u]:
CCs.append(dfs(u))
print((max(CCs)))
| 36
| 36
| 862
| 864
|
"""
We can show that if u and v belong to the same connected component, then they are friends w/ each other
So everyone in a given connected component is friends with one another
So everyone in a given connected component must be separated into different groups
If we have a CC of with sz nodes in it, then we need at least sz different groups
So, the minimum number of groups needed is max sz(CC)
"""
import sys
sys.setrecursionlimit(4 * 10**5)
n, m = list(map(int, input().split()))
adj = [[] for u in range(n + 1)]
for i in range(m):
u, v = list(map(int, input().split()))
adj[u].append(v)
adj[v].append(u)
vis = [False for u in range(n + 1)]
def dfs(u):
if vis[u]:
return 0
vis[u] = True
sz = 1
for v in adj[u]:
sz += dfs(v)
return sz
CCs = []
for u in range(1, n + 1):
if not vis[u]:
CCs.append(dfs(u))
print((max(CCs)))
|
"""
We can show that if u and v belong to the same connected component, then they are friends w/ each other
So everyone in a given connected component is friends with one another
So everyone in a given connected component must be separated into different groups
If we have a CC of with sz nodes in it, then we need at least sz different groups
So, the minimum number of groups needed is max sz(CC)
"""
import sys
sys.setrecursionlimit(2 * 10**5 + 5)
n, m = list(map(int, input().split()))
adj = [[] for u in range(n + 1)]
for i in range(m):
u, v = list(map(int, input().split()))
adj[u].append(v)
adj[v].append(u)
vis = [False for u in range(n + 1)]
def dfs(u):
if vis[u]:
return 0
vis[u] = True
sz = 1
for v in adj[u]:
sz += dfs(v)
return sz
CCs = []
for u in range(1, n + 1):
if not vis[u]:
CCs.append(dfs(u))
print((max(CCs)))
| false
| 0
|
[
"-sys.setrecursionlimit(4 * 10**5)",
"+sys.setrecursionlimit(2 * 10**5 + 5)"
] | false
| 0.090286
| 0.050581
| 1.784973
|
[
"s479715484",
"s285458456"
] |
u347640436
|
p03014
|
python
|
s700035540
|
s969242714
| 1,683
| 1,404
| 38,900
| 38,900
|
Accepted
|
Accepted
| 16.58
|
from sys import stdin
def main():
from itertools import repeat
from builtins import range
readline = stdin.readline
h, w = list(map(int, readline().split()))
s = [readline().rstrip('\r\n') + '#' for _ in range(h)]
s.append('#' * w)
yoko = [[0] * w for _ in range(h)]
for i in range(h):
start = -1
si = s[i]
yokoi = yoko[i]
for j in range(w + 1):
if si[j] == '#':
if start != -1:
t = j - start
yokoi[start:j] = repeat(t, t)
start = -1
else:
if start == -1:
start = j
result = 0
for i in range(w):
start = -1
for j in range(h + 1):
if s[j][i] == '#':
if start != -1:
t = yoko_max + j - start - 1
if t > result:
result = t
start = -1
else:
yji = yoko[j][i]
if start == -1:
start = j
yoko_max = yji
else:
if yji > yoko_max:
yoko_max = yji
print(result)
main()
|
from sys import stdin
def main():
from builtins import range
readline = stdin.readline
h, w = list(map(int, readline().split()))
s = [readline().rstrip('\r\n') + '#' for _ in range(h)]
s.append('#' * w)
ft = [[i] * i for i in range(100)]
yoko = [[0] * w for _ in range(h)]
for i in range(h):
start = -1
si = s[i]
yokoi = yoko[i]
for j in range(w + 1):
if si[j] == '#':
if start != -1:
t = j - start
if t < 100:
yokoi[start:j] = ft[t]
else:
yokoi[start:j] = [t] * t
start = -1
else:
if start == -1:
start = j
result = 0
for i in range(w):
start = -1
for j in range(h + 1):
if s[j][i] == '#':
if start != -1:
t = yoko_max + j - start - 1
if t > result:
result = t
start = -1
else:
yji = yoko[j][i]
if start == -1:
start = j
yoko_max = yji
else:
if yji > yoko_max:
yoko_max = yji
print(result)
main()
| 42
| 45
| 1,032
| 1,111
|
from sys import stdin
def main():
from itertools import repeat
from builtins import range
readline = stdin.readline
h, w = list(map(int, readline().split()))
s = [readline().rstrip("\r\n") + "#" for _ in range(h)]
s.append("#" * w)
yoko = [[0] * w for _ in range(h)]
for i in range(h):
start = -1
si = s[i]
yokoi = yoko[i]
for j in range(w + 1):
if si[j] == "#":
if start != -1:
t = j - start
yokoi[start:j] = repeat(t, t)
start = -1
else:
if start == -1:
start = j
result = 0
for i in range(w):
start = -1
for j in range(h + 1):
if s[j][i] == "#":
if start != -1:
t = yoko_max + j - start - 1
if t > result:
result = t
start = -1
else:
yji = yoko[j][i]
if start == -1:
start = j
yoko_max = yji
else:
if yji > yoko_max:
yoko_max = yji
print(result)
main()
|
from sys import stdin
def main():
from builtins import range
readline = stdin.readline
h, w = list(map(int, readline().split()))
s = [readline().rstrip("\r\n") + "#" for _ in range(h)]
s.append("#" * w)
ft = [[i] * i for i in range(100)]
yoko = [[0] * w for _ in range(h)]
for i in range(h):
start = -1
si = s[i]
yokoi = yoko[i]
for j in range(w + 1):
if si[j] == "#":
if start != -1:
t = j - start
if t < 100:
yokoi[start:j] = ft[t]
else:
yokoi[start:j] = [t] * t
start = -1
else:
if start == -1:
start = j
result = 0
for i in range(w):
start = -1
for j in range(h + 1):
if s[j][i] == "#":
if start != -1:
t = yoko_max + j - start - 1
if t > result:
result = t
start = -1
else:
yji = yoko[j][i]
if start == -1:
start = j
yoko_max = yji
else:
if yji > yoko_max:
yoko_max = yji
print(result)
main()
| false
| 6.666667
|
[
"- from itertools import repeat",
"+ ft = [[i] * i for i in range(100)]",
"- yokoi[start:j] = repeat(t, t)",
"+ if t < 100:",
"+ yokoi[start:j] = ft[t]",
"+ else:",
"+ yokoi[start:j] = [t] * t"
] | false
| 0.040499
| 0.066403
| 0.609893
|
[
"s700035540",
"s969242714"
] |
u923279197
|
p04015
|
python
|
s511454378
|
s022571889
| 462
| 196
| 96,348
| 42,588
|
Accepted
|
Accepted
| 57.58
|
def makelist(n,m,p):
return [[[0 for k in range(p)]for i in range(m)]for j in range(n)]
n,a = list(map(int,input().split()))
x = list(map(int,input().split()))
X = max(x)
X = max(X,a)
dp = makelist(n+1,n+1,n*X+1)
dp[0][0][0] = 1
for j in range(n+1):
for k in range(n+1):
for s in range(n*X+1):
if j*k > 0 and s >= x[j-1]:
dp[j][k][s] = dp[j-1][k][s] + dp[j-1][k-1][s-x[j-1]]
elif j >= 1 and s < x[j-1]:
dp[j][k][s] = dp[j-1][k][s]
ans = 0
for k in range(1,n+1):
ans += dp[n][k][k*a]
print(ans)
|
def makelist2(n,m):
return[[0 for k in range(m)]for i in range(n)]
n,a = list(map(int,input().split()))
x = list(map(int,input().split()))
X = max(x)
X = max(X,a)
b=[]
for i in range(n):
b.append(x[i]-a)
dp =makelist2(n+1,2*n*X+1)
dp[0][n*X] = 1
for j in range(n+1):
for t in range(2*n*X+1):
if j>=1 and (t-b[j-1] < 0 or t-b[j-1]>2*n*X):
dp[j][t] = dp[j-1][t]
elif j>= 1:
dp[j][t] = dp[j-1][t] + dp[j-1][t-b[j-1]]
print((dp[n][n*X]-1))
| 21
| 21
| 585
| 502
|
def makelist(n, m, p):
return [[[0 for k in range(p)] for i in range(m)] for j in range(n)]
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
X = max(x)
X = max(X, a)
dp = makelist(n + 1, n + 1, n * X + 1)
dp[0][0][0] = 1
for j in range(n + 1):
for k in range(n + 1):
for s in range(n * X + 1):
if j * k > 0 and s >= x[j - 1]:
dp[j][k][s] = dp[j - 1][k][s] + dp[j - 1][k - 1][s - x[j - 1]]
elif j >= 1 and s < x[j - 1]:
dp[j][k][s] = dp[j - 1][k][s]
ans = 0
for k in range(1, n + 1):
ans += dp[n][k][k * a]
print(ans)
|
def makelist2(n, m):
return [[0 for k in range(m)] for i in range(n)]
n, a = list(map(int, input().split()))
x = list(map(int, input().split()))
X = max(x)
X = max(X, a)
b = []
for i in range(n):
b.append(x[i] - a)
dp = makelist2(n + 1, 2 * n * X + 1)
dp[0][n * X] = 1
for j in range(n + 1):
for t in range(2 * n * X + 1):
if j >= 1 and (t - b[j - 1] < 0 or t - b[j - 1] > 2 * n * X):
dp[j][t] = dp[j - 1][t]
elif j >= 1:
dp[j][t] = dp[j - 1][t] + dp[j - 1][t - b[j - 1]]
print((dp[n][n * X] - 1))
| false
| 0
|
[
"-def makelist(n, m, p):",
"- return [[[0 for k in range(p)] for i in range(m)] for j in range(n)]",
"+def makelist2(n, m):",
"+ return [[0 for k in range(m)] for i in range(n)]",
"-dp = makelist(n + 1, n + 1, n * X + 1)",
"-dp[0][0][0] = 1",
"+b = []",
"+for i in range(n):",
"+ b.append(x[i] - a)",
"+dp = makelist2(n + 1, 2 * n * X + 1)",
"+dp[0][n * X] = 1",
"- for k in range(n + 1):",
"- for s in range(n * X + 1):",
"- if j * k > 0 and s >= x[j - 1]:",
"- dp[j][k][s] = dp[j - 1][k][s] + dp[j - 1][k - 1][s - x[j - 1]]",
"- elif j >= 1 and s < x[j - 1]:",
"- dp[j][k][s] = dp[j - 1][k][s]",
"-ans = 0",
"-for k in range(1, n + 1):",
"- ans += dp[n][k][k * a]",
"-print(ans)",
"+ for t in range(2 * n * X + 1):",
"+ if j >= 1 and (t - b[j - 1] < 0 or t - b[j - 1] > 2 * n * X):",
"+ dp[j][t] = dp[j - 1][t]",
"+ elif j >= 1:",
"+ dp[j][t] = dp[j - 1][t] + dp[j - 1][t - b[j - 1]]",
"+print((dp[n][n * X] - 1))"
] | false
| 0.088477
| 0.11665
| 0.75848
|
[
"s511454378",
"s022571889"
] |
u411203878
|
p03475
|
python
|
s488987840
|
s135618177
| 219
| 98
| 42,348
| 73,888
|
Accepted
|
Accepted
| 55.25
|
n=int(eval(input()))
ab = []
for _ in range(n-1):
a, b, c = (int(x) for x in input().split())
ab.append([a, b, c])
for i in range(n-1):
ans = ab[i][0]+ab[i][1]
for j in range(i+1,n-1):
if ans <= ab[j][1]:
ans = ab[j][1]
elif (ans-ab[j][1])%ab[j][2]!=0:
ans += ab[j][2]-(ans-ab[j][1])%ab[j][2]
ans += ab[j][0]
print(ans)
print((0))
|
N = int(eval(input()))
Plan = [list(map(int,input().split())) for _ in range(N-1)]
for i in range(N-1):
c1,s1,f1 = Plan[i]
time = s1+c1
for j in range(i+1,N-1):
c,s,f = Plan[j]
if time <= s:
time = s
elif (time-s)%f != 0:
time += f-(time-s)%f
time += c
print(time)
print((0))
| 17
| 15
| 416
| 354
|
n = int(eval(input()))
ab = []
for _ in range(n - 1):
a, b, c = (int(x) for x in input().split())
ab.append([a, b, c])
for i in range(n - 1):
ans = ab[i][0] + ab[i][1]
for j in range(i + 1, n - 1):
if ans <= ab[j][1]:
ans = ab[j][1]
elif (ans - ab[j][1]) % ab[j][2] != 0:
ans += ab[j][2] - (ans - ab[j][1]) % ab[j][2]
ans += ab[j][0]
print(ans)
print((0))
|
N = int(eval(input()))
Plan = [list(map(int, input().split())) for _ in range(N - 1)]
for i in range(N - 1):
c1, s1, f1 = Plan[i]
time = s1 + c1
for j in range(i + 1, N - 1):
c, s, f = Plan[j]
if time <= s:
time = s
elif (time - s) % f != 0:
time += f - (time - s) % f
time += c
print(time)
print((0))
| false
| 11.764706
|
[
"-n = int(eval(input()))",
"-ab = []",
"-for _ in range(n - 1):",
"- a, b, c = (int(x) for x in input().split())",
"- ab.append([a, b, c])",
"-for i in range(n - 1):",
"- ans = ab[i][0] + ab[i][1]",
"- for j in range(i + 1, n - 1):",
"- if ans <= ab[j][1]:",
"- ans = ab[j][1]",
"- elif (ans - ab[j][1]) % ab[j][2] != 0:",
"- ans += ab[j][2] - (ans - ab[j][1]) % ab[j][2]",
"- ans += ab[j][0]",
"- print(ans)",
"+N = int(eval(input()))",
"+Plan = [list(map(int, input().split())) for _ in range(N - 1)]",
"+for i in range(N - 1):",
"+ c1, s1, f1 = Plan[i]",
"+ time = s1 + c1",
"+ for j in range(i + 1, N - 1):",
"+ c, s, f = Plan[j]",
"+ if time <= s:",
"+ time = s",
"+ elif (time - s) % f != 0:",
"+ time += f - (time - s) % f",
"+ time += c",
"+ print(time)"
] | false
| 0.03807
| 0.038987
| 0.976495
|
[
"s488987840",
"s135618177"
] |
u144913062
|
p03326
|
python
|
s184595865
|
s259156370
| 1,286
| 235
| 48,092
| 42,352
|
Accepted
|
Accepted
| 81.73
|
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
xyz = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for bit in range(1 << 3):
dp = [-float('inf')] * (M+1)
dp[0] = 0
for i in range(N):
for j in range(M)[::-1]:
if dp[j] != -float('inf'):
score = 0
for k in range(3):
score += xyz[i][k] * (-1)**((bit >> k) & 1)
dp[j+1] = max(dp[j+1], dp[j] + score)
ans = max(ans, dp[M])
print(ans)
|
N, M = list(map(int, input().split()))
xyz = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for bit in range(1 << 3):
scores = [0] * N
for i in range(N):
for j in range(3):
scores[i] += xyz[i][j] * (-1)**((bit >> j) & 1)
scores.sort(reverse=True)
ans = max(ans, sum(scores[:M]))
print(ans)
| 18
| 11
| 539
| 343
|
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
xyz = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for bit in range(1 << 3):
dp = [-float("inf")] * (M + 1)
dp[0] = 0
for i in range(N):
for j in range(M)[::-1]:
if dp[j] != -float("inf"):
score = 0
for k in range(3):
score += xyz[i][k] * (-1) ** ((bit >> k) & 1)
dp[j + 1] = max(dp[j + 1], dp[j] + score)
ans = max(ans, dp[M])
print(ans)
|
N, M = list(map(int, input().split()))
xyz = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for bit in range(1 << 3):
scores = [0] * N
for i in range(N):
for j in range(3):
scores[i] += xyz[i][j] * (-1) ** ((bit >> j) & 1)
scores.sort(reverse=True)
ans = max(ans, sum(scores[:M]))
print(ans)
| false
| 38.888889
|
[
"-import sys",
"-",
"-input = sys.stdin.readline",
"- dp = [-float(\"inf\")] * (M + 1)",
"- dp[0] = 0",
"+ scores = [0] * N",
"- for j in range(M)[::-1]:",
"- if dp[j] != -float(\"inf\"):",
"- score = 0",
"- for k in range(3):",
"- score += xyz[i][k] * (-1) ** ((bit >> k) & 1)",
"- dp[j + 1] = max(dp[j + 1], dp[j] + score)",
"- ans = max(ans, dp[M])",
"+ for j in range(3):",
"+ scores[i] += xyz[i][j] * (-1) ** ((bit >> j) & 1)",
"+ scores.sort(reverse=True)",
"+ ans = max(ans, sum(scores[:M]))"
] | false
| 0.047278
| 0.074586
| 0.633877
|
[
"s184595865",
"s259156370"
] |
u243572357
|
p03636
|
python
|
s537211443
|
s765204655
| 19
| 17
| 2,940
| 2,940
|
Accepted
|
Accepted
| 10.53
|
l = eval(input())
print((l[0] + str(len(l) - 2) + l[-1]))
|
a = eval(input())
print((a[0] + str(len(a[1:-1])) + a[-1]))
| 2
| 2
| 50
| 52
|
l = eval(input())
print((l[0] + str(len(l) - 2) + l[-1]))
|
a = eval(input())
print((a[0] + str(len(a[1:-1])) + a[-1]))
| false
| 0
|
[
"-l = eval(input())",
"-print((l[0] + str(len(l) - 2) + l[-1]))",
"+a = eval(input())",
"+print((a[0] + str(len(a[1:-1])) + a[-1]))"
] | false
| 0.061241
| 0.050749
| 1.206752
|
[
"s537211443",
"s765204655"
] |
u759412327
|
p03329
|
python
|
s300003104
|
s505976679
| 356
| 218
| 2,940
| 9,080
|
Accepted
|
Accepted
| 38.76
|
N = int(eval(input()))
r = N
for i in range(N+1):
c=0;t=i
while t>0:c+=t%6;t//=6
t=N-i
while t>0:c+=t%9;t//=9
r=min(r,c)
print(r)
|
N = int(eval(input()))
a = N
for n in range(N+1):
c = 0
t = n
while t>0:
c+=t%6
t//=6
t = N-n
while t>0:
c+=t%9
t//=9
a = min(a,c)
print(a)
| 11
| 16
| 147
| 180
|
N = int(eval(input()))
r = N
for i in range(N + 1):
c = 0
t = i
while t > 0:
c += t % 6
t //= 6
t = N - i
while t > 0:
c += t % 9
t //= 9
r = min(r, c)
print(r)
|
N = int(eval(input()))
a = N
for n in range(N + 1):
c = 0
t = n
while t > 0:
c += t % 6
t //= 6
t = N - n
while t > 0:
c += t % 9
t //= 9
a = min(a, c)
print(a)
| false
| 31.25
|
[
"-r = N",
"-for i in range(N + 1):",
"+a = N",
"+for n in range(N + 1):",
"- t = i",
"+ t = n",
"- t = N - i",
"+ t = N - n",
"- r = min(r, c)",
"-print(r)",
"+ a = min(a, c)",
"+print(a)"
] | false
| 0.062299
| 0.062904
| 0.990381
|
[
"s300003104",
"s505976679"
] |
u227020436
|
p03566
|
python
|
s777257030
|
s784770091
| 20
| 14
| 3,316
| 2,948
|
Accepted
|
Accepted
| 30
|
#!/usr/bin/python
# coding: utf-8
# AtCoder Beginner Contest 076
# D - AtCoder Express
from sys import stdin
# 移動距離を返す
def solve(ts, vs):
if len(ts) == 0: return 0.0
time = sum(ts) # 総時間
limit = min(vs) # 制限速度の下限
if time / 2.0 <= limit: # limitまで加速する時間がない
return (time / 2.0) ** 2 # 半分の時間で加速，残りで減速
# 制限速度まで達した区間がある
if limit == 0:
# その区間を除いて計算
vzero = [i for i in range(len(vs)) if vs[i] == 0][0]
return solve(ts[:vzero], vs[:vzero]) + \
solve(ts[vzero + 1:], vs[vzero + 1:])
# 最初に1加速, 最後に1減速
n = len(ts)
ts[0] -= 1
ts[n - 1] -= 1
# 長さ0の区間を削除
if ts[n - 1] == 0:
ts = ts[:n - 1]
vs = vs[:n - 1]
if ts[0] == 0:
ts = ts[1:]
vs = vs[1:]
# 制限時間を1減らす (= 現在速度を1増やす)
vs = [v - 1 for v in vs]
# 1加速, 速度1でtime-2秒移動, 1減速, の移動距離
dist = time - 2 + 1
return dist + solve(ts, vs)
# 文字列をintのリストに分解する
def splitToInt(line):
words = line.strip().split()
return [int(w) for w in words]
N = int(stdin.readline())
ts = splitToInt(stdin.readline())
vs = splitToInt(stdin.readline())
if len(ts) != N or len(vs) != N: raise
print(solve(ts, vs))
|
#!/usr/bin/python
# coding: utf-8
# AtCoder Beginner Contest 076
# D - AtCoder Express
from sys import stdin
# 移動距離を返す
def solve(ts, vs):
if len(ts) == 0: return 0.0
time = sum(ts) # 総時間
limit = min(vs) # 制限速度の下限
if time / 2.0 <= limit: # limitまで加速する時間がない
return (time / 2.0) ** 2 # 半分の時間で加速，残りで減速
# 制限速度まで達した区間がある
if limit == 0:
# その区間を除いて計算
vzero = [i for i in range(len(vs)) if vs[i] == 0][0]
return solve(ts[:vzero], vs[:vzero]) + \
solve(ts[vzero + 1:], vs[vzero + 1:])
# 最初に1加速, 最後に1減速
ts[0] -= 1
ts[-1] -= 1
# 長さ0の区間を削除
if ts[-1] == 0:
ts = ts[:-1]
vs = vs[:-1]
if ts[0] == 0:
ts = ts[1:]
vs = vs[1:]
# 制限時間を1減らす (= 現在速度を1増やす)
vs = [v - 1 for v in vs]
# 1加速, 速度1でtime-2秒移動, 1減速, の移動距離
dist = time - 2 + 1
return dist + solve(ts, vs)
# 文字列をintのリストに分解する
def splitToInt(line):
words = line.strip().split()
return [int(w) for w in words]
N = int(stdin.readline())
ts = splitToInt(stdin.readline())
vs = splitToInt(stdin.readline())
if len(ts) != N or len(vs) != N: raise
print(solve(ts, vs))
| 51
| 50
| 1,175
| 1,145
|
#!/usr/bin/python
# coding: utf-8
# AtCoder Beginner Contest 076
# D - AtCoder Express
from sys import stdin
# 移動距離を返す
def solve(ts, vs):
if len(ts) == 0:
return 0.0
time = sum(ts) # 総時間
limit = min(vs) # 制限速度の下限
if time / 2.0 <= limit: # limitまで加速する時間がない
return (time / 2.0) ** 2 # 半分の時間で加速，残りで減速
# 制限速度まで達した区間がある
if limit == 0:
# その区間を除いて計算
vzero = [i for i in range(len(vs)) if vs[i] == 0][0]
return solve(ts[:vzero], vs[:vzero]) + solve(ts[vzero + 1 :], vs[vzero + 1 :])
# 最初に1加速, 最後に1減速
n = len(ts)
ts[0] -= 1
ts[n - 1] -= 1
# 長さ0の区間を削除
if ts[n - 1] == 0:
ts = ts[: n - 1]
vs = vs[: n - 1]
if ts[0] == 0:
ts = ts[1:]
vs = vs[1:]
# 制限時間を1減らす (= 現在速度を1増やす)
vs = [v - 1 for v in vs]
# 1加速, 速度1でtime-2秒移動, 1減速, の移動距離
dist = time - 2 + 1
return dist + solve(ts, vs)
# 文字列をintのリストに分解する
def splitToInt(line):
words = line.strip().split()
return [int(w) for w in words]
N = int(stdin.readline())
ts = splitToInt(stdin.readline())
vs = splitToInt(stdin.readline())
if len(ts) != N or len(vs) != N:
raise
print(solve(ts, vs))
|
#!/usr/bin/python
# coding: utf-8
# AtCoder Beginner Contest 076
# D - AtCoder Express
from sys import stdin
# 移動距離を返す
def solve(ts, vs):
if len(ts) == 0:
return 0.0
time = sum(ts) # 総時間
limit = min(vs) # 制限速度の下限
if time / 2.0 <= limit: # limitまで加速する時間がない
return (time / 2.0) ** 2 # 半分の時間で加速，残りで減速
# 制限速度まで達した区間がある
if limit == 0:
# その区間を除いて計算
vzero = [i for i in range(len(vs)) if vs[i] == 0][0]
return solve(ts[:vzero], vs[:vzero]) + solve(ts[vzero + 1 :], vs[vzero + 1 :])
# 最初に1加速, 最後に1減速
ts[0] -= 1
ts[-1] -= 1
# 長さ0の区間を削除
if ts[-1] == 0:
ts = ts[:-1]
vs = vs[:-1]
if ts[0] == 0:
ts = ts[1:]
vs = vs[1:]
# 制限時間を1減らす (= 現在速度を1増やす)
vs = [v - 1 for v in vs]
# 1加速, 速度1でtime-2秒移動, 1減速, の移動距離
dist = time - 2 + 1
return dist + solve(ts, vs)
# 文字列をintのリストに分解する
def splitToInt(line):
words = line.strip().split()
return [int(w) for w in words]
N = int(stdin.readline())
ts = splitToInt(stdin.readline())
vs = splitToInt(stdin.readline())
if len(ts) != N or len(vs) != N:
raise
print(solve(ts, vs))
| false
| 1.960784
|
[
"- n = len(ts)",
"- ts[n - 1] -= 1",
"+ ts[-1] -= 1",
"- if ts[n - 1] == 0:",
"- ts = ts[: n - 1]",
"- vs = vs[: n - 1]",
"+ if ts[-1] == 0:",
"+ ts = ts[:-1]",
"+ vs = vs[:-1]"
] | false
| 0.034401
| 0.101239
| 0.339798
|
[
"s777257030",
"s784770091"
] |
u989892335
|
p02946
|
python
|
s372532401
|
s684597838
| 30
| 25
| 9,144
| 9,156
|
Accepted
|
Accepted
| 16.67
|
k,x=map(int,input().split())
for i in range(x-(k-1),x+k):
print(i,end=" ")
|
k,x=map(int,input().split())
for i in range(x-k+1,x+k):
print(i,end=" ")
| 3
| 3
| 80
| 78
|
k, x = map(int, input().split())
for i in range(x - (k - 1), x + k):
print(i, end=" ")
|
k, x = map(int, input().split())
for i in range(x - k + 1, x + k):
print(i, end=" ")
| false
| 0
|
[
"-for i in range(x - (k - 1), x + k):",
"+for i in range(x - k + 1, x + k):"
] | false
| 0.061117
| 0.049092
| 1.244944
|
[
"s372532401",
"s684597838"
] |
u332906195
|
p03574
|
python
|
s727842018
|
s925448921
| 28
| 25
| 3,188
| 3,188
|
Accepted
|
Accepted
| 10.71
|
H, W = list(map(int, input().split()))
S = [eval(input()) for _ in range(H)]
ans = [[''] * W for _ in range(H)]
N = [(1, 1), (1, 0), (1, -1), (0, 1), (0, -1), (-1, 1), (-1, 0), (-1, -1)]
for h in range(H):
for w in range(W):
if S[h][w] == '#':
ans[h][w] = '#'
else:
ans[h][w] = str(sum([S[h + nh][w + nw] == "#" for nh, nw in N if 0 <= h + nh < H and 0 <= w + nw < W]))
for h in range(H):
print((''.join(ans[h])))
|
H, W = list(map(int, input().split()))
S = ['.' * (W + 2)] + ['.' + eval(input()) + '.' for _ in range(H)] + ['.' * (W + 2)]
ans = [[] for _ in range(H)]
N = [(1, 1), (1, 0), (1, -1), (0, 1), (0, -1), (-1, 1), (-1, 0), (-1, -1)]
for h in range(1, H + 1):
for w in range(1, W + 1):
if S[h][w] == '#':
ans[h - 1].append('#')
else:
ans[h - 1].append(str(sum([S[h + nh][w + nw] == '#' for nh, nw in N])))
for h in range(H):
print((''.join(ans[h])))
| 13
| 12
| 461
| 490
|
H, W = list(map(int, input().split()))
S = [eval(input()) for _ in range(H)]
ans = [[""] * W for _ in range(H)]
N = [(1, 1), (1, 0), (1, -1), (0, 1), (0, -1), (-1, 1), (-1, 0), (-1, -1)]
for h in range(H):
for w in range(W):
if S[h][w] == "#":
ans[h][w] = "#"
else:
ans[h][w] = str(
sum(
[
S[h + nh][w + nw] == "#"
for nh, nw in N
if 0 <= h + nh < H and 0 <= w + nw < W
]
)
)
for h in range(H):
print(("".join(ans[h])))
|
H, W = list(map(int, input().split()))
S = ["." * (W + 2)] + ["." + eval(input()) + "." for _ in range(H)] + ["." * (W + 2)]
ans = [[] for _ in range(H)]
N = [(1, 1), (1, 0), (1, -1), (0, 1), (0, -1), (-1, 1), (-1, 0), (-1, -1)]
for h in range(1, H + 1):
for w in range(1, W + 1):
if S[h][w] == "#":
ans[h - 1].append("#")
else:
ans[h - 1].append(str(sum([S[h + nh][w + nw] == "#" for nh, nw in N])))
for h in range(H):
print(("".join(ans[h])))
| false
| 7.692308
|
[
"-S = [eval(input()) for _ in range(H)]",
"-ans = [[\"\"] * W for _ in range(H)]",
"+S = [\".\" * (W + 2)] + [\".\" + eval(input()) + \".\" for _ in range(H)] + [\".\" * (W + 2)]",
"+ans = [[] for _ in range(H)]",
"-for h in range(H):",
"- for w in range(W):",
"+for h in range(1, H + 1):",
"+ for w in range(1, W + 1):",
"- ans[h][w] = \"#\"",
"+ ans[h - 1].append(\"#\")",
"- ans[h][w] = str(",
"- sum(",
"- [",
"- S[h + nh][w + nw] == \"#\"",
"- for nh, nw in N",
"- if 0 <= h + nh < H and 0 <= w + nw < W",
"- ]",
"- )",
"- )",
"+ ans[h - 1].append(str(sum([S[h + nh][w + nw] == \"#\" for nh, nw in N])))"
] | false
| 0.047436
| 0.04774
| 0.993633
|
[
"s727842018",
"s925448921"
] |
u052499405
|
p04030
|
python
|
s605393567
|
s050741825
| 21
| 17
| 3,316
| 2,940
|
Accepted
|
Accepted
| 19.05
|
#!/usr/bin/env python3
from collections import defaultdict
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
s = input().rstrip()
ans = []
for ch in s:
if ch == "0":
ans.append("0")
elif ch == "1":
ans.append("1")
else:
if len(ans) > 0:
ans.pop()
print(("".join([item for item in ans])))
|
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
s = input().rstrip()
ans = []
for ch in s:
if ch in "01":
ans.append(ch)
if ch == "B" and ans:
ans.pop()
print(("".join([item for item in ans])))
| 17
| 12
| 367
| 241
|
#!/usr/bin/env python3
from collections import defaultdict
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
s = input().rstrip()
ans = []
for ch in s:
if ch == "0":
ans.append("0")
elif ch == "1":
ans.append("1")
else:
if len(ans) > 0:
ans.pop()
print(("".join([item for item in ans])))
|
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
s = input().rstrip()
ans = []
for ch in s:
if ch in "01":
ans.append(ch)
if ch == "B" and ans:
ans.pop()
print(("".join([item for item in ans])))
| false
| 29.411765
|
[
"-from collections import defaultdict",
"-sys.setrecursionlimit(10**8)",
"- if ch == \"0\":",
"- ans.append(\"0\")",
"- elif ch == \"1\":",
"- ans.append(\"1\")",
"- else:",
"- if len(ans) > 0:",
"- ans.pop()",
"+ if ch in \"01\":",
"+ ans.append(ch)",
"+ if ch == \"B\" and ans:",
"+ ans.pop()"
] | false
| 0.037949
| 0.038717
| 0.980157
|
[
"s605393567",
"s050741825"
] |
u639989198
|
p03948
|
python
|
s344131500
|
s636208954
| 330
| 200
| 30,388
| 24,140
|
Accepted
|
Accepted
| 39.39
|
import numpy as np
eval(input())
a = np.array(input().split(), dtype=np.int)
diff = a - np.minimum.accumulate(a)
print(((diff == diff.max()).sum()))
|
from numpy import *
eval(input())
a=array(input().split(),dtype=int)
d=a-minimum.accumulate(a)
print(((d==d.max()).sum()))
| 8
| 5
| 151
| 118
|
import numpy as np
eval(input())
a = np.array(input().split(), dtype=np.int)
diff = a - np.minimum.accumulate(a)
print(((diff == diff.max()).sum()))
|
from numpy import *
eval(input())
a = array(input().split(), dtype=int)
d = a - minimum.accumulate(a)
print(((d == d.max()).sum()))
| false
| 37.5
|
[
"-import numpy as np",
"+from numpy import *",
"-a = np.array(input().split(), dtype=np.int)",
"-diff = a - np.minimum.accumulate(a)",
"-print(((diff == diff.max()).sum()))",
"+a = array(input().split(), dtype=int)",
"+d = a - minimum.accumulate(a)",
"+print(((d == d.max()).sum()))"
] | false
| 0.185633
| 0.248091
| 0.748245
|
[
"s344131500",
"s636208954"
] |
u094999522
|
p02844
|
python
|
s964369995
|
s873671188
| 65
| 59
| 9,232
| 9,252
|
Accepted
|
Accepted
| 9.23
|
#!/usr/bin/env python3
n = int(eval(input()))
s = eval(input())
c = 0
for i in range(10):
for j in range(10):
a = s.find(str(i))
if a > -1:
b = s.find(str(j), a + 1)
if b > -1:
c += len(set(s[b + 1:]))
print(c)
|
#!/usr/bin/env python3
n = int(eval(input()))
s = eval(input())
c = 0
for i in range(10):
a = s.find(str(i))
if a > -1:
for j in range(10):
b = s.find(str(j), a + 1)
if b > -1:
c += len(set(s[b + 1:]))
print(c)
| 12
| 12
| 270
| 266
|
#!/usr/bin/env python3
n = int(eval(input()))
s = eval(input())
c = 0
for i in range(10):
for j in range(10):
a = s.find(str(i))
if a > -1:
b = s.find(str(j), a + 1)
if b > -1:
c += len(set(s[b + 1 :]))
print(c)
|
#!/usr/bin/env python3
n = int(eval(input()))
s = eval(input())
c = 0
for i in range(10):
a = s.find(str(i))
if a > -1:
for j in range(10):
b = s.find(str(j), a + 1)
if b > -1:
c += len(set(s[b + 1 :]))
print(c)
| false
| 0
|
[
"- for j in range(10):",
"- a = s.find(str(i))",
"- if a > -1:",
"+ a = s.find(str(i))",
"+ if a > -1:",
"+ for j in range(10):"
] | false
| 0.036684
| 0.045155
| 0.812415
|
[
"s964369995",
"s873671188"
] |
u231685196
|
p02781
|
python
|
s441603312
|
s096796551
| 36
| 18
| 4,340
| 3,064
|
Accepted
|
Accepted
| 50
|
n = eval(input())
k = int(eval(input()))
dp = [[[0,0] for i in range(len(n)+1)] for j in range(len(n)+1)]
# print(dp)
num_d = len(n)
dp[0][0][0] = 1
for i in range(len(n)):
num = int(n[i])
if num == 0:
for j in range(num_d):
dp[i+1][j+1][0] = dp[i][j][0]
dp[i+1][j+1][1] += dp[i][j][1]
for j in range(num_d+1):
dp[i+1][j][1] += dp[i][j][1]*9
else:
for j in range(num_d):
dp[i+1][j][0] = dp[i][j][0]
for j in range(num_d+1):
dp[i+1][j][1] += dp[i][j][0]*(num-1)
dp[i+1][j][1] += dp[i][j][1]*9
for j in range(num_d):
dp[i+1][j+1][1] += dp[i][j][0] + dp[i][j][1]
# print(dp[-1])
if num_d < k:
print((0))
else:
print((sum(dp[-1][num_d-k])))
|
N = eval(input())
K = int(eval(input()))
m = len(N)
dp = [[[0] * (K + 1) for _ in range(2)] for _ in range(m + 1)]
dp[0][0][0] = 1
for i in range(1, m + 1):
l = int(N[i - 1])
for k in range(K + 1):
dp[i][1][k] += dp[i - 1][1][k]
if l != 0:
dp[i][1][k] += dp[i - 1][0][k]
else:
dp[i][0][k] += dp[i - 1][0][k]
if k - 1 >= 0:
dp[i][1][k] += 9 * dp[i - 1][1][k - 1]
if l != 0:
dp[i][0][k] += dp[i - 1][0][k - 1]
dp[i][1][k] += (l - 1) * dp[i - 1][0][k - 1]
print((dp[m][0][K] + dp[m][1][K]))
| 37
| 21
| 810
| 615
|
n = eval(input())
k = int(eval(input()))
dp = [[[0, 0] for i in range(len(n) + 1)] for j in range(len(n) + 1)]
# print(dp)
num_d = len(n)
dp[0][0][0] = 1
for i in range(len(n)):
num = int(n[i])
if num == 0:
for j in range(num_d):
dp[i + 1][j + 1][0] = dp[i][j][0]
dp[i + 1][j + 1][1] += dp[i][j][1]
for j in range(num_d + 1):
dp[i + 1][j][1] += dp[i][j][1] * 9
else:
for j in range(num_d):
dp[i + 1][j][0] = dp[i][j][0]
for j in range(num_d + 1):
dp[i + 1][j][1] += dp[i][j][0] * (num - 1)
dp[i + 1][j][1] += dp[i][j][1] * 9
for j in range(num_d):
dp[i + 1][j + 1][1] += dp[i][j][0] + dp[i][j][1]
# print(dp[-1])
if num_d < k:
print((0))
else:
print((sum(dp[-1][num_d - k])))
|
N = eval(input())
K = int(eval(input()))
m = len(N)
dp = [[[0] * (K + 1) for _ in range(2)] for _ in range(m + 1)]
dp[0][0][0] = 1
for i in range(1, m + 1):
l = int(N[i - 1])
for k in range(K + 1):
dp[i][1][k] += dp[i - 1][1][k]
if l != 0:
dp[i][1][k] += dp[i - 1][0][k]
else:
dp[i][0][k] += dp[i - 1][0][k]
if k - 1 >= 0:
dp[i][1][k] += 9 * dp[i - 1][1][k - 1]
if l != 0:
dp[i][0][k] += dp[i - 1][0][k - 1]
dp[i][1][k] += (l - 1) * dp[i - 1][0][k - 1]
print((dp[m][0][K] + dp[m][1][K]))
| false
| 43.243243
|
[
"-n = eval(input())",
"-k = int(eval(input()))",
"-dp = [[[0, 0] for i in range(len(n) + 1)] for j in range(len(n) + 1)]",
"-# print(dp)",
"-num_d = len(n)",
"+N = eval(input())",
"+K = int(eval(input()))",
"+m = len(N)",
"+dp = [[[0] * (K + 1) for _ in range(2)] for _ in range(m + 1)]",
"-for i in range(len(n)):",
"- num = int(n[i])",
"- if num == 0:",
"- for j in range(num_d):",
"- dp[i + 1][j + 1][0] = dp[i][j][0]",
"- dp[i + 1][j + 1][1] += dp[i][j][1]",
"- for j in range(num_d + 1):",
"- dp[i + 1][j][1] += dp[i][j][1] * 9",
"- else:",
"- for j in range(num_d):",
"- dp[i + 1][j][0] = dp[i][j][0]",
"- for j in range(num_d + 1):",
"- dp[i + 1][j][1] += dp[i][j][0] * (num - 1)",
"- dp[i + 1][j][1] += dp[i][j][1] * 9",
"- for j in range(num_d):",
"- dp[i + 1][j + 1][1] += dp[i][j][0] + dp[i][j][1]",
"-# print(dp[-1])",
"-if num_d < k:",
"- print((0))",
"-else:",
"- print((sum(dp[-1][num_d - k])))",
"+for i in range(1, m + 1):",
"+ l = int(N[i - 1])",
"+ for k in range(K + 1):",
"+ dp[i][1][k] += dp[i - 1][1][k]",
"+ if l != 0:",
"+ dp[i][1][k] += dp[i - 1][0][k]",
"+ else:",
"+ dp[i][0][k] += dp[i - 1][0][k]",
"+ if k - 1 >= 0:",
"+ dp[i][1][k] += 9 * dp[i - 1][1][k - 1]",
"+ if l != 0:",
"+ dp[i][0][k] += dp[i - 1][0][k - 1]",
"+ dp[i][1][k] += (l - 1) * dp[i - 1][0][k - 1]",
"+print((dp[m][0][K] + dp[m][1][K]))"
] | false
| 0.039711
| 0.041344
| 0.960499
|
[
"s441603312",
"s096796551"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.