Submission #894714

# Submission time Handle Problem Language Result Execution time Memory
894714 2023-12-28T18:42:12 Z Pekiban Bosses (BOI16_bosses) C++17
100 / 100
451 ms 788 KB
#include <bits/stdc++.h>

using namespace std;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    vector<int> v[n];
    for (int i = 0; i < n; ++i) {
        int k;
        cin >> k;
        while (k--) {
            int u;
            cin >> u;
            u--;
            v[u].push_back(i);
        }
    }
    bitset<5000> bs;
    bs.reset();
    long long ans = 1e9;
    int dep[n];
    for (int i = 0; i < n; ++i) {
        bs.reset();
        queue<int> q;
        q.push(i);
        dep[i] = 1;
        long long sum = 1;
        bs[i] = 1;
        while (!q.empty()) {
            int s = q.front();
            q.pop();
            for (auto u : v[s]) {
                if (bs[u] == 0) {
                    bs[u] = 1;
                    q.push(u);
                    dep[u] = dep[s] + 1;
                    sum += dep[u];
                }
            }
        }
        for (int i = 0; i < n; ++i) {
            if (bs[i] == 0) {
                sum += 1e9;
            }
        }
        ans = min(ans, sum);
    }
    cout << ans << '\n';
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 344 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 344 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 173 ms 604 KB Output is correct
15 Correct 124 ms 684 KB Output is correct
16 Correct 451 ms 772 KB Output is correct
17 Correct 398 ms 788 KB Output is correct
18 Correct 396 ms 604 KB Output is correct