Submission details
Task:Company Queries II
Sender:francden
Submission time:2025-10-13 15:49:39 +0300
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.04 sdetails
#3ACCEPTED0.04 sdetails
#4ACCEPTED0.04 sdetails
#5ACCEPTED0.04 sdetails
#60.82 sdetails
#7ACCEPTED0.84 sdetails
#8--details
#9ACCEPTED0.99 sdetails
#10ACCEPTED0.98 sdetails
#11ACCEPTED0.04 sdetails
#12ACCEPTED0.94 sdetails

Code

import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline

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


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

reverse_ancestors = [[] for _ in range(n + 1)]
for index, value in enumerate(ancestors):
    reverse_ancestors[value].append(index + 2)


depth = [0] * (n + 1)
for i in range(2, n + 1):
    depth[i] = depth[ancestors[i - 2]] + 1


L = []
nodes = []

def search(node):
    children = reverse_ancestors[node]
    L.append((depth[node], node))
    nodes.append(node)
    for child in children:
        search(child)
        L.append((depth[node], node))
        nodes.append(node)

search(1)


indexs = [-1] * (n + 1)
for index, node in enumerate(nodes):
    if indexs[node] == -1:
        indexs[node] = index


min_list = []
min_list.append(L)

m = len(L)
k = 1
while (1 << k) <= m:
    prev = min_list[k - 1]
    curr = []
    step = 1 << (k - 1)
    for i in range(0, m - (1 << k) + 1):
        curr.append(min(prev[i], prev[i + step], key=lambda x: x[0]))
    min_list.append(curr)
    k += 1



def mini(a, b):
    if b < a:
        a, b = b, a
    if a == b:
        return L[a]

    length = b - a + 1


    exp = 0
    while (1 << (exp + 1)) <= length:
        exp += 1
    power = 1 << exp

    left = min_list[exp][a]
    right = min_list[exp][b - power + 1]  
    return left if left[0] < right[0] else right


for _ in range(q):
    a, b = [int(x) for x in input().split()]
    print(mini(indexs[a], indexs[b])[1])

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)

Error:
Traceback (most recent call last):
  File "input/code.py", line 32, in <module>
    search(1)
  File "input/code.py", line 28, in search
    search(child)
  File "input/code.py", line 28, in search
    search(child)
  File "input/code.py", line 28, in search
    search(child)
  [Previous line repeated 158551 more times]
  File "input/code.py", line 24, in search
    children = reverse_ancestors[node]
RecursionError: maximum recursion depth exceeded

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: ACCEPTED

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
2796
633
633
151
2690
...

Test 10

Verdict: ACCEPTED

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
365
73
103
365
216
...

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: ACCEPTED

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
27468
6353
27468
6353
6353
...