Submission details
Task:Company Queries II
Sender:azeaus1
Submission time:2025-10-11 13:58:21 +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.47 sdetails
#7--details
#8--details
#90.48 sdetails
#10--details
#11ACCEPTED0.04 sdetails
#120.47 sdetails

Code

import heapq

n, q  = [int(x) for x in input().split()]
boss = [int(x) for x in input().split()]
queries = []
for _ in range(q):
    a, b = [int(x) for x in input().split()]
    queries.append([a-1, b-1])

tree = [[] for _ in range(n)]
for i in range(1, n):
    tree[boss[i-1]-1].append(i)

visited = [[],[]]
first = [0 for _ in range(n)]
def dfs(x, d):
    global visited
    first[x] = len(visited[0])
    visited[0].append(x)
    visited[1].append(d)
    for node in tree[x]:
        dfs(node, d+1)
        visited[0].append(x)
        visited[1].append(d)

dfs(0,0)
for query in queries:
    a, b = query[0], query[1]
    idxA = first[a]
    idxB = first[b]
    mini = float('inf')
    nbrmini = -1
    for i in range(min(idxA,idxB), max(idxA,idxB)+1):
        if visited[1][i] < mini:
            mini = visited[1][i]
            nbrmini = visited[0][i]
    print(nbrmini+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 26, in <module>
    dfs(0,0)
  File "input/code.py", line 22, in dfs
    dfs(node, d+1)
  File "input/code.py", line 22, in dfs
    dfs(node, d+1)
  File "input/code.py", line 22, in dfs
    dfs(node, d+1)
  [Previous line repeated 1576 more times]
  File "input/code.py", line 18, in dfs
    first[x] = len(visited[0])
RecursionError: maximum recursion depth exceeded

Test 7

Verdict:

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
(empty)

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)

Error:
Traceback (most recent call last):
  File "input/code.py", line 26, in <module>
    dfs(0,0)
  File "input/code.py", line 22, in dfs
    dfs(node, d+1)
  File "input/code.py", line 22, in dfs
    dfs(node, d+1)
  File "input/code.py", line 22, in dfs
    dfs(node, d+1)
  [Previous line repeated 1581 more times]
  File "input/code.py", line 18, in dfs
    first[x] = len(visited[0])
RecursionError: maximum recursion depth exceeded

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)

Error:
Traceback (most recent call last):
  File "input/code.py", line 26, in <module>
    dfs(0,0)
  File "input/code.py", line 22, in dfs
    dfs(node, d+1)
  File "input/code.py", line 22, in dfs
    dfs(node, d+1)
  File "input/code.py", line 22, in dfs
    dfs(node, d+1)
  [Previous line repeated 1576 more times]
  File "input/code.py", line 18, in dfs
    first[x] = len(visited[0])
RecursionError: maximum recursion depth exceeded