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

$ curl repovive.com/roadmaps/graph-theory/mixed-practice-tree-fundamentals/subordinates-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████████████████████████████████████████████████████████████████████████████████████████████████████

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

$ curl repovive.com/roadmaps/graph-theory/mixed-practice-tree-fundamentals/subordinates-implementation

Repovive

Subordinates - Implementation - Mixed Practice: Tree Fundamentals | Graph Theory | Repovive

Repovive.

Graph Theory37 sections · 1633 units81h total

Open in Course

Subordinates - Implementation

(C++ code)

Read input, build adjacency list, DFS from node $1$ :

sub = array of size n

function dfs(u, p):
    sub[u] = 1
    for v in adj[u]:
        if v == p:
            continue
        dfs(v, u)
        sub[u] = sub[u] + sub[v]

dfs(1, 0)
for i from 1 to n:
    print sub[i] - 1

This runs in $O(n)$ time and uses $O(n)$ space.