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
//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")

#include <bits/stdc++.h>

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
template<class T>
using vec = vector<T>;

template<typename T>
bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T>
bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef KoRoVa
#define DEBUG for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl
template <class ...Ts> auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }
#else
#define DEBUG while (false)
#define LOG(...)
#endif

const int max_n = 1e6 + 11, inf = 1000111222;



vector <int> edge[max_n];

int day[max_n], add[max_n];

int used[max_n], need;

void dfs (int v) {
    used[v] = 1;
    for (int to : edge[v]) {
        dfs(to);
    }
    if (edge[v].empty()) {
        ++add[day[v] + 1];
        ++need;
    }
}



int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

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

    int k, n1;
    cin >> k >> n1;
    int sum = n1, last = n1;
    for (int i = 1; i < k; i++) {
        int n;
        cin >> n;
        for (int j = 0, x; j < n; j++) {
            cin >> x;
            int cur_id = sum + j;
            if (x) {
                int prev_id = (sum - last) + x - 1;
                edge[prev_id].pb(cur_id);
            }
            day[cur_id] = i;
        }
        sum += n;
        last = n;
//        if (sum > 5e5) {
//            cout << "-1\n";
//            return 0;
//        }
    }
    int ans = 0, now = 0;
    for (int i = 0, j = 0; i < sum; i++) {
        while (j <= day[i]) {
            now += add[j];
            ++j;
        }
        if (!used[i]) {
            need = 0;
            dfs(i);
            if (need <= now) {
                now -= need;
            }
            else {
                ans += need - now;
                now = 0;
            }
        }
    }
    cout << ans << '\n';
}

/*
KoRoVa!
*/