제출 #1011670

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1011670		hengliao	Bosses (BOI16_bosses)	C++17	100 / 100	434 ms	1364 KiB

bosses

#include<bits/stdc++.h>
#include <chrono>
#include <random>
using namespace std;

#define F first
#define S second
#define pb push_back
#define vll vector<ll>
#define pll pair<ll, ll>
typedef long long ll;

const ll mxN=5005;
const ll inf=1e18;

vll adj[mxN];
ll k[mxN];
vll boss[mxN];
bool visited[mxN];

void solve(){
    ll n;
    cin>>n;
    for(ll i=1;i<=n;i++){
        cin>>k[i];
        for(ll j=0;j<k[i];j++){
            ll tep;
            cin>>tep;
            boss[i].pb(tep);
            adj[tep].pb(i);
        }
    }
    ll ans=inf;
    for(ll s=1;s<=n;s++){
        memset(visited, 0, sizeof(visited));
        queue<pll> q;
        q.push({s, 1});
        ll tans=0;
        while(!q.empty()){
            pll cur=q.front(); q.pop();
            if(visited[cur.F]) continue;
            visited[cur.F]=1;
            tans+=cur.S;
            for(auto &it:adj[cur.F]){
                q.push({it, cur.S+1});
            }
        }
        bool good=1;
        for(ll i=1;i<=n;i++){
            if(!visited[i]) good=0;
        }
        if(good) ans=min(ans, tans);
    }
    cout<<ans<<'\n';
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

	solve();
	return 0;
}

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