1725D - Deducing Sortability - CodeForces Solution

def ev(x):
    k = 0
    while x%2 == 0:
        x//=2
        k+=1
    return x+k
p,q = [int(i) for i in input().split()]
t,s,sum = 1,1,0
while True:
    ss = s + (t+1)//2
    if ss > p:
        m = (p-s+1)
        sum += m*t
        break
    sum += t*((t+1)//2)
    s = ss
    t += 1
mx = t-2*m+1
print(sum)
mul,ded,turn = 0,0,0
t -= 0 if mx==turn else 1
for i in range(q):
    x = int(input())
    if x == 1:
        print(1)
        continue
    while True:
        if x-ded <= t:
            print(ev(x-ded)+mul)
            break
        ded += (t+1)//2
        turn+=1
        mul += 1
        t -= 0 if mx==turn else 1