#include<bits/stdc++.h>
#define int long long
using namespace std;
vector<int>adj[5005];
int vis[5005];
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;cin>>n;
for(int i=1;i<=n;i++){
int t;cin>>t;
for(int i=1;i<=t;i++){
int x;cin>>x;
adj[x].push_back(i);
}
}
int rans=LLONG_MAX;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)vis[j]=0;
vis[i]=1;
queue<pair<int,int>>q;
q.push({1,i});
int cnt=0;
int sum=0;
while(!q.empty()){
int u=q.front().second;
int d=q.front().first;
q.pop();
cnt++;
for(auto x:adj[u]){
if(vis[x])continue;
vis[x]=1;
q.push({d+1,x});
}
sum+=d;
}
assert(cnt<=n);
if(cnt==n)rans=min(rans,sum);
}
cout<<rans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |