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

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}"; }
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")"; }
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, k1;
  cin >> n >> k1;
  vector<vi> p(n);
  vector<vector<vi>> g(n);
  p[0] = vi(k1, -1);
  g[0] = vector<vi>(k1);
  rep(i, 1, n) {
    int k;
    cin >> k;
    p[i].resize(k);
    g[i].resize(k);
    rep(j, 0, k) {
      cin >> p[i][j];
      p[i][j]--;
      if (p[i][j] != -1) g[i - 1][p[i][j]].push_back(j);
    }
  }
  vi ile(sz(p[n - 1]), 1);
  int wolne = 0;
  for (int i = n - 2; i >= 0; i--) {
    vi ile2(sz(p[i]));
    rep(j, 0, sz(g[i + 1])) if (p[i + 1][j] == -1) wolne += ile[j];
    rep(j, 0, sz(g[i])) {
      if (sz(g[i][j])) {
        for (int k : g[i][j]) ile2[j] += ile[k];
      } else {
        if (wolne) wolne--;
        ile2[j] = 1;
      }
    }
    ile = ile2;
    debug(i, ile, wolne);
  }
  int odp = wolne;
  for (int x : ile) odp += x;
  cout << odp << '\n';
}