oj.uz

Submission #884276

# Submission time Handle Problem Language Result Execution time Memory
884276 2023-12-07T05:48:10 Z vjudge1 Bosses (BOI16_bosses) C++17
0 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>
#define pb push_back
using namespace std;

const int N = 5e3 + 10, INF = 1e9;

int n, ans = INF;
vector<int> G[N];

void bfs(int v) {
    queue<int> q;
    vector<int> h(N, INF), H(N, 0);
    int res = 0, ps = 0;
    h[v] = 0;
    q.push(v);
    while (q.size()) {
        int u = q.front();
        q.pop();
        for (auto e : G[u])
            if (h[u] + 1 < h[e]) {
                h[e] = h[u] + 1;
                q.push(e);
            }
    }
    for (int i = 0; i < n; i++) {
        if (h[i] == INF) continue;
        H[h[i]]++;
    }
    for (int i = n; i >= 0; i--)
        ps += H[i], res += ps;
    ans = min(ans, res);
}

int main() {
    ios:: sync_with_stdio(0), cin.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++) {
        int m, x;
        cin >> m;
        for (int j = 0; j < m; j++) {
            cin >> x;
            G[--x].pb(i);
        }
    }
    for (int i = 0; i < n; i++) bfs(i);
    cout << ans << '\n';
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Incorrect 0 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Incorrect 0 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Incorrect 0 ms 604 KB Output isn't correct
4 Halted 0 ms 0 KB -