| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 595811 |
2022-07-14T07:12:10 Z |
Belphegor |
Bosses (BOI16_bosses) |
C++14 |
|
648 ms |
656 KB |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
vector<int>tree[5005];
int depth[5005];
int f(int root){
memset(depth,0,sizeof(depth));
depth[root] = 1;
queue<int>q; q.push(root);
int ret = 0;
while(!q.empty()){
int cur = q.front(); q.pop();
ret+=depth[cur];
for(int nxt:tree[cur]){
if(depth[nxt]) continue;
depth[nxt] = depth[cur]+1;
q.push(nxt);
}
}
for(int i=1; i<=n; i++) if(!depth[i]) return INT32_MAX;
return ret;
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
cin>>n;
for(int i=1; i<=n; i++){
int k; cin>>k;
for(int j=0; j<k; j++){
int x; cin>>x;
tree[x].emplace_back(i);
}
}
int ans = INT32_MAX;
for(int i=1; i<=n; i++) ans = min(ans,f(i));
cout<<ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
432 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
436 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
432 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
436 KB |
Output is correct |
| 7 |
Correct |
1 ms |
340 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
436 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
432 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
436 KB |
Output is correct |
| 7 |
Correct |
1 ms |
340 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
436 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| 12 |
Correct |
4 ms |
496 KB |
Output is correct |
| 13 |
Correct |
3 ms |
468 KB |
Output is correct |
| 14 |
Correct |
110 ms |
552 KB |
Output is correct |
| 15 |
Correct |
5 ms |
468 KB |
Output is correct |
| 16 |
Correct |
486 ms |
596 KB |
Output is correct |
| 17 |
Correct |
648 ms |
652 KB |
Output is correct |
| 18 |
Correct |
603 ms |
656 KB |
Output is correct |
