oj.uz

Submission #218098

# Submission time Handle Problem Language Result Execution time Memory
218098 2020-04-01T07:53:35 Z Alexa2001 Bosses (BOI16_bosses) C++17
100 / 100
 743 ms 760 KB 
#include <bits/stdc++.h>

using namespace std;

///10:45

typedef long long ll;
const int Nmax = 5005;

vector<int> v[Nmax];
int n, d[Nmax];


ll solve(int start)
{
    queue<int> q;
    memset(d, 0, sizeof(d));

    q.push(start);
    d[start] = 1;

    ll ans = 1;
    int nr = 1;

    while(q.size())
    {
        int node = q.front();
        q.pop();

        for(auto it : v[node])
            if(!d[it])
            {
                ++nr;
                d[it] = d[node] + 1;
                ans += d[it];
                q.push(it);
            }
    }
    if(nr != n) return LLONG_MAX;
    return ans;
}

int main()
{
 //   freopen("input", "r", stdin);
    cin.sync_with_stdio(false); cin.tie(0);

    cin >> n;

    int i;
    for(i=1; i<=n; ++i)
    {
        int nr;
        cin >> nr;
        while(nr--)
        {
            int x;
            cin >> x;
            v[x].push_back(i);
        }
    }

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

    cout << ans << '\n';

    return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 11 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 9 ms 640 KB Output is correct
13 Correct 8 ms 640 KB Output is correct
14 Correct 130 ms 640 KB Output is correct
15 Correct 10 ms 640 KB Output is correct
16 Correct 568 ms 724 KB Output is correct
17 Correct 743 ms 748 KB Output is correct
18 Correct 717 ms 760 KB Output is correct