oj.uz

Submission #888928

# Submission time Handle Problem Language Result Execution time Memory
888928 2023-12-18T12:02:32 Z Perl32 Bosses (BOI16_bosses) C++14
100 / 100
 412 ms 808 KB 
//I wrote this code 4 u <3
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 42
#endif

const ll INF = (ll) 1e18 + 1e9;

signed main(int32_t argc, char *argv[]) {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<vector<int>> g(n);
    for (int i = 0; i < n; ++i) {
        int k;
        cin >> k;
        while (k--) {
            int par;
            cin >> par;
            g[par - 1].push_back(i);
        }
    }
    auto Bfs = [&](int u) -> ll {
        vector<ll> dist(n, INF);
        queue<int> que;
        dist[u] = 1;
        que.push(u);
        ll ret = 0;
        int used = 0;
        while (!que.empty()) {
            int v = que.front();
            ret += dist[v];
            used++;
            que.pop();
            for (auto to : g[v]) {
                if (dist[to] > dist[v] + 1) {
                    dist[to] = dist[v] + 1;
                    que.push(to);
                }
            }
        }
        if (used != n) {
            return INF;
        }
        return ret;
    };
    ll mn = INF;
    for (int i = 0; i < n; ++i) {
        mn = min(mn, Bfs(i));
    }
    cout << mn;
}

/*

 */

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 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 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 1 ms 344 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 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 1 ms 344 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 79 ms 708 KB Output is correct
15 Correct 10 ms 600 KB Output is correct
16 Correct 412 ms 604 KB Output is correct
17 Correct 392 ms 808 KB Output is correct
18 Correct 392 ms 600 KB Output is correct