oj.uz

Submission #484675

# Submission time Handle Problem Language Result Execution time Memory
484675 2021-11-05T03:13:51 Z phamhoanghiep Bosses (BOI16_bosses) C++14
100 / 100
 623 ms 648 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn=5005;
vector<int> AdjList[maxn];
int dist[maxn];
int n;
int bfs(int s) {
    //cout<<"bfs "<<s<<endl;
    int cnt=0;
    int ans=0;
    queue<int> q;
    q.push(s);
    dist[s]=1;
    while(!q.empty()) {
        int u=q.front();
        //cout<<"u = "<<u<<endl;
        q.pop();
        ans+=dist[u];
        cnt++;
        for(int v: AdjList[u]) {
            //cout<<"dist "<<v<<" = "<<dist[v]<<endl;
            if(!dist[v]) {
                dist[v]=dist[u]+1;
                //cout<<"push "<<v<<endl;
                q.push(v);
            }
        }
    }
    if(cnt!=n) return 5000*5000;
    else return ans;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin>>n;
    for(int i=1 ; i<=n ; i++) {
        int k,u;
        cin>>k;
        for(int j=1 ; j<=k ; j++) {
            cin>>u;
            AdjList[u].push_back(i);
            //cout<<"Adj "<<u<<" "<<i<<endl;
        }
    }
    int ans=5000*5000;
    for(int root=1 ; root<=n ; root++) {
        for(int i=1 ; i<=n ; i++) dist[i]=0;
        ans=min(ans,bfs(root));
    }
    cout<<ans;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 432 KB Output is correct
8 Correct 1 ms 424 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 432 KB Output is correct
8 Correct 1 ms 424 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 5 ms 460 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 109 ms 544 KB Output is correct
15 Correct 5 ms 460 KB Output is correct
16 Correct 473 ms 632 KB Output is correct
17 Correct 623 ms 648 KB Output is correct
18 Correct 579 ms 588 KB Output is correct