oj.uz

Submission #373924

# Submission time Handle Problem Language Result Execution time Memory
373924 2021-03-06T06:26:38 Z Aryan_Raina Bosses (BOI16_bosses) C++14
100 / 100
 744 ms 876 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define ld long double
#define ar array

const int INF = 1e15;
const int MOD = 1e9+7;

const int MXN = 5005;

vector<int> g[MXN];
int n;

int bfs(int rt) {
    vector<int> d(n, -1);
    queue<int> q;
    q.push(rt);
    d[rt] = 1;
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (int v : g[u]) if (d[v] == -1) {
            d[v] = d[u]+1;
            q.push(v);
        }
    }
    int ans = 0;
    for (int i = 0; i < n; i++) {
        if (d[i] == -1) return INF;
        ans += d[i];
    }
    return ans;
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>n;
    for (int i = 0; i < n; i++) {
        int x; cin>>x;
        while (x--) {
            int j; cin>>j; --j;
            g[j].push_back(i);
        }
    }
    int ans = INF;
    for (int i = 0; i < n; i++) ans = min(ans, bfs(i));
    cout<<ans<<"\n";
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 5 ms 620 KB Output is correct
13 Correct 3 ms 620 KB Output is correct
14 Correct 139 ms 648 KB Output is correct
15 Correct 15 ms 620 KB Output is correct
16 Correct 592 ms 748 KB Output is correct
17 Correct 741 ms 748 KB Output is correct
18 Correct 744 ms 876 KB Output is correct