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
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define fi first
#define sn second

typedef long long ll;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<char> VC;
typedef pair<int, int> PI;

VI trees;
VI meetings[2];
VB followups[2];
VI ibegs;
VI iends;

int main() {
    int n, k;
    cin >> k >> n;

    int tree_idx = 0;

    trees.resize(n);
    meetings[0].resize(n);
    meetings[1].resize(n);
    followups[0].resize(n);
    followups[1].resize(n);

    int current = 1;
    int previous = 0;

    for (int i = 0; i < n; i++) {
        trees[i] = 0;
        meetings[previous][i] = i;
        followups[previous][i] = false;
    }

    tree_idx = n;
    int ni_prev = n;

    ibegs.resize(k + 1, 0);
    iends.resize(k + 1, 0);

    for (int i = 1; i <= k; i++) {
        int ni;
        if (i < k) {

            cin >> ni;
        }
        else { ni = 0; }

        while (meetings[current].size() < ni) {
            meetings[current].pb(0);
            followups[current].pb(false);
        }

        for (int j = 0; j < ni; j++) {
            int prev;
            cin >> prev;
            prev--;

            followups[current][j] = false;

            if (prev < 0) {
                trees.pb(i);
                meetings[current][j] = tree_idx;
                tree_idx++;
            }
            else {
                meetings[current][j] = meetings[previous][prev];
                followups[previous][prev] = true;
            }
        }

        for (int j = 0; j < ni_prev; j++) {
            if (!followups[previous][j]) {
                ibegs[trees[meetings[previous][j]]]++;
                iends[i]++;
            }
        }

        // for (int j = 0; j < ni_prev; j++) {
        //     cout << meetings[previous][j] << " ";
        // }
        // cout << endl;
        // for (int j = 0; j < ni; j++) {
        //     cout << meetings[current][j] << " ";
        // }
        // cout << endl;

        // for (int j = 0; j < ni_prev; j++) {
        //     cout << followups[previous][j] << " ";
        // }
        // cout << endl;
        // for (int j = 0; j < ni; j++) {
        //     cout << followups[current][j] << " ";
        // }
        // cout << endl;
        // cout << " ---- " << endl;

        ni_prev = ni;
        current++;
        current %= 2;
        previous++;
        previous %= 2;
    }

    // for (int i = 0; i < k + 1; i++)
    //     cout << ibegs[i] << " ";
    // cout << endl;

    // for (int i = 0; i < k + 1; i++)
    //     cout << iends[i] << " ";
    // cout << endl;

    int used = 0;
    int avail = 0;
    int need = 0;
    int covered = 0;

    for (int i = 0; i < k + 1; i++) {
        avail += iends[i];
        need = ibegs[i];

        covered = min(avail, need);
        need -= covered;
        avail -= covered;

        if (need > 0) {
            used += need;
        }
    }


    cout << used << endl;

    return 0;
}