input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
a,b=[],[]
for i in range(n):
x,y = list(map(int,input().split()))
a.append(x)
b.append(y)
a=list(reversed(a))
b=list(reversed(b))
OK=0
for i in range(n):
A=a[i]+OK
if A<b[i]:
ok=b[i]-A
if A==b[i]:
continue
else:
ok=-(-A//b[... | n = int(eval(input()))
a,b=[],[]
for i in range(n):
x,y = list(map(int,input().split()))
a.append(x)
b.append(y)
a=list(reversed(a))
b=list(reversed(b))
OK=0
for i in range(n):
A=a[i]+OK
if A==b[i]:
continue
else:
ok=-(-A//b[i])*b[i]-A
OK+=ok
print(OK)... | p03821 |
n = int(eval(input()))
ab = [list(map(int, input().split())) for i in range(n)][::-1]
ans = 0
for a, b in ab:
tmp = a
while tmp % b != 0:
tmp += 1
for i in range(n):
ab[i][0] += tmp - a
ans += tmp - a
print(ans) | n = int(eval(input()))
ab = [list(map(int, input().split())) for i in range(n)][::-1]
ans = 0
for a, b in ab:
a += ans
# 負の剰余。
ans += -a % b
print(ans) | p03821 |
def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
ab = [list(map(int, (str(i) + " " + input().rstrip('\n')).split())) for i in range(n)]
ab.sort(reverse=True)
cnt = 0
for i, a, b in ab:
if (a + cnt) % b != 0:
cnt += (b - (a + cnt) %... | def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
ab = [list(map(int, input().rstrip('\n').split())) for _ in range(n)]
t = 0
for i in range(n-1, -1, -1):
while True:
if (ab[i][0] + t) % ab[i][1] == 0:
break
... | p03821 |
def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
ab = [list(map(int, input().rstrip('\n').split())) for _ in range(n)]
t = 0
for i in range(n-1, -1, -1):
while True:
if (ab[i][0] + t) % ab[i][1] == 0:
break
... | def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
ab = [list(map(int, input().rstrip('\n').split())) for _ in range(n)]
t = 0
for i in range(n):
a, b = ab[-i-1]
a += t
if a % b != 0:
t += ((a + b - 1) // b * b - a)
... | p03821 |
N = int(eval(input()))
src = [list(map(int,input().split())) for i in range(N)]
ans = 0
for a,b in reversed(src):
r = (ans+a) % b
if r == 0: continue
ans += (b-r)
print(ans)
| N = int(eval(input()))
src = [tuple(map(int,input().split())) for i in range(N)]
ans = 0
for a,b in reversed(src):
a += ans
ans += (b-a)%b
print(ans) | p03821 |
N = int(eval(input()))
src = [tuple(map(int,input().split())) for i in range(N)]
ans = 0
for a,b in src[::-1]:
ans += (-(a+ans))%b
print(ans) | N = int(eval(input()))
AB = [tuple(map(int,input().split())) for i in range(N)]
z = 0
for a,b in AB[::-1]:
z += -(z+a)%b
print(z) | p03821 |
n = int(eval(input()))
a = []
b = []
for i in range(n):
A, B = list(map(int, input().split()))
a.append(A)
b.append(B)
ans = 0
a = a[::-1]
b = b[::-1]
for i in range(n):
if a[i] % b[i] == 0:
continue
p = (a[i] // b[i] + 1) * b[i] - a[i]
ans += p
for j in range(i, n):
... | n = int(eval(input()))
a = []
b = []
for i in range(n):
A, B = list(map(int, input().split()))
a.append(A)
b.append(B)
ans = 0
a = a[::-1]
b = b[::-1]
for i in range(n):
a[i] += ans
if a[i] % b[i] == 0:
continue
ans += (a[i] // b[i] + 1) * b[i] - a[i]
print(ans) | p03821 |
n = int(eval(input()))
a = []
b = []
for i in range(n):
A, B = list(map(int, input().split()))
a.append(A)
b.append(B)
ans = 0
a = a[::-1]
b = b[::-1]
for i in range(n):
a[i] += ans
if a[i] % b[i] == 0:
continue
ans += (a[i] // b[i] + 1) * b[i] - a[i]
print(ans) | n = int(eval(input()))
a = []
b = []
for i in range(n):
A, B = list(map(int, input().split()))
a.append(A)
b.append(B)
a.reverse()
b.reverse()
ans = 0
for i in range(n):
if (a[i] + ans) % b[i]:
ans += b[i] - (a[i] + ans) % b[i]
print(ans) | p03821 |
N = int(eval(input()))
ablist = []
for _ in range(N):
ab = list(map(int, input().split()))
ablist.append(ab)
ans = 0
for a, b in ablist[::-1]:
a += ans
if a % b == 0:
continue
else:
ans += (b - a % b)
print(ans)
| N = int(eval(input()))
ABlist = [tuple(map(int, input().split())) for _ in range(N)]
ans = 0
for a, b in ABlist[::-1]:
a += ans
if a % b == 0:
continue
else:
ans += (b - a % b)
print(ans)
| p03821 |
n=int(eval(input()))
A,B=[],[]
for _ in range(n):
a,b=list(map(int,input().split()))
A.append(a)
B.append(b)
ans=0
for i in range(n-1,-1,-1):
a,b=A[i],B[i]
a+=ans
ans+=b-a%b if a%b else 0
print(ans) | n=int(eval(input()))
A,B=[],[]
for _ in range(n):
a,b=list(map(int,input().split()))
A.append(a)
B.append(b)
ans=0
for a,b in zip(A[::-1],B[::-1]):
a+=ans
ans+=b-a%b if a%b else 0
print(ans) | p03821 |
n = int(eval(input()))
ab = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for a, b in reversed(ab):
r = (ans+a) % b
if r != 0:
ans += b - r
print(ans) | n = int(eval(input()))
ab = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for a, b in reversed(ab):
a += ans
ans += (-a) % b
print(ans) | p03821 |
n = int(eval(input()))
ab = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for a, b in reversed(ab):
while (a+ans) % b != 0:
ans += 1
print(ans) | n = int(eval(input()))
ab = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for a, b in reversed(ab):
if (a + ans) % b != 0:
ans += b - (a + ans) % b
print(ans) | p03821 |
N, *AB = list(map(int, open(0).read().split()))
ans = 0
for i in range(N):
index = N - 1 - i
a = AB[index * 2 + 0] + ans
b = AB[index * 2 + 1]
remainder = a % b
ans += (b - remainder) % b
print(ans)
| def main():
N, *AB = list(map(int, open(0).read().split()))
ans = 0
for i in range(N):
index = N - 1 - i
a = AB[index * 2 + 0] + ans
b = AB[index * 2 + 1]
remainder = a % b
ans += (b - remainder) % b
print(ans)
if __name__ == "__main__":
main()
| p03821 |
def main():
N, *AB = list(map(int, open(0).read().split()))
ans = 0
for i in range(N):
index = N - 1 - i
a = AB[index * 2 + 0] + ans
b = AB[index * 2 + 1]
remainder = a % b
ans += (b - remainder) % b
print(ans)
if __name__ == "__main__":
main()
| def main():
N, *AB = list(map(int, open(0).read().split()))
ans = 0
for i in range(N - 1, -1, -1):
a = AB[i * 2 + 0]
b = AB[i * 2 + 1]
ans += (b - a - ans) % b
print(ans)
if __name__ == "__main__":
main()
| p03821 |
a = int(eval(input()))
ar = []
for i in range(a):
l = list(map(int,input().split(" ")))
ar.insert(0,l)
count = 0
for r in ar:
x = r[0] + count
y = r[1]
m = x % y
if m != 0:
count += y - m
print(count) | a = int(eval(input()))
ar = []
for i in range(a):
l = list(map(int,input().split(" ")))
ar.append(l)
ar.reverse()
count = 0
for r in ar:
x = r[0] + count
y = r[1]
m = x % y
if m != 0:
count += y - m
print(count) | p03821 |
n = int(eval(input()))
ABs = [list(map(int, input().split())) for i in range(n)]
ABs = [i for i in reversed(ABs)]
As,Bs = [],[]
for i in range(n):
As.append(ABs[i][0])
Bs.append(ABs[i][1])
cnt = 0
for i in range(n):
plus = 0 if As[i] % Bs[i] == 0 else Bs[i] - As[i] % Bs[i]
As[i:] = list([x... | n = int(eval(input()))
ABs = [list(map(int, input().split())) for i in range(n)]
cnt = 0
for i in range(n):
plus = 0 if (ABs[n-i-1][0] + cnt) % ABs[n-i-1][1] == 0 else ABs[n-i-1][1] - (ABs[n-i-1][0] + cnt) % ABs[n-i-1][1]
cnt += plus
print(cnt) | p03821 |
n = int(eval(input()))
ans = 0
ab = [tuple(map(int,input().split())) for i in range(n)]
a,b = [],[]
for ai,bi in ab:
a.append(ai)
b.append(bi)
c = 0
for i in reversed(list(range(n))):
a[i] += c
while(a[i]%b[i]):
c+=1
a[i]+=1
print(c) | n = int(eval(input()))
ans = 0
a, b = [], []
for i in range(n):
ai, bi = list(map(int, input().split()))
a.append(ai)
b.append(bi)
c = 0
for i in reversed(list(range(n))):
a[i] += c
x = a[i] % b[i]
if x:
if a[i] < b[i]:
c += b[i] - a[i]
elif a[i] >... | p03821 |
N = int(eval(input()))
import math
A = []
B = []
for i in range(N):
a, b = list(map(int,input().split()))
A.append(int(a))
B.append(int(b))
count=0
for i in range(N):
#print(i,A[N-1-i],B[N-1-i])
if A[N-1-i]%B[N-1-i]==0:
n=0
elif A[N-1-i]>B[N-1-i]:
n=math.ceil(A[N-1-i]/B[N-1-i])*B[N... | N = int(eval(input()))
import math
A = []
B = []
for i in range(N):
a, b = list(map(int,input().split()))
A.append(int(a))
B.append(int(b))
n=0
for i in range(N):
#print(i,A[N-1-i]+n,B[N-1-i]+n)
if (A[N-1-i]+n)%(B[N-1-i])==0:
n+=0
elif A[N-1-i]+n>B[N-1-i]:
n+=math.ceil((A[N-1-i... | p03821 |
# https://atcoder.jp/contests/agc009/tasks/agc009_a
n=int(eval(input()))
ab=[tuple(map(int,input().split())) for _ in range(n)]
ans=0
for a,b in reversed(ab):
a+=ans
res=a%b
if res:
ans+=b-res
print(ans) | # https://atcoder.jp/contests/agc009/tasks/agc009_a
import sys
input=sys.stdin.readline
n=int(eval(input()))
ab=[tuple(map(int,input().split())) for _ in range(n)]
ans=0
for a,b in reversed(ab):
a+=ans
res=a%b
if res:
ans+=b-res
print(ans) | p03821 |
N = int(eval(input()))
A = [0]*N
B = [0]*N
for i in range(N):
a, b = list(map(int, input().split()))
A[i] = a
B[i] = b
ans = 0
for i in range(N-1,-1,-1):
A[i] += ans
ans += B[i]*((A[i]+B[i]-1)//B[i]) - A[i]
print(ans)
| import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [0]*N
B = [0]*N
for i in range(N):
a, b = list(map(int, input().split()))
A[i] = a
B[i] = b
ans = 0
for i in range(N-1,-1,-1):
A[i] += ans
if A[i]%B[i] != 0:
ans += B[i]-(A[i]%B[i])
print(ans)
| p03821 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
AB = [0] * N
for i in range(N):
AB[i] = list(map(int, input().split()))
n_press = 0
for A, B in reversed(AB):
_, r, = divmod(A + n_press, B)
n_press += B - r if r > 0 else 0
ans ... | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
AB = [0] * N
for i in range(N):
AB[i] = list(map(int, input().split()))
n_press = 0
for A, B in reversed(AB):
r = (A + n_press) % B
n_press += B - r if r > 0 else 0
ans = n_press... | p03821 |
n=int(eval(input()))
a=[0 for _ in range(n)]
b=[0 for _ in range(n)]
for i in range(n):
a[i],b[i] = list(map(int,input().split()))
cnt=0
for i in range(n):
i=n-1-i
while (a[i]+cnt)%b[i]!=0:
cnt+=1
print(cnt)
| n=int(eval(input()))
a=[0 for _ in range(n)]
b=[0 for _ in range(n)]
for i in range(n):
a[i],b[i] = list(map(int,input().split()))
cnt=0
for i in range(n):
i=n-1-i
if (a[i]+cnt)%b[i]!=0:
cnt+=b[i]-(a[i]+cnt)%b[i]
print(cnt) | p03821 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [0] * N
B = [0] * N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
ans = 0
for i in reversed(list(range(N))):
if (ans + A[i]) % B[i] != 0:
ans += ((ans + A[i]) // B[i] + 1) * B[i] - (ans + A[i])
print(... | import sys
input = sys.stdin.readline
N = int(eval(input()))
A = [0] * N
B = [0] * N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
ans = 0
for i in reversed(list(range(N))):
t = (ans + A[i]) % B[i]
if t != 0:
ans += B[i] - t
print(ans) | p03821 |
n = int(eval(input()))
aa = [0]*n
bb = [0]*n
for i in range(n):
aa[i],bb[i] = list(map(int, input().split()))
ans = 0
for i in range(1,n+1):
cnt = 0
if aa[-i] % bb[-i] > 0:
cnt = ((aa[-i] - 1) // bb[-i] +1) * bb[-i] - aa[-i]
# print(aa[-i], bb[-i], cnt, aa)
ans += cnt
... | n = int(eval(input()))
aa = [0]*n
bb = [0]*n
for i in range(n):
aa[i],bb[i] = list(map(int, input().split()))
ans = 0
for i in range(1,n+1):
cnt = 0
cur = aa[-i] + ans
if cur % bb[-i] > 0:
cnt = ((cur - 1) // bb[-i] +1) * bb[-i] - cur
# print(cur, bb[-i], cnt, aa)
ans... | p03821 |
N=int(eval(input()))
x=[]
for i in range(N):
a,b=list(map(int,input().split()))
x.append([a,b])
x=x[::-1]
ans=0
for i in range(N):
if x[i][0]%x[i][1]!=0:
cnt=x[i][1]-x[i][0]%x[i][1]
ans+=cnt
for j in range(i+1,N):
x[j][0]+=cnt
cnt=0
print(ans) | N=int(eval(input()))
r=[]
bi=[]
for i in range(N):
a,b=list(map(int,input().split()))
bi.append(b)
if a%b==0:
r.append(0)
else:
r.append(b-a%b)
push=0
bi=bi[::-1]
r=r[::-1]
for i in range(N):
if i==0:
push=r[i]
else:
push+=(r[i]-push)%bi[i]
print... | p03821 |
n = int(eval(input()))
AB = [[int(i) for i in input().split()] for i in range(n)]
ans = 0
for i in range(n - 1, -1, -1):
tmp = AB[i][0] % AB[i][1]
if tmp == 0:
x = tmp
else:
x = AB[i][1] - tmp
ans += x
if i > 0:
for j in range(i - 1, -1, -1):
AB[j][0... | n = int(eval(input()))
AB = [[int(i) for i in input().split()] for i in range(n)]
acc = 0
for i in range(n - 1, -1, -1):
tmp = AB[i][0] % AB[i][1]
if tmp == 0:
x = tmp
else:
x = AB[i][1] - tmp
acc += x
if i > 0:
AB[i - 1][0] += acc
#print(AB, x, acc)
... | p03821 |
N = int(eval(input()))
a = list(map(int, input().split()))
aa = [ai - i-1 for i,ai in enumerate(a)]
def tri_search(f:"f(x:float)->float", left, right, iter=100)->float:
for _ in range(iter):
ml = (left*2 + right) / 3
mr = (left + right*2) / 3
if f(ml) < f(mr):
right =... | N = int(eval(input()))
a = list(map(int, input().split()))
aa = [ai - i-1 for i,ai in enumerate(a)]
def tri_search(f:"f(x:float)->float", left, right, iter=100)->float:
for _ in range(iter):
ml = (left*2 + right) / 3
mr = (left + right*2) / 3
if f(ml) < f(mr):
right =... | p03311 |
n = int(eval(input()))
a= [int(i) for i in input().split()]
for i in range(len(a)):
a[i]-=i+1
import math
#import statistics
#b=statistics.median(a)
b=math.floor(sum(a)/n)
def p(b,k):
s=0
t=0
for i in a:
s+=abs(i-b)
t+=abs(i-b-1)
if s>t:
if k==-1:
print(t)
... | n = int(eval(input()))
a= [int(i) for i in input().split()]
for i in range(len(a)):
a[i]-=i+1
aa=sorted(a)
if n%2==0:
b=(aa[int(n/2-1)]+aa[int(n/2)])/2
else:
b=aa[int((n-1)/2)]
s=0
for i in aa:
s+=abs(i-b)
print((int(s)))
| p03311 |
def makelist(n, m):
return [[0 for _ in range(m)] for _ in range(n)]
N = int(eval(input()))
A = list(map(int, input().split()))
def check(b):
res = 0
for i in range(N):
res += abs(A[i] - (b+(i+1)))
#print(b, res)
return res
def ternarySearchInt(small, big):
# 初期条件
... | N = int(eval(input()))
A = list(map(int, input().split()))
for i in range(N):
A[i] -= i+1
A.sort()
mid = A[N//2]
ans = 0
for i in range(N):
ans += abs(A[i] - mid)
print(ans)
| p03311 |
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N = I()
A = LI()
for i in range(N):
A[i] -= i+1
A.sort()
def f(x):
return sum(abs(A[i]-x) for i in range(N))
print((f((A[(N-1)//2]+A[N//2])//2)))
# 中間... | import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | p03311 |
n=int(eval(input()))
arr=list(map(int,input().split()))
pc=0
mc=0
zc=0
p=[]
m=[]
for i in range(n):
arr[i]-=(i+1)
if arr[i]>0:
pc+=1
p.append(arr[i])
elif arr[i]<0:
mc+=1
m.append(arr[i])
else:
zc+=1
p=sorted(p)
m=sorted(m,reverse=True)
diff=0
while 1:
if pc+zc>=mc and... | n=int(eval(input()))
arr=list(map(int,input().split()))
for i in range(n):
arr[i]=arr[i]-(i+1)
arr=sorted(arr)
if n%2==1:
m=arr[n//2]
ans=0
for i in range(n):
ans=ans+abs(arr[i]-m)
print(ans)
else:
m1=arr[n//2]
m2=arr[n//2-1]
ans1=0
ans2=0
for i in range(n):
ans1=ans1+abs(ar... | p03311 |
import math
N=int(input().strip())
a=list(map(int, input().strip().split(' ')))
for i in range(N):
a[i]=a[i]-(i+1)
b=sum(a)/N
ans1=0
ans2=0
for i in range(N):
ans1+=abs(a[i]-math.floor(sum(a)/N))
for i in range(N):
ans2+=abs(a[i]-math.ceil(sum(a)/N))
print((min(ans1,ans2))) | N=int(input().strip())
a=list(map(int, input().strip().split(' ')))
for i in range(N):
a[i]=a[i]-i
a.sort()
m=a[(N-1)//2]
ans=0
for i in range(N):
ans+=abs(a[i]-m)
print(ans) | p03311 |
N = int(eval(input()))
A = list(map(int, input().split()))
A = [A[i]-(i+1) for i in range(N)]
ans = 10 ** 9
#print (min(A))
for i in range(min(A), max(A)+1):
b = [abs(A[j]-i) for j in range(N)]
# print (sum(b))
# print (b)
ans = min(ans, sum(b))
print (ans) | #平均値に近づけるという考え方が間違い-->中央値に近づける
N = int(eval(input()))
A = list(map(int, input().split()))
A = [A[i]-(i+1) for i in range(N)]
A.sort()
center1 = A[N//2]
if N == 1:
center2 = 10 ** 9
else:
center2 = A[(N+2)//2]
ans1 = 0
for i in range(N):
ans1 +=abs(A[i]-center1)
ans2 = 0
for j i... | p03311 |
N = int(eval(input()))
A = list(map(int,input().split()))
from bisect import bisect_left
Ans = 0
pans = 0
low,high = -(10**5),10**9
for i in range(120):
anslow,anshigh = 0,0
for i in range(N):
anslow += abs(A[i]-(i+low))
anshigh += abs(A[i]-(i+high))
if anshigh > anslow:
... | N = int(eval(input()))
A = list(map(int,input().split()))
for i in range(N):
A[i] -= i
A.sort()
Ans = 0
mi = len(A)//2 # 中央値のindex
for i in range(N):
Ans += abs(A[i]-A[mi])
print(Ans)
| p03311 |
def bisect(l, r):
while l < r:
m = (l + r) // 2
s1 = sum(abs(am - m) for am in aam)
s2 = sum(abs(am - m - 1) for am in aam)
if s1 < s2:
r = m
else:
l = m + 1
return l
n = int(eval(input()))
aaa = list(map(int, input().split()))
aam ... | n = int(eval(input()))
aaa = list(map(int, input().split()))
aam = [a - i - 1 for i, a in enumerate(aaa)]
aam.sort()
b = aam[n // 2]
print((sum(abs(am - b) for am in aam)))
| p03311 |
n = int(eval(input()))
a = [int(x) for x in input().split()]
for i in range(n):
a[i] -= i+1
def hoge(b):
v = 0
for x in a:
v += abs(x-b)
return v
tmp = float('inf')
for x in set(a):
if hoge(x) < tmp:
tmp = hoge(x)
print(tmp) | n = int(eval(input()))
a = [int(x) for x in input().split()]
for i in range(n):
a[i] -= i+1
#中央値を求める
a.sort()
if len(a) % 2 == 0:
c = (a[len(a)//2] + a[len(a)//2-1]) // 2
else:
c = a[len(a)//2]
def hoge(b):
v = 0
for x in a:
v += abs(x-b)
return v
print((hoge(c))) | p03311 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = sorted(A[i] - i - 1 for i in range(N))
def sad(b):
return sum(abs(A[i] - i - 1 - b)for i in range(N))
print((min(sad(B[N//2]),sad(B[min(N//2+1,N-1)]))))
| N=int(eval(input()))
B=sorted(int(x)-i-1 for i,x in enumerate(input().split()))
def sad(x):
return sum(abs(b-x)for b in B)
print((sad(B[N//2])))
| p03311 |
eval(input());S=sorted(int(x)-i-1 for i,x in enumerate(input().split()))
print((sum(abs(S[len(S)//2]-s)for s in S)))
| _,a=open(0)
S=sorted(int(x)-i for i,x in enumerate(a.split()))
print((sum(abs(S[len(S)//2]-s)for s in S))) | p03311 |
N = int(eval(input()))
A = list(map(int, input().split()))
A_i = [A[i] - i - 1 for i in range(N)]
A_i.sort()
if N % 2 == 1:
b = A_i[N // 2]
ans = 0
for a in A_i:
ans += abs(a - b)
print(ans)
else:
b1 = A_i[N // 2]
b2 = A_i[N // 2 - 1]
ans1 = 0
ans2 = 0
for ... | N = int(eval(input()))
A = list(map(int, input().split()))
A_i = [A[i] - i - 1 for i in range(N)]
A_i.sort()
b = A_i[N // 2]
ans = 0
for a in A_i:
ans += abs(a - b)
print(ans)
| p03311 |
N = int(eval(input()))
A = list(map(int, input().split()))
A_i = [A[i] - i - 1 for i in range(N)]
A_i.sort()
b = A_i[N // 2]
ans = 0
for a in A_i:
ans += abs(a - b)
print(ans)
| import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A = [a - i - 1 for i, a in enumerate(A)]
A.sort()
i = N // 2
b = A[i]
... | p03311 |
import statistics
n = int(eval(input()))
x = list(map(int, input().split()))
for i in range(n):
x[i] -= i+1
b = statistics.median(x)
ans = 0
for i in range(n):
ans += abs(x[i] - b)
print((int(ans)))
| from statistics import median
n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(n):
a[i] -= i+1
med = median(a)
ans = 0
for i in range(n):
ans += abs(a[i] - med)
print((int(ans))) | p03311 |
n = int(eval(input()))
a = list(map(int, input().split()))
sub = []
for i in range(n):
sub.append(a[i] - i - 1)
sub.sort()
def geta(b):
un=0
for i in range(n):
un+=abs(sub[i]-b)
return un
med = sub[n//2]
ans=geta(med)
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
sub = []
for i in range(n):
sub.append(a[i] - i - 1)
sub.sort()
def geta(b):
un=0
for i in range(n):
un+=abs(sub[i]-b)
return un
med = sub[n//2]
ans=10**20
for i in range(med-1,med+1):
num = geta(i)
if ans > ... | p03311 |
n = int(eval(input()))
l = list(map(int,input().split()))
m = []
for i in range(n):
m.append(l[i]-i)
b = set(m)
max = 0
index = 0
for i in b:
if max < m.count(i):
max = m.count(i)
index = i
ans = 0
for i in range(n):
ans += abs(l[i]-index-i)
print(ans)
| n = int(eval(input()))
l = list(map(int,input().split()))
m = []
for i in range(n):
m.append(l[i]-i-1)
m.sort()
index = n//2
b = m[index]
ans = 0
for i in range(n):
ans += abs(l[i]-b-i-1)
print(ans)
| p03311 |
N = int(eval(input()))
A = list(map(int, input().split()))
A_dash = []
for i, A_i in enumerate(A):
A_dash.append(A_i - (i))
A_dash.sort()
tmp_ans = sum(A_dash)
ans = 0
left, right = min(A_dash), max(A_dash)
mid = (left+right)//2
ans_left, ans_mid, ans_right = 0, 0, 0
for A_dash_i in A_dash:
ans_... | N = int(eval(input()))
A = list(map(int, input().split()))
A_dash = []
for i, A_i in enumerate(A):
A_dash.append(A_i-(i+1))
A_dash.sort()
med = A_dash[N//2]
ans = 0
for i, A_i in enumerate(A_dash):
ans += abs(A_i - (med))
print(ans) | p03311 |
n = int(eval(input()))
a = list(map(int, input().split()))
def sadness(b):
sad = 0
for i, e in enumerate(a):
i += 1
sad += abs(e - (b + i))
return sad
left, right = -10**9, 10**9 + 1
while right - left > 1:
mid = (left + right) // 2
if sadness(mid) > sadness(mid + 1):
left = ... | n = int(eval(input()))
a = list(map(int, input().split()))
def sadness(b):
sad = 0
for i, e in enumerate(a):
i += 1
sad += abs(e - (b + i))
return sad
d = []
for i, e in enumerate(a):
i += 1
d.append(e - i)
d.sort()
if len(d) % 2 == 1:
print((sadness(d[len(d) // 2])))
else... | p03311 |
def main():
from decimal import Decimal
N = int(eval(input()))
*A, = list(map(Decimal, input().split()))
A = [x - i for i, x in enumerate(A, start=1)]
A.sort()
median = -1
if N % 2 == 1:
median = A[N // 2]
else:
median = (A[N // 2 - 1] + A[N // 2]) / 2 # ->... | def main():
N = int(eval(input()))
A = [x - i for i, x in enumerate(map(int, input().split()), start=1)]
A.sort()
m = A[N // 2] # 個数の偶奇によらず、この点は絶対値の総和を最小にする
ans = sum(abs(x - m) for x in A)
print(ans)
if __name__ == '__main__':
main()
| p03311 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | p03311 |
import sys
import math
N = int(eval(input()))
A = [int(x) for x in input().split()]
A2 = [a - i - 1 for i, a in enumerate(A)]
B = sorted(A2)
i1 = int(N/2) - 1
i2 = int(N/2)
b1 = B[i1]
b2 = B[i2]
def calcSad(A2, b):
sum = 0
for i in A2:
sum += abs(i - b)
return sum
... | import sys
import math
N = int(eval(input()))
A = [int(x) for x in input().split()]
A2 = [a - i - 1 for i, a in enumerate(A)]
B = sorted(A2)
b = B[int(N/2)]
A3 = [abs(a - b) for a in A2]
print((sum(A3)))
sys.exit(0)
| p03311 |
N=int(eval(input()))
A=list(map(int,input().split()))
minb=min(min(A),max(A)-N)
maxb=max(max(A),min(A)+N)
ans=float('inf')
for b in range(minb,maxb+1):
d=0
for i in range(N):
d+=abs(A[i]-(b+i))
ans=min(ans,d)
print(ans) | N=int(eval(input()))
A=list(map(int,input().split()))
B=[]
for i in range(N):
B.append(A[i]-(i+1))
B.sort()
b=B[N//2]
ans=0
for i in range(N):
ans+=abs(B[i]-b)
print(ans) | p03311 |
# coding: utf-8
import math
n = int(eval(input()))
#x, y = map(int,input().split())
A = list(map(int,input().split()))
ans = 0
B= []
for i in range(n):
B.append(A[i]-(i+1))
B.sort()
if n==1:
m=B[0]
m2=B[0]
else:
m = B[n//2]
m2=B[n//2+1]
tmp1=0
tmp2=0
#print(m,m2)
for i in range(n... | # coding: utf-8
n = int(eval(input()))
A = list(map(int,input().split()))
L=[]
for i in range(n):
L.append(A[i]-(i+1))
L.sort()
#print(L)
if n==1:
b1=L[0]
b2=L[0]
elif n==2:
b1=L[0]
b2=L[1]
else:
b1=L[n//2]
b2=L[n//2-1]
ans=0
cnt1=0
cnt2=0
for i in range(n):
cnt1+=ab... | p03311 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n = int(readline())
a = list(map(int, readline().split()))
a = sorted(x - i for i, x in enumerate(a))
low = (len(a) + 1) // 2 - 1
high = len(a) // 2
print((sum(a... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, *a = list(map(int, read().split()))
a = sorted(aa - i for i, aa in enumerate(a))
print((sum(a[n // 2:]) - sum(a[:(n + 1) // 2])))
| p03311 |
def main(n,a):
a=sorted([a[i]-i for i in range(n)])
m0=a[n//2]
m1=a[n//2-1]
ans0,ans1=0,0
for i in range(n):
ans0+=abs(a[i]-m0)
ans1+=abs(a[i]-m1)
print((min(ans0,ans1)))
if __name__=='__main__':
import sys
input = sys.stdin.readline
n=int(eval(input()))
a=list(map(int,input().s... | n=int(eval(input()))
a=list(map(int,input().split()))
a=[x-i-1 for i,x in enumerate(a)]
a.sort()
b=a[n//2]
print((sum([abs(x-b) for x in a]))) | p03311 |
n=int(eval(input()))
l=list(map(int,input().split()))
l=[x-i-1 for i,x in enumerate(l)]
ans=10**9
for i in l:
cal=[abs(x-i) for x in l]
ans=min(ans,sum(cal))
print(ans) | n=int(eval(input()))
l=list(map(int,input().split()))
l=sorted([x-i-1 for i,x in enumerate(l)])
x=l[n//2]
print((sum([abs(i-x) for i in l]))) | p03311 |
#coding:utf-8
n = int(eval(input()))
nums = sorted([num - i for i, num in enumerate(list(map(int,input().split())), 1)])
sums = [None for i in range(n)]
sums[0] = nums[0]
allv = sum(nums)
minv = nums[0] * (2 - n) - 2 * sums[0] + allv
for i in range(n-1):
sums[i+1] = sums[i] + nums[i+1]
for b in r... | #coding:utf-8
n = int(eval(input()))
nums = sorted([num - i for i, num in enumerate(list(map(int,input().split())), 1)])
sums = [None for i in range(n)]
sums[0] = nums[0]
allv = sum(nums)
minv = nums[0] * (2 - n) - 2 * sums[0] + allv
for i in range(n-1):
sums[i+1] = sums[i] + nums[i+1]
p = nums[i... | p03311 |
import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n = int(input().rstrip('\n'))
a = list(map(int, input().rstrip('\n').split()))
for i in range(n):
a[i] -= i + 1
a.sort()
t = a[n // 2]
mt = 0
for v in a:
mt += abs(t - v)
print(m... | import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
a = list(map(int, readline().split()))
for i in range(n):
a[i] -= i + 1
a.sort()
t = 0
for v in a:
t += abs(a[n // 2] - v)
print(t)
if __name__ == '... | p03311 |
N = int(eval(input()))
src = list(map(int,input().split()))
mem = [a-i-1 for i,a in enumerate(src)]
center = sorted(mem)[N//2]
ans = 0
for a in mem:
ans += abs(a - center)
print(ans) | N = int(eval(input()))
A = list(map(int,input().split()))
B = [a-i for i,a in enumerate(A)]
B.sort()
m = B[N//2]
ans = 0
for b in B:
ans += abs(m-b)
print(ans) | p03311 |
a = int(eval(input()))
b = list(map(int,input().split()))
for i in range(a):
b[i] -= i + 1
b.sort()
s = 0
co = 0
ss = 0
coco = 0
cococo = 0
summ = 0
su = 0
bb = 0
for i in range(a):
if b[i] < 0:
co += 1
elif b[i] > 0:
coco += 1
else:
cococo += 1
su += abs(b[i])
if co > coco:
w... | a = int(eval(input()))
b = list(map(int,input().split()))
for i in range(a):
b[i] -= i + 1
b.sort()
su = 0
c = b[(a - 1) // 2]
for i in range(a):
su += abs(b[i] - c)
print(su) | p03311 |
import math
N=int(eval(input()))
A=list(map(int,input().split()))
B=[A[i]-i for i in range(N)]
B.sort()
temp=0
if N%2==0:
ans = B[N//2]
ans2= B[N//2 -1]
temp=0
for j in range(N):
temp+= abs(B[j] - ans)
temp2=0
for j in range(N):
temp2+= abs(B[j] - ans2)
ans= min(temp,temp2)
els... | import math
N=int(eval(input()))
A=list(map(int,input().split()))
B=[A[i]-(i+1) for i in range(N)]
B.sort()
temp=0
if N%2==0:
ans = B[N//2]
ans2= B[N//2 -1]
temp=0
for j in range(N):
temp+= abs(B[j] - ans)
temp2=0
for j in range(N):
temp2+= abs(B[j] - ans2)
ans= min(temp,temp2)
... | p03311 |
def func(A,b):
s=0
for i in range(len(A)):
s+=abs(A[i]-(b+i))
return s
N=int(eval(input()))
A=[int(i) for i in input().split(' ')]
MIN=None
for b in range(min(A[0],A[-1]-len(A)),max(A[-1],A[0]+len(A))):
if MIN==None:
MIN=func(A,b)
elif MIN>func(A,b):
MIN=func(A,b)
print(MIN) | N=int(eval(input()))
A=[int(i) for i in input().split(' ')]
for i in range(len(A)):
A[i]-=i+1
A.sort()
if len(A)%2==1:
b=A[(len(A)-1)//2]
else:
b=A[(len(A))//2-1]
s=0
for i in range(len(A)):
s+=abs(A[i]-b)
print(s) | p03311 |
from statistics import median
n=int(eval(input()))
a=list(map(int,input().split()))
mid=0
l=[]
for i in range(n):
l+=[a[i]-i-1]
mid=median(l)
ans=0
for i in range(n):
ans+=abs(a[i]-(mid+i+1))
print((int(ans))) | from statistics import median
n=int(eval(input()))
a=list(map(int,input().split()))
mid=0
l=[]
for i in range(n):
l+=[a[i]-i-1]
mid=median(l) if n%2!=0 else sorted(l)[n//2]
ans=0
for i in range(n):
ans+=abs(a[i]-(mid+i+1))
print((int(ans)))
| p03311 |
N = int(eval(input()))
A = list(map(int,input().split()))
answer = 0
r = 0
flag = 0
gear = 0
for i in range(N) :
A[i] = A[i]-(i+1)
if A[i] <= 0 :
r += 1
answer += abs(A[i])
if r == N :
gear += 1
while flag == 0 :
p = 0
q = 0
if gear == 0 :
for j in range(N) :... | N = int(eval(input()))
A = list(map(int,input().split()))
answer = 0
for i in range(N) :
A[i]-= i+1
A = sorted(A)
if N % 2 != 0 :
a = A[N//2]
else :
a = (A[N//2]+A[N//2-1])//2
for j in range(N) :
A[j] -= a
answer += abs(A[j])
print(answer)
| p03311 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = []
for i in range(N):
B.append(A[i]-i-1)
B.sort()
med = N // 2
grief = 0
for i in range(N):
grief += abs(B[i]-B[med])
print((str(grief))) | N = int(eval(input()))
A = list(map(int,input().split()))
B = []
for i in range(N):
A[i] -= i+1
A.sort()
#for i in range(N):
# B.append(A[i]-i-1)
#B.sort()
med = N // 2
grief = 0
for i in range(N):
grief += abs(A[i]-A[med])
#for i in range(N):
# grief += abs(B[i]-B[med])
print((str(grief))) | p03311 |
import statistics
N = int(eval(input()))
A = list(map(int, input().split()))
A = [a - i for i, a in enumerate(A, 1)]
b = statistics.median(A)
ans = int(sum([abs(a-b) for a in A]))
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
A = sorted([a - i for i, a in enumerate(A, 1)])
b = A[(N - 1)//2]
ans = sum([abs(a-b) for a in A])
print(ans) | p03311 |
N = int(eval(input()))
A = list(map(int,input().split()))
L = []
for i in range(N):
L.append(A[i]-i-1)
L.sort()
k = 0
if (N%2 == 0):
k = (L[(N//2)-1]+L[N//2])/2
else:
k = L[N//2]
ans = 0
for i in range(N):
ans += abs(L[i]-k)
print((int(ans))) | N = int(eval(input()))
A = list(map(int,input().split()))
L = [0]*N
for i in range(N):
L[i] = A[i]-i-1
L.sort()
S = 0
if len(L)%2 != 0:
k = L[len(L)//2]
for i in range(len(L)):
S += abs(L[i]-k)
else:
k = (L[len(L)//2-1]+L[len(L)//2])//2
for i in range(len(L)):
S += abs(L[i]-k)
print(S)
| p03311 |
n,a,b=map(int,input().split())
s=input()
ans=list('No'for _ in range(n))
c=a+b
for i in range(n):
if ans[:i].count('Yes')<c:
if s[i]=='a':
ans[i]='Yes'
if s[i]=='b' and s[:i].count('b')<b:
ans[i]='Yes'
print(*ans,sep='\n')
| n,a,b=map(int,input().split())
s=input()
ans=list('No'for _ in range(n))
c=a+b
countY=0
countb=0
for i in range(n):
if countY<c:
if s[i]=='a':
ans[i]='Yes'
countY+=1
if s[i]=='b' and countb<b:
ans[i]='Yes'
countY+=1
countb+=1
... | p03971 |
from sys import stdin
from math import ceil, floor
n, a, b = [int(x) for x in stdin.readline().rstrip().split()]
s = list(stdin.readline().rstrip())
d = 0
e = 0
for i in range(n):
if d < a + b and s[i] == "a":
print("Yes")
d += 1
elif d < a + b and e < b and s[i] == "b":
print... | from sys import stdin
from math import ceil, floor
n,a,b = [int(x) for x in stdin.readline().rstrip().split()]
s=list(stdin.readline().rstrip())
c=a+b
d=e=0
for i in range(n):
if d<c and s[i]=="a":
print("Yes")
d+=1
elif d<c and e<b and s[i]=="b":
print("Yes")
d+=1
... | p03971 |
n,a,b = map(int,input().split())
s = input()
ans = ["0"]*n
bcnt = 0
for i in range(n):
if s[i] == "a":
if ans.count("Yes") < a+b:
ans[i] = "Yes"
else:
ans[i] = "No"
elif s[i] == "b":
bcnt += 1
if ans.count("Yes") < a+b and bcnt <= b:
ans[i] = "Yes"
else:
an... | n,a,b = map(int,input().split())
s = input()
ans = ["0"]*n
acnt = 0
bcnt = 0
for i in range(n):
if s[i] == "a":
if acnt < a+b:
acnt += 1
ans[i] = "Yes"
else:
ans[i] = "No"
elif s[i] == "b":
bcnt += 1
if acnt < a+b and bcnt <= b:
acnt += 1
ans[i] = "Yes"
... | p03971 |
#!/usr/bin/env python3
import sys
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
# 要素xが属するグループの根を返す
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
... | #!/usr/bin/env python3
import sys
input = sys.stdin.readline
def INT(): return int(eval(input()))
def MAP(): return list(map(int,input().split()))
def LI(): return list(map(int,input().split()))
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
de... | p03108 |
class UnionFind(object):
def __init__(self, n):
self.par = [-1] * n
def find(self, x):
if self.par[x] < 0:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def unite(self, x, y):
x = self.find(x)
... | class UnionFind(object):
def __init__(self, n):
self.par = [-1] * n
def find(self, x):
if self.par[x] < 0:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def unite(self, x, y):
x = self.find(x)
... | p03108 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**5)
N, M = list(map(int, input().split()))
AB = [list([int(x)-1 for x in input().split()]) for _ in range(M)][::-1]
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**5)
N, M = list(map(int, input().split()))
AB = [list([int(x)-1 for x in input().split()]) for _ in range(M)][::-1]
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
... | p03108 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**5)
N, M = list(map(int, input().split()))
AB = [list([int(x)-1 for x in input().split()]) for _ in range(M)][::-1]
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, M = mapint()
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x]... | p03108 |
n, m = [int(i) for i in input().split() ]
br = list([])
for i in range(m):
x = [int(i) for i in input().split() ]
br.append(x)
inc = int((n*(n-1))/2)
can = [set([i]) for i in range(n+1)]
ans = list([inc])
for b in br[:0:-1] :
tmp = 0
#new0 = (can[b[1]]|{b[1]}) - can[b[0]]
#new1 = (can[b... | n, m = [int(i) for i in input().split() ]
br = list([])
for i in range(m):
x = [int(i) for i in input().split() ]
br.append(x)
inc = int((n*(n-1))/2)
can = [set([i]) for i in range(n+1)]
ans = list([inc])
for b in br[:0:-1] :
if b[1] not in can[b[0]]:
inc -= len(can[b[0]]) * len(can[b[1]])... | p03108 |
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n + 1)]
self.rank = [0] * (n + 1)
self.size = [1] * (n + 1)
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
ret... | class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n + 1)]
self.rank = [0] * (n + 1)
self.size = [1] * (n + 1)
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
ret... | p03108 |
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):
... | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [i for i in range(n)]
self.rank = [0 for _ in range(n)]
self.size = [1 for _ in range(n)]
def find(self, x):
root = x
while self.parents[root] != root:
root = self.parents[r... | p03108 |
# ABC120D - Decayed Bridges
class UnionFind:
__slots__ = ["size", "first_idx", "parent", "rank"]
def __init__(self, size: int, first_idx: int = 0) -> None:
self.size = size
self.first_idx = first_idx
self.parent = list(range(size + first_idx))
self.rank = [0] * (size + f... | # ABC120D - Decayed Bridges
class UnionFind:
__slots__ = ["size", "first_idx", "parents"]
def __init__(self, size: int, first_index: int = 0) -> None:
self.size = size
self.first_idx = first_index
self.parents = [-1] * (size + first_index)
def find(self, x: int) -> int:
... | p03108 |
n, m = list(map(int, input().split()))
ab = []
for _ in range(m):
a, b = list(map(int, input().split()))
ab.append((a-1, b-1))
uni = [set([i]) for i in range(n)]
start = (n * (n - 1)) // 2
blis = [start]
for a, b in ab[::-1]:
ap = a
bp = b
while isinstance(uni[ap], int):
_ap = uni[ap]
... | def comb(n):
return n*(n+1)//2
class UnionFind:
def __init__(self, N):
self.parent = [i for i in range(N)]
self.rank = [0] * N
self.count = 0
self.size = [1] * N
self.connection = 0
def root(self, a):
if self.parent[a] == a:
return a
else:
self.parent[a] ... | p03108 |
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii... | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii... | p03108 |
#!/usr/bin/env python3
import sys
class UnionFind():
def __init__(self, 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 u... | class UnionFind():
def __init__(self, n):
self.parents = list(range(n))
self.size = [1] * n
def find(self, x):
if self.parents[x] == x:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def uni... | p03108 |
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):
... | 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):
... | p03108 |
n,m=list(map(int,input().split()))
bridge=[[] for i in range(m)]
iland=[[i+1] for i in range(n)]
for i in range(m):
bridge[i]=list(map(int,input().split()))
ans=[0 for i in range(m+1)]
ans[0]=int((n-1)*n/2)
k=1
for i in reversed(bridge):
ans[k]=ans[k-1]
for j in range(len(iland)):
if i[0]... | n,m=list(map(int,input().split()))
bridge=[[] for i in range(m)]
leader=[i for i in range(n+1)]
member=[1 for i in range(n+1)]
for i in range(m):
bridge[i]=list(map(int,input().split()))
ans=[0 for i in range(m+1)]
ans[0]=int((n-1)*n/2)
k=1
for i in reversed(bridge):
le0=leader[i[0]]
le1=leader[i... | p03108 |
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)... |
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)... | p03108 |
import sys
from heapq import heappush, heappop
def input(): return sys.stdin.readline().strip()
class UnionFind():
"""
https://note.nkmk.me/python-union-find/
DFSの上位互換と考えて良い
２要素x, yがpath-connectedかどうかをlogオーダーで判定する（螺旋本の14.1節参照）
さらに連結成分の要素数がO(1)で取得可能なように改造してある
"""
def __init__(self... | import sys
def input(): return sys.stdin.readline().strip()
class UnionFind():
"""
https://note.nkmk.me/python-union-find/
DFSの上位互換と考えて良い
２要素x, yがpath-connectedかどうかをlogオーダーで判定する（螺旋本の14.1節参照）
さらに連結成分の要素数がO(1)で取得可能なように改造してある
"""
def __init__(self, n):
"""
要素数をnとして、... | p03108 |
#16:50
n,m = list(map(int,input().split()))
a = []
for _ in range(m):
x,y = list(map(int,input().split()))
x -= 1
y -= 1
a.append([x,y])
a.reverse()
scr = n * (n-1) // 2
pre = [-1 for _ in range(n)]
cnt = [1 for _ in range(n)]
ans = []
for i in range(m):
ans.append(scr)
X,Y = a[i]
while pr... | #16:50
n,m = list(map(int,input().split()))
a = []
for _ in range(m):
x,y = list(map(int,input().split()))
x -= 1
y -= 1
a.append([x,y])
a.reverse()
scr = n * (n-1) // 2
pre = [-1 for _ in range(n)]
cnt = [1 for _ in range(n)]
ans = []
for i in range(m):
ans.append(scr)
X,Y = a[i]
while pr... | p03108 |
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):
... | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
self.ans = n*(n-1)//2
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]... | p03108 |
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
self.ans = n*(n-1)//2
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]... | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
self.ans = n*(n-1)//2
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]... | p03108 |
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
self.ans = n*(n-1)//2
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]... | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
self.ans = n*(n-1)//2
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]... | p03108 |
class UnionFind():
#https://note.nkmk.me/python-union-find/
#note.nkmk.me 2019-08-18
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... | class UnionFind():
#https://note.nkmk.me/python-union-find/
#note.nkmk.me 2019-08-18
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... | p03108 |
N,M = list(map(int,input().split()))
Bridge = [[int(x)-1 for x in input().split()] for _ in range(M)]
Igr = [{i} for i in range(N)]
Inconv = [N*(N-1)//2] * (M+1)
for i in range(M):
A = Bridge[M-1-i][0]
B = Bridge[M-1-i][1]
if B in Igr[A]:
Inconv[M-1-i] = Inconv[M-i]
else:... | N,M = list(map(int,input().split()))
Bridge = [[int(x)-1 for x in input().split()] for _ in range(M)]
Parent = [-1] * N
Size = [1] * N
def Pr(x):
if Parent[x] == -1:
return x
else:
return Pr(Parent[x])
Igr = [{i} for i in range(N)]
Inconv = [N*(N-1)//2] * (M+1)
for i in range(... | p03108 |
from queue import Queue
def disintegration_Bridge(index):
ConnectMatrix[index[0]][index[1]] = '0'
ConnectMatrix[index[1]][index[0]] = '0'
def Calculate_inconveniece(group):
if len(group) == 1:
return 0
else:
Mysum = 0
group_count = len(group)
for i in ra... |
def Calculate_inconveniece(group):
if len(group) == 1:
return 0
else:
Mysum = 0
group_count = len(group)
for i in range(group_count):
num_group1 = len(group[i])
for j in range(i + 1, group_count):
Mysum += num_group1 * len(group[... | p03108 |
n, m = list(map(int, input().split()))
bridge = list()
for i in range(0, m):
a, b = list(map(int, input().split()))
bridge.append([a - 1, b - 1])
bridge = bridge[1:]
bridge = reversed(bridge)
result = []
groups = []
value = n * (n - 1) // 2
result.append(value)
def find_group(v):
for i, ... | n, m = list(map(int, input().split()))
bridge = list()
for i in range(0, m):
a, b = list(map(int, input().split()))
bridge.append([a - 1, b - 1])
bridge = bridge[1:]
bridge = reversed(bridge)
result = []
parent = [-1] * n
size = [1] * n
def root(v):
p = parent[v]
if p >= 0:
... | p03108 |
from copy import deepcopy as dc
N, Q = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(Q)][: : -1]
res = [N * (N - 1) // 2]
mod = 2305843009213693951
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1] * (n + 1)
self.rnk = [0] * (n + 1)
d... | N, Q = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(Q)]
res = [0] * (Q - 1) + [N * (N - 1) // 2]
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1] * (n + 1)
self.rnk = [0] * (n + 1)
def Find_Root(self, x):
if self.root[x] < 0:
... | p03108 |
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
self.sizes = [1] * (n+1)
self.root = [1] * (n+1)
# 検索
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = s... | class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
self.sizes = [1] * (n+1)
self.root = [1] * (n+1)
# 検索
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = s... | p03108 |
import collections
def main():
n, m = list(map(int, input().split()))
bridge = [[0, 0]]*m
for i in range(m):
bridge[i] = list(map(int, input().split()))
inconveniences = [0]*(m+1)
inconveniences[m] = (n*(n-1))//2
islands = collections.defaultdict(list)
stack = []
for i in range(m-1, -1, -1):
if i... | def main():
n, m = list(map(int, input().split()))
bridge = [[0, 0]]*m
for i in range(m):
bridge[i] = list(map(int, input().split()))
inconveniences = [0]*(m+1)
inconveniences[m] = (n*(n-1))//2
union_find = [[i, 0, 1] for i in range(n+1)]
for i in range(m-1, -1, -1):
if inconveniences[i+1] == 0:
... | p03108 |
import sys
input = sys.stdin.readline
from collections import deque
sys.setrecursionlimit(10000000)
N,M=list(map(int,input().split()))
AB = [list(map(int, input().split())) for _ in range(M)]
to = [[] for _ in range(N+1)]
def dfs(v, p):
count=1
for u in to[v]:
if u == p or done[u] == 1: ... | import sys
input = sys.stdin.readline
class UnionFind:
def __init__(self, N):
self.Parent = [-1]*(N+1)
#Aの親を探す。このときParent[A]は親の値からグループサイズに変わる。探索の最適化
def root(self, A):
if self.Parent[A] < 0: return A
self.Parent[A] = self.root(self.Parent[A])
return self.Parent[A... | p03108 |
def readln():
return list(map(int, input().split()))
N, M = readln()
AB = [readln() for _ in range(M)]
A = [ab[0]-1 for ab in AB[::-1]]
B = [ab[1]-1 for ab in AB[::-1]]
class UnionFind:
def __init__(self, N):
self.N = N # ノード数
# 親ノードをしめす。負は自身が親ということ。
self.parent = [-1]... | def readln():
import sys
input = sys.stdin.readline
return list(map(int, input().split()))
N, M = readln()
AB = [readln() for _ in range(M)]
A = [ab[0]-1 for ab in AB[::-1]]
B = [ab[1]-1 for ab in AB[::-1]]
class UnionFind:
def __init__(self, N):
self.N = N # ノード数
# 親... | p03108 |
import sys
read = sys.stdin.readline
def readln():
return list(map(int, read().split()))
N, M = readln()
AB = [readln() for _ in range(M)]
A = [ab[0]-1 for ab in AB[::-1]]
B = [ab[1]-1 for ab in AB[::-1]]
class UnionFind:
def __init__(self, N):
self.N = N # ノード数
# 親ノードをしめ... | import sys
read = sys.stdin.readline
def readln():
return list(map(int, read().split()))
N, M = readln()
A = []
B = []
for _ in range(M):
a, b = readln()
A.append(a-1)
B.append(b-1)
# AB = [readln() for _ in range(M)]
# A = [ab[0]-1 for ab in AB[::-1]]
# B = [ab[1]-1 for ab in AB[::... | p03108 |
import sys
input = sys.stdin.readline
def Find(x, par):
if par[x] < 0:
return x
else:
# 経路圧縮
par[x] = Find(par[x], par)
return par[x]
def Unite(x, y, par, rank):
x = Find(x, par)
y = Find(y, par)
if x != y:
# rankの低い方を高い方につなげる
if rank[x] < rank[y]:
par[y] += ... | import sys
input = sys.stdin.buffer.readline
n, m = list(map(int, input().split()))
X = []
for i in range(m):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
X.append((a, b))
X.reverse()
def Find(x, par):
if par[x] < 0:
return x
else:
par[x] = Find(par[x], p... | p03108 |
N, M = list(map(int, input().split()))
AB = []
for i in range(M):
A, B = list(map(int, input().split()))
AB.append([A, B, i])
AB_ = AB[::-1]
#print(AB)
#print(AB_)
ma = N * (N-1) // 2
path = []
subs = [0]
for i in range(len(AB_)):
f0 = -1
f1 = -1
sub = 0
for p in range(l... |
class UnionFind:
def __init__(self, N):
self.parents = [i for i in range(N)]
self.sizes = [1 for _ in range(N)]
# 木の根をまとめる, 頂点 v が属するグループ番号を得る (O(α(n)))
def root(self, x):
if self.parents[x] == x:
return x # 根
else:
self.parents[x]... | p03108 |
# Union-Find木（サイズ付き）
class UnionFind():
def __init__(self, n): # n要素で初期化 初めは全ての頂点が別々の木の根
self.parent = [None] * n # 親
self.rank = [None] * n # 木の深さ
self._size = [1] * n # 要素が属する集合の大きさ（根の要素のみ参照すること）
for i in range(n):
self.parent[i] = i
self.rank[i] ... | # Union-Find木（サイズ付き）
class UnionFind():
def __init__(self, n): # n要素で初期化 初めは全ての頂点が別々の木の根
self.parent = [None] * n # 親
self.rank = [None] * n # 木の深さ
self._size = [1] * n # 要素が属する集合の大きさ（根の要素のみ参照すること）
for i in range(n):
self.parent[i] = i
self.rank[i] ... | p03108 |
# Union-Find木を使って書き直し
# Union-Find木（サイズ付き）
class UnionFind():
def __init__(self, n): # n要素で初期化 初めは全ての頂点が別々の木の根
self.parent = [None] * n # 親
self.rank = [None] * n # 木の深さ
self._size = [1] * n # 要素が属する集合の大きさ（根の要素のみ参照すること）
for i in range(n):
self.parent[i] = i
... | # 20-08-12再トライ
import sys
input = sys.stdin.readline
class UnionFind():
def __init__(self, n):
self.rank = [0] * n
self.par = list(range(n))
self._size = [1] * n # 木の根のみ有効、集合に属する要素数
def find(self, x):
ch = []
while self.par[x] != x:
ch.append(x... | p03108 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.