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
/* -----------------------
Autor: Tomasz Boguslawski
-------------------------- */
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<fstream>
#include<iomanip>
#include<string>
#include<sstream>
#include<cstring>
#include<map>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include <fstream>
#include<math.h>

#define LL long long
#define FOR(x, b, e) for(LL x = b; x <= (e); x++)
#define FORS(x, b, e, s) for(LL x = b; x <= (e); x+=s)
#define FORD(x, b, e) for(LL x = b; x >= (e); x--)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG if (debug)
#define MIN(a,b) ((a>b)?b:a)
#define MAX(a,b) ((a>b)?a:b)

using namespace std;

int k;
int n[501000];
int* cont[501000];
int* people[501000];

void readData()
{
    cin >> k; cin >> n[1];
    cont[1] = new int[n[1]+2]; people[1] = new int[n[1]+2];
    FOR(j,1,n[1]) cont[1][j]=0;
    FOR(i,2,k)
    {
        cin >> n[i];
        cont[i] = new int[n[i]+2]; people[i] = new int[n[i]+2];
        FOR(j,1,n[i]) cin >> cont[i][j];
    }
}

int findMax()
{
    int maks = 0;
    FOR(j,1,n[k]) people[k][j]=0;
    FORD(i,k,1)
    {
        int needed=0;
        FOR(j,1,n[i])
        {
            if (people[i][j]==0) people[i][j]=1;
            needed+=people[i][j];
        }
        if (needed>maks) maks=needed;
        if (i!=1)
        {
            FOR(j,1,n[i-1]) people[i-1][j]=0;
            FOR(j,1,n[i])
            {
                if (cont[i][j]!=0) people[i-1][ cont[i][j] ] += people[i][j];
            }
        }
    }
    return maks;
}

/// MAIN
int main(int argc, char* argv[])
{
    // magic formula, which makes streams work faster:
	ios_base::sync_with_stdio(0);
	readData();
    cout << findMax() << "\n";
	return 0;
}