id
stringlengths 24
27
| content
stringlengths 37
384k
| max_stars_repo_path
stringlengths 51
51
|
|---|---|---|
condefects-python_data_2701
|
n,s,k=map(int, input().split())
sum=0
for i in range(n):
p,q=map(int, input().split())
sum+=p*q
if s<sum:
print(sum)
else:
print(sum+k)
n,s,k=map(int, input().split())
sum=0
for i in range(n):
p,q=map(int, input().split())
sum+=p*q
if s<=sum:
print(sum)
else:
print(sum+k)
|
ConDefects/ConDefects/Code/abc332_a/Python/54647006
|
condefects-python_data_2702
|
n,s,k = map(int,input().split())
p,q=[],[]
for _ in range(n):
a,b = map(int,input().split())
p.append(a)
q.append(b)
pq = [x*y for x,y in zip(p,q)]
amount = int(sum(pq))
print(amount if amount > s else amount + k)
n,s,k = map(int,input().split())
p,q=[],[]
for _ in range(n):
a,b = map(int,input().split())
p.append(a)
q.append(b)
pq = [x*y for x,y in zip(p,q)]
amount = int(sum(pq))
print(amount if amount >= s else amount + k)
|
ConDefects/ConDefects/Code/abc332_a/Python/54744452
|
condefects-python_data_2703
|
N = int(input())
S = input()
mod = 998244353
DP = [[[0]*26 for _ in range(26)] for __ in range(N)]
DP2 = [[0]*26 for __ in range(N)]
def f(s):
return ord(s) - ord("a")
if S[0]=="?" and S[1]=="?":
DP[1] = [[1]*26 for _ in range(26)]
for i in range(26):
DP[1][i][i] = 0
elif S[0]=="?" and S[1]!="?":
s = f(S[1])
DP[1][s] = [1]*26
DP[1][s][s] = 0
elif S[0]!="?" and S[1]=="?":
s = f(S[0])
for i in range(26):
DP[1][i][s] = 1
DP[1][s][s] = 0
else:
i, j = f(S[0]), f(S[1])
DP[1][i][j] = 1 if i != j else 0
for n in range(2, N):
if S[n] == "?":
for i in range(26):
for j in range(26):
if i == j: continue
for k in range(26):
if i==k or j==k: continue
DP[n][i][j] += DP[n-1][j][k]
DP[n][i][j] %= mod
DP2[n][i] = sum(DP[n][i]) % mod
else:
i = f(S[n])
for j in range(26):
if i == j: continue
for k in range(26):
if i==k or j==k: continue
DP[n][i][j] += DP[n-1][j][k]
DP[n][i][j] %= mod
DP2[n][i] = sum(DP[n][i]) % mod
print(sum(DP2[-1])%mod, sep="\n")
N = int(input())
S = input()
mod = 998244353
DP = [[[0]*26 for _ in range(26)] for __ in range(N)]
DP2 = [[0]*26 for __ in range(N)]
def f(s):
return ord(s) - ord("a")
if S[0]=="?" and S[1]=="?":
DP[1] = [[1]*26 for _ in range(26)]
for i in range(26):
DP[1][i][i] = 0
elif S[0]=="?" and S[1]!="?":
s = f(S[1])
DP[1][s] = [1]*26
DP[1][s][s] = 0
elif S[0]!="?" and S[1]=="?":
s = f(S[0])
for i in range(26):
DP[1][i][s] = 1
DP[1][s][s] = 0
else:
i, j = f(S[0]), f(S[1])
DP[1][i][j] = 1 if i != j else 0
for i in range(26):
DP2[1][i] = sum(DP[1][i]) % mod
for n in range(2, N):
if S[n] == "?":
for i in range(26):
for j in range(26):
if i == j: continue
for k in range(26):
if i==k or j==k: continue
DP[n][i][j] += DP[n-1][j][k]
DP[n][i][j] %= mod
DP2[n][i] = sum(DP[n][i]) % mod
else:
i = f(S[n])
for j in range(26):
if i == j: continue
for k in range(26):
if i==k or j==k: continue
DP[n][i][j] += DP[n-1][j][k]
DP[n][i][j] %= mod
DP2[n][i] = sum(DP[n][i]) % mod
print(sum(DP2[-1])%mod, sep="\n")
|
ConDefects/ConDefects/Code/agc060_a/Python/37682454
|
condefects-python_data_2704
|
from math import gcd
N = int(input())
A = list(map(int, input().split()))
m = A[0]
d = A[-1] - m
g = m
for a in A[1:]:
g = gcd(g, 2*(a-m))
ans = m%g + d
print(ans)
from math import gcd
N = int(input())
A = list(map(int, input().split()))
m = A[0]
d = A[-1] - m
g = d
for a in A[1:]:
g = gcd(g, 2*(a-m))
ans = m%g + d
print(ans)
|
ConDefects/ConDefects/Code/arc152_c/Python/41152980
|
condefects-python_data_2705
|
from functools import reduce; from math import gcd
N=int(input());A=list(map(int,input().split()))
B = [2*A[i+1]-2*A[i] for i in range(N-1)];g=reduce(gcd,B)
mi = A[-1]-A[0]+A[0]%g
#print(mi)
for a in A:
mi = min(mi,A[-1]-A[0]+(-A[-1]+2*a)%g)
#print(mi)
print(mi,g)
from functools import reduce; from math import gcd
N=int(input());A=list(map(int,input().split()))
B = [2*A[i+1]-2*A[i] for i in range(N-1)];g=reduce(gcd,B)
mi = A[-1]-A[0]+A[0]%g
#print(mi)
for a in A:
mi = min(mi,A[-1]-A[0]+(-A[-1]+2*a)%g)
#print(mi)
print(mi)
|
ConDefects/ConDefects/Code/arc152_c/Python/37735671
|
condefects-python_data_2706
|
n = int(input())
a = list(map(int,input().split()))
g = 0
from math import gcd
for i in range(n - 1):
g = gcd(g, a[i] - a[i + 1])
if g % 2 != 0 and (a[0] - a[-1]) % 2 == 0:
g *= 2
print(a[-1] - a[0] + a[0] % g)
n = int(input())
a = list(map(int,input().split()))
g = 0
from math import gcd
for i in range(n - 1):
g = gcd(g, a[i] - a[i + 1])
if (a[0] - a[-1]) % (2 * g) == 0:
g *= 2
print(a[-1] - a[0] + a[0] % g)
|
ConDefects/ConDefects/Code/arc152_c/Python/36943297
|
condefects-python_data_2707
|
import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
heap.append(item)
heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
if heap and item < heap[0]:
item, heap[0] = heap[0], item
heapq._siftup_max(heap, 0)
return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
N=int(readline())
A=list(map(int,readline().split()))
g=0
for i in range(N-1):
g=GCD(g,A[i+1]-A[i])
ans=A[0]%g+A[-1]-A[0]
print(ans)
import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
heap.append(item)
heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
if heap and item < heap[0]:
item, heap[0] = heap[0], item
heapq._siftup_max(heap, 0)
return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
N=int(readline())
A=list(map(int,readline().split()))
g=0
for i in range(N-1):
g=GCD(g,A[i+1]-A[i])
ans=min(A[0]%(2*g),A[-1]%(2*g))+A[-1]-A[0]
print(ans)
|
ConDefects/ConDefects/Code/arc152_c/Python/44122587
|
condefects-python_data_2708
|
import sys
input = sys.stdin.readline
inf = float('inf')
def getInt():
return int(input())
def getStr():
return input().strip()
def getList(dtype=int, split=True):
s = getStr()
if split:
s = s.split()
return list(map(dtype, s))
t = 1
def solve():
n = getInt()
from math import gcd
a = getList()
g = a[-1]-a[0]
for i in a:
g = gcd(2 * (i-a[0]), g)
res = min(a[0] % g, -a[-1] % g)
print(res + a[-1] - a[0])
for _ in range(t):
solve()
import sys
input = sys.stdin.readline
inf = float('inf')
def getInt():
return int(input())
def getStr():
return input().strip()
def getList(dtype=int, split=True):
s = getStr()
if split:
s = s.split()
return list(map(dtype, s))
t = 1
def solve():
n = getInt()
from math import gcd
a = getList()
g = a[-1]-a[0]
for i in a:
g = gcd(2 * (i-a[0]), g)
res = a[0] % g
print(res + a[-1] - a[0])
for _ in range(t):
solve()
|
ConDefects/ConDefects/Code/arc152_c/Python/38915061
|
condefects-python_data_2709
|
import sys
input = sys.stdin.readline
inf = float('inf')
def getInt():
return int(input())
def getStr():
return input().strip()
def getList(dtype=int, split=True):
s = getStr()
if split:
s = s.split()
return list(map(dtype, s))
t = 1
def solve():
n = getInt()
from math import gcd
a = getList()
g = 0
for i in a:
g = gcd(2 * (i-a[0]), g)
res = a[0] % g
print(res + a[-1] - a[0])
for _ in range(t):
solve()
import sys
input = sys.stdin.readline
inf = float('inf')
def getInt():
return int(input())
def getStr():
return input().strip()
def getList(dtype=int, split=True):
s = getStr()
if split:
s = s.split()
return list(map(dtype, s))
t = 1
def solve():
n = getInt()
from math import gcd
a = getList()
g = 0
for i in a:
g = gcd(2 * (i-a[0]), g)
res = min(a[0] % g, a[-1] % g)
print(res + a[-1] - a[0])
for _ in range(t):
solve()
|
ConDefects/ConDefects/Code/arc152_c/Python/38915312
|
condefects-python_data_2710
|
import sys
input = sys.stdin.readline
inf = float('inf')
def getInt():
return int(input())
def getStr():
return input().strip()
def getList(dtype=int, split=True):
s = getStr()
if split:
s = s.split()
return list(map(dtype, s))
t = 1
def solve():
n = getInt()
from math import gcd
g = 0
a = getList()
for i in a:
g = gcd(2 * (i-a[0]), g)
res = a[0] % g
print(res + a[-1] - a[0])
for _ in range(t):
solve()
import sys
input = sys.stdin.readline
inf = float('inf')
def getInt():
return int(input())
def getStr():
return input().strip()
def getList(dtype=int, split=True):
s = getStr()
if split:
s = s.split()
return list(map(dtype, s))
t = 1
def solve():
n = getInt()
from math import gcd
a = getList()
g = a[-1] - a[0]
for i in a:
g = gcd(2 * (i-a[0]), g)
res = a[0] % g
print(res + a[-1] - a[0])
for _ in range(t):
solve()
|
ConDefects/ConDefects/Code/arc152_c/Python/38915283
|
condefects-python_data_2711
|
import math
n=int(input())
a=list(map(int,input().split()))
g=0
for i in a:
g=math.gcd(g,i)
ans=(a[-1]-a[0])+min(a[0]%(2*g),a[-1]%(2*g))
print(ans)
import math
n=int(input())
a=list(map(int,input().split()))
g=0
for i in a:
g=math.gcd(g,i-a[0])
ans=(a[-1]-a[0])+min(a[0]%(2*g),a[-1]%(2*g))
print(ans)
|
ConDefects/ConDefects/Code/arc152_c/Python/41680516
|
condefects-python_data_2712
|
import sys
import os
import inspect
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
if os.getenv("TKTKLOCAL", False):
def debug(*arg, sep=" ", end="\n"):
print(*arg, sep=sep, end=end, file=sys.stderr)
def debug_indent(*arg, sep=" ", end="\n", indent=" "):
frame = inspect.currentframe().f_back
par_func = inspect.getframeinfo(frame).function
if par_func == "<module>":
debug(*arg, sep=sep, end=end)
return
frame_stack = inspect.stack()
if len(frame_stack) > 30:
return
depth = sum(f.function == par_func for f in frame_stack)
debug(indent * (depth - 1), end="")
debug(*arg, sep=sep, end=end)
else:
def debug(*arg, **kwarg):
pass
def debug_indent(*arg, **kwarg):
pass
def reorder(A):
res = []
tmp = []
for a in A:
if a % 2 == 0:
tmp.append(a)
else:
tmp.sort()
res.extend(tmp)
res.append(a)
tmp = []
if tmp:
tmp.sort()
res.extend(tmp)
return res
def check(A, B):
A0 = []
A1 = []
B0 = []
B1 = []
tmp = []
for a in A:
if a % 2 == 1:
A1.append(a)
if tmp:
if len(tmp) > 2:
tmp.sort()
A0.append(tmp)
tmp = []
else:
tmp.append(a)
if tmp:
if len(tmp) > 2:
tmp.sort()
A0.append(tmp)
tmp = []
for a in B:
if a % 2 == 1:
B1.append(a)
if tmp:
if len(tmp) > 2:
tmp.sort()
B0.append(tmp)
tmp = []
else:
tmp.append(a)
if tmp:
if len(tmp) > 2:
tmp.sort()
B0.append(tmp)
debug(A0, B0)
debug(A1, B1)
return A0 == B0 and A1 == B1
def main():
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
# A = reorder(A)
# B = reorder(B)
debug(A)
debug(B)
if sorted(A) != sorted(B):
return False
if A == B:
return True
Ta = [a % 2 for a in A]
Tb = [b % 2 for b in B]
debug(Ta, Tb)
ok = 0
okB = 0
for i in range(N - 2):
if sum(Ta[i:i+3]) == 2:
ok = 1
if sum(Tb[i:i+3]) == 2:
okB = 1
debug(ok, okB)
if ok == 1 and okB == 0:
return False
if not ok:
return check(A, B)
if sum(Ta) == 2:
X = [a for a in A if a % 2 == 0]
Y = [a for a in B if a % 2 == 0]
return X == Y
return True
if main():
print("Yes")
else:
print("No")
import sys
import os
import inspect
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
if os.getenv("TKTKLOCAL", False):
def debug(*arg, sep=" ", end="\n"):
print(*arg, sep=sep, end=end, file=sys.stderr)
def debug_indent(*arg, sep=" ", end="\n", indent=" "):
frame = inspect.currentframe().f_back
par_func = inspect.getframeinfo(frame).function
if par_func == "<module>":
debug(*arg, sep=sep, end=end)
return
frame_stack = inspect.stack()
if len(frame_stack) > 30:
return
depth = sum(f.function == par_func for f in frame_stack)
debug(indent * (depth - 1), end="")
debug(*arg, sep=sep, end=end)
else:
def debug(*arg, **kwarg):
pass
def debug_indent(*arg, **kwarg):
pass
def reorder(A):
res = []
tmp = []
for a in A:
if a % 2 == 0:
tmp.append(a)
else:
tmp.sort()
res.extend(tmp)
res.append(a)
tmp = []
if tmp:
tmp.sort()
res.extend(tmp)
return res
def check(A, B):
A0 = []
A1 = []
B0 = []
B1 = []
tmp = []
for a in A:
if a % 2 == 1:
A1.append(a)
if tmp:
if len(tmp) > 2:
tmp.sort()
A0.append(tmp)
tmp = []
else:
tmp.append(a)
if tmp:
if len(tmp) > 2:
tmp.sort()
A0.append(tmp)
tmp = []
for a in B:
if a % 2 == 1:
B1.append(a)
if tmp:
if len(tmp) > 2:
tmp.sort()
B0.append(tmp)
tmp = []
else:
tmp.append(a)
if tmp:
if len(tmp) > 2:
tmp.sort()
B0.append(tmp)
debug(A0, B0)
debug(A1, B1)
return A0 == B0 and A1 == B1
def main():
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
# A = reorder(A)
# B = reorder(B)
debug(A)
debug(B)
if sorted(A) != sorted(B):
return False
if A == B:
return True
Ta = [a % 2 for a in A]
Tb = [b % 2 for b in B]
debug(Ta, Tb)
ok = 0
okB = 0
for i in range(N - 2):
if sum(Ta[i:i+3]) == 2:
ok = 1
if sum(Tb[i:i+3]) == 2:
okB = 1
debug(ok, okB)
if ok == 1 and okB == 0:
return False
if not ok:
return check(A, B)
if N - sum(Ta) == 2:
X = [a for a in A if a % 2 == 0]
Y = [a for a in B if a % 2 == 0]
return X == Y
return True
if main():
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/arc155_c/Python/38465931
|
condefects-python_data_2713
|
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
def sort_data(data):
odd_pos = []
for i, a in enumerate(data):
if a % 2:
odd_pos.append(i)
flag = 0
for i1, i2 in zip(odd_pos, odd_pos[1:]):
if i2-i1 <= 2:
flag = 1
break
if flag:
odd = []
even = []
for a in data:
if a % 2:
odd.append(a)
else:
even.append(a)
odd.sort()
if len(even) >= 3:
even.sort()
res = odd + even
else:
res = []
fr = 0
for i in odd_pos:
if fr != i:
if i - fr >= 3:
res += sorted(data[fr:i])
else:
res += data[fr:i]
res.append(data[i])
fr = i + 1
if data[-1] % 2 == 0:
if len(data[fr:]) >= 3:
res += sorted(data[fr:])
else:
res += data[fr:]
return res
A = sort_data(A)
B = sort_data(B)
if A == B:
print('Yes')
else:
print('No')
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
def sort_data(data):
odd_pos = []
for i, a in enumerate(data):
if a % 2:
odd_pos.append(i)
flag = 0
for i1, i2 in zip(odd_pos, odd_pos[1:]):
if i2-i1 <= 2:
flag = 1
break
if flag and len(odd_pos)<len(data):
odd = []
even = []
for a in data:
if a % 2:
odd.append(a)
else:
even.append(a)
odd.sort()
if len(even) >= 3:
even.sort()
res = odd + even
else:
res = []
fr = 0
for i in odd_pos:
if fr != i:
if i - fr >= 3:
res += sorted(data[fr:i])
else:
res += data[fr:i]
res.append(data[i])
fr = i + 1
if data[-1] % 2 == 0:
if len(data[fr:]) >= 3:
res += sorted(data[fr:])
else:
res += data[fr:]
return res
A = sort_data(A)
B = sort_data(B)
if A == B:
print('Yes')
else:
print('No')
|
ConDefects/ConDefects/Code/arc155_c/Python/40890958
|
condefects-python_data_2714
|
import math
import sys
sys.setrecursionlimit(500_000)
from collections import defaultdict
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
def oddin3(xs):
m = len(xs)
for i in range(m - 2):
oc = (xs[i] % 2) + (xs[i + 1] % 2) + (xs[i + 2] % 2)
if oc == 2:
return True
return False
def oesplit(xs):
ans = []
for x in xs:
if len(ans) == 0 or x % 2 != ans[-1][0] % 2:
ans.append([])
ans[-1].append(x)
odd, even = [], []
for x in ans:
if len(x) > 2:
x.sort()
if len(x) > 0:
if x[0] % 2 == 0:
even.append(x)
else:
odd.extend(x)
# return ans
return odd, even
def solve():
if a == b:
return True
if Counter(a) != Counter(b):
return False
oa = oddin3(a)
ob = oddin3(b)
ea = [x for x in a if x % 2 == 0]
eb = [x for x in b if x % 2 == 0]
if oa and ob:
if len(ea) > 2:
return True
else:
return ea == eb
if oa or ob:
return False
if oesplit(a) != oesplit(b):
return False
return True
if solve():
print('Yes')
else:
print('No')
import math
import sys
sys.setrecursionlimit(500_000)
from collections import defaultdict
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
def oddin3(xs):
m = len(xs)
for i in range(m - 2):
oc = (xs[i] % 2) + (xs[i + 1] % 2) + (xs[i + 2] % 2)
if oc == 2:
return True
return False
def oesplit(xs):
ans = []
for x in xs:
if len(ans) == 0 or x % 2 != ans[-1][0] % 2:
ans.append([])
ans[-1].append(x)
odd, even = [], []
for x in ans:
if len(x) > 2 and x[0] % 2 == 0:
x.sort()
if len(x) > 0:
if x[0] % 2 == 0:
even.append(x)
else:
odd.extend(x)
# return ans
return odd, even
def solve():
if a == b:
return True
if Counter(a) != Counter(b):
return False
oa = oddin3(a)
ob = oddin3(b)
ea = [x for x in a if x % 2 == 0]
eb = [x for x in b if x % 2 == 0]
if oa and ob:
if len(ea) > 2:
return True
else:
return ea == eb
if oa or ob:
return False
if oesplit(a) != oesplit(b):
return False
return True
if solve():
print('Yes')
else:
print('No')
|
ConDefects/ConDefects/Code/arc155_c/Python/38471956
|
condefects-python_data_2715
|
import sys
input = sys.stdin.readline
inf = float('inf')
def getInt():
return int(input())
def getStr():
return input().strip()
def getList(dtype=int, split=True):
s = getStr()
if split:
s = s.split()
return list(map(dtype, s))
t = 1
def solve():
n = getInt()
a = getList()
b = getList()
if sorted(a) != sorted(b):
print("No")
return
if a == b:
print("Yes")
elif all(i & 1 == 1 for i in a):
print("No")
elif all(i & 1 == 0 for i in a):
print("Yes")
else:
from itertools import groupby
def isSortable(arr):
for i in range(n):
if i + 2 < n and a[i] & 1 and a[i+1] & 1 == 0 and a[i+2] & 1:
return 1
if i + 1 < n and a[i] & 1 and a[i+1] & 1:
return 1
ok = 1
if not isSortable(a) or not isSortable(b):
for i, j in zip(a, b):
ok &= (i & 1) == (j & 1)
if i & 1:
ok &= i == j
h = [list(v) for u, v in groupby(a, key=lambda x: x & 1) if u == 0]
g = [list(v) for u, v in groupby(b, key=lambda x: x & 1) if u == 0]
ok &= len(h) == len(g)
for i, j in zip(h, g):
ok &= sorted(i) == sorted(j)
if len(i) < 3:
ok &= i == j
else:
u = [i for i in a if i & 1 == 0]
v = [i for i in b if i & 1 == 0]
if len(u) == 2:
ok &= u == v
print(ok and "Yes" or "No")
for _ in range(t):
solve()
import sys
input = sys.stdin.readline
inf = float('inf')
def getInt():
return int(input())
def getStr():
return input().strip()
def getList(dtype=int, split=True):
s = getStr()
if split:
s = s.split()
return list(map(dtype, s))
t = 1
def solve():
n = getInt()
a = getList()
b = getList()
if sorted(a) != sorted(b):
print("No")
return
if a == b:
print("Yes")
elif all(i & 1 == 1 for i in a):
print("No")
elif all(i & 1 == 0 for i in a):
print("Yes")
else:
from itertools import groupby
def isSortable(a):
for i in range(n):
if i + 2 < n and a[i] & 1 and a[i+1] & 1 == 0 and a[i+2] & 1:
return 1
if i + 1 < n and a[i] & 1 and a[i+1] & 1:
return 1
ok = 1
if not isSortable(a) or not isSortable(b):
for i, j in zip(a, b):
ok &= (i & 1) == (j & 1)
if i & 1:
ok &= i == j
h = [list(v) for u, v in groupby(a, key=lambda x: x & 1) if u == 0]
g = [list(v) for u, v in groupby(b, key=lambda x: x & 1) if u == 0]
ok &= len(h) == len(g)
for i, j in zip(h, g):
ok &= sorted(i) == sorted(j)
if len(i) < 3:
ok &= i == j
else:
u = [i for i in a if i & 1 == 0]
v = [i for i in b if i & 1 == 0]
if len(u) == 2:
ok &= u == v
print(ok and "Yes" or "No")
for _ in range(t):
solve()
|
ConDefects/ConDefects/Code/arc155_c/Python/38489822
|
condefects-python_data_2716
|
n=int(input())
A=[*map(int,input().split())]
B=[*map(int,input().split())]
st=sorted
def check(a,b):
ev=0
for i in a:
if i%2==0:ev+=1
if ev==0 and a!=b:
return 0
od=0
for i in range(n-2):
if a[i]%2 + a[i+1]%2 + a[i+2]%2 > 1:
od=1
if od and st(a)==st(b):
if ev==2:
ea,eb=0,0
for i in a:
if i%2==0:ea=i;break
for i in b:
if i%2==0:eb=i;break
if ea!=eb:
return 0
return 1
l=0
for i in range(n):
if a[i]%2:
if a[i]!=b[i]:
return 0
if st(a[l:i])!=st(b[l:i]):
return 0
if i<3 and a[:i]!=b[:i]:
return 0
l=i+1
if n-l>2:
return st(a[l:])==st(b[l:])
return a[l:]==b[l:]
if check(A,B) and check(B,A):
print('Yes')
else:
print('No')
n=int(input())
A=[*map(int,input().split())]
B=[*map(int,input().split())]
st=sorted
def check(a,b):
ev=0
for i in a:
if i%2==0:ev+=1
if ev==0 and a!=b:
return 0
od=0
for i in range(n-2):
if a[i]%2 + a[i+1]%2 + a[i+2]%2 > 1:
od=1
if od and st(a)==st(b):
if ev==2:
ea,eb=0,0
for i in a:
if i%2==0:ea=i;break
for i in b:
if i%2==0:eb=i;break
if ea!=eb:
return 0
return 1
l=0
for i in range(n):
if a[i]%2:
if a[i]!=b[i]:
return 0
if st(a[l:i])!=st(b[l:i]):
return 0
if i-l<3 and a[l:i]!=b[l:i]:
return 0
l=i+1
if n-l>2:
return st(a[l:])==st(b[l:])
return a[l:]==b[l:]
if check(A,B) and check(B,A):
print('Yes')
else:
print('No')
|
ConDefects/ConDefects/Code/arc155_c/Python/38467027
|
condefects-python_data_2717
|
n,a,b=map(int,input().split())
if a>b:
a,b=b,a
ax,bx=a,b
while ax>0:
ax,bx=bx%ax,ax
g=bx
ans=0
const=a*b//g
rui=n//const
za=n%const
ans+=(rui*const*2+za+1)*za//2-(rui*const*2+za//a*a+a)*(za//a)//2-(rui*const*2+za//b*b+b)*(za//b)//2
ans+=rui*const*(const+1)//2*(const-const//a-const//b+1)
ans+=rui*(const*(const+1)//2-const*(1+const//a)//2-const*(1+const//b)//2+const)
print(ans)
n,a,b=map(int,input().split())
if a>b:
a,b=b,a
ax,bx=a,b
while ax>0:
ax,bx=bx%ax,ax
g=bx
ans=0
const=a*b//g
rui=n//const
za=n%const
ans+=(rui*const*2+za+1)*za//2-(rui*const*2+za//a*a+a)*(za//a)//2-(rui*const*2+za//b*b+b)*(za//b)//2
ans+=(rui-1)*const*rui//2*(const-const//a-const//b+1)
ans+=rui*(const*(const+1)//2-const*(1+const//a)//2-const*(1+const//b)//2+const)
print(ans)
|
ConDefects/ConDefects/Code/abc253_d/Python/46046758
|
condefects-python_data_2718
|
import math
n,a,b = map(int,input().split())
total = (n*(n+1))//2
rma = n//a
rmb = n//b
plab= n//((a*b)//math.gcd(a,b))
total-=a*(rma*(rma+1))//2
total-=b*(rmb*(rmb+1))//2
total+=(a*b)*(plab*(plab+1))//2
print(total)
import math
n,a,b = map(int,input().split())
total = (n*(n+1))//2
rma = n//a
rmb = n//b
plab= n//((a*b)//math.gcd(a,b))
total-=a*(rma*(rma+1))//2
total-=b*(rmb*(rmb+1))//2
total+=((a*b)//math.gcd(a,b))*(plab*(plab+1))//2
print(total)
|
ConDefects/ConDefects/Code/abc253_d/Python/45937943
|
condefects-python_data_2719
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(range(n + 1))
for i in a:
b[i], b[i + 1] = b[i + 1], b[i]
p = [0] * (n + 1)
for i in range(n):
p[b[i]] = i
b = list(range(n + 1))
for i in a:
if b[i] == 1:
print(p[b[i + 1]])
elif b[i + 1] == 1:
print(p[b[i]])
else:
print(p[1])
b[i], b[i + 1] = b[i + 1], b[i]
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(range(n + 1))
for i in a:
b[i], b[i + 1] = b[i + 1], b[i]
p = [0] * (n + 1)
for i in range(1, n + 1):
p[b[i]] = i
b = list(range(n + 1))
for i in a:
if b[i] == 1:
print(p[b[i + 1]])
elif b[i + 1] == 1:
print(p[b[i]])
else:
print(p[1])
b[i], b[i + 1] = b[i + 1], b[i]
|
ConDefects/ConDefects/Code/abc279_e/Python/44892540
|
condefects-python_data_2720
|
## https://atcoder.jp/contests/abc324/tasks/abc324_g
class Node:
def __init__(self, value):
self.value = value
self.next = None
self.prev = None
def __repr__(self) -> str:
return str(self.value)
class LinkedList:
def __init__(self, maintain_middle=False):
self.head = None
self.tail = None
self.size = 0
self.value_map = {}
self.maintain_middle = maintain_middle
self.middle_value = None
def append(self, value):
if self.head is None:
self.head = Node(value)
self.tail = self.head
self.value_map[value] = self.head
if self.maintain_middle:
self.middle_value = value
else:
node = Node(value)
node.prev = self.tail
self.tail.next = node
self.tail = node
self.value_map[value] = node
if self.maintain_middle:
n = (self.size + 1) // 2
n1 = (self.size + 2) // 2
if n != n1:
self.middle_value = self.value_map[self.middle_value].next.value
self.size += 1
def pop(self):
if self.size == 0:
return None
value = self.tail.value
if self.size == 1:
self.head = None
self.tail = None
self.middle_value = None
else:
prev_node = self.tail.prev
prev_node.next = None
self.tail = prev_node
if self.maintain_middle:
if self.size % 2 == 1:
self.middle_value = self.value_map[self.middle_value].prev.value
self.size -= 1
del self.value_map[value]
return value
def popleft(self):
if self.size == 0:
return None
value = self.head.value
if self.size == 1:
self.head = None
self.tail = None
self.middle_value = None
else:
next_node = self.head.next
next_node.prev = None
self.head = next_node
if self.maintain_middle:
if self.size % 2 == 0:
print(f"self.size = {self.size}")
print(f"self.middle_value = {self.middle_value}")
self.middle_value = self.value_map[self.middle_value].next.value
del self.value_map[value]
self.size -= 1
return value
def remove(self, value):
if value not in self.value_map:
return False
node = self.value_map[value]
if node == self.head:
self.head = node.next
if node == self.tail:
self.tail = node.prev
if node.prev is not None:
node.prev.next = node.next
if node.next is not None:
node.next.prev = node.prev
if self.size == 1:
self.head = None
self.tail = None
if self.maintain_middle:
self.middle_value = None
else:
if self.maintain_middle:
if self.size % 2 == 0:
if node.value[1] <= self.middle_value[1]:
self.middle_value = self.value_map[self.middle_value].next.value
else:
if node.value[1] >= self.middle_value[1]:
self.middle_value = self.value_map[self.middle_value].prev.value
del self.value_map[value]
self.size -= 1
return True
def print_linked_list(linked_list):
node = linked_list.head
print_array = []
while node is not None:
print_array.append(node.value)
node = node.next
print(print_array)
def main():
N = int(input())
A = list(map(int, input().split()))
Q = int(input())
tsx = []
for _ in range(Q):
t, s, x = map(int, input().split())
tsx.append((t, s, x))
q_array_list = []
q_array = [LinkedList(False), LinkedList(True)]
for i, a in enumerate(A):
q_array[0].append((i, a))
a_array = [(i, A[i]) for i in range(N)]
a_array.sort(key=lambda x: x[1])
for i, a in a_array:
q_array[1].append((i, a))
q_array_list.append(q_array)
answers = []
for t, s, x in tsx:
if t == 1:
q_array = q_array_list[s]
if x <= 0:
q_array_list[s] = [LinkedList(False), LinkedList(True)]
q_array_list.append(q_array)
elif x >= q_array[0].size:
q_array_list.append([LinkedList(False), LinkedList(True)])
else:
another_q_array = [LinkedList(False), LinkedList(True)]
if x > q_array[0].size // 2:
queue = []
for _ in reversed(range(x, q_array[0].size)):
value = q_array[0].pop()
q_array[1].remove(value)
queue.append(value)
queue.reverse()
for value in queue:
another_q_array[0].append(value)
queue.sort(key=lambda x: x[1])
for value in queue:
another_q_array[1].append(value)
q_array_list.append(another_q_array)
else:
queue = []
for _ in range(x):
value = q_array[0].popleft()
q_array[1].remove(value)
queue.append(value)
for value in queue:
another_q_array[0].append(value)
queue.sort(key=lambda x: x[1])
for value in queue:
another_q_array[1].append(value)
q_array_list[s] = another_q_array
q_array_list.append(q_array)
else:
# t == 2
q_array = q_array_list[s]
if q_array[1].size == 0:
q_array_list.append([LinkedList(False), LinkedList(True)])
else:
min_value = q_array[1].head.value[1]
max_value = q_array[1].tail.value[1]
if x >= max_value:
q_array_list.append([LinkedList(False), LinkedList(True)])
elif x < min_value:
q_array_list.append(q_array)
q_array_list[s] = [LinkedList(False), LinkedList(True)]
else:
another_q_array = [LinkedList(False), LinkedList(True)]
mid_value = q_array[1].middle_value
if x >= mid_value[1]:
j = q_array[1].tail.value[1]
queue = []
while j > x:
value = q_array[1].pop()
q_array[0].remove(value)
queue.append(value)
j = q_array[1].tail.value[1]
queue.reverse()
for value in queue:
another_q_array[1].append(value)
queue.sort(key=lambda x: x[0])
for value in queue:
another_q_array[0].append(value)
q_array_list.append(another_q_array)
else:
j = q_array[1].head.value[1]
queue = []
while j <= x:
value = q_array[1].popleft()
q_array[0].remove(value)
queue.append(value)
j = q_array[1].head.value[1]
for value in queue:
another_q_array[1].append(value)
queue.sort(key=lambda x: x[0])
for value in queue:
another_q_array[0].append(value)
q_array_list[s] = another_q_array
q_array_list.append(q_array)
answers.append(q_array_list[-1][1].size)
for ans in answers:
print(ans)
if __name__ == "__main__":
main()
## https://atcoder.jp/contests/abc324/tasks/abc324_g
class Node:
def __init__(self, value):
self.value = value
self.next = None
self.prev = None
def __repr__(self) -> str:
return str(self.value)
class LinkedList:
def __init__(self, maintain_middle=False):
self.head = None
self.tail = None
self.size = 0
self.value_map = {}
self.maintain_middle = maintain_middle
self.middle_value = None
def append(self, value):
if self.head is None:
self.head = Node(value)
self.tail = self.head
self.value_map[value] = self.head
if self.maintain_middle:
self.middle_value = value
else:
node = Node(value)
node.prev = self.tail
self.tail.next = node
self.tail = node
self.value_map[value] = node
if self.maintain_middle:
n = (self.size + 1) // 2
n1 = (self.size + 2) // 2
if n != n1:
self.middle_value = self.value_map[self.middle_value].next.value
self.size += 1
def pop(self):
if self.size == 0:
return None
value = self.tail.value
if self.size == 1:
self.head = None
self.tail = None
self.middle_value = None
else:
prev_node = self.tail.prev
prev_node.next = None
self.tail = prev_node
if self.maintain_middle:
if self.size % 2 == 1:
self.middle_value = self.value_map[self.middle_value].prev.value
self.size -= 1
del self.value_map[value]
return value
def popleft(self):
if self.size == 0:
return None
value = self.head.value
if self.size == 1:
self.head = None
self.tail = None
self.middle_value = None
else:
next_node = self.head.next
next_node.prev = None
self.head = next_node
if self.maintain_middle:
if self.size % 2 == 0:
self.middle_value = self.value_map[self.middle_value].next.value
del self.value_map[value]
self.size -= 1
return value
def remove(self, value):
if value not in self.value_map:
return False
node = self.value_map[value]
if node == self.head:
self.head = node.next
if node == self.tail:
self.tail = node.prev
if node.prev is not None:
node.prev.next = node.next
if node.next is not None:
node.next.prev = node.prev
if self.size == 1:
self.head = None
self.tail = None
if self.maintain_middle:
self.middle_value = None
else:
if self.maintain_middle:
if self.size % 2 == 0:
if node.value[1] <= self.middle_value[1]:
self.middle_value = self.value_map[self.middle_value].next.value
else:
if node.value[1] >= self.middle_value[1]:
self.middle_value = self.value_map[self.middle_value].prev.value
del self.value_map[value]
self.size -= 1
return True
def print_linked_list(linked_list):
node = linked_list.head
print_array = []
while node is not None:
print_array.append(node.value)
node = node.next
print(print_array)
def main():
N = int(input())
A = list(map(int, input().split()))
Q = int(input())
tsx = []
for _ in range(Q):
t, s, x = map(int, input().split())
tsx.append((t, s, x))
q_array_list = []
q_array = [LinkedList(False), LinkedList(True)]
for i, a in enumerate(A):
q_array[0].append((i, a))
a_array = [(i, A[i]) for i in range(N)]
a_array.sort(key=lambda x: x[1])
for i, a in a_array:
q_array[1].append((i, a))
q_array_list.append(q_array)
answers = []
for t, s, x in tsx:
if t == 1:
q_array = q_array_list[s]
if x <= 0:
q_array_list[s] = [LinkedList(False), LinkedList(True)]
q_array_list.append(q_array)
elif x >= q_array[0].size:
q_array_list.append([LinkedList(False), LinkedList(True)])
else:
another_q_array = [LinkedList(False), LinkedList(True)]
if x > q_array[0].size // 2:
queue = []
for _ in reversed(range(x, q_array[0].size)):
value = q_array[0].pop()
q_array[1].remove(value)
queue.append(value)
queue.reverse()
for value in queue:
another_q_array[0].append(value)
queue.sort(key=lambda x: x[1])
for value in queue:
another_q_array[1].append(value)
q_array_list.append(another_q_array)
else:
queue = []
for _ in range(x):
value = q_array[0].popleft()
q_array[1].remove(value)
queue.append(value)
for value in queue:
another_q_array[0].append(value)
queue.sort(key=lambda x: x[1])
for value in queue:
another_q_array[1].append(value)
q_array_list[s] = another_q_array
q_array_list.append(q_array)
else:
# t == 2
q_array = q_array_list[s]
if q_array[1].size == 0:
q_array_list.append([LinkedList(False), LinkedList(True)])
else:
min_value = q_array[1].head.value[1]
max_value = q_array[1].tail.value[1]
if x >= max_value:
q_array_list.append([LinkedList(False), LinkedList(True)])
elif x < min_value:
q_array_list.append(q_array)
q_array_list[s] = [LinkedList(False), LinkedList(True)]
else:
another_q_array = [LinkedList(False), LinkedList(True)]
mid_value = q_array[1].middle_value
if x >= mid_value[1]:
j = q_array[1].tail.value[1]
queue = []
while j > x:
value = q_array[1].pop()
q_array[0].remove(value)
queue.append(value)
j = q_array[1].tail.value[1]
queue.reverse()
for value in queue:
another_q_array[1].append(value)
queue.sort(key=lambda x: x[0])
for value in queue:
another_q_array[0].append(value)
q_array_list.append(another_q_array)
else:
j = q_array[1].head.value[1]
queue = []
while j <= x:
value = q_array[1].popleft()
q_array[0].remove(value)
queue.append(value)
j = q_array[1].head.value[1]
for value in queue:
another_q_array[1].append(value)
queue.sort(key=lambda x: x[0])
for value in queue:
another_q_array[0].append(value)
q_array_list[s] = another_q_array
q_array_list.append(q_array)
answers.append(q_array_list[-1][1].size)
for ans in answers:
print(ans)
if __name__ == "__main__":
main()
|
ConDefects/ConDefects/Code/abc324_g/Python/52629689
|
condefects-python_data_2721
|
S = input()
print(len(S) + S.count('00'))
S = input()
print(len(S) - S.count('00'))
|
ConDefects/ConDefects/Code/abc283_c/Python/45014818
|
condefects-python_data_2722
|
s=list(map(int,input()))
n=len(s)
ans=0
ze=0
for i in range(n):
if s[i]!=0:
ans+=1
else:
ze+=1
print(ans+(ze+1)//2)
s=list(map(int,input()))
n=len(s)
ans=0
ze=0
for i in range(n):
if s[i]!=0:
ans+=1
ans+=(ze+1)//2
ze=0
else:
ze+=1
print(ans+(ze+1)//2)
|
ConDefects/ConDefects/Code/abc283_c/Python/45014634
|
condefects-python_data_2723
|
# ansmod = 10 ** 9 + 7
# ansmod = 998244353
import sys
def main(f):
s = list(map(int, f.readline()[:-1]))
if len(s) == 1:
if s[0] == 0:
return 0
else:
return 1
ans = 0
f = False
for c in s:
if c == 0:
if f:
ans += 1
f = False
else:
f = True
else:
if f:
ans += 1
f = False
ans += 1
return ans
if __name__ == "__main__":
print(main(sys.stdin))
# print(main(sys.stdin) % ansmod)
# ansmod = 10 ** 9 + 7
# ansmod = 998244353
import sys
def main(f):
s = list(map(int, f.readline()[:-1]))
if len(s) == 1:
if s[0] == 0:
return 0
else:
return 1
ans = 0
f = False
for c in s:
if c == 0:
if f:
ans += 1
f = False
else:
f = True
else:
if f:
ans += 1
f = False
ans += 1
if f:
ans += 1
return ans
if __name__ == "__main__":
print(main(sys.stdin))
# print(main(sys.stdin) % ansmod)
|
ConDefects/ConDefects/Code/abc283_c/Python/45277024
|
condefects-python_data_2724
|
n = int(input())
cs = {}
for i in range(n):
a, c = map(int, input().split())
if c in cs:
cs[c].append(a)
else:
cs[c] = [a]
keys = cs.keys()
c = -1
a = 0
for k in keys:
m = min(cs[k])
if m > a:
c = k
a = m
print(c)
n = int(input())
cs = {}
for i in range(n):
a, c = map(int, input().split())
if c in cs:
cs[c].append(a)
else:
cs[c] = [a]
keys = cs.keys()
c = -1
a = 0
for k in keys:
m = min(cs[k])
if m > a:
c = k
a = m
print(a)
|
ConDefects/ConDefects/Code/abc348_c/Python/54707785
|
condefects-python_data_2725
|
N = int(input())
AC = sorted(sorted([list(map(int, input().split())) for _ in range(N)]), key=lambda x:x[1])
num, _min = AC[0]
for i in AC[1:]:
if num != i[1]:
num = i[1]
if _min < i[0]:
_min = i[0]
print(_min)
N = int(input())
AC = sorted(sorted([list(map(int, input().split())) for _ in range(N)]), key=lambda x:x[1])
_min, num = AC[0]
for i in AC[1:]:
if num != i[1]:
num = i[1]
if _min < i[0]:
_min = i[0]
print(_min)
|
ConDefects/ConDefects/Code/abc348_c/Python/54773547
|
condefects-python_data_2726
|
n = int(input())
dic = {}
for _ in range(n):
a, c = map(int, input().split())
dic[c] = min(dic.get(c, 10**10), a)
print(max(dic))
n = int(input())
dic = {}
for _ in range(n):
a, c = map(int, input().split())
dic[c] = min(dic.get(c, 10**10), a)
print(max(dic.values()))
|
ConDefects/ConDefects/Code/abc348_c/Python/55014351
|
condefects-python_data_2727
|
import collections
N = int(input())
AC = [list(map(int, input().split())) for _ in range(N)]
AC = sorted(AC)
AC = sorted(AC, key=lambda x:x[1])
print(AC)
num = AC[0][1]
_min = AC[0][0]
for i in AC[1:]:
if num != i[1]:
num = i[1]
if _min < i[0]:
_min = i[0]
import collections
N = int(input())
AC = [list(map(int, input().split())) for _ in range(N)]
AC = sorted(AC)
AC = sorted(AC, key=lambda x:x[1])
num = AC[0][1]
_min = AC[0][0]
for i in AC[1:]:
if num != i[1]:
num = i[1]
if _min < i[0]:
_min = i[0]
print(_min)
|
ConDefects/ConDefects/Code/abc348_c/Python/54773465
|
condefects-python_data_2728
|
dir={
"tourist":"3858",
"ksun48":"3679",
"Benq":"3658",
"Um_nik":"3648",
"apiad":"3638",
"Stonefeang":"3630",
"ecnerwala":"3613",
"mnbvmar":"3555",
"newbiedmy":"3516",
"semiexp":"3481"
}
print=(dir[input()])
dir={
"tourist":"3858",
"ksun48":"3679",
"Benq":"3658",
"Um_nik":"3648",
"apiad":"3638",
"Stonefeang":"3630",
"ecnerwala":"3613",
"mnbvmar":"3555",
"newbiedmy":"3516",
"semiexp":"3481"
}
print(dir[input()])
|
ConDefects/ConDefects/Code/abc319_a/Python/45786376
|
condefects-python_data_2729
|
arr={'tourist' :3859,'ksun48':3679,'Benq':3658,'Um_nik':3648,'apiad':3638,
'Stonefeang': 3630,
'ecnerwala': 3613,
'mnbvmar': 3555,
'newbiedmy': 3516,
'semiexp':3481}
name=input()
print(arr[name])
arr={'tourist' :3858,'ksun48':3679,'Benq':3658,'Um_nik':3648,'apiad':3638,
'Stonefeang': 3630,
'ecnerwala': 3613,
'mnbvmar': 3555,
'newbiedmy': 3516,
'semiexp':3481}
name=input()
print(arr[name])
|
ConDefects/ConDefects/Code/abc319_a/Python/46004667
|
condefects-python_data_2730
|
def main():
map = {
"tourist": 3858,
"ksun48": 3679,
"Benq":3658,
"Um_nik": 3648,
"apiad": 3638,
"Stonefeang": 3630,
"ecnerwala": 3613,
"mnbvmar": 3555,
"newbiedmy": 3516,
"semiexp": 3481
}
print(map[input()])
def main():
map = {
"tourist": 3858,
"ksun48": 3679,
"Benq":3658,
"Um_nik": 3648,
"apiad": 3638,
"Stonefeang": 3630,
"ecnerwala": 3613,
"mnbvmar": 3555,
"newbiedmy": 3516,
"semiexp": 3481
}
print(map[input()])
if __name__ == "__main__":
main()
|
ConDefects/ConDefects/Code/abc319_a/Python/45924086
|
condefects-python_data_2731
|
s=str(input())
if s=="tourist":
print(3858)
if s=="ksun48":
print(3679)
if s=="Beng":
print(3658)
if s=="Um_nik":
print(3648)
if s=="apiad":
print(3638)
if s=="Stonefeang":
print(3630)
if s=="ecnerwala":
print(3613)
if s=="mnbvmar":
print(3555)
if s=="newbiedmy":
print(3516)
if s=="semiexp":
print(3481)
s=str(input())
if s=="tourist":
print(3858)
if s=="ksun48":
print(3679)
if s=="Benq":
print(3658)
if s=="Um_nik":
print(3648)
if s=="apiad":
print(3638)
if s=="Stonefeang":
print(3630)
if s=="ecnerwala":
print(3613)
if s=="mnbvmar":
print(3555)
if s=="newbiedmy":
print(3516)
if s=="semiexp":
print(3481)
|
ConDefects/ConDefects/Code/abc319_a/Python/45796003
|
condefects-python_data_2732
|
S = input()
if S =="tourist":
print(3858)
if S == "ksun48":
print(679)
if S == "Benq":
print(3658)
if S == "Um_nik":
print(3648)
if S == "apiad":
print(3638)
if S == "Stonefeang":
print(3630)
if S == "ecnerwala":
print(3613)
if S == "mnbvmar":
print(3555)
if S == "newbiedmy":
print(3516)
if S == "semiexp":
print(3481)
S = input()
if S =="tourist":
print(3858)
if S == "ksun48":
print(3679)
if S == "Benq":
print(3658)
if S == "Um_nik":
print(3648)
if S == "apiad":
print(3638)
if S == "Stonefeang":
print(3630)
if S == "ecnerwala":
print(3613)
if S == "mnbvmar":
print(3555)
if S == "newbiedmy":
print(3516)
if S == "semiexp":
print(3481)
|
ConDefects/ConDefects/Code/abc319_a/Python/46183360
|
condefects-python_data_2733
|
s=str(input())
if s=="tourist":
print(3858)
if s=="ksun48":
print(3679)
if s=="Benq":
print(3658)
if s=="Um_nik":
print(3648)
if s=="apiad":
print(3638)
if s=="Stonefeang":
print(3630)
if s=="ecnerwala":
print(3613)
if s=="marinara":
print(3555)
if s=="newbiedmy":
print(3516)
if s=="semiexp":
print(3481)
s=str(input())
if s=="tourist":
print(3858)
if s=="ksun48":
print(3679)
if s=="Benq":
print(3658)
if s=="Um_nik":
print(3648)
if s=="apiad":
print(3638)
if s=="Stonefeang":
print(3630)
if s=="ecnerwala":
print(3613)
if s=="mnbvmar":
print(3555)
if s=="newbiedmy":
print(3516)
if s=="semiexp":
print(3481)
|
ConDefects/ConDefects/Code/abc319_a/Python/45795437
|
condefects-python_data_2734
|
S=input()
l=[["tourist",3858],["ksun48", 3679],["Benq", 3658],["Um_nik", 3648],["apiad", 3638],["Stonefeang", 3630],
["ecnerwala", 3613],["mnbvmar", 3555],["ewbiedmy", 3516],["semiexp", 3481]]
for i in l:
if i[0]==S:
print(i[1])
S=input()
l=[["tourist",3858],["ksun48", 3679],["Benq", 3658],["Um_nik", 3648],["apiad", 3638],["Stonefeang", 3630],
["ecnerwala", 3613],["mnbvmar", 3555],["newbiedmy", 3516],["semiexp", 3481]]
for i in l:
if i[0]==S:
print(i[1])
|
ConDefects/ConDefects/Code/abc319_a/Python/45995183
|
condefects-python_data_2735
|
N = int(input())
num_set = set(range(1, 2*N+2))
while True:
print(num_set.pop, flush=True)
a = int(input()) #aは青木君が宣言した数
if a==0:
break
num_set.discard(a)
N = int(input())
num_set = set(range(1, 2*N+2))
while True:
print(num_set.pop())
a = int(input()) #aは青木君が宣言した数
if a==0:
break
num_set.discard(a)
|
ConDefects/ConDefects/Code/abc244_c/Python/45666072
|
condefects-python_data_2736
|
N=int(input())
bad=set()
for _ in range(N+1):
for i in range(1,N+1):
if i not in bad:
bad.add(i)
print(i)
bad.add(int(input()))
break
N=int(input())
bad=set()
for _ in range(N+1):
for i in range(1,2*N+2):
if i not in bad:
bad.add(i)
print(i)
bad.add(int(input()))
break
|
ConDefects/ConDefects/Code/abc244_c/Python/45762748
|
condefects-python_data_2737
|
n=int(input())
ans=[i for i in range(1,n+2)]
while True:
print(ans.pop(0), flush=True)
tmp=int(input())
if tmp==0:
exit()
else:
ans.remove(tmp)
n=int(input())
ans=[i for i in range(1,2*n+2)]
while True:
print(ans.pop(0), flush=True)
tmp=int(input())
if tmp==0:
exit()
else:
ans.remove(tmp)
|
ConDefects/ConDefects/Code/abc244_c/Python/45056793
|
condefects-python_data_2738
|
import sys
sys.setrecursionlimit(10**9)
def main():
N, K = map(int, input().split())
S = input()
for i in range(1, N + 1):
D = [[0 for _ in range(26)] for _ in range(i)]
T = [0 for _ in range(i)]
for j, s in enumerate(S):
D[j % i][ord(s) - ord("a")] += 1
T[j % i] += 1
k = 0
for l, d in enumerate(D):
d.sort(reverse=True)
k += T[l] - d[0]
if k <= K:
print(i)
return
if __name__ == "__main__":
main()
import sys
sys.setrecursionlimit(10**9)
def main():
N, K = map(int, input().split())
S = input()
for i in range(1, N + 1):
if N % i:
continue
D = [[0 for _ in range(26)] for _ in range(i)]
T = [0 for _ in range(i)]
for j, s in enumerate(S):
D[j % i][ord(s) - ord("a")] += 1
T[j % i] += 1
k = 0
for l, d in enumerate(D):
d.sort(reverse=True)
k += T[l] - d[0]
if k <= K:
print(i)
return
if __name__ == "__main__":
main()
|
ConDefects/ConDefects/Code/arc140_a/Python/45466035
|
condefects-python_data_2739
|
N,K = map(int,input().split())
S = input()
X, M = 0, 0
l = -1
r = N
for m in range(1,N+1):
d = [[0 for i in range(26)] for j in range(m)]
c = [0 for i in range(m)]
for i in range(N):
s = S[i]
n = ord(s) - 97
d[i%m][n] += 1
c[i%m] += 1
k = 0
for i in range(m):
k += (c[i] - max(d[i]))
if k <= K:
ans = m
break
print(ans)
N,K = map(int,input().split())
S = input()
X, M = 0, 0
l = -1
r = N
for m in range(1,N+1):
if N % m != 0:
continue
d = [[0 for i in range(26)] for j in range(m)]
c = [0 for i in range(m)]
for i in range(N):
s = S[i]
n = ord(s) - 97
d[i%m][n] += 1
c[i%m] += 1
k = 0
for i in range(m):
k += (c[i] - max(d[i]))
if k <= K:
ans = m
break
print(ans)
|
ConDefects/ConDefects/Code/arc140_a/Python/43702088
|
condefects-python_data_2740
|
from collections import deque
n1, n2, m = map(int,input().split())
g1, g2 = [[] for _ in range(n1)],[[] for _ in range(n2)]
g = [[] for _ in range(n1+n2)]
for _ in range(m):
a,b = [int(e) -1 for e in input().split()]
g[a].append(b)
g[b].append(a)
def dfs(s):
dd = [-1] * (n1+n2)
dd[s] = 0
q = deque()
q.append(0)
while q:
now = q.popleft()
for b in g[now]:
if dd[b] == -1:
dd[b] = dd[now]+1
q.append(b)
return dd
len1 = max(dfs(0))
len2 = max(dfs(n1+n2-1))
print(len1+len2+1)
from collections import deque
n1, n2, m = map(int,input().split())
g1, g2 = [[] for _ in range(n1)],[[] for _ in range(n2)]
g = [[] for _ in range(n1+n2)]
for _ in range(m):
a,b = [int(e) -1 for e in input().split()]
g[a].append(b)
g[b].append(a)
def dfs(s):
dd = [-1] * (n1+n2)
dd[s] = 0
q = deque()
q.append(s)
while q:
now = q.popleft()
for b in g[now]:
if dd[b] == -1:
dd[b] = dd[now]+1
q.append(b)
return dd
len1 = max(dfs(0))
len2 = max(dfs(n1+n2-1))
print(len1+len2+1)
|
ConDefects/ConDefects/Code/abc309_d/Python/46051654
|
condefects-python_data_2741
|
import numpy as np
from numba import i8, njit
from math import sqrt, atan2
@njit((i8, i8, i8, i8[:]), cache = True)
def add(p, x, size, data):
p += 1
while p <= size:
data[p] += x
p += p & -p
@njit(i8(i8, i8[:]), cache = True)
def _sum(r, data):
s = 0
while r > 0:
s += data[r]
r -= r & -r
return s
def proc(r):
point = []
idx = 0
for ai, bi, di in zip(a, b, d):
if abs(di) >= r:
continue
t = sqrt(r * r - di * di)
ab = sqrt(ai * ai + bi * bi)
_x = ai / ab
_y = bi / ab
x = _x * di
y = _y * di
dx = t * _y
dy = t * _x
point.append(int(atan2(y - dy, x + dx) * inf) * n + idx)
point.append(int(atan2(y + dy, x - dx) * inf) * n + idx)
idx += 1
point.sort()
res = 0
for i, p in enumerate(point):
j = p % n
if memo[j] == -1:
memo[j] = i
add(i, 1, size, data)
continue
else:
res += _sum(i, data)
res -= _sum(memo[j] + 1, data)
add(memo[j], -1, size, data)
memo[j] = -1
return res
n, k = map(int, input().split())
a = [0] * n
b = [0] * n
d = [0] * n
for i in range(n):
ai, bi, ci = map(int, input().split())
a[i] = ai
b[i] = bi
d[i] = -ci / sqrt(ai * ai + bi * bi)
size = 2 * n
data = np.zeros(size + 1, np.int64)
memo = [-1] * n
inf = 1 << 40
ng = 0
ok = 1 << 20
for _ in range(40):
mid = (ng + ok) / 2
if proc(mid) >= k:
ok = mid
else:
ng = mid
ans = ok
print(ans)
import numpy as np
from numba import i8, njit
from math import sqrt, atan2
@njit((i8, i8, i8, i8[:]), cache = True)
def add(p, x, size, data):
p += 1
while p <= size:
data[p] += x
p += p & -p
@njit(i8(i8, i8[:]), cache = True)
def _sum(r, data):
s = 0
while r > 0:
s += data[r]
r -= r & -r
return s
def proc(r):
point = []
idx = 0
for ai, bi, di in zip(a, b, d):
if abs(di) >= r:
continue
t = sqrt(r * r - di * di)
ab = sqrt(ai * ai + bi * bi)
_x = ai / ab
_y = bi / ab
x = _x * di
y = _y * di
dx = t * _y
dy = t * _x
point.append(int(atan2(y - dy, x + dx) * inf) * n + idx)
point.append(int(atan2(y + dy, x - dx) * inf) * n + idx)
idx += 1
point.sort()
res = 0
for i, p in enumerate(point):
j = p % n
if memo[j] == -1:
memo[j] = i
add(i, 1, size, data)
continue
else:
res += _sum(i, data)
res -= _sum(memo[j] + 1, data)
add(memo[j], -1, size, data)
memo[j] = -1
return res
n, k = map(int, input().split())
a = [0] * n
b = [0] * n
d = [0] * n
for i in range(n):
ai, bi, ci = map(int, input().split())
a[i] = ai
b[i] = bi
d[i] = -ci / sqrt(ai * ai + bi * bi)
size = 2 * n
data = np.zeros(size + 1, np.int64)
memo = [-1] * n
inf = 1 << 40
ng = 0
ok = 1 << 24
for _ in range(40):
mid = (ng + ok) / 2
if proc(mid) >= k:
ok = mid
else:
ng = mid
ans = ok
print(ans)
|
ConDefects/ConDefects/Code/abc263_h/Python/49039255
|
condefects-python_data_2742
|
class FenwickTree:
def __init__(self, n: int):
self.n = n
self.arr = [0] * (n + 1)
# n以下の最大の2冪
self.powlog_n = 2 ** (n.bit_length() - 1)
def add(self, i: int, x: int):
"""`a[i] += x`
Args:
i (int): 0-indexed
x (int): to add
Note:
If `i` is out of `[0, n)`, do nothing.
"""
if i < 0:
return
i += 1
arr = self.arr
n = self.n
while i <= n:
arr[i] += x
# arr[i] %= mod
i += i & -i
def sum(self, i: int) -> int:
"""get `sum(a[:i])`
Args:
i (int): 0-indexed
Returns:
int: `sum(a[:i])`
"""
ans = 0
arr = self.arr
# mod = self.mod
if i > self.n:
i = self.n
while i > 0:
ans += arr[i]
# ans %= mod
i -= i & -i
return ans
def sum2(self, i: int, j: int) -> int:
"""get `sum(a[i:j])`
Args:
i (int): 0-indexed begin
j (int): 0-indexed end
Returns:
int: `sum(a[i:j])`
"""
ans = self.sum(j) - self.sum(i)
# ans %= mod
return ans
def lower_bound(self, w: int) -> int:
"""lower_bound
Args:
w (int): sum
Returns:
int: min `x`(>= 0, 0-indexed) s.t. `sum(a[:x])` >= w
`n + 1` if w > `sum(a[:n])`
Note:
expect `a[i]` >= 0 for all `i`
Reference:
http://hos.ac/slides/20140319_bit.pdf - p.75
"""
if w <= 0:
return 0
arr = self.arr
n = self.n
k = self.powlog_n
x = 0
while k > 0:
if x + k <= n and arr[x + k] < w:
x += k
w -= arr[x]
k //= 2
return x + 1
def get(self, i: int):
"""index access `a[i]`
Args:
i (int): 0-indexed
Returns:
int | None: `a[i]` if 0 <= `i` < n
else `None`
"""
if 0 <= i < self.n:
return self.sum2(i, i + 1)
else:
return None
def __repr__(self) -> str:
a = [self.get(i) for i in range(self.n)]
a_s = " ".join(map(str, a))
return f"FenwickTree({self.n})[{a_s}]"
from sys import stdin
def input():
return stdin.readline().rstrip()
n, k = map(int, input().split())
lines = [tuple(map(int, input().split())) for i in range(n)]
from math import atan2, acos, pi, hypot
lines = [(atan2(a / c, b / c) if c else atan2(a, b), abs(c) / hypot(a, b)) for a, b, c in lines]
# n, m = map(int, input().split())
# seg = [tuple(map(int, input().split())) for i in range(m)]
tau = 2 * pi
def within(rad):
seg = []
s = set()
for th0, d in lines:
if d / rad >= 1:
continue
th = acos(d / rad)
l = (th0 + th) % tau
r = (th0 - th) % tau
if l > r:
l, r = r, l
seg.append((l, r))
s.add(l)
s.add(r)
s = sorted(s)
toi = {x: i for i, x in enumerate(s)}
ms = len(s)
g = [[] for i in range(ms)]
for l, r in seg:
g[toi[l]].append(toi[r])
ft = FenwickTree(ms)
ans = 0
for l in range(ms):
for r in g[l]:
ans += ft.sum2(l + 1, r)
for r in g[l]:
ft.add(r, 1)
return ans
lo = 0
hi = 1
while within(hi) < k:
lo, hi = hi, hi * 2
for i in range(10):
mi = (hi + lo) / 2
if within(mi) < k:
lo = mi
else:
hi = mi
print(hi)
class FenwickTree:
def __init__(self, n: int):
self.n = n
self.arr = [0] * (n + 1)
# n以下の最大の2冪
self.powlog_n = 2 ** (n.bit_length() - 1)
def add(self, i: int, x: int):
"""`a[i] += x`
Args:
i (int): 0-indexed
x (int): to add
Note:
If `i` is out of `[0, n)`, do nothing.
"""
if i < 0:
return
i += 1
arr = self.arr
n = self.n
while i <= n:
arr[i] += x
# arr[i] %= mod
i += i & -i
def sum(self, i: int) -> int:
"""get `sum(a[:i])`
Args:
i (int): 0-indexed
Returns:
int: `sum(a[:i])`
"""
ans = 0
arr = self.arr
# mod = self.mod
if i > self.n:
i = self.n
while i > 0:
ans += arr[i]
# ans %= mod
i -= i & -i
return ans
def sum2(self, i: int, j: int) -> int:
"""get `sum(a[i:j])`
Args:
i (int): 0-indexed begin
j (int): 0-indexed end
Returns:
int: `sum(a[i:j])`
"""
ans = self.sum(j) - self.sum(i)
# ans %= mod
return ans
def lower_bound(self, w: int) -> int:
"""lower_bound
Args:
w (int): sum
Returns:
int: min `x`(>= 0, 0-indexed) s.t. `sum(a[:x])` >= w
`n + 1` if w > `sum(a[:n])`
Note:
expect `a[i]` >= 0 for all `i`
Reference:
http://hos.ac/slides/20140319_bit.pdf - p.75
"""
if w <= 0:
return 0
arr = self.arr
n = self.n
k = self.powlog_n
x = 0
while k > 0:
if x + k <= n and arr[x + k] < w:
x += k
w -= arr[x]
k //= 2
return x + 1
def get(self, i: int):
"""index access `a[i]`
Args:
i (int): 0-indexed
Returns:
int | None: `a[i]` if 0 <= `i` < n
else `None`
"""
if 0 <= i < self.n:
return self.sum2(i, i + 1)
else:
return None
def __repr__(self) -> str:
a = [self.get(i) for i in range(self.n)]
a_s = " ".join(map(str, a))
return f"FenwickTree({self.n})[{a_s}]"
from sys import stdin
def input():
return stdin.readline().rstrip()
n, k = map(int, input().split())
lines = [tuple(map(int, input().split())) for i in range(n)]
from math import atan2, acos, pi, hypot
lines = [(atan2(a / c, b / c) if c else atan2(a, b), abs(c) / hypot(a, b)) for a, b, c in lines]
# n, m = map(int, input().split())
# seg = [tuple(map(int, input().split())) for i in range(m)]
tau = 2 * pi
def within(rad):
seg = []
s = set()
for th0, d in lines:
if d / rad >= 1:
continue
th = acos(d / rad)
l = (th0 + th) % tau
r = (th0 - th) % tau
if l > r:
l, r = r, l
seg.append((l, r))
s.add(l)
s.add(r)
s = sorted(s)
toi = {x: i for i, x in enumerate(s)}
ms = len(s)
g = [[] for i in range(ms)]
for l, r in seg:
g[toi[l]].append(toi[r])
ft = FenwickTree(ms)
ans = 0
for l in range(ms):
for r in g[l]:
ans += ft.sum2(l + 1, r)
for r in g[l]:
ft.add(r, 1)
return ans
lo = 0
hi = 1
while within(hi) < k:
lo, hi = hi, hi * 2
for i in range(15):
mi = (hi + lo) / 2
if within(mi) < k:
lo = mi
else:
hi = mi
print(hi)
|
ConDefects/ConDefects/Code/abc263_h/Python/33881482
|
condefects-python_data_2743
|
n = int(input())
S = input()
def f(T):
U = [c for c in reversed(T)]
for i in range(len(U)):
U[i] = 'd' if U[i] == 'p' else 'p'
return ''.join(U)
l = 0
while l < n and S[l] != 'd':
l += 1
ans = S
for r in range(l+1, n+1):
ans = min(ans, S[:l] + f(S[l:r]) + S[r:])
print(ans)
n = int(input())
S = input()
def f(T):
U = [c for c in reversed(T)]
for i in range(len(U)):
U[i] = 'd' if U[i] == 'p' else 'p'
return ''.join(U)
l = 0
while l < n and S[l] == 'd':
l += 1
ans = S
for r in range(l+1, n+1):
ans = min(ans, S[:l] + f(S[l:r]) + S[r:])
print(ans)
|
ConDefects/ConDefects/Code/arc148_b/Python/43029081
|
condefects-python_data_2744
|
# import pypyjit;pypyjit.set_param("max_unroll_recursion=-1")
# from bisect import *
# from collections import *
# from heapq import *
# from itertools import *
# from math import *
# from datetime import *
# from decimal import*
# from string import ascii_lowercase,ascii_uppercase
# import numpy as np
import sys
import os
# sys.setrecursionlimit(10**6)
INF = 10**18
MOD = 998244353
# MOD = 10**9 + 7
File = open("input.txt", "r") if os.path.exists("input.txt") else sys.stdin
def input():
return File.readline()[:-1]
# ///////////////////////////////////////////////////////////////////////////
N = int(input())
S = input()
s = set()
if "p" not in S or "d" not in S:
print(S)
exit()
idxP = S.index("p")
dp = str.maketrans({"d": "p", "p": "d"})
for i in range(idxP, N + 1):
s.add(S[:idxP] + S[idxP:i][::-1].translate(dp) + S[i:])
print(min(s))
# import pypyjit;pypyjit.set_param("max_unroll_recursion=-1")
# from bisect import *
# from collections import *
# from heapq import *
# from itertools import *
# from math import *
# from datetime import *
# from decimal import*
# from string import ascii_lowercase,ascii_uppercase
# import numpy as np
import sys
import os
# sys.setrecursionlimit(10**6)
INF = 10**18
MOD = 998244353
# MOD = 10**9 + 7
File = open("input.txt", "r") if os.path.exists("input.txt") else sys.stdin
def input():
return File.readline()[:-1]
# ///////////////////////////////////////////////////////////////////////////
N = int(input())
S = input()
s = set()
if "p" not in S or "d" not in S:
print("d" * N)
exit()
idxP = S.index("p")
dp = str.maketrans({"d": "p", "p": "d"})
for i in range(idxP, N + 1):
s.add(S[:idxP] + S[idxP:i][::-1].translate(dp) + S[i:])
print(min(s))
|
ConDefects/ConDefects/Code/arc148_b/Python/43234248
|
condefects-python_data_2745
|
N=int(input())
S=input()
psta=[]
keep=N
cnt=0
for i in range(N-1,-1,-1):
if S[i]=="p":
if cnt==0:
keep=i
cnt=1
else:
cnt+=1
else:
if cnt!=0:
psta.append((cnt,keep))
cnt=0
if cnt!=0:
psta.append((cnt,keep))
psta=sorted(psta)
if len(psta)==0:
print(S)
else:
cnt,back=psta[-1]
ans=[]
for sta in range(N):
if S[sta]=="p":
break
#print(sta,back)
T=S[sta:back+1]
T="".join(list(reversed(T)))
T=T.replace('d', 'X').replace('p', 'd').replace('X', 'p')
ans.append(S[:sta]+T+S[back+1:])
for i in range(len(psta)-2,-1,-1):
a,back=psta[i]
if a!=cnt:
break
#print(sta,back)
T=S[sta:back+1]
T="".join(list(reversed(T)))
T=T.replace('d', 'X').replace('p', 'd').replace('X', 'p')
ans.append(S[:sta]+T+S[back+1:])
#print(ans)
print(min(ans))
N=int(input())
S=input()
psta=[]
keep=N
cnt=0
for i in range(N-1,-1,-1):
if S[i]=="p":
if cnt==0:
keep=i
cnt=1
else:
cnt+=1
else:
if cnt!=0:
psta.append((cnt,keep))
cnt=0
if cnt!=0:
psta.append((cnt,keep))
psta=sorted(psta)
if len(psta)==0:
print(S)
else:
cnt,back=psta[-1]
ans=[]
for sta in range(N):
if S[sta]=="p":
break
#print(sta,back)
T=S[sta:back+1]
T="".join(list(reversed(T)))
T=T.replace('d', 'X').replace('p', 'd').replace('X', 'p')
ans.append(S[:sta]+T+S[back+1:])
for i in range(len(psta)-2,-1,-1):
a,back=psta[i]
#print(sta,back)
T=S[sta:back+1]
T="".join(list(reversed(T)))
T=T.replace('d', 'X').replace('p', 'd').replace('X', 'p')
ans.append(S[:sta]+T+S[back+1:])
#print(ans)
print(min(ans))
|
ConDefects/ConDefects/Code/arc148_b/Python/43079503
|
condefects-python_data_2746
|
N = int(input())
S = input()
from itertools import groupby
gb = [[key, len(list(g))] for key, g in groupby(S)]
def swap(s):
res = []
for c in s[::-1]:
if c=='d':
res.append('p')
else:
res.append('d')
return ''.join(res)
ans = [S]
for i,c in enumerate(S):
if c=='p':
for j in range(i+1, N):
ans.append(S[:i]+swap(S[i:j])+S[j:])
break
print(sorted(ans)[0])
N = int(input())
S = input()
from itertools import groupby
gb = [[key, len(list(g))] for key, g in groupby(S)]
def swap(s):
res = []
for c in s[::-1]:
if c=='d':
res.append('p')
else:
res.append('d')
return ''.join(res)
ans = [S]
for i,c in enumerate(S):
if c=='p':
for j in range(i+1, N+1):
ans.append(S[:i]+swap(S[i:j])+S[j:])
break
print(sorted(ans)[0])
|
ConDefects/ConDefects/Code/arc148_b/Python/40105806
|
condefects-python_data_2747
|
import math
import heapq
import itertools
import bisect
import random
import time
from collections import deque
import sys
from cmath import exp,pi
input=sys.stdin.readline
def f(left):
if b*x<z:
return left*x
k=(left//b)*z
left-=(left//b)*b
return k+left*x
t=int(input())
for _ in range(t):
n,a,b,x,y,z=map(int,input().split())
ans=10**30
if a*z<b*y:
a,b,y,z=b,a,z,y
if a*x<y:
print(x*n)
else:
s=(n//a)*y
k=(n//a)*a
for i in range(a+5):
ans=min(ans,s+f(n-k))
s-=y
k-=a
if s<0:
break
print(ans)
import math
import heapq
import itertools
import bisect
import random
import time
from collections import deque
import sys
from cmath import exp,pi
input=sys.stdin.readline
def f(left):
if b*x<z:
return left*x
k=(left//b)*z
left-=(left//b)*b
return k+left*x
t=int(input())
for _ in range(t):
n,a,b,x,y,z=map(int,input().split())
ans=10**30
if a*z<b*y:
a,b,y,z=b,a,z,y
if a*x<y:
print(x*n)
else:
s=(n//a)*y
k=(n//a)*a
for i in range(b):
ans=min(ans,s+f(n-k))
s-=y
k-=a
if s<0:
break
print(ans)
|
ConDefects/ConDefects/Code/arc139_b/Python/39342455
|
condefects-python_data_2748
|
# +-----------+--------------------------------------------------------------+
# | main | |
# +-----------+--------------------------------------------------------------+
def main():
T = int(input())
for _ in range(T):
print(solve(*map(int, input().split())))
return
def solve(n, a, b, x, y, z):
y = min(y, x*a)
z = min(z, x*b)
if z*a < y*b:
(a, y), (b, z) = (b, z), (a, y)
ans = 1<<61
if a**2 < n:
for p in range(n//a + 1):
q, r = divmod(n - a*p, b)
cost = y*p + z*q + x*r
ans = min(ans, cost)
else:
for q in range(a):
p, r = divmod(n - b*q, a)
cost = y*p + z*q + x*r
ans = min(ans, cost)
return ans
# +-----------+--------------------------------------------------------------+
# | library | See Also : https://github.com/nodashin6/atcoder |
# +-----------+--------------------------------------------------------------+
# +-----------+--------------------------------------------------------------+
# | other | |
# +-----------+--------------------------------------------------------------+
import sys
input = lambda: sys.stdin.readline().rstrip()
__print = lambda *args, **kwargs: print(*args, **kwargs) if __debug else None
if __name__ == '__main__':
# for test on local PC
try:
__file = open('./input.txt')
input = lambda: __file.readline().rstrip()
__debug = True
except:
__debug = False
main()
# +-----------+--------------------------------------------------------------+
# | main | |
# +-----------+--------------------------------------------------------------+
def main():
T = int(input())
for _ in range(T):
print(solve(*map(int, input().split())))
return
def solve(n, a, b, x, y, z):
y = min(y, x*a)
z = min(z, x*b)
if z*a < y*b:
(a, y), (b, z) = (b, z), (a, y)
ans = 1<<61
if n < a**2:
for p in range(n//a + 1):
q, r = divmod(n - a*p, b)
cost = y*p + z*q + x*r
ans = min(ans, cost)
else:
for q in range(a):
p, r = divmod(n - b*q, a)
cost = y*p + z*q + x*r
ans = min(ans, cost)
return ans
# +-----------+--------------------------------------------------------------+
# | library | See Also : https://github.com/nodashin6/atcoder |
# +-----------+--------------------------------------------------------------+
# +-----------+--------------------------------------------------------------+
# | other | |
# +-----------+--------------------------------------------------------------+
import sys
input = lambda: sys.stdin.readline().rstrip()
__print = lambda *args, **kwargs: print(*args, **kwargs) if __debug else None
if __name__ == '__main__':
# for test on local PC
try:
__file = open('./input.txt')
input = lambda: __file.readline().rstrip()
__debug = True
except:
__debug = False
main()
|
ConDefects/ConDefects/Code/arc139_b/Python/38643909
|
condefects-python_data_2749
|
import math
def solve(N, A, B, X, Y, Z):
if N <= A * A:
pts = [(y, (N - A * y) // B) for y in range(0, N // A + 1)]
pts += [(y, 0) for y in range(0, N // A + 1)]
elif N <= B * B:
pts = [((N - B * z) // A, z) for z in range(0, N // B + 1)]
pts += [(0, z) for z in range(0, N // B + 1)]
else:
pts = [(y, 0) for y in range(0, min(N // A, B + 1) + 1)]
pts += [(y, (N - A * y) // B) for y in range(0, min(N // A, B + 1) + 1)]
pts = [(y, 0) for y in range(max(0, N // A - B - 1), N // A + 1)]
pts += [(y, (N - A * y) // B) for y in range(max(0, N // A - B - 1), N // A + 1)]
res = math.inf
for y, z in pts:
res = min(res, (N - A * y - B * z) * X + Y * y + Z * z)
print(res)
T = int(input())
for _ in range(T):
N, A, B, X, Y, Z = map(int, input().split())
solve(N, A, B, X, Y, Z)
import math
def solve(N, A, B, X, Y, Z):
if N <= A * A:
pts = [(y, (N - A * y) // B) for y in range(0, N // A + 1)]
pts += [(y, 0) for y in range(0, N // A + 1)]
elif N <= B * B:
pts = [((N - B * z) // A, z) for z in range(0, N // B + 1)]
pts += [(0, z) for z in range(0, N // B + 1)]
else:
pts = [(y, 0) for y in range(0, min(N // A, B + 1) + 1)]
pts += [(y, (N - A * y) // B) for y in range(0, min(N // A, B + 1) + 1)]
pts += [(y, 0) for y in range(max(0, N // A - B - 1), N // A + 1)]
pts += [(y, (N - A * y) // B) for y in range(max(0, N // A - B - 1), N // A + 1)]
res = math.inf
for y, z in pts:
res = min(res, (N - A * y - B * z) * X + Y * y + Z * z)
print(res)
T = int(input())
for _ in range(T):
N, A, B, X, Y, Z = map(int, input().split())
solve(N, A, B, X, Y, Z)
|
ConDefects/ConDefects/Code/arc139_b/Python/44587414
|
condefects-python_data_2750
|
T=int(input())
for i in range(T):
N,A,B,X,Y,Z=map(int, input().split())
Y,Z=min(Y,A*X),min(Z,B*X)
if Y/A>X/B:
Y,Z,A,B=Z,Y,B,A
ans=10**20
if N//A<2*A:
for a in range(N//A+1):
c=Y*a+Z*((N-A*a)//B)+X*((N-A*a)%B)
ans=min(c,ans)
print(ans)
else:
for b in range(A):
c=Z*b+Y*((N-B*b)//A)+X*((N-B*b)%A)
if N-B*b<0:
break
ans=min(c,ans)
print(ans)
T=int(input())
for i in range(T):
N,A,B,X,Y,Z=map(int, input().split())
Y,Z=min(Y,A*X),min(Z,B*X)
if Y/A>Z/B:
Y,Z,A,B=Z,Y,B,A
ans=10**20
if N//A<2*A:
for a in range(N//A+1):
c=Y*a+Z*((N-A*a)//B)+X*((N-A*a)%B)
ans=min(c,ans)
print(ans)
else:
for b in range(A):
c=Z*b+Y*((N-B*b)//A)+X*((N-B*b)%A)
if N-B*b<0:
break
ans=min(c,ans)
print(ans)
|
ConDefects/ConDefects/Code/arc139_b/Python/35647235
|
condefects-python_data_2751
|
import sys
sys.setrecursionlimit(500*500)
# if 'pypyjit' in sys.builtin_module_names:
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
input = sys.stdin.readline
from math import gcd
from functools import reduce
# product('ABCD', repeat=2) => AA AB AC AD BA BB BC BD CA CB CC CD DA DB DC DD
from itertools import product
# permutations('ABCD', 2) => AB AC AD BA BC BD CA CB CD DA DB DC
from itertools import permutations
# combinations('ABCD', 2) => AB AC AD BC BD CD
from itertools import combinations
from itertools import accumulate # 累積和作るやつ
from collections import deque
from collections import defaultdict
from heapq import heappop, heappush
from bisect import bisect_left
# 0埋めされた二進数表現
f'{9:05b}'
alpha2num = lambda c: ord(c) - ord('a')
num2alpha = lambda c: chr(c+97)
popcnt = lambda x: bin(x).count("1")
# 数値判定
"1".isdigit()
dh = [-1, 0, 1, 0]
dw = [0, -1, 0, 1]
dh8 = [-1, -1, -1, 0, 0, 1, 1, 1]
dw8 = [-1, 0, 1, -1, 1, -1, 0, 1]
def resolve():
Q = int(input()[:-1])
que = deque()
for _ in range(Q):
query = [int(x) for x in input()[:-1].split(" ")]
q = query[0]
if q == 1:
_, x, c = query
que.append((x, c))
else:
_, c = query
ans = 0
C = c
while C > 0:
x, c_ = que.popleft()
d = min(C, c_)
ans += d*x
C -= d
c_ -= d
if c_ > 0:
que.append((x, c_))
print(ans)
resolve()
import sys
sys.setrecursionlimit(500*500)
# if 'pypyjit' in sys.builtin_module_names:
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
input = sys.stdin.readline
from math import gcd
from functools import reduce
# product('ABCD', repeat=2) => AA AB AC AD BA BB BC BD CA CB CC CD DA DB DC DD
from itertools import product
# permutations('ABCD', 2) => AB AC AD BA BC BD CA CB CD DA DB DC
from itertools import permutations
# combinations('ABCD', 2) => AB AC AD BC BD CD
from itertools import combinations
from itertools import accumulate # 累積和作るやつ
from collections import deque
from collections import defaultdict
from heapq import heappop, heappush
from bisect import bisect_left
# 0埋めされた二進数表現
f'{9:05b}'
alpha2num = lambda c: ord(c) - ord('a')
num2alpha = lambda c: chr(c+97)
popcnt = lambda x: bin(x).count("1")
# 数値判定
"1".isdigit()
dh = [-1, 0, 1, 0]
dw = [0, -1, 0, 1]
dh8 = [-1, -1, -1, 0, 0, 1, 1, 1]
dw8 = [-1, 0, 1, -1, 1, -1, 0, 1]
def resolve():
Q = int(input()[:-1])
que = deque()
for _ in range(Q):
query = [int(x) for x in input()[:-1].split(" ")]
q = query[0]
if q == 1:
_, x, c = query
que.append((x, c))
else:
_, c = query
ans = 0
C = c
while C > 0:
x, c_ = que.popleft()
d = min(C, c_)
ans += d*x
C -= d
c_ -= d
if c_ > 0:
que.appendleft((x, c_))
print(ans)
resolve()
|
ConDefects/ConDefects/Code/abc247_d/Python/46165455
|
condefects-python_data_2752
|
N, Q = map(int, input().split())
# 答えの候補
last_ans = 0
# 列の先頭
top = 0
# 受付に呼ばれたが、行ってない
ready = [False] * N
for i in range(Q):
t = input()
if t == "1":
ready[top] = True
top += 1
elif t == "3":
for j in range(last_ans, N):
if ready[j] == True:
print(j + 1)
last_ans = j + 1
break
else:
x = int(t[2:])
ready[x - 1] = False
N, Q = map(int, input().split())
# 答えの候補
last_ans = 0
# 列の先頭
top = 0
# 受付に呼ばれたが、行ってない
ready = [False] * N
for i in range(Q):
t = input()
if t == "1":
ready[top] = True
top += 1
elif t == "3":
for j in range(last_ans, N):
if ready[j] == True:
print(j + 1)
last_ans = j
break
else:
x = int(t[2:])
ready[x - 1] = False
|
ConDefects/ConDefects/Code/abc294_d/Python/45910052
|
condefects-python_data_2753
|
S = input()
if 'oxo' in S:
print('No')
elif 'oo' in S:
print('No')
else:
print('Yes')
S = input()
if 'oxo' in S:
print('No')
elif 'oo' in S:
print('No')
elif 'xxx' in S:
print('No')
else:
print('Yes')
|
ConDefects/ConDefects/Code/abc230_b/Python/46192846
|
condefects-python_data_2754
|
s = input()
if (len(s) == 2 and s == 'oo'):
print('No')
exit()
else:
print('Yes')
exit()
if (len(s) == 1):
print('Yes')
exit()
if (s[0] == 'x'):
s = s[1:]
if (s[0] == 'x'):
s = s[1:]
if (s[0] == 'x'):
print('No')
exit()
m = ['o','x','x']
for i in range(len(s)):
if (s[i] != m[i%3]):
print('No')
exit()
print('Yes')
s = input()
if (len(s) == 2 and s == 'oo'):
print('No')
exit()
elif(len(s) == 2):
print('Yes')
exit()
if (len(s) == 1):
print('Yes')
exit()
if (s[0] == 'x'):
s = s[1:]
if (s[0] == 'x'):
s = s[1:]
if (s[0] == 'x'):
print('No')
exit()
m = ['o','x','x']
for i in range(len(s)):
if (s[i] != m[i%3]):
print('No')
exit()
print('Yes')
|
ConDefects/ConDefects/Code/abc230_b/Python/45318112
|
condefects-python_data_2755
|
S=input()
if len(S)<3:
if S in "oxxox":
print("Yes")
else:
print("No")
else:
cnt=0
ans=True
for i in range(len(S)):
if S[i]=="x":
cnt+=1
elif S[i]=="o":
if cnt==2:
cnt=0
elif cnt==i:
cnt=0
else:
ans=False
cnt=0
if ans:
print("Yes")
else:
print("No")
S=input()
if len(S)<3:
if S in "oxxox":
print("Yes")
else:
print("No")
else:
cnt=0
ans=True
for i in range(len(S)):
if S[i]=="x":
cnt+=1
elif S[i]=="o":
if cnt==2:
cnt=0
elif cnt==i:
cnt=0
else:
ans=False
cnt=0
if cnt>2:
ans=False
if ans:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc230_b/Python/46215584
|
condefects-python_data_2756
|
s = input()
now = -1
ans = "Yes"
for i in range(len(s)):
if s[i] == 'o':
if (now == -1 and i >= 3) or (now != -1 and i != now+3):
ans = "No"
now = i
print(ans)
s = input()
now = -1
ans = "Yes"
for i in range(len(s)):
if s[i] == 'o':
if (now == -1 and i >= 3) or (now != -1 and i != now+3):
ans = "No"
now = i
if now < len(s) - 3:
ans = "No"
print(ans)
|
ConDefects/ConDefects/Code/abc230_b/Python/45098077
|
condefects-python_data_2757
|
import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from functools import lru_cache
from itertools import permutations
from math import gcd,log,sqrt
from atcoder.modint import ModContext, Modint
from atcoder.dsu import DSU
ModContext(1).context.append(998244353)
sys.setrecursionlimit(1000000)
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
S = input()
T = 'oxx' * 100
for i in range(len(T)):
for j in range(i + 1, len(T)):
if T[i:j+1] == S:
print('Yes')
exit()
print('No')
import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from functools import lru_cache
from itertools import permutations
from math import gcd,log,sqrt
from atcoder.modint import ModContext, Modint
from atcoder.dsu import DSU
ModContext(1).context.append(998244353)
sys.setrecursionlimit(1000000)
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
S = input()
T = 'oxx' * 100
for i in range(len(T)):
for j in range(i + 1, len(T)):
if T[i:j] == S:
print('Yes')
exit()
print('No')
|
ConDefects/ConDefects/Code/abc230_b/Python/46045748
|
condefects-python_data_2758
|
S = input()
T = "oox" * 10**5
if T.find(S) != -1:
print('Yes')
else:
print('No')
S = input()
T = "oxx" * 10**5
if T.find(S) != -1:
print('Yes')
else:
print('No')
|
ConDefects/ConDefects/Code/abc230_b/Python/44392053
|
condefects-python_data_2759
|
# import系 ---
# 入力用 ---
INT = lambda: int(input())
MI = lambda: map(int, input().split())
MI_DEC = lambda: map(lambda x: int(x) - 1, input().split())
LI = lambda: list(map(int, input().split()))
LS = lambda: input().split()
# コード ---
N, M = MI()
A_list = sorted(LI())
ans_cand = []
cnt = A_list[0]
for i in range(1, N):
if A_list[i] - A_list[i-1] <= 1:
cnt += A_list[i]
else:
ans_cand.append(cnt)
cnt = A_list[i]
if len(ans_cand) == 0:
print(0)
else:
if A_list[N-1] == M-1:
ans_cand[0] += cnt
else:
ans_cand.append(cnt)
print(sum(A_list) - max(ans_cand))
# import系 ---
# 入力用 ---
INT = lambda: int(input())
MI = lambda: map(int, input().split())
MI_DEC = lambda: map(lambda x: int(x) - 1, input().split())
LI = lambda: list(map(int, input().split()))
LS = lambda: input().split()
# コード ---
N, M = MI()
A_list = sorted(LI())
ans_cand = []
cnt = A_list[0]
for i in range(1, N):
if A_list[i] - A_list[i-1] <= 1:
cnt += A_list[i]
else:
ans_cand.append(cnt)
cnt = A_list[i]
if len(ans_cand) == 0:
print(0)
else:
if A_list[0] == 0 and A_list[N-1] == M-1:
ans_cand[0] += cnt
else:
ans_cand.append(cnt)
print(sum(A_list) - max(ans_cand))
|
ConDefects/ConDefects/Code/abc277_d/Python/45302782
|
condefects-python_data_2760
|
n, m = map(int,input().split())
A = list(map(int,input().split()))
sm = sum(A)
A.sort()
A = A + A
i = 0
ans = 1 << 61
while i < len(A) - 1:
now = A[i]
while A[i+1] == A[i] or A[i+1] == A[i] + 1:
i += 1
if i >= len(A) - 1:
break
now += A[i]
ans = min(ans, sm - now)
i += 1
if ans < 0:
ans = 0
print(ans)
n, m = map(int,input().split())
A = list(map(int,input().split()))
sm = sum(A)
A.sort()
A = A + A
i = 0
ans = 1 << 61
while i < len(A) - 1:
now = A[i]
while A[i+1] == A[i] or A[i+1] == (A[i] + 1)%m:
i += 1
if i >= len(A) - 1:
break
now += A[i]
ans = min(ans, sm - now)
i += 1
if ans < 0:
ans = 0
print(ans)
|
ConDefects/ConDefects/Code/abc277_d/Python/45976330
|
condefects-python_data_2761
|
# coding: utf-8
from functools import partial
try:
dummy = src
rl = partial(src.pop, 0)
except NameError:
rl = input
def ints():
return list(map(int, rl().strip().split()))
def int1():
return int(rl().strip())
#@psecs
def main():
n, m = ints()
aa = sorted(ints())
# print(locals())
ss = []
s = 0
for i in range(len(aa)):
a = aa[i]
if i > 0 and a > aa[i-1] + 1:
ss.append(s)
s = a
else:
s += a
ss.append(s)
if (aa[-1] + 1) % m == aa[0]:
ss.append(ss[0] + ss[-1])
total = sum(aa)
print(total - max(ss))
if __name__ == '__main__':
main()
# coding: utf-8
from functools import partial
try:
dummy = src
rl = partial(src.pop, 0)
except NameError:
rl = input
def ints():
return list(map(int, rl().strip().split()))
def int1():
return int(rl().strip())
#@psecs
def main():
n, m = ints()
aa = sorted(ints())
# print(locals())
ss = []
s = 0
for i in range(len(aa)):
a = aa[i]
if i > 0 and a > aa[i-1] + 1:
ss.append(s)
s = a
else:
s += a
ss.append(s)
if len(ss) > 1 and (aa[-1] + 1) % m == aa[0]:
ss.append(ss[0] + ss[-1])
total = sum(aa)
print(total - max(ss))
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/abc277_d/Python/45573210
|
condefects-python_data_2762
|
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
sum_a = sum(A)
ans = sum_a
cnt = A[0]
flag = False
zero = 0
if A[0] == 0:
flag = True
for i in range(N-1):
if A[i] == A[i+1] or A[i] + 1 == A[i+1]:
cnt += A[i+1]
if flag:
zero = cnt
else:
cnt = A[i+1]
flag = False
ans = min(ans, sum_a - cnt)
ans = min(ans, sum_a - cnt)
if A[-1] == M - 1:
ans = min(ans, sum_a - cnt - zero)
print(ans)
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
sum_a = sum(A)
ans = sum_a
cnt = A[0]
flag = False
zero = 0
if A[0] == 0:
flag = True
for i in range(N-1):
if A[i] == A[i+1] or A[i] + 1 == A[i+1]:
cnt += A[i+1]
if flag:
zero = cnt
else:
cnt = A[i+1]
flag = False
ans = min(ans, sum_a - cnt)
ans = min(ans, sum_a - cnt)
if A[-1] == M - 1:
ans = min(ans, sum_a - cnt - zero)
print(max(ans, 0))
|
ConDefects/ConDefects/Code/abc277_d/Python/46193940
|
condefects-python_data_2763
|
n, a, b = map(int, input().split())
if a <= b:
print(n)
else:
if n < a:
print(0)
else:
print((n // a - 1) * b + min(b - 1, n % a) + 1)
n, a, b = map(int, input().split())
if a <= b:
print(max(n - a + 1, 0))
else:
if n < a:
print(0)
else:
print((n // a - 1) * b + min(b - 1, n % a) + 1)
|
ConDefects/ConDefects/Code/arc145_b/Python/41925394
|
condefects-python_data_2764
|
n, a, b = map(int, input().split())
def f(N):
cnt = N // a * min(a, b) + min(N % a, b - 1)
return cnt
print(f(n) - f(a - 1))
n, a, b = map(int, input().split())
def f(N):
cnt = N // a * min(a, b) + min(N % a, b - 1)
return cnt
print(max(0, f(n) - f(a - 1)))
|
ConDefects/ConDefects/Code/arc145_b/Python/44404835
|
condefects-python_data_2765
|
n,a,b = map(int,input().split())
ans = 0
if a <= b:
ans = n - a + 1
else:
ans += b * max(0, n // a - 1)
if n // a > 0:
ans += min(b, n % a + 1)
print(ans)
n,a,b = map(int,input().split())
ans = 0
if a <= b:
ans = max(0, n - a + 1)
else:
ans += b * max(0, n // a - 1)
if n // a > 0:
ans += min(b, n % a + 1)
print(ans)
|
ConDefects/ConDefects/Code/arc145_b/Python/44999492
|
condefects-python_data_2766
|
import sys, re
#------pypyで再帰などを提出する場合は下記２行を使用-----
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#import numpy as np
from math import ceil, floor, sqrt, pi, factorial, gcd,isfinite
from copy import deepcopy
from collections import Counter, deque,defaultdict
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement,permutations
from bisect import bisect, bisect_left, bisect_right,insort_right,insort_left
from functools import reduce,lru_cache
#メモ化の場合は下記を使用
#@lru_cache(maxsize=1000)
from decimal import Decimal, getcontext
# input = sys.stdin.readline
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_none_map(): return map(int,input())
def i_list(): return list(i_map())
def i_list_for(N): return [i_list() for _ in range(N)]
def i_none_list(): return list(i_none_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
N,A,B=i_map()
if(A<=B): print(max(0,N-(A-1)))
else:
a = (A-1)
q,mod = divmod(N+1,A)
q-=1
b = q * B
if(mod > B):print(b + B)
else:print(b+mod)
import sys, re
#------pypyで再帰などを提出する場合は下記２行を使用-----
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#import numpy as np
from math import ceil, floor, sqrt, pi, factorial, gcd,isfinite
from copy import deepcopy
from collections import Counter, deque,defaultdict
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement,permutations
from bisect import bisect, bisect_left, bisect_right,insort_right,insort_left
from functools import reduce,lru_cache
#メモ化の場合は下記を使用
#@lru_cache(maxsize=1000)
from decimal import Decimal, getcontext
# input = sys.stdin.readline
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_none_map(): return map(int,input())
def i_list(): return list(i_map())
def i_list_for(N): return [i_list() for _ in range(N)]
def i_none_list(): return list(i_none_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
N,A,B=i_map()
if(A<=B): print(max(0,N-(A-1)))
else:
a = (A-1)
q,mod = divmod(N+1,A)
q-=1
b = q * B
if(mod > B):print(b + B)
else:print(max(0,b+mod))
|
ConDefects/ConDefects/Code/arc145_b/Python/41639432
|
condefects-python_data_2767
|
n, a, b = map(int, input().split())
def f(x):
return x // a * min(a, b) + min(n % a, b - 1)
print(max(f(n) - f(a - 1), 0))
n, a, b = map(int, input().split())
def f(x):
return x // a * min(a, b) + min(x % a, b - 1)
print(max(f(n) - f(a - 1), 0))
|
ConDefects/ConDefects/Code/arc145_b/Python/44115404
|
condefects-python_data_2768
|
from sys import setrecursionlimit, stdin
setrecursionlimit(10**6); readline = stdin.readline
M998 = 998244353; M007 = 10**9+7; INF = 10**18
mulint = lambda: map(int, readline().split()); anint = lambda: int(readline())
astr = lambda: readline().rstrip()
N, A, B = mulint()
def f(X):
p, q = divmod(X,A)
return p*min(A, B) + min(q, B-1)
print(f(N)-f(A-1))
from sys import setrecursionlimit, stdin
setrecursionlimit(10**6); readline = stdin.readline
M998 = 998244353; M007 = 10**9+7; INF = 10**18
mulint = lambda: map(int, readline().split()); anint = lambda: int(readline())
astr = lambda: readline().rstrip()
N, A, B = mulint()
def f(X):
p, q = divmod(X,A)
return p*min(A, B) + min(q, B-1)
print(max(f(N)-f(A-1), 0))
|
ConDefects/ConDefects/Code/arc145_b/Python/43068920
|
condefects-python_data_2769
|
N,A,B=map(int,input().split())
if A<=B:
print(max(N-A+1,0))
exit()
answer=B*(N//A-1)
answer+=min(N%A+1,B)
print(answer)
N,A,B=map(int,input().split())
if A<=B:
print(max(N-A+1,0))
exit()
answer=B*(N//A-1)
answer+=min(N%A+1,B)
print(max(answer,0))
|
ConDefects/ConDefects/Code/arc145_b/Python/41219575
|
condefects-python_data_2770
|
import sys
def input():
input = sys.stdin.read
data = input().split()
N = int(data[0])
M = int(data[1])
A = list(map(int, data[2:M+2]))
X = []
index = M + 2
for i in range(N):
row = list(map(int, data[index:index + M]))
X.append(row)
index += M
return N, M, A, X
def main():
N, M, A ,X = input()
ans = "Yes"
for i in range(M):
total = 0
for j in range (N):
total += X[j][i]
if total < A[i]:
ans = False
print(ans)
return
print(ans)
return
if __name__ == "__main__":
main()
import sys
def input():
input = sys.stdin.read
data = input().split()
N = int(data[0])
M = int(data[1])
A = list(map(int, data[2:M+2]))
X = []
index = M + 2
for i in range(N):
row = list(map(int, data[index:index + M]))
X.append(row)
index += M
return N, M, A, X
def main():
N, M, A ,X = input()
ans = "Yes"
for i in range(M):
total = 0
for j in range (N):
total += X[j][i]
if total < A[i]:
ans = "No"
print(ans)
return
print(ans)
return
if __name__ == "__main__":
main()
|
ConDefects/ConDefects/Code/abc356_b/Python/54957150
|
condefects-python_data_2771
|
'''
Hala Madrid!
https://www.zhihu.com/people/li-dong-hao-78-74
'''
import sys
import os
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
def I():
return input()
def II():
return int(input())
def MI():
return map(int, input().split())
def LI():
return list(input().split())
def LII():
return list(map(int, input().split()))
def GMI():
return map(lambda x: int(x) - 1, input().split())
#------------------------------FastIO---------------------------------
from bisect import *
from heapq import *
from collections import *
from functools import *
from itertools import *
from time import *
from random import *
from math import log, gcd, sqrt, ceil
# from types import GeneratorType
# def bootstrap(f, stack=[]):
# def wrappedfunc(*args, **kwargs):
# if stack:
# return f(*args, **kwargs)
# else:
# to = f(*args, **kwargs)
# while True:
# if type(to) is GeneratorType:
# stack.append(to)
# to = next(to)
# else:
# stack.pop()
# if not stack:
# break
# to = stack[-1].send(to)
# return to
# return wrappedfunc
# seed(19981220)
# RANDOM = getrandbits(64)
# class Wrapper(int):
# def __init__(self, x):
# int.__init__(x)
# def __hash__(self):
# return super(Wrapper, self).__hash__() ^ RANDOM
# def TIME(f):
# def wrap(*args, **kwargs):
# s = perf_counter()
# ret = f(*args, **kwargs)
# e = perf_counter()
# print(e - s, 'sec')
# return ret
# return wrap
inf = float('inf')
# @TIME
def solve(testcase):
n, m = MI()
A = LII()
for _ in range(m):
nums = LII()
for i, v in enumerate(nums):
A[i] -= v
for a in A:
if a > 0:
print('No')
return
print('Yes')
for testcase in range(1):
solve(testcase)
'''
Hala Madrid!
https://www.zhihu.com/people/li-dong-hao-78-74
'''
import sys
import os
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
def I():
return input()
def II():
return int(input())
def MI():
return map(int, input().split())
def LI():
return list(input().split())
def LII():
return list(map(int, input().split()))
def GMI():
return map(lambda x: int(x) - 1, input().split())
#------------------------------FastIO---------------------------------
from bisect import *
from heapq import *
from collections import *
from functools import *
from itertools import *
from time import *
from random import *
from math import log, gcd, sqrt, ceil
# from types import GeneratorType
# def bootstrap(f, stack=[]):
# def wrappedfunc(*args, **kwargs):
# if stack:
# return f(*args, **kwargs)
# else:
# to = f(*args, **kwargs)
# while True:
# if type(to) is GeneratorType:
# stack.append(to)
# to = next(to)
# else:
# stack.pop()
# if not stack:
# break
# to = stack[-1].send(to)
# return to
# return wrappedfunc
# seed(19981220)
# RANDOM = getrandbits(64)
# class Wrapper(int):
# def __init__(self, x):
# int.__init__(x)
# def __hash__(self):
# return super(Wrapper, self).__hash__() ^ RANDOM
# def TIME(f):
# def wrap(*args, **kwargs):
# s = perf_counter()
# ret = f(*args, **kwargs)
# e = perf_counter()
# print(e - s, 'sec')
# return ret
# return wrap
inf = float('inf')
# @TIME
def solve(testcase):
n, m = MI()
A = LII()
for _ in range(n):
nums = LII()
for i, v in enumerate(nums):
A[i] -= v
for a in A:
if a > 0:
print('No')
return
print('Yes')
for testcase in range(1):
solve(testcase)
|
ConDefects/ConDefects/Code/abc356_b/Python/54965405
|
condefects-python_data_2772
|
N,M = map(int,input().split())
A = list(map(int,input().split()))
X =[]
for i in range(N):
X.append(list(map(int,input().split())))
Y = []
for i in range(M):
Y.append(0)
for i in range(M):
for j in range(N):
Y[i] += X[j][i]
Flag =True
for i in range(M):
if Flag == False:
break
if Y[i] < A[i]:
print('NO')
Flag = False
break
if Flag == True:
print('Yes')
N,M = map(int,input().split())
A = list(map(int,input().split()))
X =[]
for i in range(N):
X.append(list(map(int,input().split())))
Y = []
for i in range(M):
Y.append(0)
for i in range(M):
for j in range(N):
Y[i] += X[j][i]
Flag =True
for i in range(M):
if Flag == False:
break
if Y[i] < A[i]:
print('No')
Flag = False
break
if Flag == True:
print('Yes')
|
ConDefects/ConDefects/Code/abc356_b/Python/55010067
|
condefects-python_data_2773
|
N,M=map(int, input().split())
A = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(N)]
for m in range(M):
a=0
for n in range(N):
a+=X[n][m]
if a<=A[m]:
print ("No")
exit(0)
print ('Yes')
N,M=map(int, input().split())
A = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(N)]
for m in range(M):
a=0
for n in range(N):
a+=X[n][m]
if a<A[m]:
print ("No")
exit(0)
print ('Yes')
|
ConDefects/ConDefects/Code/abc356_b/Python/55103344
|
condefects-python_data_2774
|
N, M=map(int, input().split())
goal=input().split()
nutrition=[]
check=[]
for i in range(N):
nutrition.append(input().split())
def sum_nut(N,nut_num,goal,check):
sum_n=[]
for i in range(N):
sum_n.append(int(nutrition[i][nut_num]))
if int(goal[nut_num])<sum(sum_n):
check.append(1)
else:
check.append(0)
for i in range(M):
sum_nut(N,i,goal,check)
if sum(check)==M:
print("Yes")
else:
print("No")
N, M=map(int, input().split())
goal=input().split()
nutrition=[]
check=[]
for i in range(N):
nutrition.append(input().split())
def sum_nut(N,nut_num,goal,check):
sum_n=[]
for i in range(N):
sum_n.append(int(nutrition[i][nut_num]))
if int(goal[nut_num])<=sum(sum_n):
check.append(1)
else:
check.append(0)
for i in range(M):
sum_nut(N,i,goal,check)
if sum(check)==M:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc356_b/Python/54954884
|
condefects-python_data_2775
|
import pandas as pd
n, m = map(int, input().split())
aim_am_lis = list(map(int, input().split()))
am_lis = []
for i in range(n):
am_lis.append(list(map(int, input().split())))
df = pd.DataFrame(data=am_lis).sum()
cnt=0
for i in range(m):
if df[i] > aim_am_lis[i]:
cnt+=1
if cnt==m:
print("Yes")
else:
print("No")
import pandas as pd
n, m = map(int, input().split())
aim_am_lis = list(map(int, input().split()))
am_lis = []
for i in range(n):
am_lis.append(list(map(int, input().split())))
df = pd.DataFrame(data=am_lis).sum()
cnt=0
for i in range(m):
if df[i] >= aim_am_lis[i]:
cnt+=1
if cnt==m:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc356_b/Python/55030637
|
condefects-python_data_2776
|
mod = 998244353
#nCk
def com(n,mod):
fact = [1,1]
factinv = [1,1]
inv = [0,1]
for i in range(2,n+1):
fact.append((fact[-1]*i)%mod)
inv.append((-inv[mod%i]*(mod//i))%mod)
factinv.append((factinv[-1]*inv[-1])%mod)
return fact, factinv
f,fi = com(10000, mod)
def ncr(n,r):
return f[n] * fi[n-r] % mod * fi[r] % mod
n,m,k = map(int,input().split())
w = [int(input()) for i in range(n)]
dp = [[[0]*(k+1) for i in range(m+1)] for i in range(n+1)]
dp[0][0][0] = 1
for i in range(1, n+1):
wi = w[i-1]
for j in range(m+1):
for kk in range(k+1):
dp[i][j][kk] += dp[i-1][j][kk]
for l in range(1,k+1):
if kk >= l:
dp[i][j][kk] += dp[i-1][j-1][kk-l] * pow(wi, l, mod) * fi[l]
dp[i][j][kk] %= mod
b = pow(sum(w), mod-2, mod)
print(pow(b, k ,mod)*dp[-1][-1][-1]*f[k]%mod)
mod = 998244353
#nCk
def com(n,mod):
fact = [1,1]
factinv = [1,1]
inv = [0,1]
for i in range(2,n+1):
fact.append((fact[-1]*i)%mod)
inv.append((-inv[mod%i]*(mod//i))%mod)
factinv.append((factinv[-1]*inv[-1])%mod)
return fact, factinv
f,fi = com(10000, mod)
def ncr(n,r):
return f[n] * fi[n-r] % mod * fi[r] % mod
n,m,k = map(int,input().split())
w = [int(input()) for i in range(n)]
dp = [[[0]*(k+1) for i in range(m+1)] for i in range(n+1)]
dp[0][0][0] = 1
for i in range(1, n+1):
wi = w[i-1]
for j in range(m+1):
for kk in range(k+1):
dp[i][j][kk] += dp[i-1][j][kk]
for l in range(1,k+1):
if kk >= l and j >= 1:
dp[i][j][kk] += dp[i-1][j-1][kk-l] * pow(wi, l, mod) * fi[l]
dp[i][j][kk] %= mod
b = pow(sum(w), mod-2, mod)
print(pow(b, k ,mod)*dp[-1][-1][-1]*f[k]%mod)
|
ConDefects/ConDefects/Code/abc243_f/Python/40101065
|
condefects-python_data_2777
|
n,x = map(int,input().split())
a = list(map(int,input().split()))
c = [[] for _ in range(n)]
m = max(a)
for i in range(n):
p = 1
while True:
l,r = p*a[i],p*a[i]+(p-1)*x
if l<=m<=r:
c[i] = [0,0]
break
elif r<m:
p *= 2
else:
y,z = p//2*a[i]+(p//2-1)*x,p*a[i]
c[i] = [y-m,z-m]
break
c.sort()
d = 0
b = 10**15
for i in range(n):
b = min(b,d-c[i][0])
d = max(d,c[i][1])
if b<=x:
print(0)
else:
print(b)
n,x = map(int,input().split())
a = list(map(int,input().split()))
c = [[] for _ in range(n)]
m = max(a)
for i in range(n):
p = 1
while True:
l,r = p*a[i],p*a[i]+(p-1)*x
if l<=m<=r:
c[i] = [0,0]
break
elif r<m:
p *= 2
else:
y,z = p//2*a[i]+(p//2-1)*x,p*a[i]
c[i] = [y-m,z-m]
break
c.sort()
d = 0
b = 10**15
for i in range(n):
b = min(b,d-c[i][0])
d = max(d,c[i][1])
if b<x:
print(0)
else:
print(b)
|
ConDefects/ConDefects/Code/agc057_b/Python/31505448
|
condefects-python_data_2778
|
N,X=map(int,input().split())
A=list(map(int,input().split()))
L=[]
u=max(A)
x=u
y=x
for i in range(N):
l=A[i]
r=A[i]
if l==u:
L.append([l,r])
continue
while True:
l2=2*l
r2=2*r+X
if l2<=u<=r:
L.append([u,u])
break
if l2>=u:
L.append([r,l2])
break
l=l2
r=r2
y=u
L.sort()
result=10**10
for i in range(N):
l,r=L[i][0],L[i][1]
result=min(result,y-l)
y=max(y,r)
if result<X:
print(0)
exit()
print(result)
N,X=map(int,input().split())
A=list(map(int,input().split()))
L=[]
u=max(A)
x=u
y=x
for i in range(N):
l=A[i]
r=A[i]
if l==u:
L.append([l,r])
continue
while True:
l2=2*l
r2=2*r+X
if l2<=u<=r2:
L.append([u,u])
break
if l2>=u:
L.append([r,l2])
break
l=l2
r=r2
y=u
L.sort()
result=10**10
for i in range(N):
l,r=L[i][0],L[i][1]
result=min(result,y-l)
y=max(y,r)
if result<X:
print(0)
exit()
print(result)
|
ConDefects/ConDefects/Code/agc057_b/Python/41271287
|
condefects-python_data_2779
|
from sre_constants import IN_IGNORE
import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
INF = 2 ** 63 - 1
mod = 998244353
class segtree():
n=1
size=1
log=2
d=[0]
op=None
e=10**15
def __init__(self,V,OP,E):
self.n=len(V)
self.op=OP
self.e=E
self.log=(self.n-1).bit_length()
self.size=1<<self.log
self.d=[E for i in range(2*self.size)]
for i in range(self.n):
self.d[self.size+i]=V[i]
for i in range(self.size-1,0,-1):
self.update(i)
def set(self,p,x):
assert 0<=p and p<self.n
p+=self.size
self.d[p]=x
for i in range(1,self.log+1):
self.update(p>>i)
def get(self,p):
assert 0<=p and p<self.n
return self.d[p+self.size]
def __setitem__(self, p, x):
self.set(p, x)
def __getitem__(self, p):
return self.get(p)
def prod(self,l,r):
assert 0<=l and l<=r and r<=self.n
sml=self.e
smr=self.e
l+=self.size
r+=self.size
while(l<r):
if (l&1):
sml=self.op(sml,self.d[l])
l+=1
if (r&1):
smr=self.op(self.d[r-1],smr)
r-=1
l>>=1
r>>=1
return self.op(sml,smr)
def all_prod(self):
return self.d[1]
def max_right(self,l,f):
assert 0<=l and l<=self.n
assert f(self.e)
if l==self.n:
return self.n
l+=self.size
sm=self.e
while(1):
while(l%2==0):
l>>=1
if not(f(self.op(sm,self.d[l]))):
while(l<self.size):
l=2*l
if f(self.op(sm,self.d[l])):
sm=self.op(sm,self.d[l])
l+=1
return l-self.size
sm=self.op(sm,self.d[l])
l+=1
if (l&-l)==l:
break
return self.n
def min_left(self,r,f):
assert 0<=r and r<self.n
assert f(self.e)
if r==0:
return 0
r+=self.size
sm=self.e
while(1):
r-=1
while(r>1 & (r%2)):
r>>=1
if not(f(self.op(self.d[r],sm))):
while(r<self.size):
r=(2*r+1)
if f(self.op(self.d[r],sm)):
sm=self.op(self.d[r],sm)
r-=1
return r+1-self.size
sm=self.op(self.d[r],sm)
if (r& -r)==r:
break
return 0
def update(self,k):
self.d[k]=self.op(self.d[2*k],self.d[2*k+1])
def __str__(self):
return str([self.get(i) for i in range(self.n)])
n, x = mi()
a = li()
a.sort(reverse=True)
LR = []
def le(now, to, x):
ret = now
for i in range(60):
if now * (2 ** i) <= to:
ret = max(ret, min(to, now * (2 ** i) + x * (2 ** i - 1)))
return ret
def ge(now, to, x):
ret = INF
for i in range(60):
if now * (2 ** i) + x * (2 ** i - 1) >= to:
ret = min(ret, max(now * (2 ** i), to))
return ret
for i in range(1, n):
LR.append((le(a[i], a[0], x), ge(a[i], a[0], x)))
LR.insert(0, (a[0], a[0]))
LR.sort()
l = [LR[i][1] for i in range(n)]
s = [LR[i][0] for i in range(n)]
y = min(max(l) - min(l), max(s) - min(s))
rmax = 0
for i in range(n - 1):
rmax = max(LR[i][1], rmax)
y = min(y, rmax - LR[i + 1][0])
if x < y:
print(y)
else:
print(0)
from sre_constants import IN_IGNORE
import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
INF = 2 ** 63 - 1
mod = 998244353
class segtree():
n=1
size=1
log=2
d=[0]
op=None
e=10**15
def __init__(self,V,OP,E):
self.n=len(V)
self.op=OP
self.e=E
self.log=(self.n-1).bit_length()
self.size=1<<self.log
self.d=[E for i in range(2*self.size)]
for i in range(self.n):
self.d[self.size+i]=V[i]
for i in range(self.size-1,0,-1):
self.update(i)
def set(self,p,x):
assert 0<=p and p<self.n
p+=self.size
self.d[p]=x
for i in range(1,self.log+1):
self.update(p>>i)
def get(self,p):
assert 0<=p and p<self.n
return self.d[p+self.size]
def __setitem__(self, p, x):
self.set(p, x)
def __getitem__(self, p):
return self.get(p)
def prod(self,l,r):
assert 0<=l and l<=r and r<=self.n
sml=self.e
smr=self.e
l+=self.size
r+=self.size
while(l<r):
if (l&1):
sml=self.op(sml,self.d[l])
l+=1
if (r&1):
smr=self.op(self.d[r-1],smr)
r-=1
l>>=1
r>>=1
return self.op(sml,smr)
def all_prod(self):
return self.d[1]
def max_right(self,l,f):
assert 0<=l and l<=self.n
assert f(self.e)
if l==self.n:
return self.n
l+=self.size
sm=self.e
while(1):
while(l%2==0):
l>>=1
if not(f(self.op(sm,self.d[l]))):
while(l<self.size):
l=2*l
if f(self.op(sm,self.d[l])):
sm=self.op(sm,self.d[l])
l+=1
return l-self.size
sm=self.op(sm,self.d[l])
l+=1
if (l&-l)==l:
break
return self.n
def min_left(self,r,f):
assert 0<=r and r<self.n
assert f(self.e)
if r==0:
return 0
r+=self.size
sm=self.e
while(1):
r-=1
while(r>1 & (r%2)):
r>>=1
if not(f(self.op(self.d[r],sm))):
while(r<self.size):
r=(2*r+1)
if f(self.op(self.d[r],sm)):
sm=self.op(self.d[r],sm)
r-=1
return r+1-self.size
sm=self.op(self.d[r],sm)
if (r& -r)==r:
break
return 0
def update(self,k):
self.d[k]=self.op(self.d[2*k],self.d[2*k+1])
def __str__(self):
return str([self.get(i) for i in range(self.n)])
n, x = mi()
a = li()
a.sort(reverse=True)
LR = []
def le(now, to, x):
ret = now
for i in range(60):
if now * (2 ** i) <= to:
ret = max(ret, min(to, now * (2 ** i) + x * (2 ** i - 1)))
return ret
def ge(now, to, x):
ret = INF
for i in range(60):
if now * (2 ** i) + x * (2 ** i - 1) >= to:
ret = min(ret, max(now * (2 ** i), to))
return ret
for i in range(1, n):
LR.append((le(a[i], a[0], x), ge(a[i], a[0], x)))
LR.insert(0, (a[0], a[0]))
LR.sort()
l = [LR[i][1] for i in range(n)]
s = [LR[i][0] for i in range(n)]
y = min(max(l) - min(l), max(s) - min(s))
rmax = 0
for i in range(n - 1):
rmax = max(LR[i][1], rmax)
y = min(y, rmax - LR[i + 1][0])
if x <= y:
print(y)
else:
print(0)
|
ConDefects/ConDefects/Code/agc057_b/Python/31499069
|
condefects-python_data_2780
|
import math
A,B = map(int,input().split())
if A > B:
A,B = B,A
def isOK(key):
if math.cos(key)*A/math.cos(math.pi/6-key) <= B:
return True
else:
return False
def search():
l,r = 0,math.pi/12
while r-l < 10**(-9):
mid = (r+l)/2
if isOK(mid):
r = mid
else:
l = mid
return A/math.cos(math.pi/6-r)
print(search())
import math
A,B = map(int,input().split())
if A > B:
A,B = B,A
def isOK(key):
if math.cos(key)*A/math.cos(math.pi/6-key) <= B:
return True
else:
return False
def search():
l,r = 0,math.pi/12
while r-l > 10**(-15):
mid = (r+l)/2
if isOK(mid):
r = mid
else:
l = mid
return A/math.cos(math.pi/6-r)
print(search())
|
ConDefects/ConDefects/Code/abc292_f/Python/45523633
|
condefects-python_data_2781
|
N,M,K=map(int,input().split())
mod=998244353
dp=[[0 for _ in range(M)] for _ in range(N)]
def one_d_prefix_sums(array):
N=len(array)
prefix_sums=[0 for _ in range(N)]
for i,number in enumerate(array):
if i==0:
prefix_sums[i]=number
else:
prefix_sums[i]=number+prefix_sums[i-1]
return prefix_sums
for j in range(M):
dp[0][j]=1
for i in range(N):
if i==0:
continue
prefix_sums=[0]+one_d_prefix_sums(dp[i-1])
for j in range(M):
dp[i][j]=(prefix_sums[M]-(prefix_sums[min(M,j+K)]-prefix_sums[max(0,j-K+1)]))%mod
print((sum(dp[-1]))%mod)
N,M,K=map(int,input().split())
mod=998244353
dp=[[0 for _ in range(M)] for _ in range(N)]
def one_d_prefix_sums(array):
N=len(array)
prefix_sums=[0 for _ in range(N)]
for i,number in enumerate(array):
if i==0:
prefix_sums[i]=number
else:
prefix_sums[i]=number+prefix_sums[i-1]
return prefix_sums
for j in range(M):
dp[0][j]=1
for i in range(N):
if i==0:
continue
prefix_sums=[0]+one_d_prefix_sums(dp[i-1])
for j in range(M):
dp[i][j]=(prefix_sums[M]-max(0,(prefix_sums[min(M,j+K)]-prefix_sums[max(0,j-K+1)])))%mod
print((sum(dp[-1]))%mod)
|
ConDefects/ConDefects/Code/abc253_e/Python/45559213
|
condefects-python_data_2782
|
N, M, K = map(int, input().split())
mod = 998244353
dp = [[0]*M for _ in range(N)]
for i in range(M):
dp[0][i] = 1
for i in range(N-1):
s = [0]
for j in range(M):
s.append(s[-1]+dp[i][j])
for j in range(M):
dp[i+1][j] += s[max(j-K+1, 0)] - s[0]
dp[i+1][j] += s[M] - s[min(j+K, M)]
dp[i+1][j] %= mod
print(sum(dp[N-1])%mod)
N, M, K = map(int, input().split())
mod = 998244353
dp = [[0]*M for _ in range(N)]
for i in range(M):
dp[0][i] = 1
for i in range(N-1):
s = [0]
for j in range(M):
s.append(s[-1]+dp[i][j])
for j in range(M):
dp[i+1][j] += s[max(j-K+1, 0)] - s[0]
dp[i+1][j] += s[M] - s[min(j+K, M)]
if K == 0:
dp[i+1][j] -= dp[i][j]
dp[i+1][j] %= mod
print(sum(dp[N-1])%mod)
|
ConDefects/ConDefects/Code/abc253_e/Python/45470734
|
condefects-python_data_2783
|
from itertools import accumulate
mod = 998244353
N, M, K = map(int, input().split())
dp = [[0]*(M+1) for _ in range(N)]
for a in range(1, M+1):
dp[0][a] = 1
for i in range(1, N):
ac0 = list(accumulate(dp[i-1]))
ac1 = list(accumulate(reversed(dp[i-1])))
ac1.reverse()
for a in range(1, M-K+1):
dp[i][a+K] = ac0[a] % mod
for a in range(K+1, M+1):
dp[i][a-K] = (dp[i][a-K] + ac1[a]) % mod
print(sum(dp[N-1]) % mod)
from itertools import accumulate
mod = 998244353
N, M, K = map(int, input().split())
dp = [[0]*(M+1) for _ in range(N)]
for a in range(1, M+1):
dp[0][a] = 1
for i in range(1, N):
ac0 = list(accumulate(dp[i-1]))
ac1 = list(accumulate(reversed(dp[i-1])))
ac1.reverse()
for a in range(1, M-K+1):
dp[i][a+K] = ac0[a] % mod
for a in range(K+1 if K != 0 else K+2, M+1):
dp[i][a-K] = (dp[i][a-K] + ac1[a]) % mod
print(sum(dp[N-1]) % mod)
|
ConDefects/ConDefects/Code/abc253_e/Python/45941559
|
condefects-python_data_2784
|
def ip():return int(input())
def mp():return map(int, input().split())
def lmp():return list(map(int, input().split()))
# ABC253 1073 E - Distance Sequence PyPyで提出
# 長さ N の整数からなる数列 A = (A1,…,AN) であって、以下の条件を全て満たすものは何通りありますか？
# ・1 ≤ Ai ≤ M (1 ≤ i ≤ N)
# ・|Ai - A_{i+1}| ≥ K (1 ≤ i ≤ N-1)
# ただし、答えは非常に大きくなることがあるので、答えを 998244353 で割った余りを求めてください。
# ・2 ≤ N ≤ 1000
# ・1 ≤ M ≤ 5000
N, M, K = mp()
MOD = 998244353
dp = [1] * (M+1)
dp[0] = 0
# dp[i]: 最後がiとなる数列の場合の数
for _ in range(N-1):
# print(f'dp = {dp}')
cum = [0] * (M+1)
for j in range(M):
cum[j+1] = cum[j] + dp[j+1]
# print(f'cu = {cum}')
ndp = [0] * (M+1)
for j in range(1, M+1):
if j+K <= M:
ndp[j] += cum[M] - cum[j+K-1]
if j-K >= 1:
ndp[j] += cum[j-K]
ndp[j] %= MOD
dp = ndp
# print(f'dp = {dp}')
print(sum(dp) % MOD)
def ip():return int(input())
def mp():return map(int, input().split())
def lmp():return list(map(int, input().split()))
# ABC253 1073 E - Distance Sequence PyPyで提出
# 長さ N の整数からなる数列 A = (A1,…,AN) であって、以下の条件を全て満たすものは何通りありますか？
# ・1 ≤ Ai ≤ M (1 ≤ i ≤ N)
# ・|Ai - A_{i+1}| ≥ K (1 ≤ i ≤ N-1)
# ただし、答えは非常に大きくなることがあるので、答えを 998244353 で割った余りを求めてください。
# ・2 ≤ N ≤ 1000
# ・1 ≤ M ≤ 5000
N, M, K = mp()
MOD = 998244353
if K == 0:
exit(print(pow(M, N, MOD)))
dp = [1] * (M+1)
dp[0] = 0
# dp[i]: 最後がiとなる数列の場合の数
for _ in range(N-1):
# print(f'dp = {dp}')
cum = [0] * (M+1)
for j in range(M):
cum[j+1] = cum[j] + dp[j+1]
# print(f'cu = {cum}')
ndp = [0] * (M+1)
for j in range(1, M+1):
if j+K <= M:
ndp[j] += cum[M] - cum[j+K-1]
if j-K >= 1:
ndp[j] += cum[j-K]
ndp[j] %= MOD
dp = ndp
# print(f'dp = {dp}')
print(sum(dp) % MOD)
|
ConDefects/ConDefects/Code/abc253_e/Python/46006044
|
condefects-python_data_2785
|
N, M, K = map(int, input().split())
MOD = 998244353
if K == 0:
print(pow(N, M, MOD))
exit()
dp = [1] * M
for _ in range(N - 1):
nxt = [0] * M
cum_sum = [0] * (M + 1)
for i in range(M):
cum_sum[i + 1] = cum_sum[i] + dp[i]
cum_sum[i] %= MOD
for i in range(M):
if 0 <= i - K:
nxt[i] += cum_sum[i - K + 1]
if i + K <= M:
nxt[i] += cum_sum[M] - cum_sum[i + K]
nxt[i] %= MOD
dp = nxt[:]
print(sum(dp) % MOD)
N, M, K = map(int, input().split())
MOD = 998244353
if K == 0:
print(pow(M, N, MOD))
exit()
dp = [1] * M
for _ in range(N - 1):
nxt = [0] * M
cum_sum = [0] * (M + 1)
for i in range(M):
cum_sum[i + 1] = cum_sum[i] + dp[i]
cum_sum[i] %= MOD
for i in range(M):
if 0 <= i - K:
nxt[i] += cum_sum[i - K + 1]
if i + K <= M:
nxt[i] += cum_sum[M] - cum_sum[i + K]
nxt[i] %= MOD
dp = nxt[:]
print(sum(dp) % MOD)
|
ConDefects/ConDefects/Code/abc253_e/Python/45032521
|
condefects-python_data_2786
|
from sys import stdin
readline = stdin.readline
t = int(readline())
mod = 998244353
for _ in range(t):
n = int(readline())
m = int(n**0.5 + 0.001)
ans = pow(m, 3, mod)
j = m
for i in range(m, 0, -1):
x = n // i
ans += 3 * (x - j) * i**2
ans %= mod
j = x
print(ans)
from sys import stdin
readline = stdin.readline
t = int(readline())
mod = 998244353
for _ in range(t):
n = int(readline())
m = int(n**0.5)
ans = pow(m, 3, mod)
j = m
for i in range(m, 0, -1):
x = n // i
ans += 3 * (x - j) * i**2
ans %= mod
j = x
print(ans)
|
ConDefects/ConDefects/Code/arc160_b/Python/44408882
|
condefects-python_data_2787
|
import math
T = int(input())
for _ in range(T):
N = int(input())
num = int(math.sqrt(N)+1e-9)
ans = num ** 3
for y in range(1, num):
num_x = y
num_z = N // y - num
ans += (num_x-1) * num_z * 6 + num_z*3
ans %= 998244353
print(ans)
import math
T = int(input())
for _ in range(T):
N = int(input())
num = int(math.sqrt(N)+1e-9)
ans = num ** 3
for y in range(1, num+1):
num_x = y
num_z = N // y - num
ans += (num_x-1) * num_z * 6 + num_z*3
ans %= 998244353
print(ans)
|
ConDefects/ConDefects/Code/arc160_b/Python/41448583
|
condefects-python_data_2788
|
import math
MOD=998244353
t=int(input())
mul = lambda a,b: (a*b)%MOD
add = lambda a,b : (a+b)%MOD
for _ in range(t):
n=int(input())
s=int(math.sqrt(n))
ans = mul(s, mul(s,s))
for x in range (1, s+1):
v = n//x
ans= add(ans, mul(x, max(0, v-s-1)))
print(ans)
import math
MOD=998244353
t=int(input())
mul = lambda a,b: (a*b)%MOD
add = lambda a,b : (a+b)%MOD
for _ in range(t):
n=int(input())
s=int(math.sqrt(n))
ans = mul(s, mul(s,s))
for x in range (1, s+1):
v = n//x
ans=add(ans,mul(mul(3*x,x),max(v-max(s, n//(x+1)), 0)))
print(ans)
|
ConDefects/ConDefects/Code/arc160_b/Python/45326748
|
condefects-python_data_2789
|
a=list(input())
a[3]=a[2]
a[2]=a[1]
a[1]=a[0]
a[0]="0"
print(a)
a=list(input())
a[3]=a[2]
a[2]=a[1]
a[1]=a[0]
a[0]="0"
print("".join(a))
|
ConDefects/ConDefects/Code/abc247_a/Python/45954130
|
condefects-python_data_2790
|
class SegmentTree:
def __init__(
self,
n, # 列の長さ
identity_e, # 単位元
combine_f, # 2 つのデータから値を合成するための関数
):
self._n = n
self._size = 1
while self._size < self._n:
self._size <<= 1
self._identity_e = identity_e
self._combine_f = combine_f
self._node = [self._identity_e] * (2 * self._size)
# 配列の各要素を登録する
def build(self, array):
assert len(array) == self._n
for index, value in enumerate(array, start=self._size):
self._node[index] = value
for index in range(self._size - 1, 0, -1):
self._node[index] = self._combine_f(
self._node[index << 1 | 0], # 左の子
self._node[index << 1 | 1], # 右の子
)
# [一点更新] 位置 index (0-indexed) を値 value で更新
def update(self, index, value):
i = self._size + index
self._node[i] = value
while i > 1:
i >>= 1
self._node[i] = self._combine_f(
self._node[i << 1 | 0], # 左の子
self._node[i << 1 | 1], # 右の子
)
# [区間取得] 区間 [l, r) (0-indexed) 内の要素について、
# l 番目から順に combine_f を適用した結果を返す (交換法則が前提になくてもよい)
def fold(self, L, R):
L += self._size
R += self._size
value_L = self._identity_e
value_R = self._identity_e
while L < R:
if L & 1:
value_L = self._combine_f(value_L, self._node[L])
L += 1
if R & 1:
R -= 1
value_R = self._combine_f(self._node[R], value_R)
L >>= 1
R >>= 1
return self._combine_f(value_L, value_R)
N, D = map(int, input().split())
A = list(map(int, input().split()))
seg = SegmentTree(max(A)+1, 0, max)
seg.build([0]*(max(A)+1))
m = max(A)
dp = [0 for i in range(N + 1)]
for i in range(N):
t = seg.fold(max(0, A[i]-D), min(m, A[i]+D+1))
seg.update(A[i], t+1)
print(seg.fold(0, max(A)+1))
class SegmentTree:
def __init__(
self,
n, # 列の長さ
identity_e, # 単位元
combine_f, # 2 つのデータから値を合成するための関数
):
self._n = n
self._size = 1
while self._size < self._n:
self._size <<= 1
self._identity_e = identity_e
self._combine_f = combine_f
self._node = [self._identity_e] * (2 * self._size)
# 配列の各要素を登録する
def build(self, array):
assert len(array) == self._n
for index, value in enumerate(array, start=self._size):
self._node[index] = value
for index in range(self._size - 1, 0, -1):
self._node[index] = self._combine_f(
self._node[index << 1 | 0], # 左の子
self._node[index << 1 | 1], # 右の子
)
# [一点更新] 位置 index (0-indexed) を値 value で更新
def update(self, index, value):
i = self._size + index
self._node[i] = value
while i > 1:
i >>= 1
self._node[i] = self._combine_f(
self._node[i << 1 | 0], # 左の子
self._node[i << 1 | 1], # 右の子
)
# [区間取得] 区間 [l, r) (0-indexed) 内の要素について、
# l 番目から順に combine_f を適用した結果を返す (交換法則が前提になくてもよい)
def fold(self, L, R):
L += self._size
R += self._size
value_L = self._identity_e
value_R = self._identity_e
while L < R:
if L & 1:
value_L = self._combine_f(value_L, self._node[L])
L += 1
if R & 1:
R -= 1
value_R = self._combine_f(self._node[R], value_R)
L >>= 1
R >>= 1
return self._combine_f(value_L, value_R)
N, D = map(int, input().split())
A = list(map(int, input().split()))
seg = SegmentTree(max(A)+1, 0, max)
seg.build([0]*(max(A)+1))
m = max(A)
dp = [0 for i in range(N + 1)]
for i in range(N):
t = seg.fold(max(0, A[i]-D), min(m, A[i]+D)+1)
seg.update(A[i], t+1)
print(seg.fold(0, max(A)+1))
|
ConDefects/ConDefects/Code/abc339_e/Python/52923119
|
condefects-python_data_2791
|
# import sys
# sys.setrecursionlimit(10**6)
# sys.set_int_max_str_digits(10**6)
# from scipy.optimize import bisect
# from collections import defaultdict, Counter
# import bisect
# import heapq
from atcoder.segtree import SegTree
from sortedcontainers import SortedList
# mod = 998244353
# ds = [(-1,0),(0,1),(1,0),(0,-1)]
# S = input()
# N = int(input())
N, D = map(int, input().split())
A = list(map(int, input().split()))
M = max(A)
seg = SegTree(max, 0, M+1)
for i in range(N):
a = A[i]
m = seg.prod(max(a-D, 0),min(M,a+D+1))
seg.set(a,m+1)
ans = seg.all_prod()
print(ans)
# import sys
# sys.setrecursionlimit(10**6)
# sys.set_int_max_str_digits(10**6)
# from scipy.optimize import bisect
# from collections import defaultdict, Counter
# import bisect
# import heapq
from atcoder.segtree import SegTree
from sortedcontainers import SortedList
# mod = 998244353
# ds = [(-1,0),(0,1),(1,0),(0,-1)]
# S = input()
# N = int(input())
N, D = map(int, input().split())
A = list(map(int, input().split()))
M = max(A)
seg = SegTree(max, 0, M+1)
for i in range(N):
a = A[i]
m = seg.prod(max(a-D, 0),min(M+1,a+D+1))
seg.set(a,m+1)
ans = seg.all_prod()
print(ans)
|
ConDefects/ConDefects/Code/abc339_e/Python/54055907
|
condefects-python_data_2792
|
N = int(input())
S = input()
cnt = 0
for i in S:
if i == "T":
cnt += 1
if cnt > N - cnt:
print("T")
else:
print("A")
N = int(input())
S = input()
cnt = 0
for i in S:
if i == "T":
cnt += 1
if cnt > N - cnt or (cnt == N - cnt and S[-1] == "A"):
print("T")
else:
print("A")
|
ConDefects/ConDefects/Code/abc301_a/Python/45927126
|
condefects-python_data_2793
|
N = int(input())
S = list(input())
T=0
A=0
for i in range(N):
if(i == N-1):
if(N % 2 == 0):
if(T>A):print('T')
else:print('A')
else:
print(S[i])
if(S[i] == 'T'):T+=1
elif(S[i] == 'A'):A+=1
print(f'A:{A},T:{T}')
if(A>=(N/2+1)):
print('A')
break
elif(T>=(N/2+1)):
print('T')
break
N = int(input())
S = list(input())
T=0
A=0
for i in range(N):
if(i == N-1):
if(N % 2 == 0):
if(T>A):print('T')
else:print('A')
else:
print(S[i])
if(S[i] == 'T'):T+=1
elif(S[i] == 'A'):A+=1
#print(f'A:{A},T:{T}')
if(A>=(N/2+1)):
print('A')
break
elif(T>=(N/2+1)):
print('T')
break
|
ConDefects/ConDefects/Code/abc301_a/Python/45433034
|
condefects-python_data_2794
|
N = int(input())
S = input()
t, a, t_win, a_win = 0, 0, False, False
for i in range(N):
if S[i] == "T":
t += 1
else:
a += 1
if N % 2 == 0 and N / 2 == t:
t_win = True
elif N % 2 == 0 and N / 2 == a:
a_win = True
if t > a:
t_win = True
elif a > t:
a_win = True
if t_win == True:
print("T")
if a_win == True:
print("A")
N = int(input())
S = input()
t, a, t_win, a_win = 0, 0, False, False
for i in range(N):
if S[i] == "T":
t += 1
else:
a += 1
if N % 2 == 0 and N / 2 == t:
t_win = True
break
elif N % 2 == 0 and N / 2 == a:
a_win = True
break
if t > a:
t_win = True
elif a > t:
a_win = True
if t_win == True:
print("T")
if a_win == True:
print("A")
|
ConDefects/ConDefects/Code/abc301_a/Python/45347926
|
condefects-python_data_2795
|
N = int(input())
S = input().split()
T_W = S.count('T')
A_W = S.count('A')
print("T" if T_W > A_W or T_W == A_W and S[-1] == "A" else "A")
N = int(input())
S = input()
T_W = S.count('T')
A_W = S.count('A')
print("T" if T_W > A_W or T_W == A_W and S[-1] == "A" else "A")
|
ConDefects/ConDefects/Code/abc301_a/Python/45503092
|
condefects-python_data_2796
|
N = int(input())
S = list(map(int, input().split()))
ans = [S[0]]
for i in range(1,N):
ans.append(S[i]-S[i-1])
print(ans)
N = int(input())
S = list(map(int, input().split()))
ans = [S[0]]
for i in range(1,N):
ans.append(S[i]-S[i-1])
print(*ans)
|
ConDefects/ConDefects/Code/abc280_b/Python/45270301
|
condefects-python_data_2797
|
N = int(input())
S = list(map(int,input().split()))
A = [S[0]]
for i in range(1,N):
a = S[i] - A[-1]
A.append(a)
print(*A)
N = int(input())
S = list(map(int,input().split()))
A = [S[0]]
for i in range(1,N):
a = S[i] - S[i-1]
A.append(a)
print(*A)
|
ConDefects/ConDefects/Code/abc280_b/Python/45441628
|
condefects-python_data_2798
|
n = input()
last = 10
for c in n:
if 1 <= int(c) < last:
last = int(c)
else:
print("No")
exit()
print("Yes")
n = input()
last = 10
for c in n:
if int(c) < last:
last = int(c)
else:
print("No")
exit()
print("Yes")
|
ConDefects/ConDefects/Code/abc321_a/Python/54748224
|
condefects-python_data_2799
|
S=str(input());
o=10;
p=len(S);
b=0
for i in range(p):
N=int(S[i]);
if o<N:
o=N
b=b+1
if b==p:
print("Yes");
else:
print("No")
S=str(input());
o=10;
p=len(S);
b=0
for i in range(p):
N=int(S[i]);
if o>N:
o=N
b=b+1
if b==p:
print("Yes");
else:
print("No")
|
ConDefects/ConDefects/Code/abc321_a/Python/54518297
|
condefects-python_data_2800
|
N = list(str(input()))
likeNum = True
for i in range(len(N)-1):
if len(N) == 1:
break
elif int(N[i]) < int(N[i+1]):
likeNum = False
print("No")
break
if likeNum:
print("Yes")
N = list(str(input()))
likeNum = True
for i in range(len(N)-1):
if len(N) == 1:
break
elif int(N[i]) <= int(N[i+1]):
likeNum = False
print("No")
break
if likeNum:
print("Yes")
|
ConDefects/ConDefects/Code/abc321_a/Python/54737873
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.