PAT 1094

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
using namespace std;

const int maxn=100010;

struct Node
{
	int weight;
	vector<int>	child;
}node[maxn];

int n;
int p;
int ans=0;
int _time[maxn]={0};
int maxpeople=-1;
void dfs(int index,int depth)
{
		if(node[index].child.size()==0)
		{	
			if(depth==1)
			{
				_time[1]++;
			}
			return;
		}
	
		for(int i=0;i<node[index].child.size();i++)
		{
			int child=node[index].child[i];
			_time[depth+1]++;
			dfs(child,depth+1);
		}
}
int main()
{
	scanf("%d%d",&n,&p);
	int id,k,child;
	for(int i=0;i<p;i++)
	{
		scanf("%d%d",&id,&k);
			for(int j=0;j<k;j++)
			{
				scanf("%d",&child);
				node[id].child.push_back(child);
			}
	}
	dfs(1,1);
	for(int i=1;i<=100;i++)	
	{
		if(_time[i]>maxpeople)
		{
			maxpeople=_time[i];
			ans=i;
		}
	}
	printf("%d %d",maxpeople,ans);
	system("pause");
	return 0;
}