Submission #234000

#	Time	Username	Problem	Language	Result	Execution time	Memory
234000		DS007	Bosses (BOI16_bosses)	C++14	100 / 100	764 ms	888 KiB

bosses

#include <bits/stdc++.h>
using namespace std;
#define int long long

const int N = 5000;
vector<int> adj[N];
bool explored[N];
int dist[N];
int n, c;

int solveTestCase(int test) {
    cin >> n;
    for (int i = 0; i < n; i++) {
        int k, v;
        cin >> k;
        while (k--) {
            cin >> v;
            adj[v - 1].push_back(i);
        }
    }

    int ans = 1e18;
    for (int i = 0; i < n; i++) {
        fill(dist, dist + N, 1e18);
        fill(explored, explored + N, false);
        int val = 1;
        dist[i] = 1;
        explored[i] = true;

        queue<int> q;
        q.push(i);
        c = 1;

        while (!q.empty()) {
            int v = q.front();
            q.pop();

            for (int j : adj[v]) {
                if (!explored[j])
                    dist[j] = dist[v] + 1, val += dist[j], q.push(j), explored[j] = true, c++;
            }
        }

        if (c == n)
            ans = min(ans, val);
    }

    cout << ans;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int test = 1;
    //cin >> test;
    for (int i = 1; i <= test; i++)
        solveTestCase(i);
}

Compilation message (stderr)

bosses.cpp: In function 'long long int solveTestCase(long long int)':
bosses.cpp:49:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

• Subtask 1: 22 / 22
• Subtask 2: 45 / 45
• Subtask 3: 33 / 33