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

#define all(v) (v).begin(), (v).end()
#define st first
#define nd second
#define pb push_back
#define printv(a) { for(auto u : a) cout<<u<<" "; cout<<"\n"; }
#define debug(x) cerr << #x << " = " << x << '\n';

using namespace std;
using ll = long long;
using pii = pair<int,int>;
using vi = vector<int>;
using si = set<int>;
using mii = map<int,int>;

const int MAXN = 1000005;

vector<int> g[MAXN];

vector<pair<int,int> > zda;
int siz[MAXN];
int day[MAXN];
bool odw[MAXN];

int dfs(int v){
    odw[v] = true;
    //cout<<" jestesmy w "<<v<<endl;
    if(g[v].size() == 0){
        zda.pb({day[v], MAXN});
        //cout<<" to jest lisc"<<endl;
        return 1;
    }
    int wyn = 0;
    for(int u : g[v]) wyn += dfs(u);
    return wyn;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int k,n1, prev = 0;
    cin>>k>>n1;
    for(int i=1;i<=n1;i++) day[i] = 1;
    for(int l=1;l<k;l++){
        int n;
        cin>>n;
        for(int i=0;i<n;i++){
            int a;
            cin>>a;
            day[n1+i+1] = l+1;
            if(a!=0) g[prev + a].pb(n1+i+1); 
        }
        prev = n1;
        n1 += n;
    }
    for(int i=1;i<=n1;i++){ 
        if(!odw[i]){
            zda.pb({day[i],dfs(i)});
        }
    }
    sort(zda.begin(),zda.end());
    int wyn = 0;
    int zap = 0;
    for(auto [d,val] : zda){
        if(val == MAXN){   
            zap++;
        }else{
            if(zap >= val){
                zap -= val;
            }else{
                wyn += val - zap;
                zap = 0;
            }
        }
    }
    cout<<wyn<<endl;
    return 0;
}