#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define OYY 1000000000005
#define mod 1000000007
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mid (start+end)/2
#define lim 100005
vector<int> v[lim];
int dis[lim],n,vis[lim];
inline int bfs(int node){
for (int i=1;i<=n;i++){
dis[i]=OYY;
vis[i]=0;
}
priority_queue <pair<int,int>> pq;
pq.push({1,node});
dis[node]=1;
vis[node]=1;
//cout<<node<<" "<<dis[node]<<endl;
while(!pq.empty()){
int nd=pq.top().second;
pq.pop();
// cout<<pq.top().first<<" "<<pq.top().second<<" "<<dis[nd]<<endl;
for(int i=0;i<v[nd].size();i++){
if(vis[v[nd][i]])continue;
dis[v[nd][i]]=min(dis[v[nd][i]],dis[nd]+1);
vis[v[nd][i]]=1;
pq.push({-dis[v[nd][i]],v[nd][i]});
}
}
int cev=0;
for(int i=1;i<=n;i++){
cev+=dis[i];
}
// cout<<cev<<endl;
return cev;
}
int32_t main(){
faster
cin>>n;
for(int i=1;i<=n;i++){
int deg,tut;cin>>deg;
for(int j=0;j<deg;j++){
cin>>tut;
v[tut].push_back(i);
}
}
int cev=OYY;
for(int i=1;i<=n;i++){
cev=min(cev,bfs(i));
}
cout<<cev<<'\n';
return 0;
}
Compilation message
bosses.cpp: In function 'long long int bfs(long long int)':
bosses.cpp:28:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
28 | for(int i=0;i<v[nd].size();i++){
| ~^~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
4184 KB |
Output is correct |
2 |
Correct |
2 ms |
4188 KB |
Output is correct |
3 |
Correct |
2 ms |
4188 KB |
Output is correct |
4 |
Correct |
1 ms |
4188 KB |
Output is correct |
5 |
Correct |
2 ms |
4440 KB |
Output is correct |
6 |
Correct |
2 ms |
4188 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
4184 KB |
Output is correct |
2 |
Correct |
2 ms |
4188 KB |
Output is correct |
3 |
Correct |
2 ms |
4188 KB |
Output is correct |
4 |
Correct |
1 ms |
4188 KB |
Output is correct |
5 |
Correct |
2 ms |
4440 KB |
Output is correct |
6 |
Correct |
2 ms |
4188 KB |
Output is correct |
7 |
Correct |
1 ms |
4188 KB |
Output is correct |
8 |
Correct |
2 ms |
4188 KB |
Output is correct |
9 |
Correct |
1 ms |
3960 KB |
Output is correct |
10 |
Correct |
2 ms |
4188 KB |
Output is correct |
11 |
Correct |
2 ms |
4188 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
4184 KB |
Output is correct |
2 |
Correct |
2 ms |
4188 KB |
Output is correct |
3 |
Correct |
2 ms |
4188 KB |
Output is correct |
4 |
Correct |
1 ms |
4188 KB |
Output is correct |
5 |
Correct |
2 ms |
4440 KB |
Output is correct |
6 |
Correct |
2 ms |
4188 KB |
Output is correct |
7 |
Correct |
1 ms |
4188 KB |
Output is correct |
8 |
Correct |
2 ms |
4188 KB |
Output is correct |
9 |
Correct |
1 ms |
3960 KB |
Output is correct |
10 |
Correct |
2 ms |
4188 KB |
Output is correct |
11 |
Correct |
2 ms |
4188 KB |
Output is correct |
12 |
Correct |
6 ms |
4336 KB |
Output is correct |
13 |
Correct |
5 ms |
4188 KB |
Output is correct |
14 |
Correct |
202 ms |
4304 KB |
Output is correct |
15 |
Correct |
17 ms |
4188 KB |
Output is correct |
16 |
Correct |
1479 ms |
4688 KB |
Output is correct |
17 |
Execution timed out |
1555 ms |
4444 KB |
Time limit exceeded |
18 |
Halted |
0 ms |
0 KB |
- |