oj.uz

Submission #676118

# Submission time Handle Problem Language Result Execution time Memory
676118 2022-12-29T11:19:19 Z sudheerays123 Bosses (BOI16_bosses) C++17
100 / 100
 653 ms 692 KB 
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
const ll N = 100+5 , INF = 1e18 , MOD = 1e9+7;

void solve(){

	ll n;
	cin >> n;

	vector<ll> adj[n+5];

	for(ll i = 1; i <= n; i++){
		ll x;
		cin >> x;

		for(ll j = 1; j <= x; j++){
			ll a;
			cin >> a;

			adj[a].push_back(i);
		}
	}

	ll ans = INF;

	for(ll root = 1; root <= n; root++){

		vector<ll> depth(n+5,-1);
		queue<ll> q;
		ll cost = 1 , cnt = 1;

		depth[root] = 1;
		q.push(root);

		while(q.size()){
			ll a = q.front();
			q.pop();

			for(auto u : adj[a]){
				if(depth[u] == -1){
					depth[u] = depth[a]+1;
					cost += depth[u];
					cnt++;
					q.push(u);
				}
			}
		}

		if(cnt == n) ans = min(ans,cost);
	}

	cout << ans;
}

int main(){

	fast;

	ll tc = 1;
	// cin >> tc;
	while(tc--) solve();

	return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 5 ms 460 KB Output is correct
13 Correct 4 ms 468 KB Output is correct
14 Correct 124 ms 596 KB Output is correct
15 Correct 7 ms 596 KB Output is correct
16 Correct 502 ms 692 KB Output is correct
17 Correct 653 ms 676 KB Output is correct
18 Correct 626 ms 676 KB Output is correct