# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
197120 | dantoh000 | Bosses (BOI16_bosses) | C++14 | 2 ms | 632 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
vector<int> adjlist[5005];
int d[5005];
void dfs(int u){
for (auto v : adjlist[u]){
if (d[v] == -1){
d[v] = d[u]+1;
dfs(v);
}
}
}
int main(){
int n;
scanf("%d",&n);
for (int i = 1; i <= n; i++){
int k;
scanf("%d",&k);
while (k--){
int x;
scanf("%d",&x);
adjlist[x].push_back(i);
}
}
int ans = 1000000000;
for (int i = 1; i <= n; i++){
memset(d,-1,sizeof(d));
d[i] = 1;
dfs(i);
int sum = 0;
for (int i = 1; i <= n; i++){
sum += d[i];
}
ans = min(ans,sum);
}
printf("%d",ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |