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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
const int N=500100;
pair<int,vector<int>>v[N];
bool visite[N];
int sumy[N];
int wynik=0;
struct hashpair{
    template <class T1,class T2>
    int operator() (const pair<T1,T2>&p)const
    {
        return (hash<int>()(p.first)^hash<int>()(p.second))<<1;
    }
};
unordered_map<pair<int,int>,int,hashpair>m;
int dzien[N];
int dfs(int x){
    visite[x]=1;
    if(v[x].second.size()==0){
            v[x].first=1;
            sumy[dzien[x]]+=1;
            wynik=max(wynik,sumy[dzien[x]]);
          //  cout<<"ostatni "<<x<<"\n";
        return 1;
    }
    int suma=0;
    for(int e:v[x].second){
      //  cout<<x<<" ma "<<e<<"\n";
        if(visite[e]==0){
        //    cout<<"wchodze do: "<<e<<"\n";
            suma+=dfs(e);
        }else{
            suma+=v[e].first;
        }
    }

  //  cout<<"dzien "<<dzien[x]<<"\n";
    sumy[dzien[x]]+=suma;
    wynik=max(wynik,sumy[dzien[x]]);
    v[x].first=suma;
   // cout<<x<<" : "<<suma<<"\n";
    return suma;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int k,n;
    cin>>k>>n;
    int maxn=n;
    int index=1;
    for(int i=1;i<=n;i++){
            m[{1,i}]=index;
            v[0].second.push_back(index);
            dzien[index]=1;
            index++;
    }
    for(int i=2;i<=k;i++){
        cin>>n;
        maxn=max(maxn,n);
        for(int j=1;j<=n;j++){
            int a;
            cin>>a;
            if(a!=0){
                v[m[{i-1,a}]].second.push_back(index);
            }
            dzien[index]=i;
            m[{i,j}]=index;
            index++;
            //cout<<"  "<<i<<" "<<j<<" "<<m[{i,j}]<<"\n";
        }
    }
    /*for(int i=0;i<index;i++){
        for(int j=0;j<v[i].size();j++){
            cout<<v[i][j]<<" ";
        }
        cout<<"\n";
    }*/
    for(int i=index-1;i>=0;i--){
        if(visite[i]==0){
            dfs(i);
        }
    }
    wynik=max(wynik,maxn);
    cout<<wynik;
    return 0;
}