Company Queries II

import math

n, q = [int(x) for x in input().split()]

e = [int(x) for x in input().split()]

ancestors = [0 for _ in range(n)]
# Pre processing
for i in range(1, n):
    ancestors[i] = e[i-1]

preproccess = []
for j in range(1, n):
    if math.log2(j) % 1 == 0:
        bosses = []
        for i in range(n):
            k = j - 1
            boss = ancestors[i]
            while k != 0 and boss != 0:
                if math.log2(k) % 1 == 0 and j > i:
                    # print(i, j, k)
                    # print(preproccess)
                    boss = ancestors[preproccess[int(math.log2(k))][i] - 1]
                    # print(boss)
                    break
                boss = ancestors[boss-1]
                k -= 1
            bosses.append(boss)
        # print(j, bosses)
        preproccess.append(bosses)

output = []

def getAncestor(x, k):
    if math.log2(k) % 1 == 0: return preproccess[int(math.log2(k))][x-1]
    else:
        boss = ancestors[x-1]
        k -= 1
        if boss == 0: return boss
        while math.log2(k) % 1 != 0:
            boss = ancestors[boss - 1]
            if boss == 0: return boss
            k -= 1 
        return preproccess[int(math.log2(k))][boss-1]
    
# print("My", getAncestor(4, 1))
# Answers
for i in range(q):
    a, b = [int(x) for x in input().split()]
    bossa = []
    bossb = []
    for i in range(1, n):
        bossa.append(getAncestor(a, i))
        bossbset = getAncestor(b, i)
        # print(i, a, b, bossa, bossbset)
        if bossbset in bossa or bossbset == a: break
    output.append(str(bossbset))

print("\n".join(output))

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: TIME LIMIT EXCEEDED