rt，用拓扑排序+倍增LCA 50pts，各种hack全都过了，最后发现大洋里全是 $-1$

#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<cstdlib>
#include<cstdio>
#include<fstream>
#define int long long
#define endl '\n'
using namespace std;
const int N=5e5+10;
const int MD=1e9+7;

int su;
int fa[N][20],p[N],dep[N],siz[N],n,m;
vector<int>e[N],g[N];

int LCA(int x,int y){
    if(dep[x]<dep[y])swap(x,y);

    int H=log2(dep[x]-dep[y]);
    for(int i=H;i>=0;i--){
        if(dep[fa[x][i]]>=dep[y])x=fa[x][i];
    }
    if(x==y)return x;

    H=log2(dep[y]);
    for(int i=H;i>=0;i--){
        if(fa[x][i]!=fa[y][i]){
            x=fa[x][i];
            y=fa[y][i];
        }
    }
    return fa[x][0];
}

void add(int x){
    int H=log2(x);
    for(int i=1;i<=H;i++)fa[x][i]=fa[fa[x][i-1]][i-1];
    g[fa[x][0]].push_back(x);
}

void top(){
    for(int i=1;i<=n;i++){
        if(p[i]==0)e[su].push_back(i),p[i]++;
    }
    queue<int>q;
    q.push(su);
    dep[su]=1;
    while(!q.empty()){
        int u=q.front();
        q.pop();
        for(int i=0;i<e[u].size();i++){
            int v=e[u][i];
            if(fa[v][0]==0)fa[v][0]=u;
            else fa[v][0]=LCA(u,fa[v][0]);
            p[v]--;
            if(p[v]==0){
                dep[v]=dep[fa[v][0]]+1;
                add(v);
                q.push(v);
            }
        }
    }
}

void dfs(int u,int fa){
    siz[u]=1;
    for(int i=0;i<g[u].size();i++){
        int v=g[u][i];
        if(v==fa)continue;
        dfs(v,u);
        siz[u]+=siz[v];
    }
}

signed main(){
    // freopen("P2597_6.in","r",stdin);
    cin>>n;
    su=n+1;
    for(int u=1;u<=n;u++){
        int v;
        while(1){
            cin>>v;
            if(v==0)break;
            e[v].push_back(u);
            p[u]++;
        }
    }
    top();
    dfs(su,0);
    for(int i=1;i<=n;i++)cout<<siz[i]-1<<endl;
    return 0;
}