oj.uz

Submission #962587

# Submission time Handle Problem Language Result Execution time Memory
962587 2024-04-13T22:04:51 Z shezitt Bosses (BOI16_bosses) C++14
100 / 100
 483 ms 1112 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <queue>

using namespace std;

using ll = long long;

#define int ll
#define fore(i, a, b) for(int i=a; i<b; ++i)
#define endl '\n'
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define pb push_back
#define ii pair<int,int>
#define vi vector<int>

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;

    vector<vi> k(n);

    vector<vi> adj(n);

    fore(i, 0, n){
        int tam;
        cin >> tam;
        k[i].resize(tam);
        fore(j, 0, tam){
            cin >> k[i][j]; 
            k[i][j]--;
            adj[k[i][j]].pb(i);
        }
    }

    int ans = 1e9;

    vi depth(n, -1);

    fore(root, 0, n){

        auto bfs = [&](int i) -> int {
            depth.assign(n, -1);
            int res = 0;
            queue<int> q;
            q.push(i);
            depth[i] = 1;
            while(sz(q)){
                int cur = q.front(); q.pop();
                res += depth[cur];
                for(int v : adj[cur]){
                    if(depth[v] == -1){
                        depth[v] = depth[cur] + 1;
                        q.push(v);
                    }
                }
            }
            return res;
        };

        int tmp = bfs(root);

        bool ok = 1;
        fore(i, 0, n){
            ok &= depth[i] > -1;
        }

        if(ok){
            ans = min(ans, tmp);
        }

    }

    cout << ans << endl;

}

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 456 KB Output is correct
5 Correct 1 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 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 456 KB Output is correct
5 Correct 1 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 1 ms 344 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 456 KB Output is correct
5 Correct 1 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 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 4 ms 600 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 99 ms 988 KB Output is correct
15 Correct 19 ms 860 KB Output is correct
16 Correct 460 ms 1112 KB Output is correct
17 Correct 479 ms 1092 KB Output is correct
18 Correct 483 ms 1092 KB Output is correct