oj.uz

Submission #877509

# Submission time Handle Problem Language Result Execution time Memory
877509 2023-11-23T09:29:15 Z Beerus13 Bosses (BOI16_bosses) C++14
100 / 100
 419 ms 848 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 5e3 + 5;

int n;
vector<int> g[N];
ll  dp[N];

ll bfs(int u) {
    queue<int> q;
    memset(dp, 0, sizeof(dp));
    dp[u] = 1;
    q.push(u);
    while(q.size()) {
        int s = q.front(); q.pop();
        for(int t : g[s]) if(dp[t] == 0) {
            dp[t] = dp[s] + 1;
            q.push(t);
        }
    }
    ll res = 0;
    for(int i = 1; i <= n; ++i) {
        res += dp[i];
        if(dp[i] == 0) return 1e18;
    }
    return res;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; ++i) {
        int k, x; cin >> k;
        while(k--) {
            cin >> x;
            g[x].push_back(i);
        }
    }
    ll ans = 1e18;
    for(int i = 1; i <= n; ++i) ans = min(ans, bfs(i));
    cout << ans << '\n';
    return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 74 ms 708 KB Output is correct
15 Correct 4 ms 604 KB Output is correct
16 Correct 419 ms 788 KB Output is correct
17 Correct 410 ms 848 KB Output is correct
18 Correct 393 ms 604 KB Output is correct