Submission #1136472

#	Time	Username	Problem	Language	Result	Execution time	Memory
1136472		thelegendary08	Bosses (BOI16_bosses)	C++17	100 / 100	602 ms	1544 KiB

bosses

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
 
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in(n);
	vvi v(n);
	f0r(i,n){
		in(k);
		vin(w,k);
		f0r(i,k)w[i]--;
		v[i] = w;
	}
	vector<set<int>>nxt(n);
	f0r(i,n){
		for(auto u : v[i]){
			nxt[u].insert(i);
		}
	}
	int ans = 4e18;
	f0r(i,n){
		vb vis(n);
		vis[i] = 1;
		queue<int>q;
		q.push(i);
		vi dep(n);
		dep[i] = 1;
		
		while(!q.empty()){
			int node = q.front();
			q.pop();
			for(auto u : nxt[node]){
				if(vis[u])continue;
				vis[u] = 1;
				dep[u] = dep[node] + 1;
				q.push(u);
			}
		}
		bool ok = 1;
		f0r(i,n){
			if(!vis[i])ok = 0;
		}
		if(ok){
			ans = min(ans, accumulate(all(dep), 0LL));
		}
	}
	out(ans);
}

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