제출 #958401

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
958401		IsaL	Bosses (BOI16_bosses)	C++17	100 / 100	1065 ms	924 KiB

bosses

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>

const int N = 5069;
const ll mod = 1e9 + 7;

int tc;
int n, sub[N], cn, tot, dp[N];
bool vis[N];
vector<int> al[N];

void dfs(int x)
{
    sub[x] = 1;
    vis[x] = 1;
    for(auto z : al[x])
    {
        if(dp[z] == 1 + dp[x] and !vis[z]) {
            dfs(z);
            sub[x] += sub[z];
        }
    }
    tot += sub[x];
}

signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int i, j;

    cin >> n;
    for(i = 1; i <= n; i++)
    {
        int k;
        cin >> k;
        for(j = 1; j <= k; j++)
        {
            int x;
            cin >> x;
            al[x].push_back(i);
        }
    }
    
    int ans = 1e18;
    for(i = 1; i <= n; i++)
    {
        cn = tot = 0;
        for(j = 1; j <= n; j++)
        {
            sub[j] = 0;
            vis[j] = 0;
            dp[j] = 0;
        }
        queue<int> q;
        q.push(i);
        dp[i] = 1;
        cn = 1;
        while(!q.empty())
        {
            int x = q.front();
            q.pop();
            for(auto z : al[x])
            {
                if(dp[z] == 0)
                {
                    dp[z] = dp[x] + 1;
                    ++cn;
                    q.push(z);
                }
            }
        }
        if(cn == n)
        {
            dfs(i);
            ans = min(ans, tot);
        }
    }
    cout << ans << '\n';
}

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