Submission #292192

# Submission time Handle Problem Language Result Execution time Memory
292192 2020-09-06T13:40:57 Z fadi57 Bosses (BOI16_bosses) C++14
100 / 100
1085 ms 24568 KB

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 ll n,m,k;
 const int mx=1000000;

const int MOD=1000000007;

//fast exponentiation
int visited[100000];


vector<int>edges[mx];
ll co=0;
ll bfs(int s){
    
    queue<pair<int,int>>q;
    q.push({1,s}); 
    ll sum=0;
    while(!q.empty()){
        pair<int,int>me=q.front();
        q.pop();
        int node=me.second;
        sum+=me.first;
        co++;
        visited[node]=1;
        
        for(int i=0;i<edges[node].size();i++){
            if(!visited[edges[node][i]]){
                q.push({me.first+1,edges[node][i]});
                 visited[edges[node][i]]=1;
            }
            
        }
        
    }if(co==n){return sum;}else{return 1e9;}
    
    
    
    
    
    
    
    
    
}
int main() {
    /*freopen("poetry.in" , "r" , stdin) ;
    freopen("poetry.out" , "w" , stdout) ;
    */
cin>>n;
for(int i=1;i<=n;i++){
    int k;cin>>k;
    for(int j=0;j<k;j++){
        ll y;
            cin>>y; 
            edges[y].push_back(i);
            
    }

}

ll ans=1e9;
for(int i=1;i<=n;i++){
    memset(visited,0,sizeof(visited));
    co=0;  
    ll an=bfs(i);
    if(co==n){ans=min(ans,an);}
  
   // cout<<co<<endl;
    

}
cout<<ans;

}

Compilation message

bosses.cpp: In function 'll bfs(int)':
bosses.cpp:30:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         for(int i=0;i<edges[node].size();i++){
      |                     ~^~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 17 ms 24192 KB Output is correct
2 Correct 17 ms 24192 KB Output is correct
3 Correct 17 ms 24192 KB Output is correct
4 Correct 19 ms 24192 KB Output is correct
5 Correct 17 ms 24184 KB Output is correct
6 Correct 17 ms 24192 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 17 ms 24192 KB Output is correct
2 Correct 17 ms 24192 KB Output is correct
3 Correct 17 ms 24192 KB Output is correct
4 Correct 19 ms 24192 KB Output is correct
5 Correct 17 ms 24184 KB Output is correct
6 Correct 17 ms 24192 KB Output is correct
7 Correct 18 ms 24232 KB Output is correct
8 Correct 18 ms 24192 KB Output is correct
9 Correct 17 ms 24320 KB Output is correct
10 Correct 18 ms 24192 KB Output is correct
11 Correct 19 ms 24192 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 17 ms 24192 KB Output is correct
2 Correct 17 ms 24192 KB Output is correct
3 Correct 17 ms 24192 KB Output is correct
4 Correct 19 ms 24192 KB Output is correct
5 Correct 17 ms 24184 KB Output is correct
6 Correct 17 ms 24192 KB Output is correct
7 Correct 18 ms 24232 KB Output is correct
8 Correct 18 ms 24192 KB Output is correct
9 Correct 17 ms 24320 KB Output is correct
10 Correct 18 ms 24192 KB Output is correct
11 Correct 19 ms 24192 KB Output is correct
12 Correct 28 ms 24320 KB Output is correct
13 Correct 25 ms 24448 KB Output is correct
14 Correct 345 ms 24440 KB Output is correct
15 Correct 92 ms 24320 KB Output is correct
16 Correct 915 ms 24568 KB Output is correct
17 Correct 1085 ms 24568 KB Output is correct
18 Correct 1078 ms 24568 KB Output is correct