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;

int main()
{
	int n, r, l;
	cin >> n;

	vector<vector<int>> platform(n);

	for (int i = 0; i < n; ++i)
	{
		cin >> r;

		for (int j = 0; j < r; ++j)
		{
			cin >> l;

			platform[i].push_back(l - 1);
		}
	}

	vector<int> next(n);
	long res = 0;

	while (true)
	{
		++res;
		int cur = 0;

		while (platform[cur].size())
		{
			int nxt = platform[cur][next[cur]];
			next[cur] = (next[cur] + 1) % platform[cur].size();
			cur = nxt;
		}

		int ok = true;

		for (int i = 0; i < n; ++i)
		{
			if (next[i])
				ok = false;
		}

		if (ok)
			break;
	}

	cout << res << endl;

	return 0;
}