제출 #739651

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
739651		n0sk1ll	Bosses (BOI16_bosses)	C++17	100 / 100	499 ms	652 KiB

bosses

#include <bits/stdc++.h>

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;







//Note to self: Check for overflow

graph g(5003);
bool vis[5003];

int ans=mod;

int do_bfs(int p, int n)
{
    fff(i,1,n) vis[i]=false;
    int proso=0;
    int cur=0;

    queue<pii> bfs;
    bfs.push({p,1});
    while (!bfs.empty())
    {
        auto [p,d]=bfs.front();
        bfs.pop();
        if (vis[p]) continue;

        vis[p]=true;
        proso++;
        cur+=d;

        for (auto it : g[p])
            bfs.push({it,d+1});
    }

    if (proso==n) return cur;
    return mod;
}

int main()
{
    FAST;

    int n; cin>>n;
    fff(i,1,n)
    {
        int kolko; cin>>kolko;
        while (kolko--)
        {
            int zelim; cin>>zelim;
            g[zelim].pb(i);
        }
    }

    fff(i,1,n)
    {
        int temp=do_bfs(i,n);
        ans=min(ans,temp);
    }

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

//Note to self: Check for overflow

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