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

int main () {
  ios_base::sync_with_stdio(0); cin.tie(0);
  int k, n1;
  cin >> k >> n1;
  vector<vector<int>> par(k), dp(k), c(k);
  par[0].resize(n1, -1);
  dp[0].resize(n1, 1);
  c[0].resize(n1);
  for (int i = 1; i < k; i++) {
    int n;
    cin >> n;
    par[i].resize(n);
    dp[i].resize(n, 1);
    c[i].resize(n);
    for (auto& x: par[i]) cin >> x, x--;
  }
  int ans = 0;
  for (int i = k-1; i >= 0; i--) {
    for (int j = 0; j < (int)par[i].size(); j++) {
      if (par[i][j] != -1) {
        if (!c[i-1][par[i][j]]) {
          dp[i-1][par[i][j]] = dp[i][j];
          c[i-1][par[i][j]] = 1;
        }
        else dp[i-1][par[i][j]] += dp[i][j];
      }
    }
    ans = max(ans, accumulate(dp[i].begin(), dp[i].end(), 0));
  }
  cout << ans << '\n';
}