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
#include <cstdio>
#include <vector>

int main() {
  std::vector<std::vector<int>> t, sz;

  int k, n1;
  scanf("%d%d", &k, &n1);

  t.push_back(std::vector<int>(n1, -1));
  sz.push_back(std::vector<int>(n1, 0));

  for (int i = 0; i < k - 1; ++i) {
    int n;
    scanf("%d", &n);
    t.push_back(std::vector<int>());
    sz.push_back(std::vector<int>());

    while (n > 0) {
      int a;
      scanf("%d", &a);
      t[i + 1].push_back(a - 1);
      sz[i + 1].push_back(0);
      --n;
    }
  }

  for (int i = k - 1; i > 0; --i) {
    for (int j = 0; j < sz[i].size(); ++j) { 
      if (sz[i][j] == 0) {
        sz[i][j] = 1;
      }
      if (t[i][j] != -1) {
        sz[i-1][t[i][j]] += sz[i][j];
      }
    }
  }

  for (int j = 0; j < sz[0].size(); ++j) {
    if (sz[0][j] == 0) {
      sz[0][j] = 1;
    }
  }

  int result = 0;
  for (int i = 0; i < k; ++i) {
    int current = 0;
    for (int j = 0; j < sz[i].size(); ++j) {
      current += sz[i][j];
    }
    if (current > result) {
      result = current;
    }
  }

  printf("%d\n", result);
}