Submission details
Task:Company Queries II
Sender:kookinnam
Submission time:2025-10-19 01:25:27 +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.50 sdetails
#7ACCEPTED0.76 sdetails
#8--details
#90.51 sdetails
#10--details
#11ACCEPTED0.04 sdetails
#120.50 sdetails

Code

def dfs(v, p):
    up[0][v] = p
    for u in adj[v]:
        if u != p:
            depth[u] = depth[v] + 1
            dfs(u, v)


def lca(a, b):
    if depth[a] < depth[b]:
        a, b = b, a
    diff = depth[a] - depth[b]
    for i in range(LOG):
        if diff & (1 << i):
            a = up[i][a]
    if a == b:
        return a
    for i in reversed(range(LOG)):
        if up[i][a] != up[i][b]:
            a = up[i][a]
            b = up[i][b]
    return up[0][a]


if __name__ == "__main__":
    n, q = map(int, input().split())
    bosses = list(map(int, input().split()))

    adj = [[] for _ in range(n + 1)]
    for i, b in enumerate(bosses, start=2):
        adj[b].append(i)

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

    LOG = 20
    up = [[0] * (n + 1) for _ in range(LOG)]
    depth = [0] * (n + 1)

    depth[1] = 0
    dfs(1, 0)

    for j in range(1, LOG):
        for v in range(1, n + 1):
            up[j][v] = up[j - 1][up[j - 1][v]]

    for a, b in queries:
        print(lca(a, b))

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 43, in <module>
    dfs(1, 0)
  File "input/code.py", line 6, in dfs
    dfs(u, v)
  File "input/code.py", line 6, in dfs
    dfs(u, v)
  File "input/code.py", line 6, in dfs
    dfs(u, v)
  [Previous line repeated 1576 more times]
  File "input/code.py", line 2, in dfs
    up[0][v] = p
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:

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 43, in <module>
    dfs(1, 0)
  File "input/code.py", line 6, in dfs
    dfs(u, v)
  File "input/code.py", line 6, in dfs
    dfs(u, v)
  File "input/code.py", line 6, in dfs
    dfs(u, v)
  [Previous line repeated 1582 more times]
  File "input/code.py", line 2, in dfs
    up[0][v] = p
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 43, in <module>
    dfs(1, 0)
  File "input/code.py", line 6, in dfs
    dfs(u, v)
  File "input/code.py", line 6, in dfs
    dfs(u, v)
  File "input/code.py", line 6, in dfs
    dfs(u, v)
  [Previous line repeated 1576 more times]
  File "input/code.py", line 2, in dfs
    up[0][v] = p
RecursionError: maximum recursion depth exceeded