oj.uz

Submission #540184

# Submission time Handle Problem Language Result Execution time Memory
540184 2022-03-19T15:25:29 Z status_coding Bosses (BOI16_bosses) C++14
100 / 100
 596 ms 716 KB 
#include <bits/stdc++.h>

using namespace std;

long long n,ans;
long long h[5005];
vector<int> v[5005];

long long solve(int p)
{
    for(int i=1;i<=n;i++)
        h[i]=-1;

    queue<pair<int, int>> q;
    q.push({p, 1});

    while(!q.empty())
    {
        int p = q.front().first;
        int len = q.front().second;
        q.pop();

        if(h[p] != -1)
            continue;

        h[p] = len;

        for(int it : v[p])
            if(h[it] == -1)
                q.push({it, len+1});
    }

    long long ans=0;
    for(int i=1;i<=n;i++)
    {
        if(h[i] == -1)
            return 1e18;
        ans += h[i];
    }

    return ans;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin>>n;
    for(int i=1;i<=n;i++)
    {
        int k;
        cin>>k;

        while(k)
        {
            k--;

            int x;
            cin>>x;

            v[x].push_back(i);
        }
    }

    long long ans=1e18;

    for(int i=1;i<=n;i++)
        ans=min(ans, solve(i));

    cout<<ans;
    return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 444 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 17 ms 468 KB Output is correct
13 Correct 12 ms 504 KB Output is correct
14 Correct 136 ms 572 KB Output is correct
15 Correct 7 ms 592 KB Output is correct
16 Correct 516 ms 664 KB Output is correct
17 Correct 596 ms 716 KB Output is correct
18 Correct 569 ms 716 KB Output is correct