oj.uz

Submission #1072860

# Submission time Handle Problem Language Result Execution time Memory
1072860 2024-08-24T05:56:02 Z Jarif_Rahman Bosses (BOI16_bosses) C++17
100 / 100
 390 ms 764 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

vector<int> bfs(const vector<vector<int>> &graph, int source){
    int n = graph.size();
    vector<int> dis(n, -1);
    queue<int> Q;
    dis[source] = 0;
    Q.push(source);
    
    while(!Q.empty()){
        int nd = Q.front();
        Q.pop();
        for(int x: graph[nd]) if(dis[x] == -1){
            dis[x] = dis[nd]+1;
            Q.push(x);
        }
    }

    return dis;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n; cin >> n;
    vector<vector<int>> graph(n);
    for(int i = 0; i < n; i++){
        int k; cin >> k;
        while(k--){
            int p; cin >> p; p--;
            graph[p].push_back(i);
        }
    }

    int ans = 1e9;
    for(int i = 0; i < n; i++){
        auto dis = bfs(graph, i);
        int cur = n;
        for(int x: dis){
            if(x == -1){
                cur = 1e9;
                break;
            }
            cur+=x;
        }
        ans = min(ans, cur);
    }

    cout << ans << "\n";
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 760 KB Output is correct
2 Correct 0 ms 344 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 348 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 760 KB Output is correct
2 Correct 0 ms 344 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 348 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 760 KB Output is correct
2 Correct 0 ms 344 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 348 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 3 ms 448 KB Output is correct
14 Correct 58 ms 680 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 390 ms 764 KB Output is correct
17 Correct 357 ms 600 KB Output is correct
18 Correct 369 ms 604 KB Output is correct