Submission #13243602


Source Code Expand

Copy
n,m,k=map(int,input().split())
p=list(map(int,input().split()))
edge=[[]for _ in range(n)]
for i in range(n):
  if p[i]:edge[p[i]-1].append(i)
  else:s=i
def bfs(v,t):
  stack=[s]
  d=[-1]*n
  d[s]=1
  x=[1]
  ans=-1
  for i in stack:
    for j in edge[i]:
      if j==t:ans=d[i]+1;continue
      if j in v:continue
      stack.append(j)
      d[j]=d[i]+1
      x.append(d[j])
  return [sorted(x),ans]
v=set()
ans=[]
for i in range(m):
  for j in range(n):
    if j in v:continue
    x,a=bfs(v,j)
    if a==-1 or len(x)<m-i-1:continue
    if sum(x[:m-i-1])<=k-a<=sum(x[-(m-i-1):]):
      k-=a
      ans.append(j+1)
      v.add(j)
  if len(v)!=i+1:exit(print(-1))
print(*ans)

Submission Info

Submission Time
Task F - Coins on the tree
User tyawanmusi
Language Python3 (3.4.3)
Score 0
Code Size 706 Byte
Status
Exec Time 2104 ms
Memory 3064 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 s1.txt, s2.txt
All 0 / 400 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt 18 ms 3064 KB
02.txt 18 ms 3064 KB
03.txt 18 ms 3064 KB
04.txt 18 ms 3064 KB
05.txt 17 ms 3064 KB
06.txt 40 ms 3064 KB
07.txt 50 ms 3064 KB
08.txt 46 ms 3064 KB
09.txt 43 ms 3064 KB
10.txt 36 ms 3064 KB
11.txt 43 ms 3064 KB
12.txt 31 ms 3064 KB
13.txt 33 ms 3064 KB
14.txt 35 ms 3064 KB
15.txt 36 ms 3064 KB
16.txt 37 ms 3064 KB
17.txt 42 ms 3064 KB
18.txt 43 ms 3064 KB
19.txt 50 ms 3064 KB
20.txt 45 ms 3064 KB
21.txt 50 ms 3064 KB
22.txt 51 ms 3064 KB
23.txt 48 ms 3064 KB
24.txt 2104 ms 3064 KB
25.txt 49 ms 3064 KB
26.txt 38 ms 3064 KB
27.txt 41 ms 3064 KB
28.txt 41 ms 3064 KB
29.txt 43 ms 3064 KB
30.txt 41 ms 3064 KB
31.txt 25 ms 3064 KB
32.txt 18 ms 3064 KB
33.txt 20 ms 3064 KB
34.txt 17 ms 3064 KB
35.txt 45 ms 3064 KB
36.txt 23 ms 3064 KB
37.txt 18 ms 3064 KB
38.txt 18 ms 3064 KB
39.txt 19 ms 3064 KB
40.txt 19 ms 3064 KB
s1.txt 17 ms 3064 KB
s2.txt 17 ms 3064 KB