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

using namespace std;

#define st first
#define nd second
#define pb push_back
#define rep(i,a,b) for(int i = a; i <= b; i++)
#define irep(i,a,b) for(int i = a; i >= b; i--)
typedef long long ll;
typedef long double ld;
//typedef __int128 int128;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pi; 
typedef pair<double,double> pd;
typedef pair<ll,ll> pl;

//trzymamy set wolnych i od ktorego momentu wolni plus punkt startu spotkania!
const int max_n = 5e5+7;
multiset<int> wolne;
vi start[max_n];
vi odw[max_n];
vi vec;

int main(){

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

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

    rep(i,1,n){
        start[1].pb(1);
        odw[1].pb(0);
    }
    int ans = n;

    rep(t,2,k){
        int dl; cin >> dl;
        vec.clear();

        rep(i,1,dl){
            int x; cin >> x;
            odw[t].pb(0);
            if(x == 0){
                start[t].pb(t);
                vec.pb(t);
            }
            else{
                start[t].pb(start[t-1][x-1]);
                if(odw[t-1][x-1]) vec.pb(start[t-1][x-1]);
                odw[t-1][x-1] = 1;
            }
        }

        rep(i,0,int(start[t-1].size())-1)
            if(!odw[t-1][i]) wolne.insert(t);
        
        //cout << "\nt: " << t << '\n';
        //cout << "size: " << wolne.size() << '\n';
        sort(vec.begin(),vec.end());
        for(auto x:vec){
            //cout << "x: " << x << '\n';
            auto it = wolne.upper_bound(x);
            if(it == wolne.begin()){
                //cout << "ans++\n";
                ans++;
                continue;
            }
            wolne.erase(--it);
        }
    }
    
    cout << ans;


    return 0;
}

//g++ -O3 -static -Wall .cpp -std=c++17