代码:
#include<iostream>
#include<vector>
#include<map>
using namespace std;
int m, n;
int level, maxn;
map<int, int>sk;
vector<vector<int> >pp;
void dfs(int index,int high)
{
if (pp[index].size() != 0)
{
sk[high]++;
for (int i = 0; i < pp[index].size(); i++)
dfs(pp[index][i],high+1);
}
else
{
sk[high]++;
}
}
int main()
{
cin >> n >> m;
pp.resize(n+1);
for (int i = 1; i <= m; i++)
{
int a, b;
cin >> a >> b;
for (int j = 0; j < b; j++)
{
int c;
cin >> c;
pp[a].push_back(c);
}
}
dfs(1,0);
for (auto it = sk.begin(); it != sk.end(); it++)
{
if (it->second>maxn){ maxn = it->second; level = it->first + 1; }
}
cout << maxn << " " << level;
return 0;
}