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

#define int long long
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " = " << (x) << '\n'


void solve(void) {
  int k, n; cin >> k >> n;

  int ans = n;
  vector<vector<int>> g(k + 1);
  for (int i = 1; i <= n; i++) {
    g[1].emplace_back(i);
  }

  int x;
  for (int q = 2; q <= k; q++) {
    cin >> n;
    for (int i = 0; i < n; i++) {
      cin >> x;
      g[q].emplace_back(x);
    }
  }

  map<int, int> last;
  for (int i = 0; i < (int) g[k].size(); i++) {
    last[g[k][i]]++;
  }

  for (int q = k - 1; q >= 1; q--) {
    map<int, int> new_l;
    int p_ans = 0;

    for (int i = 0; i < (int) g[q].size(); i++) {
      if (last[i + 1] > 1) {
        p_ans += last[i + 1];
        new_l[g[q][i]] += last[i + 1];
      } else {
        p_ans++;
        new_l[g[q][i]]++;
      }
    }

    ans = max(ans, p_ans);
    last.swap(new_l);
  }
  cout << ans << "\n";
}

signed main(void) {
  ios::sync_with_stdio(0);
  cin.tie(0);

  int t;
  t = 1;
  // cin >> t;
  while (t--) solve();
  return 0;
}