oj.uz

Submission #529391

# Submission time Handle Problem Language Result Execution time Memory
529391 2022-02-23T00:40:56 Z KoD Bosses (BOI16_bosses) C++17
100 / 100
 647 ms 652 KB 
#include <bits/stdc++.h>

using std::vector;
using std::array;
using std::tuple;
using std::pair;

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int N;
    std::cin >> N;
    vector<vector<int>> child(N);
    for (int i = 0; i < N; ++i) {
        int k;
        std::cin >> k;
        while (k--) {
            int p;
            std::cin >> p;
            child[p - 1].push_back(i);
        }
    }
    
    int ans = std::numeric_limits<int>::max();
    for (int root = 0; root < N; ++root) {
        vector<int> dist(N, -1);
        std::queue<int> que;
        const auto push = [&](const int u, const int d) {
            if (dist[u] == -1) {
                dist[u] = d;
                que.push(u);
            }
        };
        push(root, 1);
        while (!que.empty()) {
            const int u = que.front();
            que.pop();
            for (const int v : child[u]) {
                push(v, dist[u] + 1);
            }
        }
        int sum = 0;
        for (const int x : dist) {
            if (x == -1) {
                sum = -1;
                break;
            }
            sum += x;
        }
        if (sum != -1) {
            ans = std::min(ans, sum);
        }
    }

    std::cout << ans << '\n';
    return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 308 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 6 ms 332 KB Output is correct
13 Correct 3 ms 440 KB Output is correct
14 Correct 113 ms 544 KB Output is correct
15 Correct 5 ms 568 KB Output is correct
16 Correct 489 ms 632 KB Output is correct
17 Correct 593 ms 588 KB Output is correct
18 Correct 647 ms 652 KB Output is correct