# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
171166 |
2019-12-27T15:54:23 Z |
WLZ |
Bosses (BOI16_bosses) |
C++14 |
|
1057 ms |
924 KB |
#include <bits/stdc++.h>
using namespace std;
const long long INF = (long long) 1e18;
int n;
vector< vector<int> > g;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
g.resize(n + 1);
for (int i = 1; i <= n; i++) {
int k;
cin >> k;
while (k--) {
int p;
cin >> p;
g[p].push_back(i);
}
}
long long ans = INF;
for (int i = 1; i <= n; i++) {
vector<int> dist(n + 1, -1);
dist[i] = 1;
queue<int> q;
q.push(i);
while (!q.empty()) {
int u = q.front();
q.pop();
for (auto& v : g[u]) {
if (dist[v] == -1) {
dist[v] = dist[u] + 1;
q.push(v);
}
}
}
int pos = 1;
long long tmp = 0;
for (int j = 1; j <= n; j++) {
if (dist[j] == -1) {
pos = 0;
break;
}
tmp += (long long) dist[j];
}
if (pos) {
ans = min(ans, tmp);
}
}
cout << ans << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
3 ms |
376 KB |
Output is correct |
3 |
Correct |
3 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
380 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
3 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
3 ms |
376 KB |
Output is correct |
3 |
Correct |
3 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
380 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
3 ms |
376 KB |
Output is correct |
7 |
Correct |
3 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
1 ms |
376 KB |
Output is correct |
10 |
Correct |
3 ms |
248 KB |
Output is correct |
11 |
Correct |
3 ms |
504 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
3 ms |
376 KB |
Output is correct |
3 |
Correct |
3 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
380 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
3 ms |
376 KB |
Output is correct |
7 |
Correct |
3 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
1 ms |
376 KB |
Output is correct |
10 |
Correct |
3 ms |
248 KB |
Output is correct |
11 |
Correct |
3 ms |
504 KB |
Output is correct |
12 |
Correct |
5 ms |
380 KB |
Output is correct |
13 |
Correct |
6 ms |
504 KB |
Output is correct |
14 |
Correct |
171 ms |
636 KB |
Output is correct |
15 |
Correct |
17 ms |
760 KB |
Output is correct |
16 |
Correct |
738 ms |
760 KB |
Output is correct |
17 |
Correct |
1057 ms |
924 KB |
Output is correct |
18 |
Correct |
1012 ms |
760 KB |
Output is correct |