pat甲 1004 Counting Leaves (30)

题目大意：N代表N个节点。M代表，接下来M行输入。

每一行：ID代表父节点，k代表有几个儿子，ID[x]代表儿子是那些。

输出关系树每一层的没有儿子的节点数，也就是叶子数。

思路：把关系存储起来，找到父节点

遍历找每一层叶子数，用数组存储起来

输出

 

 

#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn = 105;
vector<int> v[maxn];
map<string, int> mp;
int counts, n, m, maxLevel;
int ans[maxn];
int get_id(string n)
{
    if(!mp.count(n))
        mp[n] = counts++;
    return mp[n];
}
int findFather()
{
    //cout<<"yes"<<endl;
    int vis[n];
    memset(vis, 0, sizeof(vis));
    for(int i = 0; i < n; i++)
        for(int j = 0; j < v[i].size(); j++)
        {
            //cout<<v[i][j]<<endl;
            vis[v[i][j]] = 1;
        }
    for(int i = 0; i < n; i++)
    {
        if(!vis[i])
            return i;
    }
}
void travel(int root, int level)
{
    maxLevel = max(level, maxLevel);
    if(!v[root].size()) ans[level]++;
    for(int i = 0; i < v[root].size(); i++)
    {
        int son = v[root][i];
        travel(son, level + 1);
    }
}
void solve()
{
    memset(ans, 0, sizeof(ans));
    int f = findFather();
    //cout<<f<<endl;
    travel(f, 0);
    for(int i = 0; i <= maxLevel; i++)
    {
        cout<<ans[i];
        if(i != maxLevel) cout<<" ";
    }
    cout<<endl;

}
int main()
{
    while(cin>>n>>m)
    {
        maxLevel = 0;
        counts = 0;
        mp.clear();
        for(int i = 0; i <= n; i++)
            v[i].clear();
        for(int i = 0; i < m; i++)
        {
            string id;
            int k;
            cin>>id>>k;
            int newId = get_id(id);
            for(int j = 0; j < k; j++)
            {
                string sons;
                cin>>sons;
                int sonsId = get_id(sons);
                v[newId].push_back(sonsId);
            }
        }
        solve();

    }


    return 0;
}