oj.uz

Submission #950419

# Submission time Handle Problem Language Result Execution time Memory
950419 2024-03-20T09:37:48 Z LucaIlie Bosses (BOI16_bosses) C++17
100 / 100
 401 ms 772 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 5000;
vector<int> employees[MAX_N + 1];
bool vis[MAX_N + 1];
int depth[MAX_N + 1];

int main() {
    int n;

    cin >> n;
    for ( int u = 1; u <= n; u++ ) {
        int k;
        cin >> k;
        for ( int i = 0; i < k; i++ ) {
            int v;
            cin >> v;
            employees[v].push_back( u );
        }
    }

    int minCost = n * n;
    for ( int s = 1; s <= n; s++ ) {
        queue<int> q;

        for ( int v = 1; v <= n; v++ ) {
            depth[v] = 0;
            vis[v] = false;
        }

        int steps = 0;
        vis[s] = true;
        depth[s] = 1;
        q.push( s );
        while ( !q.empty() ) {
            int u = q.front();
            q.pop();
            steps++;

            for ( int v: employees[u] ) {
                if ( !vis[v] ) {
                    vis[v] = true;
                    depth[v] = depth[u] + 1;
                    q.push( v );
                }
            }
        }

        if ( steps < n )
            continue;
        
        int cost = 0;
        for ( int v = 1; v <= n; v++ )
            cost += depth[v];
        minCost = min( minCost, cost );
    }

    cout << minCost;

    return 0;
}

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 560 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 560 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 344 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 560 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 4 ms 676 KB Output is correct
14 Correct 70 ms 604 KB Output is correct
15 Correct 4 ms 604 KB Output is correct
16 Correct 401 ms 764 KB Output is correct
17 Correct 387 ms 600 KB Output is correct
18 Correct 390 ms 772 KB Output is correct