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

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int k, n;
    cin>>k>>n;
    vector<vector<int>> a, w;
    a.push_back(vector<int>(n, 0));
    w.push_back(vector<int>(n, 0));
    for (int i=0; i<k-1; ++i)
    {
        int ni;
        cin>>ni;
        vector<int> ai(ni);
        for (int j=0; j<ni; ++j)
            cin>>ai[j];
        a.push_back(ai);
        w.push_back(vector<int>(ni, 0));
    }
    int wyn=0;
    for (int i=k-1; 0<=i; --i)
    {
        int wd=0;
        for (int j=0; j<a[i].size(); ++j)
        {
            int ww=max(1, w[i][j]);
            wd+=ww;
            int aa=a[i][j];
            if (aa)
                w[i-1][aa-1]+=ww;
        }
        wyn=max(wyn, wd);
    }
    cout<<wyn<<endl;
    return 0;
}