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
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e6 + 7;
vector<int> G[MAXN];
vector<int> lvl[MAXN];

int res[MAXN];

void dfs(int x) {
    for (int &v : G[x]) {
        dfs(v);
        res[x] += res[v];
    }
    res[x] += G[x].empty();
}

int main() {
    ios_base::sync_with_stdio(0);
    int k, n; cin >> k >> n;
    for (int i = 0; i < n; ++i) lvl[0].push_back(i + 1);
    int curr = n + 1;
    for (int i = 1; i < k; ++i) {
        int ni; cin >> ni;
        for (int j = 0; j < ni; ++j) {
            int x; cin >> x;
            if (!x) {
                lvl[i].push_back(curr);
            } else {
                G[x].push_back(curr);
            }
            ++curr;
        }
    }

    for (int i = 0; i < k; ++i) {
        for (int &v : lvl[i]) {
            if (!res[v]) {
                dfs(v);
            }
        }
    }

    int ans = 0;
    for (int i = 0; i < k; ++i) {
        int total = 0;
        for (int &v : lvl[i]) total += res[v];
        ans = max(ans, total);
    }
    
    cout << ans << "\n";
}