| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 68906 | alenam0161 | Bosses (BOI16_bosses) | C++17 | 782 ms | 952 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N = 5007;
vector<int> g[N],g1[N];
int dis[N];
int main()
{
    int n;
    scanf("%d",&n);
    pair<int,int> mb={-1e9,-1e9};
    for(int i=1;i<=n;++i){
		int k;
		scanf("%d",&k);
		for(int j=0;j<k;++j){
			int p;
			scanf("%d",&p);
			g[p].pb(i);
			mb=max(mb,{(int)g[p].size(),p});
		}
	}
	int ans=1e9;
	for(int i=1;i<=n;++i){
		if(g[i].size()==0)continue;
		queue<int> q;
		q.push(i);
		memset(dis,0,sizeof(dis));
		dis[i]=1;
		int hw=1;
		int cur=1;
		while(!q.empty()){
			int v=q.front();q.pop();
			for(auto to:g[v]){
				if(dis[to]>0)continue;
				q.push(to);
				dis[to]=dis[v]+1;
				hw++;
				cur+=dis[to];
			}
		}
		if(hw==n){
		//	cur=0;
		//	dfs(i);
			ans=min(ans,cur);
		}
	}
	cout<<ans<<endl;
    return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
