oj.uz

Submission #970867

# Submission time Handle Problem Language Result Execution time Memory
970867 2024-04-27T12:11:47 Z starchan Bosses (BOI16_bosses) C++17
100 / 100
 435 ms 820 KB 
#include<bits/stdc++.h>
using namespace std;
#define int unsigned long long
#define in pair<int, int>
#define f first
#define s second
#define pb push_back
#define pob pop_back
#define INF (int)1e18
#define MX (int)5000+5
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL)
int n;
vector<int> poss_child[MX];
int solve(int u)
{
	queue<int> bfsq;
	vector<int> dist(n+1, INF);
	bfsq.push(u);
	dist[u] = 1;
	int ans = 0;
	while(bfsq.size())
	{
		int v = bfsq.front();
		bfsq.pop();
		ans+=dist[v];
		for(int k: poss_child[v])
		{
			if(dist[k] != INF)
				continue;
			dist[k] = dist[v]+1;
			bfsq.push(k);
		}
	}
	for(int i = 1; i <= n; i++)
	{
		if(dist[i] == INF)
			return INF;
	}
	return ans;
}
signed main()
{
	fast();
	cin >> n;
	for(int i = 1; i <= n; i++)
	{
		int k;
		cin >> k;
		while(k--)
		{
			int u;
			cin >> u;
			poss_child[u].pb(i);
		}
	}
	int ans = INF;
	for(int i = 1; i <= n; i++)
		ans = min(ans, solve(i));
	cout << ans << "\n";
	return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 344 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 0 ms 348 KB Output is correct
2 Correct 1 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 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 0 ms 348 KB Output is correct
2 Correct 1 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 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 3 ms 600 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 85 ms 604 KB Output is correct
15 Correct 10 ms 600 KB Output is correct
16 Correct 435 ms 604 KB Output is correct
17 Correct 428 ms 820 KB Output is correct
18 Correct 412 ms 604 KB Output is correct