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
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define vc vector
#define st first
#define nd second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)a.size()
#define pub push_back
#define pob pop_back

void program() {
    ll n, s;
    cin >> n >> s;
    vc<vc<vc<ll>>> g(n);
    g[0] = vc<vc<ll>>(s);
    for (ll i = 1; i < n; i++) {
        cin >> s;
        g[i] = vc<vc<ll>>(s);
        for (ll j = 0; j < s; j++) {
            ll p;
            cin >> p;
            if (p == 0)
                continue;
            p--;
            g[i - 1][p].pub(j);
        }
    }

    ll ans = 0;
    vc<vc<ll>> a(n);
    for (ll i = n - 1; i >= 0; i--) {
        ll s = sz(g[i]);
        a[i] = vc<ll>(s);
        ll t = 0;
        for (ll j = 0; j < s; j++) {
            for (ll k : g[i][j])
                a[i][j] += a[i + 1][k];
            a[i][j] = max(a[i][j], 1ll);
            t += a[i][j];
        }
        ans = max(ans, t);
    }
    cout << ans << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    program();
    return 0;
}