oj.uz

Submission #946295

# Submission time Handle Problem Language Result Execution time Memory
946295 2024-03-14T13:26:33 Z parsadox2 Bosses (BOI16_bosses) C++17
100 / 100
 392 ms 848 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 5e3 + 10;
int n , dis[N] , ans;
vector <int> adj[N];
bool marked[N];

void Solve(int star)
{
	for(int i = 1 ; i <= n ; i++)
		marked[i] = false;
	queue <int> q;
	marked[star] = true;
	dis[star] = 1;
	q.push(star);
	int cnt = n , tmp = 0;
	while(!q.empty())
	{
		int v = q.front();  q.pop();
		tmp += dis[v];
		cnt--;
		for(auto u : adj[v])  if(!marked[u])
		{
			marked[u] = true;
			q.push(u);
			dis[u] = dis[v] + 1;
		}
	}
	if(cnt == 0)
		ans = min(ans , tmp);
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);  cout.tie(0);
	cin >> n;
	for(int i = 1 ; i <= n ; i++)
	{
		int k;  cin >> k;
		while(k--)
		{
			int x;  cin >> x;
			adj[x].push_back(i);
		}
	}
	ans = N * N;
	for(int i = 1 ; i <= n ; i++)
		Solve(i);
	cout << ans << '\n';
	return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 4 ms 600 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 75 ms 604 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 392 ms 772 KB Output is correct
17 Correct 386 ms 600 KB Output is correct
18 Correct 383 ms 848 KB Output is correct