# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
724307 | 2023-04-15T04:34:27 Z | thinknoexit | Bosses (BOI16_bosses) | C++17 | 682 ms | 716 KB |
#include <bits/stdc++.h> using namespace std; using ll = long long; vector<int> adj[5050]; int dis[5050], vis[5050]; int main() { cin.tie(nullptr)->sync_with_stdio(false); int n; cin >> n; for (int i = 1;i <= n;i++) { int k; cin >> k; for (int j = 1;j <= k;j++) { int p; cin >> p; adj[p].push_back(i); } } queue<int> q; int mx, mn = 2e9, cnt; for (int i = 1;i <= n;i++) { vis[i] = i; dis[i] = 1; q.push(i); mx = 0, cnt = 0; int now = 0; while (!q.empty()) { int v = q.front(); q.pop(); now += dis[v]; cnt++; for (auto& x : adj[v]) { if (vis[x] == i) continue; dis[x] = dis[v] + 1; vis[x] = i; q.push(x); } } if (cnt != n) { continue; } mn = min(mn, now); } cout << mn; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 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 | 1 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 | 340 KB | Output is correct |
8 | Correct | 1 ms | 468 KB | Output is correct |
9 | Correct | 1 ms | 340 KB | Output is correct |
10 | Correct | 1 ms | 340 KB | Output is correct |
11 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 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 | 340 KB | Output is correct |
8 | Correct | 1 ms | 468 KB | Output is correct |
9 | Correct | 1 ms | 340 KB | Output is correct |
10 | Correct | 1 ms | 340 KB | Output is correct |
11 | Correct | 1 ms | 340 KB | Output is correct |
12 | Correct | 4 ms | 468 KB | Output is correct |
13 | Correct | 3 ms | 468 KB | Output is correct |
14 | Correct | 126 ms | 572 KB | Output is correct |
15 | Correct | 2 ms | 596 KB | Output is correct |
16 | Correct | 490 ms | 656 KB | Output is correct |
17 | Correct | 682 ms | 716 KB | Output is correct |
18 | Correct | 682 ms | 716 KB | Output is correct |