| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 258664 |
2020-08-06T10:50:50 Z |
vioalbert |
Bosses (BOI16_bosses) |
C++14 |
|
735 ms |
760 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5e3+5, INF = 1e9;
int n;
vector<int> adj[N];
void read() {
cin >> n;
for(int i = 1; i <= n; i++) {
int c; cin >> c;
for(int j = 0; j < c; j++) {
int v; cin >> v;
adj[v].push_back(i);
}
}
}
int bfs(int st) {
int cur = 0;
bool vis[n+1] = {0};
queue<pair<int, int>> q;
q.push({st, 1});
// cerr << "---" << st << '\n';
while(!q.empty()) {
int u = q.front().first, h = q.front().second; q.pop();
if(!vis[u]) {
// cerr << u << ' ' << h << '\n';
vis[u] = 1;
cur += h;
for(int v : adj[u]) if(!vis[v]) {
q.push({v, h+1});
}
}
}
for(int i = 1; i <= n; i++) if(!vis[i]) {
return INF;
}
return cur;
}
void solve() {
int ans = INF;
for(int i = 1; i <= n; i++) {
ans = min(ans, bfs(i));
}
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
read();
solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
1 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
1 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
0 ms |
512 KB |
Output is correct |
| 8 |
Correct |
1 ms |
512 KB |
Output is correct |
| 9 |
Correct |
1 ms |
512 KB |
Output is correct |
| 10 |
Correct |
1 ms |
512 KB |
Output is correct |
| 11 |
Correct |
1 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
1 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
0 ms |
512 KB |
Output is correct |
| 8 |
Correct |
1 ms |
512 KB |
Output is correct |
| 9 |
Correct |
1 ms |
512 KB |
Output is correct |
| 10 |
Correct |
1 ms |
512 KB |
Output is correct |
| 11 |
Correct |
1 ms |
384 KB |
Output is correct |
| 12 |
Correct |
19 ms |
640 KB |
Output is correct |
| 13 |
Correct |
15 ms |
640 KB |
Output is correct |
| 14 |
Correct |
158 ms |
612 KB |
Output is correct |
| 15 |
Correct |
13 ms |
512 KB |
Output is correct |
| 16 |
Correct |
600 ms |
760 KB |
Output is correct |
| 17 |
Correct |
735 ms |
640 KB |
Output is correct |
| 18 |
Correct |
705 ms |
640 KB |
Output is correct |
