# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
857779 |
2023-10-06T22:27:58 Z |
qrno |
Bosses (BOI16_bosses) |
C++17 |
|
352 ms |
48368 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<short, MAXN> dout;
array<array<short, MAXN>, 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][dout[u]++] = 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 (int j = 0; j < dout[v]; j++) {
int u = G[v][j];
if (!vis[u]) {
q[++r] = u;
val[u] = val[v]+1;
vis[u] = true;
}
}
}
if (done < N) continue;
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 |
1 ms |
344 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 |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
2396 KB |
Output is correct |
8 |
Correct |
1 ms |
2396 KB |
Output is correct |
9 |
Correct |
0 ms |
2396 KB |
Output is correct |
10 |
Correct |
1 ms |
2396 KB |
Output is correct |
11 |
Correct |
1 ms |
2392 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 |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
2396 KB |
Output is correct |
8 |
Correct |
1 ms |
2396 KB |
Output is correct |
9 |
Correct |
0 ms |
2396 KB |
Output is correct |
10 |
Correct |
1 ms |
2396 KB |
Output is correct |
11 |
Correct |
1 ms |
2392 KB |
Output is correct |
12 |
Correct |
3 ms |
2392 KB |
Output is correct |
13 |
Correct |
3 ms |
2396 KB |
Output is correct |
14 |
Correct |
51 ms |
47964 KB |
Output is correct |
15 |
Correct |
6 ms |
47964 KB |
Output is correct |
16 |
Correct |
352 ms |
48244 KB |
Output is correct |
17 |
Correct |
348 ms |
48368 KB |
Output is correct |
18 |
Correct |
337 ms |
48216 KB |
Output is correct |