RT

不晓得蜜汁出错，求好心人看看QAQ

代码如下

#include<bits/stdc++.h>
using namespace std;
const int maxn=3001;
int f[maxn],point[maxn],id[maxn],dis[maxn],n,ans,son,fa;
bool cmp(int x,int y){
    if(dis[x]>dis[y]) return 1;
    else if(dis[x]==dis[y]) return x>y;
    else return 0;
}
int main(){
    freopen("in.txt","r",stdin);
    scanf("%d",&n);point[0]=maxn;
    for(int i=1,doit,num;i<=n;++i){
        scanf("%d%d",&doit,&num);doit++;
        point[doit]=maxn;
        for(int j=1,v;j<=num;++j){
            scanf("%d",&v);v++;
            f[v]=doit;dis[v]=dis[f[v]]+1;id[v]=v;
        }
    }
    sort(id+1,id+1+n,cmp);
    for(int i=1;i<=n;++i){
        son=id[i];fa=f[son];
        point[son]=min(point[son],point[fa]+1);
        if(point[son]>1){
            point[fa]=0;ans++;
            point[f[fa]]=min(point[f[fa]],1);
        }
    }
    printf("%d",ans);
    return 0;
}