oj.uz

Submission #739130

# Submission time Handle Problem Language Result Execution time Memory
739130 2023-05-10T03:04:58 Z josanneo22 Bosses (BOI16_bosses) C++17
100 / 100
 718 ms 684 KB 
#include<bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
#define fi first
#define se second
int n;
vector<vector<int>> adj(5005);
int bfs(int root){
    vector<int>d(n+1,0),vis(n+1,0);
    queue<int> q;
    q.push(root);
    vis[root]=1; d[root]=1;
    while(q.size()){
        int u=q.front();q.pop();
        for(auto&v:adj[u]){
            if(vis[v]==0){
                vis[v]=1;
                d[v]=d[u]+1;
                q.push(v);
            }
        }
    }
    for(int i=1;i<=n;i++){
        if(vis[i]==0) return INT_MAX;
    }
    return accumulate(d.begin(),d.end(),0);
}
void solve(){
    cin>>n;
    for(int i=1;i<=n;i++){
        int k; cin>>k;
        for(int j=0;j<k;j++){
            int a; cin>>a;
            adj[a].pb(i);
        }
    }
    int ans=INT_MAX;
    for(int i=1;i<=n;i++){
        int f=bfs(i);
        ans=min(ans,f);
    }
    cout<<ans<<'\n';
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    solve();
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 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 440 KB Output is correct
10 Correct 1 ms 436 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 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 440 KB Output is correct
10 Correct 1 ms 436 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 137 ms 468 KB Output is correct
15 Correct 8 ms 596 KB Output is correct
16 Correct 533 ms 664 KB Output is correct
17 Correct 718 ms 684 KB Output is correct
18 Correct 712 ms 680 KB Output is correct