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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include <iostream>
#include <vector>


using namespace std;


struct Node
{
	vector<int> m_vDst;

	int m_iCurrOut;
};


static int iNodeCnt, iCountOfZeroes;

static Node aNodes[102];


static void ReadData()
{
	int iChildCnt, iChild;

	cin >> iNodeCnt;

	for (int i = 0; i < iNodeCnt; ++i)
	{
		aNodes[i].m_iCurrOut = 0;

		cin >> iChildCnt;

		for (int j = 0; j < iChildCnt; ++j)
		{
			cin >> iChild;

			aNodes[i].m_vDst.push_back(iChild - 1);
		}
	}
}


static void Pass(int iNode)
{
	Node& nd = aNodes[iNode];

	if (nd.m_vDst.size() == 0)
		return;

	if (nd.m_iCurrOut == 0)
		iCountOfZeroes--;

	int iDst = nd.m_iCurrOut++;

	nd.m_iCurrOut %= nd.m_vDst.size();

	if (nd.m_iCurrOut == 0)
		iCountOfZeroes++;

	Pass(nd.m_vDst[iDst]);
}


static void Solve()
{
	int iCountOfCycles = 0;

	iCountOfZeroes = iNodeCnt;

	for (;;)
	{
		iCountOfCycles++;

		Pass(0);

		if (iCountOfZeroes == iNodeCnt)
			break;
	}

	cout << iCountOfCycles;
}


int main()
{
	ReadData();
	Solve();
}