1094. The Largest Generation

A family hierarchy is usually presented by a pedigree tree where all the nodes on the same level belong to the same generation. Your task is to find the generation with the largest population.

Input Specification:

Each input file contains one test case. Each case starts with two positive integers N (<100) which is the total number of family members in the tree (and hence assume that all the members are numbered from 01 to N), and M (<N) which is the number of family members who have children. Then M lines follow, each contains the information of a family member in the following format:

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

where ID is a two-digit number representing a family member, K (>0) is the number of his/her children, followed by a sequence of two-digit ID's of his/her children. For the sake of simplicity, let us fix the root ID to be 01. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the largest population number and the level of the corresponding generation. It is assumed that such a generation is unique, and the root level is defined to be 1.

Sample Input:

23 13
21 1 23
01 4 03 02 04 05
03 3 06 07 08
06 2 12 13
13 1 21
08 2 15 16
02 2 09 10
11 2 19 20
17 1 22
05 1 11
07 1 14
09 1 17
10 1 18

Sample Output:

9 4

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <deque>
#include <queue>
#include <cstring>
#include <vector>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <stack>
#include <cmath>
#include <algorithm>
using namespace std;
#define max1 100001
#define inf -1
int main()
{
   int n,m,i;
   cin>>n>>m;
   vector<int>h(m);
   map<int,vector<int> >s;
   for(i=0;i<m;i++)
   {
     int g,k;
     cin>>g>>k;
     h[i]=g;
     int c;
     for(int j=0;j<k;j++)
 {
  cin>>c;
  s[g].push_back(c);
 }
   }
   int last=1,tail,f,level=1,max2=1,level2=1;
   queue<int> e;
   e.push(1);
   int num=0;
   while(!e.empty())
   {
    f=e.front();
    e.pop();
    i=0;
    while(i<s[f].size())
{
num++;
tail=s[f][i];
e.push(s[f][i]);
i++;
}
if(f==last)
{
last=tail;
level++;
if(max2<num)
{
max2=num;
level2=level;
}
num=0;
}
   }
   cout<<max2<<' '<<level2;
   return 0;
}