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

#define int long long

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int k,n;
    cin>>k>>n;

    vector<vector<int>> v(k);
    v[0].resize(n+1);
    for (int i=2;i<=k;i++){
        cin>>n;
        v[i-1].resize(n+1);

        for (int j=1;j<=n;j++) cin>>v[i-1][j];
    }

    vector<int> curr(n+1,1);
    curr[0]=0;

    int ans=n;

    for (int i=k-1;i>=1;i--){
        int sz=v[i].size();
        int nxtsz=v[i-1].size();
        
        vector<int> nxt(nxtsz+1);

        for (int j=1;j<sz;j++){
            int x=v[i][j];
            if (x!=0) nxt[x]+=curr[j];
        }
        for (int j=1;j<nxtsz;j++){
            if (nxt[j]==0) nxt[j]=1;
        }

        int sum=0;
        for (int j=1;j<nxtsz;j++){
            sum+=nxt[j];
        }

        ans=max(ans,sum);

        curr=nxt;
    }

    cout<<ans<<"\n";

    return 0;
}