제출 #374040

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
374040		ritul_kr_singh	Bosses (BOI16_bosses)	C++17	67 / 100	1573 ms	1016 KiB

bosses

//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sp << " " <<
#define nl << "\n"

vector<vector<int>> g0, g1;
vector<bool> vis;
ll totalSum;

ll dfs(int u){
    ll res = 1;
    for(int v : g1[u]) res += dfs(v);
    totalSum += res;
    return res;
}

signed main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int n; cin >> n;
    g0.resize(n);
    g1.resize(n);
    vis.resize(n);
    for(int i=0; i<n; ++i){
        int k; cin >> k;
        for(int j=0; j<k; ++j){
            int x; cin >> x;
            g0[x-1].push_back(i);
        }
    }
    ll ans = 1e18;
    for(int root=0; root<n; ++root){
        for(int i=0; i<n; ++i) vis[i] = false;
        for(int i=0; i<n; ++i) g1[i].clear();
        queue<int> q;
        q.push(root);
        vis[root] = true;
        while(!q.empty()){
            int u = q.front(); q.pop();
            for(int v : g0[u]){
                if(!vis[v]){
                    vis[v] = true;
                    q.emplace(v);
                    g1[u].push_back(v);
                }
            }
        }
        bool ok = true;
        for(int i=0; i<n; ++i){
            if(!vis[i]) ok = false;
        }
        if(!ok) continue;
        totalSum = 0;
        dfs(root);
        ans = min(ans, totalSum);
    }
    cout << ans nl;
}

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