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
#include <bitset>
#include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;

const int maxN = 5e5 + 10;
vector<int> nbh[maxN];
vector<int> cnt[maxN];
int K;

int main()
{
    int n1;
    scanf("%d%d", &K, &n1);
    cnt[0].resize(n1);
    for (int i = 1; i < K; ++i)
    {
        int n;
        scanf("%d", &n);
        cnt[i].resize(n);
        nbh[i].resize(n);
        for (int j = 0; j < n; ++j)
            scanf("%d", &nbh[i][j]);
    }

    int result = 0;
    for (int i = K - 1; i; --i)
    {
        int sum = 0;
        for (int j = 0; j < cnt[i].size(); ++j)
        {
            if (!cnt[i][j])
                cnt[i][j]++;
            if (nbh[i][j])
                cnt[i - 1][nbh[i][j] - 1] += cnt[i][j];
            sum += cnt[i][j];
        }
        result = max(result, sum);
    }
    int sum = 0;
    for (int a : cnt[0])
    {
        sum += max(1, a);
    }
    printf("%d\n", max(result, sum));
    return 0;
}