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
#include<bits/stdc++.h>
using namespace std;
signed main()
{
    long long n,m;
    cin>>n>>m;
    vector<vector<long long> > demands;
    vector<vector<long long> > res;
    vector<long long> base(1);
    demands.push_back(base);
    res.push_back(base);
    base.resize(m+1,0);
    
    demands.push_back(base);
    res.push_back(base);
    for(long long i=2;i<=n;i++)
    {
        base.clear();
        base.push_back(-1);
        cin>>m;
        for(long long j=1;j<=m;j++)
        {
            long long a;
            cin>>a;
            base.push_back(a);
        }
        demands.push_back(base);
        res.push_back(base);
    }
    for(long long i=1;i<=n;i++)
    {
        for(long long j=1;j<res[i].size();j++)
        {
            res[i][j]=0;
        }
    }
    for(long long i=n;i>0;i--)
    {
        for(auto j=1;j<demands[i].size();j++)
        {
            if(res[i][j]==0) res[i][j]=1;
            res[i-1][demands[i][j]]+=res[i][j];
        }
    }
    long long out=-1;
    for(long long i=1;i<res.size();i++)
    {
        long long cur=0;
        for(long long j=1;j<res[i].size();j++)
        {
            cur+=res[i][j];
        }
        out=max(out,cur);
    }
    cout<<out;
}