id
stringlengths 24
27
| content
stringlengths 37
384k
| max_stars_repo_path
stringlengths 51
51
|
|---|---|---|
condefects-python_data_2801 | N = input()
def is321():
a = int(N[0])
for n in N[1:]:
a = int(n)
if int(n) >= a:
return "No"
return "Yes"
print(is321())
N = input()
def is321():
a = int(N[0])
for n in N[1:]:
if int(n) >= a:
return "No"
a = int(n)
return "Yes"
print(is321())
| ConDefects/ConDefects/Code/abc321_a/Python/55156013 |
condefects-python_data_2802 | n = input()
for i in range(len(n)-1):
if int(n[i]) < int(n[i+1]):
print("No")
break
else:
print("Yes")
n = input()
for i in range(len(n)-1):
if int(n[i]) <= int(n[i+1]):
print("No")
break
else:
print("Yes") | ConDefects/ConDefects/Code/abc321_a/Python/54713012 |
condefects-python_data_2803 | import bisect,collections,itertools,math,functools,heapq
import sys
# sys.setrecursionlimit(10**6)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LF(): return list(map(float,sys.stdin.readline().rstrip().split()))
def SI(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
N=I()
obj = collections.defaultdict(list)
arr = [LI() for _ in range(N)]
mt = 0
for t,x,a in arr:
obj[t].append((x,a))
mt = max(mt, t)
dp = [[-1]*5 for _ in range(mt+1)]
dp[0][0]=0
for i in range(1,mt+1):
for j in range(5):
if dp[i-1][j] >= 0:
dp[i][j] = max(dp[i][j], dp[i-1][j])
if j+1 < 5:
dp[i][j+1] = max(dp[i][j+1], dp[i-1][j])
if j-1 >= 0:
dp[i][j-1] = max(dp[i][j-1], dp[i-1][j])
for x,a in obj[i]:
if dp[i-1][x-1] >= 0:
dp[i][x] = max(dp[i][x], dp[i-1][x-1]+a)
if x-1 >= 0 and dp[i-1][x-1] >= 0:
dp[i][x] = max(dp[i][x], dp[i-1][x-1]+a)
if dp[i-1][x] >= 0:
dp[i][x] = max(dp[i][x], dp[i-1][x]+a)
if x+1 < 5 and dp[i-1][x+1] >= 0:
dp[i][x] = max(dp[i][x], dp[i-1][x+1]+a)
print(max(dp[-1]))
import bisect,collections,itertools,math,functools,heapq
import sys
# sys.setrecursionlimit(10**6)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LF(): return list(map(float,sys.stdin.readline().rstrip().split()))
def SI(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
N=I()
obj = collections.defaultdict(list)
arr = [LI() for _ in range(N)]
mt = 0
for t,x,a in arr:
obj[t].append((x,a))
mt = max(mt, t)
dp = [[-1]*5 for _ in range(mt+1)]
dp[0][0]=0
for i in range(1,mt+1):
for j in range(5):
if dp[i-1][j] >= 0:
dp[i][j] = max(dp[i][j], dp[i-1][j])
if j+1 < 5:
dp[i][j+1] = max(dp[i][j+1], dp[i-1][j])
if j-1 >= 0:
dp[i][j-1] = max(dp[i][j-1], dp[i-1][j])
for x,a in obj[i]:
if x-1 >= 0 and dp[i-1][x-1] >= 0:
dp[i][x] = max(dp[i][x], dp[i-1][x-1]+a)
if dp[i-1][x] >= 0:
dp[i][x] = max(dp[i][x], dp[i-1][x]+a)
if x+1 < 5 and dp[i-1][x+1] >= 0:
dp[i][x] = max(dp[i][x], dp[i-1][x+1]+a)
print(max(dp[-1]))
| ConDefects/ConDefects/Code/abc266_d/Python/44445026 |
condefects-python_data_2804 | import random
n = 5 ** 50
for i in range(185):
s = str(random.randint(1, 9999) * n)
if i != 0: s.zfill(54)
print(s, end = "")
import random
n = 5 ** 50
for i in range(185):
s = str(random.randint(1, 9999) * n)
if i != 0: s = s.zfill(54)
print(s, end = "") | ConDefects/ConDefects/Code/agc066_b/Python/54623268 |
condefects-python_data_2805 | print("".join(str(2**i)for i in range(1,99)))
print(*[5**i for i in range(80)],sep="") | ConDefects/ConDefects/Code/agc066_b/Python/52817133 |
condefects-python_data_2806 | for i in range(1,50):
print(i*(5**50),end='')
print()
for i in range(1,200):
print(i*(5**50),end='')
print() | ConDefects/ConDefects/Code/agc066_b/Python/53808375 |
condefects-python_data_2807 | print("35527136788005009293556213378906250000000000000000000000000000000000000000000000000000000000000000174082970261224545538425445556640625000000000000000000000000000000000000000000000000000000000000000418154399994818959385156631469726562500000000000000000000000000000000000000000000000000000000000000657927046177064767107367515563964843750000000000000000000000000000000000000000000000000000000000000764249108442527358420193195343017578125000000000000000000000000000000000000000000000000000000000000700084967775183031335473060607910156250000000000000000000000000000000000000000000000000000000000000527258556815013434970751404762268066406250000000000000000000000000000000000000000000000000000000000335872186951746698468923568725585937500000000000000000000000000000000000000000000000000000000000000184649255885460661374963819980621337890625000000000000000000000000000000000000000000000000000000000088899821619747854128945618867874145507812500000000000000000000000000000000000000000000000000000000037889902746002235289779491722583770751953125000000000000000000000000000000000000000000000000000000014411839782546564947551814839243888854980468750000000000000000000000000000000000000000000000000000004922063775900653581629740074276924133300781250000000000000000000000000000000000000000000000000000001516575875708525700247264467179775238037109375000000000000000000000000000000000000000000000000000000423155532744701190495106857270002365112304687500000000000000000000000000000000000000000000000000000107245357204508451332003460265696048736572265625000000000000000000000000000000000000000000000000000024751340809471500392646703403443098068237304687500000000000000000000000000000000000000000000000000005213014638597535110875469399616122245788574218750000000000000000000000000000000000000000000000000001003784318364875360884980182163417339324951171875000000000000000000000000000000000000000000000000000176981649846691624361483263783156871795654296875000000000000000000000000000000000000000000000000000028610380223320497350414370885118842124938964843750000000000000000000000000000000000000000000000000004245221875945333067647879943251609802246093750000000000000000000000000000000000000000000000000000000578679044453565438743680715560913085937500000000000000000000000000000000000000000000000000000000000072513757113428845002545131137594580650329589843750000000000000000000000000000000000000000000000000008356730508324634598693592124618589878082275390625000000000000000000000000000000000000000000000000000885876253974556604475765198003500699996948242187500000000000000000000000000000000000000000000000000086379563275749582373919110978022217750549316406250000000000000000000000000000000000000000000000000007744903455925928881242725765332579612731933593750000000000000000000000000000000000000000000000000000638158631906549089762847870588302612304687500000000000000000000000000000000000000000000000000000000048278230236548402842799987411126494407653808593750000000000000000000000000000000000000000000000000003349133691847878679936911794357001781463623046875000000000000000000000000000000000000000000000000000212690063393912609512881317641586065292358398437500000000000000000000000000000000000000000000000000012338833220467471107895107707008719444274902343750000000000000000000000000000000000000000000000000000652179416926337296445126412436366081237792968750000000000000000000000000000000000000000000000000000031305526157463070546782546443864703178405761718750000000000000000000000000000000000000000000000000001359342183098366518834154703654348850250244140625000000000000000000000000000000000000000000000000000053140672394214050200389465317130088806152343750000000000000000000000000000000000000000000000000000001859621488042861869871558155864477157592773437500000000000000000000000000000000000000000000000000000057850252809910074347499175928533077239990234375000000000000000000000000000000000000000000000000000001586322561362152328001684509217739105224609375000000000000000000000000000000000000000000000000000000037944098586706331843743100762367248535156250000000000000000000000000000000000000000000000000000000000781376254188614893791964277625083923339843750000000000000000000000000000000000000000000000000000000013620472483211187864071689546108245849609375000000000000000000000000000000000000000000000000000000000196488471715383639093488454818725585937500000000000000000000000000000000000000000000000000000000000002272521104629277033382095396518707275390625000000000000000000000000000000000000000000000000000000000020074608642062230501323938369750976562500000000000000000000000000000000000000000000000000000089714992013522731895136530511081218719482421875000000000000000000000000000000000000000000000000000009061214181231758146850552293471992015838623046875")
print("35527136788005009293556213378906250000000000000000000000000000000000007105427357601001858711242675781250000000000000000000000000000000000001421085471520200371742248535156250000000000000000000000000000000000001918465386552270501852035522460937500000000000000000000000000000000000198951966012828052043914794921875000000000000000000000000000000000000001065814103640150278806686401367187500000000000000000000000000000000002771116669464390724897384643554687500000000000000000000000000000000000042632564145606011152267456054687500000000000000000000000000000000000029487523534044157713651657104492187500000000000000000000000000000000003694822225952520966529846191406250000000000000000000000000000000000000451194637207663618028163909912109375000000000000000000000000000000000000177635683940025046467781066894531250000000000000000000000000000000000035527136788005009293556213378906250000000000000000000000000000000000007105427357601001858711242675781250000000000000000000000000000000000009592326932761352509260177612304687500000000000000000000000000000000000994759830064140260219573974609375000000000000000000000000000000000000005329070518200751394033432006835937500000000000000000000000000000000013855583347321953624486923217773437500000000000000000000000000000000000213162820728030055761337280273437500000000000000000000000000000000000147437617670220788568258285522460937500000000000000000000000000000000018474111129762604832649230957031250000000000000000000000000000000000002255973186038318090140819549560546875000000000000000000000000000000000225597318603831809014081954956054687500000000000000000000000000000000000177635683940025046467781066894531250000000000000000000000000000000000035527136788005009293556213378906250000000000000000000000000000000000007105427357601001858711242675781250000000000000000000000000000000000009592326932761352509260177612304687500000000000000000000000000000000000994759830064140260219573974609375000000000000000000000000000000000000005329070518200751394033432006835937500000000000000000000000000000000013855583347321953624486923217773437500000000000000000000000000000000000213162820728030055761337280273437500000000000000000000000000000000000147437617670220788568258285522460937500000000000000000000000000000000018474111129762604832649230957031250000000000000000000000000000000000002255973186038318090140819549560546875000000000000000000000000000000000000888178419700125232338905334472656250000000000000000000000000000000000177635683940025046467781066894531250000000000000000000000000000000000035527136788005009293556213378906250000000000000000000000000000000000047961634663806762546300888061523437500000000000000000000000000000000004973799150320701301097869873046875000000000000000000000000000000000000026645352591003756970167160034179687500000000000000000000000000000000069277916736609768122434616088867187500000000000000000000000000000000001065814103640150278806686401367187500000000000000000000000000000000000737188088351103942841291427612304687500000000000000000000000000000000092370555648813024163246154785156250000000000000000000000000000000000011279865930191590450704097747802734375000000000000000000000000000000001127986593019159045070409774780273437500000000000000000000089714991888901529648592259036377072334289550781250000000000000000000000089714991888900641470172558911144733428955078125") | ConDefects/ConDefects/Code/agc066_b/Python/53429642 |
condefects-python_data_2808 | import sys
sys.set_int_max_str_digits(200000)
u = int("5"*2+"0"*59)
num = ""
for i in range(1,59):
num += (str(u//(2**i)))*(i//9+1 if i>30 else 1)
num = int(num)
# print(len(str(num)))
def dsum(num): return sum(map(int,str(num)))
s = dsum(num)
for _ in range(50):
num *= 2
t = dsum(num)
if s < t: print("rip",_,s,t,num)
s = t
print(num*2)
import sys
sys.set_int_max_str_digits(200000)
u = int("5"*2+"0"*59)
num = ""
for i in range(1,59):
num += (str(u//(2**i)))*(i//9+1 if i>30 else 1)
num = int(num)
# print(len(str(num)))
def dsum(num): return sum(map(int,str(num)))
print(num)
s = dsum(num)
for _ in range(50):
num *= 2
t = dsum(num)
if s < t: print("rip",_,s,t,num)
s = t | ConDefects/ConDefects/Code/agc066_b/Python/52816712 |
condefects-python_data_2809 | 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()
from bisect import bisect_right
N, K = mulint()
A = list(mulint())
L, R = A[:K], A[K:]
M = [R[0]]
V = [0]
for i in range(1, N-K):
if R[i] > M[-1]:
M.append(R[i])
V.append(i)
V.append(INF)
m = INF
for i in range(K):
j = bisect_right(M, L[i])
m = min(m, V[j]+(K-i-1)+1)
print(m)
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()
from bisect import bisect_right
N, K = mulint()
A = list(mulint())
L, R = A[:K], A[K:]
M = [R[0]]
V = [0]
for i in range(1, N-K):
if R[i] > M[-1]:
M.append(R[i])
V.append(i)
V.append(INF)
m = INF
for i in range(K):
j = bisect_right(M, L[i])
m = min(m, V[j]+(K-i-1)+1)
print(m if m < INF else -1)
| ConDefects/ConDefects/Code/arc138_a/Python/43171788 |
condefects-python_data_2810 | n,k=map(int,input().split())
a=list(map(int,input().split()))
st=set()
t=[]
if min(a[:k])>=max(a[k:]):
print(-1)
exit()
for i in range(k,n):
if a[i]in st:continue
st.add(a[i])
t.append((a[i],i))
import bisect
ans=10**20
# print(t)
for i in range(k):
p=bisect.bisect_right(t,(a[i],10**10))
# print(p)
try:ans=min(ans,t[p][1]-i)
except:pass
print(ans)
n,k=map(int,input().split())
a=list(map(int,input().split()))
st=set()
t=[]
if min(a[:k])>=max(a[k:]):
print(-1)
exit()
for i in range(k+1,n):a[i]=max(a[i],a[i-1])
for i in range(k,n):
if a[i]in st:continue
st.add(a[i])
t.append((a[i],i))
t.sort()
import bisect
ans=10**20
# print(t)
for i in range(k):
p=bisect.bisect_right(t,(a[i],10**10))
# print(p)
try:ans=min(ans,t[p][1]-i)
except:pass
print(ans) | ConDefects/ConDefects/Code/arc138_a/Python/43653769 |
condefects-python_data_2811 | N,K=map(int,input().split())
A=list(map(int,input().split()))
p=[]
for i in range(N):
p.append([A[i],-i])
Maxsuu=-1
p.sort()
ans=10**10
for a,i in p:
i*=-1
if i>K and Maxsuu !=-1:
ans=min(ans,i-Maxsuu)
elif K>i:
Maxsuu=max(Maxsuu,i)
print(ans if ans!=10**10 else -1)
N,K=map(int,input().split())
A=list(map(int,input().split()))
p=[]
for i in range(N):
p.append([A[i],-i])
Maxsuu=-1
p.sort()
ans=10**10
for a,i in p:
i*=-1
if i>=K and Maxsuu !=-1:
ans=min(ans,i-Maxsuu)
elif K>i:
Maxsuu=max(Maxsuu,i)
print(ans if ans!=10**10 else -1) | ConDefects/ConDefects/Code/arc138_a/Python/45103354 |
condefects-python_data_2812 | N, K = map(int, input().split())
A = list(map(int, input().split()))
B = []
for i, a in enumerate(A):
B.append((a, i))
B.sort()
INF = N + 10
ans = INF
now = -1
for a, i in B:
if i < K:
now = max(now, i)
else:
if now >= 0:
ans = min(ans, i - now)
if ans == INF:
print(-1)
else:
print(ans)
N, K = map(int, input().split())
A = list(map(int, input().split()))
B = []
for i, a in enumerate(A):
B.append((a, i))
B.sort(key=lambda x: (x[0], -x[1]))
INF = N + 10
ans = INF
now = -1
for a, i in B:
if i < K:
now = max(now, i)
else:
if now >= 0:
ans = min(ans, i - now)
if ans == INF:
print(-1)
else:
print(ans)
| ConDefects/ConDefects/Code/arc138_a/Python/45121816 |
condefects-python_data_2813 | import sys
sys.setrecursionlimit(10**9)
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
AA = [(a, i) for i, a in enumerate(A)]
A1, A2 = AA[:K], AA[K:]
A1.sort()
A2.sort()
D = [N for _ in range(len(A2) + 1)]
for i, (a, j) in enumerate(reversed(A2)):
D[len(A2) - i - 1] = min(D[len(A2) - i], j)
ans = float("inf")
for a, i in A1:
l, r = 0, len(A2)
while r - l > 1:
m = (l + r) // 2
if A2[m][0] > a:
r = m
else:
l = m
if r == len(A2):
continue
ans_t = (K - i - 1) + (D[r] - K)
ans = min(ans, ans_t + 1)
print(ans if ans != float("inf") else -1)
if __name__ == "__main__":
main()
import sys
sys.setrecursionlimit(10**9)
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
AA = [(a, i) for i, a in enumerate(A)]
A1, A2 = AA[:K], AA[K:]
A1.sort()
A2.sort()
D = [N for _ in range(len(A2) + 1)]
for i, (a, j) in enumerate(reversed(A2)):
D[len(A2) - i - 1] = min(D[len(A2) - i], j)
ans = float("inf")
for a, i in A1:
l, r = -1, len(A2)
while r - l > 1:
m = (l + r) // 2
if A2[m][0] > a:
r = m
else:
l = m
if r == len(A2):
continue
ans_t = (K - i - 1) + (D[r] - K)
ans = min(ans, ans_t + 1)
print(ans if ans != float("inf") else -1)
if __name__ == "__main__":
main()
| ConDefects/ConDefects/Code/arc138_a/Python/45260317 |
condefects-python_data_2814 | def solve(N, K, A):
ans = 10 ** 9
ls = [(A[i], -i) for i in range(N)]
ls.sort()
j = None
for ai, mi in ls:
i = -mi
if i >= K:
if j and A[j] < ai:
ans = min(i - j, ans)
else:
if j: j = max(i, j)
else: j = i
if ans > 10 ** 8:
return -1
else:
return ans
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
print(solve(N, K, A))
def solve(N, K, A):
ans = 10 ** 9
ls = [(A[i], -i) for i in range(N)]
ls.sort()
j = None
for ai, mi in ls:
i = -mi
if i >= K:
if (not j is None) and A[j] < ai:
ans = min(i - j, ans)
else:
if j: j = max(i, j)
else: j = i
if ans > 10 ** 8:
return -1
else:
return ans
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
print(solve(N, K, A))
| ConDefects/ConDefects/Code/arc138_a/Python/41328369 |
condefects-python_data_2815 | def btw(lf,ri):
return ri*(ri-1)//2-lf*(lf-1)//2
N,H=map(int,input().split())
spell=[tuple(map(int,input().split())) for i in range(N)]
spell.sort(reverse=True,key=lambda x:x[::-1])
use=[spell[0]+(1,)]
for i in range(1,N):
if use[-1][0]*use[-1][1]>spell[i][0]*spell[i][1]:
continue
use.append(spell[i]+((use[-1][0]*use[-1][1]+spell[i][1]-1)//spell[i][1],))
ok=10**18
ng=0
while ok-ng>1:
mid=(ok+ng)//2
now=mid+1
h=H
for t,d,lf in reversed(use):
t=min(t,now)
h-=btw(lf,t)*d+(now-t)*d*t
now=lf
if h<=0:
ok=mid
else:
ng=mid
print(ok)
def btw(lf,ri):
return ri*(ri-1)//2-lf*(lf-1)//2
N,H=map(int,input().split())
spell=[tuple(map(int,input().split())) for i in range(N)]
spell.sort(reverse=True,key=lambda x:x[::-1])
use=[spell[0]+(1,)]
for i in range(1,N):
if use[-1][0]*use[-1][1]>spell[i][0]*spell[i][1]:
continue
use.append(spell[i]+((use[-1][0]*use[-1][1]+spell[i][1]-1)//spell[i][1],))
ok=10**18
ng=0
while ok-ng>1:
mid=(ok+ng)//2
now=mid+1
h=H
for t,d,lf in reversed(use):
if now<=lf:
continue
t=min(t,now)
h-=btw(lf,t)*d+(now-t)*d*t
now=lf
if h<=0:
ok=mid
else:
ng=mid
print(ok) | ConDefects/ConDefects/Code/abc303_f/Python/51957402 |
condefects-python_data_2816 | from collections import defaultdict
N,H = map(int,input().split())
T = set([0])
dic = defaultdict(int)
for i in range(N):
t,d = map(int,input().split())
T.add(t)
dic[t] = max(dic[t],d)
T = list(T)
M = []
for t in T:
M.append([t,dic[t]])
M.sort()
n = len(M)
T,D,S = [0]*n,[0]*n,[0]*n
for i in range(n):
T[i],D[i] = M[i]
DD = [0 for i in range(n)]
DD[-1] = D[-1]
for i in range(n-2,-1,-1):
DD[i] = max(DD[i+1],D[i])
l = 0
S = 0
P = []
for i in range(1,n):
t,d = T[i],D[i]
dd = DD[i]
r = t - 1
if S == 0:
P.append((l,r,1,dd))
else:
x = S // dd
if x >= r:
P.append((l,r,0,S))
elif x < l:
P.append((l,r,1,dd))
else:
P.append((l,x,0,S))
P.append((x+1,r,1,dd))
S = max(S,t*d)
l = t
P.append((l,10**18,0,S))
def f(X):
Q = P[:]
h = H
while len(Q):
l,r,f,s = Q.pop()
if l > X:
continue
d = 0
if f == 0:
d += (X - l + 1) * s
else:
d += s*(r*(r+1) - l*(l-1))//2
h -= d
X = l - 1
if h <= 0:
return True
return False
l,r = 0,H
while r - l > 1:
m = (l + r) // 2
if f(m):
r = m
else:
l = m
print(r)
from collections import defaultdict
N,H = map(int,input().split())
T = set([0])
dic = defaultdict(int)
for i in range(N):
t,d = map(int,input().split())
T.add(t)
dic[t] = max(dic[t],d)
T = list(T)
M = []
for t in T:
M.append([t,dic[t]])
M.sort()
n = len(M)
T,D,S = [0]*n,[0]*n,[0]*n
for i in range(n):
T[i],D[i] = M[i]
DD = [0 for i in range(n)]
DD[-1] = D[-1]
for i in range(n-2,-1,-1):
DD[i] = max(DD[i+1],D[i])
l = 0
S = 0
P = []
for i in range(1,n):
t,d = T[i],D[i]
dd = DD[i]
r = t - 1
if S == 0:
P.append((l,r,1,dd))
else:
x = S // dd
if x >= r:
P.append((l,r,0,S))
elif x < l:
P.append((l,r,1,dd))
else:
P.append((l,x,0,S))
P.append((x+1,r,1,dd))
S = max(S,t*d)
l = t
P.append((l,10**18,0,S))
def f(X):
Q = P[:]
h = H
while len(Q):
l,r,f,s = Q.pop()
if l > X:
continue
d = 0
if f == 0:
d += (X - l + 1) * s
else:
d += s*(X*(X+1) - l*(l-1))//2
h -= d
X = l - 1
if h <= 0:
return True
return False
l,r = 0,H
while r - l > 1:
m = (l + r) // 2
if f(m):
r = m
else:
l = m
print(r) | ConDefects/ConDefects/Code/abc303_f/Python/50087974 |
condefects-python_data_2817 | import math
import re
import functools
import random
import sys
import os
import typing
#from math import gcd,comb
from collections import Counter, defaultdict, deque
from functools import lru_cache, reduce
from itertools import accumulate, combinations, permutations
from heapq import nsmallest, nlargest, heappushpop, heapify, heappop, heappush
from io import BytesIO, IOBase
from copy import deepcopy
import threading
from typing import *
from bisect import bisect_left, bisect_right
from types import GeneratorType
# from sortedcontainers import SortedList
from operator import add
BUFSIZE = 4096
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 = IOWrapper(sys.stdin)
sys.stdout = IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
def I():
return input()
def II():
return int(input())
def MII():
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())
def LGMI():
return list(map(lambda x: int(x) - 1, input().split()))
def gcd(a, b):
while b: a, b = b, a % b
return a
def lcm(a, b):
return a // gcd(a, b) * b
def isPrimeMR(n):
d = n - 1
d = d // (d & -d)
L = [2, 7, 61] if n < 1 << 32 else [2, 3, 5, 7, 11, 13, 17] if n < 1 << 48 else [2, 3, 5, 7, 11, 13, 17, 19, 23, 29,
31, 37]
for a in L:
t = d
y = pow(a, t, n)
if y == 1: continue
while y != n - 1:
y = y * y % n
if y == 1 or t == n - 1: return 0
t <<= 1
return 1
def findFactorRho(n):
m = 1 << n.bit_length() // 8
for c in range(1, 99):
f = lambda x: (x * x + c) % n
y, r, q, g = 2, 1, 1, 1
while g == 1:
x = y
for i in range(r):
y = f(y)
k = 0
while k < r and g == 1:
ys = y
for i in range(min(m, r - k)):
y = f(y)
q = q * abs(x - y) % n
g = gcd(q, n)
k += m
r <<= 1
if g == n:
g = 1
while g == 1:
ys = f(ys)
g = gcd(abs(x - ys), n)
if g < n:
if isPrimeMR(g):
return g
elif isPrimeMR(n // g):
return n // g
return findFactorRho(g)
def primeFactor(n):
i = 2
ret = {}
rhoFlg = 0
while i * i <= n:
k = 0
while n % i == 0:
n //= i
k += 1
if k: ret[i] = k
i += i % 2 + (3 if i % 3 == 1 else 1)
if i == 101 and n >= 2 ** 20:
while n > 1:
if isPrimeMR(n):
ret[n], n = 1, 1
else:
rhoFlg = 1
j = findFactorRho(n)
k = 0
while n % j == 0:
n //= j
k += 1
ret[j] = k
if n > 1: ret[n] = 1
if rhoFlg: ret = {x: ret[x] for x in sorted(ret)}
return ret
def divisors(N):
pf = primeFactor(N)
ret = [1]
for p in pf:
ret_prev = ret
ret = []
for i in range(pf[p] + 1):
for r in ret_prev:
ret.append(r * (p ** i))
return sorted(ret)[::-1]
class SortedList:
def __init__(self, iterable=[], _load=200):
"""Initialize sorted list instance."""
values = sorted(iterable)
self._len = _len = len(values)
self._load = _load
self._lists = _lists = [values[i:i + _load] for i in range(0, _len, _load)]
self._list_lens = [len(_list) for _list in _lists]
self._mins = [_list[0] for _list in _lists]
self._fen_tree = []
self._rebuild = True
def _fen_build(self):
"""Build a fenwick tree instance."""
self._fen_tree[:] = self._list_lens
_fen_tree = self._fen_tree
for i in range(len(_fen_tree)):
if i | i + 1 < len(_fen_tree):
_fen_tree[i | i + 1] += _fen_tree[i]
self._rebuild = False
def _fen_update(self, index, value):
"""Update `fen_tree[index] += value`."""
if not self._rebuild:
_fen_tree = self._fen_tree
while index < len(_fen_tree):
_fen_tree[index] += value
index |= index + 1
def _fen_query(self, end):
"""Return `sum(_fen_tree[:end])`."""
if self._rebuild:
self._fen_build()
_fen_tree = self._fen_tree
x = 0
while end:
x += _fen_tree[end - 1]
end &= end - 1
return x
def _fen_findkth(self, k):
"""Return a pair of (the largest `idx` such that `sum(_fen_tree[:idx]) <= k`, `k - sum(_fen_tree[:idx])`)."""
_list_lens = self._list_lens
if k < _list_lens[0]:
return 0, k
if k >= self._len - _list_lens[-1]:
return len(_list_lens) - 1, k + _list_lens[-1] - self._len
if self._rebuild:
self._fen_build()
_fen_tree = self._fen_tree
idx = -1
for d in reversed(range(len(_fen_tree).bit_length())):
right_idx = idx + (1 << d)
if right_idx < len(_fen_tree) and k >= _fen_tree[right_idx]:
idx = right_idx
k -= _fen_tree[idx]
return idx + 1, k
def _delete(self, pos, idx):
"""Delete value at the given `(pos, idx)`."""
_lists = self._lists
_mins = self._mins
_list_lens = self._list_lens
self._len -= 1
self._fen_update(pos, -1)
del _lists[pos][idx]
_list_lens[pos] -= 1
if _list_lens[pos]:
_mins[pos] = _lists[pos][0]
else:
del _lists[pos]
del _list_lens[pos]
del _mins[pos]
self._rebuild = True
def _loc_left(self, value):
"""Return an index pair that corresponds to the first position of `value` in the sorted list."""
if not self._len:
return 0, 0
_lists = self._lists
_mins = self._mins
lo, pos = -1, len(_lists) - 1
while lo + 1 < pos:
mi = (lo + pos) >> 1
if value <= _mins[mi]:
pos = mi
else:
lo = mi
if pos and value <= _lists[pos - 1][-1]:
pos -= 1
_list = _lists[pos]
lo, idx = -1, len(_list)
while lo + 1 < idx:
mi = (lo + idx) >> 1
if value <= _list[mi]:
idx = mi
else:
lo = mi
return pos, idx
def _loc_right(self, value):
"""Return an index pair that corresponds to the last position of `value` in the sorted list."""
if not self._len:
return 0, 0
_lists = self._lists
_mins = self._mins
pos, hi = 0, len(_lists)
while pos + 1 < hi:
mi = (pos + hi) >> 1
if value < _mins[mi]:
hi = mi
else:
pos = mi
_list = _lists[pos]
lo, idx = -1, len(_list)
while lo + 1 < idx:
mi = (lo + idx) >> 1
if value < _list[mi]:
idx = mi
else:
lo = mi
return pos, idx
def add(self, value):
"""Add `value` to sorted list."""
_load = self._load
_lists = self._lists
_mins = self._mins
_list_lens = self._list_lens
self._len += 1
if _lists:
pos, idx = self._loc_right(value)
self._fen_update(pos, 1)
_list = _lists[pos]
_list.insert(idx, value)
_list_lens[pos] += 1
_mins[pos] = _list[0]
if _load + _load < len(_list):
_lists.insert(pos + 1, _list[_load:])
_list_lens.insert(pos + 1, len(_list) - _load)
_mins.insert(pos + 1, _list[_load])
_list_lens[pos] = _load
del _list[_load:]
self._rebuild = True
else:
_lists.append([value])
_mins.append(value)
_list_lens.append(1)
self._rebuild = True
def discard(self, value):
"""Remove `value` from sorted list if it is a member."""
_lists = self._lists
if _lists:
pos, idx = self._loc_right(value)
if idx and _lists[pos][idx - 1] == value:
self._delete(pos, idx - 1)
def remove(self, value):
"""Remove `value` from sorted list; `value` must be a member."""
_len = self._len
self.discard(value)
if _len == self._len:
raise ValueError('{0!r} not in list'.format(value))
def pop(self, index=-1):
"""Remove and return value at `index` in sorted list."""
pos, idx = self._fen_findkth(self._len + index if index < 0 else index)
value = self._lists[pos][idx]
self._delete(pos, idx)
return value
def bisect_left(self, value):
"""Return the first index to insert `value` in the sorted list."""
pos, idx = self._loc_left(value)
return self._fen_query(pos) + idx
def bisect_right(self, value):
"""Return the last index to insert `value` in the sorted list."""
pos, idx = self._loc_right(value)
return self._fen_query(pos) + idx
def count(self, value):
"""Return number of occurrences of `value` in the sorted list."""
return self.bisect_right(value) - self.bisect_left(value)
def __len__(self):
"""Return the size of the sorted list."""
return self._len
def __getitem__(self, index):
"""Lookup value at `index` in sorted list."""
pos, idx = self._fen_findkth(self._len + index if index < 0 else index)
return self._lists[pos][idx]
def __delitem__(self, index):
"""Remove value at `index` from sorted list."""
pos, idx = self._fen_findkth(self._len + index if index < 0 else index)
self._delete(pos, idx)
def __contains__(self, value):
"""Return true if `value` is an element of the sorted list."""
_lists = self._lists
if _lists:
pos, idx = self._loc_left(value)
return idx < len(_lists[pos]) and _lists[pos][idx] == value
return False
def __iter__(self):
"""Return an iterator over the sorted list."""
return (value for _list in self._lists for value in _list)
def __reversed__(self):
"""Return a reverse iterator over the sorted list."""
return (value for _list in reversed(self._lists) for value in reversed(_list))
def __repr__(self):
"""Return string representation of sorted list."""
return 'SortedList({0})'.format(list(self))
mod=10**9+7
inf=10**15
def solve():
n,h=MII()
A=[LII() for i in range(n)]
A.sort(key=lambda x:(x[1],-x[0]*x[1]))
B=[]
pd=-1
for t,d in A:
if pd==d:
continue
pd=d
while B and B[-1][0]*B[-1][1]<=t*d:
B.pop()
if not B or (B[-1][0]*B[-1][1]>t*d):
B.append([t,d])
C=[]
m=len(B)
for i in range(m-1):
t0,d0=B[i]
t1,d1=B[i+1]
l,r=0,10**18
while l<r:
mid=(l+r)//2
if d0*min(mid,t0)>=d1*min(mid,t1):
r=mid
else:
l=mid+1
C.append(l)
C.append(0)
def check(x):
ans=0
for i,c in enumerate(C):
if x<c:
continue
t,d=B[i]
if x>t:
ans+=(x-t)*t*d
x=t
ans+=(x-c+1)*(t*d+(t*d-(x-c)*d))//2
x=c-1
return ans>=h
l,r=0,10**18
while l<r:
mid=(l+r)//2
if check(mid):
r=mid
else:
l=mid +1
print(l)
for _ in range(1):
solve()
import math
import re
import functools
import random
import sys
import os
import typing
#from math import gcd,comb
from collections import Counter, defaultdict, deque
from functools import lru_cache, reduce
from itertools import accumulate, combinations, permutations
from heapq import nsmallest, nlargest, heappushpop, heapify, heappop, heappush
from io import BytesIO, IOBase
from copy import deepcopy
import threading
from typing import *
from bisect import bisect_left, bisect_right
from types import GeneratorType
# from sortedcontainers import SortedList
from operator import add
BUFSIZE = 4096
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 = IOWrapper(sys.stdin)
sys.stdout = IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
def I():
return input()
def II():
return int(input())
def MII():
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())
def LGMI():
return list(map(lambda x: int(x) - 1, input().split()))
def gcd(a, b):
while b: a, b = b, a % b
return a
def lcm(a, b):
return a // gcd(a, b) * b
def isPrimeMR(n):
d = n - 1
d = d // (d & -d)
L = [2, 7, 61] if n < 1 << 32 else [2, 3, 5, 7, 11, 13, 17] if n < 1 << 48 else [2, 3, 5, 7, 11, 13, 17, 19, 23, 29,
31, 37]
for a in L:
t = d
y = pow(a, t, n)
if y == 1: continue
while y != n - 1:
y = y * y % n
if y == 1 or t == n - 1: return 0
t <<= 1
return 1
def findFactorRho(n):
m = 1 << n.bit_length() // 8
for c in range(1, 99):
f = lambda x: (x * x + c) % n
y, r, q, g = 2, 1, 1, 1
while g == 1:
x = y
for i in range(r):
y = f(y)
k = 0
while k < r and g == 1:
ys = y
for i in range(min(m, r - k)):
y = f(y)
q = q * abs(x - y) % n
g = gcd(q, n)
k += m
r <<= 1
if g == n:
g = 1
while g == 1:
ys = f(ys)
g = gcd(abs(x - ys), n)
if g < n:
if isPrimeMR(g):
return g
elif isPrimeMR(n // g):
return n // g
return findFactorRho(g)
def primeFactor(n):
i = 2
ret = {}
rhoFlg = 0
while i * i <= n:
k = 0
while n % i == 0:
n //= i
k += 1
if k: ret[i] = k
i += i % 2 + (3 if i % 3 == 1 else 1)
if i == 101 and n >= 2 ** 20:
while n > 1:
if isPrimeMR(n):
ret[n], n = 1, 1
else:
rhoFlg = 1
j = findFactorRho(n)
k = 0
while n % j == 0:
n //= j
k += 1
ret[j] = k
if n > 1: ret[n] = 1
if rhoFlg: ret = {x: ret[x] for x in sorted(ret)}
return ret
def divisors(N):
pf = primeFactor(N)
ret = [1]
for p in pf:
ret_prev = ret
ret = []
for i in range(pf[p] + 1):
for r in ret_prev:
ret.append(r * (p ** i))
return sorted(ret)[::-1]
class SortedList:
def __init__(self, iterable=[], _load=200):
"""Initialize sorted list instance."""
values = sorted(iterable)
self._len = _len = len(values)
self._load = _load
self._lists = _lists = [values[i:i + _load] for i in range(0, _len, _load)]
self._list_lens = [len(_list) for _list in _lists]
self._mins = [_list[0] for _list in _lists]
self._fen_tree = []
self._rebuild = True
def _fen_build(self):
"""Build a fenwick tree instance."""
self._fen_tree[:] = self._list_lens
_fen_tree = self._fen_tree
for i in range(len(_fen_tree)):
if i | i + 1 < len(_fen_tree):
_fen_tree[i | i + 1] += _fen_tree[i]
self._rebuild = False
def _fen_update(self, index, value):
"""Update `fen_tree[index] += value`."""
if not self._rebuild:
_fen_tree = self._fen_tree
while index < len(_fen_tree):
_fen_tree[index] += value
index |= index + 1
def _fen_query(self, end):
"""Return `sum(_fen_tree[:end])`."""
if self._rebuild:
self._fen_build()
_fen_tree = self._fen_tree
x = 0
while end:
x += _fen_tree[end - 1]
end &= end - 1
return x
def _fen_findkth(self, k):
"""Return a pair of (the largest `idx` such that `sum(_fen_tree[:idx]) <= k`, `k - sum(_fen_tree[:idx])`)."""
_list_lens = self._list_lens
if k < _list_lens[0]:
return 0, k
if k >= self._len - _list_lens[-1]:
return len(_list_lens) - 1, k + _list_lens[-1] - self._len
if self._rebuild:
self._fen_build()
_fen_tree = self._fen_tree
idx = -1
for d in reversed(range(len(_fen_tree).bit_length())):
right_idx = idx + (1 << d)
if right_idx < len(_fen_tree) and k >= _fen_tree[right_idx]:
idx = right_idx
k -= _fen_tree[idx]
return idx + 1, k
def _delete(self, pos, idx):
"""Delete value at the given `(pos, idx)`."""
_lists = self._lists
_mins = self._mins
_list_lens = self._list_lens
self._len -= 1
self._fen_update(pos, -1)
del _lists[pos][idx]
_list_lens[pos] -= 1
if _list_lens[pos]:
_mins[pos] = _lists[pos][0]
else:
del _lists[pos]
del _list_lens[pos]
del _mins[pos]
self._rebuild = True
def _loc_left(self, value):
"""Return an index pair that corresponds to the first position of `value` in the sorted list."""
if not self._len:
return 0, 0
_lists = self._lists
_mins = self._mins
lo, pos = -1, len(_lists) - 1
while lo + 1 < pos:
mi = (lo + pos) >> 1
if value <= _mins[mi]:
pos = mi
else:
lo = mi
if pos and value <= _lists[pos - 1][-1]:
pos -= 1
_list = _lists[pos]
lo, idx = -1, len(_list)
while lo + 1 < idx:
mi = (lo + idx) >> 1
if value <= _list[mi]:
idx = mi
else:
lo = mi
return pos, idx
def _loc_right(self, value):
"""Return an index pair that corresponds to the last position of `value` in the sorted list."""
if not self._len:
return 0, 0
_lists = self._lists
_mins = self._mins
pos, hi = 0, len(_lists)
while pos + 1 < hi:
mi = (pos + hi) >> 1
if value < _mins[mi]:
hi = mi
else:
pos = mi
_list = _lists[pos]
lo, idx = -1, len(_list)
while lo + 1 < idx:
mi = (lo + idx) >> 1
if value < _list[mi]:
idx = mi
else:
lo = mi
return pos, idx
def add(self, value):
"""Add `value` to sorted list."""
_load = self._load
_lists = self._lists
_mins = self._mins
_list_lens = self._list_lens
self._len += 1
if _lists:
pos, idx = self._loc_right(value)
self._fen_update(pos, 1)
_list = _lists[pos]
_list.insert(idx, value)
_list_lens[pos] += 1
_mins[pos] = _list[0]
if _load + _load < len(_list):
_lists.insert(pos + 1, _list[_load:])
_list_lens.insert(pos + 1, len(_list) - _load)
_mins.insert(pos + 1, _list[_load])
_list_lens[pos] = _load
del _list[_load:]
self._rebuild = True
else:
_lists.append([value])
_mins.append(value)
_list_lens.append(1)
self._rebuild = True
def discard(self, value):
"""Remove `value` from sorted list if it is a member."""
_lists = self._lists
if _lists:
pos, idx = self._loc_right(value)
if idx and _lists[pos][idx - 1] == value:
self._delete(pos, idx - 1)
def remove(self, value):
"""Remove `value` from sorted list; `value` must be a member."""
_len = self._len
self.discard(value)
if _len == self._len:
raise ValueError('{0!r} not in list'.format(value))
def pop(self, index=-1):
"""Remove and return value at `index` in sorted list."""
pos, idx = self._fen_findkth(self._len + index if index < 0 else index)
value = self._lists[pos][idx]
self._delete(pos, idx)
return value
def bisect_left(self, value):
"""Return the first index to insert `value` in the sorted list."""
pos, idx = self._loc_left(value)
return self._fen_query(pos) + idx
def bisect_right(self, value):
"""Return the last index to insert `value` in the sorted list."""
pos, idx = self._loc_right(value)
return self._fen_query(pos) + idx
def count(self, value):
"""Return number of occurrences of `value` in the sorted list."""
return self.bisect_right(value) - self.bisect_left(value)
def __len__(self):
"""Return the size of the sorted list."""
return self._len
def __getitem__(self, index):
"""Lookup value at `index` in sorted list."""
pos, idx = self._fen_findkth(self._len + index if index < 0 else index)
return self._lists[pos][idx]
def __delitem__(self, index):
"""Remove value at `index` from sorted list."""
pos, idx = self._fen_findkth(self._len + index if index < 0 else index)
self._delete(pos, idx)
def __contains__(self, value):
"""Return true if `value` is an element of the sorted list."""
_lists = self._lists
if _lists:
pos, idx = self._loc_left(value)
return idx < len(_lists[pos]) and _lists[pos][idx] == value
return False
def __iter__(self):
"""Return an iterator over the sorted list."""
return (value for _list in self._lists for value in _list)
def __reversed__(self):
"""Return a reverse iterator over the sorted list."""
return (value for _list in reversed(self._lists) for value in reversed(_list))
def __repr__(self):
"""Return string representation of sorted list."""
return 'SortedList({0})'.format(list(self))
mod=10**9+7
inf=10**15
def solve():
n,h=MII()
A=[LII() for i in range(n)]
A.sort(key=lambda x:(x[1],-x[0]*x[1]))
B=[]
pd=-1
for t,d in A:
if pd==d:
continue
pd=d
while B and B[-1][0]*B[-1][1]<=t*d:
B.pop()
if not B or (B[-1][0]*B[-1][1]>t*d):
B.append([t,d])
C=[]
m=len(B)
for i in range(m-1):
t0,d0=B[i]
t1,d1=B[i+1]
l,r=0,10**18
while l<r:
mid=(l+r)//2
if d0*min(mid,t0)>=d1*min(mid,t1):
r=mid
else:
l=mid+1
C.append(l)
C.append(0)
def check(x):
ans=0
for i,c in enumerate(C):
if x<c:
continue
t,d=B[i]
if x>t:
ans+=(x-t)*t*d
x=t
ans+=(x-c+1)*(x*d+(x*d-(x-c)*d))//2
x=c-1
return ans>=h
l,r=0,10**18
while l<r:
mid=(l+r)//2
if check(mid):
r=mid
else:
l=mid +1
print(l)
for _ in range(1):
solve() | ConDefects/ConDefects/Code/abc303_f/Python/52228360 |
condefects-python_data_2818 | from collections import defaultdict
from operator import itemgetter
import sys
def main():
input = sys.stdin.readline
N, H = map(int, input().split())
TD = [tuple(map(int, input().split())) for _ in range(N)]
TDD = defaultdict(int)
for t, d in TD:
TDD[t] = max(TDD[t], d)
TD = [(t, d) for t, d in TDD.items()]
N = len(TD)
TD.sort(key=itemgetter(0))
P = [0] * (N + 1) # P[i] = i番目以降の最大のd
for i in range(N - 1, -1, -1):
_, d = TD[i]
P[i] = max(P[i + 1], d)
pt = 0
max_td = 0
for i in range(N):
t, d = TD[i]
max_d = P[i]
x = min((max_td + max_d - 1) // max_d, t)
dam = max_td * (x - pt) + max_d * (x + t - 1) * (t - x) // 2
if dam < H:
H -= dam
max_td = max(max_td, t * d)
pt = t
continue
l = pt - 1
r = t - 1
while r - l > 1:
m = (l + r) // 2
dam = max_td * (min(m + 1, x) - pt)
if m + 1 > x:
dam += max_d * (x + m) * (m + 1 - x) // 2
if dam < H:
l = m
else:
r = m
print(r)
return
print(pt - 1 + (H + max_td - 1) // max_td)
if __name__ == '__main__':
main()
from collections import defaultdict
from operator import itemgetter
import sys
def main():
input = sys.stdin.readline
N, H = map(int, input().split())
TD = [tuple(map(int, input().split())) for _ in range(N)]
TDD = defaultdict(int)
for t, d in TD:
TDD[t] = max(TDD[t], d)
TD = [(t, d) for t, d in TDD.items()]
N = len(TD)
TD.sort(key=itemgetter(0))
P = [0] * (N + 1) # P[i] = i番目以降の最大のd
for i in range(N - 1, -1, -1):
_, d = TD[i]
P[i] = max(P[i + 1], d)
pt = 0
max_td = 0
for i in range(N):
t, d = TD[i]
max_d = P[i]
x = max(pt, min((max_td + max_d - 1) // max_d, t))
dam = max_td * (x - pt) + max_d * (x + t - 1) * (t - x) // 2
if dam < H:
H -= dam
max_td = max(max_td, t * d)
pt = t
continue
l = pt - 1
r = t - 1
while r - l > 1:
m = (l + r) // 2
dam = max_td * (min(m + 1, x) - pt)
if m + 1 > x:
dam += max_d * (x + m) * (m + 1 - x) // 2
if dam < H:
l = m
else:
r = m
print(r)
return
print(pt - 1 + (H + max_td - 1) // max_td)
if __name__ == '__main__':
main()
| ConDefects/ConDefects/Code/abc303_f/Python/48933165 |
condefects-python_data_2819 | from bisect import *
n, h = map(int, input().split())
td = [tuple(map(int, input().split())) for _ in range(n)]
td.sort() # t の小さい順
prod_max = [t * d for t, d in td]
for i in range(1, n):
prod_max[i] = max(prod_max[i], prod_max[i - 1])
def check(x):
# [0, t1_), [t1_, t2_), [t2_, t3_)... があって t2_ <= x < t3_ ならば
# 1_ と 2_ は tj * dj
# 3_ 以降は ターン * dj
attack_all = 0
last = x + 1
now_max_d = 0
for i in reversed(range(n)):
t, d = td[i]
if t > x:
now_max_d = max(now_max_d, d)
continue
if now_max_d == 0:
attack_all += (last - t) * prod_max[i]
else:
# ターン i として i < tjの時 i * dj
# i >= tj の時 tj * dj
# i * dj > tj * dj となるような i を求める
border_i = (prod_max[i] + now_max_d - 1) // now_max_d
if border_i >= last:
attack_all += (last - t) * prod_max[i]
elif t <= border_i:
# border_iより左側は tj * djの方が大きい
# 右側は sum[i=border_i~last-1] i * dj なので等差数列の公式
attack_all += (border_i - t) * prod_max[i] + (last - border_i) * (border_i + last - 1) * now_max_d // 2
else: # border_i < t
# sum[i=t~last-1] i * dj なので等差数列の公式
attack_all += (last - t) * (t + last - 1) * now_max_d // 2
now_max_d = max(now_max_d, d)
last = t
if attack_all >= h:
break
return attack_all >= h
ng, ok = -1, 10 ** 18 + 10
while ng + 1 < ok:
mid = (ng + ok) // 2
if check(mid):
ok = mid
else:
ng = mid
print(ok)
from bisect import *
n, h = map(int, input().split())
td = [tuple(map(int, input().split())) for _ in range(n)] + [(1, 0)]
td.sort() # t の小さい順
prod_max = [t * d for t, d in td]
for i in range(1, n):
prod_max[i] = max(prod_max[i], prod_max[i - 1])
def check(x):
# [0, t1_), [t1_, t2_), [t2_, t3_)... があって t2_ <= x < t3_ ならば
# 1_ と 2_ は tj * dj
# 3_ 以降は ターン * dj
attack_all = 0
last = x + 1
now_max_d = 0
for i in reversed(range(n)):
t, d = td[i]
if t > x:
now_max_d = max(now_max_d, d)
continue
if now_max_d == 0:
attack_all += (last - t) * prod_max[i]
else:
# ターン i として i < tjの時 i * dj
# i >= tj の時 tj * dj
# i * dj > tj * dj となるような i を求める
border_i = (prod_max[i] + now_max_d - 1) // now_max_d
if border_i >= last:
attack_all += (last - t) * prod_max[i]
elif t <= border_i:
# border_iより左側は tj * djの方が大きい
# 右側は sum[i=border_i~last-1] i * dj なので等差数列の公式
attack_all += (border_i - t) * prod_max[i] + (last - border_i) * (border_i + last - 1) * now_max_d // 2
else: # border_i < t
# sum[i=t~last-1] i * dj なので等差数列の公式
attack_all += (last - t) * (t + last - 1) * now_max_d // 2
now_max_d = max(now_max_d, d)
last = t
if attack_all >= h:
break
return attack_all >= h
ng, ok = -1, 10 ** 18 + 10
while ng + 1 < ok:
mid = (ng + ok) // 2
if check(mid):
ok = mid
else:
ng = mid
print(ok)
| ConDefects/ConDefects/Code/abc303_f/Python/48442381 |
condefects-python_data_2820 | from random import randint, shuffle
from math import gcd, log2, log, sqrt
from fractions import Fraction
from bisect import bisect_left, bisect_right
from itertools import accumulate, permutations, combinations, product, chain, groupby
from sortedcontainers import SortedList
from collections import Counter, deque, defaultdict as ddict
from heapq import heappush as push, heappop as pop
from functools import reduce, lru_cache
import sys
input = sys.stdin.readline
inf = 10**18 + 1
def read(dtype=int):
return list(map(dtype, input().split()))
n, h = read()
a = [read() for _ in range(n)]
event = Counter()
event[1] = 0
for t, d in a:
event[t] = max(event[t], d)
l = 0
r = h
keys = sorted(event)
K = len(keys)
keys.append(inf)
R = [0] * (K+1)
for i in range(K-1, -1, -1):
R[i] = max(R[i+1], event[keys[i]])
def f(l, r):
return (l+r) * (r-l+1) // 2
def check(m):
tot = best = 0
for i in range(K):
best = max(best, event[keys[i]] * keys[i])
curr = keys[i]
nxt = min(m+1, keys[i+1])
deal = R[i+1]
if deal == 0:
ptr = inf
else:
ptr = (best + deal - 1) // deal
tot += best * max(0, min(ptr, nxt) - curr)
if ptr < nxt:
ptr = max(ptr, curr)
tot += deal * f(ptr, nxt-1)
return tot >= h
# tot = 0
# for i in range(1, 10):
# best = 0
# for u, v in event.items():
# best = max(best, v * min(u, i))
# tot += best
# print("cmp", i, tot)
# print(check(9))
while l < r:
m = (l+r) >> 1
if check(m):
r = m
else:
l = m + 1
print(l)
from random import randint, shuffle
from math import gcd, log2, log, sqrt
from fractions import Fraction
from bisect import bisect_left, bisect_right
from itertools import accumulate, permutations, combinations, product, chain, groupby
from sortedcontainers import SortedList
from collections import Counter, deque, defaultdict as ddict
from heapq import heappush as push, heappop as pop
from functools import reduce, lru_cache
import sys
input = sys.stdin.readline
inf = 10**18 + 1
def read(dtype=int):
return list(map(dtype, input().split()))
n, h = read()
a = [read() for _ in range(n)]
event = Counter()
event[1] = 0
for t, d in a:
event[t] = max(event[t], d)
l = 0
r = h
keys = sorted(event)
K = len(keys)
keys.append(inf)
R = [0] * (K+1)
for i in range(K-1, -1, -1):
R[i] = max(R[i+1], event[keys[i]])
def f(l, r):
return (l+r) * (r-l+1) // 2
def check(m):
tot = best = 0
for i in range(K):
best = max(best, event[keys[i]] * keys[i])
curr = keys[i]
if curr > m:
break
nxt = min(m+1, keys[i+1])
deal = R[i+1]
if deal == 0:
ptr = inf
else:
ptr = (best + deal - 1) // deal
tot += best * max(0, min(ptr, nxt) - curr)
if ptr < nxt:
ptr = max(ptr, curr)
tot += deal * f(ptr, nxt-1)
return tot >= h
# tot = 0
# for i in range(1, 10):
# best = 0
# for u, v in event.items():
# best = max(best, v * min(u, i))
# tot += best
# print("cmp", i, tot)
# print(check(9))
while l < r:
m = (l+r) >> 1
if check(m):
r = m
else:
l = m + 1
print(l)
| ConDefects/ConDefects/Code/abc303_f/Python/49402164 |
condefects-python_data_2821 | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
INF = 10**18
# dp[i][j][k]: 頂点i番目まで見たときに、i番目が色j(0or1)で、頂点1が色k(0or1)の時の総和の最小値
# 頂点0 は色0 で固定する
dp = [[[INF] * 2 for _ in range(2)] for _ in range(N + 1)]
dp[0][0][0] = 0
dp[0][0][1] = 0
for i in range(N):
if i == 0:
# 頂点1が0と同じ色の場合、辺を消す
dp[i+1][0][0] = A[0]
dp[i+1][1][1] = 0
continue
dp[i+1][0][0] = min(dp[i][0][0] + A[i] + B[i-1], dp[i][1][0] + A[i])
dp[i+1][0][1] = min(dp[i][0][1] + A[i] + B[i-1], dp[i][1][1] + A[i])
dp[i+1][1][0] = min(dp[i][0][0] + B[i-1], dp[i][1][0] + B[i-1])
dp[i+1][1][1] = min(dp[i][0][1], dp[i][1][1] + B[i-1])
# N における辺A は調査済み
ans = dp[N][0][0] + B[-1]
ans = min(ans, dp[N][0][1])
ans = min(ans, dp[N][1][0])
ans = min(ans, dp[N][1][1] + B[-1])
print(ans)
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
INF = 10**18
# dp[i][j][k]: 頂点i番目まで見たときに、i番目が色j(0or1)で、頂点1が色k(0or1)の時の総和の最小値
# 頂点0 は色0 で固定する
dp = [[[INF] * 2 for _ in range(2)] for _ in range(N + 1)]
dp[0][0][0] = 0
dp[0][0][1] = 0
for i in range(N):
if i == 0:
# 頂点1が0と同じ色の場合、辺を消す
dp[i+1][0][0] = A[0]
dp[i+1][1][1] = 0
continue
dp[i+1][0][0] = min(dp[i][0][0] + A[i] + B[i-1], dp[i][1][0] + A[i])
dp[i+1][0][1] = min(dp[i][0][1] + A[i] + B[i-1], dp[i][1][1] + A[i])
dp[i+1][1][0] = min(dp[i][0][0], dp[i][1][0] + B[i-1])
dp[i+1][1][1] = min(dp[i][0][1], dp[i][1][1] + B[i-1])
# N における辺A は調査済み
ans = dp[N][0][0] + B[-1]
ans = min(ans, dp[N][0][1])
ans = min(ans, dp[N][1][0])
ans = min(ans, dp[N][1][1] + B[-1])
print(ans) | ConDefects/ConDefects/Code/abc229_f/Python/46038453 |
condefects-python_data_2822 | N,M=map(int,input().split())
A=list(map(int,input().split()))
inf=1<<3
dp=[[[inf]*(M+1) for _ in range(2)] for _ in range(N+1)]
dp[0][1][0]=0
for i in range(N):
for k in range(2):
for j in range(M+1):
if k==0:
if dp[i][k][j]==inf:continue
if i!=0:
dp[i+1][k][j]=min(dp[i][k][j],dp[i+1][k][j])
else:
dp[i+1][k][j]=1
if A[i]+j<=M:
dp[i+1][1][A[i]+j]=min(dp[i][0][j]+1,dp[i+1][1][A[i]+j])
else:
if dp[i][k][j]==inf:continue
dp[i+1][0][j]=min(dp[i][k][j],dp[i+1][0][j])
if A[i]+j<=M:
dp[i+1][1][A[i]+j]=min(dp[i][k][j],dp[i+1][1][A[i]+j])
for x in range(1,M+1):
ans=inf
for i in range(1,N+1):
if i!=N:
ans=min(ans,dp[i][1][x]+1)
else:
ans=min(ans,dp[i][1][x])
print(ans if ans!=inf else -1)
N,M=map(int,input().split())
A=list(map(int,input().split()))
inf=1<<60
dp=[[[inf]*(M+1) for _ in range(2)] for _ in range(N+1)]
dp[0][1][0]=0
for i in range(N):
for k in range(2):
for j in range(M+1):
if k==0:
if dp[i][k][j]==inf:continue
if i!=0:
dp[i+1][k][j]=min(dp[i][k][j],dp[i+1][k][j])
else:
dp[i+1][k][j]=1
if A[i]+j<=M:
dp[i+1][1][A[i]+j]=min(dp[i][0][j]+1,dp[i+1][1][A[i]+j])
else:
if dp[i][k][j]==inf:continue
dp[i+1][0][j]=min(dp[i][k][j],dp[i+1][0][j])
if A[i]+j<=M:
dp[i+1][1][A[i]+j]=min(dp[i][k][j],dp[i+1][1][A[i]+j])
for x in range(1,M+1):
ans=inf
for i in range(1,N+1):
if i!=N:
ans=min(ans,dp[i][1][x]+1)
else:
ans=min(ans,dp[i][1][x])
print(ans if ans!=inf else -1) | ConDefects/ConDefects/Code/abc275_f/Python/45458655 |
condefects-python_data_2823 | N,M=map(int, input().split())
A = list(map(int, input().split()))
l = [set([]) for i in range(M)]
for i,a in enumerate(A,1):
cnt = max(1,(-a+i-1)//i)
a += i * cnt
#print(cnt)
for j in range(cnt,M+1):
l[j-1].add(a)
a += i
if a>=200000:
break
#print(l)
for i in range(M):
for j in range(200000):
if j not in l[i]:
print(j)
break
N,M=map(int, input().split())
A = list(map(int, input().split()))
l = [set([]) for i in range(M)]
for i,a in enumerate(A,1):
cnt = max(1,(-a+i-1)//i)
a += i * cnt
#print(cnt)
for j in range(cnt,M+1):
l[j-1].add(a)
a += i
if a>=200000:
break
#print(l)
for i in range(M):
for j in range(200001):
if j not in l[i]:
print(j)
break
| ConDefects/ConDefects/Code/abc272_e/Python/45548566 |
condefects-python_data_2824 | # import系 ---
from collections import defaultdict
# 入力用 ---
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()))
LI_DEC = lambda: list(map(lambda x: int(x) - 1, input().split()))
LS = lambda: list(input())
LSS = lambda: input().split()
# コード ---
N, M = MI()
A = LI()
sets = [set() for _ in range(N)]
for i, a in enumerate(A, start=1):
for j in range(a % i, N, i):
if j - a < 0:
break
sets[j].add((j - a) // i)
for i in range(1, M+1):
is_ok = False
for j in range(N):
if i not in sets[j]:
print(j)
is_ok = True
break
if not is_ok:
print(N)
# import系 ---
from collections import defaultdict
# 入力用 ---
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()))
LI_DEC = lambda: list(map(lambda x: int(x) - 1, input().split()))
LS = lambda: list(input())
LSS = lambda: input().split()
# コード ---
N, M = MI()
A = LI()
sets = [set() for _ in range(N)]
for i, a in enumerate(A, start=1):
for j in range(a % i, N, i):
sets[j].add((j - a) // i)
for i in range(1, M+1):
is_ok = False
for j in range(N):
if i not in sets[j]:
print(j)
is_ok = True
break
if not is_ok:
print(N)
| ConDefects/ConDefects/Code/abc272_e/Python/45511246 |
condefects-python_data_2825 | n, m = map(int, input().split())
a = list(map(int, input().split()))
d = [set() for _ in range(m)]
for i in range(n):
delta = -(i+1)//a[i] - 2
for j in range(max(0, delta), m):
tmp = (i+1)*(j+1)+a[i]
if tmp > n+1:
break
if 0 <= tmp:
d[j].add(tmp)
ans = [0]*m
for i in range(m):
for j in range(len(d[i])+2):
if j not in d[i]:
ans[i] = j
break
print(*ans, sep='\n')
n, m = map(int, input().split())
a = list(map(int, input().split()))
d = [set() for _ in range(m)]
for i in range(n):
delta = -a[i]//(i+1) - 1
for j in range(max(0, delta), m):
tmp = (i+1)*(j+1)+a[i]
if tmp > n+1:
break
if 0 <= tmp:
d[j].add(tmp)
ans = [0]*m
for i in range(m):
for j in range(len(d[i])+2):
if j not in d[i]:
ans[i] = j
break
print(*ans, sep='\n')
| ConDefects/ConDefects/Code/abc272_e/Python/45528883 |
condefects-python_data_2826 | N, M = map(int, input().split())
A = list(map(int, input().split()))
B: "list[set]" = [set() for _ in range(M+1)]
for i in range(N):
for k in range(max(1, -(A[i]//(i+1))), min(M+1, ((N-A[i])//(i+1)))):
B[k].add(A[i]+(i+1)*k)
for i in range(1, M+1):
C = sorted(B[i])
for j in range(len(C)):
if C[j] != j:
print(j)
break
else:
print(len(C))
N, M = map(int, input().split())
A = list(map(int, input().split()))
B: "list[set]" = [set() for _ in range(M+1)]
for i in range(N):
for k in range(max(1, -(A[i]//(i+1))), min(M, -((A[i]-N)//(i+1))-1)+1):
B[k].add(A[i]+(i+1)*k)
for i in range(1, M+1):
C = sorted(B[i])
for j in range(len(C)):
if C[j] != j:
print(j)
break
else:
print(len(C)) | ConDefects/ConDefects/Code/abc272_e/Python/45548360 |
condefects-python_data_2827 | import io
import sys
import pdb
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
sys.setrecursionlimit(10**6)
from bisect import bisect_right, bisect_left
from math import gcd
import math
_INPUT = """\
6
3
3 5 10
4 3 3
2 2 6
3
3 5 10
4 3 3
2 2 3
2
4 8
3 1 100
4 10000 100
"""
inf=10**4
def solve(test):
N=int(input())
D=list(map(int, input().split()))
L1,C1,K1=list(map(int, input().split()))
L2,C2,K2=list(map(int, input().split()))
dp=[inf]*(N+1)*(K1+1)
dp[0]=0
def idx(i, j):
return i*(K1+1)+j
for i in range(N):
for j in range(K1+1):
for k in range(j+1):
dp[idx(i+1, j)]=min(dp[idx(i+1, j)], dp[idx(i, j-k)]+max((D[i]-k*L1-1)//L2+1,0))
ans=10*100
for i in range(K1+1):
if dp[idx(N, i)]<=K2:
ans=min(ans, i*C1+dp[idx(N, i)]*C2)
if ans==10**100: ans=-1
if test==0:
print(ans)
else:
return None
def random_input():
from random import randint,shuffle
N=randint(1,10)
M=randint(1,N)
A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
shuffle(A)
return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3
def simple_solve():
return []
def main(test):
if test==0:
solve(0)
elif test==1:
sys.stdin = io.StringIO(_INPUT)
case_no=int(input())
for _ in range(case_no):
solve(0)
else:
for i in range(1000):
sys.stdin = io.StringIO(random_input())
x=solve(1)
y=simple_solve()
if x!=y:
print(i,x,y)
print(*[line for line in sys.stdin],sep='')
break
#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)
import io
import sys
import pdb
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
sys.setrecursionlimit(10**6)
from bisect import bisect_right, bisect_left
from math import gcd
import math
_INPUT = """\
6
3
3 5 10
4 3 3
2 2 6
3
3 5 10
4 3 3
2 2 3
2
4 8
3 1 100
4 10000 100
"""
inf=10**4
def solve(test):
N=int(input())
D=list(map(int, input().split()))
L1,C1,K1=list(map(int, input().split()))
L2,C2,K2=list(map(int, input().split()))
dp=[inf]*(N+1)*(K1+1)
dp[0]=0
def idx(i, j):
return i*(K1+1)+j
for i in range(N):
for j in range(K1+1):
for k in range(j+1):
dp[idx(i+1, j)]=min(dp[idx(i+1, j)], dp[idx(i, j-k)]+max((D[i]-k*L1-1)//L2+1,0))
ans=10**100
for i in range(K1+1):
if dp[idx(N, i)]<=K2:
ans=min(ans, i*C1+dp[idx(N, i)]*C2)
if ans==10**100: ans=-1
if test==0:
print(ans)
else:
return None
def random_input():
from random import randint,shuffle
N=randint(1,10)
M=randint(1,N)
A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
shuffle(A)
return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3
def simple_solve():
return []
def main(test):
if test==0:
solve(0)
elif test==1:
sys.stdin = io.StringIO(_INPUT)
case_no=int(input())
for _ in range(case_no):
solve(0)
else:
for i in range(1000):
sys.stdin = io.StringIO(random_input())
x=solve(1)
y=simple_solve()
if x!=y:
print(i,x,y)
print(*[line for line in sys.stdin],sep='')
break
#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0) | ConDefects/ConDefects/Code/abc325_f/Python/47205844 |
condefects-python_data_2828 | import math
import sys
sys.setrecursionlimit(500_000)
from collections import defaultdict
n = int(input())
d = list(map(int, input().split()))
l, c, k = [0] * 2, [0] * 2, [0] * 2
for i in range(2):
l[i], c[i], k[i] = map(int, input().split())
dp = [float('inf')] * (k[0] + 1)
dp[0] = 0
for di in d:
newdp = [float('inf')] * (k[0] + 1)
limit0 = (di + l[0] - 1) // l[0]
for i0, v in enumerate(dp):
for i in range(0, min(limit0, k[0] - i0) + 1):
j = (di - l[0] * i + l[1] - 1) // l[1]
v1 = v + j
if v1 <= k[1] and v1 < newdp[i0 + i]:
newdp[i0 + i] = v1
dp = newdp
ans = float('inf')
for i, v in enumerate(dp):
ans = min(ans, i * c[0] + v * c[1])
if ans == float('inf'):
ans = -1
print(ans)
import math
import sys
sys.setrecursionlimit(500_000)
from collections import defaultdict
n = int(input())
d = list(map(int, input().split()))
l, c, k = [0] * 2, [0] * 2, [0] * 2
for i in range(2):
l[i], c[i], k[i] = map(int, input().split())
dp = [float('inf')] * (k[0] + 1)
dp[0] = 0
for di in d:
newdp = [float('inf')] * (k[0] + 1)
limit0 = (di + l[0] - 1) // l[0]
for i0, v in enumerate(dp):
for i in range(0, min(limit0, k[0] - i0) + 1):
j = max(0, (di - l[0] * i + l[1] - 1) // l[1])
v1 = v + j
if v1 <= k[1] and v1 < newdp[i0 + i]:
newdp[i0 + i] = v1
dp = newdp
ans = float('inf')
for i, v in enumerate(dp):
ans = min(ans, i * c[0] + v * c[1])
if ans == float('inf'):
ans = -1
print(ans)
| ConDefects/ConDefects/Code/abc325_f/Python/47320684 |
condefects-python_data_2829 | N=int(input())
D=list(map(int, input().split()))
l1,c1,k1=list(map(int, input().split()))
l2,c2,k2=list(map(int, input().split()))
dp=[[10**5]*(k1+1) for _ in range(N+1)]
dp[0][0]=0
for i in range(1,N+1):
K=-((-D[i-1])//l1)
for j in range(k1+1):
for k in range(K+1):
if j+k>k1:
break
r=max(0,D[i-1]-k*l1)
KK = -((-r)//l2)
dp[i][j+k]=min(dp[i][j+k],dp[i-1][j]+KK)
ans=10**30
for i in range(k1+1):
if dp[-1][i]>k2 or dp[-1][i]==10**5:
continue
ans=i*c1+dp[-1][i]*c2
if ans==10**30:
print(-1)
else:
print(ans)
N=int(input())
D=list(map(int, input().split()))
l1,c1,k1=list(map(int, input().split()))
l2,c2,k2=list(map(int, input().split()))
dp=[[10**5]*(k1+1) for _ in range(N+1)]
dp[0][0]=0
for i in range(1,N+1):
K=-((-D[i-1])//l1)
for j in range(k1+1):
for k in range(K+1):
if j+k>k1:
break
r=max(0,D[i-1]-k*l1)
KK = -((-r)//l2)
dp[i][j+k]=min(dp[i][j+k],dp[i-1][j]+KK)
ans=10**30
for i in range(k1+1):
if dp[-1][i]>k2 or dp[-1][i]==10**5:
continue
ans=min(ans,i*c1+dp[-1][i]*c2)
if ans==10**30:
print(-1)
else:
print(ans) | ConDefects/ConDefects/Code/abc325_f/Python/52623489 |
condefects-python_data_2830 | 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
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#sys.set_int_max_str_digits(10**9)
N=int(readline())
D=list(map(int,readline().split()))
L0,C0,K0=map(int,readline().split())
L1,C1,K1=map(int,readline().split())
inf=1<<30
dp=[0]*(K0+1)
for d in D:
prev=dp
dp=[inf]*(K0+1)
for k in range(K0+1):
for kk in range(k,K0+1):
dp[kk]=min(dp[kk],prev[k]+max(0,d-(kk-k)*L0+L1-1)//L1)
ans=inf
for k0 in range(K0+1):
k1=dp[k0]
if k1<=K1:
ans=min(ans,k0*C0+k1*C1)
if ans==inf:
ans=-1
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
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#sys.set_int_max_str_digits(10**9)
N=int(readline())
D=list(map(int,readline().split()))
L0,C0,K0=map(int,readline().split())
L1,C1,K1=map(int,readline().split())
inf=1<<60
dp=[0]*(K0+1)
for d in D:
prev=dp
dp=[inf]*(K0+1)
for k in range(K0+1):
for kk in range(k,K0+1):
dp[kk]=min(dp[kk],prev[k]+max(0,d-(kk-k)*L0+L1-1)//L1)
ans=inf
for k0 in range(K0+1):
k1=dp[k0]
if k1<=K1:
ans=min(ans,k0*C0+k1*C1)
if ans==inf:
ans=-1
print(ans) | ConDefects/ConDefects/Code/abc325_f/Python/47165263 |
condefects-python_data_2831 | def solve():
n=int(input())
A=list(map(int,input().split()))
l1,c1,k1=map(int,input().split())
l2,c2,k2=map(int,input().split())
dp=[[0,0]]
for a in A:
cur=[]
d1=(a+l1-1)//l1
for x in range(d1+1):
y=(a-l1*x+l2-1)//l2
for nx,ny in dp:
if nx+x<=k1 and ny+y<=k2:
cur.append([nx+x,ny+y])
cur.sort()
dp=[]
for x,y in cur:
if not dp or dp[-1][1]>y:
dp.append([x,y])
if not dp:
print(-1)
return
ans=10**20
for a,b in dp:
ans=min(ans,a*c1+b*c2)
print(ans)
for _ in range(1):
solve()
def solve():
n=int(input())
A=list(map(int,input().split()))
l1,c1,k1=map(int,input().split())
l2,c2,k2=map(int,input().split())
dp=[[0,0]]
for a in A:
cur=[]
d1=(a+l1-1)//l1
for x in range(d1+1):
y=max(0,(a-l1*x+l2-1)//l2)
for nx,ny in dp:
if nx+x<=k1 and ny+y<=k2:
cur.append([nx+x,ny+y])
cur.sort()
dp=[]
for x,y in cur:
if not dp or dp[-1][1]>y:
dp.append([x,y])
if not dp:
print(-1)
return
ans=10**20
for a,b in dp:
ans=min(ans,a*c1+b*c2)
print(ans)
for _ in range(1):
solve() | ConDefects/ConDefects/Code/abc325_f/Python/49397229 |
condefects-python_data_2832 | import sys
from collections import deque
input = sys.stdin.readline
LN = 1111111
def cnt(d):
ret = []
s,k = 0,0
if d%s1[0] == 0: s = d//s1[0]
else: s = d//s1[0]+1
ssum = s1[0]*s
remain = d-ssum
ret.append([s,0])
while s >= 0:
s -= 1
remain += s1[0]
if remain %s2[0] == 0: k = remain//s2[0]
else: k = remain//s2[0]+1
ret.append([s,k])
return ret
N = int(input())
D = list(map(int,input().split()))
s1 = list(map(int,input().split())) #Len,Cost,K
s2 = list(map(int,input().split()))
ans = 10**24
dp = [LN]*(s1[2]+1) # idx : num of s1, val : num of s2
que = cnt(D[0])
for a,b in que:
if a > s1[2] or b > s2[2]: continue
dp[a] = b
for i in range(1,N):
tmp = [LN]*(s1[2]+1)
que = cnt(D[i])
for idx,val in enumerate(dp):
if val == LN: continue
for a,b in que:
if idx+a > s1[2] or val+b > s2[2]: continue
tmp[idx+a] = min(tmp[idx+a],val+b)
dp = tmp
if dp.count(LN) == s1[2]+1: print(-1)
else:
for i,j in enumerate(dp):
if j == LN: continue
ans = min(ans,i*s1[1]+j*s2[1])
print(ans)
import sys
from collections import deque
input = sys.stdin.readline
LN = 1111111
def cnt(d):
ret = []
s,k = 0,0
if d%s1[0] == 0: s = d//s1[0]
else: s = d//s1[0]+1
ssum = s1[0]*s
remain = d-ssum
ret.append([s,0])
while s > 0:
s -= 1
remain += s1[0]
if remain %s2[0] == 0: k = remain//s2[0]
else: k = remain//s2[0]+1
ret.append([s,k])
return ret
N = int(input())
D = list(map(int,input().split()))
s1 = list(map(int,input().split())) #Len,Cost,K
s2 = list(map(int,input().split()))
ans = 10**24
dp = [LN]*(s1[2]+1) # idx : num of s1, val : num of s2
que = cnt(D[0])
for a,b in que:
if a > s1[2] or b > s2[2]: continue
dp[a] = b
for i in range(1,N):
tmp = [LN]*(s1[2]+1)
que = cnt(D[i])
for idx,val in enumerate(dp):
if val == LN: continue
for a,b in que:
if idx+a > s1[2] or val+b > s2[2]: continue
tmp[idx+a] = min(tmp[idx+a],val+b)
dp = tmp
if dp.count(LN) == s1[2]+1: print(-1)
else:
for i,j in enumerate(dp):
if j == LN: continue
ans = min(ans,i*s1[1]+j*s2[1])
print(ans) | ConDefects/ConDefects/Code/abc325_f/Python/47338119 |
condefects-python_data_2833 | N,P,Q,R,S = map(int, input().split())
A = list(map(int, input().split()))
ans = A[:P-1] + A[R-1:S] + A[P-1:Q] + A[S:]
print(*ans)
N,P,Q,R,S = map(int, input().split())
A = list(map(int, input().split()))
ans = A[:P-1] + A[R-1:S] + A[Q:R-1]+ A[P-1:Q] + A[S:]
print(*ans) | ConDefects/ConDefects/Code/abc286_a/Python/45028040 |
condefects-python_data_2834 | # 入力の受け取り
N,P,Q,R,S=map(int, input().split())
# 最初に[0]を埋めて番号をずらす
A=[0]+list(map(int, input().split()))
# 1~P-1
A1=A[1:P]
# P~Q
A2=A[P:Q+1]
# Q+1~R-1
A3=A[Q+1:R]
# R~S
A4=A[R:S+1]
# S+1~N
A5=A[S+1:N+1]
# つなげる
B=A1+A4+A3+A2+A5
# 出力(「*」をつけるとかっこなしで出力できる)
print(B)
# 入力の受け取り
N,P,Q,R,S=map(int, input().split())
# 最初に[0]を埋めて番号をずらす
A=[0]+list(map(int, input().split()))
# 1~P-1
A1=A[1:P]
# P~Q
A2=A[P:Q+1]
# Q+1~R-1
A3=A[Q+1:R]
# R~S
A4=A[R:S+1]
# S+1~N
A5=A[S+1:N+1]
# つなげる
B=A1+A4+A3+A2+A5
# 出力(「*」をつけるとかっこなしで出力できる)
print(*B) | ConDefects/ConDefects/Code/abc286_a/Python/45537297 |
condefects-python_data_2835 | s = input()
A = [int(x) for x in s]
for i in range(1, 10):
if i not in A:
print(i)
exit()
s = input()
A = [int(x) for x in s]
for i in range(10):
if i not in A:
print(i)
exit()
| ConDefects/ConDefects/Code/abc248_a/Python/45470045 |
condefects-python_data_2836 | S = input()
num = set([i for i in range(1, 10)])
for s in S:
num.discard(int(s))
print(*num)
S = input()
num = set([i for i in range(0, 10)])
for s in S:
num.discard(int(s))
print(*num)
| ConDefects/ConDefects/Code/abc248_a/Python/45497568 |
condefects-python_data_2837 | n = int(input())
xy = []
for i in range(n):
i, j = map(int, input().split())
xy.append((i, j))
s = input()
from collections import defaultdict
r_ok = defaultdict(bool)
l_ok = defaultdict(bool)
for i in range(n):
x, y = xy[i]
if s[i] == "R":
if not r_ok[y]:
r_ok[y] = x
else:
r_ok[y] = min(r_ok[y], x)
else:
if not l_ok[y]:
l_ok[y] = x
else:
l_ok[y] = max(l_ok[y], x)
for x, y in xy:
if r_ok[y] < l_ok[y]:
print("Yes")
exit()
print("No")
n = int(input())
xy = []
for i in range(n):
i, j = map(int, input().split())
xy.append((i, j))
s = input()
from collections import defaultdict
r_ok = defaultdict(bool)
l_ok = defaultdict(bool)
for i in range(n):
x, y = xy[i]
if s[i] == "R":
if not r_ok[y]:
r_ok[y] = x
else:
r_ok[y] = min(r_ok[y], x)
else:
if not l_ok[y]:
l_ok[y] = x
else:
l_ok[y] = max(l_ok[y], x)
for x, y in xy:
if y not in r_ok or y not in l_ok:
continue
if r_ok[y] < l_ok[y]:
print("Yes")
exit()
print("No") | ConDefects/ConDefects/Code/abc243_c/Python/45235100 |
condefects-python_data_2838 | N = int(input())
people = [list(map(int, input().split())) for _ in range(N)]
S = input()
r_hash = {}
l_hash = {}
flag = False
for i, (xy, moji)in enumerate(zip(people, S)):
# print(i, xy, moji)
x = xy[0]
y = xy[1]
if moji == 'R':
if l_hash.get(y, 0) > x:
flag = True
break
elif r_hash.get(y, float('inf')) > x:
r_hash[y] = x
else:
if r_hash.get(y, float('inf')) < x:
flag = True
break
elif l_hash.get(y, 0) < x:
r_hash[y] = x
if flag:
print("Yes")
else:
print("No")
N = int(input())
people = [list(map(int, input().split())) for _ in range(N)]
S = input()
r_hash = {}
l_hash = {}
flag = False
for i, (xy, moji)in enumerate(zip(people, S)):
# print(i, xy, moji)
x = xy[0]
y = xy[1]
if moji == 'R':
if l_hash.get(y, 0) > x:
flag = True
break
elif r_hash.get(y, float('inf')) > x:
r_hash[y] = x
else:
if r_hash.get(y, float('inf')) < x:
flag = True
break
elif l_hash.get(y, 0) < x:
l_hash[y] = x
if flag:
print("Yes")
else:
print("No") | ConDefects/ConDefects/Code/abc243_c/Python/44922035 |
condefects-python_data_2839 | n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
s = input()
y = {}
for i in range(n):
xi, yi = xy[i]
y.setdefault(yi, [])
y[yi].append([xi, s[i]])
ans = 'No'
for i in y:
yi = y[i]
for j in range(len(yi)-1):
if yi[j][1] == 'R' and yi[j+1][1] == 'L':
ans = 'Yes'
print(ans)
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
s = input()
y = {}
for i in range(n):
xi, yi = xy[i]
y.setdefault(yi, [])
y[yi].append([xi, s[i]])
ans = 'No'
for i in y:
yi = sorted(y[i])
for j in range(len(yi)-1):
if yi[j][1] == 'R' and yi[j+1][1] == 'L':
ans = 'Yes'
print(ans) | ConDefects/ConDefects/Code/abc243_c/Python/45244721 |
condefects-python_data_2840 | import collections
N=int(input())
XY=[list(map(int,input().split())) for i in range(N)]
lx=collections.defaultdict(list)
rx=collections.defaultdict(list)
S=input()
for i in range(N):
x,y=XY[i]
if S[i]=="L":
lx[y].append(x)
else:
rx[y].append(x)
ans=False
for y in lx:
ans|=y in rx and max(lx)>min(rx)
if ans:
print("Yes")
else:
print("No")
import collections
N=int(input())
XY=[list(map(int,input().split())) for i in range(N)]
lx=collections.defaultdict(list)
rx=collections.defaultdict(list)
S=input()
for i in range(N):
x,y=XY[i]
if S[i]=="L":
lx[y].append(x)
else:
rx[y].append(x)
ans=False
for y in lx:
ans|=y in rx and max(lx[y])>min(rx[y])
if ans:
print("Yes")
else:
print("No")
| ConDefects/ConDefects/Code/abc243_c/Python/45332491 |
condefects-python_data_2841 | N = int(input())
P = list(map(int, input().split()))
dp = [[-1<<60] * (N + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(1, N + 1):
p = P[i - 1]
for j in range(N + 1):
dp[i][j] = max(dp[i][j], dp[i - 1][j])
if j - 1 >= 0:
dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] * 0.9 + p)
base = 1
ans = -1<<60
for i in range(1, N + 1):
val = dp[-1][i] / base - 1200/(i**0.5)
ans = max(ans, val)
base *= 0.9
base += 1
print(ans)
N = int(input())
P = list(map(int, input().split()))
dp = [[-1<<60] * (N + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(1, N + 1):
p = P[i - 1]
for j in range(i + 1):
dp[i][j] = max(dp[i][j], dp[i - 1][j])
if j - 1 >= 0:
dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] * 0.9 + p)
base = 1
ans = -1<<60
for i in range(1, N + 1):
val = dp[-1][i] / base - 1200/(i**0.5)
ans = max(ans, val)
base *= 0.9
base += 1
print(ans) | ConDefects/ConDefects/Code/abc327_e/Python/51999062 |
condefects-python_data_2842 | import sys
import math
import os
import copy
import time
from fractions import Fraction
import copy
import sys
from collections import defaultdict
from math import sqrt
from decimal import Decimal, getcontext
if os.getenv('ENVIRONMENT') == 'local':
sys.stdin = open("input.txt", "r")
sys.stdout = open("output.txt", "w")
sys.stderr = open("error.txt", "w")
def ra(a):
return range(a)
def en(a):
return enum(a)
def mat(n,m):
return [[0 for _ in range(m)] for _ in range(n)]
def help(n):
if os.getenv('ENVIRONMENT') == 'local':
print("siu:",n)
# map(int,input().split())
# int(input())
# for index, value in reversed(list(enumerate(my_list))):
# for index, value in enumerate(my_list)):map(int,input().split())
# for l in sys.stdin:
# list append:siu.append(j)
# map : mp = {"pink": 0, "blue": -1e9}
# log is naturally ln if not specified
# lines = sys.stdin.readlines()
# try: except EOFError: break
# def compute_poly(x):
# nonlocal a
# Remove the last element of the list removed_element = my_list.pop()
# new_string = my_string[:-1] # Remove the last character
# math.gcd
def solve():
n = int(input())
v = list(map(int,input().split()))
dp = [0.0 for i in range(n+1)]
for i in range(0,n):
for j in range(i+1, 0, -1):
dp[j] = max(dp[j], dp[j-1]*0.9+v[i])
ans = 0
for i, j in enumerate(dp):
if i == 0:
continue
ans = max(ans, j/(1-0.9**i)*(1-0.9)-1200/(i**0.5))
print(ans)
start_time = time.time()
# t = int(input())
# for i in range(t):
solve()
if os.getenv('ENVIRONMENT') == 'local':
elapsed_time = time.time() - start_time
print("Timepy:", elapsed_time, "seconds")
import sys
import math
import os
import copy
import time
from fractions import Fraction
import copy
import sys
from collections import defaultdict
from math import sqrt
from decimal import Decimal, getcontext
if os.getenv('ENVIRONMENT') == 'local':
sys.stdin = open("input.txt", "r")
sys.stdout = open("output.txt", "w")
sys.stderr = open("error.txt", "w")
def ra(a):
return range(a)
def en(a):
return enum(a)
def mat(n,m):
return [[0 for _ in range(m)] for _ in range(n)]
def help(n):
if os.getenv('ENVIRONMENT') == 'local':
print("siu:",n)
# map(int,input().split())
# int(input())
# for index, value in reversed(list(enumerate(my_list))):
# for index, value in enumerate(my_list)):map(int,input().split())
# for l in sys.stdin:
# list append:siu.append(j)
# map : mp = {"pink": 0, "blue": -1e9}
# log is naturally ln if not specified
# lines = sys.stdin.readlines()
# try: except EOFError: break
# def compute_poly(x):
# nonlocal a
# Remove the last element of the list removed_element = my_list.pop()
# new_string = my_string[:-1] # Remove the last character
# math.gcd
def solve():
n = int(input())
v = list(map(int,input().split()))
dp = [0.0 for i in range(n+1)]
for i in range(0,n):
for j in range(i+1, 0, -1):
dp[j] = max(dp[j], dp[j-1]*0.9+v[i])
ans = -1e18
for i, j in enumerate(dp):
if i == 0:
continue
ans = max(ans, j/(1-0.9**i)*(1-0.9)-1200/(i**0.5))
print(ans)
start_time = time.time()
# t = int(input())
# for i in range(t):
solve()
if os.getenv('ENVIRONMENT') == 'local':
elapsed_time = time.time() - start_time
print("Timepy:", elapsed_time, "seconds")
| ConDefects/ConDefects/Code/abc327_e/Python/54954766 |
condefects-python_data_2843 | import codecs
import copy
import heapq as hq
import itertools
import math
import pprint as pp
import random
import statistics
import time
from bisect import bisect_left, bisect_right, insort
from collections import Counter
from collections import defaultdict as dd
from collections import deque
from functools import lru_cache, reduce
from sys import setrecursionlimit, stdin
from typing import Generic, Iterable, Iterator, List, TypeVar, Union
N=int(input())
P=list(map(int,input().split()))
dp=[-float("inf")]*N
dp[0]=P[0]
for i in range(1,N):
dpnxt=[-float("inf")]*N
for j in range(N):
if j==0:
dpnxt[j]=max(dp[j],dpnxt[i])
else:
dpnxt[j]=max(dp[j-1]*0.9+P[i],dp[j])
dp=dpnxt
num=1
ans=-float("inf")
for i in range(N):
myans=dp[i]/num-1200/((i+1)**0.5)
ans=max(ans,myans)
num*=0.9
num+=1
print(ans)
import codecs
import copy
import heapq as hq
import itertools
import math
import pprint as pp
import random
import statistics
import time
from bisect import bisect_left, bisect_right, insort
from collections import Counter
from collections import defaultdict as dd
from collections import deque
from functools import lru_cache, reduce
from sys import setrecursionlimit, stdin
from typing import Generic, Iterable, Iterator, List, TypeVar, Union
N=int(input())
P=list(map(int,input().split()))
dp=[-float("inf")]*N
dp[0]=P[0]
for i in range(1,N):
dpnxt=[-float("inf")]*N
for j in range(N):
if j==0:
dpnxt[j]=max(dp[j],P[i])
else:
dpnxt[j]=max(dp[j-1]*0.9+P[i],dp[j])
dp=dpnxt
num=1
ans=-float("inf")
for i in range(N):
myans=dp[i]/num-1200/((i+1)**0.5)
ans=max(ans,myans)
num*=0.9
num+=1
print(ans)
| ConDefects/ConDefects/Code/abc327_e/Python/54952693 |
condefects-python_data_2844 | X,A,D,N=map(int,input().split())
if D==0:
if A==X:
print(0)
else:
print(abs(X-A))
exit()
X-=A
a0=0
an=D*(N-1)
if D>=1:
if not a0<=X<=an:
print(min(abs(a0-X),abs(an-X)))
else:
print(min(X%D,D-X%D))
else:
if not an<=X<=a0:
print(min(abs(a0-X),abs(an-X)))
else:
print(min(X%D,D-X%D))
X,A,D,N=map(int,input().split())
if D==0:
if A==X:
print(0)
else:
print(abs(X-A))
exit()
X-=A
a0=0
an=D*(N-1)
if D>=1:
if not a0<=X<=an:
print(min(abs(a0-X),abs(an-X)))
else:
print(min(X%D,D-X%D))
else:
if not an<=X<=a0:
print(min(abs(a0-X),abs(an-X)))
else:
print(min(abs(X%D),abs(D-X%D))) | ConDefects/ConDefects/Code/abc255_c/Python/45066751 |
condefects-python_data_2845 | X,A,D,N = map(int,input().split())
min = min(A,A + D*(N-1))
max = max(A,A + D*(N-1))
if X >= max:
print(X-max)
exit()
if X <= min:
print(min-X)
exit()
ans = abs(X-A)%abs(D)
li = [ans,D-ans]
if li[0] < li[1]:
print(li[0])
else:
print(li[1])
X,A,D,N = map(int,input().split())
min = min(A,A + D*(N-1))
max = max(A,A + D*(N-1))
if X >= max:
print(X-max)
exit()
if X <= min:
print(min-X)
exit()
ans = abs(X-A)%abs(D)
li = [ans,abs(D)-ans]
if li[0] < li[1]:
print(li[0])
else:
print(li[1]) | ConDefects/ConDefects/Code/abc255_c/Python/44917866 |
condefects-python_data_2846 | X, A, D, N = [int(x) for x in input().split()]
if D == 0:
print(abs(X - A))
else:
X -= A
if D < 0:
D = -D
X = -X
if 0 < X <= D*(N - 1):
print(min(X % D, D - X % D))
elif X < 0:
print(-X)
else:
print(X - D*(N - 1))
X, A, D, N = [int(x) for x in input().split()]
if D == 0:
print(abs(X - A))
else:
X -= A
if D < 0:
D = -D
X = -X
if 0 <= X <= D*(N - 1):
print(min(X % D, D - X % D))
elif X < 0:
print(-X)
else:
print(X - D*(N - 1))
| ConDefects/ConDefects/Code/abc255_c/Python/45934299 |
condefects-python_data_2847 | x, a, d, n = map(int, input().split())
def func(i):
return d * (i - 1) + a
result = -1
left = 1
right = n
if d == 0:
result = min(abs(a - x), abs(x - a))
elif d > 0:
while left < right:
m = (left + right) // 2
if func(m) < x:
left = m + 1
else:
right = m - 1
"""
print(left, right)
print(f"func(left) = {func(left)}")
print(f"func(right) = {func(right)}")
"""
if 1 < left < n:
result = min(min(min(abs(x - func(left)), abs(func(left) - x)), min(abs(x - func(left + 1)), abs(func(left + 1) - x))), min(abs(x - func(left - 1)), abs(func(left - 1) - x)))
elif left == n:
result = min(min(abs(x - func(left)), abs(func(left) - x)), min(abs(x - func(left - 1)), abs(func(left - 1) - x)))
elif left == 1:
result = min(min(abs(x - func(left)), abs(func(left) - x)), min(abs(x - func(left + 1)), abs(func(left + 1) - x)))
elif d < 0:
while left < right:
m = (left + right) // 2
if func(m) < x:
right = m - 1
else:
left = m + 1
if 1 < left < n:
result = min(min(min(abs(x - func(left)), abs(func(left) - x)), min(abs(x - func(left + 1)), abs(func(left + 1) - x))), min(abs(x - func(left - 1)), abs(func(left - 1) - x)))
elif left == n:
result = min(min(abs(x - func(left)), abs(func(left) - x)), min(abs(x - func(left - 1)), abs(func(left - 1) - x)))
elif left == 1:
result = min(min(abs(x - func(left)), abs(func(left) - x)), min(abs(x - func(left + 1)), abs(func(left + 1) - x)))
print(result)
x, a, d, n = map(int, input().split())
def func(i):
return d * (i - 1) + a
result = -1
left = 1
right = n
if d == 0 or n == 1:
result = min(abs(a - x), abs(x - a))
elif d > 0:
while left < right:
m = (left + right) // 2
if func(m) < x:
left = m + 1
else:
right = m - 1
"""
print(left, right)
print(f"func(left) = {func(left)}")
print(f"func(right) = {func(right)}")
"""
if 1 < left < n:
result = min(min(min(abs(x - func(left)), abs(func(left) - x)), min(abs(x - func(left + 1)), abs(func(left + 1) - x))), min(abs(x - func(left - 1)), abs(func(left - 1) - x)))
elif left == n:
result = min(min(abs(x - func(left)), abs(func(left) - x)), min(abs(x - func(left - 1)), abs(func(left - 1) - x)))
elif left == 1:
result = min(min(abs(x - func(left)), abs(func(left) - x)), min(abs(x - func(left + 1)), abs(func(left + 1) - x)))
elif d < 0:
while left < right:
m = (left + right) // 2
if func(m) < x:
right = m - 1
else:
left = m + 1
if 1 < left < n:
result = min(min(min(abs(x - func(left)), abs(func(left) - x)), min(abs(x - func(left + 1)), abs(func(left + 1) - x))), min(abs(x - func(left - 1)), abs(func(left - 1) - x)))
elif left == n:
result = min(min(abs(x - func(left)), abs(func(left) - x)), min(abs(x - func(left - 1)), abs(func(left - 1) - x)))
elif left == 1:
result = min(min(abs(x - func(left)), abs(func(left) - x)), min(abs(x - func(left + 1)), abs(func(left + 1) - x)))
print(result)
| ConDefects/ConDefects/Code/abc255_c/Python/45282104 |
condefects-python_data_2848 | X,A,D,N = map(int,input().split())
X2 = X
X -= A
if D == 0:
print(abs(X))
else:
M = X // D
P = X % D
if 0 <= M < N-1:
print(min(abs(P),abs(D-P)))
elif N-1 <= M:
print(X2 - (A + D*(N-1)))
elif M < 0:
print(abs(A - X2))
X,A,D,N = map(int,input().split())
X2 = X
X -= A
if D == 0:
print(abs(X))
else:
M = X // D
P = X % D
if 0 <= M < N-1:
print(min(abs(P),abs(D-P)))
elif N-1 <= M:
print(abs(X2 - (A + D*(N-1))))
elif M < 0:
print(abs(A - X2)) | ConDefects/ConDefects/Code/abc255_c/Python/44681612 |
condefects-python_data_2849 | 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()))
LI_DEC = lambda : list(map(lambda x : int(x)-1, input().split()))
X, A, D, N = MI()
def a(n):
return A + (n - 1) * D
if D == 0:
print(abs(A - X))
exit(0)
i = max(1, (X - A + D) // D)
ans = abs(a(i) - X)
if i + 1 <= N:
ans = min(ans, abs(a(i+1) - X))
print(ans)
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()))
LI_DEC = lambda : list(map(lambda x : int(x)-1, input().split()))
X, A, D, N = MI()
def a(n):
return A + (n - 1) * D
if D == 0:
print(abs(A - X))
exit(0)
i = min(max(1, (X - A + D) // D), N)
ans = abs(a(i) - X)
if i + 1 <= N:
ans = min(ans, abs(a(i+1) - X))
print(ans) | ConDefects/ConDefects/Code/abc255_c/Python/45522180 |
condefects-python_data_2850 | X, A, D, N = map(int, input().split())
if D == 0:
print(abs(X-A))
exit()
if D > 0:
if X < A:
print(A-X)
elif A+D*(N-1) < X:
print(X-(A+D*(N-1)))
else:
print(min(abs((X-A)%D), D-abs((X-A)%D)))
else:
if X > A:
print(X-A)
elif A+D*(N-1) > X:
print((A+D*(N-1))-X)
else:
print(min(abs((X-A)%D), abs((X-A)%D)-D))
X, A, D, N = map(int, input().split())
if D == 0:
print(abs(X-A))
exit()
if D > 0:
if X < A:
print(A-X)
elif A+D*(N-1) < X:
print(X-(A+D*(N-1)))
else:
print(min(abs((X-A)%D), D-abs((X-A)%D)))
else:
if X > A:
print(X-A)
elif A+D*(N-1) > X:
print((A+D*(N-1))-X)
else:
print(min(abs((X-A)%D), abs((X-A)%D-D))) | ConDefects/ConDefects/Code/abc255_c/Python/45907671 |
condefects-python_data_2851 | # import sys
# sys.setrecursionlimit(10**7)
import re
import copy
import bisect
import math
import itertools
import more_itertools
from collections import deque
from collections import defaultdict
from collections import Counter
from heapq import heapify, heappush, heappop, heappushpop, heapreplace
from functools import cmp_to_key as cmpk
import functools
al = "abcdefghijklmnopqrstuvwxyz"
au = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
def ii():
return int(input())
def gl():
return list(map(int, input().split()))
def gs():
return list(input().split())
def gr(l):
res = itertools.groupby(l)
return list([(key, len(list(v))) for key, v in res])
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
def __str__(self):
return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
def glm(h,w):
a = []
for i in range(h):
a.append(gl())
return a
def gsm(h,w):
a = []
for i in range(h):
a.append(input().split())
return a
def kiriage(n, r):
if n % r == 0:
return n // r
else:
return (n // r) + 1
def next_perm(a):
l = copy.copy(a)
l = list(l)
i = len(l) - 2
while 0 <= i and l[i] >= l[i+1]:
i -= 1
if i == 1:
return False
j = len(l) - 1
while not (l[i] < l[j]):
j -= 1
l[i], l[j] = l[j], l[i]
return l[:i+1] + rev(l[i+1:])
def yaku(n):
ans = []
for i in range(1, int(math.sqrt(n)) + 1):
if n % i == 0:
ans.append(i)
ans.append(n // i)
return ans
def ketawa(n):
ans = 0
s = str(n)
for i in s:
ans += int(i)
return ans
def rev(a):
a = a[:]
return list(reversed(a))
def lcm2(x, y):
return (x * y) // math.gcd(x, y)
def lcm3(*ints):
return functools.reduce(lcm2, ints)
def gcd3(*ints):
return functools.reduce(math.gcd, ints)
def cntsep(a, b, k):
r = a % k
m = a - r
ans = (b - m) // (k+1)
if r > 0:
ans -= 1
return ans
def putedges(g, idx = 0):
n = len(g)
e = []
cnt2 = 0
for i in range(n):
for j in g[i]:
cnt2 += 1
e.append((i, j))
m = len(g)
print(n, cnt2)
for i in e:
if idx == 0:
print(*[i[0], i[1]])
else:
print(*[i[0] + 1, i[1] + 1])
def drev(d):
newd = {}
for k in rev(list(d.keys())):
newd[k] = d[k]
return newd
def dvsort(d):
return dict(sorted(d.items(), key = lambda x: x[1]))
def dksort(d):
return dict(sorted(d.items()))
def rmwh(a):
while not '#' in a[0]:
a = a[1:]
while not '#' in a[-1]:
a = a[:-1]
ok = True
while True:
for y in range(len(a)):
if a[y][0] == '#':
ok = False
if ok:
for y in range(len(a)):
a[y] = a[y][1:]
else:
break
ok = True
while True:
for y in range(len(a)):
if a[y][-1] == '#':
ok = False
if ok:
for y in range(len(a)):
a[y] = a[y][:-1]
else:
break
return a
def comb_cnt(n, k):
return math.factorial(n) // (math.factorial(n - k) * math.factorial(k))
def sinhen(n, l):
if n < l:
return [n]
else:
return sinhen(n // l, l) + [n % l]
# from decimal import *
# def myround(x, k):
# if k < 0:
# return float(Decimal(str(x)).quantize(Decimal('1E' + str(k+1)), rounding = ROUND_HALF_UP))
# else:
# return int(Decimal(str(x)).quantize(Decimal('1E' + str(k+1)), rounding = ROUND_HALF_UP))
def cnt_com(l1, r1, l2, r2):
if l1 > l2:
l1, l2, r1, r2 = l2, l1, r2, r1
if l1 <= l2 and l2 <= r2 and r2 <= r1:
return r2 - l2
elif l1 <= l2 and l2 <= r1 and r1 <= r2:
return r1 - l2
elif r1 <= l2:
return 0
def cut_yoko(a, y):
a_copy = copy.deepcopy(a)
res = []
for x in range(len(a[0])):
res.append(a_copy[y][x])
return res
def cut_tate(a, x):
a_copy = copy.deepcopy(a)
res = []
for y in range(len(a)):
res.append(a_copy[y][x])
return res
def zalg(s):
n = len(s)
a = [0] * n
i = 1
j = 0
a[0] = len(s)
l = len(s)
while i < l:
while i + j < l and s[j] == s[i+j]:
j += 1
if not j:
i += 1
continue
a[i] = j
k = 1
while l-i > k < j - a[k]:
a[i+k] = a[k]
k += 1
i += k
j -= k
return a
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedSet(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):
a = sorted(set(a))
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedSet" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def add(self, x: T) -> bool:
"Add an element and return True if added. / O(竏哢)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return True
a, i = self._position(x)
if i != len(a) and a[i] == x: return False
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
return True
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(竏哢)"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
a = sorted(a)
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedMultiset" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def count(self, x: T) -> int:
"Count the number of x."
return self.index_right(x) - self.index(x)
def add(self, x: T) -> None:
"Add an element. / O(竏哢)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return
a, i = self._position(x)
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(竏哢)"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
def dijkstra(g, st):
vi = set()
res = [inf for i in range(len(g))]
res[st] = 0
s = SortedSet([])
s.add((0, st))
while len(s) != 0:
dis, now = s.pop(0)
vi.add(now)
# print(s, res, now, dis)
for to in g[now].keys():
if to in vi:
continue
w = g[now][to]
if dis + w <= res[to]:
if res[to] == inf:
s.add((dis + w, to))
res[to] = dis + w
else:
r = s.discard((res[to], to))
if r == False:
print('discard error')
print(s)
print(res[to], to)
s.add((dis + w, to))
res[to] = dis + w
return res
def tarjan(g):
n = len(g)
scc, s, p = [], [], []
q = [i for i in range(n)]
state = [0] * n
while q:
node = q.pop()
if node < 0:
d = state[~node] - 1
if p[-1] > d:
scc.append(s[d:])
del s[d:]
p.pop()
for v in scc[-1]:
state[v] = -1
elif state[node] > 0:
while p[-1] > state[node]:
p.pop()
elif state[node] == 0:
s.append(node)
p.append(len(s))
state[node] = len(s)
q.append(~node)
q.extend(g[node])
return scc
def mbs(a, key):
ng = -1
ok = len(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if a[mid] >= key:
ok = mid
else:
ng = mid
return ok
def satlow(f, lower = 0, upper = 10**9):
ng = lower
ok = upper
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if f(mid):
ok = mid
else:
ng = mid
return ok
def listsatlow(a, f):
ng = -1
ok = len(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if f(a[mid]):
ok = mid
else:
ng = mid
return ok
v4 = [[-1, 0], [0, -1], [0, 1], [1, 0]]
inf = float('inf')
ans = inf
cnt=0
ay="Yes"
an="No"
#main
x, a, d, n, = gl()
x -= a
a = 0
if d == 0:
print(x)
elif 0 < d:
if x <= 0:
print(abs(x))
elif d * (n - 1) <= x:
print(x - d * (n-1))
else:
print(min(kiriage(x, d) * d - x, x % d))
elif d < 0:
if 0 <= x:
print(x)
elif x <= d * (n-1):
print(d * (n - 1) - x)
else:
x *= -1
d *= -1
print(min(kiriage(x, d) * d - x, x % d))
# import sys
# sys.setrecursionlimit(10**7)
import re
import copy
import bisect
import math
import itertools
import more_itertools
from collections import deque
from collections import defaultdict
from collections import Counter
from heapq import heapify, heappush, heappop, heappushpop, heapreplace
from functools import cmp_to_key as cmpk
import functools
al = "abcdefghijklmnopqrstuvwxyz"
au = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
def ii():
return int(input())
def gl():
return list(map(int, input().split()))
def gs():
return list(input().split())
def gr(l):
res = itertools.groupby(l)
return list([(key, len(list(v))) for key, v in res])
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
def __str__(self):
return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
def glm(h,w):
a = []
for i in range(h):
a.append(gl())
return a
def gsm(h,w):
a = []
for i in range(h):
a.append(input().split())
return a
def kiriage(n, r):
if n % r == 0:
return n // r
else:
return (n // r) + 1
def next_perm(a):
l = copy.copy(a)
l = list(l)
i = len(l) - 2
while 0 <= i and l[i] >= l[i+1]:
i -= 1
if i == 1:
return False
j = len(l) - 1
while not (l[i] < l[j]):
j -= 1
l[i], l[j] = l[j], l[i]
return l[:i+1] + rev(l[i+1:])
def yaku(n):
ans = []
for i in range(1, int(math.sqrt(n)) + 1):
if n % i == 0:
ans.append(i)
ans.append(n // i)
return ans
def ketawa(n):
ans = 0
s = str(n)
for i in s:
ans += int(i)
return ans
def rev(a):
a = a[:]
return list(reversed(a))
def lcm2(x, y):
return (x * y) // math.gcd(x, y)
def lcm3(*ints):
return functools.reduce(lcm2, ints)
def gcd3(*ints):
return functools.reduce(math.gcd, ints)
def cntsep(a, b, k):
r = a % k
m = a - r
ans = (b - m) // (k+1)
if r > 0:
ans -= 1
return ans
def putedges(g, idx = 0):
n = len(g)
e = []
cnt2 = 0
for i in range(n):
for j in g[i]:
cnt2 += 1
e.append((i, j))
m = len(g)
print(n, cnt2)
for i in e:
if idx == 0:
print(*[i[0], i[1]])
else:
print(*[i[0] + 1, i[1] + 1])
def drev(d):
newd = {}
for k in rev(list(d.keys())):
newd[k] = d[k]
return newd
def dvsort(d):
return dict(sorted(d.items(), key = lambda x: x[1]))
def dksort(d):
return dict(sorted(d.items()))
def rmwh(a):
while not '#' in a[0]:
a = a[1:]
while not '#' in a[-1]:
a = a[:-1]
ok = True
while True:
for y in range(len(a)):
if a[y][0] == '#':
ok = False
if ok:
for y in range(len(a)):
a[y] = a[y][1:]
else:
break
ok = True
while True:
for y in range(len(a)):
if a[y][-1] == '#':
ok = False
if ok:
for y in range(len(a)):
a[y] = a[y][:-1]
else:
break
return a
def comb_cnt(n, k):
return math.factorial(n) // (math.factorial(n - k) * math.factorial(k))
def sinhen(n, l):
if n < l:
return [n]
else:
return sinhen(n // l, l) + [n % l]
# from decimal import *
# def myround(x, k):
# if k < 0:
# return float(Decimal(str(x)).quantize(Decimal('1E' + str(k+1)), rounding = ROUND_HALF_UP))
# else:
# return int(Decimal(str(x)).quantize(Decimal('1E' + str(k+1)), rounding = ROUND_HALF_UP))
def cnt_com(l1, r1, l2, r2):
if l1 > l2:
l1, l2, r1, r2 = l2, l1, r2, r1
if l1 <= l2 and l2 <= r2 and r2 <= r1:
return r2 - l2
elif l1 <= l2 and l2 <= r1 and r1 <= r2:
return r1 - l2
elif r1 <= l2:
return 0
def cut_yoko(a, y):
a_copy = copy.deepcopy(a)
res = []
for x in range(len(a[0])):
res.append(a_copy[y][x])
return res
def cut_tate(a, x):
a_copy = copy.deepcopy(a)
res = []
for y in range(len(a)):
res.append(a_copy[y][x])
return res
def zalg(s):
n = len(s)
a = [0] * n
i = 1
j = 0
a[0] = len(s)
l = len(s)
while i < l:
while i + j < l and s[j] == s[i+j]:
j += 1
if not j:
i += 1
continue
a[i] = j
k = 1
while l-i > k < j - a[k]:
a[i+k] = a[k]
k += 1
i += k
j -= k
return a
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedSet(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):
a = sorted(set(a))
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedSet" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def add(self, x: T) -> bool:
"Add an element and return True if added. / O(竏哢)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return True
a, i = self._position(x)
if i != len(a) and a[i] == x: return False
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
return True
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(竏哢)"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
a = sorted(a)
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedMultiset" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def count(self, x: T) -> int:
"Count the number of x."
return self.index_right(x) - self.index(x)
def add(self, x: T) -> None:
"Add an element. / O(竏哢)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return
a, i = self._position(x)
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(竏哢)"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
def dijkstra(g, st):
vi = set()
res = [inf for i in range(len(g))]
res[st] = 0
s = SortedSet([])
s.add((0, st))
while len(s) != 0:
dis, now = s.pop(0)
vi.add(now)
# print(s, res, now, dis)
for to in g[now].keys():
if to in vi:
continue
w = g[now][to]
if dis + w <= res[to]:
if res[to] == inf:
s.add((dis + w, to))
res[to] = dis + w
else:
r = s.discard((res[to], to))
if r == False:
print('discard error')
print(s)
print(res[to], to)
s.add((dis + w, to))
res[to] = dis + w
return res
def tarjan(g):
n = len(g)
scc, s, p = [], [], []
q = [i for i in range(n)]
state = [0] * n
while q:
node = q.pop()
if node < 0:
d = state[~node] - 1
if p[-1] > d:
scc.append(s[d:])
del s[d:]
p.pop()
for v in scc[-1]:
state[v] = -1
elif state[node] > 0:
while p[-1] > state[node]:
p.pop()
elif state[node] == 0:
s.append(node)
p.append(len(s))
state[node] = len(s)
q.append(~node)
q.extend(g[node])
return scc
def mbs(a, key):
ng = -1
ok = len(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if a[mid] >= key:
ok = mid
else:
ng = mid
return ok
def satlow(f, lower = 0, upper = 10**9):
ng = lower
ok = upper
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if f(mid):
ok = mid
else:
ng = mid
return ok
def listsatlow(a, f):
ng = -1
ok = len(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if f(a[mid]):
ok = mid
else:
ng = mid
return ok
v4 = [[-1, 0], [0, -1], [0, 1], [1, 0]]
inf = float('inf')
ans = inf
cnt=0
ay="Yes"
an="No"
#main
x, a, d, n, = gl()
x -= a
a = 0
if d == 0:
print(abs(x))
elif 0 < d:
if x <= 0:
print(abs(x))
elif d * (n - 1) <= x:
print(x - d * (n-1))
else:
print(min(kiriage(x, d) * d - x, x % d))
elif d < 0:
if 0 <= x:
print(x)
elif x <= d * (n-1):
print(d * (n - 1) - x)
else:
x *= -1
d *= -1
print(min(kiriage(x, d) * d - x, x % d))
| ConDefects/ConDefects/Code/abc255_c/Python/45814894 |
condefects-python_data_2852 | x, a, d, n = map(int, input().split())
if d == 0:
print(abs(x - a))
exit(0)
m = (x - a) // d + 1
if m > n:
m = n - 5
if m <= 6:
m = 6
# +-5個調べる
ans = -1
for i in range(-5, 6):
an = a + d * (m + i - 1)
# INF設定がめんどくさい
if ans == -1:
ans = abs(x - an)
ans = min(ans, abs(x - an))
print(ans)
x, a, d, n = map(int, input().split())
if d == 0:
print(abs(x - a))
exit(0)
m = (x - a) // d + 1
if m > n:
m = n - 5
if m <= 6:
m = 6
# +-5個調べる
ans = -1
for i in range(-5, 6):
if m + i <= 0 or m + i > n:
continue
an = a + d * (m + i - 1)
# INF設定がめんどくさい
if ans == -1:
ans = abs(x - an)
ans = min(ans, abs(x - an))
print(ans)
| ConDefects/ConDefects/Code/abc255_c/Python/45259199 |
condefects-python_data_2853 | X, L, D, N = map(int, input().split())
R = L + D * (N-1)
if L > R:
L, R = R, L
D *= -1
if X < L:
print(L - X)
elif R < X:
print(X - R)
else:
if D == 0:
print(X-L)
else:
s = (X + R % D) % D
print(min(s, D-s))
X, L, D, N = map(int, input().split())
R = L + D * (N-1)
if L > R:
L, R = R, L
D *= -1
if X < L:
print(L - X)
elif R < X:
print(X - R)
else:
if D == 0:
print(X-L)
else:
s = (X - R % D) % D
print(min(s, D-s))
| ConDefects/ConDefects/Code/abc255_c/Python/45773903 |
condefects-python_data_2854 | x,a,d,n=map(int,input().split())
if d<0:
a=a+(n-1)*d
d=d*-1
m=a+(n-1)*d
print(a-x if a>x or d==0 else x-m if m<x else min((x-a)%d,d-(x-a)%d))
x,a,d,n=map(int,input().split())
if d<0:
a=a+(n-1)*d
d=d*-1
m=a+(n-1)*d
print(a-x if a>=x else x-m if m<=x else min((x-a)%d,d-(x-a)%d)) | ConDefects/ConDefects/Code/abc255_c/Python/45494254 |
condefects-python_data_2855 | # Python3/Pypy3テンプレート集
#ライブラリ-------------------------------------------------------------------
from bisect import *
import heapq
import collections
from collections import deque
from queue import Queue
from itertools import groupby
import itertools
import math
import array
import string
import copy
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from functools import reduce
from operator import and_, or_, xor
#便利スクリプト---------------------------------------------------------------
INF = 10**20
mod = 998244353
MOD = 10**9+7
def YesNo(b): print("Yes") if b else print("No")
def YESNO(b): print("YES") if b else print("NO")
#標準入力---------------------------------------------------------------------
import sys
sys.setrecursionlimit(10 ** 5 + 10000)
input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LIS(): return list(map(int, SI()))
def LA(f): return list(map(f, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return input().strip('\n')
def MS(): return input().split()
def LS(): return list(input().strip('\n'))
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def LMS(rows_number): return [MS() for _ in range(rows_number)]
#関数------------------------------------------------------------------------
###標準ライブラリ###
def ceil(a,b): #切り捨て
return (a+b-1)//b
def inv(a,p): #aのpを法とする逆元(aとpは互いに素)
return pow(a,p-2,p)%p
def transpose(A): #二次元配列の転置
A_t = []
for i in range(len(A[0])) :
tmp = []
for v in A :
tmp.append(v[i])
A_t.append(tmp)
return A_t
def rotate_matrix(A): #グリッドを時計回りに90度回転
return transpose(A[::-1])
def removeDuplicates_2D(A): #二次元配列の重複削除
return list(map(list, set(map(tuple, A))))
def convert(S,c): # グリッドをの 黒 マスの点集合に変換する | S: グリッド c:黒マスがなにか(ex #,1)
s = set()
h = len(S)
w = len(S[0])
for i in range(h):
for j in range(w):
if S[i][j] == c:
s.add((i, j))
return s
def normalize(s): # グリッドの # マスの点集合を与えると最小の x 座標と最小の y 座標がともに 0 となるように平行移動して返す
mi = min(i for (i, j) in s)
mj = min(j for (i, j) in s)
return set((i - mi, j - mj) for (i, j) in s)
def cumulativeSum_1D(A): #配列Aの累積和
return list(itertools.accumulate(A))
def cumulativeSum_2D(S): #二次元配列Sの累積和 => 二次元リスト
h = len(S)
w = len(S[0])
CS = [[0 for _ in range(w)]for _ in range(h)]
CCS = [[0 for _ in range(w)]for _ in range(h)]
for i in range(h):
for j in range(w):
if(j==0):
CS[i][0] = S[i][0]
else:
CS[i][j] = CS[i][j-1] + S[i][j]
for i in range(h):
for j in range(w):
if(i==0):
CCS[0][j] = CS[0][j]
else:
CCS[i][j] = CCS[i-1][j] + CS[i][j]
return CCS
def string_to_runLength(S: str): #文字列/リストからラングレス圧縮
grouped = groupby(S)
res = []
for k, v in grouped:
res.append((k, int(len(list(v)))))
return res
def runLength_to_string(L: "list[tuple]"): #ラングレス圧縮から文字列 => 文字だけ
res = ""
for c, n in L:
res += c * int(n)
return res
def bfs(i,G): # i:始点
n = len(G)
dist = [-1] * n
pre = [-1] * n
que = deque()
dist[i] = 0
que.append(i)
while not len(que)==0:
v = que.popleft()
for next_v in G[v]:
if dist[next_v] != -1:
continue
dist[next_v] = dist[v] + 1
pre[next_v] = v
que.append(next_v)
return dist,pre
def bfs01(s, G): # i:始点 => dist
N = len(G)
dist = [INF] * N
S = deque([s])
T = deque()
dist[s] = 0
d = 0
while S:
while S:
v = S.popleft()
for c, w in G[v]:
if d+c < dist[w]:
dist[w] = d+c
if c:
T.append(w)
else:
S.append(w)
S, T = T, S
d += 1
return dist
def dijkstra(s,G): #s:始点 => cost,pre | G:タプルの中身(コスト,行先)
n = len(G)
hq = [(0, s)]
heapq.heapify(hq)
cost = [INF]*n
cost[s]= 0
pre = [-1] * n
while hq:
c,v = heapq.heappop(hq)
if c > cost[v]:
continue
for d,u in G[v]:
tmp = d+cost[v]
if tmp < cost[u]:
cost[u] = tmp
pre[u] = v
heapq.heappush(hq,(tmp,u))
return cost, pre
def coordinates(A): # 変換表(元の値 : 座標圧縮の値),変換表2(座標圧縮の値: 元の値), 圧縮後配列
B = sorted(set(A))
C = { v: i for i, v in enumerate(B) }
D = { i: v for i, v in enumerate(B) }
E = list(map(lambda v: C[v], A))
return C, D, E
def eng_L(): return list(string.ascii_lowercase)
def ENG_L(): return list(string.ascii_uppercase)
def bit_len(n): #bit長
return n.bit_length()
def bit_cnt(n): # bitにしたときの1の数
cnt = 0
for i in range(bit_len(n)+1):
cnt += n>>i & 1
return cnt
def idx_le(A, x): # x 以下の最大の要素位置 / なければ "No"
return bisect_right(A, x)-1 if bisect_right(A, x)-1 != -1 else "No"
def idx_lt(A, x): # x 未満の最大の要素位置 / なければ "No"
return bisect_left(A, x)-1 if bisect_right(A, x)-1 != -1 else "No"
def idx_ge(A, x): # x 以上の最小の要素位置 / なければ "No"
return bisect_left(A, x) if bisect_left(A, x) != len(A) else "No"
def idx_gt(A, x): # x 超過の最小の要素位置 / なければ "No"
return bisect_right(A, x) if bisect_right(A, x) != len(A) else "No"
def cnt_le(A, x): # x 以下の要素の個数
if(idx_le(A, x) == "No"): return 0
return idx_le(A, x) + 1
def cnt_lt(A, x): # x 未満の要素の個数
if(idx_lt(A, x) == "No"): return 0
return idx_lt(A, x) + 1
def cnt_ge(A, x): # x 以上の要素の個数
return len(A) - cnt_lt(A, x)
def cnt_gt(A, x): # x 超過の要素の個数
return len(A) - cnt_le(A, x)
###数学ライブラリ###
def allAND(A): # 配列Aの総AND
return reduce(and_, A)
def allOR(A): # 配列Aの総OR
return reduce(or_, A)
def allXOR(A): # 配列Aの総XOR
return reduce(xor, A)
def allGCD(A): # 配列Aの総GCD
if(len(A)==1):
return A[0]
g = math.gcd(A[0],A[1])
for i in range(1,len(A)):
g = math.gcd(g, A[i])
return g
def mex(A): #配列Aのmexを求める
B = set()
for a in A:
if(a>=0):
B.add(a)
B = list(B)
B.sort()
if(len(B)==0):
return 0
if(B[0]!=0):
return 0
m = 0
for i in range(1,len(B)):
if(B[i]==B[i-1]+1):
m +=1
else:
break
return m +1
def gcd(a,b): #aとbの最大公約数を求める
return math.gcd(a,b)
def lcm(a,b): #aとbの最小公倍数を求める
return a*b//gcd(a,b)
def extgcd(a, b): # a,b =>ax+by=gcd(a,b)を満たす(g,x,y) a,bが互いに素のとき、xはaのbを法とする逆元
if b:
d, y, x = extgcd(b, a % b)
y -= (a // b)*x
return d, x, y
return a, 1, 0
def fact_L(n,mod): # [0!, 1! ..., n!] を返す
fact = [1]
p = 1
for i in range(1,n+1):
p *= i
p %= mod
fact.append(p)
return fact
def bitCount_L(n): # n以下のそれぞれのbitカウントを返す
bitcount = [0] * (n+1)
for i in range(1,n+1):
bitcount[i] = bitcount[i//2] + i%2
return bitcount
def factorial(n, m=0): #nの階乗 | m:mod(デフォなし)
if(n<0):
return -1
elif(n==0):
return 1
P = 1
for i in range(1,n+1):
P *= i
if(m==0):
continue
P %= m
return P
def nPr(n, r, m=0): #順列nPr
if(n<=0 or r<0 or n<r):
return -1
if(r==0):
return 1
P = 1
for i in range(n,n-r,-1):
P *= i
if(m==0):
continue
P %= m
return P
def nCr(n, r, m=0): #組み合わせnCr
if(n<r):
return 0
if(n==r):
return 1
if(n<=0 or r<0 or n<r):
return -1
N = 1
for i in range(r):
N *= n-i
if(m==0):
continue
N %= m
R = factorial(r)
return N//R
def nCrm(n,r,m=mod): #逆元を用いた組み合わせnCr%mod
if(n<r):
return 0
if(n==r):
return 1
if(n<=0 or r<0 or n<r):
return -1
over=1
for i in range(n-r+1,n+1):
over *= i
over %= m
under=1
for i in range(1,r+1):
under *= i
under %= m
return over*pow(under,m-2,m)%m
def is_prime(n): #素数判定 => True/False
if n == 2:
return 1
if n == 1 or n%2 == 0:
return 0
m = n - 1
lsb = m & -m
s = lsb.bit_length()-1
d = m // lsb
test_numbers = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]
for a in test_numbers:
if a == n:
continue
x = pow(a,d,n)
r = 0
if x == 1:
continue
while x != m:
x = pow(x,2,n)
r += 1
if x == 1 or r == s:
return 0
return 1
def prime_L(n): #n以下の素数のリスト
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
def find_prime_factor(n):
if n%2 == 0:
return 2
m = int(n**0.125)+1
for c in range(1,n):
f = lambda a: (pow(a,2,n)+c)%n
y = 0
g = q = r = 1
k = 0
while g == 1:
x = y
while k < 3*r//4:
y = f(y)
k += 1
while k < r and g == 1:
ys = y
for _ in range(min(m, r-k)):
y = f(y)
q = q*abs(x-y)%n
g = math.gcd(q,n)
k += m
k = r
r *= 2
if g == n:
g = 1
y = ys
while g == 1:
y = f(y)
g = math.gcd(abs(x-y),n)
if g == n:
continue
if is_prime(g):
return g
elif is_prime(n//g):
return n//g
else:
return find_prime_factor(g)
def primeFactorization_2L(n): #2以上の整数n => [[素因数, 指数], ...]の2次元リスト
if(n<=10**6):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
else:
res = {}
while not is_prime(n) and n > 1:
p = find_prime_factor(n)
s = 0
while n%p == 0:
n //= p
s += 1
res[p] = s
if n > 1:
res[n] = 1
R = []
for r in res:
R.append([r,res[r]])
R.sort()
return R
def divisor_L(n): #nまでの約数のリスト
if(n==1):
return [1]
if(n<=10**6):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
else:
L = primeFactorization_2L(n)
E = [[]for i in range(len(L))]
for i in range(len(L)):
for j in range(L[i][1]+1):
E[i].append(L[i][0]**j)
D = []
for p in list(itertools.product(*E)):
s = 1
for v in p:
s *= v
D.append(s)
D.sort()
return D
def floorsqrt(n): # N => ⌊√N⌋
# only for n <= 10 ** 18
ok = 10 ** 9 + 10
ng = 0
while ok - ng > 1:
t = (ok + ng) // 2
if t * t > n: ok = t
else: ng = t
return ng
def decimal_to_nAry(num_10,n): #10進数からn進数へ変換する(n<=36) |int型 => str型
str_n = []
while num_10:
if num_10%n >= 10:
str_n.append(chr(num_10%n+55))
else:
str_n.append(str(num_10%n))
num_10 //= n
return "".join(str_n[::-1])
def nAry_to_decimal(X,n): #n進数から10進数へ変換する(n<=36) | str型 => int型
num = 0
X = X.upper()
X = list(X)
for i in range(len(X)):
if(("0"<=X[i]<="9")==False):
X[i] = str(ord(X[i]) - 55)
for i in range(1,len(X)+1):
num += int(X[-i]) * pow(n, (i-1))
return num
def roundOff(x,d): #四捨五入する x:対象の数字, d:四捨五入する位(正|負) => float型の数値
return float(Decimal(x).quantize(Decimal(f"1E{d}"), rounding=ROUND_HALF_UP))
###幾何ライブラリ###
def dsin(d): #度数法でsinを計算する
return math.sin(math.radians(d))
def dcos(d): #度数法でcosを計算する
return math.cos(math.radians(d))
def rotate(x,y,d,cx=0,cy=0): #P(x,y)をA(cx,cy)を中心としてに反時計回りにd°回転 => [x,y]
nx = (x-cx)*dcos(d)-(y-cy)*dsin(d)
ny = (x-cx)*dsin(d)+(y-cy)*dcos(d)
return [nx+cx,ny+cy]
def findAngle(O,A,B): #∠AOBを求める(弧度法)
s = [A[0]-O[0],A[1]-O[1]]
t = [B[0]-O[0],B[1]-O[1]]
u = s[0]*t[0]+s[1]*t[1]
l = (s[0]**2+s[1]**2)**(1/2) * (t[0]**2+t[1]**2)**(1/2)
v = u/l
t = math.degrees(math.acos(v))
return t
def outerProduct(Av,Bv): #二次元ベクトルの外積(=符号付面積)を求める(a×b)
return Av[0]*Bv[1] - Bv[0]*Av[1]
def CCW(O,A,B): #Oを中心として、Aから見たAとBの位置関係を求める。
# -1: 時計回り, 0: 一直線上, 1: 反時計回り
s = [A[0]-O[0],A[1]-O[1]]
t = [B[0]-O[0],B[1]-O[1]]
op = outerProduct(s,t)
if(op > 0): return 1
if(op < 0): return -1
if(op == 0): return 0
def matrixMultiplication_2D(a,b,m): #行列の掛け算(a×b) m:mod
I,J,K,L = len(a),len(b[0]),len(b),len(a[0])
if(L!=K):
return -1
c = [[0] * J for _ in range(I)]
for i in range(I) :
for j in range(J) :
for k in range(K) :
c[i][j] += a[i][k] * b[k][j]
c[i][j] %= m
return c
def matrixExponentiation_2D(x,n,m): #行列の累乗 (x^n) m:mod
y = [[0] * len(x) for _ in range(len(x))]
for i in range(len(x)):
y[i][i] = 1
while n > 0:
if n & 1:
y = matrixMultiplication_2D(x,y,m)
x = matrixMultiplication_2D(x,x,m)
n >>= 1
return y
def twoCircles(A,B): #二つの円の半径の位置関係 | 引数はそれぞれ[x,y(=座標),r(=半径)]
# 1 : 一方の円が他方の円を完全に含み、2 つの円は接していない
# 2 : 一方の円が他方の円を完全に含み、2 つの円は接している
# 3 : 2 つの円が互いに交差する
# 4 : 2 つの円の内部に共通部分は存在しないが、2 つの円は接している
# 5 : 2 つの円の内部に共通部分は存在せず、2 つの円は接していない
x1 = A[0]
x2 = B[0]
y1 = A[1]
y2 = B[1]
r1 = A[2]
r2 = B[2]
d = abs((x1-x2)+1j*(y1-y2))
if(abs(r2-r1)>d):
return 1
elif(abs(r2-r1)==d):
return 2
elif(r1+r2>d):
return 3
elif(r1+r2==d):
return 4
elif(r1+r2<d):
return 5
###デバッグ用ライブラリ###
def TS(_str): #変数/リストに格納されている値を確認
print('{}: {}'.format(_str, eval(_str)))
def T2d(A): #二次元配列の確認用
for a in A:
print(*a)
def T3d(A): #三次元配列の確認用
for a in A:
T2d(a)
BR()
def BR(): #横線で区切りを入れる
print("---")
#クラス----------------------------------------------------------------------
#カンニングペーパー-----------------------------------------------------------
'''
###標準ライブラリ###
ceil(a,b): #切り捨て
inv(a,p): #xのpを法とする逆元
transpose(A): #二次元配列の転置
rotate_matrix(A): #グリッドを時計回りに90度回転
removeDuplicates_2D(A): #二次元配列の重複削除
convert(S, c): # グリッドをの 黒 マスの点集合に変換する | S: グリッド c:黒マスがなにか(ex #,1)
normalize(s): # グリッドの # マスの点集合を与えると最小の x 座標と最小の y 座標がともに 0 となるように平行移動して返す
例)normalize(convert(h,w,A))
cumulativeSum_1D(A) #配列Aの累積和
cumulativeSum_2D(S): #二次元配列Sの累積和 => 二次元リスト
string_to_runLength(S: str) #文字列/リストからラングレス圧縮 => [(文字,個数), ...]の二次元リスト
runLength_to_string(L: "list[tuple]") #ラングレス圧縮 => 文字列
bfs(i,G) # i:始点 => dist,pre
bfs01(i,G) # i:始点 => dist
dijkstra(s,G): #s:始点 => cost,pre | G:タプルの中身(コスト,行先)
coordinates(A) # 変換表(元の値 : 座標圧縮の値),変換表2(座標圧縮の値: 元の値), 圧縮後配列
eng_L() #英小文字のリスト
ENG_L() #英大文字のリスト
bit_len(n): #bit長
bit_cnt(n): # bitにしたときの1の数
idx_le(A, x) # x 以下の最大の要素位置 / なければ "No"
idx_lt(A, x) # x 未満の最大の要素位置 / なければ "No"
idx_ge(A, x) # x 以上の最小の要素位置 / なければ "No"
idx_gt(A, x) # x 超過の最小の要素位置 / なければ "No"
cnt_le(A, x) # x 以下の要素の個数
cnt_lt(A, x) # x 未満の要素の個数
cnt_ge(A, x) # x 以上の要素の個数
cnt_gt(A, x) # x 超過の要素の個数
###数学ライブラリ###
allAND(A): # 配列Aの総AND
allOR(A): # 配列Aの総OR
allXOR(A): # 配列Aの総XOR
allGCD(A): # 配列Aの総GCD
mex(A) #配列Aのmexを求める
gcd(a,b) #aとbの最大公約数を求める
lcm(a,b) #aとbの最小公倍数を求める
extgcd(a, b): # a,b =>ax+by=gcd(a,b)を満たす(g,x,y) a,bが互いに素のとき、xはaのbを法とする逆元
fact_L(n,mod): # [0!, 1! ..., n!] を返す
bitCount_L(n): # n以下のそれぞれのbitカウントを返す
factorial(n,m) #nの階乗 | m:mod(デフォなし)
nPr(n,r,m) #順列nPr | m:mod(デフォなし)
nCr(n,r,m) #組み合わせ,nCr | m:mod(デフォなし)
nCrm(n,r,m) #逆元を用いた組み合わせnCr%mod
divisor_L(n) #nの約数のリスト
is_prime(n) #素数判定 => True/False
prime_L(n) #nまでの素数のリスト
primeFactorization_2L(n) #2以上の整数n => [[素因数, 指数], ...]の2次元リスト
floorsqrt(n): # N => ⌊√N⌋
decimal_to_nAry(num_10,n) #10進数からn進数へ変換する(n<=36) |int型 => str型
nAry_to_decimal(num_n,n) #n進数から10進数へ変換する(n<=36) | str型 => int型
roundOff(x,d): #四捨五入する x:対象の数字, d:四捨五入する位(正|負) => float型の数値
###幾何ライブラリ###
dsin(d): #度数法でsinを計算する
dcos(d): #度数法でcosを計算する
rotate(x,y,d,cx,cy): #P(x,y)をA(cx,cy)を中心としてに反時計回りにd°回転(デフォ原点) => [x,y]
findAngle(O,A,B) #∠AOBを求める(弧度法) | 引数はそれぞれ[x,y(=座標)]
outerProduct(Av,Bv) #二次元ベクトルの外積(=符号付面積)を求める(a×b) | 引数はそれぞれ[x,y(=座標)]
CCW(O,A,B) #Oを中心として、Aから見たAとBの位置関係
=> -1:時計回り, 0:一直線上, 1:反時計回り | 引数はそれぞれ[x,y(=座標)]
matrixMultiplication_2D(a,b,m) #行列の掛け算(a×b) m:mod | 引数は二次元リスト
matrixExponentiation_2D(x,n m)#行列の累乗 (x^n) m:mod | 引数は二次元リスト
twoCircles(A,B): #二つの円の半径の位置関係 | 引数はそれぞれ[x,y(=座標),r(=半径)]
=> 1, 2, 3, 4, 5 各数字に対応する位置関係の説明は上記参照
###デバッグ用ライブラリ###
TS(_str) # 変数/リストに格納されている値を確認 => 〇〇:××
T2d(A): # 二次元配列の確認用
T3d(A): # 三次元配列の確認用
BR() # 横線で区切りを入れる
###文法チートシート###
|S|<x => "0"*(x-|S|) + S : str(n).zfill(x)
全部大文字に変換：str.upper()
全部小文字に変換：str.lower()
先頭のみ大文字に変換：str.capitalize()
各単語の先頭のみ大文字に変換（タイトルケース）:str.title()
大文字と小文字を入れ替える：str.swapcase()
文字 → ASCIIコード ord(s)
ASCIIコード → 文字 chr(x)
ASCII表
65:A ~ 90:Z
97:a ~ 122:z
'''
#PyPyで再帰関数を用いる場合はコメントを外す----------------------------------
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
#----------------------------------------------------------------------------
x,a,d,n = MI()
m = a
M = a+d*(n-1)
if(d < 0):
a = a+d*(n-1)
ans = min(abs(m-x),abs(M-x))
if(d==0):
print(ans)
exit()
k = (x+d-a)//d
for i in range(max(1,k-5),min(k+5,n+1)):
v = a + d*(i-1)
ans = min(ans,abs(v-x))
print(ans)
# Python3/Pypy3テンプレート集
#ライブラリ-------------------------------------------------------------------
from bisect import *
import heapq
import collections
from collections import deque
from queue import Queue
from itertools import groupby
import itertools
import math
import array
import string
import copy
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from functools import reduce
from operator import and_, or_, xor
#便利スクリプト---------------------------------------------------------------
INF = 10**20
mod = 998244353
MOD = 10**9+7
def YesNo(b): print("Yes") if b else print("No")
def YESNO(b): print("YES") if b else print("NO")
#標準入力---------------------------------------------------------------------
import sys
sys.setrecursionlimit(10 ** 5 + 10000)
input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LIS(): return list(map(int, SI()))
def LA(f): return list(map(f, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return input().strip('\n')
def MS(): return input().split()
def LS(): return list(input().strip('\n'))
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def LMS(rows_number): return [MS() for _ in range(rows_number)]
#関数------------------------------------------------------------------------
###標準ライブラリ###
def ceil(a,b): #切り捨て
return (a+b-1)//b
def inv(a,p): #aのpを法とする逆元(aとpは互いに素)
return pow(a,p-2,p)%p
def transpose(A): #二次元配列の転置
A_t = []
for i in range(len(A[0])) :
tmp = []
for v in A :
tmp.append(v[i])
A_t.append(tmp)
return A_t
def rotate_matrix(A): #グリッドを時計回りに90度回転
return transpose(A[::-1])
def removeDuplicates_2D(A): #二次元配列の重複削除
return list(map(list, set(map(tuple, A))))
def convert(S,c): # グリッドをの 黒 マスの点集合に変換する | S: グリッド c:黒マスがなにか(ex #,1)
s = set()
h = len(S)
w = len(S[0])
for i in range(h):
for j in range(w):
if S[i][j] == c:
s.add((i, j))
return s
def normalize(s): # グリッドの # マスの点集合を与えると最小の x 座標と最小の y 座標がともに 0 となるように平行移動して返す
mi = min(i for (i, j) in s)
mj = min(j for (i, j) in s)
return set((i - mi, j - mj) for (i, j) in s)
def cumulativeSum_1D(A): #配列Aの累積和
return list(itertools.accumulate(A))
def cumulativeSum_2D(S): #二次元配列Sの累積和 => 二次元リスト
h = len(S)
w = len(S[0])
CS = [[0 for _ in range(w)]for _ in range(h)]
CCS = [[0 for _ in range(w)]for _ in range(h)]
for i in range(h):
for j in range(w):
if(j==0):
CS[i][0] = S[i][0]
else:
CS[i][j] = CS[i][j-1] + S[i][j]
for i in range(h):
for j in range(w):
if(i==0):
CCS[0][j] = CS[0][j]
else:
CCS[i][j] = CCS[i-1][j] + CS[i][j]
return CCS
def string_to_runLength(S: str): #文字列/リストからラングレス圧縮
grouped = groupby(S)
res = []
for k, v in grouped:
res.append((k, int(len(list(v)))))
return res
def runLength_to_string(L: "list[tuple]"): #ラングレス圧縮から文字列 => 文字だけ
res = ""
for c, n in L:
res += c * int(n)
return res
def bfs(i,G): # i:始点
n = len(G)
dist = [-1] * n
pre = [-1] * n
que = deque()
dist[i] = 0
que.append(i)
while not len(que)==0:
v = que.popleft()
for next_v in G[v]:
if dist[next_v] != -1:
continue
dist[next_v] = dist[v] + 1
pre[next_v] = v
que.append(next_v)
return dist,pre
def bfs01(s, G): # i:始点 => dist
N = len(G)
dist = [INF] * N
S = deque([s])
T = deque()
dist[s] = 0
d = 0
while S:
while S:
v = S.popleft()
for c, w in G[v]:
if d+c < dist[w]:
dist[w] = d+c
if c:
T.append(w)
else:
S.append(w)
S, T = T, S
d += 1
return dist
def dijkstra(s,G): #s:始点 => cost,pre | G:タプルの中身(コスト,行先)
n = len(G)
hq = [(0, s)]
heapq.heapify(hq)
cost = [INF]*n
cost[s]= 0
pre = [-1] * n
while hq:
c,v = heapq.heappop(hq)
if c > cost[v]:
continue
for d,u in G[v]:
tmp = d+cost[v]
if tmp < cost[u]:
cost[u] = tmp
pre[u] = v
heapq.heappush(hq,(tmp,u))
return cost, pre
def coordinates(A): # 変換表(元の値 : 座標圧縮の値),変換表2(座標圧縮の値: 元の値), 圧縮後配列
B = sorted(set(A))
C = { v: i for i, v in enumerate(B) }
D = { i: v for i, v in enumerate(B) }
E = list(map(lambda v: C[v], A))
return C, D, E
def eng_L(): return list(string.ascii_lowercase)
def ENG_L(): return list(string.ascii_uppercase)
def bit_len(n): #bit長
return n.bit_length()
def bit_cnt(n): # bitにしたときの1の数
cnt = 0
for i in range(bit_len(n)+1):
cnt += n>>i & 1
return cnt
def idx_le(A, x): # x 以下の最大の要素位置 / なければ "No"
return bisect_right(A, x)-1 if bisect_right(A, x)-1 != -1 else "No"
def idx_lt(A, x): # x 未満の最大の要素位置 / なければ "No"
return bisect_left(A, x)-1 if bisect_right(A, x)-1 != -1 else "No"
def idx_ge(A, x): # x 以上の最小の要素位置 / なければ "No"
return bisect_left(A, x) if bisect_left(A, x) != len(A) else "No"
def idx_gt(A, x): # x 超過の最小の要素位置 / なければ "No"
return bisect_right(A, x) if bisect_right(A, x) != len(A) else "No"
def cnt_le(A, x): # x 以下の要素の個数
if(idx_le(A, x) == "No"): return 0
return idx_le(A, x) + 1
def cnt_lt(A, x): # x 未満の要素の個数
if(idx_lt(A, x) == "No"): return 0
return idx_lt(A, x) + 1
def cnt_ge(A, x): # x 以上の要素の個数
return len(A) - cnt_lt(A, x)
def cnt_gt(A, x): # x 超過の要素の個数
return len(A) - cnt_le(A, x)
###数学ライブラリ###
def allAND(A): # 配列Aの総AND
return reduce(and_, A)
def allOR(A): # 配列Aの総OR
return reduce(or_, A)
def allXOR(A): # 配列Aの総XOR
return reduce(xor, A)
def allGCD(A): # 配列Aの総GCD
if(len(A)==1):
return A[0]
g = math.gcd(A[0],A[1])
for i in range(1,len(A)):
g = math.gcd(g, A[i])
return g
def mex(A): #配列Aのmexを求める
B = set()
for a in A:
if(a>=0):
B.add(a)
B = list(B)
B.sort()
if(len(B)==0):
return 0
if(B[0]!=0):
return 0
m = 0
for i in range(1,len(B)):
if(B[i]==B[i-1]+1):
m +=1
else:
break
return m +1
def gcd(a,b): #aとbの最大公約数を求める
return math.gcd(a,b)
def lcm(a,b): #aとbの最小公倍数を求める
return a*b//gcd(a,b)
def extgcd(a, b): # a,b =>ax+by=gcd(a,b)を満たす(g,x,y) a,bが互いに素のとき、xはaのbを法とする逆元
if b:
d, y, x = extgcd(b, a % b)
y -= (a // b)*x
return d, x, y
return a, 1, 0
def fact_L(n,mod): # [0!, 1! ..., n!] を返す
fact = [1]
p = 1
for i in range(1,n+1):
p *= i
p %= mod
fact.append(p)
return fact
def bitCount_L(n): # n以下のそれぞれのbitカウントを返す
bitcount = [0] * (n+1)
for i in range(1,n+1):
bitcount[i] = bitcount[i//2] + i%2
return bitcount
def factorial(n, m=0): #nの階乗 | m:mod(デフォなし)
if(n<0):
return -1
elif(n==0):
return 1
P = 1
for i in range(1,n+1):
P *= i
if(m==0):
continue
P %= m
return P
def nPr(n, r, m=0): #順列nPr
if(n<=0 or r<0 or n<r):
return -1
if(r==0):
return 1
P = 1
for i in range(n,n-r,-1):
P *= i
if(m==0):
continue
P %= m
return P
def nCr(n, r, m=0): #組み合わせnCr
if(n<r):
return 0
if(n==r):
return 1
if(n<=0 or r<0 or n<r):
return -1
N = 1
for i in range(r):
N *= n-i
if(m==0):
continue
N %= m
R = factorial(r)
return N//R
def nCrm(n,r,m=mod): #逆元を用いた組み合わせnCr%mod
if(n<r):
return 0
if(n==r):
return 1
if(n<=0 or r<0 or n<r):
return -1
over=1
for i in range(n-r+1,n+1):
over *= i
over %= m
under=1
for i in range(1,r+1):
under *= i
under %= m
return over*pow(under,m-2,m)%m
def is_prime(n): #素数判定 => True/False
if n == 2:
return 1
if n == 1 or n%2 == 0:
return 0
m = n - 1
lsb = m & -m
s = lsb.bit_length()-1
d = m // lsb
test_numbers = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]
for a in test_numbers:
if a == n:
continue
x = pow(a,d,n)
r = 0
if x == 1:
continue
while x != m:
x = pow(x,2,n)
r += 1
if x == 1 or r == s:
return 0
return 1
def prime_L(n): #n以下の素数のリスト
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
def find_prime_factor(n):
if n%2 == 0:
return 2
m = int(n**0.125)+1
for c in range(1,n):
f = lambda a: (pow(a,2,n)+c)%n
y = 0
g = q = r = 1
k = 0
while g == 1:
x = y
while k < 3*r//4:
y = f(y)
k += 1
while k < r and g == 1:
ys = y
for _ in range(min(m, r-k)):
y = f(y)
q = q*abs(x-y)%n
g = math.gcd(q,n)
k += m
k = r
r *= 2
if g == n:
g = 1
y = ys
while g == 1:
y = f(y)
g = math.gcd(abs(x-y),n)
if g == n:
continue
if is_prime(g):
return g
elif is_prime(n//g):
return n//g
else:
return find_prime_factor(g)
def primeFactorization_2L(n): #2以上の整数n => [[素因数, 指数], ...]の2次元リスト
if(n<=10**6):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
else:
res = {}
while not is_prime(n) and n > 1:
p = find_prime_factor(n)
s = 0
while n%p == 0:
n //= p
s += 1
res[p] = s
if n > 1:
res[n] = 1
R = []
for r in res:
R.append([r,res[r]])
R.sort()
return R
def divisor_L(n): #nまでの約数のリスト
if(n==1):
return [1]
if(n<=10**6):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
else:
L = primeFactorization_2L(n)
E = [[]for i in range(len(L))]
for i in range(len(L)):
for j in range(L[i][1]+1):
E[i].append(L[i][0]**j)
D = []
for p in list(itertools.product(*E)):
s = 1
for v in p:
s *= v
D.append(s)
D.sort()
return D
def floorsqrt(n): # N => ⌊√N⌋
# only for n <= 10 ** 18
ok = 10 ** 9 + 10
ng = 0
while ok - ng > 1:
t = (ok + ng) // 2
if t * t > n: ok = t
else: ng = t
return ng
def decimal_to_nAry(num_10,n): #10進数からn進数へ変換する(n<=36) |int型 => str型
str_n = []
while num_10:
if num_10%n >= 10:
str_n.append(chr(num_10%n+55))
else:
str_n.append(str(num_10%n))
num_10 //= n
return "".join(str_n[::-1])
def nAry_to_decimal(X,n): #n進数から10進数へ変換する(n<=36) | str型 => int型
num = 0
X = X.upper()
X = list(X)
for i in range(len(X)):
if(("0"<=X[i]<="9")==False):
X[i] = str(ord(X[i]) - 55)
for i in range(1,len(X)+1):
num += int(X[-i]) * pow(n, (i-1))
return num
def roundOff(x,d): #四捨五入する x:対象の数字, d:四捨五入する位(正|負) => float型の数値
return float(Decimal(x).quantize(Decimal(f"1E{d}"), rounding=ROUND_HALF_UP))
###幾何ライブラリ###
def dsin(d): #度数法でsinを計算する
return math.sin(math.radians(d))
def dcos(d): #度数法でcosを計算する
return math.cos(math.radians(d))
def rotate(x,y,d,cx=0,cy=0): #P(x,y)をA(cx,cy)を中心としてに反時計回りにd°回転 => [x,y]
nx = (x-cx)*dcos(d)-(y-cy)*dsin(d)
ny = (x-cx)*dsin(d)+(y-cy)*dcos(d)
return [nx+cx,ny+cy]
def findAngle(O,A,B): #∠AOBを求める(弧度法)
s = [A[0]-O[0],A[1]-O[1]]
t = [B[0]-O[0],B[1]-O[1]]
u = s[0]*t[0]+s[1]*t[1]
l = (s[0]**2+s[1]**2)**(1/2) * (t[0]**2+t[1]**2)**(1/2)
v = u/l
t = math.degrees(math.acos(v))
return t
def outerProduct(Av,Bv): #二次元ベクトルの外積(=符号付面積)を求める(a×b)
return Av[0]*Bv[1] - Bv[0]*Av[1]
def CCW(O,A,B): #Oを中心として、Aから見たAとBの位置関係を求める。
# -1: 時計回り, 0: 一直線上, 1: 反時計回り
s = [A[0]-O[0],A[1]-O[1]]
t = [B[0]-O[0],B[1]-O[1]]
op = outerProduct(s,t)
if(op > 0): return 1
if(op < 0): return -1
if(op == 0): return 0
def matrixMultiplication_2D(a,b,m): #行列の掛け算(a×b) m:mod
I,J,K,L = len(a),len(b[0]),len(b),len(a[0])
if(L!=K):
return -1
c = [[0] * J for _ in range(I)]
for i in range(I) :
for j in range(J) :
for k in range(K) :
c[i][j] += a[i][k] * b[k][j]
c[i][j] %= m
return c
def matrixExponentiation_2D(x,n,m): #行列の累乗 (x^n) m:mod
y = [[0] * len(x) for _ in range(len(x))]
for i in range(len(x)):
y[i][i] = 1
while n > 0:
if n & 1:
y = matrixMultiplication_2D(x,y,m)
x = matrixMultiplication_2D(x,x,m)
n >>= 1
return y
def twoCircles(A,B): #二つの円の半径の位置関係 | 引数はそれぞれ[x,y(=座標),r(=半径)]
# 1 : 一方の円が他方の円を完全に含み、2 つの円は接していない
# 2 : 一方の円が他方の円を完全に含み、2 つの円は接している
# 3 : 2 つの円が互いに交差する
# 4 : 2 つの円の内部に共通部分は存在しないが、2 つの円は接している
# 5 : 2 つの円の内部に共通部分は存在せず、2 つの円は接していない
x1 = A[0]
x2 = B[0]
y1 = A[1]
y2 = B[1]
r1 = A[2]
r2 = B[2]
d = abs((x1-x2)+1j*(y1-y2))
if(abs(r2-r1)>d):
return 1
elif(abs(r2-r1)==d):
return 2
elif(r1+r2>d):
return 3
elif(r1+r2==d):
return 4
elif(r1+r2<d):
return 5
###デバッグ用ライブラリ###
def TS(_str): #変数/リストに格納されている値を確認
print('{}: {}'.format(_str, eval(_str)))
def T2d(A): #二次元配列の確認用
for a in A:
print(*a)
def T3d(A): #三次元配列の確認用
for a in A:
T2d(a)
BR()
def BR(): #横線で区切りを入れる
print("---")
#クラス----------------------------------------------------------------------
#カンニングペーパー-----------------------------------------------------------
'''
###標準ライブラリ###
ceil(a,b): #切り捨て
inv(a,p): #xのpを法とする逆元
transpose(A): #二次元配列の転置
rotate_matrix(A): #グリッドを時計回りに90度回転
removeDuplicates_2D(A): #二次元配列の重複削除
convert(S, c): # グリッドをの 黒 マスの点集合に変換する | S: グリッド c:黒マスがなにか(ex #,1)
normalize(s): # グリッドの # マスの点集合を与えると最小の x 座標と最小の y 座標がともに 0 となるように平行移動して返す
例)normalize(convert(h,w,A))
cumulativeSum_1D(A) #配列Aの累積和
cumulativeSum_2D(S): #二次元配列Sの累積和 => 二次元リスト
string_to_runLength(S: str) #文字列/リストからラングレス圧縮 => [(文字,個数), ...]の二次元リスト
runLength_to_string(L: "list[tuple]") #ラングレス圧縮 => 文字列
bfs(i,G) # i:始点 => dist,pre
bfs01(i,G) # i:始点 => dist
dijkstra(s,G): #s:始点 => cost,pre | G:タプルの中身(コスト,行先)
coordinates(A) # 変換表(元の値 : 座標圧縮の値),変換表2(座標圧縮の値: 元の値), 圧縮後配列
eng_L() #英小文字のリスト
ENG_L() #英大文字のリスト
bit_len(n): #bit長
bit_cnt(n): # bitにしたときの1の数
idx_le(A, x) # x 以下の最大の要素位置 / なければ "No"
idx_lt(A, x) # x 未満の最大の要素位置 / なければ "No"
idx_ge(A, x) # x 以上の最小の要素位置 / なければ "No"
idx_gt(A, x) # x 超過の最小の要素位置 / なければ "No"
cnt_le(A, x) # x 以下の要素の個数
cnt_lt(A, x) # x 未満の要素の個数
cnt_ge(A, x) # x 以上の要素の個数
cnt_gt(A, x) # x 超過の要素の個数
###数学ライブラリ###
allAND(A): # 配列Aの総AND
allOR(A): # 配列Aの総OR
allXOR(A): # 配列Aの総XOR
allGCD(A): # 配列Aの総GCD
mex(A) #配列Aのmexを求める
gcd(a,b) #aとbの最大公約数を求める
lcm(a,b) #aとbの最小公倍数を求める
extgcd(a, b): # a,b =>ax+by=gcd(a,b)を満たす(g,x,y) a,bが互いに素のとき、xはaのbを法とする逆元
fact_L(n,mod): # [0!, 1! ..., n!] を返す
bitCount_L(n): # n以下のそれぞれのbitカウントを返す
factorial(n,m) #nの階乗 | m:mod(デフォなし)
nPr(n,r,m) #順列nPr | m:mod(デフォなし)
nCr(n,r,m) #組み合わせ,nCr | m:mod(デフォなし)
nCrm(n,r,m) #逆元を用いた組み合わせnCr%mod
divisor_L(n) #nの約数のリスト
is_prime(n) #素数判定 => True/False
prime_L(n) #nまでの素数のリスト
primeFactorization_2L(n) #2以上の整数n => [[素因数, 指数], ...]の2次元リスト
floorsqrt(n): # N => ⌊√N⌋
decimal_to_nAry(num_10,n) #10進数からn進数へ変換する(n<=36) |int型 => str型
nAry_to_decimal(num_n,n) #n進数から10進数へ変換する(n<=36) | str型 => int型
roundOff(x,d): #四捨五入する x:対象の数字, d:四捨五入する位(正|負) => float型の数値
###幾何ライブラリ###
dsin(d): #度数法でsinを計算する
dcos(d): #度数法でcosを計算する
rotate(x,y,d,cx,cy): #P(x,y)をA(cx,cy)を中心としてに反時計回りにd°回転(デフォ原点) => [x,y]
findAngle(O,A,B) #∠AOBを求める(弧度法) | 引数はそれぞれ[x,y(=座標)]
outerProduct(Av,Bv) #二次元ベクトルの外積(=符号付面積)を求める(a×b) | 引数はそれぞれ[x,y(=座標)]
CCW(O,A,B) #Oを中心として、Aから見たAとBの位置関係
=> -1:時計回り, 0:一直線上, 1:反時計回り | 引数はそれぞれ[x,y(=座標)]
matrixMultiplication_2D(a,b,m) #行列の掛け算(a×b) m:mod | 引数は二次元リスト
matrixExponentiation_2D(x,n m)#行列の累乗 (x^n) m:mod | 引数は二次元リスト
twoCircles(A,B): #二つの円の半径の位置関係 | 引数はそれぞれ[x,y(=座標),r(=半径)]
=> 1, 2, 3, 4, 5 各数字に対応する位置関係の説明は上記参照
###デバッグ用ライブラリ###
TS(_str) # 変数/リストに格納されている値を確認 => 〇〇:××
T2d(A): # 二次元配列の確認用
T3d(A): # 三次元配列の確認用
BR() # 横線で区切りを入れる
###文法チートシート###
|S|<x => "0"*(x-|S|) + S : str(n).zfill(x)
全部大文字に変換：str.upper()
全部小文字に変換：str.lower()
先頭のみ大文字に変換：str.capitalize()
各単語の先頭のみ大文字に変換（タイトルケース）:str.title()
大文字と小文字を入れ替える：str.swapcase()
文字 → ASCIIコード ord(s)
ASCIIコード → 文字 chr(x)
ASCII表
65:A ~ 90:Z
97:a ~ 122:z
'''
#PyPyで再帰関数を用いる場合はコメントを外す----------------------------------
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
#----------------------------------------------------------------------------
x,a,d,n = MI()
m = a
M = a+d*(n-1)
ans = min(abs(m-x),abs(M-x))
if(d==0):
print(ans)
exit()
k = (x+d-a)//d
for i in range(max(1,k-5),min(k+5,n+1)):
v = a + d*(i-1)
ans = min(ans,abs(v-x))
print(ans)
| ConDefects/ConDefects/Code/abc255_c/Python/45116616 |
condefects-python_data_2856 | print('oiunt'[[*open(0)][1].replace('.','')!='|*|'::2])
_,s=open(0);print('oiunt'[s.replace('.','')=='|*|\n'::2]) | ConDefects/ConDefects/Code/abc299_a/Python/46177642 |
condefects-python_data_2857 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor,gcd
from operator import mul
from functools import reduce
from copy import deepcopy
from pprint import pprint
sys.setrecursionlimit(10 ** 9)
InF = 10 ** 40
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(input())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return input()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
MOD = 998244353
def f(x,bit):
ok=2
ng=100000
while ng>ok+1:
mid = (ok + ng) // 2
m=1
ret=0
for g in range(6):
b=bit>>g&1
ret+=m*b
m=m*mid
if ret>x:
ng=mid
elif ret==x:
return mid
else:
ok=mid
return 0
t=I()
for _ in range(t):
n=I()
ans=set()
for i in range(2,1025):
flg=0
ni = n
while ni:
if ni%i>=2:
break
ni//=i
else:
ans.add(i)
for j in range(2**6):
ti=f(n,j)
if ti:
ans.add(ti)
print(len(ans))
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor,gcd
from operator import mul
from functools import reduce
from copy import deepcopy
from pprint import pprint
sys.setrecursionlimit(10 ** 9)
InF = 10 ** 40
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(input())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return input()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
MOD = 998244353
def f(x,bit):
ok=2
ng=10**18+100
while ng>ok+1:
mid = (ok + ng) // 2
m=1
ret=0
for g in range(6):
b=bit>>g&1
ret+=m*b
m=m*mid
if ret>x:
ng=mid
elif ret==x:
return mid
else:
ok=mid
return 0
t=I()
for _ in range(t):
n=I()
ans=set()
for i in range(2,1025):
flg=0
ni = n
while ni:
if ni%i>=2:
break
ni//=i
else:
ans.add(i)
for j in range(2**6):
ti=f(n,j)
if ti:
ans.add(ti)
print(len(ans))
| ConDefects/ConDefects/Code/abc293_f/Python/45665153 |
condefects-python_data_2858 |
def solve():
from sys import stdin
def input():
return stdin.readline().rstrip()
n, t, l = map(int, input().split())
edges = []
for i in range(t):
x, y = map(int, input().split())
x, y = x - 1, y - 1
edges.append((x, y, i + 1))
def mat_prod(m1, m2):
return [[min(max(m1[i][k], m2[k][j]) for k in range(n)) for j in range(n)] for i in range(n)]
def mat_pow(m, p):
if p == 1:
return m
mh = mat_pow(m, p // 2)
ans = mat_prod(mh, mh)
if p % 2:
ans = mat_prod(ans, m)
return ans
def mat_vec(m, v):
return [min(max(m[i][k], v[k]) for k in range(n)) for i in range(n)]
infty = l + 10
mt = [[infty] * n for i in range(n)]
for x, y, ti in edges:
mt[y][x] = ti
ve = [infty] * n
ve[0] = 0
mp = mat_pow(mt, l)
ans = mat_vec(mp, ve)
for i in range(n):
if ans[i] == infty:
ans[i] = -1
print(*ans)
solve()
def solve():
from sys import stdin
def input():
return stdin.readline().rstrip()
n, t, l = map(int, input().split())
edges = []
for i in range(t):
x, y = map(int, input().split())
x, y = x - 1, y - 1
edges.append((x, y, i + 1))
def mat_prod(m1, m2):
return [[min(max(m1[i][k], m2[k][j]) for k in range(n)) for j in range(n)] for i in range(n)]
def mat_pow(m, p):
if p == 1:
return m
mh = mat_pow(m, p // 2)
ans = mat_prod(mh, mh)
if p % 2:
ans = mat_prod(ans, m)
return ans
def mat_vec(m, v):
return [min(max(m[i][k], v[k]) for k in range(n)) for i in range(n)]
infty = t + 10
mt = [[infty] * n for i in range(n)]
for x, y, ti in edges:
mt[y][x] = ti
ve = [infty] * n
ve[0] = 0
mp = mat_pow(mt, l)
ans = mat_vec(mp, ve)
for i in range(n):
if ans[i] == infty:
ans[i] = -1
print(*ans)
solve()
| ConDefects/ConDefects/Code/abc236_g/Python/30741132 |
condefects-python_data_2859 | import sys
input = sys.stdin.readline
inf = 10 ** 18
def Matprod(A, B, N):
temp = [inf] * N*N
for i in range(N):
for j in range(N):
ij = i * N + j
for k in range(N):
temp[ij] = min(temp[ij], max(A[i*N+k], B[k*N+j]))
return temp
def Matpow_Linear(A, M, N):
Mat = [inf] * N*N
for i in range(N):
Mat[i*N+i] = 1
while M:
if M & 1:
Mat = Matprod(Mat, A, N)
A = Matprod(A, A, N)
M >>= 1
return Mat
N, T, L = map(int, input().split())
N2 = N * N
G = [inf] * N2
for t in range(T):
u, v = map(int, input().split())
u, v = u - 1, v - 1
G[v*N+u] = t
G = Matpow_Linear(G, L, N)
ans = []
for i in range(N):
if G[i*N] == inf:
ans.append(-1)
else:
ans.append(G[i*N] + 1)
print(*ans)
import sys
input = sys.stdin.readline
inf = 10 ** 18
def Matprod(A, B, N):
temp = [inf] * N*N
for i in range(N):
for j in range(N):
ij = i * N + j
for k in range(N):
temp[ij] = min(temp[ij], max(A[i*N+k], B[k*N+j]))
return temp
def Matpow_Linear(A, M, N):
Mat = [inf] * N*N
for i in range(N):
Mat[i*N+i] = -1
while M:
if M & 1:
Mat = Matprod(Mat, A, N)
A = Matprod(A, A, N)
M >>= 1
return Mat
N, T, L = map(int, input().split())
N2 = N * N
G = [inf] * N2
for t in range(T):
u, v = map(int, input().split())
u, v = u - 1, v - 1
G[v*N+u] = t
G = Matpow_Linear(G, L, N)
ans = []
for i in range(N):
if G[i*N] == inf:
ans.append(-1)
else:
ans.append(G[i*N] + 1)
print(*ans) | ConDefects/ConDefects/Code/abc236_g/Python/55003330 |
condefects-python_data_2860 | n, t, l = map(int, input().split())
mat = [[t+1]*n for i in range(n)]
for i in range(1, t+1):
u, v = map(int, input().split())
mat[u-1][v-1] = i
def mul(A, B):
res = [[t+1]*n for i in range(n)]
for i in range(n):
for j in range(n):
for k in range(n):
res[i][k] = min(res[i][j], max(A[i][j], B[j][k]))
return res
def mat_pow(mat, k):
res = [[t+1]*n for i in range(n)]
for i in range(n):
res[i][i] = 0
while k:
if k&1:
res = mul(res, mat)
mat = mul(mat, mat)
k >>= 1
return res
res = mat_pow(mat, l)
res = res[0]
for i in range(n):
if res[i] > t:
res[i] = -1
print(*res)
n, t, l = map(int, input().split())
mat = [[t+1]*n for i in range(n)]
for i in range(1, t+1):
u, v = map(int, input().split())
mat[u-1][v-1] = i
def mul(A, B):
res = [[t+1]*n for i in range(n)]
for i in range(n):
for j in range(n):
for k in range(n):
res[i][k] = min(res[i][k], max(A[i][j], B[j][k]))
return res
def mat_pow(mat, k):
res = [[t+1]*n for i in range(n)]
for i in range(n):
res[i][i] = 0
while k:
if k&1:
res = mul(res, mat)
mat = mul(mat, mat)
k >>= 1
return res
res = mat_pow(mat, l)
res = res[0]
for i in range(n):
if res[i] > t:
res[i] = -1
print(*res)
| ConDefects/ConDefects/Code/abc236_g/Python/28766467 |
condefects-python_data_2861 | j_list=['a','b','c','d','e','f','g','h']
str_list = [input() for _ in range(8)]
counter = 0
for i in str_list:
for j in range(8):
if(i[j]=='*'):
print(counter)
print(j)
print(j_list[j]+str(8-counter))
break
counter += 1
j_list=['a','b','c','d','e','f','g','h']
str_list = [input() for _ in range(8)]
counter = 0
for i in str_list:
for j in range(8):
if(i[j]=='*'):
print(j_list[j]+str(8-counter))
break
counter += 1
| ConDefects/ConDefects/Code/abc296_b/Python/45538761 |
condefects-python_data_2862 | class Motion:
def __init__(self) -> None:
self.dx = 1
self.dy = 0
self.x = 0
self.y = 0
def rotate(self) -> None:
self.dx, self.dy = self.y, -self.dx
def move(self) -> None:
self.x += self.dx
self.y += self.dy
@property
def get_x(self) -> int:
return self.x
@property
def get_y(self) -> int:
return self.y
n = int(input())
t = input()
motion = Motion()
for c in t:
if c == "S":
motion.move()
else:
motion.rotate()
print(f"{motion.get_x} {motion.get_y}")
class Motion:
def __init__(self) -> None:
self.dx = 1
self.dy = 0
self.x = 0
self.y = 0
def rotate(self) -> None:
self.dx, self.dy = self.dy, -self.dx
def move(self) -> None:
self.x += self.dx
self.y += self.dy
@property
def get_x(self) -> int:
return self.x
@property
def get_y(self) -> int:
return self.y
n = int(input())
t = input()
motion = Motion()
for c in t:
if c == "S":
motion.move()
else:
motion.rotate()
print(f"{motion.get_x} {motion.get_y}")
| ConDefects/ConDefects/Code/abc244_b/Python/45713633 |
condefects-python_data_2863 | N = int(input())
A = [list(input()) for _ in range(N)]
rotate_list = []
for i in range(N):
rotate_list.append(A[0][i])
for i in range(1, N):
rotate_list.append(A[i][N-1])
for i in reversed(range(0, N-1)):
rotate_list.append(A[N-1][i])
for i in reversed(range(1, N-1)):
rotate_list.append(A[i][0])
for i in range(N):
rotate_list.append(A[0][i])
cnt = -1
for i in range(N):
A[0][i] = rotate_list[cnt]
cnt += 1
for i in range(1, N):
A[i][N-1] = rotate_list[cnt]
cnt += 1
for i in reversed(range(0, N-1)):
A[N-1][i] = rotate_list[cnt]
cnt += 1
for i in reversed(range(1, N-1)):
A[i][0] = rotate_list[cnt]
cnt += 1
for i in range(N):
for j in range(N):
print(A[i][j], end="")
print("")
N = int(input())
A = [list(input()) for _ in range(N)]
rotate_list = []
for i in range(N):
rotate_list.append(A[0][i])
for i in range(1, N):
rotate_list.append(A[i][N-1])
for i in reversed(range(0, N-1)):
rotate_list.append(A[N-1][i])
for i in reversed(range(1, N-1)):
rotate_list.append(A[i][0])
cnt = -1
for i in range(N):
A[0][i] = rotate_list[cnt]
cnt += 1
for i in range(1, N):
A[i][N-1] = rotate_list[cnt]
cnt += 1
for i in reversed(range(0, N-1)):
A[N-1][i] = rotate_list[cnt]
cnt += 1
for i in reversed(range(1, N-1)):
A[i][0] = rotate_list[cnt]
cnt += 1
for i in range(N):
for j in range(N):
print(A[i][j], end="")
print("") | ConDefects/ConDefects/Code/abc309_b/Python/45722179 |
condefects-python_data_2864 | import numpy as np
import sys
from functools import lru_cache
sys.setrecursionlimit(int(1e7))
from collections import *
import heapq
import bisect
import itertools
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x): # 多用すると重い
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
def __str__(self):
return "\n".join(f"{r}: {m}" for r, m in self.all_group_members().items())
# https://raw.githubusercontent.com/shakayami/ACL-for-python/master/segtree.py
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 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 and (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)])
def get_list(self):
return [self.get(i) for i in range(self.n)] # オリジナルで追加
# RMQのとき
# def op(x, y):
# return x if x < y else y
# seg = segtree([10**9] * N, op, 10**9) # Vの要素とEの値は同じにする #10**9 -> INF
# seg.prod(l, r) # op(a[l],...a[r-1])を返す
class BIT:
def __init__(self, n):
self.n = len(n) if isinstance(n, list) else n
self.size = 1 << (self.n - 1).bit_length()
if isinstance(n, list): # nは1-indexedなリスト
a = [0]
for p in n:
a.append(p + a[-1])
a += [a[-1]] * (self.size - self.n)
self.d = [a[p] - a[p - (p & -p)] for p in range(self.size + 1)]
else: # nは大きさ
self.d = [0] * (self.size + 1)
def __repr__(self):
p = self.size
res = []
while p > 0:
res2 = []
for r in range(p, self.size + 1, p * 2):
l = r - (r & -r) + 1
res2.append(f"[{l}, {r}]:{self.d[r]}")
res.append(" ".join(res2))
p >>= 1
res.append(f"{[self.sum(p + 1) - self.sum(p) for p in range(self.size)]}")
return "\n".join(res)
def add(self, p, x): # O(log(n)), 点pにxを加算
assert p > 0
while p <= self.size:
self.d[p] += x
p += p & -p
def get(self, p, default=None): # O(log(n))
assert p > 0
return (
self.sum(p) - self.sum(p - 1)
if 1 <= p <= self.n or default is None
else default
)
def sum(self, p): # O(log(n)), 閉区間[1, p]の累積和
assert p >= 0
res = 0
while p > 0:
res += self.d[p]
p -= p & -p
return res
def lower_bound(self, x): # O(log(n)), x <= 閉区間[1, p]の累積和 となる最小のp
if x <= 0:
return 0
p, r = 0, self.size
while r > 0:
if p + r <= self.n and self.d[p + r] < x:
x -= self.d[p + r]
p += r
r >>= 1
return p + 1
class MultiSet:
# n: サイズ、compress: 座圧対象list-likeを指定(nは無効)
# multi: マルチセットか通常のOrderedSetか
def __init__(self, n=0, *, compress=[], multi=True):
self.multi = multi
self.inv_compress = (
sorted(set(compress)) if len(compress) > 0 else [i for i in range(n)]
)
self.compress = {k: v for v, k in enumerate(self.inv_compress)}
self.counter_all = 0
self.counter = [0] * len(self.inv_compress)
self.bit = BIT(len(self.inv_compress))
def add(self, x, n=1): # O(log n)
if not self.multi and n != 1:
raise KeyError(n)
x = self.compress[x]
count = self.counter[x]
if count == 0 or self.multi: # multiなら複数カウントできる
self.bit.add(x + 1, n)
self.counter_all += n
self.counter[x] += n
def remove(self, x, n=1): # O(log n)
if not self.multi and n != 1:
raise KeyError(n)
x = self.compress[x]
count = self.bit.get(x + 1)
if count < n:
raise KeyError(x)
self.bit.add(x + 1, -n)
self.counter_all -= n
self.counter[x] -= n
def __repr__(self):
return f'MultiSet {{{(", ".join(map(str, list(self))))}}}'
def __len__(self): # oprator len: O(1)
return self.counter_all
def count(self, x): # O(1)
return self.counter[self.compress[x]] if x in self.compress else 0
def __getitem__(self, i): # operator []: O(log n)
if i < 0:
i += len(self)
x = self.bit.lower_bound(i + 1)
if x > self.bit.n:
raise IndexError("list index out of range")
return self.inv_compress[x - 1]
def __contains__(self, x): # operator in: O(1)
return self.count(x) > 0
def bisect_left(self, x): # O(log n)
return self.bit.sum(bisect.bisect_left(self.inv_compress, x))
def bisect_right(self, x): # O(log n)
return self.bit.sum(bisect.bisect_right(self.inv_compress, x))
# 宣言方法
# MultiSet(compress=X,multi=False)
# MultiSet(N+1,multi=True)
# リストを渡すと座標圧縮して返してくれる
def compress(arr):
(*XS,) = set(arr)
XS.sort()
return {cmp_e: cmp_i for cmp_i, cmp_e in enumerate(XS)}
def ctov(c):
return ord(c) - ord("a")
def CTOV(c):
return ord(c) - ord("A")
if n < r or r < 0:
return 0
elif r == 0:
return 1
return factorial[n] * inverse[r] % MOD * inverse[n - r] % MOD
dxdy1 = ((0, 1), (0, -1), (1, 0), (-1, 0))
dxdy2 = ((0, 1), (0, -1), (1, 0), (-1, 0), (1, 1), (-1, -1), (1, -1), (-1, 1))
dxdy3 = ((0, 1), (1, 0))
INF = float("inf")
MOD = 998244353
mod = 998244353
# memo : len([a,b,...,z])==26
N, M = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
D = list(map(int, input().split()))
X = B + D
query = []
for i in range(N):
query.append((A[i], 0, B[i]))
for i in range(M):
query.append((C[i], 1, D[i]))
query.sort()
S = MultiSet(compress=X, multi=True)
for _, state, x in query:
if state == 0:
S.add(x)
else:
if len(S) == 0:
continue
point = S.bisect_right(x)
print(S, x, point)
if point == 0:
continue
S.remove(S[point - 1])
if len(S) == 0:
print("Yes")
else:
print("No")
import numpy as np
import sys
from functools import lru_cache
sys.setrecursionlimit(int(1e7))
from collections import *
import heapq
import bisect
import itertools
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x): # 多用すると重い
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
def __str__(self):
return "\n".join(f"{r}: {m}" for r, m in self.all_group_members().items())
# https://raw.githubusercontent.com/shakayami/ACL-for-python/master/segtree.py
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 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 and (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)])
def get_list(self):
return [self.get(i) for i in range(self.n)] # オリジナルで追加
# RMQのとき
# def op(x, y):
# return x if x < y else y
# seg = segtree([10**9] * N, op, 10**9) # Vの要素とEの値は同じにする #10**9 -> INF
# seg.prod(l, r) # op(a[l],...a[r-1])を返す
class BIT:
def __init__(self, n):
self.n = len(n) if isinstance(n, list) else n
self.size = 1 << (self.n - 1).bit_length()
if isinstance(n, list): # nは1-indexedなリスト
a = [0]
for p in n:
a.append(p + a[-1])
a += [a[-1]] * (self.size - self.n)
self.d = [a[p] - a[p - (p & -p)] for p in range(self.size + 1)]
else: # nは大きさ
self.d = [0] * (self.size + 1)
def __repr__(self):
p = self.size
res = []
while p > 0:
res2 = []
for r in range(p, self.size + 1, p * 2):
l = r - (r & -r) + 1
res2.append(f"[{l}, {r}]:{self.d[r]}")
res.append(" ".join(res2))
p >>= 1
res.append(f"{[self.sum(p + 1) - self.sum(p) for p in range(self.size)]}")
return "\n".join(res)
def add(self, p, x): # O(log(n)), 点pにxを加算
assert p > 0
while p <= self.size:
self.d[p] += x
p += p & -p
def get(self, p, default=None): # O(log(n))
assert p > 0
return (
self.sum(p) - self.sum(p - 1)
if 1 <= p <= self.n or default is None
else default
)
def sum(self, p): # O(log(n)), 閉区間[1, p]の累積和
assert p >= 0
res = 0
while p > 0:
res += self.d[p]
p -= p & -p
return res
def lower_bound(self, x): # O(log(n)), x <= 閉区間[1, p]の累積和 となる最小のp
if x <= 0:
return 0
p, r = 0, self.size
while r > 0:
if p + r <= self.n and self.d[p + r] < x:
x -= self.d[p + r]
p += r
r >>= 1
return p + 1
class MultiSet:
# n: サイズ、compress: 座圧対象list-likeを指定(nは無効)
# multi: マルチセットか通常のOrderedSetか
def __init__(self, n=0, *, compress=[], multi=True):
self.multi = multi
self.inv_compress = (
sorted(set(compress)) if len(compress) > 0 else [i for i in range(n)]
)
self.compress = {k: v for v, k in enumerate(self.inv_compress)}
self.counter_all = 0
self.counter = [0] * len(self.inv_compress)
self.bit = BIT(len(self.inv_compress))
def add(self, x, n=1): # O(log n)
if not self.multi and n != 1:
raise KeyError(n)
x = self.compress[x]
count = self.counter[x]
if count == 0 or self.multi: # multiなら複数カウントできる
self.bit.add(x + 1, n)
self.counter_all += n
self.counter[x] += n
def remove(self, x, n=1): # O(log n)
if not self.multi and n != 1:
raise KeyError(n)
x = self.compress[x]
count = self.bit.get(x + 1)
if count < n:
raise KeyError(x)
self.bit.add(x + 1, -n)
self.counter_all -= n
self.counter[x] -= n
def __repr__(self):
return f'MultiSet {{{(", ".join(map(str, list(self))))}}}'
def __len__(self): # oprator len: O(1)
return self.counter_all
def count(self, x): # O(1)
return self.counter[self.compress[x]] if x in self.compress else 0
def __getitem__(self, i): # operator []: O(log n)
if i < 0:
i += len(self)
x = self.bit.lower_bound(i + 1)
if x > self.bit.n:
raise IndexError("list index out of range")
return self.inv_compress[x - 1]
def __contains__(self, x): # operator in: O(1)
return self.count(x) > 0
def bisect_left(self, x): # O(log n)
return self.bit.sum(bisect.bisect_left(self.inv_compress, x))
def bisect_right(self, x): # O(log n)
return self.bit.sum(bisect.bisect_right(self.inv_compress, x))
# 宣言方法
# MultiSet(compress=X,multi=False)
# MultiSet(N+1,multi=True)
# リストを渡すと座標圧縮して返してくれる
def compress(arr):
(*XS,) = set(arr)
XS.sort()
return {cmp_e: cmp_i for cmp_i, cmp_e in enumerate(XS)}
def ctov(c):
return ord(c) - ord("a")
def CTOV(c):
return ord(c) - ord("A")
if n < r or r < 0:
return 0
elif r == 0:
return 1
return factorial[n] * inverse[r] % MOD * inverse[n - r] % MOD
dxdy1 = ((0, 1), (0, -1), (1, 0), (-1, 0))
dxdy2 = ((0, 1), (0, -1), (1, 0), (-1, 0), (1, 1), (-1, -1), (1, -1), (-1, 1))
dxdy3 = ((0, 1), (1, 0))
INF = float("inf")
MOD = 998244353
mod = 998244353
# memo : len([a,b,...,z])==26
N, M = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
D = list(map(int, input().split()))
X = B + D
query = []
for i in range(N):
query.append((A[i], 0, B[i]))
for i in range(M):
query.append((C[i], 1, D[i]))
query.sort()
S = MultiSet(compress=X, multi=True)
for _, state, x in query:
if state == 0:
S.add(x)
else:
if len(S) == 0:
continue
point = S.bisect_right(x)
#print(S, x, point)
if point == 0:
continue
S.remove(S[point - 1])
if len(S) == 0:
print("Yes")
else:
print("No") | ConDefects/ConDefects/Code/abc245_e/Python/45539466 |