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

using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define FORD(i,a,b) for(int i = (a); i >= (b); i--)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define LD long double
#define FI first
#define SE second
#define st FI
#define nd SE
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())

template<class C> void mini(C &a4, C b4) { a4 = min(a4, b4); }
template<class C> void maxi(C &a4, C b4) { a4 = max(a4, b4); }

template<class TH> void _dbg(const char *sdbg, TH h){ cerr<<sdbg<<'='<<h<<endl; }
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
  while(*sdbg!=',')cerr<<*sdbg++;
  cerr<<'='<<h<<',';
  _dbg(sdbg+1, a...);
}

template<class T> ostream &operator<<(ostream& os, vector<T> V) {
  os << "["; for (auto vv : V) os << vv << ","; return os << "]";
}
template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
  return os << "(" << P.st << "," << P.nd << ")";
}

#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif

int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(11);
  cerr << fixed << setprecision(6);
  int k, n;
  cin >> k >> n;
  vector<VI> dependencies(k);
  dependencies[0] = VI(n, 0);
  FOR(i, 1, k - 1) {
    int m;
    cin >> m;
    dependencies[i] = VI(m);
    for (int &x : dependencies[i]) {
      cin >> x;
    }
  }
  VI old_demand;
  int old_free_demand = 0;
  FORD(i, k - 1, 0){
    VI new_demand(SZ(dependencies[i]));
    REP(j, SZ(old_demand)){
      int meeting = dependencies[i + 1][j];
      int demand = old_demand[j];
      if(meeting == 0){
        old_free_demand += demand;
      } else{
        new_demand[meeting - 1] += demand;
      }
    }
    REP(j, SZ(new_demand)){
      if(new_demand[j] == 0){
        old_free_demand -= 1;
        new_demand[j] = 1;
      }
    }
    maxi(old_free_demand, 0LL);
    old_demand = new_demand;
    debug(old_demand, old_free_demand);
  }
  for(int a: old_demand){
    old_free_demand += a;
  }
  cout << old_free_demand << "\n";
}