oj.uz

Submission #971326

# Submission time Handle Problem Language Result Execution time Memory
971326 2024-04-28T11:21:30 Z detectivebowon Bosses (BOI16_bosses) C++17
100 / 100
 579 ms 796 KB 
#include <bits/stdc++.h>
#define ep emplace
#define epb emplace_back
#define int long long
using namespace std;
int n, va[5007], mn = LLONG_MAX, value;
vector<int> adj[5007];
bool visited[5007];
queue<pair<int,int>> q;
signed main()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        int num;
        cin >> num;
        while (num--)
        {
            int v;
            cin >> v;
            adj[v].epb(i);
        }
    }
    for (int i = 1; i <= n; i++)
    {
        q.push({1, i});
        int sum = 0, cnt = 0;
        memset(visited, 0, sizeof(visited));
        while (!q.empty())
        {
            int u = q.front().second, cost = q.front().first;
            q.pop();
            if (visited[u])
                continue;
            visited[u] = true;
            sum += cost;
            cnt++;
            for (auto v : adj[u])
                if (!visited[v])
                    q.push({cost + 1, v});
        }
        if (cnt == n)
            mn = min(mn, sum);
    }
    cout << mn;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 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 17 ms 604 KB Output is correct
13 Correct 13 ms 600 KB Output is correct
14 Correct 114 ms 668 KB Output is correct
15 Correct 3 ms 600 KB Output is correct
16 Correct 506 ms 796 KB Output is correct
17 Correct 570 ms 772 KB Output is correct
18 Correct 579 ms 772 KB Output is correct