# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
368051 | 2021-02-19T11:53:33 Z | urd05 | Bosses (BOI16_bosses) | C++14 | 748 ms | 748 KB |
#include <bits/stdc++.h> using namespace std; vector<int> adj[5000]; int dist[5000]; int main(void) { int n; scanf("%d",&n); for(int i=0;i<n;i++) { int k; scanf("%d",&k); for(int j=0;j<k;j++) { int x; scanf("%d",&x); x--; adj[x].push_back(i); } } int ret=1e9; for(int r=0;r<n;r++) { memset(dist,-1,sizeof(dist)); int sum=0; queue<int> q; dist[r]=0; q.push(r); while (!q.empty()) { int now=q.front(); q.pop(); for(int i=0;i<adj[now].size();i++) { int nt=adj[now][i]; if (dist[nt]==-1) { dist[nt]=dist[now]+1; q.push(nt); } } } for(int i=0;i<n;i++) { sum+=dist[i]; if (dist[i]==-1) { sum=1e9; } } ret=min(ret,sum); } printf("%d",n+ret); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 492 KB | Output is correct |
2 | Correct | 1 ms | 492 KB | Output is correct |
3 | Correct | 1 ms | 492 KB | Output is correct |
4 | Correct | 1 ms | 492 KB | Output is correct |
5 | Correct | 1 ms | 492 KB | Output is correct |
6 | Correct | 1 ms | 492 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 492 KB | Output is correct |
2 | Correct | 1 ms | 492 KB | Output is correct |
3 | Correct | 1 ms | 492 KB | Output is correct |
4 | Correct | 1 ms | 492 KB | Output is correct |
5 | Correct | 1 ms | 492 KB | Output is correct |
6 | Correct | 1 ms | 492 KB | Output is correct |
7 | Correct | 1 ms | 492 KB | Output is correct |
8 | Correct | 1 ms | 492 KB | Output is correct |
9 | Correct | 1 ms | 492 KB | Output is correct |
10 | Correct | 1 ms | 492 KB | Output is correct |
11 | Correct | 1 ms | 492 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 492 KB | Output is correct |
2 | Correct | 1 ms | 492 KB | Output is correct |
3 | Correct | 1 ms | 492 KB | Output is correct |
4 | Correct | 1 ms | 492 KB | Output is correct |
5 | Correct | 1 ms | 492 KB | Output is correct |
6 | Correct | 1 ms | 492 KB | Output is correct |
7 | Correct | 1 ms | 492 KB | Output is correct |
8 | Correct | 1 ms | 492 KB | Output is correct |
9 | Correct | 1 ms | 492 KB | Output is correct |
10 | Correct | 1 ms | 492 KB | Output is correct |
11 | Correct | 1 ms | 492 KB | Output is correct |
12 | Correct | 5 ms | 492 KB | Output is correct |
13 | Correct | 6 ms | 492 KB | Output is correct |
14 | Correct | 163 ms | 588 KB | Output is correct |
15 | Correct | 26 ms | 512 KB | Output is correct |
16 | Correct | 633 ms | 748 KB | Output is correct |
17 | Correct | 732 ms | 748 KB | Output is correct |
18 | Correct | 748 ms | 680 KB | Output is correct |