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
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;

#define M 1000000007
#define INF 1000000007LL

using namespace std;

int n, k, a, pocz, kon;
int res[1000007];

struct graf
{
    vector <int> l;
    bool byl;
    bool jest;
    int res;
};
graf tab[100007];

int dfs(int nr)
{
    if(nr == kon)
    {
        return kon;
    }
    if(tab[nr].byl)
    {
        if(tab[nr].jest)
            return INF;
        else
            return tab[nr].res;
    }
    tab[nr].byl = 1;
    tab[nr].jest = 1;
    tab[nr].res = tab[nr].l.size() > 0 ? nr : INF;

    for(auto el : tab[nr].l)
        tab[nr].res = max(tab[nr].res, dfs(el));

    tab[nr].jest = 0;
    return tab[nr].res;
}

int solve()
{
    scanf("%d", &n);
    FOR(i, 1, n)
    {
        set <int> s;
        scanf("%d", &k);
        forr(j, k)
        {
            scanf("%d", &a);
            s.insert(a);
        }
        for(auto el : s)
            tab[i].l.PB(el);
    }

    for(kon = 1; kon <= n; kon++)
    {
        FOR(i, 1, n)
            tab[i].byl = 0;
        for(pocz = 1; pocz <= n; pocz++)
            if(pocz != kon)
            {
                int x = dfs(pocz);
                if(x != INF)
                    res[x]++;
//                cout << pocz << " do " << kon << " daje " << x << endl;
            }
    }

    long long suma = 0;
    FOR(i, 1, n)
    {
        suma += res[i];
        printf("%lld ", suma);
    }
    printf("\n");

    return 0;
}

int main()
{
    solve();

    return 0;
}