# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
74897 | Vardanyan | Bosses (BOI16_bosses) | C++14 | 1575 ms | 196404 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.
//#pragma GCC optimize "-O3"
#include <bits/stdc++.h>
using namespace std;
const long long N = 5001;
bool c[N];
int n;
long long ans = 10000000000000000+7;
long long g[N][N];
long long f[N][N];
int main(){
scanf("%d",&n);
for(long long i = 1;i<=n;i++)
for(long long j = 1;j<=n;j++) f[i][j] = ans;
for(long long i = 1;i<=n;i++){
f[i][i] = 0;
long long ki;
scanf("%lld",&ki);
for(long long j = 1;j<=ki;j++){
long long x;
scanf("%lld",&x);
f[x][i] = 1;
}
}
for(long long i = 1;i<=n;i++){
for(long long j = 1;j<=n;j++){
for(long long k = 1;k<=n;k++){
f[j][k] = min(f[j][k],f[j][i]+f[i][k]);
}
}
}
for(long long i = 1;i<=n;i++){
long long val = 0;
for(long long j = 1;j<=n;j++) val+=(f[i][j]+1);
ans = min(ans,val);
}
printf("%lld\n",ans);
return 0;
}
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... |