제출 #374025

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
374025		ritul_kr_singh	Bosses (BOI16_bosses)	C++17	0 / 100	1 ms	384 KiB

bosses

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

vector<vector<int>> g;
vector<bool> vis;

pair<int, int> dfs(int u){
    vis[u] = true;
    pair<int, int> res0 = {1, 0}, res1;
    for(int v : g[u]){
        if(!vis[v]){
            res1 = dfs(v);
            res0.second += res1.second;
            res0.first += res1.first;
        }
    }
    res0.second += res0.first;
    return res0;
}

signed main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int n; cin >> n;
    g.resize(n);
    for(int i=0; i<n; ++i){
        int k; cin >> k;
        for(int j=0; j<k; ++j){
            int x; cin >> x;
            g[x-1].push_back(i);
        }
    }
    int ans = 1e18;
    for(int root=0; root<n; ++root){
        vis.assign(n, false);
        pair<int, int> res = dfs(root);
        for(int i=0; i<n; ++i) if(!vis[i]) continue;
        ans = min(ans, res.second);
    }
    cout << ans nl;
}

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