| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1335617 | hauserl | Bosses (BOI16_bosses) | C++20 | 1 ms | 344 KiB |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n; scanf("%d",&n);
vector<vector<int>> adj(n+1, vector<int>());
vector<int> boss(n+1, -1);
for (int i = 1; i <= n; i++) {
int k; scanf("%d", &k);
for (int j = 0; j < k; j++) {
int a; scanf("%d", &a);
adj[a].push_back(i);
}
}
ll minSum = INT_MAX;
for (int i = 1; i <= n; i++) {
deque<pair<int, int>> q;
vector<bool> vi(n+1, false);
q.push_front({i, 1});
ll sum = 0;
while(!q.empty()) {
auto c = q.back(); q.pop_back();
if (vi[c.first]) continue;
vi[c.first] = true;
sum += c.second;
for (const auto& v : adj[c.first]) {
q.push_front({v, c.second + 1});
}
}
if (sum < minSum) minSum = sum;
}
printf("%lld", minSum);
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... | ||||
