oj.uz

Submission #977496

# Submission time Handle Problem Language Result Execution time Memory
977496 2024-05-08T05:07:16 Z JungPS Bosses (BOI16_bosses) C++14
100 / 100
 411 ms 764 KB 
#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<utility>
using namespace std;

vector<int> vec[5007];
bool visited[5007];
long long cost;
int cnt;

void bfs(int x){
    queue<pair<int,int>> q;
    q.push({x,1});
    visited[x]=true;
    while(!q.empty()){
        int node=q.front().first;
        int cs=q.front().second;
        ++cnt;
        q.pop();
        cost+=cs;
        for(auto i:vec[node]){
            if(visited[i]) continue;
            visited[i]=true;
            q.push({i,cs+1});
        }
    }
}
int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    int n; cin >> n;
    for(int i=1;i<=n;++i){
        int m; cin >> m;
        while(m--){
            int x; cin >> x;
            vec[x].push_back(i);
        }
    }

    long long ans=1e18;
    for(int i=1;i<=n;++i){
        memset(visited,false,sizeof(visited));
        cost=0; cnt=0;
        bfs(i);
        if(cnt!=n) continue;
        ans=min(ans,cost);
    }
    cout << ans;
}

Subtask #1
22.0 / 22.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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
45.0 / 45.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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #3
33.0 / 33.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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 672 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 99 ms 632 KB Output is correct
15 Correct 2 ms 764 KB Output is correct
16 Correct 411 ms 600 KB Output is correct
17 Correct 393 ms 720 KB Output is correct
18 Correct 389 ms 720 KB Output is correct