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

#define ll long long

int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int k, n1;
    cin>>k>>n1;
    vector<int> n(k+1);
    n[1] = n1;

    vector<vector<int>> parent(k+1);
    for(int i=2; i<=k; i++){
        cin>>n[i];
        parent[i].resize(n[i] + 1);
        for(int j=1; j<=n[i]; j++){
            cin>>parent[i][j];
        }
    }

    vector<vector<ll>> ile(k+1);

    for(int i=1; i<=k; i++){
        ile[i].assign(n[i] + 1, 0);
    }

    for(int i=1; i<=n[k]; i++){
        ile[k][i] = 1;
    }

    for(int i=k; i>=2; i--){
        for(int j=1; j<=n[i]; j++){
            if(parent[i][j] != 0){
                ile[i-1][parent[i][j]] += ile[i][j];
            }
        }
        for(int j=1; j<=n[i-1]; j++){
            if(ile[i-1][j] == 0){
                ile[i-1][j] = 1;
            }
        }
    }

    ll wyn = 0;

    for(int i=1; i<=k; i++){
        ll suma = 0;
        for(int j=1; j<=n[i]; j++){
            suma += ile[i][j];
        }
        wyn = max(wyn, suma);
    }

    cout<<wyn<<"\n";
    return 0;

}