PAT 1004. Counting Leaves

久违的1A

没用BFS，纯粹用数组解决问题的。

#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
#define maxn 111

int level[maxn];//record the level of each node
int nodenum[maxn][2];//first num equivalent to 0 means non-leaf,else having leaf.Second num means the number of leaves 
int kid[maxn][maxn];//Record the specific kid of each node
int n,m;
int record[maxn];//Record the leaf node of every node

int check()
{
        for(int i=1;i<=n;i++)
                if(level[i]==0)
                        return 0;
        return 1;
}

void initlevel()
{
        int k=1;
        int i,j;
        level[1]=1;
        while(!check())
        {
                for(i=1;i<=n;i++)
                {
                        if(level[i]==k&&k!=0)
                                for(j=0;j<nodenum[i][1];j++)
                                        level[kid[i][j]]=k+1;
                }
                k++;
        }
}

int main()
{
        int i,j,k,l,lol;
        memset(level,0,sizeof(level));
        memset(nodenum,0,sizeof(nodenum));
        memset(kid,0,sizeof(kid));
        memset(record,0,sizeof(record));
        lol=0;

        scanf("%d %d",&n,&m);
        for(i=0;i<m;i++)
        {
                scanf("%d %d",&j,&k);
                nodenum[j][0]=1;
                nodenum[j][1]=k;
                for(l=0;l<k;l++)
                        scanf("%d",&kid[j][l]);
        }
        initlevel();
        for(i=1;i<=n;i++)
                if(nodenum[i][0]==0)
                {
                        record[level[i]]++;
                        if(level[i]>lol)
                                lol=level[i];
                }

        for(j=1;j<=lol;j++)
                if(j==1)
                        printf("%d",record[j]);
                else
                        printf(" %d",record[j]);

        return 0;
}