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

using namespace std;
const int MAXN = 100;

struct node {
	vector<int> con;
	int cur;
};

node g[MAXN + 5];

void dfs(int n)
{
	if (!g[n].con.empty())
	{
		dfs(g[n].con[g[n].cur]);
		g[n].cur++;
		if (g[n].cur >= g[n].con.size()) g[n].cur = 0;
	}
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	int r, l;
	for (int i = 1; i <= n; i++)
	{
		cin >> r;
		for (int j = 0; j < r; j++)
		{
			cin >> l;
			g[i].con.push_back(l);
			g[i].cur = 0;
		}
	}
	int w = 0;
	bool b;
	do
	{
		dfs(1);
		w++;
		b = 0;
		for (int i = 1; i <= n; i++)
		{
			if (g[i].cur != 0) b = 1;
		}
	} while (b);

	cout << w;
}