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

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int k;
  cin >> k;
  vector<vector<int>> T(k + 1), cnt(k + 1);
  T[0] = {0};
  cnt[0] = {0};
  {
    int n;
    cin >> n;
    T[1].assign(n, 1);
    cnt[1].resize(n);
  }
  for (int i = 2; i <= k; i++) {
    int n;
    cin >> n;
    T[i].resize(n);
    cnt[i].resize(n);
    for (auto &v : T[i])
      cin >> v;
  }
  int r = 0;
  for (int i = k; i >= 1; i--) {
    for (int j = 0; j < (int)T[i].size(); j++) {
      if (!cnt[i][j])
        cnt[i][j] = 1;
      if (T[i][j])
        cnt[i - 1][T[i][j] - 1] += cnt[i][j];
    }
    r = max(r, accumulate(cnt[i].begin(), cnt[i].end(), 0));
  }
  r = max(r, cnt[0][0]);
  cout << r << '\n';
}