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

const int MAXN = 1e6+6;
vector<int> v[MAXN], t[MAXN];
int ile_w=1, dp[MAXN];

int32_t main(){
    ios_base::sync_with_stdio(0);
    int k,n1; cin >> k >> n1;
    t[1] = {0};
    for(int i=1;i<=n1;i++) t[1].push_back(ile_w++);
    for(int i=2;i<=k;i++){
        t[i] = {0};
        int n; cin >> n;
        for(int j=1;j<=n;j++){
            int a; cin >> a;
            v[t[i-1][a]].push_back(ile_w);
            t[i].push_back(ile_w++);
        }
    }

    int ans=0;
    for(int i=k;i>0;i--){
        int sum=0;
        for(int ver: t[i]){
            if(ver==0) continue;
            if(!v[ver].size()) dp[ver] = 1;
            else for(int child: v[ver]) dp[ver] += dp[child];
            sum += dp[ver];
        }
        ans = max(ans,sum);
    }
    cout << ans << '\n';
}