| Task: | Company Queries II |
| Sender: | jonnymorgan |
| Submission time: | 2025-10-22 14:44:47 +0300 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | RUNTIME ERROR |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.04 s | details |
| #2 | ACCEPTED | 0.04 s | details |
| #3 | ACCEPTED | 0.04 s | details |
| #4 | ACCEPTED | 0.04 s | details |
| #5 | ACCEPTED | 0.04 s | details |
| #6 | RUNTIME ERROR | 0.19 s | details |
| #7 | TIME LIMIT EXCEEDED | -- | details |
| #8 | TIME LIMIT EXCEEDED | -- | details |
| #9 | RUNTIME ERROR | 0.20 s | details |
| #10 | TIME LIMIT EXCEEDED | -- | details |
| #11 | ACCEPTED | 0.04 s | details |
| #12 | RUNTIME ERROR | 0.19 s | details |
Code
n, q = map(int, input().split())
boss = [0, 0] + list(map(int, input().split()))
children = [[] for _ in range(n + 1)]
for i in range(2, n + 1):
children[boss[i]].append(i)
depth = [0] * (n + 1)
def dfs(node, d):
depth[node] = d
for child in children[node]:
dfs(child, d + 1)
dfs(1, 0)
LOG = 20
up = [[0] * LOG for _ in range(n + 1)]
for i in range(1, n + 1):
up[i][0] = boss[i]
for j in range(1, LOG):
for i in range(1, n + 1):
up[i][j] = up[up[i][j - 1]][j - 1]
for _ in range(q):
a, b = map(int, input().split())
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[a][i]
if a == b:
print(a)
continue
for i in range(LOG - 1, -1, -1):
if up[a][i] != up[b][i]:
a = up[a][i]
b = up[b][i]
print(up[a][0])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: RUNTIME ERROR
| 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 17, in <module>
dfs(1, 0)
File "input/code.py", line 14, in dfs
dfs(child, d + 1)
File "input/code.py", line 14, in dfs
dfs(child, d + 1)
File "input/code.py", line 14, in dfs
dfs(child, d + 1)
[Previous line repeated 1576 more times]
File "input/code.py", line 12, in dfs
depth[node] = d
RecursionError: maximum recursion depth exceededTest 7
Verdict: TIME LIMIT EXCEEDED
| 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: TIME LIMIT EXCEEDED
| 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: RUNTIME ERROR
| 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 17, in <module>
dfs(1, 0)
File "input/code.py", line 14, in dfs
dfs(child, d + 1)
File "input/code.py", line 14, in dfs
dfs(child, d + 1)
File "input/code.py", line 14, in dfs
dfs(child, d + 1)
[Previous line repeated 1582 more times]
File "input/code.py", line 12, in dfs
depth[node] = d
RecursionError: maximum recursion depth exceededTest 10
Verdict: TIME LIMIT EXCEEDED
| 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: RUNTIME ERROR
| 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 17, in <module>
dfs(1, 0)
File "input/code.py", line 14, in dfs
dfs(child, d + 1)
File "input/code.py", line 14, in dfs
dfs(child, d + 1)
File "input/code.py", line 14, in dfs
dfs(child, d + 1)
[Previous line repeated 1576 more times]
File "input/code.py", line 12, in dfs
depth[node] = d
RecursionError: maximum recursion depth exceeded