#include <iostream>
#include <vector>
#include <queue>
using namespace std;
long long bfs(int a,vector<vector<int>>& g){
int n=g.size();
vector<int> dist(n,1e9);
dist[a]=0;
queue<int> q;
q.push(a);
while(!q.empty()){
int u=q.front();
q.pop();
for(int v:g[u]){
if(dist[v]>dist[u]+1){
dist[v]=dist[u]+1;
q.push(v);
}
}
}
vector<int> cnt(n);
for(int i=0;i<n;i++){
if(dist[i]==1e9)return 1e18;
cnt[dist[i]]++;
}
long long ans=0;
for(int i=n-1;i>0;i--){
ans+=cnt[i];
cnt[i-1]+=cnt[i];
}
return ans+cnt[0];
}
int main(){
int n,m,x;
cin>>n;
vector<vector<int>> g(n,vector<int>());
for(int i=0;i<n;i++){
cin>>m;
while(m--){
cin>>x;
g[x-1].push_back(i);
}
}
long long ans=1e18;
for(int i=0;i<n;i++)ans=min(ans,bfs(i,g));
cout<<ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
5 ms |
340 KB |
Output is correct |
13 |
Correct |
5 ms |
316 KB |
Output is correct |
14 |
Correct |
122 ms |
548 KB |
Output is correct |
15 |
Correct |
19 ms |
468 KB |
Output is correct |
16 |
Correct |
485 ms |
572 KB |
Output is correct |
17 |
Correct |
703 ms |
660 KB |
Output is correct |
18 |
Correct |
695 ms |
720 KB |
Output is correct |