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
//2022-12-17
//author: Marcin Rolbiecki
#include <bits/stdc++.h>
using namespace std;

const int maxN = 110;

int n;
vector <vector <int>> G (maxN);
int counter[maxN];
int zeroes, turns;

void dfs (int x) {
	
	if (!G[x].size()) return;
	
	dfs(G[x][counter[x]]);
	if (counter[x] == 0) zeroes--;
	counter[x] = (counter[x] + 1) % G[x].size();
	if (counter[x] == 0) zeroes++;
}

int main () {
		
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	zeroes = n;
	
	for (int i = 1; i <= n; i++) {
		int r; cin >> r;
		for (int j = 0; j < r; j++) {
			int a; cin >> a;
			G[i].push_back(a);
		}
	}
	
	do {
		
		dfs(1);
		turns++;
		
	} while (zeroes != n);
	
	cout << turns;
	
	return 0;
}