| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1282529 | lmquan | Bosses (BOI16_bosses) | C++20 | 466 ms | 736 KiB |
#define taskname ""
#include <bits/stdc++.h>
using namespace std;
const long long kInf = 5e18;
int main() {
if (fopen(taskname".inp", "r")) {
freopen(taskname".inp", "r", stdin);
freopen(taskname".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<vector<int>> g(n + 1);
for (int i = 1; i <= n; i++) {
int k;
cin >> k;
for (int j = 1; j <= k; j++) {
int p;
cin >> p;
g[p].push_back(i);
}
}
long long result = kInf;
for (int i = 1; i <= n; i++) {
vector<int> d(n + 1, -1);
queue<int> q;
q.push(i), d[i] = 1;
long long s = 1;
while (!q.empty()) {
int u = q.front();
q.pop();
for (int v : g[u]) {
if (d[v] == -1) {
d[v] = d[u] + 1, s += d[v];
q.push(v);
}
}
}
bool found = false;
for (int j = 1; j <= n; j++) {
if (d[j] == -1) {
found = true;
break;
}
}
if (!found) {
result = min(result, s);
}
}
cout << result;
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... | ||||
