Company Queries II

n, q = map(int, input().split())
parent = [0] * (n + 1)
parent[1] = 0

bosses = list(map(int, input().split()))
for i in range(2, n + 1):
    parent[i] = bosses[i - 2]


def get_path(node):
    path = []
    while node != 0:
        path.append(node)
        node = parent[node]
    return path


for _ in range(q):
    a, b = map(int, input().split())

    path_a = get_path(a)
    path_b = get_path(b)

    set_a = set(path_a)

    for node in path_b:
        if node in set_a:
            print(node)
            break

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: TIME LIMIT EXCEEDED