# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
253829 | 2020-07-28T19:22:48 Z | ChrisT | Bosses (BOI16_bosses) | C++17 | 694 ms | 760 KB |
#include<bits/stdc++.h> using namespace std; vector<int> canChild[5005]; int dist[5005]; int main () { int n; scanf ("%d",&n); for (int i = 1; i <= n; i++) { int k; scanf ("%d",&k); while (k--) { int a; scanf ("%d",&a); canChild[a].push_back(i); } } int ret = INT_MAX; for (int rt = 1; rt <= n; rt++) { memset(dist,0x3f,sizeof dist); queue<int> q; q.push(rt); int sz = 0, ans = 0; dist[rt] = 1; while (!q.empty()) { int cur = q.front(); q.pop(); ++sz; ans += dist[cur]; for (int i : canChild[cur]) if (dist[cur] + 1 < dist[i]) { dist[i] = dist[cur] + 1; q.push(i); } } if (sz == n) ret = min(ret,ans); } printf ("%d\n",ret); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 512 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 512 KB | Output is correct |
5 | Correct | 1 ms | 512 KB | Output is correct |
6 | Correct | 0 ms | 512 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 512 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 512 KB | Output is correct |
5 | Correct | 1 ms | 512 KB | Output is correct |
6 | Correct | 0 ms | 512 KB | Output is correct |
7 | Correct | 1 ms | 384 KB | Output is correct |
8 | Correct | 1 ms | 512 KB | Output is correct |
9 | Correct | 0 ms | 512 KB | Output is correct |
10 | Correct | 1 ms | 512 KB | Output is correct |
11 | Correct | 1 ms | 512 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 512 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 512 KB | Output is correct |
5 | Correct | 1 ms | 512 KB | Output is correct |
6 | Correct | 0 ms | 512 KB | Output is correct |
7 | Correct | 1 ms | 384 KB | Output is correct |
8 | Correct | 1 ms | 512 KB | Output is correct |
9 | Correct | 0 ms | 512 KB | Output is correct |
10 | Correct | 1 ms | 512 KB | Output is correct |
11 | Correct | 1 ms | 512 KB | Output is correct |
12 | Correct | 6 ms | 512 KB | Output is correct |
13 | Correct | 5 ms | 640 KB | Output is correct |
14 | Correct | 125 ms | 632 KB | Output is correct |
15 | Correct | 7 ms | 512 KB | Output is correct |
16 | Correct | 542 ms | 760 KB | Output is correct |
17 | Correct | 686 ms | 760 KB | Output is correct |
18 | Correct | 694 ms | 760 KB | Output is correct |