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

using namespace std;
#define vec vector

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int k, n1; cin >> k >> n1;

  vec<vec<int>> in(k);
  vec<int> ns(k);
  ns[0] = n1;

  for (int i = 0; i < k - 1; i++) {
    int n; cin >> n;
    in[i + 1].assign(n, 0);
    ns[i + 1] = n;

    for (int j = 0; j < n; j++) {
      cin >> in[i + 1][j];
    }
  }

  vec<vec<int>> hasin(k);
  vec<vec<int>> hasout(k);
  hasout[0].assign(ns[0], 0);
  hasin[0].assign(ns[0], 0);
  for (int i = 1; i < k; i ++) {
    hasout[i].assign(ns[i], 0);
    hasin[i].assign(ns[i], 0);
    for (int j = 0; j < ns[i]; j++) {
      if (in[i][j] != 0) {
        hasout[i - 1][in[i][j] - 1] = true; 
        hasin[i][j] = true;
      }
    }
  }

  // for (int i = 0; i < k; i++) {
  //   for (int j = 0; j < ns[i]; j++) {
  //     cout << hasin[i][j] << " ";
  //   }
  //   cout << "\n";
  // }
  // cout << "\n";
  // for (int i = 0; i < k; i++) {
  //   for (int j = 0; j < ns[i]; j++) {
  //     cout << hasout[i][j] << " ";
  //   }
  //   cout << "\n";
  // }
  // cout << "\n";

  int curfree = 0;
  int res = 0;
  vec<int> used(ns[k - 1]);

  for (int i = k - 1; i >= 1; i--) {
    vec<int> newused(ns[i - 1]);
    int newfree = 0;

    for (int j = 0; j < ns[i]; j++) {
      if (!hasout[i][j]) {
        curfree --;
        if (curfree < 0) res ++;
        curfree = max(curfree, 0);

        if (hasin[i][j]) {
          newused[in[i][j] - 1] ++;
        } else {
          newfree ++;
        }
      }
      if (!hasin[i][j] and hasout[i][j]) {
        newfree += used[j];
      }
      if (hasin[i][j] and hasout[i][j]) {
        newused[in[i][j] - 1] += used[j];
      }
      
    }
    newfree += curfree;
    curfree = newfree;
    used = newused;
    // for (int j: used) {
    //   cout << j << " ";
    // }
    // cout << "\n";
    // cout << curfree << "\n";
  }

  for (int j = 0; j < ns[0]; j++) {
    if (!hasout[0][j]) {
      curfree--;
      if (curfree < 0) res++;
      curfree = max(curfree, 0);
    }
  }
  cout << res;
}