PAT1004差三分

package PAT1004;


import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        int[] tree = new int[101];
        int[] deep = new int[101];
        int n, m;
        int id, child;
        int k;
        Scanner sc  =new Scanner(System.in);
        n = sc.nextInt();
        m = sc.nextInt();
        for(int i = 1; i <= m; i++) {
            id = Integer.parseInt(sc.next());
            if(i == 1) {
                tree[1] = 0;
            }
            k = sc.nextInt();
            for(int j = 1; j <= k; j++) {
                child = Integer.parseInt(sc.next());
                tree[child] = id;
            }
        }



        if(n == 1 || m == 0) {
            System.out.println("1");
        }else {

            judge(tree, deep, n);
            for(int i = 1; i <= n; i++) {
                if(tree[tree[i]] > 0) {
                    tree[tree[i]] *= -1;
                }
            }
            System.out.print("0"+ " ");
            int flag;
            int preflag = deep[2];
            int num = 0;
            for(int i = 2; i <= n; i++) {
                flag = deep[i];
                if(tree[i] > 0 && preflag == flag) {
                    num++;
                }else if (tree[i] > 0){
                    System.out.print(num + " ");
                    num = 1;
                    preflag = flag;
                }
            }
            System.out.println(num);
        }
    }
    public static void judge(int[] tree, int[] deep, int n) {
        int ideep;
        int flag;
        for(int i = 1; i <= n; i++) {
            if(i == 1) {
                deep[i] = 0;
            }
            ideep = 0;
            flag = i;
            while(tree[flag] != 0) {
                flag = tree[flag];
                ideep++;
            }
            deep[i] = ideep;
        }
    }
}