Submission #1298184

#TimeUsernameProblemLanguageResultExecution timeMemory
1298184kawhietBosses (BOI16_bosses)C++20
100 / 100
431 ms780 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long

constexpr int inf = 1e15;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<vector<int>> a(n);
    for (int i = 0; i < n; i++) {
        int m;
        cin >> m;
        while (m--) {
            int k;
            cin >> k;
            k--;
            a[k].push_back(i);
        }
    }
    int ans = inf;
    for (int r = 0; r < n; r++) {
        queue<int> q; q.push(r);
        vector<int> d(n, inf); d[r] = 1;
        vector<bool> vis(n); vis[r] = 1;
        while (!q.empty()) {
            int i = q.front(); q.pop();
            for (auto j : a[i]) {
                if (!vis[j]) {
                    d[j] = d[i] + 1;
                    vis[j] = 1;
                    q.push(j);
                }
            }
        }
        int res = accumulate(d.begin(), d.end(), 0LL);
        ans = min(ans, res);
    }
    cout << ans << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...