#include<bits/stdc++.h>
using namespace std;
const int N=5005;
int n,d[N];
vector<int>adj[N];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin>>n;
for(int i=1;i<=n;i++)
{
int m;
cin>>m;
while(m--)
{
int p;
cin>>p;
adj[p].push_back(i);
}
}
long long res=1e18;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++) d[j]=-1;
queue<int>pq;
d[i]=1;
pq.push(i);
while(!pq.empty())
{
int u=pq.front();
pq.pop();
for(auto&v:adj[u])
{
if(d[v]==-1)
{
d[v]=d[u]+1;
pq.push(v);
}
}
}
bool check=true;
for(int j=1;j<=n;j++) if(d[j]==-1) check=false;
if(check)
{
long long cur=0;
for(int j=1;j<=n;j++) cur+=d[j];
res=min(res,cur);
}
}
cout<<res;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
512 KB |
Output is correct |
4 |
Correct |
1 ms |
512 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
1 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
512 KB |
Output is correct |
4 |
Correct |
1 ms |
512 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
1 ms |
512 KB |
Output is correct |
7 |
Correct |
1 ms |
512 KB |
Output is correct |
8 |
Correct |
1 ms |
512 KB |
Output is correct |
9 |
Correct |
1 ms |
512 KB |
Output is correct |
10 |
Correct |
1 ms |
512 KB |
Output is correct |
11 |
Correct |
1 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
512 KB |
Output is correct |
4 |
Correct |
1 ms |
512 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
1 ms |
512 KB |
Output is correct |
7 |
Correct |
1 ms |
512 KB |
Output is correct |
8 |
Correct |
1 ms |
512 KB |
Output is correct |
9 |
Correct |
1 ms |
512 KB |
Output is correct |
10 |
Correct |
1 ms |
512 KB |
Output is correct |
11 |
Correct |
1 ms |
512 KB |
Output is correct |
12 |
Correct |
4 ms |
512 KB |
Output is correct |
13 |
Correct |
4 ms |
640 KB |
Output is correct |
14 |
Correct |
175 ms |
632 KB |
Output is correct |
15 |
Correct |
44 ms |
632 KB |
Output is correct |
16 |
Correct |
612 ms |
640 KB |
Output is correct |
17 |
Correct |
775 ms |
760 KB |
Output is correct |
18 |
Correct |
784 ms |
760 KB |
Output is correct |