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

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int a, b, c, i1, w = 0, tw = 0;
	cin >> a >> i1;
	vector <vector <int>> v(a);
	for(int i = 0; i < i1; i++) v[0].push_back(0);
	for(int i = 1; i < a; i++){
		cin >> b;
		for(int j = 0; j < b; j++){
			cin >> c;
			v[i].push_back(c);
		}
	}
	w = v[a - 1].size();
	for(int i = a - 1; i > 0; i--){
		sort(v[i].begin(), v[i].end());
		tw = 0;
		i1 = (int) v[i - 1].size();
		for(int j = 1; j < (int) v[i].size(); j++){
			if(v[i][j] == v[i][j - 1] && v[i][j] != 0){ 
				tw++;
				v[i - 1].push_back(v[i - 1][v[i][j] - 1]);
			}
		}
		w = max(w, i1 + tw);
	}
	cout << w;
}