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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include <bits/stdc++.h> 

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).rend()
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define pb push_back
#define F first 
#define S second
#define INF (ll)2e18
#define pii pair<int,int>
#define int ll

void solve() {

    int k,n; cin >> k >> n;
    vector<vector<int>> par(k);
    vector<vector<int>> vis(k);
    vector<int> left(k);
    par[0].assign(n,-1);
    vis[0].assign(n,-2);
    int ans = 0;
    for (int i = 1; i < k; i++){
        int sz; cin >> sz;
        par[i].assign(sz,0);
        vis[i].assign(sz,-2);
        for (int j = 0; j < sz; j++){
            cin >> par[i][j];
            par[i][j]--;
        }
    }
    for (int i = k-1; i >= 0; i--){
        for (int j = 0; j < par[i].size(); j++){
            if (vis[i][j] != -2) continue;
            if (left[i] > 0){
                left[i]--;
            } else {
                ans++;
            }
            pii x = {i,j};
            while(vis[x.F][x.S] == -2 && par[x.F][x.S] != -1){
                x = {x.F-1, par[x.F][x.S]};
            }
            int end = -1;
            if (vis[x.F][x.S] != -2){
                end = vis[x.F][x.S];
            } else {
                end = x.F-1;
                vis[x.F][x.S] = end;
            }
            x = {i,j};
            while(vis[x.F][x.S] == -2 && par[x.F][x.S] != -1){
                vis[x.F][x.S] = end;
                x = {x.F-1, par[x.F][x.S]};
            }
            if (end >= 0)
                left[end]++;
        }
        if (i > 0 && left[i] > 0){
            left[i-1] += left[i];
        }
    }
    cout << ans << '\n';
    
    
}


int32_t main() {

    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
    
    return 0;
}