#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int N = 5000;
int n;
vector<int> g[N+1];
int sum = 0;
void dfs(int v, int par, vector< vector<int> > &adj, vector<int> &sub){
sub[v] = 1;
for(int to : adj[v]){
if(to == par) continue;
dfs(to, v, adj, sub);
sub[v]+= sub[to];
}
sum+= sub[v];
}
int f(int root){
queue<int> q; q.push(root);
vector<int> dis(n+1, -1);
vector< vector<int> > adj(n+1);
dis[root] = 0;
while(!q.empty()){
int v =q.front(); q.pop();
for(int to : g[v]){
if(dis[to] == -1){
q.push(to);
adj[v].push_back(to);
dis[to] = dis[v] + 1;
}
}
}
for(int i = 1;i <= n; i++){
if(dis[i] == -1){
return LLONG_MAX;
}
}
sum = 0;
dfs(root, root, adj, dis);
return sum;
}
main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
for(int i = 1;i <= n; i++){
int sz; cin >> sz;
for(int j = 0;j < sz; j++){
int x; cin >> x;
g[x].push_back(i);
}
}
int ans = LLONG_MAX;
for(int i = 1;i <= n; i++){
ans = min(ans, f(i));
}
cout << ans;
return 0;
}
Compilation message
bosses.cpp:50:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
50 | main(){
| ^~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
4 ms |
600 KB |
Output is correct |
13 |
Correct |
3 ms |
600 KB |
Output is correct |
14 |
Correct |
405 ms |
1160 KB |
Output is correct |
15 |
Correct |
45 ms |
844 KB |
Output is correct |
16 |
Correct |
1161 ms |
1080 KB |
Output is correct |
17 |
Execution timed out |
1551 ms |
1104 KB |
Time limit exceeded |
18 |
Halted |
0 ms |
0 KB |
- |