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
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int parent[500005];
int deg[500005];
bool odw[500005];
int sub_cnt[500005];
vi verts[500005];
int cur_vert;

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n,k0;
    cin >> n >> k0;
    cur_vert = 1;
    rep(i,k0) verts[0].pb(cur_vert++);
    int sum = k0;
    rep(i,n-1)
    {
        int ki;
        cin >> ki;
        sum += ki;
        rep(j,ki)
        {
            int x;
            cin >> x;
            if(x != 0) 
            {
                parent[cur_vert] = verts[i][x-1];
                deg[verts[i][x-1]]++;
            }
            verts[i+1].pb(cur_vert++);
        }
    }
    for(int i = n-1; i >= 0; i--)
    {
        forall(it,verts[i])
        {
            if(deg[it] == 0) sub_cnt[it] = 1;
            sub_cnt[parent[it]] += sub_cnt[it];
        }
    }
    int ans = 0;
    int cur = 0;
    rep(i,n) 
    {
        forall(it,verts[i])
        {
            if(parent[it] == 0)
            {
                ans += max(0,sub_cnt[it]-cur);
                cur = max(0,cur-sub_cnt[it]);
            }
        }
        forall(it,verts[i]) if(deg[it] == 0) cur++;
    }
    cout << ans << "\n";
}