| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 969986 |
2024-04-26T03:13:55 Z |
vjudge1 |
Bosses (BOI16_bosses) |
C++17 |
|
483 ms |
856 KB |
/*
* With a little appreciation, in a mostly hollow tone, she says, "Delightful." As if the world has any meaning.
* TASK : Bossa Nova
* AUTHOR : Marszpace
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n;
cin >> n;
vector<vector<int>> adj(n+1,vector<int>());
for(int i=1;i<=n;i++){
int k;
cin >> k;
for(int j=0;j<k;j++){
int v;
cin >> v;
adj[v].push_back(i);
}
}
int res=LLONG_MAX;
queue<pair<int,int>> bfs;
for(int root=1;root<=n;root++){
bool visited[5001]={};
int cnt=0; int thisres=0;
visited[root]=true;
bfs.push({root,1});
while(!bfs.empty()){
auto [u,c]=bfs.front();bfs.pop();
cnt++;
thisres+=c;
for(auto &v:adj[u]){
if(!visited[v]){
visited[v]=true;
bfs.push({v,c+1});
}
}
}
if(cnt==n){res=min(res,thisres);}
}
cout << res;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
3 ms |
348 KB |
Output is correct |
| 13 |
Correct |
2 ms |
604 KB |
Output is correct |
| 14 |
Correct |
108 ms |
640 KB |
Output is correct |
| 15 |
Correct |
3 ms |
856 KB |
Output is correct |
| 16 |
Correct |
470 ms |
740 KB |
Output is correct |
| 17 |
Correct |
477 ms |
604 KB |
Output is correct |
| 18 |
Correct |
483 ms |
776 KB |
Output is correct |
