| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 857781 |
2023-10-06T22:30:48 Z |
qrno |
Bosses (BOI16_bosses) |
C++17 |
|
365 ms |
856 KB |
#include <iostream>
#include <vector>
#include <array>
#include <bitset>
using namespace std;
constexpr int INF = 1e9;
constexpr int MAXN = 5e3;
int best = INF;
int N;
array<vector<short>, MAXN> G;
array<short, MAXN> val, q;
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);
}
}
for (int i = 0; i < N; i++) {
int l = 0, r = -1;
bitset<MAXN> vis;
q[++r] = i;
val[i] = 1;
vis[i] = true;
int done = 0, sum = 0;
while (l <= r) {
auto v = q[l++];
sum += val[v];
done++;
for (auto u : G[v]) {
if (vis[u]) continue;
q[++r] = u;
val[u] = val[v]+1;
vis[u] = true;
}
}
best = (done < N) ? best : min(best, sum);
}
cout << best << '\n';
}
| # |
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 |
1 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 |
1 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 |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 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 |
1 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 |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
3 ms |
604 KB |
Output is correct |
| 13 |
Correct |
2 ms |
604 KB |
Output is correct |
| 14 |
Correct |
58 ms |
856 KB |
Output is correct |
| 15 |
Correct |
2 ms |
604 KB |
Output is correct |
| 16 |
Correct |
365 ms |
692 KB |
Output is correct |
| 17 |
Correct |
344 ms |
600 KB |
Output is correct |
| 18 |
Correct |
341 ms |
604 KB |
Output is correct |
