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
#define pb push_back
#define mp make_pair
#define fi first
#define se second 
#define all(...) begin(__VA_ARGS__) , end(__VA_ARGS__)
#define boost {ios_base::sync_with_stdio(false); cin.tie(); cout.tie();}
 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector <int> vi;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
constexpr ll nax = 2e5+6969, INF = 2e9+6969;

int n;
vi v[nax];
int cnt[nax], nonZero;
 
void push(int x) {
    if(v[x].size() == 0) {
        return;
    }
    int prev = cnt[x];
    cnt[x] = (cnt[x] + 1) % v[x].size();
    if(prev == 0 && cnt[x] != 0) {
        nonZero++;
    }
    if(prev != 0 && cnt[x] == 0) {
        nonZero--;
    }
    push(v[x][prev]);
}

int main() {
    scanf("%d", &n);
    nonZero = 0;
    for(int i=1;i<=n;i++) {
        int k;
        scanf("%d", &k);
        for(int j=0;j<k;j++) {
            int x;
            scanf("%d", &x);
            v[i].pb(x);
        }
    }

    push(1);
    int ans = 1;

    while(nonZero > 0) {
        push(1);
        ans++;
    }

    printf("%d\n", ans);

	return 0;
}