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

#define push push_back
#define ll long long
   
using namespace std;

vector<int> S(101, 0);

int s_zeroed() {
    for(int i = 0; i < S.size(); i++) {
        if(S[i] != 0) return false;
    }
    return true;
}

void proc(int i, vector<vector<int>> P) {
    // cout << i << " " << S[i] << "\n";

    if(P[i].size() == 0){
        return;
    }

    if(S[i]+1 > P[i].size()){
        S[i] = 0;
    }

    proc(P[i][S[i]], P);

    S[i]++;

    if(S[i]+1 > P[i].size()){
        S[i] = 0;
    }
}
   
int main() {
   ios_base::sync_with_stdio(0);
   cin.tie(0);

   int n;
   cin >> n;

    vector<vector<int>> P(n+1);
   for(int i = 1; i <= n; i++) {
       int r;
       cin >> r;

       for(int j = 0; j < r; j++) {
           int tmp;
           cin >> tmp;
           
           P[i].push_back(tmp);
       }
   }

   int w = 1;
    proc(1, P);

   while(!s_zeroed()){
       w++;
       proc(1, P);
   }

   cout << w << "\n";
}