| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 857762 |
2023-10-06T21:54:26 Z |
qrno |
Bosses (BOI16_bosses) |
C++17 |
|
400 ms |
748 KB |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e3;
int N;
array<vector<int>, MAXN> G;
array<int, MAXN> val, last;
int bfs(int src) {
fill(begin(val), end(val), -1);
queue<int> Q;
val[src] = 1;
last[src] = src;
Q.push(src);
int done = 0;
int total = 0;
while (!Q.empty()) {
auto v = Q.front(); Q.pop();
total += val[v];
done++;
for (auto u : G[v]) {
if (last[u] != src) {
val[u] = val[v]+1;
last[u] = src;
Q.push(u);
}
}
}
if (done < N) return -1;
return total;
}
signed main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
cin >> N;
for (int i = 0; i < N; i++) {
int K; cin >> K;
while (K--) {
int u; cin >> u; u--;
G[u].push_back(i);
}
}
int best = -1;
for (int i = 0; i < N; i++) {
int sum = bfs(i);
if (sum == -1) continue;
if (best == -1 || best > sum)
best = sum;
}
cout << best << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
344 KB |
Output is correct |
| 12 |
Correct |
5 ms |
604 KB |
Output is correct |
| 13 |
Correct |
2 ms |
604 KB |
Output is correct |
| 14 |
Correct |
79 ms |
580 KB |
Output is correct |
| 15 |
Correct |
3 ms |
600 KB |
Output is correct |
| 16 |
Correct |
400 ms |
600 KB |
Output is correct |
| 17 |
Correct |
390 ms |
748 KB |
Output is correct |
| 18 |
Correct |
385 ms |
744 KB |
Output is correct |
