제출 #531137

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
531137		OttoTheDino	Bosses (BOI16_bosses)	C++17	100 / 100	581 ms	708 KiB

bosses

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

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;

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

    int n; cin >> n;
    vi adj[n+1];

    rep (i,1,n) {
        int k; cin >> k;
        rep (j,1,k) {
            int x; cin >> x;
            adj[x].pb(i);
        }
    }

    int ans = 1e9;

    rep (i,1,n) {
        int d[n+1] = {};
        d[i] = 1;
        queue<int> q;
        q.push(i);
        while (!q.empty()) {
            int u = q.front();
            q.pop();
            for (int v : adj[u]) {
                if (!d[v]) {
                    d[v] = d[u]+1;
                    q.push(v);
                }
            }
        }
        int suc = 1, sum = 0;
        rep (j,1,n) {
            sum += d[j];
            suc &= (d[j]>0);
        }

        if (suc) ans = min(ans, sum);
    }

    cout << ans << "\n";
    
    return 0;
}

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