1004 Counting Leaves （30 分）[PAT (Advanced Level) Practice]

1004 Counting Leaves （30 分）

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.

Input Specification:

Each input file contains one test case. Each case starts with a line containing $0<N<100$, the number of nodes in a tree, and $M(<N)$, the number of non-leaf nodes. Then $M$ lines follow, each in the format:

ID K ID[1] ID[2] ... ID[K]

where ID is a two-digit number representing a given non-leaf node, K is the number of its children, followed by a sequence of two-digit ID's of its children. For the sake of simplicity, let us fix the root ID to be 01.

The input ends with $N$ being 0. That case must NOT be processed.

Output Specification:

For each test case, you are supposed to count those family members who have no child for every seniority level starting from the root. The numbers must be printed in a line, separated by a space, and there must be no extra space at the end of each line.

The sample case represents a tree with only 2 nodes, where 01 is the root and 02 is its only child. Hence on the root 01 level, there is 0 leaf node; and on the next level, there is 1 leaf node. Then we should output 0 1 in a line.

Sample Input:

2 1
01 1 02

Sample Output:

0 1

My code:

#include <stdio.h>
#include <stdlib.h>

#define MAX 100
typedef int* INT;

void countleaf(int root, INT ID[], int level, int *leaf, int *tmp2, int *max)
{
    if(tmp2[root]==0) {
        leaf[level]++;
        if(level>*max) *max=level;
    }
    else{
        int K = ID[root][0];
        for(int i=1; i<=K; i++){
            countleaf(ID[root][i], ID, level+1, leaf, tmp2, max);
        }
    }
}

int main(void)
{
    int N,M;
    scanf("%d %d", &N, &M);

    //findroot
    int root, tmp1[MAX], tmp2[MAX];
    for(int i=0; i<MAX; i++){
        tmp1[i] = 0;
        tmp2[i] = 0;
    }

    INT ID[MAX];
    for(int i=0; i<M; i++){
        int id, K, cid;
        scanf("%d %d", &id, &K);

        ID[id] = (INT) malloc (sizeof(int)*(K+1));
        ID[id][0] = K;
        tmp2[id] = 1;

        for(int j=1; j<=K; j++){
            scanf("%d", &cid);
            ID[id][j] = cid;
            tmp1[cid] = 1;
        }
    }

    for(int i=1; i<MAX; i++){
        if(tmp1[i]==0){
            root = i;
            break;
        }
    }

    int leaf[MAX], rear=-1;
    for(int i=0; i<MAX; i++) leaf[i] = 0;

    countleaf(root, ID, 0, leaf, tmp2, &rear);

    for(int i=0; i<rear; i++){
        printf("%d ", leaf[i]);
    }
    printf("%d\n", leaf[rear]);

    for(int i=1; i<MAX; i++){
        if(tmp2[i]==1){
            free(ID[i]);
        }
    }
    return 0;
}

注：空间换时间