# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
717873 | 2023-04-02T17:28:20 Z | blackslex | Bosses (BOI16_bosses) | C++17 | 743 ms | 636 KB |
#include<bits/stdc++.h> using namespace std; const int N = 5005; int n, m, x, ans = INT_MAX; vector<int> v[N]; int main() { scanf("%d", &n); for (int i = 1; i <= n; i++) { scanf("%d", &m); while (m--) scanf("%d", &x), v[x].emplace_back(i); } for (int i = 1; i <= n; i++) { int d[N] = {}, res = 0; queue<int> q; bool f = 0; d[i] = 1, q.emplace(i); while (!q.empty()) { int cur = q.front(); q.pop(); for (auto &e: v[cur]) if (!d[e]) d[e] = d[cur] + 1, q.emplace(e); } for (int j = 1; j <= n; j++) res += d[j], f = (!d[j] ? 1 : f); if (!f) ans = min(ans, res); } printf("%d", ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
7 | Correct | 1 ms | 432 KB | Output is correct |
8 | Correct | 1 ms | 436 KB | Output is correct |
9 | Correct | 1 ms | 340 KB | Output is correct |
10 | Correct | 2 ms | 340 KB | Output is correct |
11 | Correct | 2 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
7 | Correct | 1 ms | 432 KB | Output is correct |
8 | Correct | 1 ms | 436 KB | Output is correct |
9 | Correct | 1 ms | 340 KB | Output is correct |
10 | Correct | 2 ms | 340 KB | Output is correct |
11 | Correct | 2 ms | 340 KB | Output is correct |
12 | Correct | 5 ms | 468 KB | Output is correct |
13 | Correct | 4 ms | 452 KB | Output is correct |
14 | Correct | 174 ms | 532 KB | Output is correct |
15 | Correct | 23 ms | 480 KB | Output is correct |
16 | Correct | 653 ms | 612 KB | Output is correct |
17 | Correct | 743 ms | 636 KB | Output is correct |
18 | Correct | 728 ms | 636 KB | Output is correct |