FilesExpand file tree

 main

/

Subordinates.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

36 lines (25 loc) · 894 Bytes

 main

/

Subordinates.py

Copy path

Top

File metadata and controls

• Code
• Blame

36 lines (25 loc) · 894 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

####################################################################################

# Please consider trying a few more times before referring to this code.

# Code might be incorrect - TLE / Wrong Answer (especially filenames with _1 , _2)

# Pedagogical > Pythonic

####################################################################################

from collections import defaultdict

import sys

sys.setrecursionlimit(10**8)

n = int(input())

adj = defaultdict(list)

for idx, i in enumerate(list(map(int, input().split()))):

adj[i].append(idx + 2) # directed

cnt = [0] * (n + 1)

vis = [False] * (n + 1)

# i know its a tree with root = 1

vis[1] = True

def dfs(i):

for j in adj[i]:

if not vis[j]:

vis[j] = True

dfs(j)

cnt[i] += cnt[j] + 1

dfs(1)

print(*cnt[1:])

# I once again ask you to try a few more times before referring here