제출 #442846

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
442846		palilo	Bosses (BOI16_bosses)	C++17	100 / 100	709 ms	628 KiB

bosses

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

template <class T>
bool chmin(T& _old, T _new) { return _old > _new && (_old = _new, true); }
template <class T>
bool chmax(T& _old, T _new) { return _old < _new && (_old = _new, true); }

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
#ifdef palilo
    freopen("in", "r", stdin);
    freopen("out", "w", stdout);
#endif
    int n;
    cin >> n;
    vector<vector<int>> adj(n);
    for (int v = 0, u, k; v < n; ++v) {
        for (cin >> k; k--;) {
            cin >> u, --u;
            adj[u].emplace_back(v);
        }
    }
    vector<int> dist(n);
    queue<int> q;
    auto solve = [&](int root) -> int {
        fill(dist.begin(), dist.end(), 0);
        dist[root] = 1;
        q.emplace(root);
        while (!q.empty()) {
            const auto u = q.front();
            q.pop();
            for (const auto& v : adj[u]) {
                if (!dist[v]) {
                    dist[v] = dist[u] + 1;
                    q.emplace(v);
                }
            }
        }
        if (all_of(dist.begin(), dist.end(), [&](const auto& x) { return x; })) {
            return accumulate(dist.begin(), dist.end(), 0);
        } else {
            return INT_MAX;
        }
    };
    int ans = INT_MAX;
    for (int i = 0; i < n; ++i) {
        chmin(ans, solve(i));
    }
    assert(ans != INT_MAX);
    cout << ans;
}

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