oj.uz

Submission #973270

# Submission time Handle Problem Language Result Execution time Memory
973270 2024-05-01T17:14:49 Z jadai007 Bosses (BOI16_bosses) C++17
100 / 100
 586 ms 800 KB 
#include<bits/stdc++.h>

using namespace std;

int n, vis[5050], k, u, ans = 1e9;
vector<int> vc[5050];
queue<pair<int, int>> q;

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n;
    for(int i = 1; i<=n; ++i){
        cin >> k;
        while(k--){
            cin >> u;
            vc[u].emplace_back(i);
        }
    }
    for(int i = 1; i<=n; ++i){
        int sum = 0, node = 0;
        memset(vis, 0, sizeof(vis));
        q.emplace(i, 1);
        while(!q.empty()){
            int u = q.front().first, w = q.front().second; q.pop();
            if(vis[u]) continue;
            vis[u] = 1;
            ++node;
            sum+=w;
            for(auto v:vc[u]) if(!vis[v]) q.emplace(v, w+1);
        }
        //cout << node << ' ' << sum << '\n';
        if(node == n) ans = min(ans, sum);
    }
    cout << ans;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 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 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 504 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 600 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 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 504 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 15 ms 600 KB Output is correct
13 Correct 11 ms 604 KB Output is correct
14 Correct 95 ms 604 KB Output is correct
15 Correct 3 ms 600 KB Output is correct
16 Correct 517 ms 800 KB Output is correct
17 Correct 586 ms 800 KB Output is correct
18 Correct 564 ms 604 KB Output is correct