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
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(a,b) for(int a = 0; a < (b); ++a)
#define all(t) t.begin(), t.end()
#define pb push_back
#define fi first
#define se second
#define each(a,x) for(auto &a:x)
#define vi vector<int>
#define vll vector<ll>
#define vull vector<ull>
#define pi pair<int,int>
#define pll pair<ll,ll>
#define nl '\n'
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx2")
#pragma GCC target("bmi")
#pragma GCC target("bmi2")
#pragma GCC target("lzcnt")
#pragma GCC target("popcnt")
const int N = 1e6+1234,INF = 2e9+1234;
const ll INF_L = (ll)2e18+1234, mod = 998244353;
void solve()
{
    int k,n1;cin>>k>>n1;
    vector<vector<int>> A,B,C;A.assign(k,{});B.assign(k,{});C.assign(k,{});
    A[0].assign(n1,0);B[0].assign(n1,0);C[0].assign(n1,0);
    for(int i=1;i<k;++i)
    {
        int n;cin>>n;
        A[i].assign(n,0),B[i].assign(n,0),C[i].assign(n,0);
        rep(j,n)cin>>A[i][j];
    }
    int ans=0;vector<int> D(k+5);
    rep(i,k)
    {
        rep(j,(int)A[i].size())
        {
            if(A[i][j]==0) B[i][j]=i;
            else B[i][j]=B[i-1][A[i][j]-1],++C[i-1][A[i][j]-1];
        }
    }
    rep(i,k)
    {
        rep(j,(int)A[i].size())
        {
            if(C[i][j]==0) ++D[B[i][j]],--D[i+1];
        }
    }
    for(int i=1;i<k;++i) D[i]+=D[i-1];
    rep(i,k) ans=max(ans,D[i]);
    cout << ans << nl;
}
int main()
{ 
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int T=1;
    //cin >> T;
    while(T--) solve();
    return 0;
}