# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
78755 |
2018-10-08T14:13:54 Z |
scanhex |
Bosses (BOI16_bosses) |
C++17 |
|
723 ms |
1388 KB |
#include <bits/stdc++.h>
using namespace std;
using nagai = long long;
using ll = long long;
const int N = 5000;
vector<int> g[N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; ++i)
{
int k;
cin >> k;
for (int j = 0; j < k; ++j)
{
int x;
cin >> x;
--x;
g[x].push_back(i);
}
}
int ans = 1e9;
for (int rt = 0; rt < n; ++rt)
{
vector<int> d(n, -1);
d[rt] = 1;
vector<int> q = {rt};
for (int i = 0; i < q.size(); ++i)
{
int x = q[i];
for (int y : g[x])
{
if (d[y] == -1)
d[y] = d[x] + 1, q.push_back(y);
}
}
if (count(d.begin(), d.end(), -1))
continue;
ans = min(ans, accumulate(d.begin(), d.end(), 0));
}
cout << ans << '\n';
return 0;
}
Compilation message
bosses.cpp: In function 'int main()':
bosses.cpp:34:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < q.size(); ++i)
~~^~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
504 KB |
Output is correct |
2 |
Correct |
2 ms |
640 KB |
Output is correct |
3 |
Correct |
2 ms |
640 KB |
Output is correct |
4 |
Correct |
2 ms |
640 KB |
Output is correct |
5 |
Correct |
2 ms |
640 KB |
Output is correct |
6 |
Correct |
2 ms |
804 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
504 KB |
Output is correct |
2 |
Correct |
2 ms |
640 KB |
Output is correct |
3 |
Correct |
2 ms |
640 KB |
Output is correct |
4 |
Correct |
2 ms |
640 KB |
Output is correct |
5 |
Correct |
2 ms |
640 KB |
Output is correct |
6 |
Correct |
2 ms |
804 KB |
Output is correct |
7 |
Correct |
2 ms |
804 KB |
Output is correct |
8 |
Correct |
2 ms |
804 KB |
Output is correct |
9 |
Correct |
2 ms |
804 KB |
Output is correct |
10 |
Correct |
2 ms |
804 KB |
Output is correct |
11 |
Correct |
2 ms |
804 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
504 KB |
Output is correct |
2 |
Correct |
2 ms |
640 KB |
Output is correct |
3 |
Correct |
2 ms |
640 KB |
Output is correct |
4 |
Correct |
2 ms |
640 KB |
Output is correct |
5 |
Correct |
2 ms |
640 KB |
Output is correct |
6 |
Correct |
2 ms |
804 KB |
Output is correct |
7 |
Correct |
2 ms |
804 KB |
Output is correct |
8 |
Correct |
2 ms |
804 KB |
Output is correct |
9 |
Correct |
2 ms |
804 KB |
Output is correct |
10 |
Correct |
2 ms |
804 KB |
Output is correct |
11 |
Correct |
2 ms |
804 KB |
Output is correct |
12 |
Correct |
6 ms |
872 KB |
Output is correct |
13 |
Correct |
5 ms |
920 KB |
Output is correct |
14 |
Correct |
146 ms |
1044 KB |
Output is correct |
15 |
Correct |
38 ms |
1044 KB |
Output is correct |
16 |
Correct |
645 ms |
1328 KB |
Output is correct |
17 |
Correct |
669 ms |
1388 KB |
Output is correct |
18 |
Correct |
723 ms |
1388 KB |
Output is correct |