This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll ans=LLONG_MAX,tmp=0;
int cnt=0;
bool vis[5007];
vector<int> g[5007];
ll dfs(int u)
{
vis[u]=true;
cnt++;
ll sum=0;
for(auto v:g[u])
{
if(vis[v])continue;
sum+=dfs(v);
}
tmp+=sum+1;
return sum+1;
}
int main()
{
cin.tie(nullptr)->ios::sync_with_stdio(false);
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
int k;
cin>>k;
while(k--)
{
int a;
cin>>a;
g[a].emplace_back(i);
}
}
for(int i=1;i<=n;i++)
{
cnt=0,tmp=0;
memset(vis,false,sizeof(vis));
dfs(i);
if(cnt!=n)continue;
ans=min(ans,tmp);
}
cout<<ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |