oj.uz

Submission #481734

# Submission time Handle Problem Language Result Execution time Memory
481734 2021-10-21T13:42:19 Z Rainbowbunny Bosses (BOI16_bosses) C++17
100 / 100
 593 ms 656 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 5005;

int n, ans;
int H[MAXN];
vector <int> Adj[MAXN];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ans = MAXN * MAXN;
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        int s;
        cin >> s;
        while(s--)
        {
            int a;
            cin >> a;
            Adj[a].push_back(i);
        }
    }
    for(int i = 1; i <= n; i++)
    {
        int tmp = 0, cnt = 0;
        queue <int> BFS;
        for(int j = 1; j <= n; j++)
        {
            H[j] = -1;
        }
        H[i] = 0;
        BFS.push(i);
        while(BFS.empty() == false)
        {
            int node = BFS.front();
            tmp += (H[node] + 1);
            cnt++;
            BFS.pop();
            for(auto x : Adj[node])
            {
                if(H[x] == -1)
                {
                    H[x] = H[node] + 1;
                    BFS.push(x);
                }
            }
        }
        if(cnt == n)
        {
            ans = min(ans, tmp);
        }
    }
    cout << ans << '\n';
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 432 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 4 ms 460 KB Output is correct
13 Correct 3 ms 440 KB Output is correct
14 Correct 108 ms 460 KB Output is correct
15 Correct 4 ms 460 KB Output is correct
16 Correct 460 ms 640 KB Output is correct
17 Correct 571 ms 588 KB Output is correct
18 Correct 593 ms 656 KB Output is correct