#include "bits/stdc++.h"
using namespace std;
#define ar array
const int N = 5005;
vector<int> edges[N];
signed main(){
ios::sync_with_stdio(0); cin.tie(0);
int n; cin>>n;
vector<int> k(n+1);
for(int i=1;i<=n;i++){
cin>>k[i];
for(int j=0;j<k[i];j++){
int x; cin>>x;
edges[x].push_back(i);
}
}
int res = n * n;
for(int i=1;i<=n;i++){
vector<int> d(n+1, n);
queue<int> q; q.push(i);
d[i] = 0;
while(!q.empty()){
int i=q.front(); q.pop();
for(auto x : edges[i]){
if(d[x] > d[i] + 1){
d[x] = d[i] + 1;
q.push(x);
}
}
}
bool ok = 1;
int rr = n;
for(int j=1;j<=n;j++){
if(d[j] == n) ok = 0;
rr += d[j];
}
if(ok) res = min(res, rr);
}
cout<<res<<"\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
5 ms |
468 KB |
Output is correct |
13 |
Correct |
5 ms |
468 KB |
Output is correct |
14 |
Correct |
145 ms |
468 KB |
Output is correct |
15 |
Correct |
29 ms |
564 KB |
Output is correct |
16 |
Correct |
536 ms |
604 KB |
Output is correct |
17 |
Correct |
666 ms |
628 KB |
Output is correct |
18 |
Correct |
670 ms |
620 KB |
Output is correct |