# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
453676 |
2021-08-04T14:24:28 Z |
Hamed5001 |
Bosses (BOI16_bosses) |
C++14 |
|
863 ms |
660 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mxN = 5e3+10;
vector<int> edges[mxN];
int N;
int bfs(int st) {
queue<pair<int, int>> q;
vector<int> VIS(N+1, 0);
q.push({1, st});
int ret = 0;
while(q.size()) {
auto node = q.front();
q.pop();
if (VIS[node.second])
continue;
VIS[node.second] = 1;
ret += node.first;
for (auto c : edges[node.second]) {
if (!VIS[c])
q.push({node.first+1, c});
}
}
for (int i = 1; i <= N; i++) {
if (!VIS[i]) {
ret = INT_MAX;
break;
}
}
return ret;
}
void solve() {
cin >> N;
for (int i = 1; i <= N; i++) {
int K;
cin >> K;
for (int j = 0; j < K; j++) {
int boss;
cin >> boss;
edges[boss].push_back(i);
}
}
int ans = INT_MAX;
for (int i = 1; i <= N; i++)
ans = min(ans, bfs(i));
if (ans == INT_MAX)
ans = -1;
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
428 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
428 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
428 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
1 ms |
332 KB |
Output is correct |
12 |
Correct |
20 ms |
460 KB |
Output is correct |
13 |
Correct |
15 ms |
588 KB |
Output is correct |
14 |
Correct |
163 ms |
544 KB |
Output is correct |
15 |
Correct |
9 ms |
460 KB |
Output is correct |
16 |
Correct |
616 ms |
636 KB |
Output is correct |
17 |
Correct |
863 ms |
660 KB |
Output is correct |
18 |
Correct |
846 ms |
656 KB |
Output is correct |