1094. The Largest Generation (25)
2017.9.10更新
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
int n,m;
vector<vector<int>> v;
vector<int> lev;
void solve(int r,int dep)
{
if(dep+1>lev.size())lev.resize(dep+1);
lev[dep]++;
for(auto x:v[r])
{
solve(x,dep+1);
}
}
int main()
{
cin>>n>>m;
v.resize(n+1);
for(int i=0;i<m;++i)
{
int id,k,idx;
cin>>id>>k;
for(int i=0;i<k;++i)
{
cin>>idx;
v[id].push_back(idx);
}
}
solve(1,0);
int l=0,maxgen=-1;
for(unsigned int i=0;i<lev.size();++i)
{
if(maxgen<lev[i]) maxgen=lev[l=i];
}
cout<<maxgen<<" "<<l+1;
return 0;
}
以前ac代码
#include <cstdio>
#include <vector>
#include <queue>
int main()
{
std::vector<std::vector<int>> v(100);
int n,m;
scanf("%d %d",&n,&m);
while(m--)
{
int w,k;
scanf("%d %d",&w,&k);
while(k--)
{
int x;
scanf("%d",&x);
v[w].push_back(x);
}
}
std::queue<int> q;
int root=1;
q.push(root);
int max=-1,level=1,curlevel=1;
while(!q.empty())
{
if(max<(int)q.size())
{
max=(int)q.size();
level=curlevel;
}
int m=(int)q.size();
while(m--)
{
int k=q.front();
q.pop();
for(auto it=v[k].begin();it!=v[k].end();++it)
q.push(*it);
}
++curlevel;
}
printf("%d %d",max,level);
return 0;
}