oj.uz

Submission #446744

# Submission time Handle Problem Language Result Execution time Memory
446744 2021-07-23T07:53:50 Z prvocislo Bosses (BOI16_bosses) C++17
0 / 100
 1 ms 204 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const int inf = 1e9 + 5;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<vector<int> > g(n);
    for (int i = 0; i < n; i++)
    {
        int d; cin >> d;
        for (int j = 0, x; j < d; j++)
        {
            cin >> x;
            g[--x].push_back(i);
        }
    }
    int ans = inf;
    for (int i = 0; i < n; i++)
    {
        queue<int> q; q.push(i);
        vector<int> d(n, inf); d[i] = 1;
        while (!q.empty())
        {
            int u = q.front(); q.pop();
            for (int v : g[u]) if (d[v] == inf) d[v] = d[u]+1, q.push(v);
        }
        int sum = 0;
        for (int j = 0; j < n; j++) sum += d[j];
        ans = min(ans, sum);
    }
    cout << ans << "\n";
    return 0;
}

Subtask #1
0 / 22.0

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

Subtask #2
0 / 45.0

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

Subtask #3
0 / 33.0

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