1094 The Largest Generation (25 分)
#include <iostream>
#include <vector>
using namespace std;
vector<int> v[110];
int level[110];
void dfs(int x, int h){
level[h]++;
for(int i = 0; i < v[x].size(); ++i)
dfs(v[x][i], h + 1);
}
int main(){
int n, m, k, x, id;
cin >> n >> m;
while(m--){
cin >> id >> k;
while(k--){
cin >> x;
v[id].push_back(x);
}
}
dfs(1, 1);
int t = 0;
for(int i = 1; i < 110; ++i)
if(level[i] > level[t])
t = i;
cout << level[t] << " " << t;
}