제출 #814417

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
814417		burythelightdeepwithin	Bosses (BOI16_bosses)	C++14	100 / 100	917 ms	980 KiB

bosses

#include <bits/stdc++.h>

using namespace std;

const int N = 5003;

vector <int> adj[N], adj2[N];
int vs[N], sz[N], ans, tmp = 1e9+7, n;
queue <int> q;

void bfs(){
    while(!q.empty()){
        int u = q.front();
        vs[u] = 1;
        //cout << "BFS " << u << endl;
        q.pop();
        for (auto v: adj[u]){
            if (!vs[v]){
                q.push(v);
                adj2[u].push_back(v);
                vs[v] = 1;
            }
        }
    }
    //cout << endl;
}

void dfs(int u, int par){
    sz[u]++;
    for (auto v: adj2[u]){
        if (v != par){
            dfs(v, u);
            sz[u] += sz[v];
        }
    }
    ans += sz[u];
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++){
        int m;
        cin >> m;
        for (int j = 1; j <= m; j++){
            int x;
            cin >> x;
            adj[x].push_back(i);
        }
    }
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= n; j++){
            vs[j] = 0;
            sz[j] = 0;
            adj2[j].clear();
        }
        q.push(i);
        bfs();
        bool able = true;
        for (int j = 1; j <= n; j++){
            if (!vs[j]){
                able = 0;
            }
        }
        if (!able){
            continue;
        }
        ans = 0;
        dfs(i, i);
        tmp = min(tmp, ans);
        //cout << ans << " WHAT\n";
    }
    cout << tmp;
}

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