#include <bits/stdc++.h>
using namespace std;
#define pb push_back
int n,x,u,v,ans=1e9;
vector <int> edge[5007];
int vis[5007];
void go(int root){
queue <int> q;
q.push(root);
vis[root]=1;
int ret=0, cnt=0;
while(!q.empty()){
int u=q.front();
cnt++;
q.pop();
ret+=vis[u];
for(int v:edge[u]){
if(!vis[v]){
vis[v]=vis[u]+1;
q.push(v);
}
}
}
if(cnt==n) ans=min(ans,ret);
}
int main(){
ios_base::sync_with_stdio(0);
cin>>n;
for(int i=1;i<=n;i++){
cin>>x;
while(x>0){
x--;
cin>>v;
edge[v].pb(i);
}
}
for(int i=1;i<=n;i++){
memset(vis,0,sizeof(vis));
go(i);
}
cout<<ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
2 ms |
636 KB |
Output is correct |
3 |
Correct |
2 ms |
636 KB |
Output is correct |
4 |
Correct |
2 ms |
636 KB |
Output is correct |
5 |
Correct |
2 ms |
636 KB |
Output is correct |
6 |
Correct |
2 ms |
636 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
2 ms |
636 KB |
Output is correct |
3 |
Correct |
2 ms |
636 KB |
Output is correct |
4 |
Correct |
2 ms |
636 KB |
Output is correct |
5 |
Correct |
2 ms |
636 KB |
Output is correct |
6 |
Correct |
2 ms |
636 KB |
Output is correct |
7 |
Correct |
2 ms |
636 KB |
Output is correct |
8 |
Correct |
2 ms |
636 KB |
Output is correct |
9 |
Correct |
2 ms |
636 KB |
Output is correct |
10 |
Correct |
3 ms |
636 KB |
Output is correct |
11 |
Correct |
2 ms |
704 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
2 ms |
636 KB |
Output is correct |
3 |
Correct |
2 ms |
636 KB |
Output is correct |
4 |
Correct |
2 ms |
636 KB |
Output is correct |
5 |
Correct |
2 ms |
636 KB |
Output is correct |
6 |
Correct |
2 ms |
636 KB |
Output is correct |
7 |
Correct |
2 ms |
636 KB |
Output is correct |
8 |
Correct |
2 ms |
636 KB |
Output is correct |
9 |
Correct |
2 ms |
636 KB |
Output is correct |
10 |
Correct |
3 ms |
636 KB |
Output is correct |
11 |
Correct |
2 ms |
704 KB |
Output is correct |
12 |
Correct |
6 ms |
704 KB |
Output is correct |
13 |
Correct |
5 ms |
704 KB |
Output is correct |
14 |
Correct |
120 ms |
704 KB |
Output is correct |
15 |
Correct |
7 ms |
888 KB |
Output is correct |
16 |
Correct |
615 ms |
888 KB |
Output is correct |
17 |
Correct |
619 ms |
888 KB |
Output is correct |
18 |
Correct |
590 ms |
948 KB |
Output is correct |