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

struct p
{
	int it;
	int s;
	vector <int> con;
};

p *lis;
int n,a,it;
int res;

void preprocess()
{
	cin >> n;
	
	lis = new p [n+1];
	
	for(int i=1; i<=n; i++)
	{
		cin >> lis[i].s;
		lis[i].it = 0;
		for(int j=1; j<=lis[i].s; j++)
		{
			cin >> a;
			lis[i].con.push_back(a);
		}
	}
}

bool check()
{
	for(int i=1; i<=n; i++)
		if(lis[i].it != 0) return 0;
	return 1;
}

void insert(int v)
{
	if(lis[v].s != 0)
	{
		it = lis[v].it;
		if(it == lis[v].s-1) lis[v].it = 0;
		else lis[v].it ++;
		
		insert(lis[v].con[it]);
	}
}

void solve()
{
	while(true)
	{
		insert(1);
		res++;
		if(check()) break;
	}
	
	cout << res;
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	preprocess();
	solve();
}