Submission details
Task:Company Queries II
Sender:ileska
Submission time:2025-10-21 15:15:14 +0300
Language:Python3 (CPython3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.02 sdetails
#2ACCEPTED0.02 sdetails
#3ACCEPTED0.02 sdetails
#4ACCEPTED0.02 sdetails
#5ACCEPTED0.02 sdetails
#6--details
#7ACCEPTED0.88 sdetails
#8--details
#9--details
#10--details
#11ACCEPTED0.02 sdetails
#12--details

Code

from math import ceil, log2

def printParentMap(parent, empCount, logHeight):
    for hh in range(logHeight):
        for ee in range(empCount):
            print(f"{parent[hh*empCount+ee]:2}", end=" ")
        print()
def run(q0, q1, bosses, heights):
    if q0 == q1:
        return q0
    if heights[q0] == heights[q1]:
        if bosses[q0] == bosses[q1]:
            return bosses[q0]
        else:
            return run(bosses[q0], bosses[q1], bosses, heights)
    elif heights[q0] > heights[q1]:
        if bosses[q0] == q1:
            return q1
        else:
            return run(bosses[q0], q1, bosses, heights)
    else:
        if q0 == bosses[q1]:
            return q0
        else:
            return run(q0, bosses[q1], bosses, heights)

empCount, qCount = [int(aa) for aa in input().strip().split(" ")]
bosses = [0]+[int(aa)-1 for aa in input().strip().split(" ")]
heights = [-1]*len(bosses)
queryes = [tuple([int(aa)-1 for aa in input().strip().split(" ")]) for _ in range(qCount)]

for ii in range(len(heights)):
    kk = ii
    hh = 0
    while kk != 0:
        # print(kk,bosses[kk])
        kk = bosses[kk]
        hh += 1
    heights[ii] = hh
# comp = [Emp(ii, 0 if ii == 0 else bosses[ii-1]) for ii in range(empCount)]
# print(comp)
# print(bosses)
# print(heights)
# print(queryes)
for q0,q1 in queryes:
    print(run(q0, q1, bosses, heights)+1)
# bosses 

Test details

Test 1

Verdict: ACCEPTED

input
10 10
1 2 3 4 5 6 7 8 9
6 9
8 10
10 3
...

correct output
6
8
3
1
8
...

user output
6
8
3
1
8
...

Test 2

Verdict: ACCEPTED

input
10 10
1 1 1 1 1 1 1 1 1
1 7
3 4
4 1
...

correct output
1
1
1
1
1
...

user output
1
1
1
1
1
...

Test 3

Verdict: ACCEPTED

input
10 10
1 1 1 1 2 3 4 4 1
1 8
2 7
8 3
...

correct output
1
1
1
1
1
...

user output
1
1
1
1
1
...

Test 4

Verdict: ACCEPTED

input
10 10
1 1 3 1 2 2 5 3 9
7 2
7 6
3 9
...

correct output
2
2
3
1
1
...

user output
2
2
3
1
1
...

Test 5

Verdict: ACCEPTED

input
10 10
1 2 3 2 5 3 2 2 4
6 1
1 3
1 9
...

correct output
1
1
1
2
2
...

user output
1
1
1
2
2
...

Test 6

Verdict:

input
200000 200000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
74862
8750
16237
72298
58111
...

user output
(empty)

Test 7

Verdict: ACCEPTED

input
200000 200000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
1
1
1
1
1
...

user output
1
1
1
1
1
...

Test 8

Verdict:

input
200000 200000
1 2 1 2 3 2 1 6 3 1 10 12 13 4...

correct output
1
2
2
2
1
...

user output
(empty)

Test 9

Verdict:

input
200000 200000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
2796
633
633
151
2690
...

user output
(empty)

Test 10

Verdict:

input
200000 200000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
365
73
103
365
216
...

user output
(empty)

Test 11

Verdict: ACCEPTED

input
2 4
1
1 1
1 2
2 1
...

correct output
1
1
1
2

user output
1
1
1
2

Test 12

Verdict:

input
200000 200000
1 1 2 3 4 5 6 7 8 9 10 11 12 1...

correct output
27468
6353
27468
6353
6353
...

user output
(empty)