oj.uz

Submission #476141

# Submission time Handle Problem Language Result Execution time Memory
476141 2021-09-25T00:47:36 Z thiago_bastos Bosses (BOI16_bosses) C++17
100 / 100
 711 ms 660 KB 
#include "bits/stdc++.h"

using namespace std;

using i64 = long long;
using u64 = unsigned long long;
using i32 = int;
using u32 = unsigned;
using i16 = short;
using u16 = unsigned short;
using ld = long double;
using ii = pair<int, int>;

void solve() {

	int n;
	
	cin >> n;
	
	vector<vector<int>> g(n);
	vector<int> dist(n);
	i64 ans = LLONG_MAX;
	
	for(int i = 0; i < n; ++i) {
		int deg;
		cin >> deg;
		while(deg--) {
			int p;
			cin >> p;
			g[p - 1].push_back(i);
		}
	}
	
	for(int v = 0; v < n; ++v) {
		fill(dist.begin(), dist.end(), -1);
		
		queue<int> q;
		i64 sum_dist = 0;
		int vis = 0;
		
		q.push(v);
		dist[v] = 1;
		
		while(!q.empty()) {
			int v = q.front();
			q.pop();
			++vis;
			sum_dist += dist[v];
			for(int u : g[v]) {
				if(dist[u] != -1) continue;
				dist[u] = 1 + dist[v];
				q.push(u);
			}
		}
		
		if(vis == n) ans = min(ans, sum_dist);
	}
	
	cout << ans << '\n';
}

int main() {
	ios_base :: sync_with_stdio(false);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t--) solve();
 	return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 5 ms 444 KB Output is correct
13 Correct 4 ms 336 KB Output is correct
14 Correct 126 ms 540 KB Output is correct
15 Correct 5 ms 460 KB Output is correct
16 Correct 563 ms 632 KB Output is correct
17 Correct 711 ms 660 KB Output is correct
18 Correct 710 ms 652 KB Output is correct