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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
#include <iostream>
#include <vector>
#include <queue>

using namespace std;

int count(int i, vector<vector<int>> &g) {
    if (g[i].empty()) return 1;
    int sum = 0;
    for (int x: g[i]) {
        sum += count(x, g);
    }
    return sum;
}

int main() {
    int k, n1;
    scanf("%d%d", &k, &n1);

    int num = n1 + 1;
    vector<int> roots;
    vector<vector<pair<int, int>>> v(k + 1);
    
    int N = n1;
    for (int i = 2; i <= k; ++i) {
        int n; 
        scanf("%d", &n);
        N += n;
        for (int j = 0; j < n; ++j) {
            int p;
            scanf("%d", &p);
            v[i].push_back({p, num});
            ++num;
        }
    }

    vector<vector<int>> g(N + 1);
    vector<int> deg(N + 1);

    for (int i = 1; i <= n1; ++i) {
        roots.push_back(i);
        v[1].push_back({0, i});
    }

    for (int i = 2; i <= k; ++i) {
        for (auto& [a, to]: v[i]) {
            if(!a) {
                roots.push_back(to);
            } else {
                int from = v[i - 1][a - 1].second;
                g[from].push_back(to);
                deg[from]++;
            }
        }       
    }

    vector<int> results(N + 1);
    for (int root: roots) {
        results[root] = count(root, g);
    }

    
    int result = 0;
    int free = 0;
    for (auto& [a, to]: v[1]) {
        result += results[to];
        if (!deg[to]) ++free;
    }

    for (int i = 2; i <= k; ++i) {
        int needed = 0;
        int ended = 0;
        for (auto& [a, to]: v[i]) {
            needed += results[to];
            if (!deg[to]) ++ended;
        }

        if (free >= needed) {
            free -= needed;
        } else {
            needed -= free;
            free = 0;
            result += needed;
        }

        free += ended;
    }

    printf("%d\n", result);

    return 0;
}