# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
74895 | 2018-09-07T11:31:24 Z | Vardanyan | Bosses (BOI16_bosses) | C++14 | 2 ms | 544 KB |
//#pragma GCC optimize "-O3" #include <bits/stdc++.h> using namespace std; const int N = 5001; bool c[N]; int n; int ans = 1000*1000*1000+7; int g[N][N]; int f[N][N]; int main(){ scanf("%d",&n); for(int i = 1;i<=n;i++) for(int j = 1;j<=n;j++) f[i][j] = ans; for(int i = 1;i<=n;i++){ f[i][i] = 0; int ki; scanf("%d",&ki); for(int j = 1;j<=ki;j++){ int x; scanf("%d",&x); f[x][i] = 1; } } for(int i = 1;i<=n;i++){ for(int j = 1;j<=n;j++){ for(int k = 1;k<=n;k++){ f[j][k] = min(f[j][k],f[j][i]+f[i][k]); } } } for(int i = 1;i<=n;i++){ int val = 0; for(int j = 1;j<=n;j++) val+=(f[i][j]+1); ans = min(ans,val); } printf("%d\n",ans); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 544 KB | Output is correct |
4 | Incorrect | 2 ms | 544 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 544 KB | Output is correct |
4 | Incorrect | 2 ms | 544 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 544 KB | Output is correct |
4 | Incorrect | 2 ms | 544 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |