1094. The Largest Generation (25)

#include<iostream>
#include<iomanip>
#include<vector>
int max_num=0,max_num_depth=0;
std::vector<int> a[100];
int p[100]={0};
void dfs(int index,int depth){
    p[depth]++;
    if(p[depth]>max_num){max_num=p[depth];max_num_depth=depth;}
    for(unsigned int i=0;i<a[index].size();i++)
        dfs(a[index][i],depth+1);
}
int main()
{
    int n,line;
    std::cin>>n>>line;
    for(int t=0;t<line;t++){
        int i,j;
        std::cin>>i>>j;
        for(int x=0;x<j;x++){
            int temp;
            std::cin>>temp;
            a[i].push_back(temp);
        }
    }
    dfs(1,1);
    std::cout<<max_num<<" "<<max_num_depth<<std::endl;
}