oj.uz

Submission #169115

# Submission time Handle Problem Language Result Execution time Memory
169115 2019-12-18T12:40:53 Z nafis_shifat Bosses (BOI16_bosses) C++14
100 / 100
 1216 ms 732 KB 
#include<bits/stdc++.h>
#define ll long long 
#define pii pair<int,int>
#define f first
#define s second
using namespace std;
const ll inf=2e9+10;
const int mxn=5e3+5;
vector<int> tree[mxn];
int n;
ll bfs(int root)
{
	ll dist[mxn];

	for(int i=0;i<mxn;i++)dist[i]=inf;


	queue<int> q;
	q.push(root);
	dist[root]=1;
	while(!q.empty())
	{
		int u=q.front();
		q.pop();

		for(int i:tree[u])
		{
			if(dist[i]==inf)q.push(i);
			dist[i]=min(dist[i],dist[u]+1);
		}

	}
	
	ll mx=-1;

	for(int i=1;i<=n;i++)mx=max(mx,dist[i]);
	if(mx==inf)return inf;
	ll cur=0;
	for(int i=1;i<=n;i++)cur+=dist[i];
	return cur;

	
}
int main()
{
	
	cin>>n;


	for(int i=1;i<=n;i++)
	{
		int k;
		cin>>k;
		for(int j=0;j<k;j++)
		{
			int v;
			cin>>v;
			tree[v].push_back(i);
		}
	}

	ll res=inf;





	for(int i=1;i<=n;i++)
	{    
	    res=min(res,bfs(i));
	}
	cout<<res<<endl;




	
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 488 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 508 KB Output is correct
11 Correct 3 ms 504 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 488 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 508 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 14 ms 504 KB Output is correct
13 Correct 12 ms 504 KB Output is correct
14 Correct 241 ms 624 KB Output is correct
15 Correct 44 ms 504 KB Output is correct
16 Correct 854 ms 708 KB Output is correct
17 Correct 1216 ms 728 KB Output is correct
18 Correct 1166 ms 732 KB Output is correct